메뉴 건너뛰기




Volumn 28, Issue 7, 2010, Pages 1149-1158

A distributed and energy-efficient framework for Neyman-Pearson detection of fluctuating signals in large-scale sensor networks

Author keywords

Distributed routing; distributed scheduling; Kullback Leibler distance; Neyman Pearson criterion; signal detection; wireless sensor networks

Indexed keywords

DISTRIBUTED ROUTING; DISTRIBUTED SCHEDULING; KULLBACK-LEIBLER DISTANCE; NEYMAN - PEARSON CRITERION; WIRELESS SENSOR;

EID: 77956218074     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2010.100919     Document Type: Article
Times cited : (23)

References (20)
  • 1
    • 35348874935 scopus 로고    scopus 로고
    • Energy-efficient routing for signal detection under the Neyman-Pearson criterion in wireless sensor networks
    • April, Cambridge, MA
    • Y. Yang and R. S. Blum, Energy-efficient routing for signal detection under the Neyman-Pearson criterion in wireless sensor networks, in Proc. IPSN, pp. 303-312, Cambridge, MA, April 2007.
    • (2007) Proc. IPSN , pp. 303-312
    • Yang, Y.1    Blum, R.S.2
  • 2
    • 66849108931 scopus 로고    scopus 로고
    • Energy-efficient routing for signal detection in wireless sensor networks
    • June
    • Y. Yang, R. S. Blum, and B. M. Sadler, Energy-efficient routing for signal detection in wireless sensor networks, IEEE Trans. Signal Process., vol. 57, no. 6, pp. 2050-2063, June 2009.
    • (2009) IEEE Trans. Signal Process , vol.57 , Issue.6 , pp. 2050-2063
    • Yang, Y.1    Blum, R.S.2    Sadler, B.M.3
  • 3
    • 33646589837 scopus 로고    scopus 로고
    • An application-specific protocl architecture for wireless microsensor networks
    • October
    • W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, An application-specific protocl architecture for wireless microsensor networks, IEEE Trans. Wireless Commun., vol. 1, pp. 660-670, October 2002.
    • (2002) IEEE Trans. Wireless Commun , vol.1 , pp. 660-670
    • Heinzelman, W.B.1    Chandrakasan, A.P.2    Balakrishnan, H.3
  • 4
    • 0004140569 scopus 로고
    • M. I. Skolnik, Ed. McGraw-Hill, New York 2nd Edition
    • M. I. Skolnik, Ed., Radar Handbook, McGraw-Hill, New York, 2nd Edition, 1990.
    • (1990) Radar Handbook
  • 9
    • 33847724008 scopus 로고    scopus 로고
    • Cooperative routing for distributed detection in large sensor networks
    • February
    • Y. Sung, S. Misra, L. Tong, and A. Ephremides, Cooperative routing for distributed detection in large sensor networks, IEEE J. Sel. Areas Commun., vol. 25, pp. 471-483, February 2007.
    • (2007) IEEE J. Sel. Areas Commun , vol.25 , pp. 471-483
    • Sung, Y.1    Misra, S.2    Tong, L.3    Ephremides, A.4
  • 10
    • 46649090931 scopus 로고    scopus 로고
    • Energy efficient signal detection in sensor networks using ordered transmissions
    • July
    • R. S. Blum and B. M. Sadler, Energy efficient signal detection in sensor networks using ordered transmissions, IEEE Trans. Signal Process., vol. 56, pp. 3229-3234, July 2008.
    • (2008) IEEE Trans. Signal Process , vol.56 , pp. 3229-3234
    • Blum, R.S.1    Sadler, B.M.2
  • 11
    • 33646906440 scopus 로고    scopus 로고
    • MAC protocols for wireless sensor networks: A survey
    • April
    • I. Demirkol, C. Ersoy, and F. Alagöz, MAC protocols for wireless sensor networks: a survey, IEEE Commun. Mag., pp. 115-121, April 2006.
    • (2006) IEEE Commun. Mag. , pp. 115-121
    • Demirkol, I.1    Ersoy, C.2    Alagöz, F.3
  • 12
    • 46449099507 scopus 로고    scopus 로고
    • A survey and classification of distributed scheduling algorithms for sensor networks
    • S. Jain and S. Srivastava, A survey and classification of distributed scheduling algorithms for sensor networks, in Proc. SENSORCOMM, pp. 88-93, 2007.
    • (2007) Proc. SENSORCOMM , pp. 88-93
    • Jain, S.1    Srivastava, S.2
  • 13
    • 0035482962 scopus 로고    scopus 로고
    • Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
    • October
    • X. Liu, E.K.P. Chong, and N. B. Shroff, Opportunistic transmission scheduling with resource-sharing constraints in wireless networks, IEEE J. Sel. Areas Commun., vol. 19, pp. 2053-2064, October 2001.
    • (2001) IEEE J. Sel. Areas Commun , vol.19 , pp. 2053-2064
    • Liu, X.1    Chong, E.K.P.2    Shroff, N.B.3
  • 14
    • 0042440623 scopus 로고    scopus 로고
    • Exploiting multiuser diversity for medium access control in wireless networks
    • San Francisco, CA
    • X. Qin, and R. Berry, Exploiting multiuser diversity for medium access control in wireless networks, in Proc. IEEE INFOCOM, pp. 1084-1094, San Francisco, CA, 2003.
    • (2003) Proc. IEEE INFOCOM , pp. 1084-1094
    • Qin, X.1    Berry, R.2
  • 15
    • 24344480500 scopus 로고    scopus 로고
    • Opportunistic carrier sensing for energy-efficient information retrieval in sensor networks
    • April
    • Q. Zhao and L. Tong, Opportunistic carrier sensing for energy-efficient information retrieval in sensor networks, EURASIP J. Wireless Communications and Networking, pp. 231-241, April 2005.
    • (2005) EURASIP J. Wireless Communications and Networking , pp. 231-241
    • Zhao, Q.1    Tong, L.2
  • 16
    • 0035018902 scopus 로고    scopus 로고
    • Differentiation mechanism for IEEE 802.11
    • Anchorage, Alaska April
    • I. Aad and C. Castelluccia, Differentiation mechanism for IEEE 802.11, in Proc. IEEE INFOCOM, pp. 209-218, Anchorage, Alaska, April 2001.
    • (2001) Proc. IEEE INFOCOM , pp. 209-218
    • Aad, I.1    Castelluccia, C.2
  • 17
    • 70349420773 scopus 로고    scopus 로고
    • Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
    • New Orleans, Louisiana
    • B. Awerbuch, R. Khandekar, and S. Rao, Distributed algorithms for multicommodity flow problems via approximate steepest descent framework, in Proc. The ACM-SIAM Symposium on Discrete Algorithms, pp. 949-957, New Orleans, Louisiana, 2007.
    • (2007) Proc. The ACM-SIAM Symposium on Discrete Algorithms , pp. 949-957
    • Awerbuch, B.1    Khandekar, R.2    Rao, S.3
  • 18
    • 0017450139 scopus 로고
    • A mininum delay routing algorithm using distributed computation
    • January
    • R. G. Gallager, A mininum delay routing algorithm using distributed computation, IEEE Trans. Commun., vol. COM-25, pp. 73-85, January 1977.
    • (1977) IEEE Trans. Commun. , vol.COM-25 , pp. 73-85
    • Gallager, R.G.1
  • 19
    • 0021476519 scopus 로고
    • Second derivative algorithms for minimum delay distributed routing in networks
    • August
    • D. P. Bertsekas, E. M. Gafni, and R. G. Gallager, Second derivative algorithms for minimum delay distributed routing in networks, IEEE Trans. Commun., vol. COM-32, pp. 911-919, August 1984.
    • (1984) IEEE Trans. Commun. , vol.COM-32 , pp. 911-919
    • Bertsekas, D.P.1    Gafni, E.M.2    Gallager, R.G.3
  • 20
    • 0033204543 scopus 로고    scopus 로고
    • A simple approximation to minimum-delay routing
    • September
    • S. Vutukury and J. J. Garcia-Luna-Aceves, A simple approximation to minimum-delay routing, in Proc. ACM SIGCOMM, pp. 227-238, September 1999.
    • (1999) Proc. ACM SIGCOMM , pp. 227-238
    • Vutukury, S.1    Garcia-Luna-Aceves, J.J.2


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