메뉴 건너뛰기




Volumn 14, Issue 1, 2006, Pages 41-54

Network correlated data gathering with explicit communication: NP-completeness and algorithms

Author keywords

Conditional coding; Correlated data gathering; Distributed algorithms; NP completeness; Routing tree; Sensor networks; Traveling salesman

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DATA PROCESSING; INFORMATION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

EID: 33144459063     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.863711     Document Type: Article
Times cited : (149)

References (29)
  • 5
    • 0020717353 scopus 로고
    • "Routing to multiple destinations in computer networks"
    • Mar
    • K. Bharat-Kumar and J. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. COM-31, no. 3, pp. 343-351, Mar. 1983.
    • (1983) IEEE Trans. Commun. , vol.COM-31 , Issue.3 , pp. 343-351
    • Bharat-Kumar, K.1    Jaffe, J.2
  • 7
    • 29144528107 scopus 로고    scopus 로고
    • "Networked Slepian-Wolf: Theory, algorithms and scaling laws"
    • Dec
    • R. Cristescu, B. Beferull-Lozano, and M. Vetterli, "Networked Slepian-Wolf: Theory, algorithms and scaling laws," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4057-4073, Dec. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.12 , pp. 4057-4073
    • Cristescu, R.1    Beferull-Lozano, B.2    Vetterli, M.3
  • 11
    • 0037739959 scopus 로고    scopus 로고
    • "Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk"
    • A. Goel and D. Estrin, "Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk," in ACM-SIAM Symp. Discrete Algorithms, 2003, pp. 499-507.
    • (2003) ACM-SIAM Symp. Discrete Algorithms , pp. 499-507
    • Goel, A.1    Estrin, D.2
  • 12
    • 0012863459 scopus 로고
    • "Algorithms for the single-source uncapacitated minimum concave-cost network flow problem"
    • G. M. Guisewite and P. M. Pardalos, "Algorithms for the single-source uncapacitated minimum concave-cost network flow problem," J. Global Optimization, vol. 1, no. 3, pp. 245-265, 1991.
    • (1991) J. Global Optimization , vol.1 , Issue.3 , pp. 245-265
    • Guisewite, G.M.1    Pardalos, P.M.2
  • 13
    • 0024012393 scopus 로고
    • "Cooling schedules for optimal annealing"
    • B. Hajek, "Cooling schedules for optimal annealing," Math. Oper. Res., no. 13, pp. 311-329, 1988.
    • (1988) Math. Oper. Res. , Issue.13 , pp. 311-329
    • Hajek, B.1
  • 17
    • 7544242478 scopus 로고    scopus 로고
    • "Modeling Data Centric Routing in Wireless Sensor Networks"
    • Dept. Comput. Eng., Univ. Southern California, Los Angeles, CA, Tech. Rep.:02-14
    • B. Krishnamachari, D. Estrin, and S. Wicker, "Modeling Data Centric Routing in Wireless Sensor Networks," Dept. Comput. Eng., Univ. Southern California, Los Angeles, CA, Tech. Rep.:02-14, 2002.
    • (2002)
    • Krishnamachari, B.1    Estrin, D.2    Wicker, S.3
  • 20
    • 0022463446 scopus 로고
    • "Convergence of an annealing algorithm"
    • M. Lundy and A. Mees, "Convergence of an annealing algorithm," Math. Programming, no. 34, pp. 111-124, 1986.
    • (1986) Math. Programming , Issue.34 , pp. 111-124
    • Lundy, M.1    Mees, A.2
  • 23
    • 0345851235 scopus 로고    scopus 로고
    • "Wireless integrated sensor networks"
    • G. J. Pottie and W. J. Kaiser, "Wireless integrated sensor networks," Commun. ACM, vol. 5, no. 43, pp. 51-58, 2000.
    • (2000) Commun. ACM , vol.5 , Issue.43 , pp. 51-58
    • Pottie, G.J.1    Kaiser, W.J.2
  • 24
    • 0032651629 scopus 로고    scopus 로고
    • "Distributed Source Coding Using Syndromes (DISCUS): Design and construction"
    • Mar
    • S. Pradhan and K. Ramchandran, "Distributed Source Coding Using Syndromes (DISCUS): Design and construction," in Proc. IEEE Data Compression Conf., Mar. 1999, pp. 158-167.
    • (1999) Proc. IEEE Data Compression Conf. , pp. 158-167
    • Pradhan, S.1    Ramchandran, K.2
  • 25
    • 0034229951 scopus 로고    scopus 로고
    • "Pico-Radio supports ad hoc ultra-low power wireless networking"
    • Jul
    • J. Rabaey, M. J. Ammer, J. L. da Silva, D. Patel, and S. Roundy, "Pico-Radio supports ad hoc ultra-low power wireless networking," IEEE Computer, vol. 33, no. 7, pp. 42-48, Jul. 2000.
    • (2000) IEEE Computer , vol.33 , Issue.7 , pp. 42-48
    • Rabaey, J.1    Ammer, M.J.2    da Silva, J.L.3    Patel, D.4    Roundy, S.5
  • 26
    • 0036494672 scopus 로고    scopus 로고
    • "Combinatorial landscapes"
    • C. Reidys and P. Stadler, "Combinatorial landscapes," SIAM Rev., vol. 44, pp. 3-54, 2002.
    • (2002) SIAM Rev. , vol.44 , pp. 3-54
    • Reidys, C.1    Stadler, P.2
  • 27
    • 0036949173 scopus 로고    scopus 로고
    • "On the interdependence of routing and data compression in multi-hop sensor networks"
    • Atlanta, GA
    • A. Scaglione and S. D. Servetto, "On the interdependence of routing and data compression in multi-hop sensor networks," in Proc. MobiCom, Atlanta, GA, 2002.
    • (2002) Proc. MobiCom
    • Scaglione, A.1    Servetto, S.D.2
  • 28
    • 0015648934 scopus 로고
    • "Noiseless coding of correlated information sources"
    • Jul
    • D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 471-480, Jul. 1973.
    • (1973) IEEE Trans. Inf. Theory , vol.IT-19 , Issue.4 , pp. 471-480
    • Slepian, D.1    Wolf, J.K.2
  • 29
    • 51249170715 scopus 로고
    • "A strongly polynomial minimum cost circulation algorithm"
    • E. Tardos, "A strongly polynomial minimum cost circulation algorithm," Combinatorica, vol. 5, pp. 247-255, 1985.
    • (1985) Combinatorica , vol.5 , pp. 247-255
    • Tardos, E.1


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