We consider the problem of determining, in a distributed, asynchronous and scalable manner, what nodes are ''neighbors'' in a wireless network. Neighbor discovery is an important enabler of network connectivity and energy conservation. An asynchronous, probabilistic neighbor discovery algorithm is p
An Energy-Optimal Algorithm for Neighbor Discovery in Wireless Sensor Networks
β Scribed by R. Madan; S. Lall
- Publisher
- Springer US
- Year
- 2006
- Tongue
- English
- Weight
- 487 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1383-469X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Low energy consumption is a critical design requirement for most wireless sensor network (WSN) applications. Due to minimal transmission power levels, time-varying environmental factors and mobility of nodes, network neighborhood changes frequently. In these conditions, the most critical issue for e
## Abstract We consider the challenge of organizing densely deployed sensor nodes into the form of clusters, using the distribution of network residual energy (NRE), which is defined as the sum of node residual energy. Irrespective of network topology, the distribution of NRE is proven to approach
## Abstract Connected dominating sets (CDS) can be used to form virtual backbones for the hierarchical routing to save energy in the wireless sensor networks. The existing algorithms for CDS can only be used to the topologies that have larger vertex connective degrees. Besides, most of them do not