| Summary: | 碩士 === 國立雲林科技大學 === 電機工程系碩士班 === 93 === At present, it is a popular research field to extend the lifetime of ad hoc networks. It is very important to design efficient routing algorithms to maximize the network lifetime. The network lifetime is related to the assignment of transmission power on each node. Generally, the power assignment problems can be divided into the static mode and the dynamic mode. In the static power assignment mode, the transmission power level of each node is fixed until the first node exhausts its residual power. On the other hand, the transmission power level is adjustable before the first node exhausts its residual power in the dynamic power assignment problem. These days, the quality of service becomes more and more important. For example, the transmission with larger delay is unacceptable in ad hoc networks. Most of the researches on the network lifetime did not take the delay bound between source nodes and destination nodes into consideration. Therefore, how to design efficient algorithms to maximize the network lifetime and satisfy the delay limit is a worthy issue to investigate.
In this thesis, we will discuss the quality of service in terms of delay bound at dynamic power assignment mode in ad hoc networks, and design efficient broadcast routing algorithms to maximize the network lifetime. We will name this problem as the lifetime maximization with bound-hop broadcast routing problem (or LMBHMR for short). To solve this problem, we will develop a linear programming formula and two heuristic algorithms (LMBHBR_DA and LNBHBR_LA). We will evaluate their performances and compare them with an existing algorithm (RNDGREEDY) by computer simulations. The simulation results reveal that our LMBHBR_HA can generate longer network lifetimes than other heuristic algorithms.
|
|---|
