• DocumentCode
    2417753
  • Title

    Directional Virtual Coordinate Systems for Wireless Sensor Networks

  • Author

    Dhanapala, Dulanjalie C. ; Jayasumana, Anura P.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Colorado State Univ., Fort Collins, CO, USA
  • fYear
    2011
  • fDate
    5-9 June 2011
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    A Directional Virtual Coordinate System (DVCS) is proposed based on a novel transformation that restores the lost directionality information in a Virtual Coordinate System (VCS). VCS is an attractive option to characterize the node locations in Wireless Sensor Networks (WSNs), instead of using geographical coordinates, which is expensive or difficult to obtain. A VCS characterizes each node in a network with the minimum hop distances to a set of anchor nodes as its coordinates. The proposed transformation supplements the virtual coordinates, thus preserving all the inheriting properties such as embedded information of geodesic distances in the coordinates. The virtual directionality introduced, alleviates the local minima issue present in original VCS. Properties of this virtual directional domain are discussed. With these directional properties, it is possible, for the first time, to consider deterministic algorithms in the virtual domain, as illustrated with a constrained tree network example. A novel routing scheme called Directional Virtual Coordinate Routing (DVCR), which illustrates the effectiveness of the Directional Virtual Coordinate domain is proposed. DVCR significantly outperforms existing VCS routing schemes Convex Subspace Routing (CSR) and Logical Coordinate Routing (LCR), while achieving a performance similar to the geographical routing scheme - Greedy Perimeter Stateless Routing (GPSR), but without the need for node location information.
  • Keywords
    deterministic algorithms; telecommunication network routing; trees (mathematics); wireless sensor networks; CSR; DVCR; DVCS; GPSR; LCR; VCS routing schemes; WSN; anchor nodes; constrained tree network; convex subspace routing; deterministic algorithms; directional property; directional virtual coordinate domain; directional virtual coordinate routing; directional virtual coordinate systems; directionality information; embedded information; geodesic distances; geographical coordinates; geographical routing scheme; greedy perimeter stateless routing; inheriting property; local minima issue; logical coordinate routing; minimum hop distances; node location information; node locations; novel routing scheme; virtual coordinates; virtual directional domain; virtual directionality; virtual domain; wireless sensor networks; IEEE Communications Society; Junctions; Peer to peer computing; Routing; Routing protocols; Video recording; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications (ICC), 2011 IEEE International Conference on
  • Conference_Location
    Kyoto
  • ISSN
    1550-3607
  • Print_ISBN
    978-1-61284-232-5
  • Electronic_ISBN
    1550-3607
  • Type

    conf

  • DOI
    10.1109/icc.2011.5963079
  • Filename
    5963079