On Selection of Paths for Multipath Routing
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Directional geographical routing for real-time video communications in wireless sensor networks
Computer Communications
An efficient multipath structure for concurrent data transport in wireless mesh networks
Computer Communications
Interference-aware routing protocol in multi-radio wireless mesh networks
CFI '09 Proceedings of the 4th International Conference on Future Internet Technologies
Joint Channel Assignment and Multi-path Routing for Multi-radio Wireless Mesh Networks
ICDCSW '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems Workshops
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mobile Networks and Applications
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Multipath routing has been extensively employed in wireless mesh networks (WMNs) for providing network reliability and survivability, therefore, improves energy consumptions. To provide network survivability, each user should be protected against failures, either node or link failures. For each request, a primary path is set up for normal transmission, and an alternate path (protection path) should also be provided to protect the request in case of network failure. In this paper, we study how to provide survivability using multi-path scheme for dynamic network traffic, where users' requests have random arrival times. Compared with previous work, our scheme considers interference and reusability factors when providing multiple paths for each request. By applying our scheme, the numerical results show that we can accommodate about 17% more requests than previous schemes. Meanwhile, the results show that our scheme not only accommodates more requests, but also takes less running time to find a solution for each request.