메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Distributed symmetric function computation in noisy wireless sensor networks with binary data

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SYMMETRIC CHANNEL; FUNCTION COMPUTATIONS; HIGH PROBABILITY; PERFORMANCE CONSTRAINTS; PROBABILITY OF ERRORS; SYMMETRIC FUNCTIONS; TOTAL TRANSMISSION; TRANSMISSION RANGES;

EID: 84886472496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIOPT.2006.1666455     Document Type: Conference Paper
Times cited : (8)

References (13)
  • 2
    • 0023981825 scopus 로고
    • Finding parity in a simple broadcast network
    • R. G. Gallager. Finding parity in a simple broadcast network. In IEEE Transactions on Information Theory, vol. 34, pp 176-180, 1988
    • (1988) IEEE Transactions on Information Theory , vol.34 , pp. 176-180
    • Gallager, R.G.1
  • 3
    • 17144395505 scopus 로고    scopus 로고
    • Computing and communicating functions over sensor networks
    • April
    • A. Giridhar and P. R. Kumar. Computing and communicating functions over sensor networks. In IEEE Journal on Selected Areas in Communications, pp. 755-764, vol. 23, no. 4, April 2005
    • (2005) IEEE Journal on Selected Areas in Communications , vol.23 , Issue.4 , pp. 755-764
    • Giridhar, A.1    Kumar, P.R.2
  • 4
    • 0001553129 scopus 로고    scopus 로고
    • Critical power for asymptotic connectivity in wireless network
    • Honor of W. H. Fleming, W. McEneaney, G. Yin and Q. Zhang, Eds.
    • P. Gupta and P. Kumar. Critical power for asymptotic connectivity in wireless network. In Stochastic Analysis, Contrtol, Optimization and Applicaitons: a Volume in Honor of W. H. Fleming, W. McEneaney, G. Yin and Q. Zhang, Eds., 1998
    • (1998) Stochastic Analysis, Contrtol, Optimization and Applicaitons: A Volume
    • Gupta, P.1    Kumar, P.2
  • 6
    • 25644451311 scopus 로고    scopus 로고
    • Time and energy complexity of distributed computation in wireless sensor networks
    • N. Khude, A. Kumar and A. Karnik. Time and Energy Complexity of Distributed Computation in Wireless Sensor Networks. In Proceedings of the IEEE Infocom, 2005
    • (2005) Proceedings of the IEEE Infocom
    • Khude, N.1    Kumar, A.2    Karnik, A.3
  • 7
    • 2942637958 scopus 로고    scopus 로고
    • A deterministic approach to throughput scaling in wireless networks
    • June
    • S. R. Kulkarni and P. Viswanath. A Deterministic Approach to Throughput Scaling in Wireless Networks. In IEEE Trans. on Information Theory, Vol. 50, No. 6, pp. 1041-1049, June 2004
    • (2004) IEEE Trans. on Information Theory , vol.50 , Issue.6 , pp. 1041-1049
    • Kulkarni, S.R.1    Viswanath, P.2
  • 10
    • 33645429139 scopus 로고
    • Communication on noisy channels: A coding theorem for computation
    • L. J. Schulman. Communication on Noisy Channels: A Coding Theorem for Computation. In Proceeding of 33rd FOCS, pp. 724-733, 1992
    • (1992) Proceeding of 33rd FOCS , pp. 724-733
    • Schulman, L.J.1
  • 12
    • 2442421542 scopus 로고    scopus 로고
    • Large wireless network under fading, mobility, and delay constraints
    • S. Toumpis and A. J. Goldsmith Large wireless network under fading, mobility, and delay constraints. In Procedings of IEEE INFOCOM, 2004
    • (2004) Procedings of IEEE INFOCOM
    • Toumpis, S.1    Goldsmit, A.J.2
  • 13
    • 1042289031 scopus 로고    scopus 로고
    • The number of neighbors needed for connectivity of wireless networks
    • March
    • F. Xue and P. R. Kumar. The number of neighbors needed for connectivity of wireless networks. Wireless Networks, pp. 169-181, vol. 10, no. 2, March 2004.
    • (2004) Wireless Networks , vol.10 , Issue.2 , pp. 169-181
    • Xue, F.1    Kumar, P.R.2


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