Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
Journal of Computer and System Sciences
Assigning codes in wireless networks: bounds and scaling properties
Wireless Networks
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Experimental analysis of simple, distributed vertex coloring algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A power control MAC protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Random channel assignment in the plane
Random Structures & Algorithms
Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Sharp thresholds For monotone properties in random geometric graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficient and robust protocols for local detection and propagation in smart dust networks
Mobile Networks and Applications
Shallow water acoustic networks
IEEE Communications Magazine
State-of-the-art in protocol research for underwater acoustic sensor networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Deployment analysis in underwater acoustic wireless sensor networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Optimal Initialization and Gossiping Algorithms for Random Radio Networks
IEEE Transactions on Parallel and Distributed Systems
State of the art in protocol research for underwater acoustic sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
3-Dimensional minimum energy broadcasting problem
Ad Hoc Networks
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Delivery Guarantee of Greedy Routing in Three Dimensional Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Self-deployment of sensors for maximized coverage in underwater acoustic sensor networks
Computer Communications
On the connectivity of wireless multi-hop networks with arbitrary wireless channel models
IEEE Communications Letters
Coverage, connectivity, and fault tolerance measures of wireless sensor networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Connectivity optimization for wireless sensor networks applied to forest monitoring
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Energy-efficient restricted greedy routing for three dimensional random wireless networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Fault tolerant three dimensional environment monitoring using wireless sensor networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Ad hoc network deployment accommodating short and uncertain transmission range
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Dynamic deployment in ad hoc networks accommodating uncertain transmission range
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Distributed k-clustering algorithms for random wireless multihop networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Diameter and broadcast time of random geometric graphs in arbitrary dimensions
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Towards a better understanding of large-scale network models
IEEE/ACM Transactions on Networking (TON)
Quantifying connectivity in wireless sensor networks with grid-based deployments
Journal of Network and Computer Applications
| Hi-index | 0.00 |
In this paper, we analyze various critical transmitting/sensing ranges for connectivity and coverage in three-dimensional sensor networks. As in other large-scale complex systems, many global parameters of sensor networks undergo phase transitions: For a given property of the network, there is a critical threshold, corresponding to the minimum amount of the communication effort or power expenditure by individual nodes, above (respectively, below) which the property exists with high (respectively, a low) probability. For sensor networks, properties of interest include simple and multiple degrees of connectivity/coverage. First, we investigate the network topology according to the region of deployment, the number of deployed sensors, and their transmitting/sensing ranges. More specifically, we consider the following problems: Assume that n nodes, each capable of sensing events within a radius of r, are randomly and uniformly distributed in a 3-dimensional region {\cal{R}} of volume V, how large must the sensing range {\rm{R_{SENSE}}} be to ensure a given degree of coverage of the region to monitor? For a given transmission range {\rm{R_{TRANS}}}, what is the minimum (respectively, maximum) degree of the network? What is then the typical hop-diameter of the underlying network? Next, we show how these results affect algorithmic aspects of the network by designing specific distributed protocols for sensor networks.