• DocumentCode
    237830
  • Title

    A distributed connected dominating set using adjustable sensing range

  • Author

    Chandra, Aniruddha ; Tarasia, Nachiketa ; Kumari, Akanksha ; Swain, Amulya Ratan

  • Author_Institution
    Sch. of Comput. Sci., KIIT Univ., Bhubaneswar, India
  • fYear
    2014
  • fDate
    8-10 May 2014
  • Firstpage
    868
  • Lastpage
    871
  • Abstract
    A Connected Dominating Set (CDS) serving as a virtual backbone, is an effective way to optimize the network´s topology and minimize communication overheads in network. A minimum connected dominating set (MCDS) offers an optimized way of routing messages in wireless networks. In this paper the target coverage is achieved with adjustable sensing range in the proposed distributed CDS based on prime node-ID (CDS-PN) modelled in unit disk graph (UDG) [1]. CDS-PN has time complexity of O(n2) and message complexity of O(n), where n is the number of nodes. Theoretical performance analysis is presented to verify efficiency of our approach.
  • Keywords
    directed graphs; telecommunication network routing; wireless sensor networks; CDS-PN; MCDS; UDG; adjustable sensing range; communication overheads; message routing; minimum connected dominating set; network topology; prime node-ID; proposed distributed CDS; unit disk graph; virtual backbone; wireless networks; Biological system modeling; Complexity theory; Lead; Connected Dominating Set; Maximal independent set (MIS); adjustable sensing range; prime node ID; target coverage;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advanced Communication Control and Computing Technologies (ICACCCT), 2014 International Conference on
  • Conference_Location
    Ramanathapuram
  • Print_ISBN
    978-1-4799-3913-8
  • Type

    conf

  • DOI
    10.1109/ICACCCT.2014.7019217
  • Filename
    7019217