Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Exploiting medium access diversity in rate adaptive wireless LANs
Proceedings of the 10th annual international conference on Mobile computing and networking
Some simple distributed algorithms for sparse networks
Distributed Computing
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
Proceedings of the 11th annual international conference on Mobile computing and networking
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Coordinated enroute multimedia object caching in transcoding proxies for tree networks
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Optimal methods for coordinated enroute web caching for tree networks
ACM Transactions on Internet Technology (TOIT)
Maximizing transmission time (MTT): a distributed MAC scheme for enhancing wireless LAN performance
Mobile Networks and Applications
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Multimedia Object Placement for Transparent Data Replication
IEEE Transactions on Parallel and Distributed Systems
Scheduling algorithms for multi-carrier wireless data systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Optimal channel probing and transmission scheduling for opportunistic spectrum access
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A case for adapting channel width in wireless networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
An adaptive QoS framework for integrated cellular and WLAN networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Wireless IP through integration of wireless LAN and cellular networks
Direction finding and “smart antennas” using software radio architectures
IEEE Communications Magazine
Maxmin fair scheduling in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In highly dynamic and heterogeneous wireless mesh networks (WMN), link quality will seriously affect network performance. Two challenges hinder us from achieving a highly efficient WMN. One is the channel dynamics. As in real network deployment, channel qualities are changing over time, which would seriously affect network bandwidth and reliability. Existing works are limited to the assumption that link quality values are fixed, and optimal scheduling algorithms are working on the fixed values, which would inevitably suffer from the link quality dynamics. Another challenge is the channel diversity. In single channel wireless networks, channel assignment and scheduling are $\mathcal{NP}$ -hard. And in multichannel wireless networks, it could be even harder for higher throughput and efficient scheduling. In this study, we firstly characterize the stochastic behavior on wireless communications in a Markov process, which is based on statistical methodology. Secondly, on exploiting the stochastic behavior on wireless channels, we propose a stochastic programming model in achieving maximized network utilization. Considering the $\mathcal{NP}$ -hardness, we propose a heuristic solution for it. The key idea in the proposed algorithm is a two-stage matching process named "Rematch." Indeed, our solution to the stochastic network scheduling is a cross-layer approach. Also, we have proved that it is 2-approximate to the optimal result. Moreover, extensive simulations have been done, showing the efficiency of "Rematch" in highly dynamic and distributed wireless mesh networks.