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
An asynchronous neighbor discovery algorithm for wireless sensor networks
β Scribed by Steven A. Borbash; Anthony Ephremides; Michael J. McGlynn
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 580 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1570-8705
No coin nor oath required. For personal study only.
β¦ Synopsis
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 presented that permits each node in the network to develop a list of its neighbors, which may be incomplete. The algorithm is analyzed and parameter settings are derived which maximize the fraction of neighbors discovered in a fixed running time. A companion distributed algorithm is also described which allows all the nodes in the network to execute that neighbor discovery algorithm without the need to agree on a common start time.
π SIMILAR VOLUMES
## 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