By Topic

Hotspot clustering for ad hoc network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jing Xu ; Coll. of Comput. & Control, Harbin Univ. of Sci. & Technol., China ; Zhang Jing

The adaptive clustering algorithm proposed by Gerla is purely based on geographical location freedom degree and plus time freedom degree, so it's 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 emerges as equilibrium effects.

Published in:

Wireless Communications, Networking and Mobile Computing, 2005. Proceedings. 2005 International Conference on  (Volume:2 )

Date of Conference:

23-26 Sept. 2005