117
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

A local algorithm to compute multiple connected dominating sets in wireless sensor networks

&
Pages 369-380 | Received 04 May 2010, Accepted 30 Oct 2010, Published online: 28 Oct 2011

References

  • Alzoubi , K. , Wan , P. and Frieder , O. 2002 . “ New distributed algorithm for connected dominating set in wireless ad hoc networks ” . In Proceedings of the IEEE HICSS35
  • Alzoubi , K. , Wan , P. and Frieder , O. 2002 . Distributed heuristics for connected dominating set in sireless ad hoc networks . IEEE ComSoc/KICS J. Commun. Netw. , 4 ( 1 ) : 22 – 29 .
  • Cheng , X. , Huang , X. , Li , D. and Du , D. 2003 . Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks . Networks , 42 ( 4 ) : 202 – 208 .
  • Clark , B. , Colborn , C. and Johnson , D. 1990 . Unit disk graphs . Discrete Math. , 86 : 165 – 177 .
  • Feige , U. , Halldorsson , M. , Kortsarz , G. and Srinivasan , A. 2003 . Approximating the domatic number . SIAM J. Comput. , 32 ( 1 ) : 172 – 195 .
  • Funke , S. , Kesselman , A. , Meyer , U. and Segal , M. 2006 . A simple improved distributed algorithm for minimum connected dominating set in unit disk graphs . ACM Trans. Sensor Netw. , 2 ( 3 ) : 444 – 453 .
  • Guha , S. and Khuller , S. 1998 . Approximation algorithms for connected dominating sets . Algorithmica , 20 : 374 – 387 .
  • Gupta , R. , Walrand , J. and Goldschmidt , O. 2005 . “ Maximal cliques in unit disk graphs: Polynomial approximation ” . In Proceedings of the INOC
  • Li , X. , Wan , P. and Frieder , O. 2005 . Coverage problems in wireless ad-hoc sensor networks . IEEE Trans. Comput. , 52 ( 6 ) : 753 – 763 .
  • Linial , N. 1992 . Locality in distributed graph algorithms . SIAM J. Comput. , 21 : 193 – 201 .
  • Marathe , M. , Breu , H. , Hunt , H. , Ravi , S. and Rosenkrantz , D. 1995 . Simple heuristics for unit disk graphs . Networks , 25 : 59 – 68 .
  • T. Moscibroda, Locality, scheduling, and selfishness: Algorithmic foundations of highly decentralized networks, Ph.D. Thesis, ETH Zurich, Diss. ETH, No. 16740 (2006)
  • Moscibroda , T. and Wattenhofer , R. 2005 . “ Maximizing the lifetime of dominating sets ” . In Proceedings of the WMASN
  • Peleg , D. 2000 . Distributed Computing: A Locality-Sensitive Approach , Philadelphia, PA : SIAM .
  • Pemmaraju , S. and Pirwani , I. 2006 . “ Energy conservation in wireless sensor networks via domatic partitions ” . In Proceedings of the MobiHoc
  • Slijepcevic , S. and Potkonjak , M. 2001 . “ Power efficient organization of wireless sensor networks ” . In Proceedings of the ICC
  • Stojmenovic , I. , Seddigh , M. and Zunic , J. 2002 . Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks . IEEE Trans. Parallel Distrib. Syst. , 13 ( 1 ) : 14 – 25 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.