在無線行動隨建即連網路 (wireless mobile ad hoc networks)上，行動主機要互相通訊，常常使用廣播機制。但是過去的氾洪法廣播機制，會導致嚴重的重複、競爭和碰撞。在每次廣播時，每個主機都必須耗損傳輸與接收的電量，這對於電量受到限制的行動配備來說一大負擔，如果行動主機因此而快速的耗盡電量，將造成網路的不穩定。因此本論文設計幾個平衡電量廣播演算法，希望網路上的高電量行動主機能夠進行重播 (rebroadcasting) 的動作，而低電量的行動主機則減少重播的次數，藉此平衡網路上主機的剩餘電量。行動主機利用剩餘電量，以及鄰居剩餘電量及個數，來決定重播機率，主機剩餘電量越多，則重播的機率越高。模擬結果顯示，使用我們的電量平衡演算法，可以有效平衡網路上行動主機的電量，大幅減少主機剩餘電量的標準差，並延長網路的存活時間。

Broadcasting is an important operation in a mobile ad hoc network (MANET). A straightforward approach to perform broadcast is by flooding. Unfortunately, flooding will cause some problems such as redundancy, contention, and collision. The Power-consuming features of flooding will lead to rapid battery exhaustion which will cause network unreliable. Hence, how to balancing remaining power of mobile hosts is a critical issue for a MANET. Our proposed power balance broadcast algorithms incorporate the residual battery energy of hosts into rebroadcast criterion. Each host rebroadcasts with a rebroadcasting probability, which is dynamically calculated by hosts’ residual power, number of neighbors, and average residual power of neighbors. Hence, low-power hosts broadcast with lower probability and high-power hosts broadcast with higher probability. We inhibit low-power hosts from frequently rebroadcasting to balance the remaining power of hosts and extend the lifetime of the network. According to the simulation results, power balance broadcast algorithms compared with the flooding approach can increase network lifetime by around 40%, reduce the standard deviation by 35%, and save a half of rebroadcasting. Our approach can balance the remaining power of hosts with high reachability, even in high mobility environments.

[1] J. Broch, D.B. Johnson, and D.A. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” Internet Draft, draft-ietf-manet-dsr-00.txt, 1998.
[2] M. Cagalj, J.-P. Hubaux, and C. Enz, “Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues,” in Proceeding of the 27th Annual IEEE Conference on Local Computer Networks, pp.193-202, 2002.
[3] Z. Cai, M. Lu, and X. Wang, “Randomized Broadcast Channel Access Algorithms for Ad Hoc Networks,” in Proceeding of the International Conference on Parallel Processing, pp.151-158, 2002.
[4] T. ElBatt and A. Ephremides, “Joint Scheduling and Power Control for Wireless Ad-hoc Networks,” in Proceeding of the International Conference on computer communications, vol.2, pp.976 -984, 2002.
[5] L. Gruenwald, M. Javed, and M. Gu, “Energy-Efficient Data Broadcasting in Mobile Ad-Hoc Networks,” in Proceeding of the International Conference on Database Engineering and Applications Symposium, pp.64-73, 2002.
[6] Z.J. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” in Proceeding of the International Conference on computer communications, vol.3, pp.1707 -1716, 2002.
[7] Z.J. Haas and M.R. Pearlman, “The Zone Routing Protocol (ZRP) for Ad Hoc Networks,” Internet Draft, draft-haas-zone-routing-protocol-00.txt, 1997.
[8] P.-K. Hung, J.-P. Sheu, and C.-S. Hsu, “Scheduling of Broadcasts in Multihop Wireless Networks,” in Proceeding of the European Wireless Conference, pp163-169, 2002.
[9] M. Jiang, J. Li, and Y.C. Tay, “Cluster Based Routing protocol (CBRP) functional specification,” Internet Draft, draft-ietf-manet-cbrp-spec-00.txt, 1998.
[10] F. Li and I. Nikolaidis, “On Minimum-Energy Broadcasting in all-wireless Networks,” in Proceeding of the 26th Annual IEEE Conference on Local Computer Networks, pp.193-202, 2001.
[11] W. Lou and J. Wu, “On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks,” in Proceeding of the 36th Annual Hawaii International Conference on System Sciences, pp305-314, 2003.
[12] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relay:An Efficient Technique for Flooding in Mobile Wireless Networks,” INRIA Research Report RR-3898, 2000.
[13] M. Maleki, K. Dantu, and M. Pedram, “Power-Aware Source Routing Protocol for Mobile Ad Hoc Networks,” in Proceeding of the International Symposium on Low Power Electronics and Design, pp.72-75, August, 2002.
[14] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Wireless Mobile Ad Hoc Network,” in Proceeding of the International Conference on Mobile Computing and Networking, pp.151-162, Aug, 1999.
[15] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” ACM SIGCOMM ’94 Computer Communications Review 24(4): 234 - 244, October, 1994.
[16] Y.-C. Tseng, S.-Y. Ni, and E.-Y. Shih, “Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multi-hop Mobile Ad Hoc Network,” in Proceeding of the 21st International Conference on Distributed Computing Systems, pp. 481-488, 2001.
[17] C.E. Perkins and E.M. Royer, “Ad Hoc on Demand Distance Vector (AODV) Routing,” IETF Internet draft, draft-ietf-manet-aodv-12.txt, November 2002
[18] C.-C. Yang and C.-Y. Chen, “A Reachability-Guaranteed Approach for Reducing Broadcast Storms in Mobile Ad Hoc networks,” in Proceeding of the 56th Vehicular Technology, vol.2, 2002
[19] LAN MAN Standards Committee of the IEEE Computer Society, editor. IEEE STD 802.11-1997, “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications,” Nov, 1997.
[20] “The Network Simulator – Glomosim”, http://pcl.cs.ucla.edu/projects/glomosim/