By Topic

A trustworthy energy efficient MIMO routing algorithm based on game theory for WSN

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sathian, D. ; Dept. of Comput. Sci., Pondicherry Univ., Puducherry, India ; Baskaran, R. ; Dhavachelvan, P.

Wireless sensor network requires robust and energy efficient routing protocols to minimise the energy consumption as much as possible. Channel fading, interference and radio irregularity create a big challenge in the design of energy efficient communication and to route the data in wireless network. To mitigate the fading effects in wireless channel, multi-input multi-output (MIMO) scheme is utilised for sensor network A Trustworthy Energy-Efficient MIMO (TEEM) routing algorithm designed for wireless sensor network is introduced in this paper and the performance of the system is evaluated to minimise the energy consumption and increase the lifetime of sensor nodes. Game theory is used to elect healthier cluster heads having sufficient residual energy and high trust level during the cluster heads election. Further the game theory is used to select the cooperative nodes for MIMO communication. Simulation results show to the effectiveness of the TEEM routing algorithm which provides 68% increase in residual energy as compared to TEER for 1000 rounds. This is due to the use of the diversity gain of MIMO systems.

Published in:

Advances in Engineering, Science and Management (ICAESM), 2012 International Conference on

Date of Conference:

30-31 March 2012