Design of Routing Protocol for Opportunistic Network Based on Adaptive Motion

Zhang, Qifei; Song, Ying; Sun, Baolin; Dai, Zhifeng

doi:10.1109/access.2020.2968598

Cited by 11 publications

(12 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The study of the D2D technology is a popular topic to alleviate cellular overloads. We here conduct some extensive investigations on D2D communication and applications [14]- [17]. In [16], the authors proposed a multi-type mobile data offloading model based on D2D communication that considers mobile users and realistic heterogeneous mobile data.…”

Section: Related Workmentioning

confidence: 99%

“…The above analysis concludes the following Proposition 3. Proposition 3: In the proposed game, MUs best response strategies are a piecewise line function of the unit price p: 1) On the basis of (14) and (16), our work generates a set of price endpoints {p 1 , . .…”

Section: The Leader Game In Stage Imentioning

confidence: 99%

“…none; Output: p * , x * ; 1: initialization: p * ← 0, I 1 = N , V * ← 0, k ← 1 2: initialize x * (p) using Algorithm 1 while setting p * = 0; 3: calculate p 1 and n 1 according to (14) and 15…”

mentioning

confidence: 99%

See 2 more Smart Citations

An Economic Incentive for D2D Assisted Offloading Using Stackelberg Game

Qiao

Liu

2020

IEEE Access

View full text Add to dashboard Cite

The explosive growth of traffic demand challenges the current cellular network. Device-to-Device assisted offloading is a promising solution for alleviating traffic overloading burdens. However, a content transmitter (CT) unwillingly participates in cellular offloading due to the selfish nature and noncooperation. To this end, an incentive mechanism initiated by mobile users (MUs) is proposed to motivate the CT s participation for maximizing the CT s profit and mobile users utilities. In particular, we consider the utility of a mobile user by jointly combining effects of social awareness and network congestion. The MUs and content providers offer proper economic payments to compensate the CT s energy consumption cost. The interactions among participants formulate a two-stage Stackelberg game. The main aim of this game is to reach Nash equilibrium (NE) that neither the CT nor MUs have incentives to deviate unilaterally. We theoretically prove the existence and uniqueness of NE. Furthermore, iterative algorithms are designed to calculate NE for obtaining the best strategies of the CT and MUs. Numerical results demonstrate the robustness and feasibility of our proposed model.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: The Leader Game In Stage Imentioning

confidence: 99%

See 1 more Smart Citation

An Economic Incentive for D2D Assisted Offloading Using Stackelberg Game

Qiao

Liu

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Lately, in 2020, Zhang et al proposed Adaptive Motion-based Opportunistic Routing (AMOR) [56], an application of the opportunistic routing protocol that makes use of contact opportunities by carrying the data during the movement of the carrier. Hence, motivated by this mobility features of the carrier, this protocol offers an adaptive mobility-based opportunistic routing mechanism, which specifically works on opportunistic networks.…”

Section: Amormentioning

confidence: 99%

A Survey on the Evolution of Opportunistic Routing with Asynchronous Duty-Cycled MAC in Wireless Sensor Networks

Akter

Kang

2020

Sensors

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) have been used for environmental monitoring and reporting for many decades. Energy consumption is a significant research topic because wireless sensor nodes are battery-operated to be highly energy-constrained. Several strategies have been introduced in routing and MAC (Medium Access Control) layer protocols to facilitate energy saving. At the routing layer, an energy-efficient routing protocol, known as opportunistic routing (OR), has been designed to improve efficiency. OR achieves energy efficiency via load-balancing, which forwards packets along multiple routes over WSNs. At the MAC layer, an energy-efficient MAC protocol known as the asynchronous duty-cycled MAC (ADCM) protocol achieves energy saving by turning on and off a sensor node’s transmitter and receiver to eliminate unnecessary energy wastage. These protocols each have their own advantages and disadvantages. OR achieves energy efficiency at the routing layer but it raises an issue at the MAC layer. ADCM achieves energy efficiency at the MAC layer, but it hinders the packet forwarding efficiency of the OR. To attain better energy efficiency, a combination of these two ideas led to the development of OR with asynchronous duty-cycled MAC (OR-ADCM). However, even with better energy efficiency, limitations still exist in combining load-balancing and duty-cycling due to conflicts in the inherent properties of OR and ADCM. In this paper, we present a survey of the evolution of OR-ADCM over WSNs to help the reader better understand and appreciate the details of this tradeoff, which we hope will lead to the development of better protocol designs.

show abstract

“…A mobile ad hoc network (MANET) is an Internet made up of mobile nodes that are not supported by any base stations or infrastructure. Due to rapid development, it has been widely used in many fields such as military and civil [1][2][3]. In MANET, the nodes are mobile and the links are wireless.…”

Section: Introductionmentioning

confidence: 99%

Graph Kernel Based Clustering Algorithm in MANETs

Song

Luo²,

et al. 2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

The mobile ad hoc network (MANET) is a kind of dynamic, easy to construct and universal network, which has been widely concerned by a large number of researchers. Graph theory provides an effective theoretical tool for MANETs modeling and analysis. Clustering is one of the most effective methods to measure network performance with different attributes. This paper gives the basic concept of graph kernel and discusses the principle of optimizing graph kernel and multi-graph kernel. In this paper, we propose a Graph Kernel based Clustering Algorithm in MANETs (GKCA). The GKCA algorithm gives the basic concept of graph kernel, discusses the principle of optimizing graph kernel and multi-graph kernel, and proposes the basic principle based on d-hop graph kernel. GKCA algorithm uses shortest path (SP) to connect different cluster head nodes for packet transmission. The performance of GKCA algorithm, such as the control packets ratio, packets loss ratio, and average end-to-end delay are experimentally evaluated using network simulation (NS2) software. Experimental analysis shows that the proposed approach is efficient, and its performance advantage in dynamic mobile networks is promising.

show abstract

Design of Routing Protocol for Opportunistic Network Based on Adaptive Motion

Cited by 11 publications

References 35 publications

An Economic Incentive for D2D Assisted Offloading Using Stackelberg Game

An Economic Incentive for D2D Assisted Offloading Using Stackelberg Game

A Survey on the Evolution of Opportunistic Routing with Asynchronous Duty-Cycled MAC in Wireless Sensor Networks

Graph Kernel Based Clustering Algorithm in MANETs

Contact Info

Product

Resources

About