Show simple item record

dc.contributor.authorGüney, Evrenen_US
dc.contributor.authorAras, Necatien_US
dc.contributor.authorAltınel, İsmail Kubanen_US
dc.contributor.authorErsoy, Cemen_US
dc.date.accessioned2016-05-10T09:41:47Z
dc.date.available2016-05-10T09:41:47Z
dc.date.issued2012
dc.identifier.citationGüney, E., Aras, N., Altınel, İ. K., Ersoy, C. (2012). Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks. Computers & Operations Research. 39.7, 1530–1539.en_US
dc.identifier.issn0305-0548
dc.identifier.urihttps://hdl.handle.net/20.500.12294/426
dc.identifier.urihttp://dx.doi.org/10.1016/j.cor.2011.09.002
dc.descriptionGüney, Evren (Arel Author)en_US
dc.description.abstractSensors are tiny electronic devices having limited battery energy and capability for sensing, data processing and communicating. They can collectively behave to provide an effective wireless network that monitors a region and transmits the collected information to gateway nodes called sinks. Most of the applications require the operation of the network for long periods of times, which makes the efficient management of the available energy resources an important concern. There are three major issues in the design of sensor networks: sensor deployment or the coverage of the sensing area, sink location, and data routing. In this work, we consider these three design problems within a unified framework and develop two mixed-integer linear programming formulations. They are difficult to solve exactly. However, it is possible to compute good feasible solutions of the sink location and routing problems easily, when the sensors are deployed and their locations in the sensor field become known. Therefore, we propose a tabu search heuristic that tries to identify the best sensor locations satisfying the coverage requirements. The objective value corresponding to each set of sensor locations is calculated by solving the sink location and routing problem. Computational tests carried out on randomly generated test instances indicate that the proposed hybrid approach is both accurate and efficienten_US
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectWireless Sensor Networksen_US
dc.subjectInteger Programmingen_US
dc.subjectTabu Searchen_US
dc.titleEfficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networksen_US
dc.typearticleen_US
dc.relation.journalComputers & Operations Researchen_US
dc.contributor.departmentİstanbul Arel Üniversitesi, Mühendislik ve Mimarlık Fakültesi, Bilgisayar Mühendisliği Bölümü.en_US
dc.contributor.authorIDTR19624en_US
dc.contributor.authorIDTR21097en_US
dc.contributor.authorIDTR10854en_US
dc.contributor.authorIDTR3425en_US
dc.identifier.volume39en_US
dc.identifier.issue7en_US
dc.identifier.startpage1530en_US
dc.identifier.endpage1539en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record