Link Stability-Based Clustering and Routing in Ad-Hoc Wireless Networks Using Fuzzy Set Theory

摘要: An ad-hoc wireless network has multihop architecture and is more mobile than single-hop in the real world. But some challenge with respect to mobility, real-time communication, routing path, maintenance, spatial reuse, bandwidth management, packets broadcast overhead. This paper investigates two important issues ensure stable path less re-clustering improve system performance. Novel Linked Stability-Based Clustering (LSC) Routing (LSR) algorithms, using fuzzy set theory, are proposed. The LSC algorithm guarantees stability of cluster reduce probability because cluster-head not easily replaced. proposed this reduces easy problem HCC by considering only connectivity but also link's signal strength between nodes obtained from a determination. membership function algorithm, based on strength, predicts link theory. Simulation results show that ensures avoids unnecessary re-clustering; for example, occurs frequently LID HC algorithms. Similarly, LSR uses sets functions mean relative movement nodes, obtain lifetime each connection lifetime, inferences rules reference. provides reliable transmission table-driven or on-demand approaches. reveal longer DSR, lower drop avoiding rerouting. higher number hoppings, it always finds most suitable without searching again new when paths drop.