Cart (Loading....) | Create Account
Close category search window
 

A Price-Based Optimal Routing Algorithm in Wireless Sensor Networks

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

2 Author(s)
Emamjomeh, M. ; Electr. Eng., Iran Univ. of Sci. & Technol., Tehran, Iran ; Arisian, B.

Routing methods and algorithms in "Wireless Sensor Networks" attract researchers' attention a lot recently. In order to find the optimal path in WSNs depending on their type and application, various algorithms are proposed. In this paper, an optimal path finding algorithm based on "Game Theory" is discussed and improved. This algorithm finds a path witch is optimizing network lifetime, load distribution, and path reliability simultaneously.

Published in:

Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on

Date of Conference:

23-25 Sept. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.