Sciweavers

1390 search results - page 84 / 278
» Geometric Spanners for Wireless Ad Hoc Networks
Sort
View
INFOCOM
2000
IEEE
15 years 10 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong
IPCCC
2006
IEEE
16 years 6 days ago
Energy-efficient cooperative routing in multi-hop wireless ad hoc networks
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....
Fulu Li, Kui Wu, Andrew Lippman
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
15 years 11 months ago
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
ICPPW
2002
IEEE
15 years 11 months ago
Robust Routing in Wireless Ad Hoc Networks
A wireless ad hoc network is a collection of mobile nodes with no fixed infrastructure. The absence of central authorization facility in dynamic and distributed environment requir...
Seungjoon Lee, Bohyung Han, Minho Shin
INFOCOM
2002
IEEE
15 years 11 months ago
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder