Lifetime Analysis of Reliable Wireless Sensor Networks

S. Baydere, Y. Safkan, O. Durmaz

    Research output: Contribution to journalArticleAcademicpeer-review

    21 Citations (Scopus)

    Abstract

    A wireless sensor network is comprised of a large number of battery-limited sensor nodes communicating with unreliable radio links. The nodes are deployed in an ad hoc fashion and a reverse multicast tree is formed in the target domain. The sink node disseminates a query and collects responses from the sensors over pre-established links. Survivability in wireless sensor networks reflects the ability of the network to continue to detect events in the case of individual node failures. We present a sender initiated path switching algorithm that enables the immediate sender to change the packet's route dynamically when its parent on the reverse path is down. The overall effect of path switching on the survivability is analyzed as a measure of reliable event delivery. Using independent battery capacities, an analytical model of a multihop network is derived. The model is used to predict the maximum network lifetime in terms of total transmitted messages; which is in turn used to verify the correctness of our simulations. The results have revealed that dynamic path switching has a better performance than static multipath routing and salvaging schemes. It has also been shown that the proposed approach enhances reliability up to 30% in some topologies.
    Original languageUndefined
    Pages (from-to)2465-2472
    Number of pages8
    JournalIEICE transactions on communications
    VolumeE88-B
    Issue number6
    DOIs
    Publication statusPublished - 2005

    Keywords

    • IR-54504
    • METIS-228760
    • CAES-PS: Pervasive Systems
    • EWI-683

    Cite this