Mobile Ad-Hoc Networks (MANETs) are infrastructure-less networks that are rapidly deployable and self-configuring and do not need central support. MANETs consist of a group of mobile nodes that act either as a router or as a host. Nodes in these netw
ork move rapidly and randomly, causing a continuous change in network topology.
The routing in the network and choosing the best path between nodes are major issues that attract the attention of researchers in the field of mobile networks, because of the importance of the routing process and its impact on network performance. This paper focuses on improving the performance of the proactive OLSR protocol in order to choose the best routing path that achieves the least time delay in the network, secures the best packet delivery rate and ensures reducing packet loss during the transmission process. The ant colony algorithm was used to choose the best path based on two main factors , namely the path length and the occupancy of the nodes within the path. Our simulation scenarios are built using NS2.35 to test the performance of the improved protocol in terms of increasing the number of nodes in the network and increasing the speed of nodes in the network. The test results show a reduction in the time delay in the network and an increase in the packet delivery rate.
We will see in the following study:
•The importance of wireless sensor networks and their applications
•The importance of quality of service in particular، reducing energy consumption
•The need for a simple routing protocol that minimizes energy consumption as much as possible، and we will count on LEACH
•Improve the quality of service offered by the LEACH protocol by studying several scenarios for improvement
Mobile wireless networks consist of a set of cooperative and
mobile nodes, each node can move randomly at a specific speed
in all directions without any control of a central manager. This type
of networks has become a hot research topic due to its
military
application and suitability for emergencies and natural disasters.
Due to the lack of fixed infrastructure, the routing process
becomes the major problem in this type of networks, where the
responsibility of routing is transferred to each node. Over the last
few years, a number of traditional routing protocols has been
proposed, but these protocols do not support quality of service in
different environments.
Some studies have improved some of these protocols to support
quality of service for specific environments. This research
identifies and analysis some of these improved protocols.
The dynamic clustering-based hierarchical routing protocols are one of the methods
used to save energy and increase the lifetime of wireless sensor networks, however, that
most of the researches are neglecting the energy expended in election of the
heads and
formation of clusters in the network.
In this paper, we examine the overhead energy caused by hierarchical routing
protocols based on dynamic clustering and study its impact on the stability period of the
wireless sensor networks. Also, we proposed a solution to limit this energy by reducing the
consumed energy in election of heads and clusters formation operations. It is shown
through the simulation results that the energy consumed in LEACH setup phase decreases
the stability period of these networks and increases the number of dead nodes. And the use
of the proposed solution reduced the energy consumption during the election of the heads
and the formation of clusters clearly compared to the normal way followed in LEACH,
which has increased stability period and the number of live nodes in the network.
The low cost, ease of deployment has exposed WSNs an attractive choice for numerous applications,like environmental monitoring applications , security applications, real time tracking, and so on.
But in reality, these networks are operated on batte
ry with limitations in their computation capabilities, memory, bandwidth ,so they called networks with resource constrained nature, and this impels various challenges in its design and its performance.
Limited battery capacity of sensor nodes makes energy efficiency a major and challenge problem in wireless sensor networks. Thus, the routing protocols for wireless sensor networks must be energy efficient in order to maximize the network lifetime.
In this paper we simulated LEACH,SEP,DEEC,TEEN routing protocols and evaluated their performance by comparing with DT routing protocol in Homogeneous and Heterogeneous Wireless Sensor Networks on MATLAB.
Real-time multimedia transport over MANET has stringent bandwidth, delay, and loss requirements. It is
a great challenge to support such applications in wireless ad hoc networks, which are characterized by
frequent link failures, congestion, and lack of central administration.
