| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] |
¡@
XU LI, HONG-YU HUANG, MING-LU LI, WEI SHU+ AND MIN-YOU WU
Department of Computer Science and Engineering
Shanghai Jiao Tong University
Shanghai, 200240 P.R. China
+Department of Electrical and Computer Engineering
The University of New Mexico
Albuquerque, 87131 U.S.A.
Currently, vehicular sensor network (VSN) has been paid much attention for monitoring
the physical world of urban areas. We have studied VSNs by utilizing about 4000
taxis and 1000 buses equipped with GPS-based mobile sensors in Shanghai to constitute
a virtual vehicular sensor network. The communication-connection intermittence makes
the routing issue nontrivial when delay-tolerant applications are deployed in VSNs. The
existing DTN routing protocols can be categorized as "neighbor-oriented" and how to
select a neighbor candidate was always neglected. In this paper, we present a new DTN
routing protocol for Delay-Tolerant Vehicular Sensor Networks, Packet-Oriented Routing
protocol (POR), which is designed to emphasize neighbor selection based on awareness
of packets to be sent and in consideration of probability to complete transferring of
these packets. Our results show that POR performs much better than the ordinary Epidemic
routing, as well as other popular routing protocols applied in a similar setting.
Received December 21, 2007; revised March 11 & April 15, 2008; accepted May 29, 2008.
Communicated by Ten-Hwang Lai.
* This paper was partially supported by Natural Science Foundation of China under grants No. 60573138 and
60773091, the National Grand Fundamental Research 973 Program of China under grant No. 2006CB-303000,
the National 863 Program under grant No. 2005aa122320, and National Science Foundation of U.S.A. under
grant No. CNR-0626380, and was presented in part at the 51st IEEE Global Communications Conference, New
Orleans, LA, USA, 2008.