메뉴 건너뛰기




Volumn , Issue , 2011, Pages 2543-2551

Belief propagation methods for intercell interference coordination

Author keywords

belief propagation; cellular systems; femtocells; Interference coordination; wireless communications

Indexed keywords

BELIEF PROPAGATION; CELLULAR SYSTEM; FEMTOCELLS; INTERFERENCE COORDINATION; WIRELESS COMMUNICATIONS;

EID: 79960875407     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5935079     Document Type: Conference Paper
Times cited : (8)

References (49)
  • 2
    • 73449109545 scopus 로고    scopus 로고
    • OFDMA femtocells: A roadmap on interference avoidance
    • Sep.
    • D. López-Pérez, A. Valcarce, G. de la Roche, and J. Zhang, "OFDMA femtocells: A roadmap on interference avoidance," IEEE Comm. Mag., vol. 47, no. 9, pp. 41-48, Sep. 2009.
    • (2009) IEEE Comm. Mag. , vol.47 , Issue.9 , pp. 41-48
    • López-Pérez, D.1    Valcarce, A.2    De La Roche, G.3    Zhang, J.4
  • 8
    • 79551646631 scopus 로고    scopus 로고
    • Efficient resource management in OFDMA femto cells
    • K. Sundaresan and S. Rangarajan, "Efficient resource management in OFDMA femto cells," ACM MobiHoc, 2009.
    • (2009) ACM MobiHoc
    • Sundaresan, K.1    Rangarajan, S.2
  • 9
    • 84930890020 scopus 로고
    • Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
    • L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Control, vol. 37, pp. 1936-1948, 1992.
    • (1992) IEEE Trans. Automat. Control , vol.37 , pp. 1936-1948
    • Tassiulas, L.1    Ephremides, A.2
  • 10
    • 14644410381 scopus 로고    scopus 로고
    • On the asymptotic optimality of the gradient scheduling algorithm for multi-user throughput allocation
    • A. Stolyar, "On the asymptotic optimality of the gradient scheduling algorithm for multi-user throughput allocation," Oper. Res., 2005.
    • (2005) Oper. Res.
    • Stolyar, A.1
  • 12
    • 33646385867 scopus 로고    scopus 로고
    • Distributed interference compensation for wireless networks
    • J. Huang, R. Berry, and M. Honig, "Distributed interference compensation for wireless networks," IEEE JSAC, no. 5, pp. 1074-1084, 2006.
    • (2006) IEEE JSAC , Issue.5 , pp. 1074-1084
    • Huang, J.1    Berry, R.2    Honig, M.3
  • 13
    • 57949098374 scopus 로고    scopus 로고
    • Distributed uplink power control for optimal SIR assignment in cellular data networks
    • Dec.
    • P. Hande, S. Rangan, M. Chiang, and X. Wu, "Distributed uplink power control for optimal SIR assignment in cellular data networks," IEEE/ACM Trans. Networking, vol. 16, no. 6, pp. 1420-1433, Dec. 2008.
    • (2008) IEEE/ACM Trans. Networking , vol.16 , Issue.6 , pp. 1420-1433
    • Hande, P.1    Rangan, S.2    Chiang, M.3    Wu, X.4
  • 14
    • 34548309383 scopus 로고    scopus 로고
    • Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
    • G. Sharma, N. Shroff, and R. Mazumdar, "Joint congestion control and distributed scheduling for throughput guarantees in wireless networks," INFOCOM, 2007.
    • (2007) INFOCOM
    • Sharma, G.1    Shroff, N.2    Mazumdar, R.3
  • 15
    • 34548317470 scopus 로고    scopus 로고
    • Low-complexity distributed scheduling algorithms for wireless networks
    • A. Gupta, X. Lin, and R. Srikant, "Low-complexity distributed scheduling algorithms for wireless networks," INFOCOM, 2007.
    • (2007) INFOCOM
    • Gupta, A.1    Lin, X.2    Srikant, R.3
  • 16
    • 79960874273 scopus 로고    scopus 로고
    • Maximizing sum rate and minimizing MSE on multiuser downlink: Optimality, fast algorithms, and equivalence via max-min sir
    • Submitted to
    • C. W. Tan, M. Chiang, and R. Srikant, "Maximizing sum rate and minimizing mse on multiuser downlink: Optimality, fast algorithms, and equivalence via max-min sir," Submitted to IEEE Transactions on Information Theory.
    • IEEE Transactions on Information Theory
    • Tan, C.W.1    Chiang, M.2    Srikant, R.3
  • 17
    • 79960869828 scopus 로고    scopus 로고
    • Jointly optimal beamforming and power control in wireless cellular networks
    • T. Lan, P. Hande, and M. Chiang, "Jointly optimal beamforming and power control in wireless cellular networks," IEEE ISIT, 2007.
    • (2007) IEEE ISIT
    • Lan, T.1    Hande, P.2    Chiang, M.3
  • 18
    • 70449650505 scopus 로고    scopus 로고
    • Network adiabatic theorem: Anefficient randomized protocol for contention resolution
    • S. Rajagopalan, D. Shah, and J. Shin, "Network adiabatic theorem: anefficient randomized protocol for contention resolution," SIGMETRICS, 2009.
    • (2009) SIGMETRICS
    • Rajagopalan, S.1    Shah, D.2    Shin, J.3
  • 19
    • 70349663952 scopus 로고    scopus 로고
    • Self-organizing dynamic fractional frequency reuse for best-effort traffic through distributed inter-cell coordination
    • A. L. Stolyar and H. Viswanathan, "Self-organizing dynamic fractional frequency reuse for best-effort traffic through distributed inter-cell coordination," IEEE INFOCOM, 2009.
    • (2009) IEEE INFOCOM
    • Stolyar, A.L.1    Viswanathan, H.2
  • 20
    • 79551617756 scopus 로고    scopus 로고
    • Distributed interference management and scheduling in LTE-A femtocell networks
    • To Appear
    • R. Madan, A. Sampath, A. Khandekar, J. Borran, and N. Bhushan, "Distributed interference management and scheduling in LTE-A femtocell networks," To Appear in Globecom, 2010.
    • (2010) Globecom
    • Madan, R.1    Sampath, A.2    Khandekar, A.3    Borran, J.4    Bhushan, N.5
  • 21
    • 0024012393 scopus 로고    scopus 로고
    • Cooling schedules for optimal annealing
    • B. Hajek, "Cooling schedules for optimal annealing," Mathematics of Operations Research, vol. 13, no. 2, pp. 311-329.
    • Mathematics of Operations Research , vol.13 , Issue.2 , pp. 311-329
    • Hajek, B.1
  • 22
    • 0036648193 scopus 로고    scopus 로고
    • Iterative multiuser joint decoding: Unified framework and asymptotic analysis
    • Jul.
    • J. Boutros and G. Caire, "Iterative multiuser joint decoding: unified framework and asymptotic analysis," IEEE Trans. Inform. Theory, vol. 48, no. 7, pp. 1772-1793, Jul. 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , Issue.7 , pp. 1772-1793
    • Boutros, J.1    Caire, G.2
  • 23
    • 42149191688 scopus 로고    scopus 로고
    • Asymptotic mean-square optimality of belief propagation for sparse linear systems
    • Chengdu, China, Oct.
    • D. Guo and C.-C. Wang, "Asymptotic mean-square optimality of belief propagation for sparse linear systems," in "Proc. Inform. Th. Workshop", Chengdu, China, Oct. 2006, pp. 194-198.
    • (2006) Proc. Inform. Th. Workshop , pp. 194-198
    • Guo, D.1    Wang, C.-C.2
  • 28
    • 79960878965 scopus 로고    scopus 로고
    • Intercell interference coordination in OFDMA networks and in the 3GPP long term evolution system
    • G. Fodor, C. Koutsimanis, A. Rácz, N. Reider, A. Simonsson, and W. Müller, "Intercell Interference Coordination in OFDMA Networks and in the 3GPP Long Term Evolution System," J. Comm.
    • J. Comm.
    • Fodor, G.1    Koutsimanis, C.2    Rácz, A.3    Reider, N.4    Simonsson, A.5    Müller, W.6
  • 29
    • 84859205804 scopus 로고    scopus 로고
    • Inter-cell interference mitigation through flexible resource reuse in OFDMA based communication networks interference coordination in the LTE uplink
    • Y. Xiang, J.Luo, and C. Hartmann, "Inter-cell Interference Mitigation through Flexible Resource Reuse in OFDMA based Communication Networks Interference Coordination in the LTE Uplink," in Proc. European Wireless Conference.
    • Proc. European Wireless Conference
    • Xiang, Y.1    Luo, J.2    Hartmann, C.3
  • 30
    • 67651053011 scopus 로고    scopus 로고
    • A new frequency partitioning and allocation of subcarriers for fractional frequency reuse in mobile communication systems
    • S. Han, J. Park, T.-J. Lee, H.G.Ahn, and K. Jang, "A new frequency partitioning and allocation of subcarriers for fractional frequency reuse in mobile communication systems," IEICE Trans. Comm., no. 8, pp. 2748-2751.
    • IEICE Trans. Comm. , Issue.8 , pp. 2748-2751
    • Han, S.1    Park, J.2    Lee, T.-J.3    Ahn, H.G.4    Jang, K.5
  • 33
    • 0031701310 scopus 로고    scopus 로고
    • Linear complexity algorithms for maximum throughput in radio networks and input queued switches
    • Mar.
    • L. Tassiulas, "Linear complexity algorithms for maximum throughput in radio networks and input queued switches," in Proc. IEEE INFOCOM, vol. 2, Mar. 1998, pp. 533-539.
    • (1998) Proc IEEE INFOCOM , vol.2 , pp. 533-539
    • Tassiulas, L.1
  • 35
    • 0038623639 scopus 로고    scopus 로고
    • Randomized scheduling algorithms for highaggregate bandwidth switches
    • Apr.
    • P. Giaccone, B. Prabhakar, and D. Shah, "Randomized scheduling algorithms for highaggregate bandwidth switches," IEEE-JSAC, vol. 21, no. 4, pp. 546-559, Apr. 2003.
    • (2003) IEEE-JSAC , vol.21 , Issue.4 , pp. 546-559
    • Giaccone, P.1    Prabhakar, B.2    Shah, D.3
  • 36
    • 64549087215 scopus 로고    scopus 로고
    • A distributed CSMA algorithm for throughput and utility maximization in wireless networks
    • Monticello, IL, Oct.
    • L. Jiang and J. Walrand, "A distributed CSMA algorithm for throughput and utility maximization in wireless networks," in Proc. 46th Ann. Allerton Conf. on Commun., Control and Comp., Monticello, IL, Oct. 2008.
    • (2008) Proc. 46th Ann. Allerton Conf. on Commun., Control and Comp.
    • Jiang, L.1    Walrand, J.2
  • 37
    • 70449650505 scopus 로고    scopus 로고
    • A network adiabatic theorem: Anefficient randomized protocol for contention resolution
    • S. Rajagopalan, D. Shah, and J. Shin, "A network adiabatic theorem: anefficient randomized protocol for contention resolution," in Proc. ACM Sigmetrics/Performance, 2009.
    • (2009) Proc ACM Sigmetrics/Performance
    • Rajagopalan, S.1    Shah, D.2    Shin, J.3
  • 38
    • 70349292665 scopus 로고    scopus 로고
    • Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks
    • San Diego, CA, Jan.
    • J. Ni and R. Srikant, "Distributed CSMA/CA algorithms for achieving maximum throughput in wireless networks," in Proc. Information Theory and Applications Workshop, San Diego, CA, Jan. 2009.
    • (2009) Proc. Information Theory and Applications Workshop
    • Ni, J.1    Srikant, R.2
  • 39
    • 33745959935 scopus 로고    scopus 로고
    • Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits
    • Feb.
    • A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits," Advances in Applied Probability, vol. 38, no. 2, p. 505, Feb. 2006.
    • (2006) Advances in Applied Probability , vol.38 , Issue.2 , pp. 505
    • Dimakis, A.1    Walrand, J.2
  • 40
    • 69249215199 scopus 로고    scopus 로고
    • Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks
    • Apr.
    • C. Joo, X. Lin, and N. Shroff, "Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks," IEEE/ACM Transactions on Networking, vol. 17, no. 4, pp. 1132-1145, Apr. 2009.
    • (2009) IEEE/ACM Transactions on Networking , vol.17 , Issue.4 , pp. 1132-1145
    • Joo, C.1    Lin, X.2    Shroff, N.3
  • 41
    • 70450206174 scopus 로고    scopus 로고
    • Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
    • M. Leconte, J. Ni, and R. Srikant, "Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks," in MobiHoc '09, 2009, pp. 164-174.
    • (2009) MobiHoc '09 , pp. 164-174
    • Leconte, M.1    Ni, J.2    Srikant, R.3
  • 44
    • 79960865936 scopus 로고    scopus 로고
    • Belief propagation and LP relaxation for weighted matching in general graphs
    • December
    • S. Sanghavi, D. Malioutov, and A. Willsky, "Belief propagation and LP relaxation for weighted matching in general graphs," in Proc. NIPS, December 2007.
    • (2007) Proc. NIPS
    • Sanghavi, S.1    Malioutov, D.2    Willsky, A.3
  • 45
    • 40949159794 scopus 로고    scopus 로고
    • Max-product for maximum weight matching: Convergence, correctness and LP duality
    • March
    • M. Bayati, D. Shah, and M. Sharma, "Max-product for maximum weight matching: convergence, correctness and LP duality," IEEE Trans. Inform. Theory, vol. 54, no. 3, pp. 1241-1251, March 2008.
    • (2008) IEEE Trans. Inform. Theory , vol.54 , Issue.3 , pp. 1241-1251
    • Bayati, M.1    Shah, D.2    Sharma, M.3
  • 46
    • 79551643328 scopus 로고    scopus 로고
    • A graphical model approach to downlink cooperative MIMO systems
    • I. Sohn, S. H. Lee, and J. G. Andrews, "A graphical model approach to downlink cooperative MIMO systems," IEEE Globecom, 2010.
    • (2010) IEEE Globecom
    • Sohn, I.1    Lee, S.H.2    Andrews, J.G.3
  • 47
    • 0032027247 scopus 로고    scopus 로고
    • Rate control for communication networks: Shadow prices, proportional fairness and stability
    • Mar.
    • F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, "Rate control for communication networks: shadow prices, proportional fairness and stability," Journal of the Operational Research Society, vol. 49, no. 3, pp. 237-252, Mar. 1998.
    • (1998) Journal of the Operational Research Society , vol.49 , Issue.3 , pp. 237-252
    • Kelly, F.P.1    Maulloo, A.K.2    Tan, D.K.H.3


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