2nd International ICST Conference on Communications and Networking in China

Research Article

DLEC: A Delay-constrained Least Energy Consumption Routing Protocol in Sensor Networks

  • @INPROCEEDINGS{10.1109/CHINACOM.2007.4469509,
        author={Jue Hong and Hao Han and Sanglu Lu and Daoxu Chen and Li Xie},
        title={DLEC: A Delay-constrained Least Energy Consumption Routing Protocol in Sensor Networks},
        proceedings={2nd International ICST Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2008},
        month={3},
        keywords={Costs  Delay  Energy consumption  Heuristic algorithms  Laboratories  Monitoring  Ocean temperature  Routing protocols  Temperature sensors  Wireless sensor networks},
        doi={10.1109/CHINACOM.2007.4469509}
    }
    
  • Jue Hong
    Hao Han
    Sanglu Lu
    Daoxu Chen
    Li Xie
    Year: 2008
    DLEC: A Delay-constrained Least Energy Consumption Routing Protocol in Sensor Networks
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2007.4469509
Jue Hong1,*, Hao Han1,*, Sanglu Lu1,*, Daoxu Chen1,*, Li Xie1,*
  • 1: State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University, Nanjing 210093, China
*Contact email: jhong@dislab.nju.edu.cn, hanhao@dislab.nju.edu.cn, sanglu@nju.edu.cn, dxchen@nju.edu.cn, xieli@nju.edu.cn

Abstract

Current researches on routing protocol in sensor network mainly pursue a single metric such as the minimum delay or the maximum power saving. As the application requirements become more and more complex, the two metrics need to be considered simultaneously in routing protocol design. This problem has been proved NP-Complete and many existing heuristic algorithms in traditional wired/wireless network cannot be applied in sensor network because of the scarce resource of sensor nodes. We propose a heuristic routing protocol DLEC (Delay-constrained Least Energy Consumption) in sensor network single-source single-sink scenario here, which costs the least energy while meeting the delay constraint. This protocol bases on the searching-path set generated by AMODV multi-path construction algorithm, makes use of the local information of each node and the dynamic programming strategy. The theoretical proof and simulation show that this protocol does come up to our expectations.