Controlled potential-based routing for large-scale wireless sensor networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
CATT: potential based routing with content caching for ICN
Proceedings of the second edition of the ICN workshop on Information-centric networking
Controlled and self-organized routing for large-scale wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
monitoring demand that the data collection process be carried out for the longest possible time. Our paper addresses this problem by presenting a routing scheme that ensures that the monitoring network remains connected and hence the live sensor nodes deliver data for a longer duration. We analyze the role of relay nodes (neighbours of the base-station) in maintaining network connectivity and present a routing strategy that, for a particular class of networks, approaches the optimal as the set of relay nodes becomes larger. We then use these findings to develop an appropriate distributed routing protocol using potential-based routing. The basic idea of potential-based routing is to define a (scalar) potential value at each node in the network and forward data to the neighbor with the highest potential. We propose a potential function and evaluate its performance through simula- tions. The results show that our approach performs better than the well known lifetime maximization policy proposed by Chang and Tassiulas [1], as well as AODV [2].