An analysis of a large scale habitat monitoring application
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Probabilistic heuristics for disseminating information in networks
IEEE/ACM Transactions on Networking (TON)
Controlled flooding search in a large network
IEEE/ACM Transactions on Networking (TON)
Random walk with long jumps for wireless ad hoc networks
Ad Hoc Networks
Fast message dissemination in random geometric ad-hoc radio networks
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Wireless sensor network design for tactical military applications: remote large-scale environments
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
IEEE Transactions on Information Theory
(p,q)-Epidemic routing for sparsely populated mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Ego network models for Future Internet social networking environments
Computer Communications
| Hi-index | 0.24 |
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.