Energy-Efficient Multi-Level and Distance-Aware Clustering Mechanism for WSNs

[EN] Most sensor networks are deployed at hostile environments to sense and gather specific information. As sensor nodes have battery constraints, therefore, the research community is trying to propose energyefficient solutions for wireless sensor networks (WSNs) to prolong the lifetime of the network. In this paper, we propose an energy-efficient multi-level and distance-aware clustering (EEMDC) mechanism for WSNs. In this mechanism, the area of the network is divided into three logical layers, which depends upon the hop-count-based distance from the base station. The simulation outcomes show that EEMDC is more energy efficient than other existing conventional approaches.This work has been partially supported by the 'Ministerio de Ciencia e Innovacion', through the 'Plan Nacional de I+D+i 2008-2011' in the 'Subprograma de Proyectos de Investigacion Fundamental', project TEC2011-27516, and by the Polytechnic University of Valencia, through the PAID-15-11 multidisciplinary projectsMehmood, A.; Khan, S.; Shams, B.; Lloret, J. (2015). Energy-Efficient Multi-Level and Distance-Aware Clustering Mechanism for WSNs. International Journal of Communication Systems. 28(5):972-989. https://doi.org/10.1002/dac.2720S972989285Sendra, S., Lloret, J., Garcia, M., & Toledo, J. F. (2011). Power Saving and Energy Optimization Techniques for Wireless Sensor Neworks (Invited Paper). Journal of Communications, 6(6). doi:10.4304/jcm.6.6.439-459Bri D Garcia M Lloret J Dini P Real deployments of wireless sensor networks Third International Conference on Sensor Technologies and Applications (SENSORCOMM 2009) 2009 8 23GUI, L., VAL, T., & WEI, A. (2011). A Novel Two-Class Localization Algorithm in Wireless Sensor Networks. Network Protocols and Algorithms, 3(3). doi:10.5296/npa.v3i3.863Rajeswari, A., & P.T, K. (2011). A Novel Energy Efficient Routing Protocols for Wireless Sensor Networks Using Spatial Correlation Based Collaborative Medium Access Control Combined with Hybrid MAC. Network Protocols and Algorithms, 3(4). doi:10.5296/npa.v3i4.1296Lloret, J., Garcia, M., Tomás, J., & Boronat, F. (2008). GBP-WAHSN: A Group-Based Protocol for Large Wireless Ad Hoc and Sensor Networks. Journal of Computer Science and Technology, 23(3), 461-480. doi:10.1007/s11390-008-9147-6Lloret, J., Garcia, M., Bri, D., & Diaz, J. (2009). A Cluster-Based Architecture to Structure the Topology of Parallel Wireless Sensor Networks. Sensors, 9(12), 10513-10544. doi:10.3390/s91210513LEHSAINI, M., GUYENNET, H., & FEHAM, M. (2010). Cluster-based Energy-efficient k-Coverage for Wireless Sensor Networks. Network Protocols and Algorithms, 2(2). doi:10.5296/npa.v2i2.325Liu, G., Xu, B., & Chen, H. (2011). Decentralized estimation over noisy channels in cluster-based wireless sensor networks. International Journal of Communication Systems, 25(10), 1313-1329. doi:10.1002/dac.1308Cheng, L., Chen, C., Ma, J., & Shu, L. (2011). Contention-based geographic forwarding in asynchronous duty-cycled wireless sensor networks. International Journal of Communication Systems, 25(12), 1585-1602. doi:10.1002/dac.1325Wang, X., & Qian, H. (2011). Hierarchical and low-power IPv6 address configuration for wireless sensor networks. International Journal of Communication Systems, 25(12), 1513-1529. doi:10.1002/dac.1318Zhang, D., Yang, Z., Raychoudhury, V., Chen, Z., & Lloret, J. (2013). An Energy-Efficient Routing Protocol Using Movement Trends in Vehicular Ad hoc Networks. The Computer Journal, 56(8), 938-946. doi:10.1093/comjnl/bxt028Chen, J.-S., Hong, Z.-W., Wang, N.-C., & Jhuang, S.-H. (2010). Efficient Cluster Head Selection Methods for Wireless Sensor Networks. Journal of Networks, 5(8). doi:10.4304/jnw.5.8.964-970Peiravi, A., Mashhadi, H. R., & Hamed Javadi, S. (2011). An optimal energy-efficient clustering method in wireless sensor networks using multi-objective genetic algorithm. International Journal of Communication Systems, 26(1), 114-126. doi:10.1002/dac.1336Zeynali, M., Mollanejad, A., & Khanli, L. M. (2011). Novel hierarchical routing protocol in wireless sensor network. Procedia Computer Science, 3, 292-300. doi:10.1016/j.procs.2010.12.050Heinzelman W Chandrakasan A Balakrishnan H Energy-efficient communication protocol for wireless microsensor networks 33rd Hawaii International Conference on System Sciences (HICSS) 2000 3005 3014Wang, A., Yang, D., & Sun, D. (2012). A clustering algorithm based on energy information and cluster heads expectation for wireless sensor networks. Computers & Electrical Engineering, 38(3), 662-671. doi:10.1016/j.compeleceng.2011.11.017Gou H Yoo Y An energy balancing LEACH algorithm for wireless sensor networks Proceedings of the 7th International Conference on Information Technology: New Generations (ITNG) 2010Ding, P., Holliday, J., & Celik, A. (2005). Distributed Energy-Efficient Hierarchical Clustering for Wireless Sensor Networks. Lecture Notes in Computer Science, 322-339. doi:10.1007/11502593_25Bandyopadhyay S Coyle E An energy-efficient hierarchical clustering algorithm for wireless sensor networks The 32nd IEEE International Conference on Computer Communication (INFOCOM 2003) 2003Jarry, A., Leone, P., Nikoletseas, S., & Rolim, J. (2011). Optimal data gathering paths and energy-balance mechanisms in wireless networks. Ad Hoc Networks, 9(6), 1036-1048. doi:10.1016/j.adhoc.2010.11.003Zhu, Y., Wu, W., Pan, J., & Tang, Y. (2010). An energy-efficient data gathering algorithm to prolong lifetime of wireless sensor networks. Computer Communications, 33(5), 639-647. doi:10.1016/j.comcom.2009.11.008Khamfroush H Saadat R Khademzadeh A Khamfroush K Lifetime increase for wireless sensor networks using cluster-based routing International Association of Computer Science and Information Technology-Spring Conference (IACSIT-SC 2009) 2009Li, H., Liu, Y., Chen, W., Jia, W., Li, B., & Xiong, J. (2013). COCA: Constructing optimal clustering architecture to maximize sensor network lifetime. Computer Communications, 36(3), 256-268. doi:10.1016/j.comcom.2012.10.006Aslam N Phillips W Robertson W Sivakumar S A multi-criterion optimization technique for energy efficient cluster formation in wireless sensor networks 4th IEEE Consumer Communications and Networking Conference, (CCNC 2007) 2007 650 654Yi, S., Heo, J., Cho, Y., & Hong, J. (2007). PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks. Computer Communications, 30(14-15), 2842-2852. doi:10.1016/j.comcom.2007.05.034Yong, Z., & Pei, Q. (2012). A Energy-Efficient Clustering Routing Algorithm Based on Distance and Residual Energy for Wireless Sensor Networks. Procedia Engineering, 29, 1882-1888. doi:10.1016/j.proeng.2012.01.231Chuan-Chi W A minimum transmission energy consumption routing protocol for user-centric wireless networks 2011 1143 1148Kumar, D., Aseri, T. C., & Patel, R. B. (2009). EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks. Computer Communications, 32(4), 662-667. doi:10.1016/j.comcom.2008.11.025Kim KT Moon SS Tree-Based Clustering (TBC) for energy efficient wireless sensor networks IEEE 24th International Conference on Advanced Information Networking and Applications Workshops (WAINA) 2010 680 685Yu, J., Qi, Y., Wang, G., & Gu, X. (2012). A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution. AEU - International Journal of Electronics and Communications, 66(1), 54-61. doi:10.1016/j.aeue.2011.05.002Ye M Li C Wu J EECS: an Energy Efficient Clustering Scheme in wireless sensor networks 24th IEEE International Performance on Computing, and Communications Conference 2005 535 540Gautama N Lee W Pyun J Dynamic clustering and distance aware routing protocol for wireless sensor networks PE-WASUN'09 2009Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications, 1(4), 660-670. doi:10.1109/twc.2002.804190Lai, W. K., Fan, C. S., & Lin, L. Y. (2012). Arranging cluster sizes and transmission ranges for wireless sensor networks. Information Sciences, 183(1), 117-131. doi:10.1016/j.ins.2011.08.029Pantazis, N. A., Vergados, D. J., Vergados, D. D., & Douligeris, C. (2009). Energy efficiency in wireless sensor networks using sleep mode TDMA scheduling. Ad Hoc Networks, 7(2), 322-343. doi:10.1016/j.adhoc.2008.03.006OMNeT++ Community Documentation and Tutorials of omnet++ http://www.omnetpp.org/Castallia Documentation and Tutorials of Castalia Simulator for WSN and BAN http://castalia.research.nicta.com.au/index.php/en/Research Group on Computer Networks and Multimedia Communication UFPA - Brazil Download-Leach-v2-for-Castalia http://www.gercom.ufpa.br/index.php?option=com_filecabinet&view=files&id=1&Itemid=31&lang=p

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Hearing the clusters in a graph: A distributed algorithm

