Packet-Oriented Routing in Delay-Tolerant Vehicular Sensor Networks

• Published in: Journal of Information Science and Engineering Vol. 25; no. 6; pp. 1803 - 1817
• Main Authors: 李旭(Xu Li), 黃宏宇(Hong-Yu Huang), 李明祿(Ming-Lu Li), 舒葦(Wei Shu), 伍民友(Min-You Wu)
• Format: Journal Article
• Language: English
• Published: Taipei 社團法人中華民國計算語言學學會 01.11.2009; Institute of Information Science, Academia sinica
• Subjects: Applied sciences; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Cryptography; Exact sciences and technology; Information, signal and communications theory; Memory and file management (including protection and security); Memory organisation. Data processing; Signal and communications theory; Software; Telecommunications and information theory; software token; password; guessing attack; cryptographic camouflage; authentication; Access control; Epidemic; GPS system; Probabilistic approach; Measurement sensor; Data transmission; Routing; Grouping; Urban area; Delay; Camouflage; Authentication; Routing protocols; Cryptography; Sensor array; Virtual network; Computer security; Monitoring; Computer attack; Password
• ISSN: 1016-2364
• DOI: 10.6688/JISE.2009.25.6.9

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.