In this work, we investigate the real design issues for the implementation of broadcast algorithms in the wireless mesh network. A control message is introduced to collect 2-hop neighbor information, select gateway nodes, and provide the compatibility with the wireless standard at one time. We design a flexible architecture above which it is easy to change the broadcast algorithm. For each broadcast algorithm, a three-phase execution concept is abstracted and devised, which simplifies the implementation. We evaluate and discuss five representative broadcast algorithms on the real-world testbed. Through comparing the reliability for the simple flooding algorithm in simulation with the one in the real-world testbed, we show that the simulation results significantly differ from testbed. We assume the main reason of the difference is that the simulators are unable to precisely reflect the packet error rates on overlapped collision domains. Thus, the evaluation of broadcast algorithms with the real-world testbed could reveal the properties of those algorithms more correctly. The lessons learned are the reliability credited to fewer collisions for the delay-based algorithms, the untrustworthy of probabilistic-based algorithms due to the decreasing re-transmission probability by hop count, the efficiency of domain-pruning algorithm because of the run-time gateway selection, and the different topology density and connectivity favoring different algorithms.
Through observing the experimental results, we show that every algorithm has its advantages and disadvantages. Therefore, in the future work, one improvement method could come from mixing the features of several broadcast algorithms together.
For example, in the domain-pruning algorithm, if a sender brings in the listening-during-delay concept used in SBA to actively listen whether the retransmissions are performed by its forwarders, the transmission failure would be reduced and the overall reliability could be raised. Another improvement idea resulting from the observation mentioned in chapter 4 is that different algorithms favor different scaled of mesh networks. Hence, in the future work, we will devise an adaptive broadcast algorithm that selects a most suitable algorithm from several implemented algorithms according to the observed topology in the runtime.
25
References
[1] C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath, “Flooding for reliable multicast in multi-hop ad hoc networks.” International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM), pp. 64–71, 1999.
[2] S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The broadcast storm problem in a mobile ad hoc network.” ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), pp. 151–162, 1999.
[3] Lou, W., Wu, J, “Toward broadcast reliability in mobile ad hoc networks with double coverage.” IEEE Trans. on Mobile Computing 6(2), pp. 148-163, 2007
[4] Plummer, D., “An Ethernet Address Resolution Protocol”. RFC 826, MIT-LCS, November 1982.
[5] IEEE 802.1D, “IEEE standard for local and metropolitan area networks--Common specifications--Medium access control (MAC) Bridges”, ANSI/IEEE Standard 802.1D, 1998.
[6] IEEE P802.11s/D1.06, “Draft amendment to standard IEEE 802.11: ESS Mesh Networking.” IEEE, work in progress, 2007.
[7] Zhang, Q., Agrawal, D.P., “Dynamic probabilistic broadcasting in manets.” Parallel and Distributed Computing 65(2), pp. 220-233, 2005.
[8] A Mohammed, M Ould-Khaoua, L Mackenzie: “An Efficient Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks.” Lecture Notes in Computer Science – Springer, 2007.
[9] Sun Qiang, Li Layuan, Chen Niansheng, Aziz S, “A Cross-Layer Design for Broadcast Algorithm in MANETs.” IEEE Wireless Communications, Networking and Mobile Computing, 2006, WiCOM 2006, 2006.
[10] Li Layuan, Zheng Feng, Chunlin Li and Qiang Sun, “A Distributed Broadcast Algorithm for Wireless Mobile Ad Hoc Networks.” Advances in Multimedia Modeling – Springer, 2007.
[11] Peng, W., Lu, X.-C, “On the reduction of broadcast redundancy in mobile ad hoc networks.” 1st ACM international symp. On Mobile ad hoc networking & computing (MOBIHOC), pp. 129–130, IEEE Press, Piscataway, NJ, USA, 2000.
[12] H. Lim and C. Kim, “Multicast tree construction and flooding in wireless ad hoc networks.” ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM), 2000.
[13] Lim, H., Kim, C., “Flooding in wireless ad hoc networks.” Computer Comm. 24(3–4),
26 pp. 353-363, 2001.
[14] Lou, W., Wu, J., “On reducing broadcast redundancy in ad hoc wireless networks.”
IEEE Trans. on Mobile Computing 1(2), pp. 111-123, 2002.
[15] Bin Shen, Bo Li, Bing-Xin Shi, “Improved Approach to Enhanced Internet Connectivity for Mobile Ad Hoc Networks.” Journal of Southeast University (English Edition), March 2007.
[16] Wu, J., Li, H., “On calculating connected dominating set for efficient routing in ad hoc wireless networks.” DIALM ’99: 3rd Int. Workshop on Discrete algorithms and Methods for Mobile Computing and Comm., pp. 7-14. ACM Press, New York, NY, USA, 1999.
[17] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint relaying: An efficient technique for flooding in mobile wireless networks.” Technical Report 3898, INRIA - Rapport de recherche, 2000.
[18] François Ingelrest, David Simplot-Ryl, “Maximizing the Probability of Delivery of Multipoint Relay Broadcast Protocol in Wireless Ad Hoc Networks with a Realistic Physical Layer.” 2nd International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2006), 2006.
[19] Keshavarz-Haddad, Alireza, Ribeiro, Vinay, Riedi, Rudolf, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks.” IEEE Communications Society on Sensor, Mesh and Ad Hoc Communications and Networks(SECON) , 2007.
[20] Hasegawa, Keigo, Fuji, Takeo, Umebayash, Kenta, Kamiya, Yukihiro, Suzuki, Yasuo,
“A Dialogue-based MAC Protocol for Efficient Broadcasting in Ad Hoc Networks.”
Mobile and Wireless Communications Summit, 16th IST, 2007.
[21] Williams, B., Camp, T., “Comparison of broadcasting techniques for mobile ad hoc networks.” 3rd ACM Int. Symp. on Mob. Ad Hoc Networking & Computing, pp.
194-205. ACM Press, New York, 2002.
[22] Talmai Brand˜ao de Oliveira, Victor Franco Costa, and Fab’ıola Greve, “On the Behavior of Broadcasting Protocols for MANETs Under Omission Faults Scenarios.”
Dependable Computing– Springer, 2007.
[23] I. F. Akyildiz, et al., “Wireless mesh networks: a survey.” Computer Networks, vol. 47, issue 4, Pages 445-487, 2005.
[24] J. Bicket, et al., "Architecture and evaluation of an unplanned 802.11b mesh network."
Proc. 11th Ann. Int’l Conf. Mobile Computing and Networking, pp. 31-42, 2005.
27
[25] J. Heidemann, N. Bulusu, J. Elson, C. Intanagonwiwat, K.-C. Lan, Y. Xu, W. Ye, D.
Estrin, and R. Govindan., “Effects of Detail in Wireless Network Simulation.” SCS Communication Networks and Distributed Systems Modeling and Simulation Conference, 2001.
[26] Kwan-Wu Chin, John Judge, Aidan Williams, Roger Kermode, “Implementation experience with MANET routing protocols.” ACM SIGCOMM Computer Communication Review, v.32 n.5, November 2002.
[27] F. Haq and T. Kunz, “Simulation vs. emulation: evaluating mobile ad hoc network routing protocols.” International Workshop on Wireless Ad-hoc Networks (IWWAN'05), May 2005.
[28] Wilson T.H. Woon, Tat-Chee Wan, “Performance evaluation of IEEE 802.15.4 wireless multi-hop networks: simulation and testbed approach.” InderScience International Journal of Ad Hoc and Ubiquitous Computing, pp. 57-66, 2008