DocumentCode
1571966
Title
A routing scheme based on subarea mobile service in wireless sensor networks
Author
Huang, Siyu ; Gao, Qiang ; Fei, Li ; Zhang, Xu
Author_Institution
Sch. of Electron. & Inf. Eng., Beihang Univ., Beijing, China
fYear
2009
Firstpage
643
Lastpage
646
Abstract
The mobility has been shown to be beneficial to improve the performance of wireless sensor networks. In this paper, a new routing scheme based on subarea mobile service is proposed. According to the number of mobile nodes in the network, the area of network is divided into multiple subareas equally. In each subarea, there is one mobile node to relay the data of static nodes. Based on Nearest Neighbor Algorithm, each mobile node plans the moving path in its own subarea. The simulation result shows that under the proposed routing scheme, the throughput of network could be increased, the average delay and delay jitter could be reduced.
Keywords
search problems; telecommunication network routing; wireless sensor networks; nearest neighbor algorithm; routing scheme; subarea mobile service; wireless sensor networks; Communications technology; Data engineering; Delay effects; Jitter; Nearest neighbor searches; Relays; Routing; Throughput; Wireless communication; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Pervasive Computing (JCPC), 2009 Joint Conferences on
Conference_Location
Tamsui, Taipei
Print_ISBN
978-1-4244-5227-9
Electronic_ISBN
978-1-4244-5228-6
Type
conf
DOI
10.1109/JCPC.2009.5420103
Filename
5420103
Link To Document