Sciweavers

995 search results - page 129 / 199
» Gossip-based ad hoc routing
Sort
View
TMC
2008
125views more  TMC 2008»
14 years 11 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
MOBIHOC
2002
ACM
15 years 11 months ago
Comparison of broadcasting techniques for mobile ad hoc networks
Network wide broadcasting in Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. Considering i...
Brad Williams, Tracy Camp
INFOCOM
2008
IEEE
15 years 5 months ago
A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks
—We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means...
Zheng Wang, Hamid R. Sadjadpour, J. J. Garcia-Luna...
INFOCOM
2006
IEEE
15 years 5 months ago
A Framework for Distributed Spatio-Temporal Communications in Mobile Ad Hoc Networks
— Space-time communications can help combat fading and hence can significantly increase the capacity of ad hoc networks. Cooperative diversity or virtual antenna arrays facilita...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...
TMC
2008
192views more  TMC 2008»
14 years 11 months ago
A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks
Abstract-- This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a r...
Calin Curescu, Simin Nadjm-Tehrani