Abstract
One of the important aspects of MANET is the restraint of quantity of available energy in the network nodes that is the most critical factor in the operation of these networks. The tremendous amount of energy using the mobile nodes in wireless communication medium makes Energy Efficiency a fundamental requirement for mobile ad hoc networks. The cluster-based routing protocols are investigated in several research studies which encourage more well-organized usage of resources in controlling large dynamic networks. Clustering can be done for different purposes, such as, routing efficiency, transmission management, backbone management etc. Less flooding, distributed operation, locally repairing of broken routes and shorter sub-optimal routes are the main features of the Clustering protocol. In this paper, we present quantifiable analysis of energy efficient cluster-based routing protocol for uninterrupted stream queries.
Highlights
A variety of static clustering heuristics permits us to expertly identify group structures
Clustering technique exhibits a clustered structure based on intra-cluster density versus inter-cluster sparsity of edges and Random location of mobile nodes is generated according to a probabilistic model
Most generally, corresponding optimization problems are hard, heuristic clustering algorithms are used in practice, or other approaches which are not based on an objective function
Summary
A variety of static clustering heuristics permits us to expertly identify group structures. Clustering technique exhibits a clustered structure based on intra-cluster density versus inter-cluster sparsity of edges and Random location of mobile nodes is generated according to a probabilistic model. Formalizations of this notion lead to measures that quantify the quality of a clustering and to algorithms that find clustering. For a weighted graphG = (V,E, ω), the weightω(θ)of the cut is defined as. For a graphG = (V, E, ω),and a clusteringζ the conductance for thecut θ = (C, V\C)is defined as. For a graph G = (V, E), and a clustering C (ζ)intercluster-conductance is defined as www.ijacsa.thesai.org. An associated node may hear from several ClusterHeads and have several host Clusters; its host ClusterHeads are implicitly listed in the HELLO messages it broadcasts
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
