A biological programming model for self-healing
Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Pervasive and Mobile Computing
Analysis of k-Neigh topology control protocol for mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the typical case complexity of graph optimization
Discrete Applied Mathematics
Organizing a global coordinate system from local information on an ad hoc sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Thresholding random geometric graph properties motivated by ad hoc sensor networks
Journal of Computer and System Sciences
On the lifetime of node-to-node communication in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Identifying Neighbor and Connectivity of Wireless Sensor Networks with Poisson Point Process
Wireless Personal Communications: An International Journal
Network topology models for multihop wireless networks
ISRN Communications and Networking
Temporal Traffic Dynamics Improve the Connectivity of Ad Hoc Cognitive Radio Networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.84 |
A model of a packet radio network in which transmitters with range R are distributed according to a two-dimensional Poisson point process with density D is examined. To ensure network connectivity, it is shown that πR2D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network. For an infinite area there exists an infinite connected component with nonzero probability if π R2D>N0, for some critical value N0. It is shown that 2.195