An efficient probabilistic routing scheme based on game theory in opportunistic networks

Qin, Xueyang; Wang, Xiaoming; Wang, Liang; Lin, Yaguang; Wang, Xinyan

doi:10.1016/j.comnet.2018.11.022

Cited by 25 publications

(12 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All the routing protocols that will be discussed in this section are listed in this figure. RCFR [35] Assignment game approach [34] GERA [33] Energy aware trust derivation scheme [32] COMO [38] Routing framework based on energy and delay conservation [38] Intercluster routing algorithm for WSN [39] Noncooperative game Resource allocation strategy for clustering based WSN [36] EEREG [41] GBRA [43] GTEB [40] GEEC [42] ERG [45] PRGT [44] WSNs are energy constrained and they require energy-efficient routing protocols for a fading environment. Many of the state-of-the-art works utilized a multi-input multi-output (MIMO) scheme to increase energy efficiency in a fading environment.…”

Section: Game Theory-based Routing Protocols In Wsnsmentioning

confidence: 99%

“…Nodes may act selfishly and show an unwillingness to participate in message forwarding. To address this issue, Qin et al proposed a probabilistic routing scheme based on game theory (PRGT) to simulate cooperation among the selfish nodes [44].…”

Section: Probabilistic Routing Scheme Based On Game Theory (Prgt)mentioning

confidence: 99%

“…In PRGT, an incentive probabilistic routing scheme for message transmission in OppNets was proposed. Based on the previous history of the nodes meeting each other, the authors of [44] established a first-order Markov process. Then, a game-theoretic approach was proposed to reduce the selfishness of the relay nodes and increase cooperation among them.…”

Section: Probabilistic Routing Scheme Based On Game Theory (Prgt)mentioning

confidence: 99%

“…where (P m i , T m i ) indicates that at the T m i moment, the message m is in the position P m i . The process was also described as a Markov chain [44]. Nodes in the network represent the set of states (S): S = {1, 2, 3, .…”

Section: Probabilistic Routing Scheme Based On Game Theory (Prgt)mentioning

confidence: 99%

“…In [44], the proposed PRGT protocol was compared with some classical routing algorithms (epidemic routing, SprayAndWait) in terms of message delivery ratio, latency, and overhead ratio. PRGT showed a better performance in terms of all the metrics.…”

Section: Probabilistic Routing Scheme Based On Game Theory (Prgt)mentioning

confidence: 99%

See 4 more Smart Citations

Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey

Habib

Moh

2019

Applied Sciences

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) have become an important and promising technology owing to their wide range of applications in disaster response, battle field surveillance, wildfire monitoring, radioactivity monitoring, etc. In WSNs, routing plays a significant role in delivery latency, energy consumption, and packet delivery ratio. Furthermore, as these applications are used in critical operations with limited irreplaceable batteries, routing protocols are required to be flawless as well as energy efficient. The dynamic environment also requires intelligent and adaptive routing. Game theory is widely used for designing routing protocols in WSNs to achieve not only reduced energy consumption but also increased packet delivery ratio. The core features of efficiently designed game theory-based routing protocols include optimal cluster head selection in hierarchical routing, energy-efficient and delay-aware route discovery, fault-tolerant data delivery, and coalition forming and grouping among nodes for stringent data transfer. In this paper, different routing protocols based on various types of games are extensively reviewed, which have been reported so far for improving energy consumption, delay, route establishment time, packet delivery ratio, and network lifetime. The different game theory-based routing protocols are qualitatively compared with each other in terms of major features, advantages, limitations, and key characteristics. For each protocol, possible applications and future improvements are summarized. Certain important open concerns and challenges are also discussed, along with future research directions.

show abstract

Section: Game Theory-based Routing Protocols In Wsnsmentioning

confidence: 99%

Section: Probabilistic Routing Scheme Based On Game Theory (Prgt)mentioning

confidence: 99%

Section: Probabilistic Routing Scheme Based On Game Theory (Prgt)mentioning

confidence: 99%

Section: Probabilistic Routing Scheme Based On Game Theory (Prgt)mentioning

confidence: 99%

Section: Probabilistic Routing Scheme Based On Game Theory (Prgt)mentioning

confidence: 99%

See 3 more Smart Citations

Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey

Habib

Moh

2019

Applied Sciences

View full text Add to dashboard Cite

show abstract

Game theoretic application for energy efficient mobility handling in wireless sensor network

Maheshwari

Sharma

Verma

2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Wireless sensor network (WSN) are used to sense, process, and send important information relating to surrounding environment. In these network, one of the important issue is timely delivery of packets to destination and thus avoiding packet loss when sensor nodes are mobile. Most of the current research does not allow handling of packets of mobile sensor nodes till next Time‐division multiple access (TDMA) schedule. In this work, we investigate the problem of allocating reserved slots to mobile nodes which come in vicinity of new cluster head in currenTDMAschedule only. We model allocation of reserved slots to mobile nodes as cooperative game. We then propose cooperative coordination scheme to allow cooperation among mobile sensor nodes for accessing of reserved slots with the objective of avoiding unnecessary delay and packet loss in the network. We consider solution for both the cases when reserved slot is limited to 1 and when reserved slots are more than 1. We then propose evolutionary game theory‐based slot allocation scheme for calculation of probability by solving nash equilibrium point. This probability is used by mobile nodes to send data packets to new cluster head. Our scheme avoids end to end delay of packets and network congestion due to buffer overflows. We then present extensive simulation results comparing our scheme with existing techniques. The results show higher performance in terms of average residual energy, network lifetime and packet delivery ratio etc.

show abstract

Regular routine aware routing in opportunistic mobile social networks

Syed Rabiya,

Ramalakshmi,

Naskath

2023

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Due to intermittent connectivity, routing protocols in opportunistic mobile social networks (OMSN) forward messages through opportunistic contacts. Previous opportunistic routing protocols focus on the past contact history of nodes to make a forwarding decision. It was found that predicting temporally evolving contacts and communities according to different times of the day would improve the accuracy of the prediction. In this paper, a routing paradigm called RRoutine is proposed that allows message holders to exchange multiple copies of the message based on the predicted number of communities. This distribution continues until the remaining copies of the message become one. Each message holder applies either inter or intra‐community forwarding and selects a set of potential forwarders based on the prediction of future encounters in the community and an expected remaining duration between two nodes (ERIMD). The estimation of ERIMD takes into account the sequence of daily activities, the time scale of current activities, and the return time to regular meetings of the nodes. Also, unlike traditional routing, where a single forwarder is selected, a set of potential candidates is selected and prioritized according to their contact prediction, with the most likely candidate receiving the highest priority. Simulation results obtained from synthetic and real mobility data show that the proposed paper improves the performance of the system in terms of message delivery rate, throughput, and latency.

show abstract

An efficient probabilistic routing scheme based on game theory in opportunistic networks

Cited by 25 publications

References 25 publications

Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey

Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey

Game theoretic application for energy efficient mobility handling in wireless sensor network

Regular routine aware routing in opportunistic mobile social networks

Contact Info

Product

Resources

About