Energy-Efficient Routing Algorithms for Ad-Hoc Wireless Networks

• Main Authors: Yu-Hsin Wang, 王宇歆
• Other Authors: Hwang-Chang Wang
• Format: Others
• Language: en_US
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/52647794950081041218

碩士 === 國立宜蘭大學 === 電子工程學系碩士班 === 95 === Ad-hoc wireless networks consist of wireless mobile hosts, without any centralized control point or fixed infrastructure. The communication of mobile hosts in ad-hoc wireless networks is accomplished via interchanging messages between nearby mobile hosts. Energy consumption issue is an important research topic in ad-hoc wireless networks because wireless mobile hosts in such networks are constrained by limited battery power. This thesis describes two novel routing algorithms called Minimum Energy Cost Routing (MECR) and Minimum Energy and Jam Cost Routing (MEJCR) that take into account the effect of distance between nodes, the full-scale energy and initial (or remaining) energy of the battery and network congestion level on energy consumption. Our algorithms adapt the AODV (Ad-Hoc On Demand Routing Protocol) routing protocol to improve performance in terms of energy conservation and other performance metrics. We also formulate the routing problem as the minimization of energy cost functions which reflect the key features of the problem under consideration. Finally, we perform simulation to compare the performance between our routing algorithms and existing AODV and PSR (Power-aware Source Routing Protocol) schemes. We further use confidence interval and confidence level raising the credibility of simulation results. Simulation results show that our routing schemes are more efficient than existing well-known routing protocols.