ABSTRACT
Gossip-based packet forwarding is used in unstructured networks is to reduce traffic overhead in dense networks and to minimize early gossip termination in sparse networks. Unlike in flooding, where packets are forwarded to all the neighbors, in Gossip-based protocols packets are forwarded with some probability value p<1, to reduce redundancy. However this value has to be carefully tuned: if too small, early gossip termination is likely to occur, if too large, flooding storms can take place, as with the flooding protocol. In this work, we propose to use a forwarding probability based on local topology indicators, such as the effective node degree of the forwarding node: the choice of such probability takes into account the local topology. In a context where each node can have a different forwarding probability, another way of setting efficiently its value consists in further tuning such value for each message, based on the estimated level of completion of the corresponding communication task: to this purpose we propose to use a simple formula based on the messages hop-count. We validate these approaches by simulation using ns-2 in sparse and dense networks and show that they improve the performances in terms of traffic overhead and average end-to-end delay. In terms of packet delivery ratio, the proposed approach yields results comparable to those of the standard protocol AODV.
- D. Huynh A. Amis, R. Prakash and T. Vuong. Max-min d-cluster formation in wireless ad-hoc networks. INFOCOM., 2001.Google Scholar
- C. Hauser W. Irish J. Larson-S. Shenker-H. Sturgis D. Swinehart A. Demers, D. Greene and D. Terry. Epidemic algorithms for replicated database maintenance. In Proceeding of ACM Symposium, Principles of Distributed Computing, 1987. Google ScholarDigital Library
- S. Ade and P. Tijar. Performance comparisons of aodv, dsdv, dsr routing protocols in mobile ad-hoc networks. International Journal of Information Technology and Knowledge Management, 2010.Google Scholar
- R. Annu and M. Reema. Performance evaluation and study of routing protocols: Manet vs vanet. International Journal of Advanced Engineering Research and Science (IJAERS), Apr- 2017, 2017.Google Scholar
- S. Anubhava and A. Parvez. A probabilistic gossip-based secure protocol for unstructured p2p networks. International Conference on Information Security and Privacy (ICISP2015),11--12 December 2015, Nagpur, INDIA, Vol. 78:595 -- 602.Google Scholar
- W. Liu C. Chiang, H. K. Wu and M. Gerla. Routing in clustered multi-hop, mobile wireless networks with dading channel. SICON, Singapore, 1997.Google Scholar
- C. Belding C. Perkins and E. Das. Ad-hoc on-demand distance vector (aodv) routing. RFC-3561 Network Working Group, 2013. Google ScholarDigital Library
- V.Sujitha C. Rangarajan, S.Sridevikarumari. Recent routing protocols in mobile adhoc network (manet). International Journal of Advanced Research in Computer and Communication Engineering, ICITCSA 2017, Vol. 6, Special Issue 1, 2017.Google Scholar
- A. Dobra D. Kempe and J. Gehrke. Gossip-based computation of aggregate information. In IEEE Symposium on Foundations of Computer Science (FOCS'03), 2003. Google ScholarDigital Library
- B. Johnson David and A. Maltz David. Dynamic source routing in ad-hoc wireless networks. Mobile Computing, Vol. 5:pp. 153--181, 1996.Google ScholarCross Ref
- Gabriele Gianini Dawit Kifle and Mulugeta Libsie. Improving gossiping performance by means of local topology information. In Proceedings of the 7th International Conference on Management of Computational and Collective Intelligence in Digital EcoSystems - MEDES 2015, pages 142--147, 2015. Google ScholarDigital Library
- S. Dhurandher and G. V. Singh. Weight-based adaptive clustering in wireless ad-hoc networks. IEEE, 2005.Google ScholarCross Ref
- G. Dommety and R. Jain. Potential networking applications of global positioning systems (gps). Technical report TR-24, 1996, The Ohio State University, USA, 1996.Google Scholar
- X. Wang X. Xue F. Li, S. Zhang and H. Shen. Vote-based clustering algorithm in mobile ad-hoc networks. In Proceedings of the International Conference on Networking Technologies, 2004.Google ScholarCross Ref
- Gabriele Gianini and Ernesto Damiani. Do neighbor-avoiding walkers walk as if in a small-world network? In INFOCOM Workshops 2009, IEEE, pages 1--6. IEEE, 2009. Google ScholarDigital Library
- Gabriele Gianini and Ernesto Damiani. Neighbor-avoiding random walks for information dissemination. Communications of SIWN, 7:108--113, 2009.Google Scholar
- Gabriele Gianini and Ernesto Damiani. The cover time of neighbor-avoiding gossiping on geometric random networks. In Digital Ecosystems and Technologies (DEST), 2013 7th IEEE International Conference on, pages 7--12. IEEE, 2013.Google ScholarCross Ref
- Gabriele Gianini, Ernesto Damiani, Guido Lena-Cota, and Paulius Danielius. Gossiping solutions for distributed consensus on unstructured overlays. In Digital Ecosystems and Technologies (DEST), 2010 4th IEEE International Conference on, pages 246--251. IEEE, 2010.Google ScholarCross Ref
- A. Haider and A. Raed. Routing discovery scheme for high mobility in manet. ARPN Journal of Engineering and Applied Sciences, Asian Research Publishing Network (ARPN), Jan. 2017, Vol. 12, No. 2, 2017.Google Scholar
- Z. H. J. Halpern and L. Li. Gossiping-based ad-hoc routing. In proceedings of IEEE INFOCOM 200, The 21st Annual Joint Conference of the IEEE Computer and Communications Societies, 2002.Google Scholar
- Z. H. J. Halpern and L. Li. Gossiping-based ad-hoc routing. IEEE/ACM Transactions on Networking (TON), Vol. 14, Issue 3:pp.479--491, 2006. Google ScholarDigital Library
- B. Johnson H. Yih-Chun J. Brothh, A. Maltz and J. Jo-eta. A performance comparison of multi-hop wireless ad-hoc network routing protocols. In proceeding MobiCom 98 Proceedings of the 4th annual ACM/IEEE International Conference on Mobile Computing and Networking1998, New York, USA), pages pp. 85--97, 1998. Google ScholarDigital Library
- P. Eugster J. Luo and J. Haubaux. Route driven gossip: Probabilistic reliable multicast in ad-hoc networks. INFOCOM, 2003.Google ScholarCross Ref
- B. Jagdale and P. Pragati. Analysis and comparison of distance vector, dsdv and aodv protocols in manets. International Journal of Distributed and Parallel Systems (IJDPS), 2012.Google ScholarCross Ref
- H. Sadawarti K. Gupta and K. Verma. Review of various routing protocols for manets. International Journal of Information and Electronics Engineering, Vol. 1, No. 3, 2011.Google Scholar
- J. Kaur and G.Singh. Manet routing protocols: A review. JCSE-International Journal of Computer Sciences and Engineering, Volume-5, Issue-3, 2017.Google Scholar
- Z. Lingling L. Yang L. Tianbo, C. Hao. Anonymous routing protocols for mobile ad-hoc networks. International Journal of Security and Its Applications, 2016, Vol. 10, No. 4, 2016.Google Scholar
- A. Rehan Ashraf M. Toqeer, N. Tabassam and M.A. Syed. Gossip based routing protocol design for ad hoc networks. IJCSI International Journal of Computer Science, January 2012, Vol. 9, Issue 1, 2012.Google Scholar
- P. T. Omar V. Sejwar P. Suman, D. Bisen and R. Shukla. Comparative study of routing protocols for mobile ad-hoc networks. International Journal of Information Technology and Knowledge Management, 2009.Google Scholar
- C. Perkins and C. Royer. Ad-hoc on-demand distance vector (aodv) routing. In Proceedings of the IEEE Workshop on Mobile Computing System and Applications, Vol. 8 No.8:pp. 533--546, 1999. Google ScholarDigital Library
- C. E. Perkins and T. J. Watson. Highly dynamic destination sequenced distance vector routing (dsdv) for mobile computers. In ACM SIGCOMMÕ94 Conference on Communications, 1994. Google ScholarDigital Library
- S. Rajeswari and Y. Venkataramani. An adaptive energy efficient and reliable gossip routing protocol for mobile ad-hoc networks. IJCTE, 2010.Google Scholar
- D. Ratul and N. Himadri. Secure routing protocols for mobile ad-hoc network (manets) --a review. International Journal of Emerging Trends and Technology in Computer Science (IJETTCS), Jan. - Feb. 2016, Volume 5, Issue 1, 2016.Google Scholar
- E.M Royal and T. Chia-Keong. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communication, 1999, Dallas Texas USA, pages pp. pp. 45--55, 1999.Google Scholar
- K. Aditi S. Rajeshwar, S. Tarun. A comparative review on routing protocols in manet.Google Scholar
- C. Yuh-Shyan-S. Jang-Ping T. Yu-Chee Tseng, N. Sze-Yao. The broadcast storm problem in a mobile ad-hoc networks. Wireless Networks, Vol. 8:pp. 153--167, 2002. Google ScholarDigital Library
- R. Hamid R J.J. Garcia-Luna-Aceves X. Hui, W. Xianren. A unified analysis of routing protocols in manets. IEEE TRANSACTIONS ON COMMUNICATIONS., VOL. 58, NO, 2010. Google ScholarDigital Library
- Y. Xuan and F. Sheng. An entropy-based weighted clustering algorithm and its optimization for ad-hoc networks. Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007), 2007. Google ScholarDigital Library
- K. Young-Bae and H. Vaidya Nitin. Location-aided routing (lar) in mobile ad-hoc networks. Wireless Networks, Vol. 6:pp. 307--321, 2000. Google ScholarDigital Library
- Local Topology Aware Probabilistic Routing
Recommendations
Energy-Aware Gossip Routing for Mobile Ad Hoc Networks
HPCC '11: Proceedings of the 2011 IEEE International Conference on High Performance Computing and CommunicationsBroadcasting is a communication model for a node to emit the packets via wireless channels to its neighbor nodes. In mobile ad hoc networks (MANETs), it is commonly implemented through flooding to find routes, send alarm signals and page a particular ...
Improving gossiping performance by means of local topology information
MEDES '15: Proceedings of the 7th International Conference on Management of computational and collective intElligence in Digital EcoSystemsIn unstructured networks, gossiping protocols prescribe that a message, received by a node, is not forwarded with certainty to all its neighbors (as happens in flooding protocols), but only with some finite probability. Typically, in order to make the ...
Irresponsible AODV routing
Broadcasting is a common transmission strategy used by several ad-hoc routing protocols in order to solve many issues, such as finding a route to a new host or sending control messages to all nodes in the network. Flooding is the simplest technique to ...
Comments