메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Data quality maximization in sensor networks with a mobile sink

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION COMPLEXITY; DATA QUALITY; ENERGY EFFICIENT ROUTING; HIGH-CAPACITY; MOBILE SINKS; NP-HARDNESS; OPTIMIZATION PROBLEMS; RELAY NODE; TRANSMISSION RANGES; UPPER BOUND;

EID: 80052459618     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCOSS.2011.5982160     Document Type: Conference Paper
Times cited : (35)

References (21)
  • 1
    • 57349107051 scopus 로고    scopus 로고
    • Rendezvous design algorithms for wireless sensor networks with a mobile base station
    • G. Xing, T. Wang, W. Jia, and M. Li. Rendezvous design algorithms for wireless sensor networks with a mobile base station. Proceedings of ACM MobiHoc, 2008.
    • (2008) Proceedings of ACM MobiHoc
    • Xing, G.1    Wang, T.2    Jia, W.3    Li, M.4
  • 3
    • 79551637477 scopus 로고    scopus 로고
    • Prolonging network lifetime via a controlled mobile sink in wireless sensor networks
    • W. Liang, J. Luo, X. Xu. Prolonging network lifetime via a controlled mobile sink in wireless sensor networks. Proceedings of IEEE GLOBE-COM, 2010.
    • (2010) Proceedings of IEEE GLOBE-COM
    • Liang, W.1    Luo, J.2    Xu, X.3
  • 4
    • 77954852265 scopus 로고    scopus 로고
    • Maximizing the lifetime of wireless sensor networks with mobile sink in delay-tolerant applications
    • Y. Yun, Y. Xia. Maximizing the lifetime of wireless sensor networks with mobile sink in delay-tolerant applications. IEEE Transactions on Mobile Computing, vol. 9, pp. 1308-1318, 2010.
    • (2010) IEEE Transactions on Mobile Computing , vol.9 , pp. 1308-1318
    • Yun, Y.1    Xia, Y.2
  • 6
    • 34648846751 scopus 로고    scopus 로고
    • SenCar: An energy-efficient data gathering mechanism for large-scale multihop sensor networks
    • M. Ma, and Y. Yang. SenCar: an energy-efficient data gathering mechanism for large-scale multihop sensor networks. IEEE Transactions on Parallel and Distributed Systems (TPDS), vol. 18, pp. 1476-1488, 2007.
    • (2007) IEEE Transactions on Parallel and Distributed Systems (TPDS) , vol.18 , pp. 1476-1488
    • Ma, M.1    Yang, Y.2
  • 7
    • 80052161104 scopus 로고    scopus 로고
    • Placing optimal number of sinks in sensor networks for network lifetime maximization
    • To appear in
    • X. Xu and W. Liang. Placing optimal number of sinks in sensor networks for network lifetime maximization. To appear in Proceedings of IEEE ICC, 2011.
    • (2011) Proceedings of IEEE ICC
    • Xu, X.1    Liang, W.2
  • 8
    • 79551553785 scopus 로고    scopus 로고
    • Efficient data gathering with mobile collectors and space-division multiple access technique in wireless sensor networks
    • M. Zhao, M. Ma, and Y. Yang. Efficient data gathering with mobile collectors and space-division multiple access technique in wireless sensor networks IEEE Transactions on Computers (TC), vol. 60, pp.400-415, 2010.
    • (2010) IEEE Transactions on Computers (TC) , vol.60 , pp. 400-415
    • Zhao, M.1    Ma, M.2    Yang, Y.3
  • 9
    • 70349655372 scopus 로고    scopus 로고
    • Optimizing energy-latency trade-off in sensor networks with controlled mobility
    • R. Sugihara, R. K. Gupta. Optimizing energy-latency trade-off in sensor networks with controlled mobility. Proceedings of IEEE INFOCOM, 2009.
    • (2009) Proceedings of IEEE INFOCOM
    • Sugihara, R.1    Gupta, R.K.2
  • 10
    • 28444434729 scopus 로고    scopus 로고
    • Snapshot queries: Towards data-centric sensor networks
    • Y. Kotidis. Snapshot queries: towards data-centric sensor networks. Proceedings of IEEE ICDE, 2005.
    • (2005) Proceedings of IEEE ICDE
    • Kotidis, Y.1
  • 12
    • 0018006403 scopus 로고
    • The complexity of the capacitated tree problem
    • C. Papadimitriou. The complexity of the capacitated tree problem. Networks, vol. 8, pp. 217-230, 1978.
    • (1978) Networks , vol.8 , pp. 217-230
    • Papadimitriou, C.1
  • 13
    • 34250246836 scopus 로고
    • A fast algorithm for steiner trees
    • L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta Informatica, vol. 15, pp. 141-145, 1981.
    • (1981) Acta Informatica , vol.15 , pp. 141-145
    • Kou, L.1    Markowsky, G.2    Berman, L.3
  • 14
    • 51849138128 scopus 로고    scopus 로고
    • Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
    • R. Jothi and B. Raghavachari. Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Transactions on Algorithms (TALG), vol. 1, pp. 265-282, 2005.
    • (2005) ACM Transactions on Algorithms (TALG) , vol.1 , pp. 265-282
    • Jothi, R.1    Raghavachari, B.2
  • 15
    • 0002719797 scopus 로고
    • The hungarian method for the assignment problem
    • Harold W. Kuhn. The Hungarian Method for the assignment problem. Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955.
    • (1955) Naval Research Logistics Quarterly , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 17
    • 1142291592 scopus 로고    scopus 로고
    • Adaptive filters for continuous queries over distributed data streams
    • C. Olston, J. Jiang, and J. Widom. Adaptive filters for continuous queries over distributed data streams. Proceedings of ACM SIGMOD, 2003.
    • (2003) Proceedings of ACM SIGMOD
    • Olston, C.1    Jiang, J.2    Widom, J.3
  • 20
    • 4143145711 scopus 로고    scopus 로고
    • Design guidelines for wireless sensor networks communication: Clustering and aggregation
    • V. Mhatre and C. Rosenberg. Design guidelines for wireless sensor networks communication: clustering and aggregation. Ad Hoc Networks Journal, vol. 2, pp. 45-63, 2004.
    • (2004) Ad Hoc Networks Journal , vol.2 , pp. 45-63
    • Mhatre, V.1    Rosenberg, C.2


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