Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/15211
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | LIKHAR, JAYANT | - |
dc.date.accessioned | 2016-10-20T05:06:47Z | - |
dc.date.available | 2016-10-20T05:06:47Z | - |
dc.date.issued | 2016-10 | - |
dc.identifier.uri | http://dspace.dtu.ac.in:8080/jspui/handle/repository/15211 | - |
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, five modified ABC approaches are presented in this work. The first modification incorporates Grenade Explosion method instead of local search mechanism of conventional ABC and also applies Cauchy operator while exploration. The second modification uses three neighbors as reference while local search, it also selects the worst food source and replaces it at the end of every cycle. Third modification is based on Chaotic search where it creates a chaotic sequence which helps in exploitation and searching a new food source within some defined radius R. Fourth modification uses DRF GBest method where it uses two dynamic regulatory factors to control the perturbation towards the global best solution. Fifth modification uses a novel method which enhances the local search ability of ABC while exploitation using the global best solution as reference. 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.2476; | - |
dc.subject | ARTIFICIAL BEE COLONY | en_US |
dc.subject | WIRELESS SENSOR NETWORK | en_US |
dc.subject | BASE STATION POSITIONING | en_US |
dc.subject | NETWORK LIFETIME | en_US |
dc.title | POSITIONING OF BASE STATION FOR MAXIMIZATION OF LIFETIME IN WSN USING MODIFIED ABC | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | M.E./M.Tech. Computer Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
final report.pdf | 1.54 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.