Sciweavers

2684 search results - page 8 / 537
» On the Connectivity of Ad Hoc Networks
Sort
View
MOBIHOC
2002
ACM
14 years 6 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
INFOCOM
2002
IEEE
13 years 12 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
ICC
2009
IEEE
136views Communications» more  ICC 2009»
14 years 1 months ago
Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks
—The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally p...
Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
13 years 12 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
ICC
2007
IEEE
174views Communications» more  ICC 2007»
14 years 1 months ago
Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
Norihiro Ohata, Yongbing Zhang, Yusheng Ji, Xuemin...