The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In Multi Hop Wireless Networks (MHWNs), nodes act both as end-hosts as well as intermediate routers. When communication occurs, these nodes form chains between different sources and destinations. Researchers have studied how these chains behave, discovering that MAC level interactions play a major role in determining their performance. In this paper, we extend this analysis to study how TCP connections,...
In wireless networks utilizing half-duplex transceivers, a mechanism is required to inform a sender of the outcome of its transmission. Traditionally, such feedback comes from the receiver. This approach cannot distinguish between a failure due to a collision at the receiver and a failure due to the receiver moving out of range. To address this problem we propose cooperative signalling, where nodes...
Focusing on densely deployed wireless sensor networks, this paper presents a novel method for joint source-channel-network coding of distributed correlated sources through multiple access relay channels. In such networks, the role of intermediate sensors as relay nodes permits to achieve enhanced end-to-end error performance and increased spatial diversity in presence of channel fading. This paper...
Search methods in self-organizing networks usually cannot rely on stable topology from which shortest or otherwise optimized paths through the network are derived. When no reliable search indices or routing tables are available, other methods like flooding or random walks have to be considered to explore the network. These approaches can exploit partial knowledge in the network to reach a destination,...
More than providing a wireless structure for Internet access, Wireless Mesh Networks are being challenged to support diverse kinds of multimedia applications such as Voice over IP and video streaming in publish-subscriber and peer-to-peer service models. In this context, several routing metrics have been proposed to improve the routing performance as well as the network capability to satisfy the requirements...
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the time is slotted and that during one time slot (step) each node can transmit to one of its neighbours at most one data item. Each device is equipped with a half duplex interface; so a node cannot both receive...
In this paper, we present an analytic model for evaluating average packet delay and achievable end-to-end goodput in a collision channel based multihop wireless ad hoc networks. We consider each node operates not only as a host but also as a router, i.e., the packets may have to be forwarded by several intermediate nodes before they reach their destinations. The end-to-end delay of a connection and...
In wireless sensor network applications where each node sends a packet to a sink, the stochastic nature of the link affects the delivery rate (total number of packets delivered at the sink). Based on a simple analytical model, we study the statistical properties of the delivery rate for scenarios without link or transport layer retransmission (best-effort routing). For these best-effort scenarios,...
In this paper we propose a Generic Analytical DesiGn EnvironmenT (GADGET) Toolbox for designing the most suitable MAC protocol for an arbitrary wireless sensor network (WSN) application. Furthermore, a model to weight the metrics in the design and a new single compound metric are proposed. Comparing performance curves produced by a number of metrics make it difficult to evaluate how well a given protocol...
In this paper we considered the approximation of a queueing system model of wireless ad hoc and sensor networks. In our model we admitted an arbitrary distribution for the duration of each M states that describe the source. Following the Markov Modulated Rate Process (MMRP) as a source model, we used it to introduce a diffusion approximation for the superposition of such aggregated traffic processes...
In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has higher priority to be covered than a distant one. A localized sensor self-deployment algorithm, named Greedy-Rotation-Greedy (GRG) [9], has recently been proposed for constructing optimal focused coverage. The previous work assumed...
Several protocols of address autoconfiguration in the mobile ad hoc network (MANET) are present in the current literature. Although some of these protocols perform decently in sparse and small networks, but exhibit poor performance (e.g., single point of failure, storage limitation, large protocol overhead and so on) when the network is either dense or very large. In this paper, we propose an efficient...
In this paper we consider a leader election problem in ad-hoc single hop radio sensor network with an adversary. The aim of the adversary is to be chosen as a leader. In many scenarios it can be a staring point for performing other attacks and taking control over the whole network. In our paper we show that in typical and well-known algorithms it is not possible to avoid this threat, i.e. the...
Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting best robot, response time, and cost of performing the task. Existing solutions are either centralized, neglecting communication cost, assuming complete graph, or based on flooding with individual responses to robot decision maker (simple auction...
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the line. An intruder traversing the barrier can be detected only when it is within the sensing range of at least one sensor. The sensor network establishes barrier coverage of the segment if no intruder can penetrate the barrier...
Mobile sinks (MS) mounted upon urban vehicles with fixed trajectories (e.g. buses) provide the ideal infrastructure to effectively retrieve sensory data from isolated Wireless Sensor Network (WSN) fields. Existing approaches involve either single-hop transfer of data from sensors that lie within the MS’s range or heavy involvement of network periphery nodes in data retrieval, processing, buffering...
The increased functionality of EPC Class1 Gen2 (EPCGen2) is making this standard a de facto specification for inexpensive tags in the RFID industry. Recently three EPCGen2 compliant protocols that address security issues were proposed in the literature. In this paper we analyze these protocols and show that they are not secure and subject to replay/impersonation and statistical analysis attacks. We...
By eavesdropping on a user’s query in a sensor network, an adversary can deduce both the user’s location and his/her area of interest. In many domains it is desirable to guarantee privacy of both places. We propose an effective way to measure how well issuing a disperse set of k queries protects the user’s area of interest. However, issuing k queries instead of one facilitates the adversary determining...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.