2nd International IEEE Conference on Communication System Software and Middleware

Research Article

Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks

  • @INPROCEEDINGS{10.1109/COMSWA.2007.382434,
        author={Indranil  Saha and Lokesh Kumar Sambasivan and Ranjeet Kumar Patro and Subhas  Kumar Ghosh},
        title={Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks},
        proceedings={2nd International IEEE Conference on Communication System Software and Middleware},
        publisher={IEEE},
        proceedings_a={COMSWARE},
        year={2007},
        month={7},
        keywords={Batteries  Communication system control  Costs  Distributed algorithms  Distributed control  Energy consumption  Energy efficiency  Fault tolerance  Network topology  Wireless sensor networks},
        doi={10.1109/COMSWA.2007.382434}
    }
    
  • Indranil Saha
    Lokesh Kumar Sambasivan
    Ranjeet Kumar Patro
    Subhas Kumar Ghosh
    Year: 2007
    Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks
    COMSWARE
    IEEE
    DOI: 10.1109/COMSWA.2007.382434
Indranil Saha1,*, Lokesh Kumar Sambasivan1,*, Ranjeet Kumar Patro1,*, Subhas Kumar Ghosh1,*
  • 1: Honeywell Technology Solutions Lab Pvt. Ltd. 151/1, Doraisanipalya, Bannerghatta Road, Bangalore 560 076, India
*Contact email: indranil.saha@honeywell.com, lokesh.sambasivan@honeywell.com, ranjeet.patro@honeywell.com, subhas.kumar@honeywell.com

Abstract

In wireless sensor networks, minimizing power consumption and at the same time maintaining desired properties in the network topology is of prime importance. In this work, we present a distributed algorithm for assigning minimum possible power to all the nodes in the wireless sensor network, such that the network is K-connected. In this algorithm, a node collects the location and maximum power information from all the nodes in its vicinity, and then it adjusts the powers of the nodes in its vicinity in such a way that it can reach all the nodes in the vicinity through K optimal vertex-disjoint paths. We prove that, if each node maintains K optimal vertex-disjoint paths to all the nodes in its vicinity then the resulting topology is globally K-connected, provided the topology obtained when all nodes transmit with their maximum power Gmax is K-connected. This topology control algorithm has been extended to mobile scenario and the proof of connectivity in the mobile scenario has been presented. Simulation results show that significant power saving can be achieved by using this algorithm.