Mosharaka for Research and Studies
Login/Sign Up
Main Menu
Papers Menu
Quick Links
Next Congress
Congresses

All Forthcoming Congresses

Conferences

All Forthcoming Conferences

Update on Thursday, 21 October 2021: Paper 16.Cnf-118@MIC-CCA 2011 reaches 744 views and 210 downloads.
Papers Links
  • Browse
  • Subjects
  • Years
  • MCWC
  • GC-MCWC 2006
  • 1.Cnf-130
Papers Published at GC-MCWC 2006
All 7 Papers
IDAuthors and TitlePages
1.Cnf-1

GS Citations

Dr. Baber Aslam
Dr. Muhammad H. Islam
Dr. Shoab Khan
802.11 disassociation DoS attack and its solutions: a survey
1-6
1.Cnf-2

GS Citations

Dr. Baber Aslam
Dr. Muhammad H. Islam
Dr. Shoab Khan
Pseudo randomized sequence number based solution to 802.11 disassociation denial of service attack
7-12
1.Cnf-3

GS Citations

Dr. Maurizio Bocca
Mr. Cristian Galperti
Dr. Reino Virrankoski
Prof. Heikki Koivo
Estimating the number of persons in an unknown indoor environment by applying wireless acoustic sensors and blind signal separation
13-18
1.Cnf-6

GS Citations

Ms. Carmen Beatriz Rodriguez Estrello
Dr. Felipe A. Cruz-PĂ©rez
Dr. Genaro Hernandez-Valdez
System level model for the wireless channel unreliability in mobile cellular networks
19-24
1.Cnf-8 Prof. Marco Avvenuti
Prof. Paolo Corsini
Dr. Paolo Masci
Dr. Alessio Vecchio
Increasing the efficiency of preamble sampling protocols for wireless sensor networks
25-30
1.Cnf-70 Dr. Athanasios Doukas
Dr. Grigorios Kalivas
A Novel Blind Delay Spread Estimation Using Frequency Correlation for Wireless OFDM Systems
31-34
1.Cnf-73

GS Citations

Prof. Arwa Zabian
Power management mechanism for routing in ad-hoc wireless networks
35-40
1.Cnf-130 Paper View Page
Title Load Balanced Ad Hoc Routing Protocol
Authors Prof. Omar Al-Jarrah, Jordan University of Science and Technology, Irbid, Jordan
Mr. Musab S. Alhadrusi, Wayne State University, Detroit, MI, USA
Abstract Most of the routing algorithms in mobile ad hoc networks are based on the shortest path metric, which results in using the same path for several sessions. Consequently, nodes will lose their power, and their paths will eventually become invalid. This paper presents a new method for achieving better load balancing in mobile ad hoc networks. It targets load balancing at the routing layer of the Dynamic Source Routing Protocol (DSR). The new method proposes a new definition to the load metric and a new way to compute it. The load is defined in term of the relative time needed to process and forward packets in each node. Also, congestion is predicted and cured using a modified version of the Random Early Detection (RED) queue. A set of changes is applied to the DSR protocol to give the nodes the most recent information about the load within paths and neighborhoods. Simulation results show that the new method results in an overall enhancement of 37% in term of end to end delay when compared with the Load-Aware On-Demand Routing (LAOR) Protocol and the Load-Sensitive Routing for Mobile Ad Hoc Networks (LSR).
Track WCN: Wireless Communication Networks
Conference 1st Mosharaka International Conference on Mobile Computing and Wireless Communications (MIC-MCWC 2006)
Congress 2006 Global Congress on Mobile Computing and Wireless Communications (GC-MCWC 2006), 17-20 September 2006, Amman, Jordan
Pages --1
Topics Wireless Ad hoc Networks
Network Switching and Routing
ISSN 2227-331X
DOI
BibTeX @inproceedings{130MCWC2006,
title={Load Balanced Ad Hoc Routing Protocol},
author={Omar Al-Jarrah, and Musab S. Alhadrusi},
booktitle={2006 Global Congress on Mobile Computing and Wireless Communications (GC-MCWC 2006)},
year={2006},
pages={--1},
doi={}},
organization={Mosharaka for Research and Studies} }
Paper Views 37 Paper Views Rank 231/524
Paper Downloads 13 Paper Downloads Rank 371/524
GC-MCWC 2006 Visits: 20744||MIC-MCWC 2006 Visits: 16880||WCN Track Visits: 6922