IMPROVING POWER CHALLENGE IN QUALITY OF SERVICE OF MOBILE ADHOC NETWORK

0
599

ABSTRACT

A Mobile Ad hoc Network (MANET) is a network consisting of a set of mobile nodes capable of communicating with each other without base station. For Quality of Service (QoS) to be maintained, MANET must run consistently without power interruption. Also, the wireless network situation of MANET had made the QoS unpredictability less guaranteed and highly susceptible to errors.

MANETs are wireless networks that run usually on battery power. The power supplied by the battery is limited and tends to run out after a period of time. This poses a serious challenge for the nodes in MANETs. One major characteristic of the node is availability i.e., it should always be to receive and transmit communication to other nodes. If a node goes down, communication breaks down and the communication is disrupted. The availability of the nodes has an overall impact on the Quality of Service (QoS) that MANETs give. Once the nodes are not available when they are needed or if a node goes down while a communication is going on, thereby affecting the communication, the MANET is said to be unreliable, unpredictable and the QoS is said to be low tries to resolve the power challenge faced when using MANETs. The QoS of MANETs can only improve if the networks are working at their optimal capacity. This research would also cover current solutions for fixing the power problem and their effectiveness and also parts they are failing to address.

This research work proposed an energy efficient QoS enhancement scheme for mobile ad hoc network. The algorithm is inspired by particle swamp optimization technique with heuristic algorithm. QoS parameters that have been taken into consideration are throughput, delay, packet loss, and bandwidth utilisation.OPNET simulator has been used to evaluate the proposed concept.

Simulation results show that the packet increases from 20 to 1500 and the vehicular speed increases from 330v/h to 1300v/h. Hence, this result produces better result than the existing schemes.

The study concluded that three agents, namely message selection agent, message forwarding agent, and QoS factor calculating agent, have been introduced to govern and optimise the whole message transmission scheme. Through this method, a significant improvement in QoS factor can be achieved in comparison with the existing schemes.

Keywords: Mobile Ad Hoc Network, Nodes, Quality of Service(QoS), Hybrid Protocol, Packet loss, delay, loss, jitter, bandwidth,  battery power, throughput, OPNET.

ABBREVIATIONS

ABCO                                     Artificial Bee Colony Optimization

ACO                                       Ant Colony Optimization

AODV                                                Adhoc On demand Distance Vector Routing

AOMOV                                 AdhocOn Demand Multipath Distance Vector

AP                                           Access Point

AQEC                                     Adaptive Quorum Based Energy Conserving

ARPA                                     Advanced Research Projects Agency

ARQ                                       Automatic Repeat Request

BREQ                                     Bandwidth Request

BREP                                      Bandwidth Reply

BRP                                        Bandwidth Reservation Protocol

CBR                                        Constant Bit Rate

CBRP                                      Cluster Based Routing Protocol

CGPM                                     Communication Grounded Power Management

CHG                                       Clustered Head Gateway Node

CQPS                                      Consecutive Quorum Based Power Saving Protocol

CSMA                                     Carries Sense Multiple Access

DF                                           Distance Factor

DSDV                                     Destination Sequence Distance Vector

DSR                                        Dynamic Source Routing

EA                                           Energy Aware

ECBRP                                   Efficient Cluster Based Routing Protocol

ECMAC                                  Energy Conserving Medium Access Control

EF                                           Energy Factor

EPAR                                      Efficient Power Aware Routing

EOEDR                                  Extended Optimal Energy Drain Rate

ESSDSR                                 Efficient Energy Saving and Survival DSR

FAR                                        Flow Augmentation Routing

FEC                                         Forward Error Correction

FERA                                      Fair end to end Bandwidth Allocation

FSR                                         Fisheye State Routing

GA                                          Genetic Algorithm

GP                                           Genetic Programming

HARP                                     Hybrid Adhoc Routing Protocol

HQS                                        Hyper Quorum System

IEEE                                       Institute of Electrical and Electronic Engineers

IP                                            Internet Protocol

NC                                          Network Centrality

