메뉴 건너뛰기




Volumn 7, Issue 1, 2010, Pages

Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks

Author keywords

Energy management; In network aggregation; Lifetime maxi mization; Sparsity communication topology; Wireless sensor networks

Indexed keywords

ASYMPTOTICALLY OPTIMAL; AVAILABLE ENERGY; COMMUNICATION LINKS; COMPUTER COMMUNICATION NETWORKS; DATA GATHERING; DESCRIPTORS; EFFECTIVE ALGORITHMS; FRACTIONAL SOLUTIONS; IN-NETWORK AGGREGATION; INCIDENT COMMUNICATION; INTEGRAL SOLUTIONS; LIFETIME MAXI-MIZATION; MINIMUM ENERGY; NETWORK COMMUNICATIONS; NETWORK TOPOLOGY; SPARSE SOLUTIONS; SPARSITY COMMUNICATION TOPOLOGY; WIRELESS COMMUNICATIONS; WIRELESS SENSOR;

EID: 77956103177     PISSN: 15504859     EISSN: 15504867     Source Type: Journal    
DOI: 10.1145/1806895.1806904     Document Type: Article
Times cited : (10)

References (31)
  • 2
    • 0038954995 scopus 로고    scopus 로고
    • Using fast matrix multiplication to find basic solutions
    • BELING, P. A. AND MEGIDDO, N. 1998. Using fast matrix multiplication to find basic solutions. Theoret. Comput. Sci. 205, 307-316.
    • (1998) Theoret. Comput. Sci. , vol.205 , pp. 307-316
    • Beling, P.A.1    Megiddo, N.2
  • 5
    • 4644360171 scopus 로고    scopus 로고
    • Maximum lifetime routing in wireless sensor networks
    • CHANG, J.-H. AND TASSIULAS, L. 2004. Maximum lifetime routing in wireless sensor networks. IEEE/ACM Trans. Netw. 12, 4, 609-619.
    • (2004) IEEE/ACM Trans. Netw , vol.12 , Issue.4 , pp. 609-619
    • Chang, J.-H.1    Tassiulas, L.2
  • 6
    • 0041452100 scopus 로고
    • Applications of submodular functions
    • London Mathematical Society Lecture Note Series 187, K. Walker, Ed. Cambridge University Press, Cambridge, U. K.
    • FRANK, A. 1993. Applications of submodular functions. In Surveys in Combinatorics. London Mathematical Society Lecture Note Series 187, K. Walker, Ed. Cambridge University Press, Cambridge, U. K., 85-136.
    • (1993) Surveys in Combinatorics , pp. 85-136
    • Frank, A.1
  • 8
    • 35448980294 scopus 로고    scopus 로고
    • Minimum bounded degree spanning trees
    • GOEMANS, M. X. 2006. Minimum bounded degree spanning trees. In Proceedings of the FOCS. 273-282.
    • (2006) Proceedings of the FOCS , pp. 273-282
    • Goemans, M.X.1
  • 9
    • 51249185617 scopus 로고
    • The ellipsoid method and its consequences in combinatorial optimization
    • GRöTSCHEL, M., LOVáSZ, L., AND SCHRIJVER, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197.
    • (1981) Combinatorica , vol.1 , pp. 169-197
    • Grötschel, M.1    Lovász, L.2    Schrijver, A.3
  • 12
    • 33746922762 scopus 로고    scopus 로고
    • Maximizing the lifetime of wireless sensor networks through optimal single-session flow routing
    • HOU, Y. T., SHI, Y., PAN, J., AND MIDKIFF, S. F. 2006. Maximizing the lifetime of wireless sensor networks through optimal single-session flow routing. IEEE Trans. Mobile Comput. 5, 9, 1255-1266.
    • (2006) IEEE Trans. Mobile Comput , vol.5 , Issue.9 , pp. 1255-1266
    • Hou, Y.T.1    Shi, Y.2    Pan, J.3    Midkiff, S.F.4
  • 14
    • 0005363324 scopus 로고    scopus 로고
    • A factor 2 approximation algorithm for the generalized steiner network problem
    • JAIN, K. 2001. A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica 21, 1, 39-60.
    • (2001) Combinatorica , vol.21 , Issue.1 , pp. 39-60
    • Jain, K.1
  • 16
    • 0038148549 scopus 로고    scopus 로고
    • Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
    • KALPAKIS, K., DASGUPTA, K., AND NAMJOSHI, P. 2003. Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Comput. Netw. 42, 6, 697-716.
    • (2003) Comput. Netw , vol.42 , Issue.6 , pp. 697-716
    • Kalpakis, K.1    Dasgupta, K.2    Namjoshi, P.3
  • 21
    • 27644588344 scopus 로고    scopus 로고
    • Combs, needles, haystacks: Balancing push and pull for discovery in largescale sensor networks
    • LIU, X., HUANG, Q., AND ZHANG, Y. 2004. Combs, needles, haystacks: Balancing push and pull for discovery in largescale sensor networks. In Proceedings of the ACM Sensys. 122-133.
    • (2004) Proceedings of the ACM Sensys , pp. 122-133
    • Liu, X.1    Huang, Q.2    Zhang, Y.3
  • 22
    • 25844459686 scopus 로고    scopus 로고
    • Joint mobility and routing for lifetime elongation in wireless sensor networks
    • LUO, J. and Hubaux, J.-P. 2005. Joint mobility and routing for lifetime elongation in wireless sensor networks. In Proceedings of INFOCOM. 1735-1746.
    • (2005) Proceedings of INFOCOM , pp. 1735-1746
    • Luo, J.1    Hubaux, J.-P.2
  • 26
    • 85008033351 scopus 로고    scopus 로고
    • Optimal base-station locations in two-tiered wireless sensor networks
    • PAN, J., CAI, L., HOU, Y. T., SHI, Y., AND SHEN, S. X. 2005. Optimal base-station locations in two-tiered wireless sensor networks. IEEE Trans. Mobile Comput. 4, 5, 458-473.
    • (2005) IEEE Trans. Mobile Comput , vol.4 , Issue.5 , pp. 458-473
    • Pan, J.1    Cai, L.2    Hou, Y.T.3    Shi, Y.4    Shen, S.X.5
  • 27
    • 38549176381 scopus 로고    scopus 로고
    • Accuracy vs. lifetime: Linear sketches for aggregate queries in sensor networks
    • PUTTAGUNTA, V. AND KALPAKIS, K. 2007. Accuracy vs. lifetime: Linear sketches for aggregate queries in sensor networks. Algorithmica 49, 4, 357-385.
    • (2007) Algorithmica , vol.49 , Issue.4 , pp. 357-385
    • Puttagunta, V.1    Kalpakis, K.2
  • 29
    • 8344234971 scopus 로고    scopus 로고
    • Maximum lifetime routing in wireless ad-hoc networks
    • SANKAR, A. AND LIU, Z. 2004. Maximum lifetime routing in wireless ad-hoc networks. In Proceedings of INFOCOM.
    • (2004) Proceedings of INFOCOM
    • Sankar, A.1    Liu, Z.2
  • 30
    • 33845579641 scopus 로고    scopus 로고
    • Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation
    • STANFORD, J. AND TONGNGAM, S. 2006. Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation. In Proceedings of SNPD. 273-277.
    • (2006) Proceedings of SNPD , pp. 273-277
    • Stanford, J.1    Tongngam, S.2
  • 31
    • 33846263050 scopus 로고    scopus 로고
    • Energy minimization for real-time data gathering in wireless sensor networks
    • YU, Y., PRASANNA, V. K., AND KRISHNAMACHARI, B. 2006. Energy minimization for real-time data gathering in wireless sensor networks. IEEE Trans. Wireless Comm. 5, 11, 3087-3096.
    • (2006) IEEE Trans. Wireless Comm , vol.5 , Issue.11 , pp. 3087-3096
    • Yu, Y.1    Prasanna, V.K.2    Krishnamachari, B.3


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