Creating an Optimization Algorithm for the Minimum Size of the Wireless Sensor Networks Rajan S.*, Dr. Maheswari S. Uma** *Assistant Professor, Department of Electronics and Communication Engineering, Velalar College of Engineering and Technology, Erode, Tamilnadu, India **Assistant Professor, Department of Electronics and Communication Engineering, Coimbatore Institute of Technology, Coimbatore, Tamilnadu, India Online published on 2 August, 2016. Abstract Wireless sensor networks are small, battery-powered and each has a large number of sensors to collect and store the environmental information as well as the process is the ability to communicate with other sensors. Without a wireless network, environmental monitoring, nuclear, biological and chemical (NBC) attack detection, object tracking, industrial automation, and home automation has its use. A sensor network to operate successfully, the two sensors to maintain a sense of security and network connectivity. A sensor for wireless sensor networks is an important issue that affects the specific field deployment. In both situations, it is very difficult to monitor the sensor field. First, the sensor industry and the second largest in the field of sensor to fully cover the budget that does not provide enough sensors. In this situation, the use of a minimum number of sensors that are fully geared to lead the field of sensors. The purpose of using a limited number of or fewer sensors and sensors to choose from and it is for this reason the proposed approximate Steiner tree algorithm techniques used, based on the increase in the coverage area of the field is set. Top Keywords Wireless sensor networks, Branch and Bound technique, Steiner tree, Ant Colony algorithm, Connected covers. Top |