IJCNIS Vol. 9, No. 7, 8 Jul. 2017
Cover page and Table of Contents: PDF (size: 611KB)
Full Text (PDF, 611KB), PP.59-66
Views: 0 Downloads: 0
WSN, MANET, Reciprocity, AODV, Energy efficiency
Prolonging network lifetime by salvaging the energy of low battery capacity nodes is a prime concern in Wireless Sensor Networks. Energy efficient routing protocols try to improve the node lifetime by restricting their participation in the routing process. This leads to selfish node behavior causing disruption of inherent network cooperation. This paper proposes an elegant routing mechanism based on direct reciprocity principle, named energy efficient cooperative ad hoc on-demand distance vector (EECoAODV). Proposed protocol correctly differentiates between inherently selfish nodes that use the energy of other nodes to relay their packets, but refuse to reciprocate; and the energy critical nodes that have turned non-cooperative for their own survival. Selfish nodes are punished and eliminated from the routing process thus prolonging the battery capacity of energy critical nodes to improve the overall network performance. EECoAODV is implemented in Qualnet simulator and its performance is compared with conventional AODV and reinforcement based state-action-reward-action (SARSA) routing mechanism. Results show that EECoAODV improves the lifetime of energy critical nodes and thus delivers improved packet delivery ratio than SARSA-AODV and conventional AODV.
Prasanna Shete, R. N. Awale, "Reciprocity based Energy Efficient Cooperative Routing Protocol for WSNs", International Journal of Computer Network and Information Security(IJCNIS), Vol.9, No.7, pp.59-66, 2017. DOI:10.5815/ijcnis.2017.07.07
[1]K. Sohraby, D. Minoli and T. Znati,(2007) “Wireless Sensor Networks: Technology, Protocols and Applications,” Wiley Interscience.
[2]M. Perillo and W. Heinzelman (2004), “Wireless Sensor Network Protocols”.
[3]C. E. Perkins, S. Das (July 2003) “Ad Hoc On-Demand Distance Vector (AODV) Routing,” RFC 3561.
[4]D. B. Johnson, D. A. Maltz (Feb 2007), “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks for IPv4,” RFC 4728.
[5]M. Nowak and K. Sigmund (Oct. 2005), “Evolution of Indirect Reciprocity,” Nature 437, pp. 1291-1298.
[6]Chettibi and S. Chikhi (May 2012), “An adaptive Energy Aware Routing Protocol for MANETs using SARSA Reinforcement Learning Algorithm”, Proc. of IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS), pp. 84- 89.
[7]H. Farooq and L. Jung (2013), “Energy, Traffic Load, and Link Quality Aware Ad Hoc Routing Protocol for Wireless Sensor Network Based Smart Metering Infrastructure,” Intl. Journal of Distributed Sensor Networks, pp. 1-13.
[8]S-H. Park, S. Cho and J-R. Lee (2014), “Energy-Efficient Probabilistic Routing Algorithm for Internet of Things,” Journal of Applied Mathematics, pp. 1-7.
[9]J-P. Hubaux, T. Gross, J-Y Le Baudec, and M. Vetterli (2001), “Towards Self-organized Mobile Ad Hoc Networks: The Terminodes Project”, IEEE Communications Magazine.
[10]S. Zhong, J. Chen and Y. R. Yang(Mar-Apr 2003), “Sprite: A Simple Cheat-Proof, Credit Based System for Mobile Ad hoc Networks”, Proc. of INFOCOM.
[11]L. Anderegg and S. Eidenbenz (Sep. 2003), “Ad hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad hoc Networks with Selfish Agents,” Proc. of 9th Intl. Conf. ACM MobiCom’ 03, pp.245-259.
[12]S. Marti, T. Giuli, K. Lai and M. Baker (Aug. 2000), “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proc. of 6th Intl. Conf. on Mobile Computing and Networking (MobiCom)”.
[13]S. Buchegger and J-Y Le Baudec (June. 2002), “Performance Analysis of the CONFIDANT Protocol (Cooperation of Nodes: Fairness In Dynamic Ad-Hoc Networks)” Proc. of IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHOC),.
[14]Y. Liu and Y. Yang (2003), “Reputation Propagation and Agreement in Mobile Ad Hoc Networks,” Proc.of IEEE Wireless Comm. and Networking Conference pp. 1510-1515.
[15]G. Marias, P. Georgiadis, D. Flitzanis and K. Mandalas (2006), “Cooperation enforcement schemes for MANETs: A survey,” Wireless Communications and Mobile Computing, Vol. 6(3), pp. 319-332.
[16]Srinivasan, P. Nuggehalli, C. Chiasserini and R. Rao (2003), "Cooperation in wireless ad hoc networks," Proc. of 22nd Annual Joint Conference of the IEEE Computer and Communications INFOCOM ‘03, pp. 808-817.
[17]L. Yu. And S. Hailes (May 2008), “Cooperative Packet Relaying Model for Wireless Ad hoc Networks,” Proc. of the 1st ACM Intl. Workshop on Foundations of Wireless Ad hoc and Sensor Networking and Computing, pp. 93-100.
[18]M. Seredynski and P. Bouvry (Feb. 2012), “Direct Reciprocity based Cooperation in Mobile Ad hoc Networks,” Intl. Journal of Foundations of Computer Science, Vol. 23, No. 2, pp. 501-521.
[19]M. Seredynski, G. Danoy and P. Bouvry (2012), “The Necessity for Strong Reciprocators in Mobile Ad Hoc Networks,” Proc. of IEEE 26th Intl. Parallel and Distributed Processing Symposium Workshops & PhD Forum, pp. 609-616.
[20]M. Seredynski and P. Bouvry (Feb. 2013),"Analysing the development of cooperation in MANETs using evolutionary game theory", Journal of Supercomputing, Vol. 63- No. 3, pp. 854-870.
[21]Vamsi, P. Raghu, and Krishna Kant (Feb. 2015) "Self adaptive trust model for secure geographic routing in wireless sensor networks." International Journal of Intelligent Systems and Applications 7.3 (2015), pp. 21-28.
[22]E. Fehr and U. Fischbacher (2003), “The Nature of Human Altruism,” Nature, Vol. 425, pp. 785-791.
[23]H. Brandt and K. Sigmund (2006), “The good, the bad and the discriminator – Errors in direct and indirect reciprocity,” Journal of Theoretical Biology, Vol. 239 (2), pp. 183-194.
[24]H. Gintis(2000), “Strong Reciprocity and Human Sociality,” Journal of Theoretical Biology, Vol. 206, pp. 169-179.
[25]E. Fehr, U. Fischbacher and S. Gachter (2002), “Strong Reciprocity, Human Cooperation, and the enforcement of social norms,” Human Nature, Vol. 13 (1), pp. 1-25.