Sciweavers

78 search results - page 5 / 16
» Message-optimal connected dominating sets in mobile ad hoc n...
Sort
View
ICDCS
2008
IEEE
14 years 1 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
PERVASIVE
2004
Springer
14 years 2 days ago
Accommodating Transient Connectivity in Ad Hoc and Mobile Settings
Much of the work on networking and communications is based on the premise that components interact in one of two ways: either they are connected via a stable wired or wireless netw...
Radu Handorean, Christopher D. Gill, Gruia-Catalin...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 1 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
LCN
2003
IEEE
13 years 12 months ago
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...
Jamil A. Shaikh, Julio Solano-González, Iva...
INFOCOM
2003
IEEE
14 years 1 hour ago
Network Layer Support for Service Discovery in Mobile Ad Hoc Networks
— Service discovery is an integral part of the ad hoc networking to achieve stand-alone and self-configurable communication networks. In this paper, we discuss possible service ...
Ulas C. Kozat, Leandros Tassiulas