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

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.