TY - GEN
T1 - A routing scheme based on subarea mobile service in wireless sensor networks
AU - Huang, Siyu
AU - Gao, Qiang
AU - Fei, Li
AU - Zhang, Xu
PY - 2009
Y1 - 2009
N2 - The mobility has been shown to be beneficial to improve the performance ofwireless 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 ofnetwork 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.
AB - The mobility has been shown to be beneficial to improve the performance ofwireless 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 ofnetwork 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.
UR - https://www.scopus.com/pages/publications/77951280814
U2 - 10.1109/JCPC.2009.5420103
DO - 10.1109/JCPC.2009.5420103
M3 - 会议稿件
AN - SCOPUS:77951280814
SN - 9781424452279
T3 - 2009 Joint Conferences on Pervasive Computing, JCPC 2009
SP - 643
EP - 646
BT - 2009 Joint Conferences on Pervasive Computing, JCPC 2009
T2 - 2009 Joint Conferences on Pervasive Computing, JCPC 2009
Y2 - 3 December 2009 through 5 December 2009
ER -