메뉴 건너뛰기




Volumn , Issue , 2014, Pages

Tree-based energy-efficient data gathering in wireless sensor networks deploying compressive sensing

Author keywords

compressive sensing; data collection; routing method; Wireless sensor networks

Indexed keywords

DATA ACQUISITION; MATRIX ALGEBRA; OPTICAL COMMUNICATION; SENSORS; SIGNAL RECONSTRUCTION; TREES (MATHEMATICS); WIRELESS SENSOR NETWORKS;

EID: 84904159180     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WOCC.2014.6839920     Document Type: Conference Paper
Times cited : (43)

References (18)
  • 2
    • 31744440684 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • Feb.
    • E. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information," Information Theory, IEEE Transactions on, vol. 52, pp. 489-509, Feb. 2006.
    • (2006) Information Theory, IEEE Transactions on , vol.52 , pp. 489-509
    • Candes, E.1    Romberg, J.2    Tao, T.3
  • 3
    • 85032750937 scopus 로고    scopus 로고
    • An introduction to compressive sampling
    • E. Candes and M. Wakin, "An introduction to compressive sampling," Signal Processing Magazine, IEEE, vol. 25, no. 2, pp. 21-30, 2008.
    • (2008) Signal Processing Magazine, IEEE , vol.25 , Issue.2 , pp. 21-30
    • Candes, E.1    Wakin, M.2
  • 7
    • 84857228847 scopus 로고    scopus 로고
    • Minimum transmission data gathering trees for compressive sensing in wireless sensor networks
    • 2011 IEEE
    • R. Xie and X. Jia, "Minimum transmission data gathering trees for compressive sensing in wireless sensor networks," in Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE, pp. 1-5, 2011.
    • (2011) Global Telecommunications Conference (GLOBECOM 2011) , pp. 1-5
    • Xie, R.1    Jia, X.2
  • 9
    • 1842539282 scopus 로고    scopus 로고
    • Minimal spanning trees for graphs with random edge lengths
    • Trends Math., Basel: Birkhäuser
    • J. M. Steele, "Minimal spanning trees for graphs with random edge lengths," in Mathematics and computer science, II (Versailles, 2002), Trends Math., pp. 223-245, Basel: Birkhäuser, 2002.
    • (2002) Mathematics and Computer Science, II (Versailles, 2002) , pp. 223-245
    • Steele, J.M.1
  • 10
    • 0002610737 scopus 로고
    • On a routing problem
    • R. Bellman, "On a routing problem," Quart. Appl. Math., vol. 16, pp. 87-90, 1958.
    • (1958) Quart. Appl. Math. , vol.16 , pp. 87-90
    • Bellman, R.1
  • 12
    • 85032751965 scopus 로고    scopus 로고
    • Compressive sensing [lecture notes]
    • July
    • R. Baraniuk, "Compressive sensing [lecture notes]," Signal Processing Magazine, IEEE, vol. 24, pp. 118 -121, July 2007.
    • (2007) Signal Processing Magazine, IEEE , vol.24 , pp. 118-121
    • Baraniuk, R.1
  • 15
    • 84883176354 scopus 로고    scopus 로고
    • Minimizing energy consumption in random walk routing for wireless sensor networks utilizing compressed sensing
    • (Maui, Hawaii, USA), June
    • M. T. Nguyen, "Minimizing energy consumption in random walk routing for wireless sensor networks utilizing compressed sensing," in 2013 8th International Conference on System of Systems Engineering (SoSE 2013), (Maui, Hawaii, USA), pp. 291-295, June 2013.
    • (2013) 2013 8th International Conference on System of Systems Engineering (SoSE 2013) , pp. 291-295
    • Nguyen, M.T.1
  • 18
    • 84904153548 scopus 로고    scopus 로고
    • http://lcav.epfl.ch/op/edit/sensorscope en.


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