Distributed Construction for Power Aware Connected Dominating Set

Xue Yu Wang; Bing Qiang Shan; Li Shan Sun

doi:10.4028/www.scientific.net/AMR.709.667

Paper Titles

Symmetric Multiwavelet Frames with General Lattice
p.650

A Robust Image Watermarking Algorithm Based on PCA and NN
p.654

Simplified Calculation Methods about Bottom Surface Size of Shallow Foundation Bearing Eccentric Load
p.658

Flight Control System for UAV Based on Simulink
p.662

Distributed Construction for Power Aware Connected Dominating Set
p.667

Analysis of the Process of Collapse in Supervision Control Systems
p.671

ScanSAR Mode Sea Ice Image Segmentation
p.675

Analysis on Preception and Model for Service Quality in Chain Supermarkets Visited by Customers in China
p.681

Reviews and a New Angle of β Coefficient Prediction Method
p.687

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 709Distributed Construction for Power Aware Connected...

Distributed Construction for Power Aware Connected Dominating Set

Abstract:

This paper proposes a distributed algorithm for constructing power aware connected dominating set. It starts from any node, using depth first search, to form a connected dominating set after completing search in one orientation and then backtrack search in other orientations. For any dominating node’s neighbor nodes, when any neighbor node’s energy is lower than the threshold energy, backtrack search in other orientations. Simulation results show that the proposed algorithms perform better than some known ones.

You might also be interested in these eBooks

Advances in Applied Science, Engineering and Technology

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 709)

Pages:

667-670

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.709.667

Citation:

Cite this paper

Online since:

June 2013

Authors:

Xue Yu Wang, Bing Qiang Shan, Li Shan Sun

Keywords:

Connected Dominating Set, Distributed Algorithm, Power Aware

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the theory of NP-Completeness. Freeman, San Francisco(1978).

Google Scholar

[2] S. Guha, S. Khuller. Approximation Algorithms for Connected Dominating Sets. Algorithmica, 1998, 20(4): pp.374-387.

DOI: 10.1007/pl00009201

Google Scholar

[3] J. Wu , H. Li. On Calculating Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks. Proc. Third Int'l Workshop on Discrete Algorithms and Methods for Mobile Computing and Comm.,1999, pp.7-14.

DOI: 10.1145/313239.313261

Google Scholar

[4] J. Wu, M. Gao, and I. Stojmenovic, On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks. IEEE international Conference, Parallel Processing 2001, pp.346-353.

DOI: 10.1109/icpp.2001.952080

Google Scholar