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

An Improved Group-Based Neighbor Discovery Algorithm for Mobile Sensor Networks

Author

Listed:
  • Qiang Niu
  • Weiwei Bao
  • Shixiong Xia

Abstract

Wireless sensor networks have been widely used in a variety of commercial and military applications, which often require neighbor nodes to establish connection quickly. Due to high mobility of nodes, it is a challenging issue to reduce discovery delay. Most discovery designs are based on pairwise and fixed duty cycle, in which discovery is passively achieved when two nodes wake up at the same time. In order to further improve the efficiency of neighbor discovery in mobile sensor networks, this paper proposes an improved group-based neighbor discovery algorithm (IGND) which dynamically adjusts the nodes’ active time based on spatial properties. This paper describes the network model and the algorithm implementation in detail. Simulation results show that the improved algorithm has a good effect in reducing discovery latency and promoting discovery efficiency.

Suggested Citation

  • Qiang Niu & Weiwei Bao & Shixiong Xia, 2014. "An Improved Group-Based Neighbor Discovery Algorithm for Mobile Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 10(4), pages 803870-8038, April.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:4:p:803870
    DOI: 10.1155/2014/803870
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/803870
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/803870?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:10:y:2014:i:4:p:803870. 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.