Weitere Artikel dieser Ausgabe durch Wischen aufrufen
Broadcasting is the process of sending a packet from a node to all other nodes in a network. In wireless ad-hoc networks, broadcasting might involve forwardings from intermediate nodes known as forwarding nodes because some nodes could be located physically far away from the source and are not covered by transmissions from the source. Without proper control, broadcasting in wireless ad-hoc networks could result in many redundant transmissions. Partial Dominant Pruning (PDP) is one of the most efficient broadcast schemes available for wireless ad-hoc networks. It uses neighbourhood information to reduce broadcast redundancy while ensuring packet reachability to all nodes in a network. During a selection process in PDP, the considered forwarding node selects its forwarding nodes independently. If it is made aware of other forwarding nodes of the same previous hop, a better decision could be made. In this paper, a novel broadcast scheme for wireless ad-hoc networks based on PDP is proposed. We show that it outperforms PDP while not introducing any additional overhead.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on-demand distance vector routing. In Second IEEE workshop on mobile computing systems and applications, 1999. Proceedings. WMCSA’99, 1999 (Vol. 6, no. 3, pp. 90–100).
Lou, W., & Wu, J. (2002). On reducing broadcast redundancy in ad hoc wireless networks. IEEE Transactions on Mobile Computing, 1(2), 111–122. CrossRef
Yi, Y., Gerla, M., & Kwon, T. (2003). Efficient flooding in ad hoc networks using on-demand (passive) cluster formation. In Second annual Mediterranean ad hoc networking workshop ( Med-hoc-Net 2003) (pp. 1–10).
Utsu, K., & Ishii, H. (2010). Load-aware flooding over ad hoc networks enabling high message reachability and traffic reduction. In The fifth international conference on mobile computing and ubiquitous networking ( ICMU 2010) (pp. 3–4).
Hur, I., Le, T., Jo, M., & Choo, H. (2012). Regular tiling based flooding scheme for energy efficiency in wireless ad hoc networks. Journal of Internet Technology, 13(2), 257–272.
Qayyum, A., Viennot, L., & Laouiti, A. (2002). Multipoint relaying for flooding broadcast messages in mobile wireless networks. In Proceedings of the 35th Annual Hawaii International Conference on System Sciences ( HICSS) (Vol. 00 pp. 3866–3875). IEEE Comput. Soc. doi: 10.1109/HICSS.2002.994521.
Sasson, Y., Cavin, D., & Schiper, A. (2003). Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In Wireless communications and networking, 2003. WCNC 2003 (Vol. 2, pp. 1124–1130). IEEE.
Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., & Sheu, J.-P. (1999). The broadcast storm problem in a mobile ad hoc network. In Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking— MobiCom ’99 (pp. 151–162).
Liu, H., Wan, P., Jia, X., Liu, X., & Yao, F. (2006). Efficient flooding scheme based on 1-hop information in mobile ad hoc networks. In Proceedings of the 25th IEEE International Conference on Computer Communications ( INFOCOM 2006) (Vol. 00 pp. 1–12). IEEE. doi: 10.1109/INFOCOM.2006.17
Paruchuri, V., Durresi, A., & Jain, R. (2003). Optimized flooding protocol for ad hoc networks. In arXiv preprint cs/0311013 (pp. 1–10).
Arango, J., Degermark, M., Efrat, A., & Pink, S. (2004). An efficient flooding algorithm for mobile ad-hoc networks. In Proceedings of WiOpt.
Kwon, T. J., & Gerla, M. (2002). Efficient flooding with passive clustering (PC) in ad hoc networks. In ACM SIGCOMM computer communication review (pp. 44–56).
Lim, H., & Kim, C. (2000). Multicast tree construction and flooding in wireless ad hoc networks. In Proceedings of the 3rd ACM international workshop on modelling, analysis and simulation of wireless and mobile systems ( MSWIM) (pp. 61–68).
Sheng, M., Li, J., & Shi, Y. (2005). Relative degree adaptive flooding broadcast algorithm for ad hoc networks. IEEE Transactions on Broadcasting, 51(2), 216–222. CrossRef
Rahman, A., Hoque, M. E., Rahman, F., Kundu, S. K., & Gburzynski, P. (2009). Enhanced Partial Dominant Pruning (EPDP) based broadcasting in ad hoc wireless networks. Journal of Networks, 4(9), 895–904. CrossRef
Williams, B., & Camp, T. (2002). Comparison of broadcasting techniques for mobile ad hoc networks. In: Proceedings of the 3rd ACM international symposium on mobile ad hoc networking & computing— MobiHoc ’02 (pp. 194–205).
Lim, H., & Kim, C. (2001). Flooding in wireless ad hoc networks. Computer Communications, 24(3–4), 353–363. CrossRef
Even, S. (1979). Graph algorithms. Cambridge: Computer Science Press. MATH
Kadi, N., & Al Agha, K. (2008). Optimized mpr-based flooding in wireless ad hoc network using network coding. In Wireless days, 2008. WD’08. 1st IFIP (pp. 1–5).
Murugesan, M., & Krishnan, A. (2010). Reliable and efficient algorithm for broadcasting in asymmetric mobile ad hoc networks. International Journal of Computers and Applications, 4(5), 29–32. CrossRef
The network simulator—ns-2. http://www.isi.edu/nsnam/ns/. Accessed November 14, 2012.
Santi, P. (2005). Topology control in wireless ad hoc and sensor networks. ACM Computing Surveys, 37(2), 164–194. CrossRef
- Reducing Broadcast Redundancy in Wireless Ad-Hoc Networks with Implicit Coordination Among Forwarding Nodes
- Springer US