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

A New Algorithm of Computing Shortest Path on Wireless 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

3 Author(s)
Hong He ; Sch. of Inf. Eng., Shandong Univ., Weihai ; Shengzhong Yuan ; Zongkai Lin

Computing routing information to support pervasive applications is different from that on the Internet. When the user moves freely from one place to another, the frequently method of computation and communication of routing information on Internet is often a waste of resources. In order to improve the computation of routing information on Internet to support pervasive applications, we put forward a new model of wireless networks and use neural networks as a fast tool to compute shortest paths on-demand on a time-dependent wireless network. The high-speed and stability of the method is proved. It also makes a new study on solving the optimization, but not NP-hard problems by neural networks

Published in:

Pervasive Computing and Applications, 2006 1st International Symposium on

Date of Conference:

3-5 Aug. 2006

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.