Abstract

Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes.

Highlights

  • Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas

  • These sensors can observe and respond to phenomena in the physical environment [3]. Such sensor networks are referred to as wireless sensor networks (WSNs). These WSNs provide flexibility in deployment and maintenance, exploit the ability of wireless networks to be deployed in highly dynamic environments and enable sensor networks to be potentially used in a wide range of civilian and military applications, including security surveillance, environmental monitoring, habitat monitoring, hazard and disaster monitoring and relief operations, health field applications, and home applications [3]

  • As the number of nodes becomes large, the probability that the network is connected is asymptotically the same as the probability that no node is isolated. This follows from the fundamental result in random graph theory that, for random geometric graphs of a hypercube of two or more dimensions: the minimum connectivity radius for achieving k-connectivity is exactly equal to the minimum radius for achieving a minimum nodal degree k, with probability tending to 1 as the number of vertices goes to infinity [41]

Read more

Summary

OPEN ACCESS sensors

Ji Li 1 , Lachlan L.H. Andrew 2 , Chuan Heng Foh 3,? Moshe Zukerman 4 and Hsiao-Hwa Chen 5. Received: 25 August 2009; in revised form: 25 September 2009 / Accepted: 25 September 2009 /

Introduction
Graph Models
Connectivity in Wireless Ad Hoc and Sensor Networks
Percolation in Infinite Graphs
Connectivity on Finite Graphs
Techniques to Improve Connectivity
Less Regular Connectivity Models
SINR Model
Hybrid Models including Wired Infrastructure
Relationship between Connectivity and Capacity
Capacity Constraints imposed by Connectivity
Improving Capacity by Denser Connectivity
Cluster Routing Protocols
Constructive Algorithms
Placement of Nodes
Placement of Ordinary Nodes
Placement of Relay Nodes
Concluding Remarks

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 call

Disclaimer: 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.