在無線隨意行動網路環境中，許多通訊協定會使用泛播作為傳送訊息的方法，因此有效率的泛播機制對於在無線網路中的訊息傳送是相當重要的。在此我們提出了一個基於凸包演算法所設計的泛播機制，我們提出的泛播機制只需要收集單躍傳輸範圍中鄰居節點資訊即可有效的發送泛播訊息。藉由凸包的概念所提出的泛播機制可以有效的避免無線網路中產生過多重複的泛播訊息，同時達到將訊息完整傳遞至網路中所有節點的要求，此外我們的泛播機制也具有低時間複雜度的優勢。我們更進一步的指出現有泛播演算法會產生的區域最佳化問題，進而改善我們的泛播機制去降低此問題所帶來的影響。實驗結果指出我們提出的泛播機制不僅可以有效的減少重複廣播的次數，同時維持良好的訊息傳達率。

Flooding is an essential and commonly used operation in mobile ad hoc networks. This paper proposes a convex hull-based flooding scheme that uses only 1-hop neighbor infor-
mation to e±ciently disseminate flooding messages. Using the concept of convex hull, the proposed flooding scheme avoids excessive and redundant rebroadcastings during mes-
sage dissemination with a time complexity of only O(n log h), where n is the number of a node's 1-hop neighbors and h is the number of forwarding nodes selected by a sender. The proposed flooding scheme guarantees full delivery. Further, this study addresses the local-optimal problem that commonly occurs in the sender-based flooding algorithms and modifies the proposed flooding scheme to alleviate the effects of this problem. Simulation results indicate that, compared with representative flooding schemes in the literature, the proposed flooding scheme more efficiently reduces the number of broadcasting nodes while still maintaining excellent message deliverability.

[1] Y. Cai, K.A. Hua, and A. Phillips. Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless ad hoc networks. In 24th IEEE International Performance,
Computing, and Communications Conference, 2005. IPCCC 2005., pages 347-354,April 2005.
[2] T. M. Chan. Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions. Discrete and Computational Geometry, 1996.
[3] R. L. Graham. An e±cient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, (1):132-133, 1972.
[4] T. L. Heath and Euclid. The Thirteen Books of the Elements (Euclid, Vol. 2{Books III-IX). Dover Publications, June 1956.
[5] R. A. Javis. On the identification of the convex hull of a finite set of points in the plane. Information Processing Letters, 2:18-21, 1973.
[6] D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, pages 153-181. Kluwer Academic Publishers, 1996.
[7] M. Khabbazian and V.K. Bhargava. Localized broadcasting with guaranteed delivery and bounded transmission redundancy. IEEE Transactions on Computers, 57(8):1072-1086, Aug. 2008.
[8] M. Khabbazian and V.K. Bhargava. E±cient broadcasting in mobile ad hoc networks.IEEE Transactions on, Mobile Computing, 8(2):231-245, Feb. 2009.
[9] G. D. Kirkpatrick and R. Seidel. The ultimate planar convex hull algorithm. SIAMJ. Comput., 15(1):287-299, 1986.
[10] T.D. Le and H. Choo. Efficient flooding scheme based on 2-hop backward information in ad hoc networks. In IEEE International Conference on Communications, 2008.
ICC '08., pages 2443{2447, May 2008.
[11] H. Liu, X. Jia, P.-J. Wan, X. Liu, and F.F. Yao. A distributed and efficient flooding scheme using 1-hop information in mobile ad hoc networks. IEEE Transactions on
Parallel and Distributed Systems, 18(5):658{671, May 2007.
[12] W. Lou and J. Wu. Double-covered broadcast (dcb): a simple reliable broadcast algorithm in manets, March 2004.
[13] W. Peng and X.-C. Lu. On the reduction of broadcast redundancy in mobile ad hoc networks. In Mobile and Ad Hoc Networking and Computing, 2000. MobiHOC. 2000 First Annual Workshop on, pages 129-130, 2000.
[14] C.E. Perkins and E.M. Royer. Ad-hoc on-demand distance vector routing. In Second IEEE Workshop on Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA '99., pages 90-100, Feb 1999.
[15] A. Qayyum, L. Viennot, and A. Laouiti. Multipoint relaying for flooding broadcast messages in mobile wireless networks. In System Sciences, 2002. HICSS. Proceedings
of the 35th Annual Hawaii International Conference on, pages 3866-3875, Jan. 2002.
[16] W. Su S.-J. Lee and M. Gerla. On-demand multicast routing protocol in multihop wireless mobile networks. volume 7, pages 441-453, Hingham, MA, USA, 2002.
Kluwer Academic Publishers.
[17] Y.-S. Chen S.-Y. Ni, Y.-C. Tseng and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In MobiCom '99: Proceedings of the 5th annual ACM/IEEE
international conference on Mobile computing and networking, pages 151-162, New York, NY, USA, 1999. ACM.
[18] Y. Sasson, D. Cavin, and A. Schiper. Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In IEEE, Wireless Communications and Networking,
volume 2, pages 1124-1130 vol.2, March 2003.
[19] Y.-C. Tseng, S.-Y. Ni, and E.-Y. Shih. Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network. IEEE Transactions on,
Computers, 52(5):545-557, May 2003.
[20] J. Wu and F. Dai. Broadcasting in ad hoc networks based on self-pruning. In Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE INFOCOM 2003., volume 3, pages 2240{2250 vol.3, March-3 April 2003.
[21] J. Wu and F. Dai. Efficient broadcasting with guaranteed coverage in mobile ad hoc networks. IEEE Transactions on Mobile Computing,, 4(3):259-270, May-June 2005.
[22] C.-C. Yang and C.-Y. Chen. A reachability-guaranteed approach for reducing broadcast storms in mobile ad hoc networks. In 2002 IEEE 56th Vehicular Technology
Conference, 2002. Proceedings. VTC 2002-Fall., volume 2, pages 1036{1040 vol.2,2002.
[23] Y. Yi, M. Gerla, and J.-K. Taek. E±cient °ooding in ad hoc networks: a comparative performance study. In IEEE International Conference on Communications, 2003.
ICC '03., volume 2, pages 1059-1063 vol.2, May 2003.