메뉴 건너뛰기




Volumn 16, Issue 4, 2008, Pages 826-839

Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling

Author keywords

Congestion control; Distributed scheduling; Fair resource allocation; Totally asynchronous algorithm; Wireless networks

Indexed keywords

ALGORITHMS; CONCURRENCY CONTROL; PLANNING; RESOURCE ALLOCATION; SCHEDULING; WIRELESS NETWORKS;

EID: 50149088856     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.904007     Document Type: Article
Times cited : (21)

References (32)
  • 1
    • 84930890020 scopus 로고
    • Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
    • Dec
    • L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
    • (1992) IEEE Trans. Autom. Control , vol.37 , Issue.12 , pp. 1936-1948
    • Tassiulas, L.1    Ephremides, A.2
  • 2
    • 0031146993 scopus 로고    scopus 로고
    • Scheduling and performance limits of networks with constantly changing topology
    • May
    • L. Tassiulas, "Scheduling and performance limits of networks with constantly changing topology," IEEE Trans. Inf. Theory, vol. 43, no. 3, pp. 1067-1073, May 1997.
    • (1997) IEEE Trans. Inf. Theory , vol.43 , Issue.3 , pp. 1067-1073
    • Tassiulas, L.1
  • 3
    • 0242277885 scopus 로고    scopus 로고
    • Scheduling for multiple flows sharing a time-varying channel: The exponential rule
    • Translations AMS, 207, pp, a in memory of F. Karpelevich
    • S. Shakkottai and A. Stolyar, "Scheduling for multiple flows sharing a time-varying channel: The exponential rule," Translations AMS, ser. 2, vol. 207, pp. 185-201, 2002, a volume in memory of F. Karpelevich.
    • (2002) ser , vol.2 , pp. 185-201
    • Shakkottai, S.1    Stolyar, A.2
  • 4
    • 13344286024 scopus 로고    scopus 로고
    • Pathwise optimality of the exponential scheduling rule for wireless channels
    • S. Shakkottai, R. Srikant, and A. Stolyar, "Pathwise optimality of the exponential scheduling rule for wireless channels," Adv. Appl. Prob. vol. 36, no. 4, pp 1021-1045, 2004.
    • (2004) Adv. Appl. Prob , vol.36 , Issue.4 , pp. 1021-1045
    • Shakkottai, S.1    Srikant, R.2    Stolyar, A.3
  • 6
    • 0041973772 scopus 로고    scopus 로고
    • Dynamic power allocation and routing for time varying wireless networks
    • Apr
    • M. Neely, E. Modiano, and C. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," in Proc. IEEE INFOCOM Apr. 2003, pp. 745-755.
    • (2003) Proc. IEEE INFOCOM , pp. 745-755
    • Neely, M.1    Modiano, E.2    Rohrs, C.3
  • 7
    • 18844461997 scopus 로고    scopus 로고
    • Stable scheduling policies for fading wireless channels
    • Apr
    • A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Netw., vol. 13, no. 2, pp. 411-424, Apr. 2005.
    • (2005) IEEE/ACM Trans. Netw , vol.13 , Issue.2 , pp. 411-424
    • Eryilmaz, A.1    Srikant, R.2    Perkins, J.R.3
  • 8
    • 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," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
    • (1998) J. Oper. Res. Soc , vol.49 , pp. 237-252
    • Kelly, F.P.1    Maulloo, A.2    Tan, D.3
  • 9
    • 0033355765 scopus 로고    scopus 로고
    • Optimization flow control, I: Basic algorithm and convergence
    • Dec
    • S. H. Low and D. E. Lapsley, "Optimization flow control, I: Basic algorithm and convergence," IEEE/ACM Trans. Netw., vol. 7, no. 6, pp. 861-875, Dec. 1999.
    • (1999) IEEE/ACM Trans. Netw , vol.7 , Issue.6 , pp. 861-875
    • Low, S.H.1    Lapsley, D.E.2
  • 11
    • 24944508677 scopus 로고    scopus 로고
    • Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm
    • Aug
    • A. Stolyar, "Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm," Queueing Syst., vol. 50, no. 4, pp. 401-457, Aug. 2005.
    • (2005) Queueing Syst , vol.50 , Issue.4 , pp. 401-457
    • Stolyar, A.1
  • 12
    • 25844526594 scopus 로고    scopus 로고
    • Fair resource allocation in wireless networks using queue-length based scheduling and congestion control
    • Mar
    • A. Eryilmaz and R. Srikant, "Fair resource allocation in wireless networks using queue-length based scheduling and congestion control," in Proc. IEEE INFOCOM, Mar. 2005, pp. 1794-1803.
    • (2005) Proc. IEEE INFOCOM , pp. 1794-1803
    • Eryilmaz, A.1    Srikant, R.2
  • 13
    • 25844437987 scopus 로고    scopus 로고
    • Fairness and optimal stochastic control for heterogeneous networks
    • Mar
    • M. Neely, E. Modiano, and C. Li, "Fairness and optimal stochastic control for heterogeneous networks," in Proc. IEEE INFOCOM, Mar. 2005, pp. 1723-1734.
    • (2005) Proc. IEEE INFOCOM , pp. 1723-1734
    • Neely, M.1    Modiano, E.2    Li, C.3
  • 14
    • 14344253075 scopus 로고    scopus 로고
    • Joint rate control and scheduling in multihop wireless networks
    • Dec
    • X. Lin and N. Shroff, "Joint rate control and scheduling in multihop wireless networks," in Proc. IEEE Conf. Decision and Control, Dec. 2004, pp. 1484-1489.
    • (2004) Proc. IEEE Conf. Decision and Control , pp. 1484-1489
    • Lin, X.1    Shroff, N.2
  • 15
    • 1542329180 scopus 로고    scopus 로고
    • End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks
    • Dec
    • S. Sarkar and L. Tassiulas, "End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks," in Proc. IEEE Conf. Decision and Control, Dec. 2003, pp. 564-569.
    • (2003) Proc. IEEE Conf. Decision and Control , pp. 564-569
    • Sarkar, S.1    Tassiulas, L.2
  • 16
    • 8344288153 scopus 로고    scopus 로고
    • Hop-by-hop congestion control over a wireless multi-hop network
    • Mar
    • Y. Yi and S. Shakkottai, "Hop-by-hop congestion control over a wireless multi-hop network," in Proc. IEEE INFOCOM, Mar. 2004, pp. 2548-2558.
    • (2004) Proc. IEEE INFOCOM , pp. 2548-2558
    • Yi, Y.1    Shakkottai, S.2
  • 17
    • 25844473276 scopus 로고    scopus 로고
    • Joint congestion control and media access control design for ad hoc wireless networks
    • Mar
    • L. Chen, S. H. Low, and J. C. Doyle, "Joint congestion control and media access control design for ad hoc wireless networks," in Proc. IEEE INFOCOM, Mar. 2005, pp. 2212-2222.
    • (2005) Proc. IEEE INFOCOM , pp. 2212-2222
    • Chen, L.1    Low, S.H.2    Doyle, J.C.3
  • 19
    • 50149106423 scopus 로고    scopus 로고
    • D. J. Baker, J. Wieselthier, and A. Ephremides, A distributed algorithm for scheduling the activation of links in a self-organizing mobile radio network, in Proc. IEEE Int. Conf. Communications, Jun. 1982, pp. 2F.6.1-2F.6.5.
    • D. J. Baker, J. Wieselthier, and A. Ephremides, "A distributed algorithm for scheduling the activation of links in a self-organizing mobile radio network," in Proc. IEEE Int. Conf. Communications, Jun. 1982, pp. 2F.6.1-2F.6.5.
  • 20
    • 0024079190 scopus 로고
    • Link scheduling in polynomial time
    • Sep
    • B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 910-917, Sep. 1988.
    • (1988) IEEE Trans. Inf. Theory , vol.34 , Issue.5 , pp. 910-917
    • Hajek, B.1    Sasaki, G.2
  • 21
    • 25844499235 scopus 로고    scopus 로고
    • The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks
    • Mar
    • X. Lin and N. Shroff, "The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks," in Proc. IEEE INFOCOM, Mar. 2005, pp. 1804-1814.
    • (2005) Proc. IEEE INFOCOM , pp. 1804-1814
    • Lin, X.1    Shroff, N.2
  • 22
    • 0028336534 scopus 로고
    • A regulator stabilization technique: Kumar-Seidman revisited
    • Jan
    • C. Humes, "A regulator stabilization technique: Kumar-Seidman revisited," IEEE Trans. Autom. Control, vol. 39, no. 1, pp. 191-196, Jan. 1994.
    • (1994) IEEE Trans. Autom. Control , vol.39 , Issue.1 , pp. 191-196
    • Humes, C.1
  • 23
    • 33847194188 scopus 로고    scopus 로고
    • Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing
    • Dec
    • X. Wu and R. Srikant, "Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing," in Proc. IEEE Conf. Decision and Control, Dec. 2005, pp. 5342-5347.
    • (2005) Proc. IEEE Conf. Decision and Control , pp. 5342-5347
    • Wu, X.1    Srikant, R.2
  • 25
    • 0030413092 scopus 로고    scopus 로고
    • Routing multimedia packets in a frequency-hop packet radio network
    • M. B. Pursley, H. B. Russell, and P. E. Staples, "Routing multimedia packets in a frequency-hop packet radio network," in Proc. MILCOM 1996, pp. 220-224.
    • (1996) Proc. MILCOM , pp. 220-224
    • Pursley, M.B.1    Russell, H.B.2    Staples, P.E.3
  • 26
    • 0034297878 scopus 로고    scopus 로고
    • Fair end-to-end window-based congestion control
    • Oct
    • J. Mo and J. Walrand, "Fair end-to-end window-based congestion control," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 556-567, Oct. 2000.
    • (2000) IEEE/ACM Trans. Netw , vol.8 , Issue.5 , pp. 556-567
    • Mo, J.1    Walrand, J.2
  • 27
    • 1542358925 scopus 로고    scopus 로고
    • Characterizing achievable rates in multi-hop wireless networks: The joint routing and scheduling problem
    • Sep
    • M. Kodialam and T. Nandagopal, "Characterizing achievable rates in multi-hop wireless networks: The joint routing and scheduling problem," in Proc. ACM MOBICOM, Sep. 2003, pp. 42-54.
    • (2003) Proc. ACM MOBICOM , pp. 42-54
    • Kodialam, M.1    Nandagopal, T.2
  • 28
    • 85171835916 scopus 로고
    • A theorem on coloring the lines of a network
    • C. E. Shannon, "A theorem on coloring the lines of a network," J. Math. Phys., vol. 28, pp. 148-151, 1949.
    • (1949) J. Math. Phys , vol.28 , pp. 148-151
    • Shannon, C.E.1
  • 29
    • 33744458955 scopus 로고    scopus 로고
    • Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays
    • Apr
    • L. Ying, R. Srikant, A. Eryilmaz, and G. E. Dullerud, "Distributed fair resource allocation in cellular networks in the presence of heterogeneous delays," in Proc. WiOPT, Apr. 2005, pp. 96-105.
    • (2005) Proc. WiOPT , pp. 96-105
    • Ying, L.1    Srikant, R.2    Eryilmaz, A.3    Dullerud, G.E.4
  • 31
    • 0004178386 scopus 로고    scopus 로고
    • 3rd ed. Englewood Cliffs, NJ: Prentice-Hall
    • H. Khalil, Nonlinear Systems, 3rd ed. Englewood Cliffs, NJ: Prentice-Hall, 2002.
    • (2002) Nonlinear Systems
    • Khalil, H.1
  • 32
    • 0003781238 scopus 로고    scopus 로고
    • Cambridge, U.K, Cambridge Univ. Press
    • J. R. Norris, Markov Chains. Cambridge, U.K.: Cambridge Univ. Press, 1998.
    • (1998) Markov Chains
    • Norris, J.R.1


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