Low complexity stable link scheduling for maximizing throughput in wireless networks

2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009

Volumn , Issue , 2009, Pages

  Tang, Shaojie ^a   Wu, Xiaobing ^b   Mao, Xufei ^a   Wu, Yanwei ^a   Xu, Ping ^a   Chen, Guihai ^b   Li, Xiang Yang ^a  

^a Illinois Institute of Technology   (United States)

^b NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY REGIONS; CONTROL OVERHEAD; DISTRIBUTED ALGORITHM; LINK SCHEDULING; LOCATION INFORMATION; LOW COMPLEXITY; MINIMUM TIME; MULTIHOP WIRELESS NETWORK; PARAMETERIZED; THROUGHPUT PERFORMANCE; TIME SLOTS; WIRELESS NODES;

AD HOC NETWORKS; COMMUNICATION; COMPUTATIONAL GEOMETRY; PARALLEL ALGORITHMS; SENSOR NETWORKS; SENSORS;

SCHEDULING ALGORITHMS;

EID: 70449638243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SAHCN.2009.5168943     Document Type: Conference Paper

References (35)

1. ALZOUBI, K., LI, X.-Y., WANG, Y., WAN, P.-J., AND FRIEDER, O. Geometric spanners for wireless ad hoc networks. IEEE TPDS 14, 4 (2003), 408-421.
2. CHAPORKAR, P., AND PROUTIERE, A. Adaptive network coding and scheduling for maximizing throughput in wireless networks. In ACM MobiCom (2007), pp. 135-146.
3. DHALL, S., AND LIU, C. On a Real-Time Scheduling Problem. Operations Research 26, 1 (1978), 127-140.
4. ERLEBACH, T., AND JANSEN, K. Conversion of coloring algorithms into maximum weight independent set algorithms. Discrete Applied Mathematics 148, 1 (2005), 107-125.
5. ERLEBACH, T., JANSEN, K., AND SEIDEL, E. Polynomial-time approximation schemes for geometric graphs. In ACM-SIAM SODA (2001), pp. 671-679.
6. G., S., C., J., AND SHROFF, N. Distributed scheduling schemes for throughput guarantees in wireless networks. Allerton 2006 (2006
7. HARRY, I., HUNT, B., MARATHE, M., RADHAKRISHNAN, V., RAVI, S., ROSENKRATZ, D., AND STEARNS, R. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Networks 25 (1995), 59-68.
8. JAIN, K., PADHYE, J., PADMANABHAN, V. N., AND QIU, L. Impact of interference on multi-hop wireless network performance. In ACM MobiCom (2003), pp. 66-80.
9. JOO, C. A local greedy scheduling scheme with provable performance guarantee. In ACM MobiHoc (2008), pp. 111-120.
10. JOO, C., LIN, X., AND SHROFF, N. Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks. In IEEE INFOCOM (2008), pp. 1103-1111.
11. JOO, C., AND SHROFF, N. Performance of random access scheduling schemes in multi-hop wireless networks. In IEEE INFOCOM (2007
12. KABBANI, A., SALONIDIS, T., AND KNIGHTLY, E. Distributed Low- Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks. In IEEE INFOCOM (2007), pp. 2063-2071.
13. KUHN, F., NIEBERG, T., MOSCIBRODA, T., AND WATTENHOFER, R. Local approximation schemes for ad hoc and sensor networks. In DIALM-POMC ( 2005), pp. 97-103. (Pubitemid 44030736)
14. KUMAR, P., AND MEYN, S. Stability of queueing networks and scheduling policies. Automatic Control, IEEE Transactions on 40, 2 (1995), 251-260.
15. LI, X.-Y., AND WANG, Y. Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks. Journal of Parallel and Distributed Computing (2005
16. LIN, X., AND RASOOL, S. Constant-time distributed scheduling policies for ad hoc wireless networks. In IEEE CDC (2006
17. LIN, X., AND SHROFF, N. B. The impact of imperfect scheduling on cross-layer congestion control in wireless networks. IEEE/ACM Trans. Netw. 14, 2 (2006), 302-315.
18. LIU, Y., AND KNIGHTLY, E. Opportunistic fair scheduling over multiple wireless channels. In IEEE INFOCOM, (2003) vol.2.
19. LU, S., BHARGHAVAN, V., AND SRIKANT, R. Fair scheduling in wireless packet networks. IEEE/ACM Transactions on Networking (TON) 7, 4 (1999), 473-489.
20. LU, S., AND KUMAR, P. Distributed scheduling based on due dates and buffer priorities. Automatic Control, IEEE Transactions on 36, 12 (1991), 1406-1416.
21. MARATHE, M., BREU, H., HUNT III, H., RAVI, S., AND ROSENKRATZ, D. Simple heuristics for unit disk graphs. Networks 25 (1995), 59-68.
22. MODIANO, E., SHAH, D., AND ZUSSMAN, G. Maximizing throughput in wireless networks via gossiping. In SIGMETRICS Perform. Eval. Rev. (2006), vol.34, pp. 27-38.
23. NIEBERG, T., HURINK, J., AND KERN, W. A robust PTAS for maximum weight independent sets in unit disk graphs. In Workshop on Graph-Theoretic Concepts in Computer Science (2004), pp. 214-221.
24. PENTTINEN, A., KOUTSOPOULOS, I., AND TASSIULAS, L. Lowcomplexity distributed fair scheduling for wireless multi-hop networks. In First Workshop on Resource Allocation in Wireless Networks (2005
25. RAMABHADRAN, S., AND PASQUALE, J. Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay. In Proc. of conference on Applications, technologies, architectures, and protocols for computer communications (2003), pp. 239-250.
26. RAMANATHAN, S., AND LLOYD, E. Scheduling algorithms for multihop radio networks. IEEE/ACM Transactions on Networking 1 (April 1993), 166-172.
27. SANGHAVI, S., BUI, L., AND SRIKANT, R. Distributed link scheduling with constant overhead. In Proceedings of the 2007 ACM SIGMETRICS (2007), pp. 313-324.
28. SHARMA, G., SHROFF, N., AND R., M. R. On the complexity of scheduling in wireless networks. In ACM MobiCom '06 (2006
29. TANG, S.-J., WU, X., MAO, X., WU, Y., XU, P., CHEN, G., AND LI, X.-Y. Low complexity stable link scheduling for maximizing thoughput in wireless networks, 2008. http://www.cs.iit.edu/~xli/paper/Submitted/scheduling-full.pdf.
30. TASSIULAS, L. Linear complexity algorithms for maximum throughtpu in radionetworks and input queued switches. In IEEE INFOCOM (1998), pp. 533-539.
31. TASSIULAS, L., AND EPHREMIDES, A. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37, 12 (1992), 1936-1949.
32. TASSIULAS, L., AND SARKAR, S. Maxmin fair scheduling in wireless networks. In IEEE INFOCOM (2002), vol.2.
33. VAIDYA, N., DUGAR, A., GUPTA, S., AND BAHL, P. Distributed Fair Scheduling in a Wireless LAN. Mobile Computing, IEEE Transactions on 4, 6 (2005), 616-629.
34. WANG, W., WANG, Y., LI, X.-Y., SONG, W.-Z., AND FRIEDER, O. Efficient interference aware TDMA link scheduling for static wireless mesh networks. In ACM MobiCom (2006
35. YI, S., PEI, Y., AND KALYANARAMAN, S. On the capacity improvement of ad hoc wireless networks using directional antennas. In Proceedings of the 4th ACM MobiHoc (2003), pp. 108-116.