IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v5y2009i5p391-428.html
   My bibliography  Save this article

Hierarchical Numbering Based Addressing and Stateless Routing Scheme for Wireless Sensor Networks

Author

Listed:
  • Mohammad Yusuf Sarwar Uddin
  • Mohammad Mostofa Akbar
  • Salahuddin Mohammad Masum

Abstract

Due to energy and other relevant constraints, addressing of nodes and data routing techniques in sensor networks differ significantly from other networks. In this article, we present an energy-efficient addressing and stateless routing paradigm for wireless sensor networks. We propose a dynamic and globally unique address allocation scheme for sensors in such a way that these addresses can later be used for data routing. We build a tree like organization of sensors rooted by the sink node based on their transmission adjacency and then set labels on each sensor with a number according to the preorder traversal of the tree from the root. In this addressing process, each sensor keeps necessary information so that they can later route data packets to the destination depending on these addresses, without keeping the large routing table and running any no route discovery phase. Moreover, the scheme does not use location information as well (as done by geo-routing) and can be used in the indoor environment. We conduct simulations to measure the soundness of our approach and make a comparison with another similar technique TreeCast . Simulation results reveal that our approach performs better than its counterpart in several important performance metrics like address length and communication energy.

Suggested Citation

  • Mohammad Yusuf Sarwar Uddin & Mohammad Mostofa Akbar & Salahuddin Mohammad Masum, 2009. "Hierarchical Numbering Based Addressing and Stateless Routing Scheme for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 5(5), pages 391-428, October.
    • Handle: RePEc:sae:intdis:v:5:y:2009:i:5:p:391-428
    DOI: 10.1080/15501320701585634
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320701585634
    Download Restriction: no
    File URL: https://libkey.io/10.1080/15501320701585634?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:5:y:2009:i:5:p:391-428. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.