• DocumentCode
    691698
  • Title

    Energy efficient minimum connected dominating set algorithm for MANETs

  • Author

    Chakradhar, P. ; Yogesh, P.

  • Author_Institution
    Dept. of IST, Anna Univ., Chennai, India
  • fYear
    2013
  • fDate
    25-27 July 2013
  • Firstpage
    270
  • Lastpage
    276
  • Abstract
    In this paper we proposed a new Minimum Connected Dominating Set [MCDS] algorithm. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem[1]. The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad-hoc networks. Here the MCDS is a distributed algorithm based on Unit Disk Graph[7]. The node´s mobility and residual energy are considered as parameters in construction of stable MCDS. The time complexity of this algorithm is O(n) and the message complexity is O(n). The performance evaluation of this algorithm yields better results in dense networks as well as sparse networks. Size of the MCDS is also small compared to other distributed algorithms[8][9][10].
  • Keywords
    distributed algorithms; mobile ad hoc networks; mobility management (mobile radio); telecommunication power management; CDS; MANET; MCDS algorithm; broadcast storm problem; dense networks; distributed algorithm; energy efficient minimum connected dominating set algorithm; message complexity; mobile ad-hoc networks; node mobility; node residual energy; sparse networks; time complexity; unit disk graph; Ad hoc networks; Algorithm design and analysis; Broadcasting; Color; Mobile computing; Routing protocols; Time complexity; Broadcast Storm Problem; MANET; Minimum connected Dominating Set (MCDS); Mobility; Residual Energy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Recent Trends in Information Technology (ICRTIT), 2013 International Conference on
  • Conference_Location
    Chennai
  • Type

    conf

  • DOI
    10.1109/ICRTIT.2013.6844215
  • Filename
    6844215