메뉴 건너뛰기




Volumn , Issue , 2010, Pages

DAWN: Energy efficient data aggregation in WSN with mobile sinks

Author keywords

Delay; Detection; Mobility; Sensor networks

Indexed keywords

DATA AGGREGATION; DELAY; DELIVERY DELAY; DETECTION; ENERGY EFFICIENT; MOBILE SINKS; MOBILITY; MOVING SPEED; NETWORK LIFETIME; OPTIMUM ROUTING; REAL-TIME DATA; REALISTIC MODEL; STATIC SENSOR NETWORKS; STATIC SENSORS; THEORETICAL RESULT; TIME-DEPENDENT NETWORKS;

EID: 77956636981     PISSN: 1548615X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWQoS.2010.5542765     Document Type: Conference Paper
Times cited : (34)

References (24)
  • 1
    • 0033877788 scopus 로고    scopus 로고
    • Energy efficient communication protocols for wireless microsensor networks
    • W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy efficient Communication Protocols for Wireless Microsensor Networks," in HICSS, 2000.
    • (2000) HICSS
    • Heinzelman, W.1    Chandrakasan, A.2    Balakrishnan, H.3
  • 2
    • 85035363269 scopus 로고    scopus 로고
    • Adaptive protocols for information dessemination in wireless sensor networks
    • W. Heinzelman, J. Kulik, and H. Balakrishnan, "Adaptive protocols for Information Dessemination in Wireless Sensor Networks," in ACM Mobicom, 1999.
    • (1999) ACM Mobicom
    • Heinzelman, W.1    Kulik, J.2    Balakrishnan, H.3
  • 3
    • 0033885342 scopus 로고    scopus 로고
    • Energy conserving routing in wireless ad-hoc networks
    • J. Chang and L. Tassiulas, "Energy Conserving Routing in Wireless Ad-hoc Networks," in IEEE Infocom, 2000.
    • (2000) IEEE Infocom
    • Chang, J.1    Tassiulas, L.2
  • 4
    • 25844459686 scopus 로고    scopus 로고
    • Joint mobility and routing for lifetime elongation in wireless sensor networks
    • J. Luo and J. Hubaux, "Joint mobility and routing for lifetime elongation in wireless sensor networks," in IEEE INFOCOM, vol. 3, 2005.
    • (2005) IEEE INFOCOM , vol.3
    • Luo, J.1    Hubaux, J.2
  • 5
    • 4143096822 scopus 로고    scopus 로고
    • Base-station repositioning for optimized performance of sensor networks
    • M. Younis, M. Bangad, and K. Akkaya, "Base-station repositioning for optimized performance of sensor networks," in VTC 2003.
    • (2003) VTC
    • Younis, M.1    Bangad, M.2    Akkaya, K.3
  • 8
    • 77956641497 scopus 로고    scopus 로고
    • Canopy closure estimates with GreenOrbs: Long-term large-scale sensing in the forest
    • M. L.F., H. Y., L. Y.H., Z. J.Z., T. S.J., and L. X.Y., "Canopy Closure Estimates with GreenOrbs: Long-Term Large-Scale Sensing in the Forest," in ACM SenSys'09.
    • ACM SenSys'09
  • 9
    • 51349146647 scopus 로고    scopus 로고
    • Theoretical results on base station movement problem for sensor network
    • Y. Shi and Y. Hou, "Theoretical results on base station movement problem for sensor network," in IEEE INFOCOM, 2008, pp. 1-5.
    • (2008) IEEE INFOCOM , pp. 1-5
    • Shi, Y.1    Hou, Y.2
  • 10
    • 84893210748 scopus 로고    scopus 로고
    • A new MILP formulation and distributed protocols for wireless sensor networks lifetime maximization
    • S. Basagni, A. Carosi, E. Melachrinoudis, C. Petrioli, and Z. Wang, "A new MILP formulation and distributed protocols for wireless sensor networks lifetime maximization," in IEEE ICC.
    • IEEE ICC
    • Basagni, S.1    Carosi, A.2    Melachrinoudis, E.3    Petrioli, C.4    Wang, Z.5
  • 11
    • 0842267734 scopus 로고    scopus 로고
    • Energy efficient schemes for wireless sensor networks with multiple mobile base stations
    • S. Gandham, M. Dawande, R. Prakash, and S. Venkatesan, "Energy efficient schemes for wireless sensor networks with multiple mobile base stations," in IEEE GLOBECOM'03, vol. 1, 2003.
    • (2003) IEEE GLOBECOM'03 , vol.1
    • Gandham, S.1    Dawande, M.2    Prakash, R.3    Venkatesan, S.4
  • 13
    • 33751037612 scopus 로고    scopus 로고
    • Efficient interference-aware TDMA link scheduling for static wireless networks
    • W. Wang, Y. Wang, X. Li, W. Song, and O. Frieder, "Efficient Interference-Aware TDMA Link Scheduling for Static Wireless Networks," in ACM MobiCom. 2006.
    • (2006) ACM MobiCom
    • Wang, W.1    Wang, Y.2    Li, X.3    Song, W.4    Frieder, O.5
  • 14
    • 0028514351 scopus 로고    scopus 로고
    • On the hardness of approximating minimization problems
    • L. C. and Y. M., "On the hardness of approximating minimization problems," in Journal of ACM), pp. 41(5):960-981.
    • Journal of ACM) , vol.41 , Issue.5 , pp. 960-981
  • 15
    • 77956627146 scopus 로고    scopus 로고
    • Multiflows in multihop wireless networks
    • W. P.J., "Multiflows in Multihop Wireless Networks," in MobiHoc'09).
    • MobiHoc'09
  • 17
    • 33645219690 scopus 로고    scopus 로고
    • A tabu search algorithm for the min-max k-Chinese postman problem
    • D. Ahr and G. Reinelt, "A tabu search algorithm for the min-max k-Chinese postman problem," in Computers and Operations Research.
    • Computers and Operations Research
    • Ahr, D.1    Reinelt, G.2
  • 18
    • 34147120474 scopus 로고    scopus 로고
    • A note on two problems in connetion with graphs
    • E. Dijkstra, "A note on two problems in connetion with graphs," in Numerische Mathematik.
    • Numerische Mathematik
    • Dijkstra, E.1
  • 19
    • 84945709831 scopus 로고
    • Algorithm 97: Shortest path
    • R. Floyd, "Algorithm 97: shortest path," in Communications of the ACM, 1962, p. 5(6):345.
    • (1962) Communications of the ACM , vol.5 , Issue.6 , pp. 345
    • Floyd, R.1
  • 23


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