Vijay Kumar
Abstract
We visualize the world as a fully connected information space where each object communicates with all other objects without any temporal and geographical constraints. We can model this fully connected space using fine granularity processing which can be implemented using sensors technology. We regard sensors as atomic computing particles which can deployed to geographical locations for capturing and processing data of their surrounding. This report introduces a number of excellent research articles which present unique problems and their success in finding efficient solutions for them. It also peeks in to the future of ever changing information processing discipline.
- Estrin, R. Govindan and J. Heidemann, "Embedding the Internet", ACM Comm., Vol. 43, No. 4, May 2000. Google Scholar
Digital Library
- Alberto Cerpa and Deborah Estrin, "Ascent: Adaptive Self-Configuring sensor Network Topologies," Technical Report UCLA/CSD-TR-01-0009" Computer Science Department, UCLA.Google Scholar
- T. Clouqueur, P. Ramanathan, K. K. Saluja, and K-C. Wang, "Value-fusion versus decision-fusion for fault-tolerance in collaborative target detection in sensor networks," Proceedings of the Fourth International Conference on Information Fusion, August 2001.Google Scholar
- H. Deng, W. Li, and Dharma P. Agrawal, "Routing Security in Ad Hoc Networks," IEEE Communications Magazine, Special Topics on Security in Telecommunication Networks, Vol. 40, No. 10, October 2002. Google ScholarDigital Library
- EPA publication, "Nonhazardous waste landfill publications," CR-ROM, EPA530-C-00-002.Google Scholar
- Soheil Ghiasi, Ankur Srivastava, Xiaojian Yang, and Majid Sarrafzadeh, "Optimal Energy Aware Clustering in Sensor Network," Sensors, Vol. 2, pp. 258--269 July 2002.Google ScholarCross Ref
- W. B. Heinzelman and A. P. Chandrakasan and H. Balakrishnan, "An Application-Specific Protocol Architecture for Wireless Microsensor Networks," IEEE Transactions on Wireless Communications, Vol. 1, No. 4, pp. 660--670, October 2002. Google ScholarDigital Library
- Chalermek Intanagonwiwat and Ramesh Govindan and Deborah Estrin, "Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks," Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), pp. 56--67, August 2000 Google ScholarDigital Library
- Stephanie Lindsey, Cauligi Raghvendra, and Krishna Sivalingam, "Data Gathering Algorithms in Sensor Networks Using Energy Metrics," IEEE Trans. on Parrallel and Distributed Sys. 13, No. 9, September 2002. Google ScholarDigital Library
- Perrig, P. Szewczyk et al., SPINS: Security Protocols for Sensor Networks, Wireless Networks 8, 521--53, 2002. Google ScholarDigital Library
- R. Viswanathan and P. K. Varshney, "Distributed detection with multiple sensors: Part I - fundamentals," Proceedings of the IEEE, Vol. 85, No. 1, pp. 54--63, January 1997.Google Scholar
- D. Wood and J. A. Stankovic, "Denial of Service in Sensor Networks," IEEE Computer, 35(10), Oct. 02. Google ScholarDigital Library
Recommendations
A sensor deployment approach using glowworm swarm optimization algorithm in wireless sensor networks
Highlights► We present a sensor deployment scheme based on glowworm swarm optimization (GSO) to enhance the coverage after an initial random deployment of the sensors. ► A sensor node is attracted towards its neighbors having lower ...
AbstractA wireless sensor network is composed of a large number of sensor nodes that are densely deployed in a sensing environment. The effectiveness of the wireless sensor networks depends to a large extent on the coverage provided by the ...
The optimization of sensor relocation in wireless mobile sensor networks
Wireless Sensor Networks (WSNs) have been an active research area these years due to their broad range of potential applications. Several research issues, which include energy-aware routing, sensor deployment problems, data aggregation, etc., have been ...
Sensor scheduling for p-percent coverage in wireless sensor networks
We study sensor scheduling problems of p-percent coverage in this paper and propose two scheduling algorithms to prolong network lifetime due to the fact that for some applications full coverage is not necessary and different subareas of the monitored ...
Comments