Passive Clustering for Efficient Energy Conservation in Wireless Sensor Network
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2013, Vol 4, Issue 1
Abstract
A wireless sensor network is a set of miniature nodes that consume little energy and route information to a base station. It will enable reliable monitoring of a wide variety of phenomena for civilian, military and medical applications. Almost any sensor network application requires some form of self-organisation to route information. Recent years many protocols for network self-organization and management have been proposed and being implemented. Hierarchical clustering algorithms are very important in increasing the network’s life time. The most important point in this algorithm is cluster head selection and cluster formation because a good clustering guarantees reliability, energy efficiency and load balancing in the network. In this paper, we will use the principles of passive clustering to propose a new mechanism for selecting clusterheads. This mechanism allows the election of an alternate for each cluster head and a dynamic balancing of the role of clusterhead to the alternate when leaving or failure. Thus, it provides several advantages network reliability, stability of clusters and reduces energy consumption among the sensor nodes. Comparison with the existing schemes such as Passive Clustering and GRIDS (Geographically Repulsive Insomnious Distributed Sensors) reveals that the mechanism for selecting an alternate for clusterhead nodes, which is the most important factor influencing the clustering performance, can significantly improves the network lifetime.
Authors and Affiliations
Abderrahim MAIZATE , Najib EL KAMOUN
Social Media Cyberbullying Detection using Machine Learning
With the exponential increase of social media users, cyberbullying has been emerged as a form of bullying through electronic messages. Social networks provides a rich environment for bullies to uses these networks as vul...
A Reversible Data Hiding Scheme for BTC-Compressed Images
This paper proposes a reversible data hiding scheme for BTC-compressed images. A block in the BTC-compressed image consists of a larger block-mean pixel and a smaller block-mean pixel. Two message bits are embedded into...
Computation of QoS While Composing Web Services
Composition of web services has emerged as a fast growing field of research since an atomic service in its entirety is not capable to perform a specific task. Composition of web services is a process where a set of web s...
New Criteria for Comparing Global Stochastic Derivative-Free Optimization Algorithms
For many situations, the function that best models a situation or data set can have a derivative that may be difficult or impossible to find, leading to difficulties in obtaining information about the optimal values of t...
Formal Method to Derive Interoperability Requirements and Guarantees
Interoperability among telecommunications systems, possibly by different vendors, is essential for both the development of many telecommunications networks, and today's civilization development. Interoperability testing...