ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Networks
Volume 52, Issue 1, 18 January 2008, Pages 44-60
(1) Performance of Wireless Networks; (2) Synergy of Telecommunication and Broadcasting Networks
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (881 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2007.09.012    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

The power of choice in random walks: An empirical studystar, open

Chen Avina, Corresponding Author Contact Information, 1, E-mail The Corresponding Author and Bhaskar Krishnamacharib, E-mail The Corresponding Author

aDepartment of Communication Systems Engineering, Ben Gurion University of The Negev, Beer Sheva, 84105, Israel bDepartment of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, United States

Available online 1 October 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In recent years random-walk-based algorithms have been proposed for a variety of networking tasks. These proposals include searching, routing, self-stabilization, and query processing in wireless networks, peer-to-peer networks and other distributed systems. This approach is gaining popularity because random walks present locality, simplicity, low-overhead and inherent robustness to structural changes. In this work we propose and investigate an enhanced algorithm that we refer to as random walks with choice. In this algorithm, instead of selecting just one neighbor at each step, the walk moves to the next node after examining a small number of neighbors sampled at random. Our empirical results on random geometric graphs, the model best suited for wireless networks, suggest a significant improvement in important metrics such as energy consumption and the cover time and load-balancing properties of random walks. We also systematically investigate random walks with choice on networks with a square grid topology. For this case, our simulations indicate that there is an unbounded improvement in cover time even with a choice of only two neighbors. We also observe a large reduction in the variance of the cover time, and a significant improvement in visit load balancing.

Keywords: Power of choice; Random walks; Wireless networks

Article Outline

1. Introduction
2. Background and preliminaries
2.1. Cover time and partial cover
2.2. Load balancing and the stationary distribution
3. Random walks with choice
4. Simulation set up
4.1. Metrics and questions of interest
5. Random geometric graphs
5.1. Cover time distribution and load balancing
5.2. Cover time as a function of the radius r
5.3. Different graph sizes
6. Grids
6.1. Expected cover and partial cover time
6.1.1. Different grid sizes
6.2. Cover time distribution
6.3. Load balancing
6.4. Mixing rate
7. Grids vs. hyper-cubes
8. Conclusions
References
Vitae

















Computer Networks
Volume 52, Issue 1, 18 January 2008, Pages 44-60
(1) Performance of Wireless Networks; (2) Synergy of Telecommunication and Broadcasting Networks
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.