Research Article
An Efficient Routing and Interface Assignment Algorithm for Multi-Channel Multi-Interface (MCMI) Networks
@INPROCEEDINGS{10.1007/978-3-319-74439-1_12, author={Yifeng Zhou}, title={An Efficient Routing and Interface Assignment Algorithm for Multi-Channel Multi-Interface (MCMI) Networks}, proceedings={Ad Hoc Networks. 9th International Conference, AdHocNets 2017, Niagara Falls, ON, Canada, September 28--29, 2017, Proceedings}, proceedings_a={ADHOCNETS}, year={2018}, month={2}, keywords={ networks MANET Routing Multi-Channel Multi-Interface (MCMI) Viterbi algorithm}, doi={10.1007/978-3-319-74439-1_12} }- Yifeng Zhou
Year: 2018
An Efficient Routing and Interface Assignment Algorithm for Multi-Channel Multi-Interface (MCMI) Networks
ADHOCNETS
Springer
DOI: 10.1007/978-3-319-74439-1_12
Abstract
In this paper, a routing and interface assignment algorithm is proposed for MCMI wireless networks. The algorithm consists of two steps: route selection and interface assignment. The process of route selection is to find the path with the minimum lower bound while the interface assignment is to assign the interfaces on the nodes along the path based on the application of the Viterbi algorithm. The proposed algorithm is computationally efficient due to the decoupling of the route selection and interface assignment processes. Computer simulation and examples are used to demonstrate the effectiveness and performance of the proposed technique. Comparisons are made to other existing routing techniques in the area of dynamical spectrum access.
