1st International ICST Conference on Communication System Software and MiddleWare

Research Article

Multicommodity Flow Based Routing in Wireless Sensor Network with Lifetime Latency Tradeoff

  • @INPROCEEDINGS{10.1109/COMSWA.2006.1665198,
        author={Kumar  Padmanabh and Rajarshi Roy},
        title={Multicommodity Flow Based Routing in Wireless Sensor Network with Lifetime Latency Tradeoff},
        proceedings={1st International ICST Conference on Communication System Software and MiddleWare},
        publisher={IEEE},
        proceedings_a={COMSWARE},
        year={2006},
        month={8},
        keywords={Multicommodity flow Wireless sensor network Maximum Lifetime routing Lifetime-Latency Tradeoff},
        doi={10.1109/COMSWA.2006.1665198}
    }
    
  • Kumar Padmanabh
    Rajarshi Roy
    Year: 2006
    Multicommodity Flow Based Routing in Wireless Sensor Network with Lifetime Latency Tradeoff
    COMSWARE
    IEEE
    DOI: 10.1109/COMSWA.2006.1665198
Kumar Padmanabh1,2,*, Rajarshi Roy1,2,*
  • 1: Department of Electronics and electrical Communication Engineering
  • 2: Indian Institute of Technology, Kharagpur, (WB), India
*Contact email: padmanabh@ece.iitkgp.ernet.in, royr@ece.iitkgp.ernet.in

Abstract

The wireless sensor network (WSN) is characterized with limited battery power and limited computation capability. This is why a WSN requires a power efficient and less complicated routing protocol. General routing protocols impose more communication responsibility on nodes with high battery power, thus forcing the nodes to lose energy soon. Flow based routing uses all possible flow paths so doesn't impose big communication responsibility on a single node. In this paper we have reinvented the well-established multicommodity flow algorithm to design a routing protocol for WSN. Our algorithm converge the flow to the edges having maximum difference of commodity across it, which is actual a shortest path algorithm in disguise. In contrast to the other existing similar routing protocol we have also considered edge capacity constraints. We have proved that such a routing protocol is stable and feasible. Additionally we have designed an algorithm to implement lifetime latency (delay) trade-off