NIC                                         Network Interface Card

LAMP                                     Location Aware MAC Protocol

LAN                                        Local Area Network

LARI                                      Location Aided Routing Protocol

LEAR                                     Localized Energy Aware Routing

MAC                                       Medium of Access Control

MANET                                  Mobile Adhoc Network

MDR                                       Minimum Drain Rate

MESDSR                                Modified Energy Saving Dynamic Source Routing

MTPR                                     Minimum Transmission Power Routing

NCBPE                                   Normalized Current Best Performance

NS-2                                        Network Simulator-2

ODMRP                                  On Demand Multicast Routing Protocol

OFAA                                     Optimal Fully Adaptive Asynchronous

OLSR                                      Optimized Link State Routing

OMM                                      Online Maximum Minimum

PAMAS                                  Power Aware Multi Access

PBRP                                      Priority Based Bandwidth Reservation Protocol

PDP                                         Partial Dominant Prunning

PE                                           Power Equilibrium

PSO                                         Particle Swarm Optimization

QoS                                         Quality of Service

RF                                           Radio Frequency

RIP                                          Routing Information Protocol

SAGE                                     Semi Automatic Ground Environment

SHARP                                   Sharp Hybrid Adaptive Routing Protocol

SI                                            Swarm Intelligence

SIR                                          Signal to Interference Ratio

SP                                            Signomial Programming

SPPSO                                                Small Population PSO

SVM                                       Static Virtual Machine

TAODV                                  Tactical On Demand Distance Vector

TCP                                         Transmission Control Protocol

TF                                            Traffic Factor

TIRREP                                  Time Interval of RREP

TORA                                     Temporary Ordered Routing Algorithm

VANET                                  Vehicular Adhoc Network

WAN                                      Wide Area Network

WLAN                                                Wireless Local Area Network

WRP                                       Wireless Routing Protocol

ZRP                                         Zone Routing Protocol

CHAPTER ONE

INTRODUCTION

1.1       Background to the Study

The Mobile Adhoc Network (MANET) is a new network type which caters for the needs of the changing networking needs. It is the adhoc network of mobile devices. It is infrastructure less. Such networks may operate themselves or may be connected to the larger internet. Each device in MANET is free to move in any direction. The devices are being equipped with a router and must thus be in a position to transfer data whenever essential. The connection is, of course, wireless and the network may also be with limited range like LAN instead of connecting to the internet. The protocols to be used in MANET may differ, depending upon the capabilities of the devices, packet drop rate and other factors. There are various types of mobile adhoc networks depending on the location of these devices and the way in which they are used. Some of the popular types are (Attia, 2015):

VANET (Vehicular Ad hoc Network): This is when the devices are used to communicate between vehicles. It may also be used for communication between vehicles and roadside equipment. It can be used to transfer between newly web enabled devices on the road. IMANET: stands for internet based MANET. These are mobile ad hoc networks which link to the gateway device for the internet.

Energy-efficient broadcasting has been an attractive area of research in Mobile Ad hoc Networks (MANETs) characterized by high mobility and limited battery capacity. Probabilistic and counter-based broadcast methods are the proposed solutions suitable for high-mobility and secure MANET where the knowledge of the updated global/local topology is difficult or impossible to obtain.

In literature(Attia, 2016) several probabilistic and deterministic MANET broadcasting methods have been proposed:

1) Probabilistic methods do not require explicit neighbour information and comprise probability-based flooding, counter-based flooding, and area-based flooding. Probability-based flooding is similar to simple flooding except that nodes rebroadcast messages with probability p. Counter-based flooding exploits the fact that node local density is directed proportional to the number of received packets within a given interval. During a waiting delay, a node counts the number of times it receives the same message and then it decides if the message should be rebroadcasted. In area based flooding, each node selects its farther neighbour to retransmit broadcast messages. These kinds of methods are generally efficient but require the knowledge of the neighbour positions.

IMPROVING POWER CHALLENGE IN QUALITY OF SERVICE OF MOBILE ADHOC NETWORK