Sciweavers

1144 search results - page 4 / 229
» Locally constructed algorithms for distributed computations ...
Sort
View
SPAA
2003
ACM
14 years 22 days ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
INFOCOM
1999
IEEE
13 years 11 months ago
CEDAR: a Core-Extraction Distributed Ad Hoc Routing Algorithm
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
Prasun Sinha, Raghupathy Sivakumar, Vaduvur Bhargh...
DIALM
2004
ACM
165views Algorithms» more  DIALM 2004»
14 years 27 days ago
LLS: a locality aware location service for mobile ad hoc networks
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
Ittai Abraham, Danny Dolev, Dahlia Malkhi
WWW
2004
ACM
14 years 8 months ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo
AINA
2005
IEEE
14 years 1 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko