Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Mobile ad-hoc networks (MANETs) are particular type of networks in which the nodes mobility is quite high. No node can join or leave to the network any time as there is no centralized control and static infrastructure in MANETs. All nodes are considered to be equal in processing power. ant colony optimization basics
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
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.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Mobile ad-hoc networks (MANETs) are particular type of networks in which the nodes mobility is quite high. No node can join or leave to the network any time as there is no centralized control and static infrastructure in MANETs. All nodes are considered to be equal in processing power. ant colony optimization basics
Performance Evalution of MANET Routing Protocols using Reference Point Group ...ijasuc
An ad hoc network is often defined as an “infrastructureless” network, meaning a network without the
usual routing infrastructure like fixed routers and routing backbones. Typically, the ad hoc nodes are
mobile and the underlying communication medium is wireless. Each ad hoc node may be capable of acting
as a router.it’s charactrizied by multihop wireless connection and frequently changing networks.we
compare the performance of on-demand routing protocols for mobile ad-hoc networks are distributed
cache updating for the dynamic source routing protocol(DSR) and ad hoc on-demand distance vector
routing (AODV).the simulation model of the medium access control(MAC) layer is evaluting the
performance of MANET protocols.DSR and AODV protocols share similar behavours.we evalute the
both on demand protocols DSR and AODV based on packet delivery ratio , packet delivery latency,mobility
variation with total number of errors, packet and normalized routing overhead,end-to-end delay by varying
in node density.the performance and characterictics are explained by the graph models.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
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.
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 NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
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.
Gateway Forwarding Schemes For Manet-Internet Connectivityijsrd.com
In the real world one of the most important challenge for the broad implementation of mobile ad hoc network (MANET) technology is the finding way to capably interconnect them with the Internet. Yet, such interconnections are very difficult due to differences in mobility, addressing and routing between MANETs and reside IP networks. Imprecise address and routing techniques are hard to integrate. In this paper we propose the half tunnels as a powerful transition technique to integrate various networks. In this paper, we will also discuss some existing solutions like default routes host route etc to interconnect MANETs with the Internet, but on analysis we find them lacking in robustness and flexibility. For example, many solutions do not consider the presence of multiple gateways, and in such scenarios they either fail, or are less efficient due to the lack of multi-homing capabilities.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORKcscpconf
There are many routing approaches have been borrowed from mobile ad hoc network to achieve routing solutions in wireless mesh network. WMN was developed for reliable data communication and load balancing. AODV provides loop-free routes even while repairing broken links. This paper have been proposed an improved hierarchical AODV routing protocol
(IH-AODV), which exhibits better scalability and performance in the network. This IH-AODV protocol has been proposed for improvement in the scaling potential of AODV. MAODV allows
each node in the network to send out multicast data packets, used for multicast traffic. The wireless mesh network architecture provides reduction in installation cost, large scale
deployment, reliability and self management. It is mainly focused on implementing military or specialized civilian applications. Two protocols MAODV and IH-AODV were simulated using NS2 package. Simulation results will demonstrate that, IH-AODV scales well for large network
and other metrics are also better than or comparable to MAODV in hybrid WMNs.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
Flbra fuzzy logic based routing algorithm for indoor wireless sensor networksijcsit
Considering the context of building management systems with wireless sensor networks monitoring
environmental features, this paper presents a proposal of a Fuzzy Logic Based Routing Algorithm (FLBRA)
to determine the cost of each link and the identification of the best routes for packet forwarding. We
describe the parameters (Received Signal Strength Indicator - RSSI, Standard Deviation of the RSSI and
Packet Error Rate - PER) for the cost definition of each path, the sequence of identifying best routes and
the results obtained in simulation. As expected in this proposal, the simulation results showed an increase
in the packet delivery rate compared to RSSI-based forward protocol (RBF).
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IOSR Journal of Business and Management (IOSR-JBM) is an open access international journal that provides rapid publication (within a month) of articles in all areas of business and managemant and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications inbusiness and management. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
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 NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
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.
Gateway Forwarding Schemes For Manet-Internet Connectivityijsrd.com
In the real world one of the most important challenge for the broad implementation of mobile ad hoc network (MANET) technology is the finding way to capably interconnect them with the Internet. Yet, such interconnections are very difficult due to differences in mobility, addressing and routing between MANETs and reside IP networks. Imprecise address and routing techniques are hard to integrate. In this paper we propose the half tunnels as a powerful transition technique to integrate various networks. In this paper, we will also discuss some existing solutions like default routes host route etc to interconnect MANETs with the Internet, but on analysis we find them lacking in robustness and flexibility. For example, many solutions do not consider the presence of multiple gateways, and in such scenarios they either fail, or are less efficient due to the lack of multi-homing capabilities.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
MANET Routing Protocols , a case studyRehan Hattab
L. Yi, Y. Zhai, Y. Wang, J. Yuan and I. You , Impacts of Internal Network Contexts on Performance of MANET Routing Protocols: a Case Study, Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing,2012.
BETTER SCALABLE ROUTING PROTOCOL FOR HYBRID WIRELESS MESH NETWORKcscpconf
There are many routing approaches have been borrowed from mobile ad hoc network to achieve routing solutions in wireless mesh network. WMN was developed for reliable data communication and load balancing. AODV provides loop-free routes even while repairing broken links. This paper have been proposed an improved hierarchical AODV routing protocol
(IH-AODV), which exhibits better scalability and performance in the network. This IH-AODV protocol has been proposed for improvement in the scaling potential of AODV. MAODV allows
each node in the network to send out multicast data packets, used for multicast traffic. The wireless mesh network architecture provides reduction in installation cost, large scale
deployment, reliability and self management. It is mainly focused on implementing military or specialized civilian applications. Two protocols MAODV and IH-AODV were simulated using NS2 package. Simulation results will demonstrate that, IH-AODV scales well for large network
and other metrics are also better than or comparable to MAODV in hybrid WMNs.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
Flbra fuzzy logic based routing algorithm for indoor wireless sensor networksijcsit
Considering the context of building management systems with wireless sensor networks monitoring
environmental features, this paper presents a proposal of a Fuzzy Logic Based Routing Algorithm (FLBRA)
to determine the cost of each link and the identification of the best routes for packet forwarding. We
describe the parameters (Received Signal Strength Indicator - RSSI, Standard Deviation of the RSSI and
Packet Error Rate - PER) for the cost definition of each path, the sequence of identifying best routes and
the results obtained in simulation. As expected in this proposal, the simulation results showed an increase
in the packet delivery rate compared to RSSI-based forward protocol (RBF).
T HE I MPACT OF TCP C ONGESTION W INDOW S IZE ON THE P ERFORMANCE E VA...ijwmn
A mobile ad hoc network (MANET) is a temporary coll
ection of mobile nodes randomly moved within a
limited terrain area. The nodes are connected to fo
rm a wireless network without use any communication
infrastructure. Because of the limiting resources o
f MANET nodes, multiple hops
scheme is proposed for
data exchange
across the network. Varieties of mobile ad hoc rout
ing protocols have been developed to
support the multi-hop scheme of ad hoc networks. A
popular Transmission Control Protocol (TCP)
provides a reliable connection in a computer networ
k environment; it sets its congestion window size i
n
response to the behavior of the network to achieve
the best performance. This work aims to investigate
and
compare the MANET protocol
performance, such as DSDV, AODV and DSR in terms of
network
throughput, average routing load, the packet delive
ry ratio (PDR), and average end-to-end delay by
varying the maximum congestion window size. Our si
mulation has been implemented using a well-known
NS-2.35 network simulator. The simulated results sh
ow that the demonstrates of the concepts of MANET
routing protocols with respect to TCP congestion wi
ndow size in MANET environment
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IOSR Journal of Business and Management (IOSR-JBM) is an open access international journal that provides rapid publication (within a month) of articles in all areas of business and managemant and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications inbusiness and management. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
IOSR Journal of Applied Chemistry (IOSR-JAC) is an open access international journal that provides rapid publication (within a month) of articles in all areas of applied chemistry and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in Chemical Science. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
IOSR Journal of Applied Physics (IOSR-JAP) is an open access international journal that provides rapid publication (within a month) of articles in all areas of physics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in applied physics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
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.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
MANET is a cooperative wireless network in which mobile nodes are responsible for routing and
forwarding packets from and to other nodes. Noncooperation is a challenge that definitely degrades the
performance of MANET. A misbehaving or selfish node may make use of other nodes in the network, but
decline to share its own resources with them. These selfish nodes may severely affect the performance of
routing protocols in MANET.
In this paper, we compare the performance of four routing protocols under security attack of node
misbehavior in MANET. We investigate AODV and DSR reactive routing protocols and OLSR and GRP
proactive routing protocols using Riverbed Modeler simulator. The performance comparison is carried out
using two types of misbehaving nodes. The metrics used are End-to-End delay, Packet Delivery Ratio, Data
dropped and the Load. The experimental results show that AODV routing protocol performs better than the
other routing protocols with higher packet delivery ratio. Further, OLSR routing protocol outperforms the
other routing protocols with minimum End-to-End delay.
International Journal of Pharmaceutical Science Invention (IJPSI)inventionjournals
International Journal of Pharmaceutical Science Invention (IJPSI) is an international journal intended for professionals and researchers in all fields of Pahrmaceutical Science. IJPSI publishes research articles and reviews within the whole field Pharmacy and Pharmaceutical Science, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
E-Lins Technology provides an insight on routing. E-Lins Technology are the manufacturers and providers of the one of the best 3G/4G routers across the globe.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
In this paper, we proposed a replacement hybrid multipath routing protocol for
MANET known as Hybrid Multipath Progressive Routing Protocol for MANET (HMPRP),
during this work we improve the performance of accepted MANET routing protocols,
namely, the Ad-hoc On-demand Distance Vector routing protocol and use of their most
popular properties to formulate a replacement Hybrid routing protocol using the received
signal strength. The proposed routing protocol optimizes the information measure usage of
MANETs by reducing the routing overload and overhead. This proposed routing protocol
additionally extends the battery lifetime of the mobile devices by reducing the specified
variety of operations for (i) Route determination (ii) for packet forwarding. Simulation
results are used to draw conclusions regarding the proposed routing algorithm and
compared it with the AODV, OLSR, and ZRP protocol. Experiments carried out based on
this proposed algorithm, shows that better performance are achieved with regard to AODV,
OLSR, and ZRP routing algorithm in terms of packet delivery ratio, throughput, energy
consumed and end-to-end packet delay.
Multipath Fault Tolerant Routing Protocol in MANET pijans
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically
exchange data among themselves without the reliance on a fixed base station or a wired backbone network
and it the makes the routing a crucial issue to the design of the MANET. Multiple path routing protocols
are shown to be performance-effective alternatives over single-path routing for ad hoc networks and it
represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves
load balancing and is more resilient to route failures..In this paper we propose an energy efficient
multipath fault tolerant routing protocol to improve the reliability of data routing in Mobile ad hoc
networks. The proposed RFTA is a multi objective routing protocol that meets diverse application
requirements by considering the changing conditions of the network. The efficiency of the proposed
protocol has been evaluated on different scenarios and there has been a noticeable improvement in the
packet delivery ratio and also in the reduction of end-to-end delay comparing to SMR,SMS and MDSR.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
Vaccine management system project report documentation..pdfKamal Acharya
The Division of Vaccine and Immunization is facing increasing difficulty monitoring vaccines and other commodities distribution once they have been distributed from the national stores. With the introduction of new vaccines, more challenges have been anticipated with this additions posing serious threat to the already over strained vaccine supply chain system in Kenya.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
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.
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.
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.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRM
1. IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 11, Issue 1 (May. - Jun. 2013), PP 79-86
www.iosrjournals.org
www.iosrjournals.org 79 | Page
MDSR to Reduce Link Breakage Routing Overhead in MANET
Using PRM
N.Lalitha1
, L Surya Prasanthi Latike2
1
M.Tech, Assistant Professor,Department of Computer Science & Engineering, Sri Sarathi Institute of
Engineering & Technology, Nuzvid, AP,
2
M.Tech, Assistant Professor,Department of Information Technology, Sri Sarathi Institute of Engineering &
Technology, Nuzvid, AP,
Abstract: Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in
wireless ad hoc networks. Due to high mobility in ad-hoc network, route may not exit for long time. Hence, DSR
algorithm finds an alternative route when the existing communicating route goes down. It becomes a time
consuming process if the communicating route fails frequently. In order to avoid this, we propose a modification
to the existing DSR protocol named as Modified Dynamic Source Routing (MDSR) Protocol. In this paper, we
add a link breakage prediction algorithm to the Dynamic Source Routing (DSR) protocol. The mobile node uses
signal power strength from the received packets to predict the link breakage time, and sends a warning to the
source node of the packet if the link is soon-to-be-broken. The source node can perform a pro-active route
rebuild to avoid disconnection. Intermediate nodes in the route continuously monitor the signal strength at the
time of communication, based on a predefined threshold signal value. Intermediate node sends a message to the
source node that the route is likely to be disconnected, if signal strength falls below the threshold value. If
source receive this message it starts using backup route and if back route also fails then it finds alternative
route. The backup route will minimize the time consuming process of finding an alternative route to some extent.
Addition of link breakage prediction to DSR can significantly reduce the total number of dropped data packets
(by at least 25%). Security to the packets in the MANET is provided by employing a message encryption
technique using the concept of deceptive text which ensures confidentiality and authentication to the data.
KeyWords- Ad-Hoc Networks, Preemptive, Dynamic Source Routing, Proactive, Deceptive text, Randomized
hashing.
I. INTRODUCTION
There are currently two variations of mobile wireless networks. The first is known as infrastructure
network. The bridges for these networks are known as base stations. A mobile unit within these networks
connects to and communicates with, the nearest base station that is within its communication radius. As the
mobile unit travels out of range of one base station into the range of another, a "handoff" occurs from the old
base station to the new, allowing the mobile to be able to continue communication seamlessly throughout the
network. Typical applications of this type of network include office wireless local area networks (WLANs). The
second type of mobile wireless network is the mobile ad-hoc network or MANET. This type of network needs
no base station. Mobile nodes communicate to each other by either directly or through intermediate nodes. Ad-
hoc network becomes popular since it can be applied in many situations, such as emergency search-and-rescue
operations, classroom, meetings or conference and many more. To facilitate communication within the network,
routing protocols used to discover routes between nodes. Routing protocols in MANET, generally, can be
categorized as table-driven and on-demand. In table-driven (also called proactive protocol), like in most routing
protocol for wired network, each node is required to maintain routing table keep updated whether there is or not
a request for routes. In on-demand (also called as reactive protocol), each node seeks for routes only when there
is need to do so.
II. DYNAMIC SOURCE ROUTING
The Dynamic Source Routing (DSR) protocol is a simple and efficient routing protocol designed
specifically for use in multi-hop wireless ad hoc networks of mobile nodes. It is based on the concept of source
routing, a routing technique in which the sender of the packet determines the complete sequence of the nodes
through which to forward the packet. The sender explicitly lists this route in the packet’s header, identifying
each forwarding “hop” by the address of the next node to which to transmit the packet on its way to the
destination host.
The DSR protocol consists of two mechanisms: Route Discovery and Route Maintenance. When a
mobile node wants to send a packet to some destination, it first checks its route cache to determine whether it
already has a route to the destination. If it has one, it will use this route to send the packet. Otherwise, it will
2. MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRM
www.iosrjournals.org 80 | Page
initiate route discovery by broadcasting a route request packet. When receiving a request packet, a node appends
its own address to the route record in the route request packet if it did not receive this request message before,
and re-broadcasts the query to its neighbors. Alternatively, it will send a reply packet to the source without
propagating the query packet further if it can complete the query from its route cache. Furthermore, any node
participating in route discovery can learn routes from passing packets and gather this routing information into its
route cache.
When sending or forwarding a packet to a destination, Route Maintenance is used to detect if the network
topology has changed such that the link used by this packet is broken. Each node along the route, when
transmitting the packet to the next hop, is responsible for detecting if its link to the next hop has broken. When
the retransmission and acknowledgement mechanism detects that the link is broken, the detecting node returns a
Route Error packet to the source of the packet. The node will then search its route cache to find if there is an
alternative route to the destination of this packet. If there is one, the node will change the source route in the
packet header and send it using this new route. This mechanism is called “salvaging” a packet. When a Route
Error packet is received or overheard, the link in error is removed from the local route cache, and all routes
which contain this hop must be truncated at that point. The source can then attempt to use any other route to the
destination that is already in its route cache, or can invoke Route Discovery again to find a new route.
Fig: 1 DSR Route Request
III. Proactive Route Maintenance(Prm)
We assume that all nodes wishing to communicate with other nodes within the ad hoc network are
willing to participate fully in the protocols of the network. Each node participating in the network should also be
willing to forward packets for other nodes in the network. We refer to the minimum number of hops necessary
for a packet to reach from source to destination. We assume that he diameter of an ad-hoc network will be
small(5 to 10 hops), but greater than 1. Packets may be lost or corrupted in transmission on the ad-hoc wireless
network. A node receiving a corrupted packet can detect the error and discard the packet. The GPS and signal
strength methods both use physically measured parameters to predict the link status. The node with GPS can
know the position of itself directly. But GPS currently is not a standard component of mobile devices and in the
metropolitan area and indoor, the signal can be too weak to be received. The signal strength method only
consumes receiving node’s computing power, and does not depend on any additional device. It is used in this
paper. At first we assume that the sender power level is constant. Received signal power samples are measured
from packets received from the sender. From this information it is possible to compute the rate of change for a
particular neighbor’s signal power level. Because the signal power threshold for the wireless network interface
is fixed, the time when the power level drops below the acceptable value can be computed. Characteristics of
3. MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRM
www.iosrjournals.org 81 | Page
PRM include: Freshness. All nodes near an active route have the up-to-date routing information. Broken paths
are eliminated, new paths recognized, and non-optimal paths replaced by optimal ones.
Robustness: An active node that is forwarding data packets usually maintains several fresh alternative paths.
After one path fails, the data packet is usually forwarded via another path without causing packet loss or extra
delay. PRM will resort to a route discovery operation only after all alternative paths have failed.
Lightweight maintenance: Unlike in existing proactive routing protocols, the route maintenance is confined to
those small areas surrounding active routes, where control packets make only a small portion of data
transmission. As the lifetime of a route is lengthened, the overhead of the proactive route maintenance can be
compensated by the less frequent route discovery operations. The proposed Concept is illustrated using the
following example.
When a source node S want to send message to the destination node D, it initiates route discovery by
broadcasting the RREQ packet to its neighbors (A, E, F) as shown in Fig 3. The intermediate nodes (A, E, F) on
receive the RREQ packet rebroadcast the packet to its neighbors by appending its id in the route record of the
RREQ packet. Similarly, other intermediate nodes also forward the RREQ packet to the destination. When the
destination node D receives two or more RREQ packets from the same source through different routes, it finds
the two best routes based on the no of hopes. The route, which has least number of hopes. The route which has
least number of hops it becomes primary<S, F, G>, and second least number of hops route becomes backup
route<S, A, B, C>. The destination node D sends Route Reply (RREP) packet using the Primary (<S, F, G>) and
Backup(<S, A, B, C>) route as shown in the following Fig. Each RREP packet contains the Primary as well as
the Backup route information. When source node S receives first RREP packet form destination, it treats this is
the primary route and wireless communication is more error prone compared to wired network. To improve the
reliability we are sending route reply (primary + backup routes information) through the primary and the
secondary route. If any one packet gets corrupted at the time of transmission, source must be able to use the
other packet.
Primary Route <S.F.G> + {<S.A.B.C>}}
Backup Route {<S.A.B.C> + {<S.F.G>}}
The communication between the source node S and destination node D commence using the primary
path<S, F, G>. During communication, the node F starts moving away from S. When the signal strength of node
F falls below threshold T, it sends a warning message “Path likely to be disconnect” to source node S. As soon
as S receives the warning message, it starts using the Backup route along with primary route. Whenever
destination node receives the data packets from the source node through two different paths (Primary + Backup),
it sends acknowledgement through both the paths. If source node S receives an acknowledgement from the
destination node through the Backup route, it makes preemptive switch over to the Backup route; otherwise S
initiates the route discovery process.
4. MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRM
www.iosrjournals.org 82 | Page
A. Generating the Warning Message based on the Signal Strength
Let us consider the following scenario while using the Backup route.
Case 1: Node C is moving toward node G, as shown in Fig 4
As node C is moving towards node G, the signal strength increases and Backup route become more stable.
Case 2: Node C is moving away from node G, as shown in
Fig 5.
Fig.5
As node C is moving away from node G, the signal strength of C falls below the threshold T and as a
result the Backup route fails. Let p(0 ≤ p ≤ 1) is the probability of the route failure in case of DSR. In the best-
case p=0 and in the worst case p=1. Hence on an average case the probability of route failure p=0.5 (50%).
Similarly in the proposed Proactive routing in Dynamic Source Routing Protocol for Wireless Ad-hoc Networks
with Backup Route.
The probability of Primary route failure is p=0.5 (50%) ----(1)
The probability of backup route failure is p=0.5 (50%) ---- (2)
Form (1) and (2) we conclude that the probability of both the route failure p=0.25 (25%). Therefore,
Modified Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks with Backup Route has a
significant effect on the performance as it improves the reliability form 50% to 75% with minimal control
overhead. The threshold value plays an important role for control packet overhead.
Case 1: If threshold T is large: It may send false warning to source node to use backup route.
Case 2: If threshold T is small: Source node may not get sufficient time to discover new route, if backup route
fails. Therefore threshold T value is set moderate, to overcome above-mentioned drawbacks. A Preemptive
region is defined around every node as shown in the figure 6 for node A. As soon as node C enters the
preemptive region, a warning message is sent to the sender node A. Then the node A initiates a route discovery
process. With the establishment of a new route, data transmission is continued along this new route. The time
required to discover a new path can be termed as recovery time Trec. Hence the time between the warning and
the path break Twarn should be atleast or slightly greater than Trec.
In order to determine the optimal range, it is necessary to exchange the location and velocity
information of the nodes amongst all the nodes depending on the receiver signal power. The receiver signal
power, Pr = P0 / rn at a distance r from the transmitter, where P0 is the transmitted power and path loss
exponent n is typically between 2 and 4. The minimum power receivable by the device is the power at the
maximum transmission range,
Pd = P0 / d4
Similarly, the preemptive signal power threshold is the signal power at the edge of the preemptive region. In
addition, for a preemptive region of width of w, the signal power threshold is
Psafe = P0 / d4 safe
5. MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRM
www.iosrjournals.org 83 | Page
Where dsafe is equal to (d- w) and w=relative speed*Twarn The preemptive ratio α is defined as
α =Psafe / Pd = range/ (range- w).
In reality, the received signal power may experience sudden fluctuations due to channel fading and
multipath effects, which will trigger a false warning, causing unnecessary route request floods. This may result
in lower quality routes being initiated and also increasing the routing overheads. In cellular networks, an
exponential average of the signal power is used to verify that the signal power drop was not due to fading.
However, if the traffic is bursty or infrequent, the preemptive region may be fully crossed by the time enough
packets are received to drop the average below the threshold. Therefore quicker power estimates can be
achieved by sending a warning whenever the instantaneous power drops below the threshold and checking the
warning packet received power when it is received by the source. If the warning packet power is also below the
threshold, there is a good probability that the warning is real.
B. Generating the Warning Message based on ‘Age of the Path’
With transmissions being done along the same path, relay nodes will experience a continuous drain of
their battery power for the same source destination pair, which may result in path failure. Therefore alternate
route discoveries are required before the onset of failure. Nodes keep a record of their most recent encounter
times with all other nodes. With a path discovery being made, the source node sets a timer. The preemptive
warning is generated based on two parameters- Age of the path defined as the time difference age between the
transmissions of two consecutive route discovery packets from the source to the same destination and threshold
value Γ is defined for the age of the path. As long as age is lesser than Γ, data transmission can be continued on
the same path. When the timer value exceeds the threshold Γ, a warning message is generated leading to a new
path discovery. However, this new path may or may not be the shortest path to the destination. The choice of the
threshold depends on node density of the network. If the node density is small with lesser number of paths
available, Γ must be large.
IV. MESSAGE ENCRYPTION USING DECEPTIVE TEXT
The data packets sent to the intended receiver were encrypted by using the proposed concept of
Deceptive Text. In this paper we propose that, deceptive text instead of encrypted plaintext is sent to receiver.
The deceptive text can be in any form of text which is constructed by ASCII code. The deceptive text can have
no relation with the original plaintext.
In this scheme we used a Character Position Table (CPT), which contains positions of each character in
the deceptive text. From the CPT we generate Plaintext Index File (PIF), which is a series of character positions
taken from CPT that correspond to the characters in the plaintext. Finally we encrypt the Plaintext Index File
(PIF) and send it to the receiver. Therefore, the real data we send is the deceptive text and the encrypted index
file.
At the receiver the PIF is decrypted and the CPT is generated from the cheating text. The plaintext is
generated by indexing PIF into the CPT. In this scheme we have used digital signature to provide authentication
for the receiver about the Deceptive text.
A.Generating Digital Signature
6. MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRM
www.iosrjournals.org 84 | Page
When using digital signature algorithms to generate a digital signature for a message, the message must
first be processed using one of the approved hashing algorithms. We apply the randomization to the message
prior to hashing.
Fig 7: Process of randomizing a message
B.Encryption Process
Algorithm:-
Input:-Plain Text, Deceptive Text.
Procedure:-
1. Verify whether character’s kinds in deceptive text satisfy character’s kinds in plain text. If satisfied, goto
step2.If not, discard the current deceptive text and generate new one.
2. Generate Character Position Table (CPT) from the deceptive text.
3. Generate Plaintext Index File (PIF) using CPT.
4. Randomize deceptive text using a random value (rv).
5. Generate digital signature (DS) of randomized deceptive text using MD5 algorithm.
6. Encrypt PIF and rv using AES.
7. Send deceptive text, encrypted PIF, encrypted rv, and digital signature (DS).
C.Decryption Process
Algorithm:-
Input:-Digital signature (DS), Encrypted Random value (rv), Deceptive Text (DT), Encrypted Plaintext Index
File (PIF).
Output:-Plaintext.
Procedure:-
1. Decrypt Random value (rv) using symmetric AES.
2. Randomize Deceptive Text (DT) using Random value (rv).
3. Generate digital signature (DS1) of randomized deceptive text.
4. Verify whether received digital signature (DS1) are DS are equal. If equal goto step5.If not, discard received
DS.
5. Decrypt PIF using symmetric AES algorithm.
6. Generate Character Position Table (CPT) from deceptive text and recover plaintext by indexing PIF into CPT.
7. MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRM
www.iosrjournals.org 85 | Page
Fig 8: Process of Encryption
Fig 9: Process of Decryption
D.Example
We assume that
Plaintext: cat is my pet.
Cheating text: computer security is important.
According to the cheating text, we generate the CPT as follows:
Fig 10: Character Position Table
8. MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRM
www.iosrjournals.org 86 | Page
Then we compare each character in plaintext with CPT’s characters and randomly chose a position record to
make the PIF.The PIF is: 1 28 16 21 15 20 18 3 17 9 24 7 6 31
V. CONCLUSION
DSR with PRM mechanism detects early about the link that is likely to break soon, and hence it uses a
backup path before the existing link fails. This paper explains the preemption of Primary to Backup route by the
source node S, whenever the signal strength of the primary route falls below the threshold value T. The
modified DSR will improve the communication reliability between the source and destination node even if the
mobility is high. In addition, the link breakage prediction in DSR can significantly reduce the total number of
dropped data packets (by at least 25%). Also security to the packets in the MANET is provided by employing a
message encryption technique using the concept randomized hashing method.Finally, it provides a high-level of
protection for the data at low computational complexity.
REFERENCES
[1] Hongbo Zhou, “A Survey on Routing Protocols in MANETs,” Technical. Note March 2003.
[2] Siva Ram Murthy, B.S, Manoj, “Routing Protocols for Ad Hoc wireless Networks,” in Ad Hoc wireless networks: Architectures
and Protocols, Chapter 7. Pearson Publication.
[3] T. Goff, N.B. Abu-Ghazaleh, D.S. Phatak and R. Kahvecioglu, “Preemptive Maintenance Routing in Ad Hoc Networks”, journal of
parallel and Distributed Computing, Special Issue on Wireless Mobile Communication and Computing 2003.
[4] Mohammad Al-Shurman and Seong-Moo Yoo, Seungjin Park, “A Performance Simulation for Route Maintenance in Wireless Ad
Hoc Networks”, ACM,2004
[5] William Stallings,”Network Security Essentials”.
[6] Quynh Dang,”Randomized Hashing for Digital Signatures”.
[7] Chu-Hsing Lin and Tien-Chi Lee,”A Confused Document Encryption Scheme and Its Implementation”.
[8] C. E. Perkins and P. Bhagwat. Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers, In
ACM SIGCOMM, pages 234-244, 1994.
[9] X. Hong, T. Kwon, M. Gerla, D. Gu and G. Pei.A Mobility Framework for Ad Hoc Wireless Networks. In Proceedings of ACM
Second International Conference on Mobile Data Management (MDM ’2001), Hong Kong, Jan. 2001.
[10] A Group Mobility Model for Ad Hoc Wireless Networks X. Hong, M. Gerla, G. Pei, and C.-C. Chiang. In Proceedings of
ACM/IEEE MSWiM’99, Seattle, WA, Aug. 1999.
[11] A. Montresor, H. Meling, and O. Babaoglu, “Load-balancing through a swarm of autonomous agents,” inProc. 1st Workshop Agent
Peer-to-Peer Syst., 2002, pp. 125–137.
[12] G. W. Flake, The Computational Beauty of Nature. Cambridge, MA: MIT Press, 2000.
[13] R. Sutton and A. Barto, Reinforcement Learning. Cambridge, MA: MIT Press, 1998.
[14] L. Kaelbling, M. Littman, and A. Moore, “Reinforcement learning: A survey,” J. Artif. Intell. Res., vol. 4, pp. 237–285, 1996.
[15] C. Watkins, “Learning from delayed rewards,”Ph.D. dissertation, King’s College, Cambridge, U.K., 1989.
[16] A. Moore and C. Atkeson, “Prioritized sweeping: Reinforcement learning with less data and less time,” Mach. Learning, vol. 13, pp.
103–130, 1993.
[17] K. Doya, K. Samejima, K. Katagiri, and K. Kawato, “Multiple model-based reinforcement learning,” Neural Comput., vol. 14, no.
6, pp. 1347–1369, 2002.
[18] D. Johnson, D. Maltz, and J. Broch, “DSR: The dynamic source routing protocol for multihop wireless ad hoc networks,” in Ad Hoc
Networking. Reading, MA: Addison-Wesley, 2001, pp. 139–172.