Sciweavers

116 search results - page 3 / 24
» Fast Connected Dominating Set Construction in Mobile Ad Hoc ...
Sort
View
PDPTA
2004
13 years 7 months ago
A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...
Zhengnan Shi, Pradip K. Srimani
FSTTCS
2004
Springer
13 years 11 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
ICDCS
2008
IEEE
14 years 2 days 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...
TC
2008
13 years 5 months ago
Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks
We propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor netwo...
Jie Wu, Fei Dai, Shuhui Yang
BROADNETS
2005
IEEE
13 years 11 months ago
Performance analysis and enhancement for backbone based wireless mobile ad hoc networks
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
Laura Huei-jiun Ju, Izhak Rubin