Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
On the use of sinr for interference-aware routing in wireless multi-hop networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Capacity-aware routing in heterogeneous mesh networks: an analytical approach
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Contention-aware cooperative routing in wireless mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Load-aware routing in mesh networks: Models, algorithms and experimentation
Computer Communications
Routing Internet traffic in heterogeneous mesh networks: Analysis and algorithms
Performance Evaluation
Complexity and design of QoS routing algorithms in wireless mesh networks
Computer Communications
High throughput path selection for IEEE 802.11s based wireless mesh networks
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
Survey paper: A survey on routing algorithms for wireless Ad-Hoc and mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey on diversity-based routing in wireless mesh networks: Challenges and solutions
Computer Communications
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Due to the static nature of nodes, in mesh networks, a poor choice of paths may remain unchanged for a long time and create hot spots. Hence, it is very important to design path weight functions (also called routing metrics) to facilitate load-balanced routing in mesh networks. Such path weight functions (PWFs) must reflect the shared nature of wireless channels and support easy calculation of loop-free paths. In this abstract, we present our theoretical studies of the requirements on PWFs and design the first PWF, called Metric of Interference and Channel-switching (MIC), that satisfies these requirements. Our simulation results show that MIC's performance is substantially better than existing PWFs. (See our technical report [5] for more details.)