Mobile wireless networks consist of a set of cooperative nodes. Each node can move at a specific speed randomly in all directions without any control of a central manager. Due to its military application and suitability for emergencies and natural disasters, this type of networks has become a hot research topic. The basic problem with routing in this type of networks is not existing fixed infrastructure which transfers the responsibility of routing to each node. To avoid the occurrence of congestion in the network is usually resort to scheduling algorithms. scheduling algorithms allow management of data and distribution of network resources and reduce process of deleting and neglecting packets caused by congestion. This paper presents in the first part a theoretical study of the main routing protocols in mobile wireless networks and evaluate the performance of these protocols. The second part presents the most important scheduling algorithms and the impact of these algorithms on the routing. The experimental results were obtained through the use of the Network Simulator NS2.
Al-Baath University Journal.
2015.
Students
Teachers
Graduates
Faculties