We propose a novel distributed algorithm to cluster graphs. The algorithm recovers the solution obtained from spectral clustering without the need for expensive eigenvalue/vector computations. We prove that, by propagating waves through the graph, a local fast Fourier transform yields the local component of every eigenvector of the Laplacian matrix, thus providing clustering information. For large graphs, the proposed algorithm is orders of magnitude faster than random walk based approaches. We prove the equivalence of the proposed algorithm to spectral clustering and derive convergence rates. We demonstrate the benefit of using this decentralized clustering algorithm for community detection in social graphs, accelerating distributed estimation in sensor networks and efficient computation of distributed multi-agent search strategies

From carbon nanotubes and silicate layers to graphene platelets for polymer nanocomposites

In spite of extensive studies conducted on carbon nanotubes and silicate layers for their polymer-based nanocomposites, the rise of graphene now provides a more promising candidate due to its exceptionally high mechanical performance and electrical and thermal conductivities. The present study developed a facile approach to fabricate epoxy–graphene nanocomposites by thermally expanding a commercial product followed by ultrasonication and solution-compounding with epoxy, and investigated their morphologies, mechanical properties, electrical conductivity and thermal mechanical behaviour. Graphene platelets (GnPs) of 3.5

Distributed Object Tracking Using a Cluster-Based Kalman Filter in Wireless Camera Networks

