Latency of wireless sensor networks with uncoordinated power saving mechanisms
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)
The capacity of wireless networks
IEEE Transactions on Information Theory
On the throughput scaling of wireless relay networks
IEEE Transactions on Information Theory
Results on coverage for finite wireless networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
This correspondence considers networks where nodes are connected randomly and can fail at random times. It provides scaling laws that allow to find the critical time at which isolated nodes begin to appear in the system as its size tends to infinity. Applications are in the areas of sensor and ad-hoc networks where nodes are subject to battery drainage and 'blind spots' formation becomes a primary concern. The techniques adopted are based on the Chen-Stein method of Poisson approximation, which allows to obtain elegant derivations that are shown to improve upon and simplify previous related results that appeared in the literature. Since blind spots are strongly related to full connectivity, we also obtain some scaling results about the latter.