Abstract: A mobile ad hoc network (MANET) is an infrastructure less, autonomous, and
standalone wireless network. The vision of mobile ad hoc network is to support
robust and efficient operation in mobile wireless networks by incorporating
routing functionality into mobile nodes. A mobile ad hoc network is the collection
of nodes which form the temporary network without the centralized body due to
constant changes in network topology. Each node in a MANET serves as a router
and performs mobility functionalities in an autonomous manner. Guaranteeing
delivery and the capability to handle dynamic connectivity are the most important
issues for routing protocols in mobile ad hoc networks. A number of routing
protocols have been proposed for this purpose like Ad Hoc On Demand Distance
Vector (AODV), Dynamic Source Routing (DSR) and Destination-Sequenced Distance Vector(DSDV). In this paper the Reactive protocols DSR and AODV as
well as a Proactive Protocol DSDV were studied and their characteristics with
respect to different mobility are analyzed based on packet delivery fraction,
routing load, end-to-end delay, number of packets dropped, throughput and jitter
using Network Simulator (NS2) .
Abstract: Abstract: Problem statement: Network wide broadcasting is an important function in Mobile Ad
Hoc Networks (MANET), which attempts to deliver packets from a source node to all other nodes in
the network. Broadcasting is often very useful for route discovery, naming, addressing and helping
multicast operations in all kinds of networks. For designing broadcast protocols for ad hoc networks,
one of the primary goal is to reduce the overhead (redundancy, contention and collision) while
reaching all the nodes in network. Approach: We had discussed many approaches in network wide
broadcasting namely flooding, probability based, area based, network knowledge and cluster based
broadcasting methods. The implementations and analysis will be made on Linux using the Network
Simulator NS2. Results: In this study, cluster based flooding algorithm had been proposed and its
metrics were namely routing load and packet delivery ratio was compared with two common flooding
algorithms namely simple flooding and probability based flooding. Conclusion/Recommendations: It
was concluded that simple flooding required each node to rebroadcast all packets. Probability based
methods used some basic understanding of network topology, assigning a probability to node to
rebroadcast. Cluster broadcasting algorithm for mobile ad hoc networks guaranteed to deliver
messages from a source node to all nodes of network.
Abstract: A Mobile Ad hoc Network (MANET) is an autonomous system of mobile nodes with routing
capabilities connected by wireless links, the union of which forms a communication network
modeled in the form of an arbitrary graph. The vision of Mobile Ad Hoc Network (MANET) is
wireless internet, where users can move anywhere anytime and still remaining connected with
the rest of the world. The main challenges in MANET are reliability, bandwidth and battery
power. The network has unpredictable characteristics such as its topology, signal
strengths fluctuates with environment and time, communication routes breaks and new
ones are formed dynamically. In this context, communication algorithms and protocols
should have very light in computational and storage needs in order to conserve energy and
bandwidth. Broadcasting is the process in which a source node sends a message to all
other nodes in MANET. Network wide broadcasting in Mobile Ad Hoc Network provides
important control and route establishment functionality for a number of unicast and multicast
protocols. Broadcasting in MANET poses more challenges than in wired networks due
to node mobility and scarce system resources. Broadcasting a packet to the entire network
is a basic operation and has extensive applications in mobile ad hoc networks (MANETs).
This paper presents an overview of the broadcasting techniques in mobile ad hoc networks,
and simulating the simple Flooding algorithm and Probability based flooding algorithm
using NS2 simulation.
Abstract: Mobile Ad hoc NETworks (MANETs) are wireless networks which are
characterized by dynamic topologies and no fixed infrastructure. Each node in a MANET is
a computer that may be required to act as both a host and a router and, as such, may be
required to forward packets between nodes which cannot directly communicate with one
another. Network wide broadcasting, simply referred to as “broadcasting” is the process in
which one node sends a packet to all other nodes in the MANET. Broadcasting used by
MANET unicast or multicast routing protocols to disseminate control information for
establishing the routes. For designing broadcast protocols for ad hoc networks, one of the
primary goal is to reduce the overhead (redundancy, contention and collision) while
reaching all the nodes in network. There are many approaches in network wide
broadcasting namely flooding, probability based, area based and cluster based broadcasting
methods. In this study, a novel density based flooding scheme has been proposed for more
reliable network broadcast in MANET and the metrics namely broadcast overhead(MAC
load), power consumption and collision are evaluated. The proposed method, density based
flooding guarantees to deliver the packets from a source node to all the nodes of the
network with minimum routing load, MAC load, less power consumption of a node and
collision. The performance evaluation of the proposed algorithm is compared with a single
source broadcasting techniques such as simple flooding algorithm and probability based
flooding algorithm using NS2 simulation. The proposed method, density based flooding for
probabilistic flooding limit the probability of collisions by limiting the number of
rebroadcasts in the network and prove that the broadcast overhead, power consumption and
collision of this method is very minimum compared with simple flooding and probabilistic
flooding methods.
