Minimum energy path planning for ad hoc networks

Danjie Chen, P.J. Lin
<span title="">2006</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="" style="color: black;">IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.</a> </i> &nbsp;
We introduce the problem of finding a path for a mobile node traveling from a source to a destination while communicating with at least one node from a set of stationary nodes in such a way that minimizes the transmission energy used in communication. We characterize this problem and introduce two algorithms. The first is a recursive algorithm useful for problems with one communication node. We show the limitations of this algorithm and how it can find suboptimal paths. The second algorithm,
more &raquo; ... discretized graph algorithm, can be applied to problems with more communication nodes. We find parameters that allow energy efficient paths to be found in suitable time. We demonstrate the applicability of the minimum energy path planning problem and how the discretized graph algorithm can be used in a more general context through an example.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1109/wcnc.2006.1683479</a> <a target="_blank" rel="external noopener" href="">dblp:conf/wcnc/ChenL06</a> <a target="_blank" rel="external noopener" href="">fatcat:qo47fhw74fffhfxeb57t67lrpm</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>