Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fault tolerant deployment and topology control in wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
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
Latency of wireless sensor networks with uncoordinated power saving mechanisms
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A cone-based distributed topology-control algorithm for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Continuum percolation with steps in the square or the disc
Random Structures & Algorithms
Ad-hoc Networks: Fundamental Properties and Network Topologies
Ad-hoc Networks: Fundamental Properties and Network Topologies
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Distributed energy management algorithm for large-scale wireless sensor networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The capacity of wireless networks
IEEE Transactions on Information Theory
Characterizing the spread of correlated failures in large wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
LossEstimate: Distributed failure estimation in wireless networks
Journal of Systems and Software
Transition phase of connectivity for wireless networks with growing process
International Journal of Ad Hoc and Ubiquitous Computing
Deployment guidelines for achieving maximum lifetime and avoiding energy holes in sensor network
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this paper, we study the critical phase transition time of large-scale wireless multi-hop networks when the network topology experiences a partition due to increasing random node failures. We first define two new metrics, namely the last connection time and first partition time. The former is the last time that the network keeps a majority of surviving nodes connected in a single giant component; while the latter is the first time that the remaining surviving nodes are partitioned into multiple small components. Then we analyze the devolution process in a geometric random graph of n nodes based on percolation-theory connectivity and obtain the sufficient condition under which the graph is percolated. Based on the percolation condition, the last connection time and first partition time are found to be on the same order. Particularly, when the survival function of node lifetime is exponential, they are on the order of log(log n); while if the survival function is Pareto, the order is (log n)1/ρ, where ρ is the shape parameter of Pareto distribution. Finally, simulation results confirm that the last connection time and first partition time serve as the lower and upper bounds of the critical phase transition time, respectively. Further, an interesting result is that the network with heavy-tailed survival functions is no more resilient to random failures than the network with light-tailed ones, in terms of critical phase transition time, if the expected node lifetimes are identical.