List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
A New Paradigm for Load Balancing in WMNs
Full text
 PDF(232.2KB)
Source 
International Journal of Computer Networks (IJCN)
Table of Contents
Download Complete Issue    PDF(3.03MB)
Volume:  3    Issue:  4
Pages:  NULL
Publication Date:   September / October 2011
ISSN (Online): 1985-4129
Pages 
239 - 246
Author(s)  
 
Published Date   
05-10-2011 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   Wireless Mesh Networks, Load Balancing, Clustering, Bottleneck 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Scribd
2. Google Scholar
3. Docstoc
 
 
In this paper, we address the problem of load balancing in Wireless Mesh Networks. We consider a Cluster Based Wireless Mesh Architecture in which the WMN is divided into clusters that could minimize the updating overhead during topology change due to mobility of mesh nodes or congestion of load on a cluster. Each cluster contains a gateway that has complete knowledge about group memberships and link state information in the cluster. The gateway is often elected in the cluster formation process. We consider load of gateways and try to reduce it. As a matter of fact when a gateway undertakes to be an interface for connecting nodes of a wireless mesh network to other networks or internet, there would be some problems such as congestion and bottleneck, so we introduce a new paradigm for these problems. For solving bottleneck we use clustering to reduce load of gateways and after that by use of dividing cluster we prevent from bottleneck on gateways. We study how to detect congestion on a gateway and how can reduce loads of it that preventing from bottleneck on gateway and therefore increasing throughput of network to encountering many loads. So we propose an algorithm to detect bottleneck and remedies for load balancing in Wireless Mesh Networks. We also use Ns2-Emultion for implementing and testing the framework. Some qualitative results are provided to prove the correctness and the advantages of our framework.  
 
 
 
1 J. Bicket, D. Aguayo, S. Biswas, R. Morris, Architecture and evaluation of an unplanned 802.11b mesh network, in: Proceedings of the 11th ACM Annual International Conference on Mobile Computing and Networking (MobiCom), ACM Press, Cologne, Germany, 2005, pp. 31–42.
2 B. Aoun, R. Boutaba, Y. Iraqi, and G. Kenward, “Gateway Placement Optimization in Wireless Mesh Networks with QoS Constraints,” IEEE Journal on Selected Areas in Communications, vol. 24, Nov 2006.
3 A.K.Hasan, A. A. Zaidan, A. Majeed, B. B. Zaidan, R. Salleh, O. Zakaria, and A. Zuheir, “Enhancement Throughput of Unplanned Wireless Mesh Networks Deployment Using Partitioning Hierarchical Cluster (PHC)”, World Academy of Science, Engineering and Technology 54 2009
4 I.F.Akyildiz, X.Wang, W.Wang,” Wireless mesh networks: a survey”, Elsevier ,Computer Networks 47 (2005) 445–487
5 K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, “Impact of interference on multihop wireless network performance,” in Proceeding of ACM MobiCom, 2003.
6 I. Akyildiz and X. Wang, "A survey on wireless mesh networks," IEEE Communication Magazine, vol. 43, no.9, pp.s23-s30,Sep. 2005.
7 B.S. MANOJ AND RAMESH R. RAO ,” WIRELESS MESH NETWORKING”, Chapter 8 : Load Balancing in Wireless Mesh Networks, page 263
8 Saumitra M. Das, Himabindu Pucha and Y. Charlie Hu School of Electrical and Computer Engineering Purdue University, West Lafayette, “Mitigating the Gateway Bottleneck via Transparent Cooperative Caching in Wireless Mesh Networks” NSF grants CNS-0338856 and CNS-0626703.
9 Jangeun Jun and Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina State University Raleigh,”The Nominal Capacity of Wireless Mesh Networks” NC 27695-7911
10 Abu (Sayeem) Reaz1, Vishwanath Ramamurthi1, Dipak Ghosal1, John Benko2, Wei Li2, Sudhir Dixit3, and Biswanath Mukherjee1 ,”Enhancing Multi-hop Wireless Mesh Networks with a Ring Overlay”
11 G. Horton, "A multi-level diffusion method for dynamic load balancing", Parallel Computing. 19 (1993), pp. 209-229
12 I. Akyildiz, X. Wang, W. Wang, ''Wireless Mesh Networks: A Survey'', Computer Networks Journal 47, (Elsevier), March 2005. pp. 445-487.
13 “The network simulator - ns2”,http://www.isi.edu/nsnam/ns/.
14 Daniel Mahrenholz and Svilen Ivanov, "Real-Time Network Emulation with ns-2," Proceedings of The 8-th IEEE International Symposium on Distributed Simulation and Real Time Applications, Budapest Hungary, October 21-23, 2004
15 M. Shahverdy, M. Fathy, S. Yousefi, “Scheduling Algorithm for Vehicle to Road- Side Data Distribution”, ICHCC-ICTMF 2009, Berlin Heidelberg, CCIS 66, pp. 22– 30, 2010.
 
 
 
 
 
 
 
 
Mohammad Shahverdy : Colleagues
Misagh Behnami : Colleagues
Mahmood Fathy : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.