Abstract
This paper focuses on establishing a communications path among an ordered sequence of moving nodes, representing vehicles. A channel is used to send information from one node to the next in the sequence on a wireless link. The set of available channels may differ from one node to the next node. Each of the available channels at a node can be used for receiving information from its predecessor node in the sequence or for transmitting information to its successor node in the sequence. However, the same channel cannot be used at a node for both receiving and transmitting information. We present algorithms that determine an optimal sequence of channels that establishes a communications path from the first node to the farthest node possible. We present a depth-first search algorithm that uses a “look-ahead” channel selection rule in order to decrease backtracking. We also present an algorithm that requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking. The latter algorithm requires computational effort that is proportional to the number of nodes in the ordered sequence of nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, W., and Cai, S., 2005, Ad hoc peer-to-peer network architecture for vehicle safety communications, IEEE Communications Magazine, April, 100-107.
Chen, W., Cai, S., Chennikara-Varghese, J., Hikita, T., and Lee, J., 2006, Dynamic local peer group organizations for vehicle communications, Proceedings of Vehicle-to-Vehicle Communications Workshop (V2VCOM 2006) co-located with ACM MobiQuitous, July 21, San Jose, California.
Chisalita, I., and Shahmehri, N., 2002, A peer-to-peer approach to vehicular communication for the support of traffic safety applications, Proceedings of the 5 th IEEE Conference on Intelligent Transportation Systems, Singapore, September 3-6, 336-341.
Cidon, I., and Sidi, M., 1989, Distributed assignment algorithms for multi-hop packet radio networks, IEEE Transactions on Computer 38:1353-1361.
Ephremides, A., and Truong, T., 1990, Scheduling broadcasts in multi-hop radio networks, IEEE Transactions on Communications 38:456-460.
Lin, C. R., and Gerla, M., 1997, Adaptive clustering for mobile wireless networks, IEEE Journal on Selected Areas in Communication 15:1265-1275.
Lin, C. R., and Liu, M. J. S., 1999, QoS routing in ad hoc wireless networks, IEEE Journal on Selected Areas in Communications 17:1426-1438.
Lu, L., 1993, Distributed code assignment for CDMA packet radio networks, IEEE/ACM Transactions on Networking 1:668-677.
McDonald, A. B., and Znati, T. F., 1999, A mobility-based framework for adaptive clustering in wireless ad-hoc networks, IEEE Journal on Selected Areas in Communications 17: 1466-1487.
Xu, C., Liu, K., Yuan, Y., and Liu, G., 2006, A novel multi-channel based framework for wireless IEEE 802.11 ad hoc networks, Asian Journal of Information Technology 5:44- 47.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Luss, H., Chen, W. (2008). Optimal Multi-Channel Assignments in Vehicular Ad-Hoc Networks. In: Raghavan, S., Golden, B., Wasil, E. (eds) Telecommunications Modeling, Policy, and Technology. Operations Research/Computer Science Interfaces, vol 44. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77780-1_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-77780-1_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77779-5
Online ISBN: 978-0-387-77780-1
eBook Packages: Computer ScienceComputer Science (R0)