• DocumentCode
    3377533
  • Title

    TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs

  • Author

    Srinivasan, Avinash ; Wu, Jie

  • Author_Institution
    Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL
  • fYear
    2008
  • fDate
    3-7 Aug. 2008
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK - a novel sink mobility model exploiting the connected dominating set (CDS) property of a network graph. TRACK, to the best of our knowledge, is the first contemporary sink mobility model to exploit the CDS property for WSN lifetime longevity and secure data aggregation. In TRACK, the CDS of the given network is computed and then the minimum spanning tree (MST) of the CDS is constructed. Using the CDS-MST as the underlying framework, a Hamiltonian circuit (HC) is constructed, along which the sink is mobilized to traverse the network. Since TRACK, by the very definition of CDS, passes through the transmission range of every node in the network, data can be relayed directly from the source node to the sink, eliminating the need for multi-hop routing. By virtue of this property, nodes in the WSN are discharged from their routing obligations and data aggregation becomes more secure. Additionally, we propose an extended version of TRACK called M-TRACK in this paper. The extended model trades higher fractions of sensor energy with the objective of minimizing the length of sink trajectory. This consequently minimizes the delay between consecutive sink visits, mitigating buffer-overflow of sensors. M-TRACK does necessitate multi-hop routing, but keeps it within a bounded number of hops. We confirm the efficiency and robustness of our models via simulation and analysis, and show that our model can extend the WSN lifetime up to seven times that which can be achieved using a static sink.
  • Keywords
    mobile radio; telecommunication network routing; trees (mathematics); wireless sensor networks; CDS property; Hamiltonian circuit; M-TRACK; WSN lifetime longevity; buffer-overflow; connected dominating set; data aggregation; minimum spanning tree; multihop routing; network graph; sink mobility model; sink trajectory; source node; transmission range; wireless sensor network; Analytical models; Circuits; Computer networks; Delay; Relays; Robustness; Routing; Spread spectrum communication; Tree graphs; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Communications and Networks, 2008. ICCCN '08. Proceedings of 17th International Conference on
  • Conference_Location
    St. Thomas, US Virgin Islands
  • ISSN
    1095-2055
  • Print_ISBN
    978-1-4244-2389-7
  • Electronic_ISBN
    1095-2055
  • Type

    conf

  • DOI
    10.1109/ICCCN.2008.ECP.127
  • Filename
    4674287