IJRIT International Journal of Research in Information Technology, Volume 3, Issue 4, April 2015, Pg. 18-21

International Journal of Research in Information Technology (IJRIT) www.ijrit.com

ISSN 2001-5569

Deploying Wireless Sensor to achieve Target Coverage Problem Nithya Shanmugam1, Nivethitha Duraisamy2, Pavithra Subramani3, Saranya N4 1

4

UG Scholar, Department of Information Technology, Sri Ramakrishna Engineering College Coimbatore, TamilNadu, India [email protected]

2

UG Scholar, Department of Information Technology, Sri Ramakrishna Engineering College Coimbatore, TamilNadu, India [email protected]

3

UG Scholar, Department of Information Technology, Sri Ramakrishna Engineering College Coimbatore, TamilNadu, India [email protected]

Assistant Professor, Department of Information Technology, Sri Ramakrishna Engineering College Coimbatore, TamilNadu, India [email protected]

Abstract The target coverage requires higher degree of coverage(k-coverage) to track the targets accurately. This requires multiple number of sensor nodes to monitor the targets or region. Since sensor nodes are not be recharged easily, the network lifetime has to be increased for effectively monitor the specified coverage. To achieve the target, deployment locations for sensor nodes are computed using ABC(Artificial Bee Colony)algorithm which identifies the better solution for deployment and for scheduling Heuristic algorithm is used which provides the better solution for cover formation and cover optimization. The sensor nodes in the optimized cover are activated and the node which consumes below the minimum usable energy goes to inactive state thus reduces energy consumption Keywords: WSN(Wireless Sensor Network), ABC(Artificial Bee Colony),K-Coverage,Q-Coverage, BS(Base Station)

1. Introduction Wireless Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical settings, such as heat, noise, trembling, heaviness, movements and to cooperatively pass their data through the network to a main location or sink where the data can be observed and analysed. A sink or BS acts like an boundary between users and the link. One can improve the needed information from the network by injecting queries and gathering results from the node. A wireless sensor node is capable with sensing devices, radio transmitter and receiver power components. The entity nodes in a wireless sensor network (WSN) are inherently resource constrained i.e they have limited speed. Once all the sensor nodes are deployed, they are Nithya Shanmugam,IJRIT-18

IJRIT International Journal of Research in Information Technology, Volume 3, Issue 4, April 2015, Pg. 18-21

responsible for their appropriate network infrastructure often with multi-hop communication with them. The committed sensor nodes starts collecting in order of concern. WSN devices also respond to queries sent from a “control site” to perform specific instructions or provide sensing samples. The working method of the sensor nodes may be either continuous or event driven.

2. Related Work In the past years, the sensor deployment is mainly focused on area coverage problem. The area coverage examines the entire range. By searching the sensor node, the coverage can know how well it is interfered. Network lifetime can be achieved by deploying the sensor nodes and by scheduling them. Target coverage and connectivity can be fully obtained by deploying the sensor nodes. Coverage is usually identified by optimal deployment location of sensor nodes.By using limited energy, the network lifetime can be improved.

3. Existing System The sensor nodes can be deterministically deployed, the optimal deployment locations and the schedules are decided at the base station, prior to actual deployment. The pro-posed method has two phases: sensor deployment and sensor scheduling. The nodes are initially deployed randomly. Based on the theoretical upper bound of network lifetime, we compute the optimal deployment locations using ABC algorithm. A heuristic is then used to schedule the sensor nodes such that the network lifetime is maximum.

Fig 3.1 Functional block diagram of a sensor node

4. Proposed System Nithya Shanmugam,IJRIT-19

IJRIT International Journal of Research in Information Technology, Volume 3, Issue 4, April 2015, Pg. 18-21

With simple coverage, more than one sensor node monitors all the targets. The coverage problem is solved by ABC algorithm . ABC algorithm is used for sensor deployment problem in irregular surroundings. It is used to save the energy with minimum sensing range for the sensors. In future k-coverage and Q-coverage problems can be solved using ABC algorithm. There are two methods are used in proposed system sensor deployment and sensor scheduling. The optimal deployment locations are calculated with the help of ABC algorithm. The nodes are calculated with heuristic configuration to achieve maximum network lifetime. 4.1 Sensor deployment using heuristic algorithm A wireless network is created and the nodes are deployed randomly. The deployment location is computed using heuristic algorithm. Each node sends hello packets to its next nearest node which are in its communication range 4.2 Sensor deployment using ABC algorithm · Each sensor node is associated with cluster, where a cluster responds to the set of targets monitored by the sensor node · If new solution is better than existing one, the old solution is replaced with new solution · The solution with least sensing range is finally chosen as the best solution 4.3 Scheduling To achieve sensor scheduling a weight-based method is proposed for determining the cover sets. It includes the following main steps: 1) Weight assigned for the node 2) Cover formation for simple coverage problem 3) Cover optimization 4) Cover establishment and Energy drop 4.3.1 Weight assigned for the node Based on the highest priority of each sensor nodes the weights are assigned and the cover sets are decided. The weights are calculated based on the target as it covers. 4.3.2 Cover formation for simple coverage problem After the weight assignment to the nodes cover formation is contributed. For simple coverage problem sensor node covers unique goal. 4.3.3 Cover Optimization After cover formation the cover set is obtained to minimize the energy usage. The least precedence sensor node in the cover set cannot be removed as it satisfies K/Q coverage from the cover sets. Based on the pre-dominance removal of sensor nodes starts from the last. 4.3.4 Cover establishment and Energy drop Optimized cover is given as contribution for cover establishment. When the control of battery reaches the minimum value the nodes becomes off state and further cannot monitor any targets.

