Dynamic multi-hop clustering for mobile hybrid wireless networks

摘要: In mobile wireless networks communication is often improved by sending messages along a stable backbone of more reliable paths. Building such requires efficient clustering algorithms which aggregate network nodes into logical groups, each group being managed clusterhead and any two neighboring clusters interconnected at least one gateway node or path. this concept k-hop refers to cluster structures where members are most k hops away from their clusterhead. While the dynamicity considered as challenge, in work we explicitly exploit mobility order support formation maintenance clusters. The described KHOPCA algorithm consists set easy implement rules form maintain sized purely localized way. static limited constant number exchanges among nodes. dynamic nature promise fast convergence low complexity case triggered reconfiguration.