作者: Soheil Ghiasi , Ankur Srivastava , Xiaojian Yang , Majid Sarrafzadeh
DOI: 10.3390/S20700258
关键词: Cluster analysis 、 Key distribution in wireless sensor networks 、 Optimization problem 、 Sensor node 、 Overhead (computing) 、 Computer science 、 Distributed computing 、 Mobile wireless sensor network 、 Wireless sensor network 、 Energy (signal processing)
摘要: Sensor networks is among the fastest growing technologies that have potential of changing our lives drastically. These collaborative, dynamic and distributed computing communicating systems will be self organizing. They capabilities distributing a task themselves for efficient computation. There are many challenges in implementation such systems: energy dissipation clustering being one them. In order to maintain certain degree service quality reasonable system lifetime, needs optimized at every stage operation. node another very important optimization problem. Nodes clustered together easily able communicate with each other. Considering as an parameter while imperative. this paper we study theoretical aspects problem sensor application optimization. We illustrate optimal algorithm nodes cluster (which has master) balanced total distance between master minimized. Balancing clusters needed evenly load on all nodes. Minimizing helps reducing communication overhead hence dissipation. This call k-clustering) modeled mincost flow which can solved optimally using existing techniques.