Sciweavers

90 search results - page 8 / 18
» On the minimum hop count and connectivity in one-dimensional...
Sort
View
JPDC
2007
191views more  JPDC 2007»
13 years 8 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
INFOCOM
2002
IEEE
14 years 1 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
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
14 years 1 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
MOBIHOC
2002
ACM
14 years 8 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
WOWMOM
2005
ACM
122views Multimedia» more  WOWMOM 2005»
14 years 2 months ago
Energy-Aware Routing in Wireless Ad-Hoc Networks
In this work we study energy efficient routing strategies for wireless ad-hoc networks. In this kind of networks, energy is a scarce resource and its conservation and efficient us...
Panagiotis C. Kokkinos, Christos A. Papageorgiou, ...