Abstract
Wireless Sensor Networks (WSNs) experience two different patterns of traffic with different requirements: 1) Event-driven traffic from sensor nodes to the base-station (BS) in the form of single-path uni-cast packets, and 2) Query-driven traffic from BS to sensors that better matches multi-casting and generates multi-path traffic. In this paper, we propose SiMple, a unified algorithm to jointly route single- and multi-path packets in WSNs. SiMple establishes a square destination area to control the degree of path multiplicity as well as the number of intermediate nodes between the source and destination nodes. When performing single-path routing, SiMple considers the direct line connecting source and destination nodes to select the closest sensor node to the line as the next carrier of the packet. Otherwise, SiMple directs packets towards the destination node(s) by exploiting multiple disjoint routes where the number of disjoint routes is controlled by the source node. In addition, SiMple introduces virtual source nodes to hide the location of the real source node, which is needed in asset monitoring applications. The conducted extensive NS-2 simulation experiments for mixed single- and multi-path packets confirm that SiMple results in a higher performance level and consumes lower energy when compared to the case of using two separate algorithms to individually route event and query packets.
Highlights
DISCUSSIONS In the first experiment, we investigate the effect of Destination Area Radius (DAR) parameter on the percentage of correctly reported events i.e., event delivery ratio to Base Station (BS)
Routing over single path from a source node to a destination node utilizes a specific path among a group of intermediate nodes
To investigate how the proposed multi-path algorithm helps the network, we counted the number of required single paths to achieve the same delivery ratio
Summary
Wireless sensor Networks (WSN) consists of a large number of tiny and inexpensive sensing devices, called sensor nodes, interconnected through wireless links to perform distributed sensing tasks [1], [2]. These networks have been deployed in many applications, e.g., environmental monitoring [3], real-time target tracking [4], structural monitoring [5], health-care [6] and so on. Sensor nodes are randomly distributed over the target area to collect information about a desired phenomenon, e.g., physical or environmental conditions. Routing algorithms should provide a level of failure tolerance to combat the hostility of the environment where sensor nodes are distributed in
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