Local data aggregation is an effective means to save sensor node energy and prolong the lifespan of wireless sensor networks. However, when a sensor network is used to track moving objects, the task of local data aggregation in the network presents a new set of challenges, such as the necessity to estimate, usually in real time, the constantly changing state of the target based on information acquired by the nodes at different time instants. To address these issues, we propose a distributed object tracking system which employs a cluster-based Kalman filter in a network of wireless cameras. When a target is detected, cameras that can observe the same target interact with one another to form a cluster and elect a cluster head. Local measurements of the target acquired by members of the cluster are sent to the cluster head, which then estimates the target position via Kalman filtering and periodically transmits this information to a base station. The underlying clustering protocol allows the current state and uncertainty of the target position to be easily handed off among clusters as the object is being tracked. This allows Kalman filter-based object tracking to be carried out in a distributed manner. An extended Kalman filter is necessary since measurements acquired by the cameras are related to the actual position of the target by nonlinear transformations. In addition, in order to take into consideration the time uncertainty in the measurements acquired by the different cameras, it is necessary to introduce nonlinearity in the system dynamics. Our object tracking protocol requires the transmission of significantly fewer messages than a centralized tracker that naively transmits all of the local measurements to the base station. It is also more accurate than a decentralized tracker that employs linear interpolation for local data aggregation. Besides, the protocol is able to perform real-time estimation because our implementation takes into consideration the sparsit- - y of the matrices involved in the problem. The experimental results show that our distributed object tracking protocol is able to achieve tracking accuracy comparable to the centralized tracking method, while requiring a significantly smaller number of message transmissions in the network