Recently, the “big dat” emerged as a hot topic because of the tremendous growth of the Information and Communication Technology (ICT). One of the highly anticipated key contributors of the big data in the future networks is the distributed Wireless Sensor Networks (WSNs). Although the data generated by an individual sensor may not appear to be significant, the overall data generated across numerous sensors in the densely distributed WSNs can produce a significant portion of the big data. Energy-efficient big data gathering in the densely distributed sensor networks is, therefore, a challenging research area. One of the most effective solutions to address this challenge is to utilize the sink node’s mobility to facilitate the data gathering. While this technique can reduce energy consumption of the sensor nodes, the use of mobile sink presents additional challenges such as determining the sink node’s trajectory and cluster formation prior to data collection. In this paper, we propose a new mobile sink routing and data gathering method through network clustering based on modified Expectation- Maximization (EM) technique. In addition, we derive an optimal number of clusters to minimize the energy consumption. The effectiveness of our proposal is verified through numerical results.
Clustering algorithms, Wireless sensor networks, Mobile communication, Information management, Data handling, Data storage systems, Energy consumption, Big data,
Ryu Miura, "Towards Energy Efficient Big Data Gathering in Densely Distributed Sensor Networks", IEEE Transactions on Emerging Topics in Computing, , no. 1, pp. 1, PrePrints PrePrints, doi:10.1109/TETC.2014.2318177