Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/14677
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | SAINI, TUSHAR | - |
dc.date.accessioned | 2016-05-04T10:04:53Z | - |
dc.date.available | 2016-05-04T10:04:53Z | - |
dc.date.issued | 2016-04 | - |
dc.identifier.uri | http://dspace.dtu.ac.in:8080/jspui/handle/repository/14677 | - |
dc.description.abstract | Wireless sensor networks consists of large number of resource constrained sensor nodes which performs the functionality of data gathering and transfer their data to the base station for analysis to gain meaningful information from it. In recent years, wireless sensor network has found its applications in varied areas like border surveillance, hazard management, security, weather monitoring etc. With such critical and real time applications it is very important to make wireless sensor network reliable and robust. One of the open problems in wireless sensor network is optimal positioning of the base station In this dissertation, an approach to solve the base station positioning problem in wireless sensor networks using Artificial Bee Colony (ABC) optimization technique is presented. Along with conventional ABC approach, six modified ABC approaches are presented in this work. The first modification incorporates modified local search mechanism in place of conventional ABC local search. The second modification uses a special phase apart from conventional ABC phases, which selects the worst 10% food sources and replaces them at the end of every cycle. Third and fourth medications use memetic search technique based on global section search. Fifth modification uses a special phase which calculates the opposites of the current food sources based on the opposition based learning technique and find the best out of the lot. Sixth modification incorporates a modified local search as it was in first modification and a special phase which incorporates opposition based learning technique to find the best solution. All of these modified algorithms are simulated and results are compared with the conventional ABC algorithm, which was outperformed by all six modifications in finding a location for the base station for maximizing lifetime of the network under same constraints. | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | TD NO.2162; | - |
dc.subject | ARTIFICIAL BEE COLONY | en_US |
dc.subject | NETWORK LIFETIME | en_US |
dc.subject | POSITIONING | en_US |
dc.subject | WIRELESS SENSOR NETWORK | en_US |
dc.title | BASE STATION POSITIONING FOR MAXIMUM LIFETIME IN WIRELESS SENSOR NETWORK | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | M.E./M.Tech. Computer Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
report.pdf | 576.29 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.