This document presents a novel rebroadcast technique called Neighbor Coverage based Probabilistic Rebroadcast (NCPR) protocol to reduce routing overhead in mobile ad hoc networks. The NCPR protocol calculates a rebroadcast delay based on the number of common neighbors between nodes to prioritize dissemination of neighbor information. It also calculates a rebroadcast probability based on additional neighbor coverage ratio and connectivity factor to reduce unnecessary rebroadcasts while maintaining network connectivity. The protocol is implemented by enhancing the AODV routing protocol in NS-2 to reduce overhead from hello packets and neighbor lists in route requests. Its performance is evaluated under varying network sizes, traffic loads, and packet loss conditions.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink).In LEACH, a TDMA-based MAC protocol is integrated with clustering and a simple “routing” protocol. The goal of LEACH is to lower the energy consumption required to create and maintain clusters or to use the energy of the nodes in such a manner so as to improve the life time of a wireless sensor network. In this paper we are presenting an overview of the different protocol changes made in LEACH to improve network lifetime, throughput, coverage area of network etc.
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
Clustering based Time Slot Assignment Protocol for Improving Performance in U...journal ijrtem
Recently, numerous approaches have been proposed for designing medium access control (MAC)
in underwater acoustic networks (UANs). Some of those works tried to adapt MAC protocols proposed for
terrestrial networks. However, unique environmental characteristics of UANs make the MAC protocols hard to be
used in the UANs and degrade network performance. In order to improve network performance, COD-TS MAC
protocol was proposed. COD-TS focuses on both single hop and multi-hop mode and utilizes CDMA for
exchanging schedule information between cluster heads. COD-TS has shortcomings such as collisions, additional
energy consumption by exchanging schedule information and near-far effect of CDMA. To overcome above
shortcomings, we propose a clustering-based time slot assignment protocol. In the proposed protocol, nodes are
clustered, and each cluster head performs two-hop neighbor cluster discovery operation. And then, a cluster head
obtains its own relative position information. Finally, the cluster head assigns its own time slot for data
transmission based on the information. Simulation results show that the proposed protocol has always better
performance compared to the COD-TS.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
In MANET, the mobiles nodes are connected dynamically with the help of wireless links without
having a fixed infrastructure or centralized administration. These nodes move freely and organize
themselves arbitrarily thus change the network topology rapidly and unpredictably. As a result, there exits
frequent link breakages which leads to path failures and route discoveries. The route discovery can lead to
overhead which cannot be neglected. Therefore, the fundamental challenge of MANET is to develop a
dynamic routing protocol that efficiently establish routes to deliver the packets with minimum overhead,
high throughput and low end to end delay. In order to handle overhead issues, the proposed system has
presented a novel scheme rebroadcast delay and a rebroadcast probability which will help to reduce the
number of retransmissions thereby improving routing performance. In addition, the proposed system is
compared with existing routing protocol AODV in terms of packet delivery ratio, packet loss and end to
end delay
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink).In LEACH, a TDMA-based MAC protocol is integrated with clustering and a simple “routing” protocol. The goal of LEACH is to lower the energy consumption required to create and maintain clusters or to use the energy of the nodes in such a manner so as to improve the life time of a wireless sensor network. In this paper we are presenting an overview of the different protocol changes made in LEACH to improve network lifetime, throughput, coverage area of network etc.
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
Clustering based Time Slot Assignment Protocol for Improving Performance in U...journal ijrtem
Recently, numerous approaches have been proposed for designing medium access control (MAC)
in underwater acoustic networks (UANs). Some of those works tried to adapt MAC protocols proposed for
terrestrial networks. However, unique environmental characteristics of UANs make the MAC protocols hard to be
used in the UANs and degrade network performance. In order to improve network performance, COD-TS MAC
protocol was proposed. COD-TS focuses on both single hop and multi-hop mode and utilizes CDMA for
exchanging schedule information between cluster heads. COD-TS has shortcomings such as collisions, additional
energy consumption by exchanging schedule information and near-far effect of CDMA. To overcome above
shortcomings, we propose a clustering-based time slot assignment protocol. In the proposed protocol, nodes are
clustered, and each cluster head performs two-hop neighbor cluster discovery operation. And then, a cluster head
obtains its own relative position information. Finally, the cluster head assigns its own time slot for data
transmission based on the information. Simulation results show that the proposed protocol has always better
performance compared to the COD-TS.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
In MANET, the mobiles nodes are connected dynamically with the help of wireless links without
having a fixed infrastructure or centralized administration. These nodes move freely and organize
themselves arbitrarily thus change the network topology rapidly and unpredictably. As a result, there exits
frequent link breakages which leads to path failures and route discoveries. The route discovery can lead to
overhead which cannot be neglected. Therefore, the fundamental challenge of MANET is to develop a
dynamic routing protocol that efficiently establish routes to deliver the packets with minimum overhead,
high throughput and low end to end delay. In order to handle overhead issues, the proposed system has
presented a novel scheme rebroadcast delay and a rebroadcast probability which will help to reduce the
number of retransmissions thereby improving routing performance. In addition, the proposed system is
compared with existing routing protocol AODV in terms of packet delivery ratio, packet loss and end to
end delay
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
Improved aodv based on energy strength and dropping ratioIJLT EMAS
Wireless Sensor Networks are the latest trends in the
market due to the demand for communication and networking
among the wireless network devices. The routing protocols are
used in the Wireless Sensor Networks for efficient
communication of data between sensor nodes. The designs of
routing protocols in Wireless Sensor Networks are very concern
because they are influenced by many challenging factors. To
design the networks, the factors needed to be considered are the
coverage area, mobility, energy power consumption,
communication capabilities etc.. Broadcasting is an inevitable
operation in the route discovery phase of AODV protocol. A
probability based AODV is proposed, it uses nodes remaining
energy and threshold random delay to generate the
rebroadcasting of route request packet. The route request packet
of AODV is modified to gather nodes remaining energy strength.
The performance of probability based AODV is compared with
AODV over packet delivery fraction, normalized routing
overhead, delay and average acquisition latency.
NS-2 based simulator is used to evaluate the performance of
routing protocol.
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
An Effective and Scalable AODV for Wireless Ad hoc Sensor Networksijcnes
Appropriate routing protocol in data transfer is a challenging problem of network in terms of lower end-to-end delay in delivery of data packets with improving packet delivery ratio and lower overhead as well. In this paper we explain an effective and scalable AODV (called as AODV-ES) for Wireless Ad hoc Sensor Networks (WASN) by using third party reply model, n-hop local ring and time-to-live based local recovery. Our goal is to reduce time delay for delivery of the data packets, routing overhead and improve the data packet delivery ratio. The resulting algorithm AODV-ES is then simulated by NS-2 under Linux operating system. The performance of routing protocol is evaluated under various mobility rates and found that the proposed routing protocol is better than AODV.
Energy Saving DSR and Probabilistic Rebroadcast Mechanism are used to Increas...IJTET Journal
Abstract- MANETs are infrastructure less and can be set up anytime anywhere. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data broadcasting mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem and without consider the nodes energy level of route selection it leads to reduce the network lifetime. In this paper proposed to focus is on a two mechanism ESDSR and Neighbor coverage based Probabilistic rebroadcast to overcome those problems. A Energy Saving Dynamic Source Routing in MANETs (ESDSR) which will efficiently utilize the battery power consideration in the route selection time of mobile nodes in such a way that the network will get more life time and Neighbor coverage based Probabilistic rebroadcast mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. The simulation was carried out using the NS-2 network simulator.
Detecting Good Neighbor Nodes and Finding Reliable Routing Path Based on AODV...IOSR Journals
Wireless operations allow services, such as long-range communications, that are impossible or
impractical to implement with the use of wires. It is supported by well-liked technique known as Adhoc Protocol
[1]. The term is commonly used in the telecommunications industry to refer to telecommunications systems e.g.
radio transmitters and receivers, remote controls etc. which use some form of energy e.g. radio waves, acoustic
energy, etc. to transfer information without the use of wires.[1] Information is transferred in this manner over
both short and long distances.In this, routes may be detached due to lively movement of nodes. So route
assortment and topology grouping is not easy and demanding issue. This type of networks is more vulnerable to
both internal and external attacks due to presence of wicked neighbour nodes[1][2s. Paper see the sights new
method using AODV protocol to find out good neighbour node and finding reliable path according to their
signal strength, flow capacity relative position of node in network.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
Abstract : As the network size increases the probability of congestion occurrence at nodes increases. This is because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses. In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing (IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput and packet delivery fraction. Keywords- DSDV, Hybrid protocol, AODV, IAODV, MANET
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc NetworksIJCNCJournal
When packets are sending in multi-hop mobile unintended networks numerous problems occur like flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of packets simultaneously in MANETs that using the slot assignments approach, when additional channels are transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the mobile ad hoc network for collision control and reliable communication. This paper proposes two new broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced performance within the different environments. Evaluation of simulation results with other well-known exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best within the wireless network and channel bandwidths are well utilized within the network.
Similar to A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks (20)
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
1. IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 12, Issue 6 (Jul. - Aug. 2013), PP 01-09
www.iosrjournals.org
www.iosrjournals.org 1 | Page
A Novel Rebroadcast Technique for Reducing Routing Overhead
In Mobile Ad Hoc Networks
Vinayak T. Patil 1
, Asst.Prof. Padma. S. Dandannavar 2
Department of Computer Science and EngineeringKLS Gogte Institute of Technology, Belgaum-59008, INDIA.
Abstract- In mobile ad hoc networks (MANETs), the network topology changes frequently and unpredictably
due to the arbitrary mobility of nodes. This feature leads to frequent path failures and route reconstructions,
which causes an increase in the routing control overhead. The overhead of a route discovery cannot be
neglected. Thus, it is imperative to reduce the overhead of route discovery in the design of routing protocols of
MANETs. One of the fundamental challenges of MANETs is the design of dynamic routing protocols with good
performance and less overhead. In a route discovery, broadcasting is a fundamental and effective data
dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets
unless it has a route to the destination, and thus it causes the broadcast storm problem. This paper focuses on a
probabilistic rebroadcast protocol based on neighbor coverage to reduce the routing overhead in MANETs.
Keywords - Mobile Ad Hoc Networks, Neighbor Coverage, and Network Connectivity, Probabilistic
Rebroadcast, Routing Overhead, AODV.
I. Introduction
Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link
breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot
be neglected. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism,
where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the
destination, and thus it causes the broadcast storm problem [1, 5]. In our implementation some broadcasting
techniques are used to reduce the overhead of Hello packets and neighbor list in the RREQ packet. In order to
reduce the overhead of Hello packets, we do not use periodical Hello mechanism. Since a node sending any
broadcasting packets can inform its neighbors of its existence, the broadcasting packets such as RREQ and route
error (RERR) can play a role of Hello packets. To reduce the overhead of Hello packets: Only when the time
elapsed from the last broadcasting packet (RREQ, RERR, or some other broadcasting packets) is greater than
the value of Hello Interval, the node needs to send a Hello packet. The value of Hello Interval is equal to that of
the original AODV.
II. Literature Review
The routing overhead occurred because of the dissemination of routing control packets such as RREQ
packets can be quite huge, especially when the network topology frequently changes. Traditional on-demand
routing protocols produce a large amount of routing traffic by blindly flooding the entire network with RREQ
packets during route discovery. Recently, the issue of reducing the routing overhead associated with route
discovery and maintenance in on demand routing protocols has attracted increasing attention.
Huang [2] proposed a methodology of dynamically adjusting the Hello timer and the Timeout timer
according to the conditions of the network. For example, in a high mobility network (with frequent topology
changes) it is desirable to use small values for the timers to quickly detect the changes in the network. On the
other hand, in a low mobility network where the topology remains stable and with few changes, a large value for
the timers is more effective to reduce the overhead. In order to decide whether the mobility of the network is
high or low, we use a simple way to approximate in real time of the link change rate. The reduction of the
overhead is greatly achieved with the minimal cost of slightly increasing the drop rate in data traffic. While the
packet loss increases around 1%, the overhead reduction reaches 40%.
Ould-Khaoua[4]proposed two new probabilistic route discovery method, called Adjusted Probabilistic
route discovery(AP) and Enhance Adjusted Probabilistic route discovery (EAP) which addresses the broadcast
storm problem in the existing on-demand routing protocols. The forwarding probability is determined by taking
into account about the local density of the sending node. In order to reduce the routing overhead without
degrading the network throughput in dense networks, the forwarding probability of nodes located in sparse areas
is set high while it is set low at nodes located in dense areas. EAP-AODV reduces overhead by 71% while
APAODV reduces the overhead by 55%.
2. A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
www.iosrjournals.org 2 | Page
Aminu[6] proposed a rebroadcast probability function which takes in to account about the value of the packet
counter together with some key simulation parameters(i.e. network topology size, transmission range and
number of nodes) to determine the appropriate rebroadcast probability for a given node. The rebroadcast
probability of a node is computed based on these parameters. Compared to the other schemes, simulation results
have revealed that counter Function achieved superior saved rebroadcast (about 20% better than its closest
competitor i.e., counter-based scheme, in dense network) and end-to-end delay (around 26% better than counter-
based scheme in dense network) without sacrificing reach ability in medium and dense networks.
III. Neighbor Coverage Based Probabilistic Rebroadcast (NCPR) Protocol
This paper proposes neighbor coverage based probabilistic rebroadcast protocol [1] which combines
both neighbor coverage and probabilistic methods. In order to effectively exploit the neighbor coverage
knowledge, we need a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain a
more accurate additional coverage ratio. In order to keep the network connectivity and to reduce the redundant
retransmissions, we need a metric named connectivity factor to determine how many neighbors should receive
the RREQ packet [9]. After that, by combining the additional coverage ratio and the connectivity factor, we
introduce rebroadcast probability, which can be used to reduce the number of rebroadcasts of the RREQ packet
and to improve the routing performance.
3.1 Rebroadcast Delay
We proposed a scheme to calculate the rebroadcast delay. The rebroadcast delay is to determine the
forwarding order. The node which has more common neighbors with the previous node has the lower delay. If
this node rebroadcasts a packet, then more common neighbors will know this fact [10]. Therefore, this
rebroadcast delay enables the information about the nodes which have transmitted the packet to more neighbors,
which is the key success for the proposed scheme.
When a node ni receives an RREQ packet from its previous node s, node s can use the neighbor list in
the RREQ packet to estimate how many its neighbors have not been covered by the RREQ packet . If node ni
has more neighbors uncovered by the RREQ packet from s, which means that if node ni rebroadcasts the RREQ
packet, the RREQ packet can reach more additional neighbor nodes.
To sufficiently exploit the neighbor coverage knowledge, it should be disseminated as quickly as
possible. When node s sends an RREQ packet, all its neighbors ni, i = 1, 2 …receive and process the RREQ
packet. We assume that node nk has the largest number of common neighbors with node s, node nk has the
lowest delay. Once node nk rebroadcasts the RREQ packet, there are more nodes to receive the RREQ, because
node nk has the largest number of common neighbors. Node nk rebroadcasts the RREQ packet depends on its
rebroadcast probability calculated in the next subsection. The objective of this rebroadcast delay is not to
rebroadcast the RREQ packet to more nodes, but to disseminate the neighbor coverage knowledge more quickly.
After determining the rebroadcast delay, the node can set its own timer.
3.2 Rebroadcast Probability
We also proposed a novel scheme to calculate the rebroadcast probability. The scheme considers the
information about the uncovered neighbors, connectivity metric and local node density to calculate the
rebroadcast probability. The rebroadcast probability is composed of two parts: a) additional coverage ratio,
which is the ratio of the number of nodes that should be covered by a single broadcast to the total number of
neighbors, and b) connectivity factor, which reflects the relationship of network connectivity and the number of
neighbors of a given node. The node which has a larger rebroadcast delay may listen to RREQ packets from the
nodes which have lowered one [9]. We do not need to adjust the rebroadcast delay because the rebroadcast delay
is used to determine the order of disseminating neighbor coverage knowledge. When the timer of the
rebroadcast delay of node ni expires, the node obtains the final uncovered neighbor set. The nodes belonging to
the final uncovered neighbor set are the nodes that need to receive and process the RREQ packet. Note that, if a
node does not sense any duplicate RREQ packets from its neighborhood, its uncovered neighbor set is not
changed, which is the initial uncovered neighbor set. Now we study how to use the final uncovered neighbor set
to set the rebroadcast probability. The metric Ra indicates the ratio of the number of nodes that are additionally
covered by this rebroadcast to the total number of neighbors of node ni. The nodes that are additionally covered
need to receive and process the RREQ packet. As Ra becomes bigger, more nodes will be covered by this
rebroadcast, and more nodes need to receive and process the RREQ packet, and, thus, the rebroadcast
probability should be set to be higher.
Xue [7] derived that if each node connects to more than 5.1774 log n of its nearest neighbors, then the
probability of the network being connected is approaching 1 as n increases, where n is the number of nodes in
the network. Then we can use 5.1774 log n as the connectivity metric of the network. We assume the ratio of the
number of nodes that need to receive the RREQ packet to the total number of neighbors of node ni is Fc(ni).If
3. A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
www.iosrjournals.org 3 | Page
the local node density is low, the parameter Fc increases the rebroadcast probability, and then increases the
reliability of the NCPR in the sparse area. If the local node density is high, the parameter Fc could further
decrease the rebroadcast probability, and then further increases the efficiency of NCPR in the dense area. Thus,
the parameter Fc adds density adaptation to the rebroadcast probability.
In this section, we calculate the rebroadcast delay and rebroadcast probability of the proposed protocol.
We use the upstream coverage ratio of an RREQ packet received from the previous node to calculate the
rebroadcast delay, and use the additional coverage ratio of the RREQ packet and the connectivity factor to
calculate the rebroadcast probability in our protocol, which requires that each node needs its 1-hop
neighborhood information.
Fig. 3.1 Flow Diagram Of Protocols
Fig 3.1shows the flow diagram of protocols in this model enhancing of AODV protocol at Mac layer
will be done.
Algorithm
The formal description of the Neighbor Coverage based Probabilistic Rebroadcast (NCPR) for reducing routing
overhead in route discovery is shown in algorithm [12].
Definitions:
RREQv: RREQ packet received from node v.
Rv.id: the unique identifier (id) of RREQv.
N(u): Neighbor set of node u.
U(u, x): Uncovered neighbors set of node u for RREQ whose id is x.
Timer(u, x): Timer of node u for RREQ packet whose id is x.
{Note that, in the actual implementation of NCPR protocol,every different RREQ needs a UCN set and a
Timer.}
1: if ni receives a new RREQs from s then
2: {Compute initial uncovered neighbors set U(ni,Rs.id) for RREQs:}
3: U(ni,Rs.id) = N(ni) − [N(ni) ∩ N(s)] − {s}
4: {Compute the rebroadcast delay Td(ni):}
5: Tp(ni) = 1 − |N(s)∩N(ni)|
|N(s)|
6: Td(ni) = MaxDelay × Tp(ni)
7: Set a Timer(ni,Rs.id) according to Td(ni)
8: end if 9:
10: while ni receives a duplicate RREQj from nj before Timer(ni,Rs.id) expires do
11: {Adjust U(ni,Rs.id):}
12:U(ni,Rs.id)=(ni,Rs.id)−[U(ni,Rs.id)∩N(nj )]
13: discard(RREQj );
14: end while
15:
16: if Timer(ni,Rs.id) expires then
17: {Compute the rebroadcast probability Pre(ni):}
18: Ra(ni) = |U(ni,Rs.id)|
4. A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
www.iosrjournals.org 4 | Page
|N(ni)|
19: Fc(ni) = Nc
|N(ni)|
20: Pre(ni) = Fc(ni) · Ra(ni)
21: if Random(0,1) ≤ Pre(ni) then
22: broadcast(RREQs)
23: else
24: discard(RREQs)
25: end if
26: end if
IV. Protocol Implementation and Performance Evaluation
4.1 Protocol Implementation
We enhance the source code of AODV at MAC in NS-2 to implement our proposed protocol. The
proposed NCPR protocol needs Hello packets to obtain the neighbor information, and also needs to carry the
neighbor list in the RREQ packet. Therefore, in our implementation, some techniques are used to reduce the
overhead of Hello packets and neighbor list in the RREQ packet, which are described as follows In order to
reduce the overhead of Hello packets; we do not use periodical Hello mechanism. Since a node sending any
broadcasting packets can inform its neighbors of its existence, the broadcasting packets such as RREQ and route
error (RERR) can play a role of Hello packets. In order to reduce the overhead of neighbor list in the RREQ
packet, each node needs to monitor the variation of its neighbor table and maintain a cache of the neighbor list
in the received RREQ packet. For sending or forwarding of RREQ packets, the neighbor table of any node ni
has the following 3 cases:
1)If the neighbor table of node ni adds at least one new neighbor nj , then node ni sets the num neighbors to a
positive integer, which is the number of listed neighbors, and then fills its complete neighbor list after the num
neighbors field in the RREQ packet.
2) If the neighbor table of node ni deletes some neighbors, then node ni sets the num neighbors to a negative
integer, which is the opposite number of the number of deleted neighbors, and then only needs to fill the deleted
neighbors after the num neighbors field in the RREQ packet;
3) If the neighbor table of node ni does not vary, node ni does not need to list its neighbors, and set the num
neighbors to 0.The nodes which receive the RREQ packet from node ni can take their actions according to the
value of num neighbors in the received RREQ packet:
1) If the num neighbors is a positive integer, the node substitutes its neighbor cache of node ni according to the
neighbor list in the received RREQ packet;
2) If the num neighbors is a negative integer, the node updates its neighbor cache of node ni and deletes the
deleted neighbors in the received RREQ packet;
3) If the num neighbor is 0, the node does nothing. Because of the two cases 2) and 3), this technique can reduce
the overhead of neighbor list listed in the RREQ packet.
We evaluate the performance of routing protocols using the following performance metrics:
Normalized routing overhead: the ratio of the total packet size of control packets (include RREQ,
RREP, RERR and Hello) to the total packet size of data packets delivered to the destinations. For the control
packets sent over multiple hops, each single hop is counted as one Transmission. To preserve fairness, we use
the size of RREQ packets instead of the number of RREQ packets, because the protocols include a neighbor list
in the RREQ packet and its size is bigger than that of the original AODV.
Packet delivery ratio: the ratio of the number of data packets successfully received by the CBR
destinations to the number of data packets generated by the CBR sources.
Average end-to-end delay: the average delay of successfully delivered CBR packets from source to
destination node. It includes all possible delays from the CBR sources to destinations.
The experiments are divided to three parts, and in each part we evaluate the impact of one of the
following parameters on the performance of routing protocols:
Number of nodes: We vary the number of nodes from 50 to 300 in a fixed field to evaluate the impact
of different network density. In this part, we set the number of CBR connections to 15, and do not introduce
extra packet loss.
Number of CBR connections: We vary the number of randomly chosen CBR connections from 10 to
20 with a fixed packet rate to evaluate the impact of different traffic load. In this part, we set the number of
nodes to 150, and also do not introduce extra packet loss.
5. A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
www.iosrjournals.org 5 | Page
Random packet loss rate: We use the Error Model provided in the NS-2 simulator to introduce packet
loss to evaluate the impact of random packet loss. The packet loss rate is uniformly distributed, whose range is
from 0 to 0.1. In this part, we set the number of nodes to 150 and set the number of connections to 15.
4.2 Simulation parameters
Simulation parameters and scenarios which are used to investigate the performance of the proposed protocol.
Table 4.1
Simulation Parameter Value
Simulator NS-2 (v2.31)
Topology Size 1000m × 1000m
Number of Nodes 10,20,30
Transmission Range 250m
Bandwidth 2Mbps
Interface Queue Length 40
Traffic Type CBR
Number of CBR Connections 10, 12, ..., 15,
Packet Size 512 bytes
Packet Rate 4 packets/sec
Min Speed 1 m/s
Max Speed 5 m/s
V. Results
1. Performance with Varied Number of Nodes
Fig.5.1 Nodes vs. End-to-End Delay
Fig. 5.1 measures the average end-to-end delay of CBR packets received at the destinations with
increasing network density. The NCPR protocol decreases the average end-to end delay due to a decrease in the
number of redundant rebroadcasting packets. The redundant rebroadcast increases delay because 1) it incurs too
many collisions and interference, which not only leads to excessive packet drops, but also increases the number
of retransmissions in MAC layer so as to increase the delay; 2) it incurs too many channel contentions, which
increases the back off timer in MAC layer, so as to increase the delay.
Fig.5.2. Nodes vs. Packet delivery ratio
6. A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
www.iosrjournals.org 6 | Page
Fig. 5.2 shows the packet delivery ratio with increasing network density. The NCPR protocol can
increase the packet delivery ratio because it significantly reduces the number of collisions, so that it reduces the
number of packet drops caused by collisions.
Fig.5.3 Nodes vs. Routing Overhead
Fig. 5.3 shows the normalized routing overhead with different network density. The NCPR protocol
can significantly reduce the routing overhead incurred during the route discovery, especially in dense network.
Although the NCPR protocol increases the packet size of RREQ packets, it reduces the number of RREQ
packets more significantly. Then, the RREQ traffic is still reduced. In addition, for fairness, the statistics of
normalized routing overhead includes Hello traffic. Even so, the NCPR protocol still yields the best
performance, so that the improvement of normalized routing overhead is considerable.
2. Performance with Varied Number of CBR Connections
Fig.5.4 Number of CBR connection vs. End-to-End Delay
Fig. 5.4 measures the average end-to-end delay of CBR packets received at the destinations with
increasing traffic load. The end-to-end delay of the conventional AODV protocol significantly increases with
the increase of traffic load, which is the same as the MAC collision rate and routing overhead. When the traffic
load is heavy, by reducing the redundant rebroadcast, NCPR protocols alleviate the channel congestion and
reduce the retransmissions at MAC layer, thus, to reduce the end-to-end delay.
7. A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
www.iosrjournals.org 7 | Page
Fig.5.5 Number of CBR connection vs. Packet delivery ratio
Fig. 5.5 shows the packet delivery ratio with increasing traffic load. As the traffic load increases, the
packet drops of the conventional AODV protocol without any optimization for redundant rebroadcast are more
severe. NCPR protocols increase the packet delivery ratio compared to the conventional AODV protocol,
because of the significantly reduce the number of collisions and then reduce the number of packet drops caused
by collisions.
Fig.5.6 Number of CBR connection vs. Routing overhead
Fig. 5.6 shows the normalized routing overhead with different traffic load. At very light traffic load (10
CBR connections), NCPR protocols have more routing overhead than the conventional AODV protocol. This is
because that the Hello packets and neighbor list in the RREQ packet add extra overhead, and the effect of
reducing redundant rebroadcast is not significant when traffic load is light. As the traffic load increases, the
routing overhead of the conventional AODV protocol significantly increases, but the overhead of the D NCPR
protocols is relatively smooth. By contrast, NCPR protocols reduce the routing overhead.
3. Performance with Varied Random Packet Loss Rate
Fig. 5.7 measures the average end-to-end delay of CBR packets received at the destinations with
increasing packet loss rate. Due to the increase of packet loss, the retransmissions caused by random packet loss
at MAC layer will increase so as to increase the end-to-end delay. NCPR protocols alleviate the channel
congestion and reduce the retransmissions caused by collision at MAC layer, thus, to have a lower end-to-end
delay than the conventional AODV protocol.
8. A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
www.iosrjournals.org 8 | Page
Fig.5.7 Random packet loss vs. End-to-End Delay
Fig.5.8 Random packet loss vs. Packet delivery ratio
Fig. 5.8 shows the packet delivery ratio with increasing packet loss rate. As the packet loss rate
increases, the packet drops of all the three routing protocols will increase. Therefore, all the packet delivery
ratios of the three protocols increase as packet loss rate increases. NCPR protocols do not exploit any robustness
mechanism for packet loss, but it can reduce the redundant rebroadcast, so as to reduce the packet drops caused
by collision.
Fig. 5.9 shows the normalized routing overhead with different packet loss rate. As the packet loss
increases, there will be more link breakages and route discoveries, and then there will be more routing overhead
(such as RREQ packets and RERR packets). On the other hand, the CBR connection using UDP protocol does
not have any retransmissions mechanism, thus, the CBR connections will drop more packets as packet loss rate
increases.
Fig.5.9Random packet loss vs. Routing overhead
By reducing redundant rebroadcast of RREQ packets, both NCPR protocols incur less routing overhead
than the conventional AODV protocol.
9. A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
www.iosrjournals.org 9 | Page
I. Conclusion
In this paper we proposed a Novel Rebroadcast Technique for Reducing Routing Overhead in Mobile
Ad Hoc Networks. This neighbor coverage knowledge includes additional coverage ratio and connectivity
factor. We proposed a new scheme to dynamically calculate the rebroadcast delay, which is used to determine
the forwarding order and more effectively exploit the neighbor coverage knowledge.
Simulation results show that the proposed protocol generates less rebroadcast traffic than Existing
protocol. Because of less redundant rebroadcast, the proposed protocol mitigates the network collision and
contention, so as to increase the packet delivery ratio and decrease the average end-to-end delay. The simulation
results also show that the proposed protocol has good performance when the network is in high-density or the
traffic is in heavy load.
In future, we can calculate the result for another performance matrix i.e. MAC collision rate. The
NCPR algorithm can be apply to DSR and results comparison can be done with AODV protocol.
References
[1] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” RFC 3561, 2003.
[2] D. Johnson, Y. Hu, and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad hoc Networks (DSR) for IPv4,” RFC
4728, 2007.
[3] H. AlAamri, M. Abolhasan, and T. Wysocki, “On Optimising Route Discovery in Absence of Previous Route Information in
MANETs,” Proc. of IEEE VTC 2009-Spring, pp. 1-5, 2009.
[4] X. Wu, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, “Routing Overhead as A Function of Node Mobility: Modeling
Framework and Implications on Proactive Routing,” Proc. of IEEE MASS’07, pp. 1-9, 2007.
[5] S. Y. Ni, Y. C. Tseng, Y. S. Chen, and J. P. Sheu. “The Broadcast Storm Problem in a Mobile Ad hoc Network,” Proc. of
ACM/IEEE MobiCom’99, pp. 151-162, 1999.
[6] Mohammed, M. Ould-Khaoua, L.M. Mackenzie, C. Perkins, and J. D. Abdulai, “Probabilistic Counter-Based Route Discovery for
Mobile Ad Hoc Networks,” Proc. of WCMC’09, pp. 1335-1339, 2009.
[7] Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. ACM MobiHoc’02, pp.
194-205, 2002.
[8] J. Kim, Q, Zhang, and D. P. Agrawal, “Probabilistic Broadcasting Based on Coverage Area and Neighbor Confirmation in Mobile
Ad hoc Networks,” Proc. of IEEE GLOBECOM’04, 2004.
[9] J. D. Abdulai, M. Ould-Khaoua, and L. M. Mackenzie, “Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks,”
Proc. Of IEEE Conference on Local Computer Networks, pp. 739-746, 2007.
[10] Network Simulator - ns-2 http://www.isi.edu/nsnam/ns/.
[11] J. D. Abdulai, M. Ould-Khaoua, L. M. Mackenzie, and A. Mohammed,“Neighbour Coverage: A Dynamic Probabilistic Route
Discovery for Mobile Ad hoc Networks,” Proc. of SPECTS’08, pp. 165-172, 2008
[12] F. Xue and P. R. Kumar, “The Number of Neighbors Needed for Connectivity of Wireless Networks,” Wireless Networks, vol. 10,
issue 2, pp. 169-181, 2004.