A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Discrete Mathematics - Topics on domination
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
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
Unidirectional links prove costly in wireless ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
A Study on r-Configurations---A Resource Assignment Problem on Graphs
SIAM Journal on Discrete Mathematics
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Domatic Number
SIAM Journal on Computing
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
On the node-scheduling approach to topology control in ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Power balanced coverage-time optimization for clustered wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Low-coordination topologies for redundancy in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Minimum power configuration in wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Energy conservation via domatic partitions
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A survey on clustering algorithms for wireless sensor networks
Computer Communications
PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks
Computer Communications
High Performance Sleep-Wake Sensor Systems Based on Cyclic Cellular Automata
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Power efficient resilience and lifetime in wireless ad-hoc networks
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Monitoring schedules for randomly deployed sensor networks
Proceedings of the fifth international workshop on Foundations of mobile computing
The optimum sensor redeployment scheme using the most frangible clusters set
Computer Communications
Low-coordination wake-up algorithms for multiple connected-covered topologies in sensor nets
International Journal of Sensor Networks
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Sleep scheduling for wireless sensor networks via network flow model
Computer Communications
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
The optimization of sensor relocation in wireless mobile sensor networks
Computer Communications
Local approximation algorithms for scheduling problems in sensor networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
IEEE/ACM Transactions on Networking (TON)
Cooperative caching and relaying strategies for peer-to-peer content delivery
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Optimal network locality in distributed virtualized data-centers
Computer Communications
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
Connected dominating set algorithms for wireless sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task under rigid energy restrictions that forces the designers to impose a judicious power management and scheduling. For the purpose of saving energy, dominating set based clustering has turned out to be a useful and generic concept in such networks. In data gathering applications, for example, only nodes in the dominating set must be active, while all other nodes can remain in the energy-efficient sleep mode. Prolonging the duration of such a dominating set based clustering is a key algorithmic challenge. In this paper, we define the maximum cluster-lifetime problem which asks for a schedule that maximizes the time the network is clustered by a dominating set. We give approximation algorithms with an approximation ratio of O(log n) for several variants of the maximum cluster-lifetime problem. Our approach is based on results given in a paper by Feige, Halldórsson, Kortsarz, and Srinivasan on the domatic partition problem.