Flooding is an expensive but unavoidable operation in some application scenarios devised for Mobile Ad Hoc Networks (MANETs). In this paper, we present a novel algorithm to reduce the overhead imposed by flooding operations. The algorithm improves previous results by using a distributed function to elect the nodes that will provide the highest additional coverage to previous retransmissions. The algorithm does not require any signalling or imposes special requirements on the participating devices.

No abstract

SUMMARYReplication of data items among different nodes of a wireless infrastructure-less network may be an efficient technique to increase data availability and improve data access latency. This paper proposes a novel algorithm to distribute data items among nodes in these networks. The goal of the algorithm is to deploy the replicas of the data items in such a way that they are sufficiently distant from each other to prevent excessive redundancy but, simultaneously, they remain close enough to each participant, such that data retrieval can be achieved using a small number of messages. The paper describes the algorithm and provides its performance evaluation for different configurations.

No abstract

No abstract