Analytical comparisons of query-broadcast repealing schemes in MANETs

Recent research in mobile ad-hoc networks (MANETs) mostly deals to minimize the broadcast expenses of route discovery by controlling the query-broadcast. In this regard, a variety of broadcast-repealing schemes have been proposed, and employed to improve effectiveness and efficiency in various aspects of route-discovery considering time and energy. These schemes mainly focus on reducing unnecessary propagation of route-query by repealing the query-broadcast. Time-to-live based broadcast is the most common controlled-flooding scheme widely used in routing protocols. Recently some other broadcast-repealing schemes are proposed which work based on chasing-policy. The critical and analytical assessment to evaluate these schemes such aspects is of great importance. In this paper, we investigate their query-diffusion process, and their merits and demerits.

[1]  Ameer Ahmed Abbasi,et al.  A survey on clustering algorithms for wireless sensor networks , 2007, Comput. Commun..

[2]  Naeem Ahmad,et al.  Broadcast Expenses Controlling Techniques in Mobile Ad-hoc Networks: A Survey , 2016, J. King Saud Univ. Comput. Inf. Sci..

[3]  Mingyan Liu,et al.  Revisiting the TTL-based controlled flooding search: optimality and randomization , 2004, MobiCom '04.

[4]  David Sarne,et al.  Two-sided expanding ring search , 2014, 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS).

[5]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[6]  Naeem Ahmad,et al.  Power saving technique for controlled broadcast of query packet in MANETs , 2017 .

[7]  Yuji Shen,et al.  Analytical Studies of Energy–Time Efficiency of Blocking Expanding Ring Search , 2010, Math. Comput. Sci..

[8]  Carlos Baquero,et al.  Broadcast cancellation in search mechanisms , 2013, SAC '13.

[9]  Naeem Ahmad,et al.  Minimizing Broadcast Expenses in Clustered Ad-hoc Networks , 2018, J. King Saud Univ. Comput. Inf. Sci..

[10]  Lin Dai,et al.  Routing strategies in multihop cooperative networks , 2009, IEEE Trans. Wirel. Commun..

[11]  Ida Pu,et al.  Blocking Expanding Ring Search Algorithm for Efficient Energy Consumption in Mobile Ad Hoc Networks , 2006 .

[12]  Yuji Shen,et al.  Energy-time efficiency of two routing strategies with chase packets in expanding ring search , 2010, 2010 17th International Conference on Telecommunications.

[13]  Yuji Shen,et al.  Enhanced Blocking Expanding Ring Search in Mobile Ad Hoc Networks , 2009, 2009 3rd International Conference on New Technologies, Mobility and Security.

[14]  Srikanth V. Krishnamurthy,et al.  Cluster-based congestion control for sensor networks , 2008, TOSN.

[15]  Daniel Stamate,et al.  Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks , 2014, J. Discrete Algorithms.

[16]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[17]  Naeem Ahmad,et al.  Cluster Based Controlling of Route Exploring Packets in Ad-Hoc Networks , 2014 .