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.