Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Ad Hoc Networking
G-AODV+PCMTAG: routing in manet with low overhead flooding and route-shortening
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
IEEE Communications Surveys & Tutorials
(p,q)-Epidemic routing for sparsely populated mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In Intelligent Transport System (ITS), multiple vehicular mobile nodes cooperate through a wireless communication network. Here, data messages are transmitted along a multihop route with help of intermediate nodes. In an area with sparsely distributed nodes, mobility of a node carrying data messages also helps to achieve higher transmission ratio. This paper proposes a method for message transmission along a sequence of street segments detected by a GPS satellite navigation system. Due to combination of dynamic determination of intermediate nodes and a store-carry-forward method, higher transmission ratio and shorter end-to-end transmission delay are achieved even with high mobility and sparse distribution of nodes.