메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Deploying mesh nodes under non-uniform propagation

Author keywords

[No Author keywords available]

Indexed keywords

BROADBAND CONNECTIVITY; CONNECTIVITY GRAPH; CONSTANT FACTOR APPROXIMATION; COST-EFFECTIVE MEANS; DEPLOYMENT PLANNING; MESH NETWORK; MESH NODES; NONUNIFORM; NP-HARD; PROPAGATION ENVIRONMENT; PROPAGATION MEASUREMENTS; SIGNAL QUALITY; STEINER TREE PROBLEM; STEINER TREES; TARGET COVERAGE; TERMINAL STEINER TREE PROBLEMS; WIRELESS PROPAGATION;

EID: 77953312548     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462038     Document Type: Conference Paper
Times cited : (27)

References (21)
  • 2
    • 37249029923 scopus 로고    scopus 로고
    • Optimization models for the radio planning of wireless mesh networks
    • May
    • E. Amaldi, A. Capone, M. Cesana, and F. Malucelli. Optimization models for the radio planning of wireless mesh networks. In IFIP Networking, May 2007.
    • (2007) IFIP Networking
    • Amaldi, E.1    Capone, A.2    Cesana, M.3    Malucelli, F.4
  • 3
    • 0344898287 scopus 로고    scopus 로고
    • On approximation algorithms for the terminal Steiner tree problem
    • D. Drake and S. Hougardy. On approximation algorithms for the terminal Steiner tree problem. Information Processing Letters, 89(1), 2004.
    • (2004) Information Processing Letters , vol.89 , Issue.1
    • Drake, D.1    Hougardy, S.2
  • 6
    • 0036501033 scopus 로고    scopus 로고
    • Propagation prediction models for wireless communication systems
    • DOI 10.1109/22.989951, PII S0018948002019877
    • M. Iskander and Z. Yun. Propagation prediction models for wireless communication systems. IEEE Transactions on Microwave Theory and Techniques, 50(3):662-673, Mar 2002. (Pubitemid 34255188)
    • (2002) IEEE Transactions on Microwave Theory and Techniques , vol.50 , Issue.3 , pp. 662-673
    • Iskander, M.F.1    Yun, Z.2
  • 7
    • 43049103493 scopus 로고    scopus 로고
    • Mono- and multiobjective formulations for the indoor wireless LAN planning problem
    • K. Jaffrès-Runser, J.-M. Gorce, and S. Ubéda. Mono- and multiobjective formulations for the indoor wireless LAN planning problem. Computers and Operations Research, 35(12):3885-3901, 2008.
    • (2008) Computers and Operations Research , vol.35 , Issue.12 , pp. 3885-3901
    • Jaffrès-Runser, K.1    Gorce, J.-M.2    Ubéda, S.3
  • 11
    • 85008060351 scopus 로고    scopus 로고
    • Relay node placement in wireless sensor networks
    • E. L. Lloyd and G. Xue. Relay node placement in wireless sensor networks. IEEE Transactions on Computing, 56(1), 2007.
    • (2007) IEEE Transactions on Computing , vol.56 , Issue.1
    • Lloyd, E.L.1    Xue, G.2
  • 13
    • 0037708035 scopus 로고    scopus 로고
    • Approximation algorithms for degree-constrained minimum-cost network-design problems
    • S. S. Ravi, M. V. Marathe, D. J. Rosenkrantz, S. S. Ravi, and H. B. Hunt. Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica, 31(1):58-78, 2001.
    • (2001) Algorithmica , vol.31 , Issue.1 , pp. 58-78
    • Ravi, S.S.1    Marathe, M.V.2    Rosenkrantz, D.J.3    Ravi, S.S.4    Hunt, H.B.5
  • 20
    • 39149099807 scopus 로고    scopus 로고
    • Strategies and techniques for node placement in wireless sensor networks: A survey
    • DOI 10.1016/j.adhoc.2007.05.003, PII S1570870507000984
    • M. Younis and K. Akkaya. Strategies and techniques for node placement in wireless sensor networks: A survey. Ad Hoc Networks, 6(4):621-655, 2008. (Pubitemid 351258396)
    • (2008) Ad Hoc Networks , vol.6 , Issue.4 , pp. 621-655
    • Younis, M.1    Akkaya, K.2


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