GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geographic routing in city scenarios
ACM SIGMOBILE Mobile Computing and Communications Review
Search: A routing protocol for mobile cognitive radio ad-hoc networks
Computer Communications
Beacon-less geographic routing made practical: challenges, design guidelines, and protocols
IEEE Communications Magazine
IEEE/ACM Transactions on Networking (TON)
A geometric approach to improve spectrum efficiency for cognitive relay networks
IEEE Transactions on Wireless Communications
Geo-opportunistic routing for vehicular networks
IEEE Communications Magazine
Routing in cognitive radio networks: Challenges and solutions
Ad Hoc Networks
WiFi-NC: WiFi over narrow channels
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
A survey of common control channel design in cognitive radio networks
Physical Communication
Advances on Network Protocols and Algorithms for Vehicular Ad Hoc Networks
Mobile Networks and Applications
| Hi-index | 0.00 |
The FCC and ETSI have allocated spectrum in the 5.9 GHz band for intelligent transportation systems. However, this spectrum supports short-range transmissions (up to 1000 m) and limited bandwidth (up to 75 MHz), which are not enough to meet the increasing demand for in-car infotainment services. In this paper, we propose a distributed routing protocol for vehicular ad hoc networks, where cognitive radio enabled vehicles (CRVs) dynamically share the TV-band channels. In the proposed protocol, CRVs jointly select relay nodes, channels, transmission powers, and transmission rates so that their total transmission rates are maximized while meeting their rate demands and power constraints. This selection process is carefully executed so that ongoing communications between primary radios (PRs) and between other CRVs are not disrupted. Once the relay nodes are selected, they continue to relay more messages as long as they stay in a predefined forwarding area. By doing so, the overhead for selecting relay nodes can be substantially reduced. Channels, powers, and rates are changed on a per-packet and per-hop basis so that the proposed protocol can efficiently adapt to spectrum dynamics. Simulation results show that our protocol increases the end-to-end network throughput by up to 250 % and decreases the end-to-end delay by up to 400 % compared with other geographical routing protocols.