Gossiping: Adaptive and Reliable Broadcasting in MANETs
نویسندگان
چکیده
Given the frequent topology changes in Mobile Ad Hoc Networks (MANET), the choice of appropriate broadcasting techniques is crucial to ensure reliable delivery of messages. The spreading of broadcast messages has a strong similarity with the spreading of infectious diseases. Applying epidemiological models to broadcasting allows an easy evaluation of such strategies depending on the MANET characteristics, e.g. the node density. In this paper, we develop an epidemic model for gossiping, which is a flooding-based probabilistic broadcasting technique. We analytically investigate the impact of node density and forwarding probability on the quality of gossiping. The result of our investigation is to enable mobile nodes for dynamically adapting their forwarding probability depending on the local node density. Simulation results in ns-2 show the reliability, efficiency and scalability of adaptive gossiping.
منابع مشابه
A Generalized Broadcasting Technique for Mobile Ad Hoc Networks
Broadcasting is a major communication primitive required by many applications and protocols in Mobile Ad Hoc Networks (MANETs). It is frequently deployed for content distribution, service discovery or advertisement, and sensor data dissemination. Broadcast protocols are also a fundamental building block to realize principal middleware functionalities such as replication, group management and co...
متن کاملHypergossiping: A Generalized Broadcast Strategy for Mobile Ad Hoc Networks
Broadcasting is a commonly used communication primitive needed by many applications and protocols in mobile ad hoc networks (MANET). Unfortunately, most broadcast solutions are tailored to one class of MANETs with respect to node density and node mobility and are unlikely to operate well in other classes. In this paper, we introduce hypergossiping, a novel adaptive broadcast algorithm that comb...
متن کاملApproximation algorithms for information dissemination problems
Broadcasting and gossiping are known to be NP hard problems This paper deals with approximation algorithms for such problems We consider both round complexity and step complexity in the telephone model After an overview of previously derived approximation algorithms we present new strategies for broadcasting and gossiping in any graphs Broadcasting strategies are based on the construction of ed...
متن کاملAdaptive Topology Based Gossiping in VANETs Using Position Information
Gossiping is a lightweight and simple technique for information dissemination in many application domains, be it in Wireless Sensor Networks (WSNs), Mobile Ad-hoc Networks (MANETs), or Vehicular Ad-hoc Networks (VANETs). Much research has been conducted in the past on probabilistic dissemination methods because of their efficiency compared with simple flooding and their simple application. Howe...
متن کاملDeterministic Broadcasting and Gossiping with Beeps
Broadcasting and gossiping are fundamental communication tasks in networks. In broadcasting, one node of a network has a message that must be learned by all other nodes. In gossiping, every node has a (possibly different) message, and all messages must be learned by all nodes. We study these well-researched tasks in a very weak communication model, called the beeping model. Communication procee...
متن کامل