Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

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

  • Conference paper
Intelligent Computation in Big Data Era (ICYCSEE 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 503))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Gaeta, R., Sereno, M.: Generalized probabilistic flooding in unstructured peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems 22(12), 2055–2062 (2011)

    Article  Google Scholar 

  2. Barjini, H., Othman, M., Ibrahim, H., et al.: Shortcoming, problems and analytical comparison for flooding-based search techniques in unstructured P2P networks. Peer-to-Peer Networking and Applications 5(1), 1–13 (2012)

    Article  Google Scholar 

  3. Sharifi, L., Khorsandi, S.: A popularity-based query scheme in P2P networks using adaptive gossip sampling. Peer-to-Peer Networking and Applications 6(1), 75–85 (2013)

    Article  Google Scholar 

  4. Das Sarma, A., Molla, A.R., Pandurangan, G.: Near-optimal random walk sampling in distributed networks. In: 2012 Proceedings IEEE INFOCOM, pp. 2906–2910. IEEE (2012)

    Google Scholar 

  5. Singh, A., Bhukya, W.N.: A hybrid genetic algorithm for the minimum energy broadcast problem in wireless ad hoc networks. Applied Soft Computing 11(1), 667–674 (2011)

    Article  Google Scholar 

  6. Tang, D., Lu, X., Yang, L.: ACO-based search algorithm in unstructured P2P Network. In: 2011 International Conference on Information Technology, Computer Engineering and Management Sciences (ICM), vol. 1, pp. 143–146. IEEE (2011)

    Google Scholar 

  7. Liu, C.Y.: Adaptive search protocol based on optimized ant colony algorithm in peer-to-peer network. Journal of Networks 8(4), 843–850 (2013)

    Article  Google Scholar 

  8. Pham, D.N., Choo, H.: Energy Efficient Ring Search for Route Discovery in MANETs. IEEE (2008)

    Google Scholar 

  9. Huang, Y., Jin, B., Cao, J.: A distributed approach to construction of topology mismatching aware P2P overlays in wireless ad hoc networks. In: 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2006, p. 8. IEEE (2006)

    Google Scholar 

  10. Mishra, S., Singh, J., Dixit, A., et al.: Modified Expanding Ring Search Algorithm for Ad-hoc Networks. International Journal of Computer Science and Information Technologies 3(3), 4067–4070 (2012)

    Google Scholar 

  11. Rachuri, K.K., Siva Ram Murthy, C.: On the scalability of expanding ring search for dense wireless sensor networks. Journal of Parallel and Distributed Computing 70(9), 917–929 (2010)

    Article  MATH  Google Scholar 

  12. Shuaibing, L., Zhezhuang, X., Yinghua, Z.: Unduplicated Expanding Ring Search in Wireless Sensor and Actor Networks (2012)

    Google Scholar 

  13. Deng, J., Zuyev, S.: On search sets of expanding ring search in wireless networks. Ad Hoc Networks 6(7), 1168–1181 (2008)

    Article  Google Scholar 

  14. do Amaral, M.K., Pellenz, M.E., Penna, M.C., et al.: Performance evaluation of gossip algorithms in WSNs using outage probability. In: 2013 International Symposium on Wireless and Pervasive Computing (ISWPC), pp. 1–5. IEEE (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, H., Wen, X., Lin, J., Feng, G., Lv, H. (2015). An Energy Efficient Random Walk Based Expanding Ring Search Method for Wireless Networks. In: Wang, H., et al. Intelligent Computation in Big Data Era. ICYCSEE 2015. Communications in Computer and Information Science, vol 503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46248-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-46248-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-46247-8

  • Online ISBN: 978-3-662-46248-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics