Localized probabilistic and dominating set based algorithm for efficient information dissemination in ad hoc networks

Hauspie, Michaël; Amandine, Panier,

doi:10.1109/mahss.2004.1392062

Cited by 7 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the approach to distribute data in MANETs is to flood the entire network with the information about the data like the methods proposed in [23], but given the limited memory space and energy in MANET devices, its not a feasible solution. [3], [22] proposed selective flooding through gossip and epidemic based algorithms where the message is forwarded to the subset of neighboring nodes which are chosen randomly. These kinds of methods reduce the number of messages and overheads.…”

Section: A Inadequacies Of Existing Schemesmentioning

confidence: 99%

CORP: An Efficient Protocol to Prevent Data Loss in Mobile Ad-hoc Networks

Mani

2013

2013 27th International Conference on Advanced Information Networking and Applications Workshops

View full text Add to dashboard Cite

Data replication increases data availability in Mobile Ad Hoc Networks (MANETs). Preventing data loss and increasing data availability in MANETs is a nontrivial problem due to their low-cost hardware, harsh working environments, node mobility, failure of mobile devices from battery exhaustion and node compromise attacks. In addition, different routing algorithms and larger size of the network can cause communication links to fail creating several disjoint partitions which causes data loss. The typical fault-tolerant systems would fail in these conditions. Existing approaches fail due to the limitations caused by their dependence on lower node mobility or constrained by node distribution, unpredictable partitions and routing mechanisms. In this paper, we propose Combinatorial Replication and Partition (CORP) of data which is a combinatorial arrangement with pairwise balanced design property to prevent data loss and increase data availability. Our scheme provides low access latency and reduces communication overhead. By partitioning and replicating data in such a combinatorial arrangement, our scheme directly supports objectoriented constructs in distributed fault-tolerant networks.

show abstract

Section: A Inadequacies Of Existing Schemesmentioning

confidence: 99%

CORP: An Efficient Protocol to Prevent Data Loss in Mobile Ad-hoc Networks

Mani

2013

2013 27th International Conference on Advanced Information Networking and Applications Workshops

View full text Add to dashboard Cite

show abstract

“…Simple, widely used techniques for replication are gossiping and epidemic dissemination [23], [24], where the information is forwarded to a randomly selected subset of neighbors. Although our RWD scheme may resemble this approach in that a replica node hands over the content to a randomly chosen neighbor, the mechanism we propose and the goals it achieves (i.e., approximation of optimal number of replicas) are significantly different.…”

Section: Related Workmentioning

confidence: 99%

Content Replication in Mobile Networks

Michiardi

Casetti

et al. 2012

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. In this work, we design a practical, distributed solution to content replication that is suitable for dynamic environments and achieves load balancing. Simulation results show that our mechanism, which uses local measurements only, approximates well an optimal solution while being robust against network and demand dynamics. Also, our scheme outperforms alternative approaches in terms of both content access delay and access congestion.

show abstract

“…Simple, widely used techniques for replication are gossiping and epidemic dissemination [14,15], where the information is forwarded to a randomly selected subset of neighbors. Although our RWD scheme may resemble this approach in that a replica node hands over the content to a randomly chosen neighbor, the mechanism we propose and the goals it achieves (i.e., approximation of nodal uniformity and optimal number of replicas) are significantly different.…”

Section: Related Work On Replication In Multihop Networkmentioning

confidence: 99%

A Lightweight Distributed Solution to Content Replication in Mobile Networks

Michiardi

Casetti

et al. 2010

2010 IEEE Wireless Communication and Networking Conference

View full text Add to dashboard Cite

Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Facility location theory has been the traditional, centralized approach to study content replication: computing the number and placement of replicas in a network can be cast as an uncapacitated facility location problem.The endeavour of this work is to design a distributed, lightweight solution to the above joint optimization problem, while taking into account the network dynamics. In particular, we devise a mechanism that lets nodes share the burden of storing and providing content, so as to achieve load balancing, and decide whether to replicate or drop the information so as to adapt to a dynamic content demand and time-varying topology. We evaluate our mechanism through simulation, by exploring a wide range of settings and studying realistic content access mechanisms that go beyond the traditional assumption matching demand points to their closest content replica. Results show that our mechanism, which uses local measurements only, is: (i) extremely precise in approximating an optimal solution to content placement and replication; (ii) robust against network mobility; (iii) flexible in accommodating various content access patterns, including variation in time and space of the content demand.

show abstract

Localized probabilistic and dominating set based algorithm for efficient information dissemination in ad hoc networks

Abstract: Abstract

Cited by 7 publications

References 12 publications

CORP: An Efficient Protocol to Prevent Data Loss in Mobile Ad-hoc Networks

CORP: An Efficient Protocol to Prevent Data Loss in Mobile Ad-hoc Networks

Content Replication in Mobile Networks

A Lightweight Distributed Solution to Content Replication in Mobile Networks

Contact Info

Product

Resources

About