MAC Protocol for Ad Hoc Networks Using a Genetic Algorithm

The problem of obtaining the transmission rate in an ad hoc network consists in adjusting the power of each node to ensure the signal to interference ratio (SIR) and the energy required to transmit from one node to another is obtained at the same time. Therefore, an optimal transmission rate for each node in a medium access control (MAC) protocol based on CSMA-CDMA (carrier sense multiple access-code division multiple access) for ad hoc networks can be obtained using evolutionary optimization. This work proposes a genetic algorithm for the transmission rate election considering a perfect power control, and our proposition achieves improvement of 10% compared with the scheme that handles the handshaking phase to adjust the transmission rate. Furthermore, this paper proposes a genetic algorithm that solves the problem of power combining, interference, data rate, and energy ensuring the signal to interference ratio in an ad hoc network. The result of the proposed genetic algorithm has a better performance (15%) compared to the CSMA-CDMA protocol without optimizing. Therefore, we show by simulation the effectiveness of the proposed protocol in terms of the throughput

A New Media Access Control Protocol For VANET: Priority R-ALOHA (PR-ALOHA)

More practical applications of Media Access Control (MAC) protocols arise as the world turns increasingly wireless. Low delay, high throughput and reliable communication are essential requirements for standard performance in safety applications (e.g., lane changes warning, pre-crash warning and electronic brake lights). In particular, multi-priority protocols are important in Vehicular Ad Hoc Networks (VANETs), specifically in Inter-Vehicle Communication (IVC) where safety messages are given higher priority and transmitted faster than normal messages. The R-ALOHA protocol is considered one of the few promising protocols for VANETs because it is simple to implement and suitable for medium access control in Ad Hoc wireless networks. However, R-ALOHA lacks the property of prioritizing the different messages. In this dissertation, a new two-level priority MAC protocol called Priority R-ALOHA (PR-ALOHA) is presented to overcome the lack of priority problem in R-ALOHA. The two levels are low priority and high priority where priority is introduced by reserving specific time slots in the frame exclusively for high priority messages. This effectively increases the number of slots that a high priority message may compete for and thus decreases its delay. A two-dimensional Markov model coupled with Monte Carlo simulation is introduced to investigate the dynamic behavior of PR-ALOHA in steady and transient states. Modeling and simulation results of PR-ALOHA show that PR-ALOHA improves the performance of high priority traffic with limited effect on normal network traffic. Then, a dynamic slot allocation algorithm is introduced to PR-ALOH to optimize slot usage. Finally, a mobility model is introduced to emulate the behavior of the vehicles on the road where the performance of the PR-ALOHA with variable parameters, such as the length of the highway, the vehicle transmission range and the number of vehicles on the road have been investigated. Based on the findings of this dissertation, PR-ALOHA combined with dynamic slot allocation and mobility has a potential in applications like IVC where it can prevent car accidents through faster channel access and rapid transfer of warning messages to surrounding vehicles

Local Area Dynamic Routing Protocol: a Position Based Routing Protocol for MANET

A Mobile Ad Hoc Network (MANET) comprises mobile nodes (MNs), equipped with wireless communications devices; which form a temporary communication network without fixed network infrastructure or topology. The characteristics of MANET are: limited bandwidth; limited radio range; high mobility; and vulnerability to attacks that degrade the signal to noise ratio and bit error rates. These characteristics create challenges to MANET routing protocols. In addition, the mobility pattern of the MNs also has major impact on the MANET routing protocols. The issue of routing and maintaining packets between MNs in the mobile ad hoc networks (MANETs) has always been a challenge; i.e. encountering broadcast storm under high node density, geographically constrained broadcasting of a service discovery message and local minimum problem under low node density. This requires an efficient design and development of a lightweight routing algorithm which can be handled by those GPS equipped devices. Most proposed location based routing protocols however, rely on a single route for each data transmission. They also use a location based system to find the destination address of MNs which over time, will not be accurate and may result in routing loop or routing failure. Our proposed lightweight protocol, ‘Local Area Network Dynamic Routing’ (LANDY) uses a localized routing technique which combines a unique locomotion prediction method and velocity information of MNs to route packets. The protocol is capable of optimising routing performance in advanced mobility scenarios, by reducing the control overhead and improving the data packet delivery. In addition, the approach of using locomotion prediction, has the advantage of fast and accurate routing over other position based routing algorithms in mobile scenarios. Recovery with LANDY is faster than other location protocols, which use mainly greedy algorithms, (such as GPRS), no signalling or configuration of the intermediate nodes is required after a failure. The key difference is that it allows sharing of locomotion and velocity information among the nodes through locomotion table. The protocol is designed for applications in which we expect that nodes will have access to a position service (e.g., future combat system). Simulation results show that LANDY`s performance improves upon other position based routing protocols