Discrete Mathematics - Topics on domination
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Approximating the Domatic Number
SIAM Journal on Computing
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Energy conservation via domatic partitions
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A simple improved distributed algorithm for minimum CDS in unit disk graphs
ACM Transactions on Sensor Networks (TOSN)
A convex-hull based algorithm to connect the maximal independent set in unit-disk graphs
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
| Hi-index | 0.00 |
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V ,E ) where V and E denote the sensors deployed in the plane and the links among them, respectively. A link between two sensors exists if their Euclidean distance is at most 1. We present a distributed algorithm that computes a family S of S 1 ,S 2 , *** , S m non-trivial connected dominating sets (CDS ) with the goal to maximize *** = m /k where k =max u *** V |{i :u *** S i }|. In other words, we wish to find as many CDS s as possible while minimizing the number of frequencies of each node in these sets. Since CDS s play an important role for maximizing network lifetime when they are used as backbones for broadcasting messages, maximizing *** reduces the possibility of repeatedly using the same subset of nodes as backbones. We provide an upper bound on the value of *** via a nice relationship between all minimum vertex-cuts and CDS s in G and present a distributed (localized) algorithm for the *** maximization problem. For a subclass of unit disk graphs, we show that our algorithm achieves a constant approximation factor of the optimal solution.