15,428 research outputs found
Study of Reliable Data Communication in Wireless Sensor Networks
A distributed wireless sensor network consists of numerous tiny autonomous sensing nodes deployed across a wide geographical area. These sensor nodes self organize and establish radio communication links with the neighboring nodes to form multi-hop routing paths to the central base station. The dynamic and lossy nature of wireless communication poses several challenges in reliable transfer of data from the sensor nodes to the sink. There are several applications of sensor networks wherein the data collected by the sensors in the network are critical and hence have to be reliably transported to the sink. An example of such an application is sensors with RFID readers mounted on them to read tag information from the objects in a factory warehouse. Here, the tag information recorded by the RFID reader is a critical piece of information which may not be available at a later point of time and hence has to be reliably transported to the sink. We study the various issues and analyze the design choices proposed in literature in addressing the challenge of sensors-to-sink reliable data communication in such applications. A cross-layer based protocol with MAC layer retransmissions and NACK (Negative Acknowledgment) based rerouting of data packets is developed to overcome link failures and provide reliability. The protocol is implemented on TinyOS and the performance of NACK based rerouting protocol in terms of percentage successful message reception is compared with NACK based retransmission protocol by running simulations on TOSSIM. The NACK based rerouting protocol provides greater reliability under different metrics like varying network size, network traffic and percentage of failed links in the network
Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks over Unreliable Channels
Wireless sensor networks have been increasingly used for real-time
surveillance over large areas. In such applications, it is important to support
end-to-end delay constraints for packet deliveries even when the corresponding
flows require multi-hop transmissions. In addition to delay constraints, each
flow of real-time surveillance may require some guarantees on throughput of
packets that meet the delay constraints. Further, as wireless sensor networks
are usually deployed in challenging environments, it is important to
specifically consider the effects of unreliable wireless transmissions.
In this paper, we study the problem of providing end-to-end delay guarantees
for multi-hop wireless networks. We propose a model that jointly considers the
end-to-end delay constraints and throughput requirements of flows, the need for
multi-hop transmissions, and the unreliable nature of wireless transmissions.
We develop a framework for designing feasibility-optimal policies. We then
demonstrate the utility of this framework by considering two types of systems:
one where sensors are equipped with full-duplex radios, and the other where
sensors are equipped with half-duplex radios. When sensors are equipped with
full-duplex radios, we propose an online distributed scheduling policy and
proves the policy is feasibility-optimal. We also provide a heuristic for
systems where sensors are equipped with half-duplex radios. We show that this
heuristic is still feasibility-optimal for some topologies
A novel cooperative opportunistic routing scheme for underwater sensor networks
Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance
Routing efficiency in wireless sensor-actor networks considering semi-automated architecture
Wireless networks have become increasingly popular and advances in wireless communications and electronics have enabled the development of different kind of networks such as Mobile Ad-hoc Networks (MANETs), Wireless Sensor Networks (WSNs) and Wireless Sensor-Actor Networks (WSANs). These networks have different kind of characteristics, therefore new protocols that fit their features should be developed. We have developed a simulation system to test MANETs, WSNs and WSANs. In this paper, we consider the performance behavior of two protocols: AODV and DSR using TwoRayGround model and Shadowing model for lattice and random topologies. We study the routing efficiency and compare the performance of two protocols for different scenarios. By computer simulations, we found that for large number of nodes when we used TwoRayGround model and random topology, the DSR protocol has a better performance. However, when the transmission rate is higher, the routing efficiency parameter is unstable.Peer ReviewedPostprint (published version
Consistent Sensor, Relay, and Link Selection in Wireless Sensor Networks
In wireless sensor networks, where energy is scarce, it is inefficient to
have all nodes active because they consume a non-negligible amount of battery.
In this paper we consider the problem of jointly selecting sensors, relays and
links in a wireless sensor network where the active sensors need to communicate
their measurements to one or multiple access points. Information messages are
routed stochastically in order to capture the inherent reliability of the
broadcast links via multiple hops, where the nodes may be acting as sensors or
as relays. We aim at finding optimal sparse solutions where both, the
consistency between the selected subset of sensors, relays and links, and the
graph connectivity in the selected subnetwork are guaranteed. Furthermore,
active nodes should ensure a network performance in a parameter estimation
scenario. Two problems are studied: sensor and link selection; and sensor,
relay and link selection. To solve such problems, we present tractable
optimization formulations and propose two algorithms that satisfy the previous
network requirements. We also explore an extension scenario: only link
selection. Simulation results show the performance of the algorithms and
illustrate how they provide a sparse solution, which not only saves energy but
also guarantees the network requirements.Comment: 27 pages, 17 figure
- …