Author:
Bhattacharya B.,Burmester B.,Hu Y.,Kranakis E.,Shi Q.,Wiese A.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Ahmed, N., Kanhere, S.S., Jha, S.: The holes problem in wireless sensor networks: a survey. ACM SIGMOBILE Mobile Computing and Communications Review 9(2), 4–18 (2005)
2. Balister, P., Bollobas, B., Sarkar, A., Kumar, S.: Reliable density estimates for coverage and connectivity in thin strips of finite length. In: Proceedings of the 13th annual ACM international conference on Mobile computing and networking, pp. 75–86 (2007)
3. Chen, A., Kumar, S., Lai, T.H.: Designing localized algorithms for barrier coverage. In: Proceedings of the 13th annual ACM international conference on Mobile computing and networking, pp. 63–74 (2007)
4. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM (JACM) 34(1), 200–208 (1987)
5. Heo, N., Varshney, P.K.: A distributed self spreading algorithm for mobile wireless sensor networks. In: Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE, vol. 3 (2003)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献