Broadcast cancellation in search mechanisms

Searching for resources over unstructured networks is usually supported by broadcast communication primitives. Ideally, the broadcast process should be cancelled as soon as possible after a successful discovery, to avoid flooding the entire network. However, cancelling an ongoing broadcast is challenging and may increase the number of exchanged messages. In this paper, we compare the cancellation mechanisms used by BERS and BERS with new proposed cancellation approaches BCIR and BCIR. The formulation of a simplified analytical model and the simulation results show that: i) it is possible to reduce the number of retransmitted messages, without increasing the latency observed in BERS; and ii) BCIR is more energy efficient, which can contribute to extend the availability of mobile battery powered devices.

[1]  Wendi B. Heinzelman,et al.  Flooding Strategy for Target Discovery in Wireless Networks , 2003, MSWIM '03.

[2]  Li Li,et al.  An Energy-Efficient Broadcast Protocol in MANETs: Design and Evaluation , 2010, 2010 8th Annual Communication Networks and Services Research Conference.

[3]  Xu Zhao,et al.  Multi-hop Routing for Wireless Network in Underground Mines , 2010, 2010 Asia-Pacific Conference on Wearable Computing Systems.

[4]  Ian F. Akyildiz,et al.  Dynamic Connectivity in Wireless Underground Sensor Networks , 2011, IEEE Transactions on Wireless Communications.

[5]  Ida Pu,et al.  Energy Efficient Expanding Ring Search , 2007, First Asia International Conference on Modelling & Simulation (AMS'07).

[6]  Yilun Shang Exponential random geometric graph process models for mobile wireless networks , 2009, 2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery.

[7]  Ahmed Yassin Al-Dubai,et al.  A new dynamic counter-based broadcasting scheme for Mobile Ad hoc Networks , 2011, Simul. Model. Pract. Theory.

[8]  Sandeep Suman,et al.  Enhanced AODV for wireless networks , 2010, 2010 IEEE 2nd International Advance Computing Conference (IACC).

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

[10]  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.

[11]  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.

[12]  Azzedine Boukerche,et al.  Routing protocols in ad hoc networks: A survey , 2011, Comput. Networks.

[13]  Fatos Xhafa,et al.  Modeling and performance analysis of networking and collaborative systems , 2011, Simul. Model. Pract. Theory.