In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally co...
Chih-Wei Yi, Peng-Jun Wan, Lixin Wang, Chao-Min Su
A routing protocol is designed considering a particular environment all the time which is not possible in the case of practical ad hoc networks. Because of the uncertainty in topol...
We present a specification for a new, localized group membership service that maintains the membership status of adjacent nodes – called neighbors – in a mobile distributed s...
— Wireless networks have become a ubiquitous reality and ever more surround our everyday activities. They form and disappear around us spontaneously and have become new means for...