Name
Title | ||
|---|---|---|
Identifying Neighbor and Connectivity of Wireless Sensor Networks with Poisson Point Process |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s11277-010-0220-4 | Wireless Personal Communications |
Keywords | Field | DocType |
Wireless sensor networks,Connectivity,Identifying neighbor,Critical transmitting range,Poisson point process | Base station,Key distribution in wireless sensor networks,Wireless,Computer science,Sensing data,Computer network,Hop (networking),Mobile wireless sensor network,Poisson point process,Wireless sensor network,Distributed computing | Journal |
Volume | Issue | ISSN |
64 | 4 | 0929-6212 |
Citations | PageRank | References |
4 | 0.51 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanhuai Qu | 1 | 7 | 0.90 |
| Jian-an Fang | 2 | 529 | 23.40 |
| Shuai Zhang | 3 | 37 | 11.44 |