A New Algorithm of Computing Shortest Path on Wireless Networks

Author

He, Hong ; Yuan, Shengzhong ; Lin, Zongkai

Author_Institution

Sch. of Inf. Eng., Shandong Univ., Weihai

fYear

2006

fDate

3-5 Aug. 2006

Firstpage

705

Lastpage

709

Abstract

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

Keywords

Internet; graph theory; neural nets; telecommunication network routing; wireless sensor networks; Internet; neural network; pervasive application; routing information; shortest path algorithm; wireless network; Base stations; Computer networks; Educational technology; Helium; IP networks; Internet; Neural networks; Pervasive computing; Routing; Wireless networks; Pervasive application; neural networks; routing information; shortest path; wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Pervasive Computing and Applications, 2006 1st International Symposium on

Conference_Location

Urumqi

Print_ISBN

1-4244-0326-x

Electronic_ISBN

1-4244-0326-x

Type

conf

DOI

10.1109/SPCA.2006.297514

Filename

4079085