Results 1 - 10
of
57
Performance Modeling of Epidemic Routing
- In Proceedings of IFIP Networking
, 2006
"... Abstract. In this paper, we develop a rigorous, unified framework based on Ordinary Differential Equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study ..."
Abstract
-
Cited by 193 (11 self)
- Add to MetaCart
Abstract. In this paper, we develop a rigorous, unified framework based on Ordinary Differential Equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study of Markovian models is quite complex and numerical solution impractical for large networks, the corresponding ODE models yield closed-form expressions for several performance metrics of interest, and a numerical solution complexity that does not increase with the number of nodes. Using this ODE approach, we investigate how resources such as buffer space and power can be traded for faster delivery, illustrating the differences among the various epidemic schemes considered. Finally we consider the effect of buffer management by complementing the forwarding models with Markovian and fluid buffer models.
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
- in Proc. WOWMOM
, 2005
"... The vast majority of mobile ad hoc networking research makes a very large assumption: that communication can only take place between nodes that are simultaneously accessible within in the same connected cloud (i.e., that communication is synchronous). In reality, this assumption is likely to be a po ..."
Abstract
-
Cited by 159 (28 self)
- Add to MetaCart
(Show Context)
The vast majority of mobile ad hoc networking research makes a very large assumption: that communication can only take place between nodes that are simultaneously accessible within in the same connected cloud (i.e., that communication is synchronous). In reality, this assumption is likely to be a poor one, particularly for sparsely or irregularly populated environments. In this paper, we present the Context-Aware Routing (CAR) algorithm. CAR is a novel approach to the provision of asynchronous communication in partially-connected mobile ad hoc networks, based on the intelligent placement of messages. We discuss the details of the algorithm, and then present simulation results demonstrating that it is possible for nodes to exploit context information in making local decisions that lead to good delivery ratios and latencies with small overheads. 1
MDDV: A Mobility-Centric Data Dissemination Algorithm . . .
, 2004
"... There has been increasing interest in the exploitation of advances in information technology in surface transportation systems. One trend is to exploit on-board sensing, computing and communication capabilities in vehicles, e.g., to augment and enhance existing intelligent transportation systems. A ..."
Abstract
-
Cited by 153 (2 self)
- Add to MetaCart
There has been increasing interest in the exploitation of advances in information technology in surface transportation systems. One trend is to exploit on-board sensing, computing and communication capabilities in vehicles, e.g., to augment and enhance existing intelligent transportation systems. A natural approach is to use vehicle-to-vehicle communications to disseminate information. In this paper, we propose MDDV, a mobility-centric approach for data dissemination in vehicular networks designed to operate efficiently and reliably despite the highly mobile, partitioned nature of these networks. MDDV is designed to exploit vehicle mobility for data dissemination, and combines the idea of opportunistic forwarding, trajectory based forwarding and geographical forwarding. We develop a generic mobile computing approach for designing localized algorithms in vehicular networks. Vehicles perform local operations based on their own knowledge while they collectively achieve a global behavior. We evaluate the performance of the MDDV algorithm using realistic simulation of the vehicle traffic in Atlanta area.
Autonomous Gossiping: A self-organizing epidemic algorithm for selective
- In International Conference on Semantics of a Networked
, 2004
"... We introduce autonomous gossiping (A/G), a new genre epidemic algorithm for selective dissemination of information in contrast to previous usage of epidemic algorithms which flood the whole network. A/G is a paradigm which suits well in a mobile ad-hoc networking (MANET) environment because it does ..."
Abstract
-
Cited by 66 (1 self)
- Add to MetaCart
We introduce autonomous gossiping (A/G), a new genre epidemic algorithm for selective dissemination of information in contrast to previous usage of epidemic algorithms which flood the whole network. A/G is a paradigm which suits well in a mobile ad-hoc networking (MANET) environment because it does not require any infrastructure or middleware like multicast tree and (un)subscription maintenance for publish/subscribe, but uses ecological and economic principles in a self-organizing manner in order to achieve any arbitrary selectivity (flexible casting). The trade-off of using a stateless self-organizing mechanism like A/G is that it does not guarantee completeness deterministically as is one of the original objectives of alternate selective dissemination schemes like publish/subscribe. We argue that such incompleteness is not a problem in many non-critical real-life civilian application scenarios and realistic node mobility patterns, where the overhead of infrastructure maintenance may outweigh the benefits of completeness, more over, at present there exists no mechanism to realize publish/subscribe or other paradigms for selective dissemination in MANET environments.
RAPID: Reliable Probabilistic Dissemination in wireless ad-hoc networks
- In Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (SRDS
, 2007
"... Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. In this paper we propose a novel ReliAble ProbabIlistic Dissemination protocol, called RAPID, for mobile wireless ad-hoc networks that tolerates ..."
Abstract
-
Cited by 26 (6 self)
- Add to MetaCart
(Show Context)
Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. In this paper we propose a novel ReliAble ProbabIlistic Dissemination protocol, called RAPID, for mobile wireless ad-hoc networks that tolerates message omissions, node crashes, and selfish behavior. The protocol employs a combination of probabilistic forwarding with deterministic corrective measures. The forwarding probability is set based on the observed number of nodes in each one-hop neighborhood, while the deterministic corrective measures include deterministic gossiping as well as timer based corrections of the probabilistic process. These aspects of the protocol are motivated by a theoretical analysis that is also presented in the paper, which explains why this unique protocol design is inherent to ad-hoc networks environments. Since the protocol only relies on local computations and probability, it is highly resilient to mobility and failures. By adding authentication, it can even be made malicious tolerant. Additionally, the paper includes a detailed performance evaluation by simulation. We compare the performance and the overhead of RAPID with the performance of other probabilistic approaches. Our results show that RAPID achieves a significantly higher node coverage with a smaller overhead.
Controlled epidemic-style dissemination middleware for mobile ad hoc networks
- 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services (IEEE Cat. No. 06EX1437
, 2006
"... Traditional middleware primitives offer very elementary information dissemination mechanisms, which, in the case of a decentralized and dynamic network such as a mobile ad hoc network, do not offer the ability to control the information spreading. Control over information dissemination could instead ..."
Abstract
-
Cited by 16 (5 self)
- Add to MetaCart
(Show Context)
Traditional middleware primitives offer very elementary information dissemination mechanisms, which, in the case of a decentralized and dynamic network such as a mobile ad hoc network, do not offer the ability to control the information spreading. Control over information dissemination could instead be very critical especially in terms of lifetime of the network. Gossip-based communication and epidemic-style algorithms, which are based on a store and forward approach, have been proposed to obtain message dissemination with probabilistic guarantees and lower overheads. However, epidemic algorithms have never been used to allow designers to control the spreading of the information depending on the desired reliability and the network structure. In this paper, we present a middleware for ad hoc networking, which uses epidemic-style information dissemination techniques to tune the reliability of the communication in mobile ad hoc networks. The approach is based on recent results of complex networks theory; the novelty of our idea resides in the evaluation and the exploitation of the structure of the underlying network for the automatic tuning of the dissemination process and its use in the design of the API offered by the middleware. We present a detailed analytical model supported by several simulation results. 1.
Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks
- In Proceedings of The 2005 Conference on Communication in Distributed Systems (KiVS
, 2005
"... 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 cl ..."
Abstract
-
Cited by 16 (5 self)
- Add to MetaCart
(Show Context)
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 combines two strategies. Hypergossiping uses adaptive gossiping to efficiently distribute messages within single network partitions and implements an efficient heuristic to distribute them across partitions. Simulation results in ns-2 show that hypergossiping operates well for a broad range of MANETs with respect to node densities, mobility levels and network loads. Key words: MANET, adaptive broadcast, network partitioning 1
A Survey on Bio-inspired Networking
, 2010
"... The developments in the communication and networking technologies have yielded many existing and envisioned information network architectures such as cognitive radio networks, sensor and actor networks, quantum communication networks, terrestrial next generation Internet, and InterPlaNetary Internet ..."
Abstract
-
Cited by 15 (1 self)
- Add to MetaCart
(Show Context)
The developments in the communication and networking technologies have yielded many existing and envisioned information network architectures such as cognitive radio networks, sensor and actor networks, quantum communication networks, terrestrial next generation Internet, and InterPlaNetary Internet. However, there exist many common significant challenges to be addressed for the practical realization of these current and envisioned networking paradigms such as the increased complexity with large scale networks, their dynamic nature, resource constraints, heterogeneous architectures, absence or impracticality of centralized control and infrastructure, need for survivability, and unattended resolution of potential failures. These challenges have been successfully dealt with by Nature, which, as a result of millions of years of evolution, have yielded many biological systems and processes with intrinsic appealing characteristics such as adaptivity to varying environmental conditions, inherent resiliency to failures and damages, successful and collaborative operation on the basis of a limited set of rules and with global intelligence which is larger than superposition of individuals, self-organization, survivability, and evolvability. Inspired by these characteristics, many researchers are currently engaged in developing innovative design paradigms to address the networking challenges of existing and envisioned information systems. In this paper, the current stateof-the-art
Self-limiting epidemic forwarding
- In The First IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications (AOC2007
, 2006
"... Abstract — We define a self-limiting epidemic service as a dissemination service for ad-hoc environments that is broadcast in nature, but is limited to a local scope around each source. Example applications are chatting or bulletin boards in a traffic jam, in an instant crowd in a campus or, in cont ..."
Abstract
-
Cited by 14 (3 self)
- Add to MetaCart
(Show Context)
Abstract — We define a self-limiting epidemic service as a dissemination service for ad-hoc environments that is broadcast in nature, but is limited to a local scope around each source. Example applications are chatting or bulletin boards in a traffic jam, in an instant crowd in a campus or, in contrast, along a desert highway. Our goal is to support such a service across a wide range of conditions (dense or sparse). The main problems are to adaptively control scoping and traffic rates to avoid congestion. We propose a system design with the following elements: (1) manipulation of TTL by adaptive aging mechanisms; (2) control of forwarding factor by self-inhibition and inter-inhibition and (3) control of rate of injection by sources. We validate the design by an implementation in Java and analyze it using both simulation and ordinary differential equations. We show how it can be tuned to achieve an appropriate balance between limitation of scope and rate of information. Our design is entirely self-organized, and is free of any form of clustering or leader election.
AdHeat: An Influence-based Diffusion Model for Propagating Hints to Match Ads
- WWW 2010 • FULL PAPER APRIL 26-30 • RALEIGH • NC • USA
, 2010
"... In this paper, we present AdHeat, a social ad model considering user influence in addition to relevance for matching ads. Traditionally, ad placement employs the relevance model. Such a model matches ads with Web page content, user interests, or both. We have observed, however, on social networks th ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
In this paper, we present AdHeat, a social ad model considering user influence in addition to relevance for matching ads. Traditionally, ad placement employs the relevance model. Such a model matches ads with Web page content, user interests, or both. We have observed, however, on social networks that the relevance model suffers from two shortcomings. First, influential users (users who contribute opinions) seldom click ads that are highly relevant to their expertise. Second, because influential users ’ contents and activities are attractive to other users, hint words summarizing their expertise and activities may be widely preferred. Therefore, we propose AdHeat, which diffuses hint words of influential users to others and then matches ads for each user with aggregated hints. We performed experiments on a large online Q&A community with half a million users. The experimental results show that AdHeat outperforms the relevance model on CTR (click through rate) by significant margins.
