Optimizing wireless unicast and multicast sensor networks on the basis of evolutionary game theory. (10th June 2013)

• Record Type: Journal Article
• Authors: Chen, Zhide; Qiao, Cheng; Xu, Li; Wu, Wei; Xhafa, Fatos; Chen, Xiaofeng; Huang, Xinyi; Kolici, Vladi
• Is Part Of: Concurrency and computation. Volume 26:Number 5(2014:Apr.)
• Page Start: 1130
• Page End: 1141
• Publication Date: 2013-06-10
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3060
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main"> <title>SUMMARY</title> <p>This paper presents two routing games, a unicast and a multicast routing game, for wireless sensor networks. We analyze the actions of nodes inside/outside lowest cost path (LCP) and draw their payoff functions. Our simulation shows that this evolutionary game theory scheme has several advantages over a widely used collusion–resistant routing scheme. All nodes, either out of LCP or in LCP, will ultimately choose the strategy 'transmit'. To improve the payoff, nodes in LCP should either minimize their actual forwarding cost or maximize their claimed cost as long as it remains in the LCP, whereas minimizing the actual claimed cost is not an optimal option for nodes out of LCP. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>