Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Wireless integrated network sensors
Communications of the ACM
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
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
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
ATPC: adaptive transmission power control for wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
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
Connectivity properties of large-scale sensor networks
Wireless Networks
Distributed algorithms for maximum lifetime routing in wireless sensor networks
IEEE Transactions on Wireless Communications
An Integrated Neighbor Discovery and MAC Protocol for Ad Hoc Networks Using Directional Antennas
IEEE Transactions on Wireless Communications
Connectivity properties of a packet radio network model
IEEE Transactions on Information Theory
An Aloha protocol for multihop mobile wireless networks
IEEE Transactions on Information Theory
MAC protocols for wireless sensor networks: a survey
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Identifying neighbor and connectivity are the fundamental requirements in wireless sensor networks. The sensor nodes are scattered randomly over the area of interest and their first step is to identify their immediate neighbors, i.e., the nodes with which they have direct wireless communication. On the other hand, connectivity ensures that sensor nodes can communicate with each other in order to aggregate sensing data hop by hop to the base stations (sink nodes). In this paper, we study identifying neighbor and connectivity in the context of wireless sensor networks, using Poisson point process theory.