Sciweavers

250 search results - page 32 / 50
» Distributed Algorithms for Coloring and Domination in Wirele...
Sort
View
ICPP
2005
IEEE
14 years 2 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao
INFOCOM
2005
IEEE
14 years 2 months ago
Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network
— Even though multiple non-overlapped channels exist in the 2.4GHz and 5GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a resul...
Ashish Raniwala, Tzi-cker Chiueh
MOBIHOC
2003
ACM
14 years 8 months ago
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
Chao Gui, Prasant Mohapatra
MOBIHOC
2005
ACM
14 years 8 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song
MOBIHOC
2003
ACM
14 years 1 months ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster