在過去的短短幾年間，由於無線裝置的快速蓬勃發展，及網路社群對行動通訊的高度興趣，無線網路吸引了許多關注。在Ad Hoc無線網路中 ，由來源發起的多重廣播的通訊協定裡，所有行動是屬於連結導向的。為了決定這個通訊協定，其演算法通常是中央集權式的，並且需要從連續的電力值中決定到達下一個節點的必要最小無線電頻率傳輸電力。當行動節點裝配了如全球定位系統（Global Positioning System）的定位設備，每一個節點能依據全球定位系統所提供的數據，更新自己局部的網路拓樸快照。

　　在大部分以樹狀結構為基礎的多重廣播協定，以這快照來產生Steiner tree，並且假設在拓樸理的所有連結，其成本都是相等的。在本篇論文中，提出一個新的無線網路之離散式層次電力與有效多重廣播之通訊協定，來增進電力消耗與多重廣播的效率。依據相鄰節點的不同距離，本篇論文提出的協定，能夠從一個有限的離散電力層次中，選擇傳輸電力。然後, 依循之前的研究Sequence and Topology Multicast Protocol(STMP)協定，在封包中傳送多重廣播的選擇路徑，本協定在封包中只加入多重廣播節點串列與前送節點字串，即可產生有效率的多重廣播選擇路徑。
本協定在30至60個節點的Ad Hoc無線網路，以不同數量的多重廣播群組結點進行模擬，與STMP比較，由模擬所得的數據中顯示，可以的減少54%的負擔，並在電力消耗上可以減少63%。

　　Wireless network has been attracting a lot of attention during the past few years due to a rapid expansion of wireless devices and the network community’s interest in mobile communications. In wireless ad hoc networks, the source-initiated multicast protocol for the communications of all mobile nodes is connection-oriented. To determine the multicast protocol, the algorithm is usually centralized and needs the exact transmitted power of the minimal necessary RF power which picks up from a continuum of values to reach the next node. When the mobile nodes are equipped with positional system devices, such as Global Positioning System (GPS) devices, each node can update its local snapshot of the network topology according to the measures from the GPS unit.

　　Most tree-based multicast protocols use the snapshot to generate a Steiner tree assuming that the cost of all links in the topology is equal. In this thesis, we introduce a novel discrete power level and efficient multicast protocol for ad hoc networks to improve the efficiency of power consumption and multicast performance. According to the variation distance of adjacent nodes, our proposed protocol can change the transmitting power by choosing from a finite, discrete set of power levels. Then, we use the Sequence and Topology Multicast (STMP) Protocol, to carry the multicast routing information in the packet head and make an efficient multicast routing by just adding the multicast group list and a forwarding node string.

　　The protocol has been simulated in ad hoc networks with 30 and 60 nodes and with different multicast group sizes. We have shown that the overhead can be reduced by up to 54%, and power consumption by up to 63% compared with the STMP.

[1] C.-C. Chiang and M. Gerla. Routing and multicast in mobile wireless networks. In Proceeding of 1997 IEEE 6th International Conference on Universal Person Communication Record. Bridging the way to the 21st Century, ICUPC’97, volume 2, pages 557-561, san Diego, CA, 12-16 October 1997.

[2] C.-C. Chiang and M. Gerla. On-demand multicast in mobile wireless networks. In proceedings of IEEE ICNP’98, Austin, TX, 1998.

[3] C.-C. Chiang, M. Gerla, and L. Zhang. Adaptive shared tree multicast in mobile wireless networks. In Proceedings of Globecom’98, IEEE Global Telecommunications Conference, Sydney, Australia, November 8-12 1998.

[4] D. J. Baker and A. Ephremides, “The Architectural Organization of a Mobile Radio Network via Distributed Algorithm,” IEEE Trans. Commun., COM-29, pp.1694-7901, November 1981.

[5] E. Bommaiah, M. Liu, A. McAuley, and R. Talpade, “AMRoute: Adhoc Multicast Routing Protocol,” Internet-Draft, draft-talpade-manet-amroute-00.txt, Aug. 1998, Work in progress.

[6] E.M. Palmer. Graphical Evolutions: An Introduction to the Theory of Random Graphs. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, New York, 1985.

[7] E. M.Royer and C. E. Perkins. Multicast using ad-hoc on-demean distance vector routing. IN Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom’99, Seattle, WA, 15-20 August 1999.

