We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i....
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...
Ananth V. Kini, Steven Weber, Fadi A. Aloul, Nagar...