5. Conclusions In existing work, the deployment locations are calculated for each sensor nodes using ABC Algorithm so that the optimal network lifetime can be achieved.ABC Algorithm is found to be better than the Heuristic Algorithm for this target coverage problem. Battery use can be avoided for all the sensor nodes within the time, for satisfying coverage needs sensor nodes are scheduled with less number of sensor nodes.

Nithya Shanmugam,IJRIT-20

IJRIT International Journal of Research in Information Technology, Volume 3, Issue 4, April 2015, Pg. 18-21

References [1] D. Karaboga, B. Gorkemli, C. Ozturk, and N. Karaboga, “A compre-hensive survey: Artificial bee colony (ABC) algorithm and applications,”Artif. Intell. Rev., 2012, pp. 1–37 [2] D. Karaboga, C. Ozturk, N. Karaboga, and B. Gorkemli, “Artificial bee colony programming for symbolic regression,”Inf. Sci., vol. 209,pp. 1–15, Nov. 2012. [3] D. Karaboga, S. Okdem, and C. Ozturk, “Cluster based wireless sensor network routing using artificial bee colony algorithm,”Wireless Netw.,vol. 18, no. 7, pp. 847–860, 2012. [4] J. Wang, R. Ghosh, and S. Das, “A survey on sensor localization,” J.Control Theory Appl., vol. 8, no. 1, pp. 2– 11, 2010. [5] M. Chaudhary and A. K. Pujari, “Q-coverage problem in wirelesssensor networks,” in Proc. Int. Conf. Distrib. Comput. Netw., 2009,pp. 325–330. [6] D. Karaboga and B. Akay, “A survey: Algorithms simu-lating bee swarm intelligence,” Artif. Intell. Rev., vol. 31,nos. 1–4, pp. 61–85, 2009. [7] A. Krause, R. Rajagopal, A. Gupta, and C. Guestrin, “Simultaneousplacement and scheduling of sensors,” inProc. Int. Conf. IPSN, 2009,pp. 181–192.

Nithya Shanmugam,IJRIT-21

Deploying Wireless Sensor to achieve Target Coverage Problem - IJRIT

2 UG Scholar, Department of Information Technology, Sri Ramakrishna ... The target coverage requires higher degree of coverage(k-coverage) to track ... In the past years, the sensor deployment is mainly focused on area coverage problem.

144KB Sizes 3 Downloads 87 Views

Recommend Documents

Deploying Wireless Sensor to achieve Target Coverage Problem - IJRIT
IJRIT International Journal of Research in Information Technology, Volume 3, Issue 4, April 2015 ... of Information Technology, Sri Ramakrishna Engineering College .... The solution with least sensing range is finally chosen as the best solution.

Detecting the Impact of landslide through Wireless Sensor ... - IJRIT
IJRIT International Journal of Research in Information Technology, Volume 3, Issue 1, ... Wireless Sensor Network (WSN) has come forth as an important new.

TARANTULAS: Mobility-enhanced Wireless Sensor-Actuator Networks
3School of Computer Science and Engineering, University of New South Wales, NSW 2052, Australia. {winston ... Asynchronous Systems (TARANTULAS) project builds a system of ... information ranging from physical quantities such as.

Mesh-Based Sensor Relocation for Coverage ...
are not displayed; proxy nodes are represented by big colorful dots, and their ..... A-node, as servers, send four query messages respectively to the north, the ... protocols, every relocating node transfers all its local data to the newcomer at.

WIRELESS SENSOR NETWORKS FOR MEDICAL SERVICE
Abstract: The present work surveys and classifies various applications of the Wireless Sensor Networks. (WSNs) technology in bio-medical service. A review.

Wireless sensor network: A survey
[email protected] 1, [email protected] 2. Abstract. This paper Describe the concept of Wireless Sensor Networks which has.