A simple greedy algorithm for link scheduling with the physical interference model

Authors:
Dejun Yang;Xi Fang;Nan Li;Guoliang Xue
Affiliations:
Arizona State University, Tempe, AZ;Arizona State University, Tempe, AZ;Arizona State University, Tempe, AZ;Arizona State University, Tempe, AZ
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 11
Cited 0

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Impact of interference on multi-hop wireless network performance

Proceedings of the 9th annual international conference on Mobile computing and networking
Algorithmic aspects of capacity in wireless networks

SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Topology control meets SINR: the scheduling complexity of arbitrary topologies

Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks

Proceedings of the 12th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Efficient interference-aware TDMA link scheduling for static wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Efficient Algorithms for p-Self-Protection Problem in Static Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
The capacity of wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols for wireless networks. Spatial-reuse Time Division Multiple Access (STDMA) has been used to cope with this problem. In this scheme, links are assigned to several time slots and in each slot all the links can transmit simultaneously. In this paper, we propose a greedy link scheduling algorithm to find a short schedule for a problem instance in the physical interference model. Our scheduling algorithm is inspired by the k-MAX-CUT algorithm in [13]. Experimental results show that our greedy algorithm can give a better schedule compared with the greedy algorithm in [3], with an improvement about 20%-30% when the density of links is high.