Hotspot Clustering for Ad Hoc Network
The adaptive clustering algorithm proposed by Gerla is purely based on geographical location freedom degree and plus time freedom degree, so its two dimensional. In this paper, three dimensional clustering based on data flow is proposed. Three freedom degrees, data flow, the diameter of clusters, and time, are considered in the course of cluster establishment to solve hotspot phenomena. Hotspots are highly congested regions in Ad Hoc networks that can result in packet loss, end to end delay and out of order packets delivery. Through constructing clusters around hotspots, data flow coming to hotspots can be distributed to other nodes in the cluster with alternative route to the destination. Then it can mitigate congestion of hotspots and improve performance of wireless Ad Hoc network. Results from simulations on the OMNET++ platform show that various QoS indicators of the network get improved by use of hotspot clustering algorithm.And resource distribution of the whole network emerge as equalibrium effects.
Ad Hoc networks clustering hotpot AODV Multi-agent
JING Xu ZHANG Jing
Computer & Control College, Harbin University of Science & Technology Harbin 150080, China
国际会议
武汉
英文
705-709
2005-09-23（万方平台首次上网日期，不代表论文的发表时间）