A Study of Optimal Path Availability Clustering Algorithm in Ad Hoc Network

Abstract

An optimal availability path clustering algorithm is proposed that can be used to select location of head node for context-awareness parameters in ad-hoc network. The head node of optimal location is important to conserve the energy according to the clustering in path routing algorithm. We have problems when routing to elect the relay node from the member node clustering for energy efficiency in protocols. The existing LEACH algorithm shows how to elect the head node among member node has probability energy distribution function based on the management of the head node that to sustain optional cycle. However the condition of the distance between relay node(u) and destination node (v) location including context-awareness parameters could not sufficient reflection. The factors using relay node could not adaptive relay node and could not containing the probability distribution function to select relay node location parameters in this case. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study define the location for context information status of node condition and the residual energy to choose the topology of structure adjacent nodes. This proposed Energy Conserving Optimal path Schedule (ECOPS) contextual information algorithm that has contributed topology protocols for head node selection. The algorithm content the head node replacement condition and select the candidate head node in the optimal path. This method has efficient energy conservation between the paths of the member nodes. The new head node election shows as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.KeywordsAd-hoc networkHierarchical cluster structurePositioningEnergy-efficientRouting pathMulti-hop