Abstract
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random walks that are biased towards their current heading. In this paper, we investigate whether or not complementing random walks with directional bias can decrease the expected discovery and coverage times in networks. To do so, we use a macro-level model of a directionally biased random walk based on Markov chains. By focussing on regular, connected networks, the model allows us to efficiently calculate expected coverage times for different network sizes and biases. Our analysis shows that directional bias can significantly reduce the coverage time, but only when the bias is below a certain value which is dependent on the network size.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avin, C., Brito, C.: Efficient and robust query processing in dynamic environments using random walk techniques. In: International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 277–286. ACM (2004)
Avin, C., Krishnamachari, B.: The power of choice in random walks: An empirical study. In: ACM International Symposium on Modelling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2006), pp. 219–228. ACM (2006)
Bar-Yossef, Z., Friedman, R., Kliot, G.: RaWMS — Random walk based lightweight membership service for wireless and ad hoc networks. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2006), pp. 238–249. ACM (2006)
Crist, T.O., MacMahon, J.A.: Individual foraging components of harvester ants: Movement patterns and seed patch fidelity. Insectes Sociaux 38(4), 379–396 (1991)
Dolev, S., Schiller, E., Welch, J.: Random walk for self-stabilizing group communication in ad hoc networks. IEEE Transactions on Mobile Computing 5(7), 893–905 (2006)
Fink, G.A., Berenhaut, K.S., Oehmen, C.S.: Directional bias and pheromone for discovery and coverage on networks. In: IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2012), pp. 1–10. IEEE (2012)
Lima, L., Barros, J.: Random walks on sensor networks. In: International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wirless Networks and Workshops (WiOpt 2007), pp. 1–5. IEEE (2007)
McCulloch, C.E., Cain, M.L.: Analyzing discrete movement data as a correlated random walk. Ecology 70, 383–388 (1989)
Mian, A.N., Beraldi, R., Baldoni, R.: On the coverage process of random walk in wireless ad hoc and sensor networks. In: IEEE International Conference on Mobile, Ad-hoc and Sensor Systems (MASS 2010), pp. 146–155. IEEE (2010)
Norris, J.R.: Markov Chains. Cambridge University Press (1998)
Pearson, K.: The problem of the random walk. Nature 72, 294 (1905)
Sadagopan, N., Krishnamachari, B., Helmy, A.: Active query forwarding in sensor networks. Journal of Ad Hoc Networks 3(1), 91–113 (2005)
Smith, G., Sanders, J.W., Li, Q.: A macro-level model for investigating the effect of directional bias on network coverage. CoRR, abs/1407.5762 (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smith, G., Sanders, J.W., Li, Q. (2014). On Directional Bias for Network Coverage. In: Pan, L., Păun, G., Pérez-Jiménez, M.J., Song, T. (eds) Bio-Inspired Computing - Theories and Applications. Communications in Computer and Information Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45049-9_62
Download citation
DOI: https://doi.org/10.1007/978-3-662-45049-9_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45048-2
Online ISBN: 978-3-662-45049-9
eBook Packages: Computer ScienceComputer Science (R0)