Yayın:
Multiple Base Station Placement with k-means Local

dc.contributor.authorTaysi, Z. Cihan
dc.contributor.authorGuvensan, M. Amac
dc.contributor.authorYavuz, A. Goekhan
dc.contributor.institutionauthorGÜVENSAN, Mehmet Amaç
dc.contributor.institutionauthorTAYŞİ, Ziya Cihan
dc.date.accessioned2026-06-27T13:06:25Z
dc.date.issued2009
dc.description.abstractSensor applications have many different constraints such as the network lifetime, the number of sensor nodes and base stations (BS). The main goal of the researchers is to maximize the network lifetime with minimum budget. BS positioning and the choice of routing algorithm are two important criteria in maximizing the lifetime. Many wireless sensor network (WSN) applications, like intelligent agriculture, habitat and weather monitoring, are based on continuous data delivery model. In these applications, each sensor node generally collects data of the same size and periodically transfers this data to BS by multi-hop communication. To maximize the network lifetime of such applications, we propose a new BS placement algorithm for deploying multiple base stations, called k-means Local+, which provides up to 45% longer network lifetime than single k-means algorithm [1]en
dc.identifier.endpage181
dc.identifier.isbn978-1-4244-4435-9
dc.identifier.startpage178
dc.identifier.urihttps://hdl.handle.net/20.500.14981/49810
dc.identifier.wos000273935600045
dc.language.isotur
dc.publisherIEEE
dc.relation.conferenceIEEE 17th Signal Processing and Communications Applications Conference
dc.relation.ispartof2009 IEEE 17TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE, VOLS 1 AND 2
dc.subjectComputer Science
dc.subjectEngineering
dc.subjectTelecommunications
dc.titleMultiple Base Station Placement with k-means Local
dc.typeProceedings Paper
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar