On k-connectivity for a geometric random graph
Random Structures & Algorithms
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
Modeling reliability for wireless sensor node coverage in assistive testbeds
Proceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments
Multi-state reliability and message time delay in wireless sensor networks
International Journal of Wireless and Mobile Computing
Identifying Neighbor and Connectivity of Wireless Sensor Networks with Poisson Point Process
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In wireless sensor networks, both nodes and links are prone to failures. In this paper we study connectivity properties of large-scale wireless sensor networks and discuss their implicit effect on routing algorithms and network reliability. We assume a network model of n sensors which are distributed randomly over a field based on a given distribution function. The sensors may be unreliable with a probability distribution, which possibly depends on n and the location of sensors. Two active sensor nodes are connected with probability p e (n) if they are within communication range of each other. We prove a general result relating unreliable sensor networks to reliable networks. We investigate different graph theoretic properties of sensor networks such as k-connectivity and the existence of the giant component. While connectivity (i.e. k = 1) insures that all nodes can communicate with each other, k-connectivity for k 1 is required for multi-path routing. We analyze the average shortest path of the k paths from a node in the sensing field back to a base station. It is found that the lengths of these multiple paths in a k-connected network are all close to the shortest path. These results are shown through graph theoretical derivations and are also verified through simulations.