An efficient graph search algorithm for backbone discovery in wireless linear sensor networks

Imad Jawhar, Jie Wu, Nader Mohamed, Sheng Zhang

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)

    Abstract

    Wireless sensor networks (WSNs) is an area of research that has been getting a lot of attention lately. This is due to the rapid advancements in the design of wireless devices which have increasingly more processing, storage, memory, and networking capabilities. In addition, the cost of sensors is constantly decreasing making it possible to use large quantities of these sensors in a wide variety of important applications in environmental, military, commercial, health care, and other fields. In order to monitor certain types of infrastructures, many of these applications involve lining up the sensors in a linear form, making a special class of these networks which are defined in this work as Linear Sensor Networks (LSNs). In a previous paper, we introduced the concept of LSNs along with a classification of the different types of LSNs, a sample of their applications and the motivation for designing specialized protocols that take advantage of the linearity of the network to enhance their communication efficiency, reliability, fault tolerance, energy savings, and network lifetime. This paper presents a graph-search-based topology discovery algorithm for LSNs. New definitions for important structure and design parameters are introduced. The proposed protocol allows the nodes to identify some nodes to be included in a backbone, which can be used by the other nodes to send data to the sink at the end of the LSN or LSN segment. This backbone discovery increases the efficiency, and robustness of the network. It also allows for significant improvement in the scalability of the communication process in the LSN which can contain a very large number of nodes (e.g. Hundreds or thousands). In addition, the linearity of the structure and the discovered backbone can enhance the routing reliability by "jumping" over failed nodes by increasing the range. Furthermore, the protocol does not require the nodes to have location detection capabilities such as GPS, which would lead to a more complex design and higher cost of the sensor nodes.

    Original languageEnglish
    Title of host publicationProceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages604-609
    Number of pages6
    ISBN (Electronic)9781467391009
    DOIs
    Publication statusPublished - Dec 28 2015
    Event12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015 - Dallas, United States
    Duration: Oct 19 2015Oct 22 2015

    Publication series

    NameProceedings - 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015

    Other

    Other12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2015
    Country/TerritoryUnited States
    CityDallas
    Period10/19/1510/22/15

    Keywords

    • Ad hoc and sensor networks
    • backbone discovery
    • routing
    • wireless networks

    ASJC Scopus subject areas

    • Instrumentation
    • Computer Networks and Communications
    • Signal Processing

    Fingerprint

    Dive into the research topics of 'An efficient graph search algorithm for backbone discovery in wireless linear sensor networks'. Together they form a unique fingerprint.

    Cite this