메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 90-93

Resource allocation in multi-hop wireless networks

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); NETWORK PROTOCOLS; RESOURCE ALLOCATION; ROUTERS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33845575264     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IZS.2006.1649087     Document Type: Conference Paper
Times cited : (8)

References (32)
  • 1
    • 0041472365 scopus 로고    scopus 로고
    • A utility-based congestion control scheme for internet-style networks with delay
    • San Francisco, California, March-April
    • T. Alpcan and T. Basar. A utility-based congestion control scheme for internet-style networks with delay. In Proceedings of IEEE Infocom, San Francisco, California, March-April 2003.
    • (2003) Proceedings of IEEE Infocom
    • Alpcan, T.1    Basar, T.2
  • 3
    • 39049162840 scopus 로고    scopus 로고
    • Joint asynchronous congestion control and distributed scheduling for wireless networks
    • To appear in the
    • L. Bui, A. Eryilmaz, R. Srikant, and X. Wu. Joint asynchronous congestion control and distributed scheduling for wireless networks. To appear in the Proceedings of IEEE INFOCOM, 2006.
    • (2006) Proceedings of IEEE INFOCOM
    • Bui, L.1    Eryilmaz, A.2    Srikant, R.3    Wu, X.4
  • 6
    • 1442335263 scopus 로고    scopus 로고
    • To layer or not to layer: Balancing transport and physical layers in wireless multihop networks
    • Hong Kong, March
    • M. Chiang. To layer or not to layer: Balancing transport and physical layers in wireless multihop networks. In Proceedings of IEEE Infocom, Hong Kong, March 2004.
    • (2004) Proceedings of IEEE Infocom
    • Chiang, M.1
  • 7
    • 25844526594 scopus 로고    scopus 로고
    • Fair resource allocation in wireless networks using queue-length based scheduling and congestion control
    • Miami, FL, March
    • A. Eryilmaz and R. Srikant. Fair resource allocation in wireless networks using queue-length based scheduling and congestion control. In Proceedings of IEEE Infocom, Miami, FL, March 2005.
    • (2005) Proceedings of IEEE Infocom
    • Eryilmaz, A.1    Srikant, R.2
  • 10
  • 13
    • 0032027247 scopus 로고    scopus 로고
    • Rate control in communication networks: Shadow prices, proportional fairness and stability
    • F. P. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237-252, 1998.
    • (1998) Journal of the Operational Research Society , vol.49 , pp. 237-252
    • Kelly, F.P.1    Maulloo, A.2    Tan, D.3
  • 14
    • 0036600826 scopus 로고    scopus 로고
    • A time-scale decomposition approach to adaptive ECN marking
    • June
    • S. Kunniyur and R. Srikant. A time-scale decomposition approach to adaptive ECN marking. IEEE Transactions on Automatic Control, 47(6): 882-894, June 2002.
    • (2002) IEEE Transactions on Automatic Control , vol.47 , Issue.6 , pp. 882-894
    • Kunniyur, S.1    Srikant, R.2
  • 15
    • 14344253075 scopus 로고    scopus 로고
    • Joint rate control and scheduling in multihop wireless networks
    • Paradise Island, Bahamas, December
    • X. Lin and N. Shroff. Joint rate control and scheduling in multihop wireless networks. In Proceedings of IEEE Conference on Decision and Control, Paradise Island, Bahamas, December 2004.
    • (2004) Proceedings of IEEE Conference on Decision and Control
    • Lin, X.1    Shroff, N.2
  • 16
    • 25844499235 scopus 로고    scopus 로고
    • The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks
    • Miami, FL, March
    • X. Lin and N. Shroff. The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks. In Proceedings of IEEE Infocom, Miami, FL, March 2005.
    • (2005) Proceedings of IEEE Infocom
    • Lin, X.1    Shroff, N.2
  • 17
  • 18
    • 0033355765 scopus 로고    scopus 로고
    • Optimization flow control, I: Basic algorithm and convergence
    • December
    • S. H. Low and D. E. Lapsley. Optimization flow control, I: Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7:861-875, December 1999.
    • (1999) IEEE/ACM Transactions on Networking , vol.7 , pp. 861-875
    • Low, S.H.1    Lapsley, D.E.2
  • 19
    • 0034297878 scopus 로고    scopus 로고
    • Fair end-to-end window-based congestion control
    • October
    • J. Mo and J. Walrand. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8(5): 556-567, October 2000.
    • (2000) IEEE/ACM Transactions on Networking , vol.8 , Issue.5 , pp. 556-567
    • Mo, J.1    Walrand, J.2
  • 20
    • 25844437987 scopus 로고    scopus 로고
    • Fairness and optimal stochastic control for heterogeneous networks
    • Miami, FL, March
    • M.J. Neely, E. Modiano, and C. Li. Fairness and optimal stochastic control for heterogeneous networks. In Proceedings of IEEE Infocom, pages 1723-1734, Miami, FL, March 2005.
    • (2005) Proceedings of IEEE Infocom , pp. 1723-1734
    • Neely, M.J.1    Modiano, E.2    Li, C.3
  • 21
    • 0041973772 scopus 로고    scopus 로고
    • Dynamic power allocation and routing for time varying wireless networks
    • April
    • M.J. Neely, E. Modiano, and C.E. Rohrs. Dynamic power allocation and routing for time varying wireless networks. In Proceedings of IEEE Infocom, pages 745-755, April 2003.
    • (2003) Proceedings of IEEE Infocom , pp. 745-755
    • Neely, M.J.1    Modiano, E.2    Rohrs, C.E.3
  • 22
    • 0242277885 scopus 로고    scopus 로고
    • Scheduling for multiple flows sharing a time-varying channel: The exponential rule
    • A volume in memory of F. Karpelevich
    • S. Shakkottai and A. Stolyar. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Translations of the AMS, Series 2, A volume in memory of F. Karpelevich, 207:185-202, 2002.
    • (2002) Translations of the AMS, Series 2 , vol.207 , pp. 185-202
    • Shakkottai, S.1    Stolyar, A.2
  • 24
    • 24944508677 scopus 로고    scopus 로고
    • Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm
    • To appear
    • A. Stolyar. Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. To appear in Queueing Systems, vol. 40, 2005.
    • (2005) Queueing Systems , vol.40
    • Stolyar, A.1
  • 25
    • 0031146993 scopus 로고    scopus 로고
    • Scheduling and performance limits of networks with constantly varying topology
    • May
    • L. Tassiulas. Scheduling and performance limits of networks with constantly varying topology. IEEE Transactions on Information Theory, 43:1067-1073, May 1997.
    • (1997) IEEE Transactions on Information Theory , vol.43 , pp. 1067-1073
    • Tassiulas, L.1
  • 26
    • 0031701310 scopus 로고    scopus 로고
    • Linear complexity algorithms for maximum throughput in radio networks and input queued switches
    • L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of IEEE Infocom, pages 533-539, 1998.
    • (1998) Proceedings of IEEE Infocom , pp. 533-539
    • Tassiulas, L.1
  • 27
    • 84930890020 scopus 로고
    • Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
    • December
    • L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 36:1936-1948, December 1992.
    • (1992) IEEE Transactions on Automatic Control , vol.36 , pp. 1936-1948
    • Tassiulas, L.1    Ephremides, A.2
  • 28
    • 0027556080 scopus 로고
    • Dynamic server allocation to parallel queues with randomly varying connectivity
    • March
    • L. Tassiulas and A. Ephremides. Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Transactions on Information Theory, 39:466-478, March 1993.
    • (1993) IEEE Transactions on Information Theory , vol.39 , pp. 466-478
    • Tassiulas, L.1    Ephremides, A.2
  • 30
    • 1442337806 scopus 로고    scopus 로고
    • A unifying passivity framework for network flow control
    • J.T. Wen and M. Arcak. A unifying passivity framework for network flow control. IEEE Transactions on Automatic Control, 49:162-174, 2004.
    • (2004) IEEE Transactions on Automatic Control , vol.49 , pp. 162-174
    • Wen, J.T.1    Arcak, M.2
  • 31
    • 33746660219 scopus 로고    scopus 로고
    • Bounds on the capacity region of multihop wireless networks under distributed greedy scheduling
    • To appear in the
    • X. Wu and R. Srikant. Bounds on the capacity region of multihop wireless networks under distributed greedy scheduling. To appear in the Proceedings of IEEE INFOCOM, 2006.
    • (2006) Proceedings of IEEE INFOCOM
    • Wu, X.1    Srikant, R.2
  • 32
    • 33847194188 scopus 로고    scopus 로고
    • Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing
    • X. Wu and R. Srikant. Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing. Proceedings of IEEE Conference on Decision and Control, 2005.
    • (2005) Proceedings of IEEE Conference on Decision and Control
    • Wu, X.1    Srikant, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.