On Exploiting Temporal Periodicity for Message Delivery in Mobile Opportunistic Networks

Hsu, Yu-Feng; Hu, Chih‐Lin; Hsiao, Hsin-Ju

doi:10.1109/compsac.2018.00131

Cited by 4 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In general, we assume that nodes are selfless [12] when they help to forward and store messages. However, in real scenarios, nodes usually show some selfishness due to resource limitation, which leads to a lower message delivery rate [13] and a longer average latency [14] for Opportunistic Networks. At present, most researchers only pay attention to the feasibility of the network and the integrity of the data [15].…”

Section: Introductionmentioning

confidence: 99%

GIR: An Opportunistic Network Routing Algorithm Based on Game Theory

Wang

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

A large number of routing algorithms in Opportunistic Networks are based on the assumption that nodes are free to help other nodes forward messages. However, when the Opportunistic Network is applied to an urban environment, the nodes will have certain social attributes. In many cases, a node can decide whether to execute the routing policy or not. Due to the limited resources and poor social relationships, nodes may be unwilling to forward messages from other nodes and have strong motivation to implement selfish policies. As a result, increased network latency reduces message delivery rates and affects the overall network performance. In order to solve this problem, we propose a perceptual routing protocol to promote node cooperation from the perspective of game theory. Specifically, We introduce the concept of virtual currency and construct a price function, and nodes can obtain a certain virtual currency through cooperation. In the process of message forwarding, we consider the change of link degree and energy of node (the energy exists in the form of electricity in this paper), and use them as factors of the trading node quotation. The trading node finally makes it through the multiple rounds of bargaining games, so that the proposed game between both sides reaches the Nash equilibrium. Experiments show that the algorithm outperforms Epidemic, EPSR, MINEIRO and ICRP algorithms in terms of delivery rate, average latency and energy consumption. According to the simulation experiments, the average delivery ratio of GIR algorithm is 0.68, which is 13% higher than that of the epidemic algorithm. In terms of average delay, 7% is better than ICRP algorithm. INDEX TERMS Cooperation, Routing algorithm, Nash equilibrium, Selfish.

show abstract

Section: Introductionmentioning

confidence: 99%

GIR: An Opportunistic Network Routing Algorithm Based on Game Theory

Wang

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Recent studies examined whether contact frequency is heterogeneous between relay nodes. [17][18][19] To deal with varied contact patterns, Zhou, 20 Hsu, 21 Tao, 22 and Xie 23 exploited contact-oriented properties, such as intercontact time, contact frequency, and periodic contacts with target nodes, to improve data delivery services in OppNets. Although many routing and buffer management studies have been examined in Section 2, it is noted that prior studies have paid less attention to the message distribution with joint efforts of routing and buffer management in OppNets.…”

mentioning

confidence: 99%

“…Our study takes account of three practical factors in the formulation of a realistic OppNet context, including finite buffer space on a node, remaining TTL, and the presence of heterogeneous contact patterns. 17,18,21,22 Without loss of generality, each node owns a finite buffer space that plainly refers to the maximum number of messages a node can store in local buffer. Every message in local buffer is associated with a decreasing TTL period.…”

mentioning

confidence: 99%

Quota‐based routing and buffer management with heuristic strategies in opportunistic ad hoc networks

Mir

2022

Int J Communication

View full text Add to dashboard Cite

Summary Opportunistic ad hoc networks (OppNets) are characterized by intermittent and infrastructure‐less connectivity among mobile nodes with limited internode communication and buffer space. Without persistent end‐to‐end routing information, replication‐based routing techniques are often used to distribute duplicate messages in OppNets, which unfortunately leads to enormous costs of transmission, storage, and energy resources. Prior replication‐based routing schemes were mainly based on several premises, for example, the availability of global network knowledge, unlimited bandwidth capacity, and homogeneous contact patterns. In this paper, we propose a quota‐based routing scheme with finite buffer management, named QRBP, regardless of these weak premises. The QRBP scheme comprises two essential functions. First, only a portion of nodes with higher mobility are delegated to carry a certain quota of message replicas and disseminate those messages to nodes with lower mobility. The message traffic can be evenly diverted to relay nodes, which reduces the transmission overhead in the network. Second, nodes can manipulate message scheduling and dropping to improve the successful delivery rate according to heuristic strategies based on several measures of the quota value, remaining time‐to‐live, and contact rate with the destination. Furthermore, our study conducts extensive simulations under both synthetic and real mobility scenarios. In terms of transmission overhead ratio and successful delivery rate, the QRBP scheme performs better than Epidemic, Spray and Wait, and Temporal Closeness and Centrality‐Based (TCCB) routing schemes, as well as common buffer management policies like Drop Oldest, Drop Newest, Drop Random, and Space‐Time Drop.

show abstract

An experimental approach to the consensus routing algorithm applied to temporal networks

Arellano-Vazquez¹,

Benítez-Pérez

2021

IEEE Latin Am. Trans.

View full text Add to dashboard Cite

On Exploiting Temporal Periodicity for Message Delivery in Mobile Opportunistic Networks

Cited by 4 publications

References 8 publications

GIR: An Opportunistic Network Routing Algorithm Based on Game Theory

GIR: An Opportunistic Network Routing Algorithm Based on Game Theory

Quota‐based routing and buffer management with heuristic strategies in opportunistic ad hoc networks

An experimental approach to the consensus routing algorithm applied to temporal networks

Contact Info

Product

Resources

About