Comparison of efficient random walk strategies for wireless multi-hop networks

Karyotis, V; Fazio, M; Papavassiliou, S; Puliafito, A

dc.contributor.author	Karyotis, V	en
dc.contributor.author	Fazio, M	en
dc.contributor.author	Papavassiliou, S	en
dc.contributor.author	Puliafito, A	en
dc.date.accessioned	2014-03-01T01:35:25Z
dc.date.available	2014-03-01T01:35:25Z
dc.date.issued	2011	en
dc.identifier.issn	0140-3664	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/21045
dc.subject	Cover time	en
dc.subject	Energy consumption	en
dc.subject	Hybrid random walks	en
dc.subject	Mobile multi-hop networks	en
dc.subject	Topology awareness	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Cover time	en
dc.subject.other	Energy consumption	en
dc.subject.other	Hybrid random walks	en
dc.subject.other	Multihop networks	en
dc.subject.other	Topology awareness	en
dc.subject.other	Energy utilization	en
dc.subject.other	Military applications	en
dc.subject.other	Quality of service	en
dc.subject.other	Random processes	en
dc.subject.other	Topology	en
dc.subject.other	Wireless networks	en
dc.title	Comparison of efficient random walk strategies for wireless multi-hop networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.comcom.2011.01.001	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.comcom.2011.01.001	en
heal.language	English	en
heal.publicationDate	2011	en
heal.abstract	Wireless multi-hop networks have drawn great attention from research and business communities, since they suit well diverse application scenarios, such as environmental monitoring, military support in hostile environments and emergency applications. However, this challenging communication paradigm requires solutions able to fit specific requirements in terms of resource constrains, node mobility and quality of service. Random Walks (RWs) are probabilistic approaches to perform distributed operations, such as data search and retrieval. They are effective and have relatively small overhead compared to classic schemes, such as flooding. To further improve performance of RWs, hybrid solutions may be employed. Such strategies increase system performance at the cost of additional energy consumption. In this work, we propose two novel schemes that exploit local topological information in order to increase the hybrid RW protocols performance. Through simulations, we compare hybrid protocols with a traditional RW solution, studying their performance in static and mobile scenarios. An analysis of the trade-off between the number of node revisits and energy consumption allows to identify the more fitting protocols for different application scenarios in wireless multi-hop networks. Advantages and drawbacks of different RW strategies are highlighted, along with research challenges that need to be investigated in the future. (C) 2011 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Communications	en
dc.identifier.doi	10.1016/j.comcom.2011.01.001	en
dc.identifier.isi	ISI:000291766100011	en
dc.identifier.volume	34	en
dc.identifier.issue	10	en
dc.identifier.spage	1258	en
dc.identifier.epage	1267	en