An Energy Efficient Random Walk Based Expanding Ring Search Method for Wireless Networks

Wireless networks generate large amount of data. It is important to design energy efficient data search method since power of wireless nodes is finite. Expanding Ring Search (ERS) is a data search technique exploring for targets progressively, which is widely used to locate destinations or information in wireless networks. The existing studies on improving the energy efficiency of ERS cannot work without positioning systems. In this paper, we combine the technique of random walk with ERS, and propose a random walk based expanding ring search method (RWERS) for large-scale wireless networks. RWERS can work without using positioning systems, and improve the energy efficiency of ERS by preventing each node from transmitting the same request more than once using the technique of random walk. We compare RWERS with the optimal ERS strategy and CERS in networks with various shapes of terrains. The simulation results show that RWERS decreases the energy cost by 50% without decreasing in success rate compared with ERS, and has twice the success rate of CERS when the network is sparse. RWERS can be applied to various shapes of terrains better compared with CERS.

[1]  Alok Singh,et al.  A hybrid genetic algorithm for the minimum energy broadcast problem in wireless ad hoc networks , 2011, Appl. Soft Comput..

[2]  Xianliang Lu,et al.  ACO-Based Search Algorithm in Unstructured P2P Network , 2011, 2011 International Conference of Information Technology, Computer Engineering and Management Sciences.

[3]  Chun-Ying Liu Adaptive Search Protocol Based on Optimized Ant Colony Algorithm in Peer-to-Peer Network , 2013, J. Networks.

[4]  Anisur Rahaman Molla,et al.  Near-optimal random walk sampling in distributed networks , 2012, 2012 Proceedings IEEE INFOCOM.

[5]  Richard Demo Souza,et al.  Performance evaluation of gossip algorithms in WSNs using outage probability , 2013, International Symposium on Wireless and pervasive Computing (ISWPC).

[6]  C. Siva Ram Murthy,et al.  On the scalability of expanding ring search for dense wireless sensor networks , 2010, J. Parallel Distributed Comput..

[7]  Matteo Sereno,et al.  Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[8]  Jiannong Cao,et al.  A distributed approach to construction of topology mismatching aware P2P overlays in wireless ad hoc networks , 2006, 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06).

[9]  Hamidah Ibrahim,et al.  Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks , 2012, Peer Peer Netw. Appl..

[10]  Hyunseung Choo,et al.  Energy Efficient Expanding Ring Search for Route Discovery in MANETs , 2008, 2008 IEEE International Conference on Communications.

[11]  Siavash Khorsandi,et al.  A popularity-based query scheme in P2P networks using adaptive gossip sampling , 2013, Peer Peer Netw. Appl..

[12]  Jing Deng,et al.  On search sets of expanding ring search in wireless networks , 2008, Ad Hoc Networks.