Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Self-configurable fault monitoring in ad-hoc networks
Ad Hoc Networks
Fault monitoring in ad-hoc networks based on information theory
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
| Hi-index | 0.00 |
Ad-Hoc Networks and in particular sensor networks are networks of nodes with limited battery and limited processing capacity. As such, a single node carries an incentive to limit the amount of data it contains. This leads to the expiration of the data carried by the node after a period of time, due for instance, to a re-boot after an off period in the duty cycle, or to older information being "pushed" out by new data received by the mobile node. On the other hand, some data is critical to the functioning of the whole network. For instance, the existence and position of a gateway towards the infrastructure network should be kept somewhere in the network, so that nodes are able to recover this information when needed. In this paper, we study the trade-off between the finite lifetime of a piece of information at each node, and the survival of this information indefinitely within the network. We consider a simple dissemination process for the information akin to an AODV-based information request/reply mechanism. We show that the maximum number of hops in a request is a critical parameter to ensure the survivability indefinitely of any information within the network. We identify the parameter which minimizes the load on the network, for two typical ad-hoc network topologies: a square lattice, which accurately models the distribution of the nodes in a fixed and organized ad hoc or sensor network, and a n-ary tree, which models ad hoc networks for which routing is constructed so as to have no routing loops.