Stimulating cooperation in route discovery of ad hoc networks

Lei Huang; Lei Ii; Lixiang Liu; Haibin Zhang; Linsha Tang

doi:10.1145/1298239.1298247

Stimulating cooperation in route discovery of ad hoc networks

Lei Huang^*, Lei Ii, Lixiang Liu, Haibin Zhang, Linsha Tang

^*Corresponding author for this work

CAS - Institute of Software

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Citations (Scopus)

Abstract

In autonomous ad hoc network, nodes belonging to different entities try to maximize their own utilities. Selfish dropping of route control packets relieves node of relaying packets for others and saves its own resources. Current watchdog or ACK-based detection scheme cannot cope with it effectively. Based on statistics relation of route control packets within neighborhood, this paper proposed an energy-efficient distributed algorithm to detect the selfishness in route discovery. Relation between key parameter setting , algorithm's effectiveness and performance was analyzed with tool of game theory. Extensive simulations showed that the algorithm could detect and punish the selfish nodes effectively.

Original language	English
Title of host publication	Q2SWinet'07
Subtitle of host publication	Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks
Pages	39-46
Number of pages	8
DOIs	https://doi.org/10.1145/1298239.1298247
Publication status	Published - 2007
Externally published	Yes
Event	Q2SWinet'07: 3rd ACM Workshop on Q2S and Security for Wireless and Mobile Networks - Chania, Crete Island, Greece Duration: 22 Oct 2007 → 22 Oct 2007

Publication series

Name	Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks

Conference

Conference	Q2SWinet'07: 3rd ACM Workshop on Q2S and Security for Wireless and Mobile Networks
Country/Territory	Greece
City	Chania, Crete Island
Period	22/10/07 → 22/10/07

Keywords

Ad hoc network
Game theory
Reputation-based incentive mechanism
Routing cooperation

Access to Document

10.1145/1298239.1298247

Cite this

Huang, L., Ii, L., Liu, L., Zhang, H., & Tang, L. (2007). Stimulating cooperation in route discovery of ad hoc networks. In Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks (pp. 39-46). (Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks). https://doi.org/10.1145/1298239.1298247

@inproceedings{eb74096bf58842dd8f16be8a9acbe8c4,

title = "Stimulating cooperation in route discovery of ad hoc networks",

abstract = "In autonomous ad hoc network, nodes belonging to different entities try to maximize their own utilities. Selfish dropping of route control packets relieves node of relaying packets for others and saves its own resources. Current watchdog or ACK-based detection scheme cannot cope with it effectively. Based on statistics relation of route control packets within neighborhood, this paper proposed an energy-efficient distributed algorithm to detect the selfishness in route discovery. Relation between key parameter setting , algorithm's effectiveness and performance was analyzed with tool of game theory. Extensive simulations showed that the algorithm could detect and punish the selfish nodes effectively.",

keywords = "Ad hoc network, Game theory, Reputation-based incentive mechanism, Routing cooperation",

author = "Lei Huang and Lei Ii and Lixiang Liu and Haibin Zhang and Linsha Tang",

year = "2007",

doi = "10.1145/1298239.1298247",

language = "English",

isbn = "9781595938060",

series = "Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks",

pages = "39--46",

booktitle = "Q2SWinet'07",

note = "Q2SWinet'07: 3rd ACM Workshop on Q2S and Security for Wireless and Mobile Networks ; Conference date: 22-10-2007 Through 22-10-2007",

}

Huang, L, Ii, L, Liu, L, Zhang, H & Tang, L 2007, Stimulating cooperation in route discovery of ad hoc networks. in Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks. Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks, pp. 39-46, Q2SWinet'07: 3rd ACM Workshop on Q2S and Security for Wireless and Mobile Networks, Chania, Crete Island, Greece, 22/10/07. https://doi.org/10.1145/1298239.1298247

Stimulating cooperation in route discovery of ad hoc networks. / Huang, Lei; Ii, Lei; Liu, Lixiang et al.
Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks. 2007. p. 39-46 (Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Stimulating cooperation in route discovery of ad hoc networks

AU - Huang, Lei

AU - Ii, Lei

AU - Liu, Lixiang

AU - Zhang, Haibin

AU - Tang, Linsha

PY - 2007

Y1 - 2007

N2 - In autonomous ad hoc network, nodes belonging to different entities try to maximize their own utilities. Selfish dropping of route control packets relieves node of relaying packets for others and saves its own resources. Current watchdog or ACK-based detection scheme cannot cope with it effectively. Based on statistics relation of route control packets within neighborhood, this paper proposed an energy-efficient distributed algorithm to detect the selfishness in route discovery. Relation between key parameter setting , algorithm's effectiveness and performance was analyzed with tool of game theory. Extensive simulations showed that the algorithm could detect and punish the selfish nodes effectively.

AB - In autonomous ad hoc network, nodes belonging to different entities try to maximize their own utilities. Selfish dropping of route control packets relieves node of relaying packets for others and saves its own resources. Current watchdog or ACK-based detection scheme cannot cope with it effectively. Based on statistics relation of route control packets within neighborhood, this paper proposed an energy-efficient distributed algorithm to detect the selfishness in route discovery. Relation between key parameter setting , algorithm's effectiveness and performance was analyzed with tool of game theory. Extensive simulations showed that the algorithm could detect and punish the selfish nodes effectively.

KW - Ad hoc network

KW - Game theory

KW - Reputation-based incentive mechanism

KW - Routing cooperation

UR - http://www.scopus.com/inward/record.url?scp=42149133641&partnerID=8YFLogxK

U2 - 10.1145/1298239.1298247

DO - 10.1145/1298239.1298247

M3 - Conference contribution

AN - SCOPUS:42149133641

SN - 9781595938060

T3 - Q2SWinet'07: Proceedings of the Third ACM Workshop on Q2S and Security for Wireless and Mobile Networks

SP - 39

EP - 46

BT - Q2SWinet'07

T2 - Q2SWinet'07: 3rd ACM Workshop on Q2S and Security for Wireless and Mobile Networks

Y2 - 22 October 2007 through 22 October 2007

ER -

Stimulating cooperation in route discovery of ad hoc networks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this