Dynamic Multi-Hop

Multi-hop routin is where cluster heads close to the base station functionaries as intermediate nodes for father cluster heads to relay the data packet from regular nodes to base station. Building such a backbone requires efficient clustering algorithms which aggregate network nodes into logical groups, each group being managed by a cluster head and any two neighboring clusters being interconnected by at least one gateway node or gateway path. In this concept G-hop clustering refers to cluster structures where cluster members are at most G hops away from their cluster head. Where as the dynamicity of mobile wireless network is often considered as the biggest challenge, in this work we explicitly exploit node mobility in order to support cluster formation and maintenance of G-hop clusters. Many protocols have been emerged for facing the problem of energy consumption in the wireless sensor network (WSN). Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is one of those protocols, which achieves a lot of spreading though. In this paper, dynamic multi-hop technique (DMHT-LEACH) protocols have been proposed based on the LEACH protocol.