2014
DOI: 10.1155/2014/753024
|View full text |Cite
|
Sign up to set email alerts
|

Social Contribution-Based Routing Protocol for Vehicular Network with Selfish Nodes

Abstract: Routing in vehicular network is a challenging task due to the characteristic of intermittent connectivity, especially when nodes behave selfishly in the real world. Previous works usually assume that all nodes in the network are willing to forward packets for others, which is impractical in real world. Selfish behaviors of nodes would degrade network performance greatly. In this paper, we propose SCR, a social contribution-based routing protocol, for selfish vehicular network. When making forwarding decision, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 39 publications
(34 citation statements)
references
References 22 publications
0
34
0
Order By: Relevance
“…The scheme regards the parked vehicles as RSUs. With on board wireless device and rechargeable battery, parked cars can communicate with any cars driving through them [13][14][15][16][17]. Moreover, [18][19][20][21][22][23] have introduced the concept of vehicle cloud which are employed for multimedia sharing and distribution.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The scheme regards the parked vehicles as RSUs. With on board wireless device and rechargeable battery, parked cars can communicate with any cars driving through them [13][14][15][16][17]. Moreover, [18][19][20][21][22][23] have introduced the concept of vehicle cloud which are employed for multimedia sharing and distribution.…”
Section: Related Workmentioning
confidence: 99%
“…where · denotes the floor function, E(c) denotes the average transmission rate which can be obtained by formula (17). Besides, in Fig.…”
Section: Transmission Capability Between Two Vehiclesmentioning
confidence: 99%
“…(1) // illustrate from node A's viewpoint (2) if Con( , Com ) − Ben( , Com ) > maxSize then (3) Node A refuses to forward for node B (4) else (5) if Con( , Com ) − Ben( , Com ) < minSize then (6) Node A refuses to forward for node B (7) else (8) Node A forwards for node B (9) end if (10) end if Algorithm 1: Pseudocode of Node-to-Com Barter strategy.…”
Section: Node-to-com Bartermentioning
confidence: 99%
“…Obviously, the cooperation of nodes is the basic principle in this fashion. However, in reality, nodes usually adopt selfish behavior in order to save limited resources or protect their private information [9][10][11], which affects the forwarding performance heavily.…”
Section: Introductionmentioning
confidence: 99%
“…When nodes behave selfishly, routing decision is made by the contribution index that indicates the contributions to data transmissions of the network made by nodes. Moreover, they present a social contribution-based routing protocol for selfish vehicular network in [16]. When making forwarding decision, the protocol considers both the delivery probability to the destination and the social contributions of the relay node.…”
Section: Handle Selfishnessmentioning
confidence: 99%