An optimal topology-transparent scheduling method in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
An experimental study of a simple, distributed edge coloring algorithm
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop Wireless Networks
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Priority scheduling in wireless ad hoc networks
Wireless Networks
Rate-distortion based link state update
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scheduling aware network flow models for multi-hop wireless networks
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Scheduling partition for order optimal capacity in large-scale wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Impact of information on network performance - an information-theoretic perspective
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
The capacity of wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
Previous research has estimated the performance of wireless networks by assuming that nodes in the network can obtain precise network information. However, in reality, available network information is mostly imprecise and incomplete. In this paper, we study the relationship between wireless network performance and available network information. It is assumed that each node in the network can obtain the information about other nodes within its information collection range, and a distributed graph coloring algorithm is employed to perform scheduling with the available information. The analytical result on the quantitative relationship between the information collection range and the network throughput is derived. We also consider the communication overhead of collecting information, and analyze the tradeoff between network capacity improvement and information collection overhead. Based on the derived result, an optimal information collection range which maximizes the net data rate can be found. Since wireless networks are typically mobile, and the collected information may be inaccurate due to the dynamics of the networks, we analyze the effect of information for mobile wireless networks by considering the information updating rate, and the result can be used to determine the information collection range as well as the information updating period.