[8] F. K. Hwang, D. S. Richards, and P. winter, The Steiner Tree Problem. Number 53 in Annals of Discrete Matematics. Morth-Holland, The Netherlands, 1992.

[9] H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Math. Jap., 24:573-577,1980.

[10] J. E. wieselthier, G.D. Nguyen, and A. Ephremides, “On the Cnstruction of Energy-efficient Broadcast and Multicast Trees in Wireless Networks,” Proc. IEEE INFOCOM 2000, March 2000, pp. 585–594.

[11] J .J. Garcial-Luna-Aceves and E. L. Madruga. The core-assisted mesh protocol. IEEE Journal on Selected Areas In Communications, Special Issue on Wireless Ad Hoc Networks, 17(8):1380-1394, August 1999.

[12] J.J. Garcia-Luna-Aceves and E.L. Madruga, “Core-Assisted Mesh Protocol,” IEEE Journal On Selected Areas in Communications, Vol. 17, no. 8, Aug. 1999, pp. 784-792.

[13] J. M. McQuillan and D. C. Walden, “The ARPA Network Design Decisions,” in Computes Network, vol. 1, pp. 243-289, August 1977.

[14] M. Zorzi, R.R. Rao, “Error Control and Energy Consumption in Communications for Nomadic Computing,” IEEE Trans. on Computer, Vol. 46, No. 3, March 1997, pp. 279–289.

[15] N. Bambos, J.M. Rulnick, “Mobile Power Management for Maximum Battery Life Wireless Communication Networks,” Proc. of IEEE INFOCOM,, March 1996, pp. 443-450.

[16] P.-J. Wan, G. Calinsecu, X.-Y. Li, and O. Frieder, “Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM 2001, pp. 1162-1171, April 2001.

[17] S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A.Woodward. “A distance routing effect algorithm for mobility (DREAM)”. In proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom’98, pages 76-84, Dallas, TX, October 25-30 1998.

[18] S. Basagni, I. Chlamtac, and V. R. Syrotiuk. Geographic messaging in wireless ad hoc networks. In proceeding of IEEE 49th Annual International Vehicular Technology Conference, volumn 3, pages 1957-1961, Houston, TX, May 16-20 1999.

[19] S. Basagni, I. Chlamtac, V. R. Syrotiuk and R. Talebi, “On-Demand Location Aware Multicast (OLAM) for Ad Hoc Networks,” Wireless Communications and Networking Conference, 2000. WCNC, 2000 IEEE, Volume:3, pages 1323-1328.

[20] S.J. Lee, M. Gerla, and C.-C Chiang, “On-Demand Multicast Routing Protocol,” In Proceedings of IEEE WCNC’99, New Orleans, LA, Sep. 1999, pp. 1298-1304.

[21] Sung-Ju Lee; Su, W.; Hsu, J.; Gerla, M. and Bagrodia, R.; “A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols.” INFOCOM 2000, Nineteenth Annual Joint Conference of IEEE Computer and communications Societies. Proceedings, IEEE vol:2 :2000, pages 565-574.

[22] T. Ballardie, P. Francis, and J. Crowcroft. Core based tree (cbt): An architecture for scalable inter-domain multicast routing. In Proceedings of the ACM SIGCOMM’93, Communications Architectures, Protocols and Applications. Also Computer Communication Review, vol.23, no4,Oct. 1993, page 85-95, San Francisco, CA, 13-17 September 1993.

[23] Wieselthier, J.E.; Nguyen, G.D.; Ephremides, A. “Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks,” Mobile Networks and Applications (MONET), 6-3, pp. 251-263,June 2001.

[24] Wieselthier, J.E.; Nguyen, G.D.; Ephremides, A. “The effect of discrete power levels on energy-efficient wireless broadcast in ad hoc networks “Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on , Volume: 4 , 15-18 Sept. 2002 Page(s): 1655 -1659 vol.4.

[25] Wieselthier, J.E.; Nguyen, G.D.; Ephremides, A. “Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” to appear in Mobile Networks and Applications (MONET), 2002.

[26] Yueh-Min Huang and Tzu-Chiang Chiang “A Sequence and Topology encoding for Multicast Protocol (STMP) in wireless Ad Hoc Networks” Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT 2003. Proceedings of the Fourth International Conference on , Aug. 27 - 29, 2003 Page(s): 351 -355.