By Topic

Design and Analysis of Mobility-Aware Clustering Algorithms for Wireless Mesh Networks

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
$33 $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

3 Author(s)
Nizar Bouabdallah ; INRIA, Rennes, France ; Rami Langar ; Raouf Boutaba

One of the major concerns in wireless mesh networks (WMNs) is the radio resource utilization efficiency, which can be enhanced by efficiently managing the mobility of users. To achieve this, we propose in this paper the use of mobility-aware clustering. The main idea behind WMN clustering is to restrict a major part of the exchanged signaling messages due to the mobility of users to a local area (i.e., inside a cluster). As such, less wireless links are used by the signaling messages, which reduces the resources occupied by a mobile user during its service and thus improves the total network capacity. Through analytical models and simulations, this work first identifies the cases where clustering is helpful. Building on these results, we propose two clustering schemes that take into consideration the mobility properties of the users in order to improve the WMN performance. We prove that both schemes can achieve significant gains in terms of radio resource utilization. Specifically, we show that the first scheme fits better both large and low-connected wireless mesh networks, whereas the second scheme is more suitable for both small to moderate and highly connected networks.

Published in:

IEEE/ACM Transactions on Networking  (Volume:18 ,  Issue: 6 )