Optimal energy-aware epidemic routing in DTNs

Khouzani, M. H. R.; Eshghi, Soheil; Sarkar, Saswati; Shroff, Ness B.; Venkatesh, Santosh S.

doi:10.1145/2248371.2248397

Cited by 47 publications

(13 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The model was mainly used to examine the energy consumption of two well-known MANET routing protocols. Khouzani et al in [19] investigate the use of epidemic routing in energy constrained DTN. They prove that dynamic optimal strategies follow some simple threshold-based rules.…”

Section: Related Workmentioning

confidence: 99%

A Game Theoretical Model for Energy-Aware DTN Routing in MANETs with Nodes’ Selfishness

Mao

Zhu

2015

Mobile Netw Appl

View full text Add to dashboard Cite

Many existing studies just considered that nodes in a Mobile Ad Hoc NETwork (MANET) would fully cooperate to forward packets for one another. However, this assumption does not hold in many scenarios. The node selfishness in relay cooperation will certainly influence the overall performance of routing in MANE Ts. In this work, we investigate the energy-aware routing problem in MANETs with nodes' selfishness. We model the situation of node cooperation in energy-aware routing by using game theory. We consider the competitive and cooperative relationship between the nodes to formulate the game for MANETs. An incentive mechanism is given in order to encourage forwarding cooperation during energy-aware routing. Nodes are encouraged to forward more data packets for others in order to acquire more services from others. We also carry out a simulation for the proposed method and perform detailed analysis in this work. From the results of the simulation, we argue that it's possible to find out a suitable configuration for a MANET to support more efficient energy-aware routing through our method.

show abstract

Section: Related Workmentioning

confidence: 99%

A Game Theoretical Model for Energy-Aware DTN Routing in MANETs with Nodes’ Selfishness

Mao

Zhu

2015

Mobile Netw Appl

View full text Add to dashboard Cite

show abstract

“…Gunasekaran et al [27], [28] apply Queuing Petri-Net and derive the end-to-end delivery delay from the modeled semi-Markov process. Khouzani et al [29] investigate an energy-aware optimal epidemic routing in DTNs by a threshold-based scheme, where the forwarding probability is determined by relay node's current remaining energy. Recently, Kim et al [30] present a distributed cross-layer monitoring and optimization method for secure content delivery toward decentralized contentbased mobile ad hoc networking.…”

Section: Content Delivery In Dtnsmentioning

confidence: 99%

An Improved Stochastic Modeling of Opportunistic Routing in Vehicular CPS

Zeng

Guo

Barnawi

et al. 2015

IEEE Trans. Comput.

View full text Add to dashboard Cite

Vehicular Cyber-Physical System (VCPS) provides CPS services via exploring the sensing, computing and communication capabilities on vehicles. VCPS is deeply influenced by the performance of the underlying vehicular network with intermittent connections, which make existing routing solutions hardly to be applied directly. Epidemic routing, especially the one using random linear network coding, has been studied and proved as an efficient way in the consideration of delivery performance. Much pioneering work has tried to figure out how epidemic routing using network coding (ERNC) performs in VCPS, either by simulation or by analysis. However, none of them has been able to expose the potential of ERNC accurately. In this paper, we present a stochastic analytical framework to study the performance of ERNC in VCPS with intermittent connections. By novelly modeling ERNC in VCPS using a token-bucket model, our framework can provide a much more accurate results than any existing work on the unicast delivery performance analysis of ERNC in VCPS. The correctness of our analytical results has also been confirmed by our extensive simulations.

show abstract

“…After an extensive survey on related work, it can be noticed that a number of current studies assume that the intermittent connections can be described by an empirical exponential distribution of pairwise meeting rate between mobile devices [2], [3], [5]- [7]. Based on this classical assumption, the conventional Ordinary Differential Equations (ODEs) approach [2], [5], [6], [8], [9] is very suitable to model the message propagation process under the buffer capacity constrained epidemic routing in MANETs.…”

Section: Infected Nodesmentioning

confidence: 99%

Buffer Capacity-Constrained Epidemic Routing Model in Mobile Ad-Hoc Networks

Liu

Huang

2014

2014 IEEE 17th International Conference on Computational Science and Engineering

View full text Add to dashboard Cite

In order to understand the message propagation performance in Mobile ad-hoc Networks (MANETs), various methods and models have been proposed in the literature by applying a common pairwise meeting rate between mobile nodes. In this paper, based on this classical meeting rate, we develop an Ordinary Differential Equations (ODEs) based analytical framework aiming at depicting the propagation process of a target message while using a controlled epidemic routing protocol. Each relay node is assigned a threshold value of its buffer can be occupied by the target message copies in such the controlled epidemic routing. Further, we also investigate the effect of the threshold to the total buffer occupancy ratio over all the relay nodes using our proposed theoretical framework. The correctness of our analysis is validated by extensive simulations.

show abstract

Optimal energy-aware epidemic routing in DTNs

Cited by 47 publications

References 15 publications

A Game Theoretical Model for Energy-Aware DTN Routing in MANETs with Nodes’ Selfishness

A Game Theoretical Model for Energy-Aware DTN Routing in MANETs with Nodes’ Selfishness

An Improved Stochastic Modeling of Opportunistic Routing in Vehicular CPS

Buffer Capacity-Constrained Epidemic Routing Model in Mobile Ad-Hoc Networks

Contact Info

Product

Resources

About