Multiple Base Station Placement with k-means Local


TAYŞİ Z. C. , GÜVENSAN M. A. , YAVUZ A. G.

IEEE 17th Signal Processing and Communications Applications Conference, Antalya, Türkiye, 9 - 11 Nisan 2009, ss.178-181 identifier identifier

  • Doi Numarası: 10.1109/siu.2009.5136541
  • Basıldığı Şehir: Antalya
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.178-181

Özet

Sensor 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]