Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
AN EFFICIENT ROUTING PROTOCOL FOR DELAY TOLERANT NETWORKS (DTNs)cscpconf
Delay-Tolerant Networks are those which lacks continuous communications among mobile
nodes . Distributed clustering scheme and cluster-based routing protocol are used for DelayTolerant
Mobile Networks (DTMNs). The basic idea is to distributive group mobile nodes with
similar mobility pattern into a cluster, which can then interchangeably share their resources for
overhead reduction and load balancing, aiming to achieve efficient and scalable routing in DTMN. Load balancing is carried out in two ways, Intra cluster load balancing and Inter cluster load balancing. The Convergence and stability become major challenges in distributed clustering in DTMN. An efficient routing protocol will be provided for the delay tolerant networks through which the stability of the network is maintained .Based on nodal contact probabilities, a set of functions including Sync(), Leave(), and Join() are devised for cluster formation and gateway selection. Finally, the gateway nodes exchange network information and perform routing
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
COMPARING THREE PROTOCOLS OF DODV, DSR, DSDV FOR VANET NETWORKpijans
An ad hoc network is a network created by wireless hosts that can be mobile. This means that no infrastructure such as a central station, router, roaming, or anything else used by other networks to help network structure or anything else that other networks use to help Network structure, is not used. Rather, they are just a few wireless nodes connecting to non neighboring nodes with the help of the neighboring nodes. Wireless ad hoc mobile network (MANET) and Wireless ad hoc inter-car network (VANET), are among wireless networks which have the most effective parameters in the ability of this type of networksto transfer multimedia from source to destination. In this research, we examine the challenges and solutions presented in DODV, DSR, and DSDV protocols.
Peer to Peer Approach based Replica and Locality Awareness to Manage and Diss...IJCNCJournal
Distributed Hash Table (DHT) based structured peer-to-peer (P2P) systems provide an efficient method of disseminating information in a VANET environment owing to its high performance and properties (e.g., self-organization, decentralization, scalability, etc.). The topology of ad hoc vehicle networks (VANET) varies dynamically; its disconnections are frequent due to the high movement of vehicles. In such a topology, information availability is an ultimate problem for vehicles, in general, connect and disconnect frequently from the network. Data replication is an appropriate and adequate solution to this problem. In this contribution, to increase the accessibility of data, which also increases the success rate of the lookup, a method based on replication in the Vanet network is proposed named LAaR-Vanet. Also, this replication strategy is combined with a locality-awareness method to promote the same purpose and to avoid the problems of long paths. The performance of the proposed solution is assessed by a series of in-depth simulations in urban areas. The obtained results indicate the efficiency of the proposed approach, in terms of the following metrics: lookup success rate, the delay, and the number of the logical hop.
A Study of Routing Techniques in Intermittently Connected MANETsIJORCS
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive Protocols, Proactive Protocols and Hybrid Protocols. These traditional routing schemes are not pertinent to the so called Intermittently Connected Mobile Ad hoc Network (ICMANET). ICMANET is a form of Delay Tolerant Network, where there never exists a complete end – to – end path between two nodes wishing to communicate. The intermittent connectivity araise when network is sparse or highly mobile. Routing in such a spasmodic environment is arduous. In this paper, we put forward the indication of prevailing routing approaches for ICMANET with their benefits and detriments
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
ETX METRIC FOR EXTREMELY OPPORTUNISTIC ROUTING TO IMPROVE THE PERFORMANCE OF ...ijasuc
Mobility in wireless networks has paved way for a new paradigm of communication in this era. Exploiting
the optimal routing technique for hybrid wireless networks which brings in a balance of the overheads in
infrastructure based and infrastructure less network is essential. Routing protocol design for hybrid
wireless network is critical in order to improve the performance and reliability of the network.
Opportunistic Routing (OR) technique attempts to deal with unreliable transmissions by utilizing the
broadcast nature of the wireless medium. Due to multi-hop nature of ad hoc networks, Opportunistic
Routing provides lesser throughput than expected when minimum hop count metric is used. To combat the
above limitations, an Extremely Opportunistic Routing(ExOR) scheme with Expected Transmission
count(ETX) metric is proposed and implemented in a hybrid scenario. The simulation study reveals that
this routing technique efficiently utilizes resources and improves the end-to-end throughput and packet
delivery ratio in hybrid wireless networks.
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
Black-Hole and Wormhole Attack in Routing Protocol AODV in MANETIJCSEA Journal
Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a “BlackvHole” and “Wormhole” attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find
out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors’ and making them communicate through the wormhole link.
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
Target Detection System (TDS) for Enhancing Security in Ad hoc Networkijdpsjournal
The idea of an ad hoc network is a new pattern that allows mobile hosts (nodes) to converse without relying
on a predefined communications to keep the network connected. Most nodes are implicit to be mobile and
communication is implicit to be wireless. Ad-hoc networks are collaborative in the sense that each node is
assumed to relay packets for other nodes that will in return relay their packets. Thus all nodes in an ad-hoc
network form part of the network’s routing infrastructure. The mobility of nodes in an ad-hoc network
denotes that both the public and the topology of the network are extremely active. It is very difficult to
design a once-for-all target detection system. Instead, an incremental enrichment strategy may be more
feasible. A safe and sound protocol should at least include mechanisms against known assault types. In
addition, it should provide a system to easily add new security features in the future. Due to the
significance of MANET routing protocols, we focus on the recognition of attacks targeted at MANET
routing protocols.
Intrusion detection techniques for cooperation of node in MANET have been chosen as the security
parameter. This includes Watchdog and Path rater approach. It also nearby Reputation Based Schemes in
which Reputation concerning every node is measured and will be move to every node in network.
Reputation is defined as Someone’s donation to network operation. CONFIDANT [23], CORE [25],
OCEAN [24] schemes are analyzed and will be here also compared based on various parameters.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
COMPARING THREE PROTOCOLS OF DODV, DSR, DSDV FOR VANET NETWORKpijans
An ad hoc network is a network created by wireless hosts that can be mobile. This means that no infrastructure such as a central station, router, roaming, or anything else used by other networks to help network structure or anything else that other networks use to help Network structure, is not used. Rather, they are just a few wireless nodes connecting to non neighboring nodes with the help of the neighboring nodes. Wireless ad hoc mobile network (MANET) and Wireless ad hoc inter-car network (VANET), are among wireless networks which have the most effective parameters in the ability of this type of networksto transfer multimedia from source to destination. In this research, we examine the challenges and solutions presented in DODV, DSR, and DSDV protocols.
Peer to Peer Approach based Replica and Locality Awareness to Manage and Diss...IJCNCJournal
Distributed Hash Table (DHT) based structured peer-to-peer (P2P) systems provide an efficient method of disseminating information in a VANET environment owing to its high performance and properties (e.g., self-organization, decentralization, scalability, etc.). The topology of ad hoc vehicle networks (VANET) varies dynamically; its disconnections are frequent due to the high movement of vehicles. In such a topology, information availability is an ultimate problem for vehicles, in general, connect and disconnect frequently from the network. Data replication is an appropriate and adequate solution to this problem. In this contribution, to increase the accessibility of data, which also increases the success rate of the lookup, a method based on replication in the Vanet network is proposed named LAaR-Vanet. Also, this replication strategy is combined with a locality-awareness method to promote the same purpose and to avoid the problems of long paths. The performance of the proposed solution is assessed by a series of in-depth simulations in urban areas. The obtained results indicate the efficiency of the proposed approach, in terms of the following metrics: lookup success rate, the delay, and the number of the logical hop.
A Study of Routing Techniques in Intermittently Connected MANETsIJORCS
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive Protocols, Proactive Protocols and Hybrid Protocols. These traditional routing schemes are not pertinent to the so called Intermittently Connected Mobile Ad hoc Network (ICMANET). ICMANET is a form of Delay Tolerant Network, where there never exists a complete end – to – end path between two nodes wishing to communicate. The intermittent connectivity araise when network is sparse or highly mobile. Routing in such a spasmodic environment is arduous. In this paper, we put forward the indication of prevailing routing approaches for ICMANET with their benefits and detriments
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
ETX METRIC FOR EXTREMELY OPPORTUNISTIC ROUTING TO IMPROVE THE PERFORMANCE OF ...ijasuc
Mobility in wireless networks has paved way for a new paradigm of communication in this era. Exploiting
the optimal routing technique for hybrid wireless networks which brings in a balance of the overheads in
infrastructure based and infrastructure less network is essential. Routing protocol design for hybrid
wireless network is critical in order to improve the performance and reliability of the network.
Opportunistic Routing (OR) technique attempts to deal with unreliable transmissions by utilizing the
broadcast nature of the wireless medium. Due to multi-hop nature of ad hoc networks, Opportunistic
Routing provides lesser throughput than expected when minimum hop count metric is used. To combat the
above limitations, an Extremely Opportunistic Routing(ExOR) scheme with Expected Transmission
count(ETX) metric is proposed and implemented in a hybrid scenario. The simulation study reveals that
this routing technique efficiently utilizes resources and improves the end-to-end throughput and packet
delivery ratio in hybrid wireless networks.
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
Black-Hole and Wormhole Attack in Routing Protocol AODV in MANETIJCSEA Journal
Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a “BlackvHole” and “Wormhole” attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find
out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors’ and making them communicate through the wormhole link.
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
Target Detection System (TDS) for Enhancing Security in Ad hoc Networkijdpsjournal
The idea of an ad hoc network is a new pattern that allows mobile hosts (nodes) to converse without relying
on a predefined communications to keep the network connected. Most nodes are implicit to be mobile and
communication is implicit to be wireless. Ad-hoc networks are collaborative in the sense that each node is
assumed to relay packets for other nodes that will in return relay their packets. Thus all nodes in an ad-hoc
network form part of the network’s routing infrastructure. The mobility of nodes in an ad-hoc network
denotes that both the public and the topology of the network are extremely active. It is very difficult to
design a once-for-all target detection system. Instead, an incremental enrichment strategy may be more
feasible. A safe and sound protocol should at least include mechanisms against known assault types. In
addition, it should provide a system to easily add new security features in the future. Due to the
significance of MANET routing protocols, we focus on the recognition of attacks targeted at MANET
routing protocols.
Intrusion detection techniques for cooperation of node in MANET have been chosen as the security
parameter. This includes Watchdog and Path rater approach. It also nearby Reputation Based Schemes in
which Reputation concerning every node is measured and will be move to every node in network.
Reputation is defined as Someone’s donation to network operation. CONFIDANT [23], CORE [25],
OCEAN [24] schemes are analyzed and will be here also compared based on various parameters.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
Abstract Mobile networks have received great deal of attention during last few decades due to their potential applications such as large scale, improved flexibility and reduced costs. This proposed work addresses two problems associated with mobile network such as method to reduce overhead between the nodes, and energy balanced routing of packets by Co-Operative opportunistic routing for cluster based communication. We propose a modified algorithm that uses On-Demand Opportunistic Group mobility based clustering (ODOGMBC) for forming the cluster and predicting the cluster mobility by neighbourhood update algorithm. Cluster formation involves election of a mobile node as Cluster head. Each cluster comprises of cluster head and non-cluster head node that forms a cluster dynamically. Each node in the network continuously finds it neighbour by communicating with them, and nodes have consistent updated routing information in route cache by neighbourhood update algorithm. In routing process packet forwarded by the source node is updated by intermediate forwarder if topology undergo changes. This opportunistic routing scheme provides responsive data transportation and managing the node effectively, even in heavily loaded environment. Thus, our proposed routing technique helps us to reduce overhead, increases efficiency and better control of path selection. Keywords- Clustering, Forwarder, MANET, Prediction, Reactive, opportunistic routing.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
TRIDNT: THE TRUST-BASED ROUTING PROTOCOL WITH CONTROLLED DEGREE OF NODE SELFI...IJNSA Journal
In Mobile ad-hoc network, nodes must cooperate to achieve the routing purposes. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. In this paper, we propose a Two node-disjoint Routes protocol for Isolating Dropper Node in MANET (TRIDNT) to deal with misbehaviour in MANET. TRIDNT allows some degree of selfishness to give an incentive to the selfish nodes to declare itself to its neighbours, which reduce the misbehaving nodes searching time. In TRIDNT two node-disjoint routes between the source and destination are selected based on their trust values. We use both DLL-ACK and end-to-end TCP-ACK to monitor the behaviour of routing path nodes: if a malicious behaviour is detected then the path searching tool starts to identify the malicious nodes and isolate them. Finally by using a mathematical analysis we find that our proposed protocol reduces the searching time of malicious nodes comparing to the route expected life time, and avoids the isolated misbehaving node from sharing in all future routes, which improve the overall network throughput.
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
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.
Comparison of Various Unicast-Multicast Routing Protocols for Mobile Ad-Hoc N...Editor IJMTER
A Mobile Ad-hoc Network (MANET) is a self configuring network which consists of
mobile nodes with no permanent infrastructure. In a MANETs, there is no difference between a host
node and a router so that all nodes can be source plus forwarders of traffic. The task of finding routes
in Mobile Ad-hoc Network (MANET) is an important factor in determining the efficiency of any
MANET routing protocols. This paper describes about the basic idea of different routing protocols
and its efficient use in MANET. There are several routing protocols based on UNICAST and
MULTICAST. This paper will conclude the main characteristics of these protocols with comparison
and suggest the best suited protocol for particular topology or network.
QoS Issues in MANET: A Comparative Study over Different Routing Protocolsrahulmonikasharma
MANETs are composed of autonomous nodes that are self-managed without any existing of infrastructure and centralized administration. Therefore, each node operates not only as an end system but also as a router to forward packets for other nodes. For these reasons, the network has a dynamic topology, so nodes can easily join or leave the network at any time. Routing information differentiates these networks from other ad-hoc networks. The study of QoS issues in Mobile Ad-hoc Network is done by simulation in MATLAB that can help in better understanding of the behavior of various routing protocols. This paper is intended to compare QoS parameters of various routing protocols.
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.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly, thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable and consistent connectivity between the mobile nodes. They conclude logically based on the interaction between mobile nodes in MANET routing and encourage them to choose the optimum path between source and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as the optimized variant of link state routing in which packets are sent throughout the network using the multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol under condition of changing mobility speed and network density. The study's performance indicators are average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2 (NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise redundant data transmission during the normal message broadcast. The MPRs enhance the link state protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired broadcasts can be reduced and limited. Further research will focus on different scenario and environment using different mobility model.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Similar to An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing for Rural Areas (20)
Maintaining Data Confidentiality in Association Rule Mining in Distributed En...IJSRD
The data in real world applications is distributed at multiple locations, and the owner of the databases may be different people. Thus to perform mining task, the data needs to be kept at central location which causes threat to the privacy of corporate data. Hence the key challenge is to applying mining on distributed source data with preserving privacy of corporate data. The system addresses the problem of incrementally mining frequent itemsets in dynamic environment. The assumption made here is that, after initial mining the source undergoes into small changes in each time. The privacy of data should not be threatened by an adversary i.e. the miner and target database owner should not be able to recover original data from transformed data.
Performance and Emission characteristics of a Single Cylinder Four Stroke Die...IJSRD
The current trends in CI engine are to use Water-diesel emulsion as alternative fuel. It can be employed directly to the existing CI Engine system with no additional modifications. This system helps in reduction of NOx as well as PM, which in turn improve the combustion efficiency of the engine. However there are still investigations have to be done. The current work mainly concentrated on diesel engine run on water-diesel emulsions and its effect on engine performance and emissions were studied. The various loads were applied on a constant speed diesel engine run on water-diesel emulsions of varying ratios of 0.2:1, 0.3:1. 0.4:1 and 0.5:1. Emission and performance characteristics were measured and were compared with base diesel operation. The emissions like NOx and smoke density were found to decrease greatly and brake thermal efficiency was found to increase at high loads. Smoke level was 4.2 BSU and 3 BSU for base diesel and water diesel emulsion of 0.4. The ignition delay was found to increase with water diesel emulsions. This also increased the maximum rate of pressure rise and peak pressure. The engine was found to run rough with water-diesel emulsions. The optimal water-diesel ratio was found to be 0.4:1 by weight. HC and CO emissions were found to increase with water diesel emulsions.
Preclusion of High and Low Pressure In Boiler by Using LABVIEWIJSRD
Pressure is an important physical parameter to be controlled in process boiler, heat exchanger, nuclear reactor and steam carrying pipeline. In the article the issue has been face in boiler operation due to pressure is handled. In boiler, the problem is due to maximum and minimum range of pressure. Due to the issues there is a chance to causes the hazop. To avoid such the problem the high and low pressure in boiler has to control. In the paper such the problem has sorted out by implementing ON-OFF control. Here the proposed control action for pressure control is implemented with the help of LabVIEW (Laboratory Virtual Instrument Engineering Workbench) software and NI ELVIS hardware. In the idea the boiler’s low range and high is monitored and controlled valve desirably. And also the high range and low range of pressure in the boiler is signified to plant operator by alarm signal.
Prevention and Detection of Man in the Middle Attack on AODV ProtocolIJSRD
In this paper it is discuss about AODV protocol and security attacks and man in the middle attack in detail. AODV Protocol is use to find route and very important protocol for communication in wireless network. So AODV protocol should be Secured and it is a big challenge. There are various attacks that occur on it. Here in this paper it discussed about the detection and preventions of man-in-the-middle attack in detail.
Comparative Analysis of PAPR Reduction Techniques in OFDM Using Precoding Tec...IJSRD
In this modern era, Orthogonal Frequency Division Multiplexing (OFDM) has been proved to be an explicit promising technique for wired and wireless systems because of its several advantages like high spectral efficiency, robustness against frequency selective fading, relatively simple receiver implementation etc. Besides having a number of advantages OFDM suffers from few disadvantages like high Peak to Average Power Ratio (PAPR), Intercarrier Interference (ICI), Intersymbol Interference (ISI) etc. These detrimental effects, if not compensated properly and timely, can result in system performance degradation. This paper mainly concentrates on reduction of PAPR.A comparisons have been made between various precoding techniques against conventional OFDM.
Evaluation the Effect of Machining Parameters on MRR of Mild SteelIJSRD
Today’s life is totally based on Internet. Now a days people cannot imagine life without Internet. Information and communication technology plays vital role in today’s online networked society. In today’s life, we are very close to the online social networks. Online social networks are used for posting and sharing information across various social networking sites. But user’s privacy is not maintained by online social networks. For maintaining users sensitive information’s privacy online social networks provides little or no support. For filtering unwanted messages we propose a system using machine learning (ML). Using machine learning in soft classifier content based filtering performed. In proposed system filtering rules (FR’s) are provided for content independent filtering.. Blacklists are used for more flexibility by which filtering choices are increased. Proposed system provides security to the Online Social Networks.
Filter unwanted messages from walls and blocking nonlegitimate user in osnIJSRD
Today’s life is totally based on Internet. Now a days people cannot imagine life without Internet. Information and communication technology plays vital role in today’s online networked society. In today’s life, we are very close to the online social networks. Online social networks are used for posting and sharing information across various social networking sites. But user’s privacy is not maintained by online social networks. For maintaining users sensitive information’s privacy online social networks provides little or no support. For filtering unwanted messages we propose a system using machine learning (ML). Using machine learning in soft classifier content based filtering performed. In proposed system filtering rules (FR’s) are provided for content independent filtering.. Blacklists are used for more flexibility by which filtering choices are increased. Proposed system provides security to the Online Social Networks.
Keystroke Dynamics Authentication with Project Management SystemIJSRD
Generally user authentication is done using username and password that is called as login process. This login process is not more secure because, however a login session is still unprotected to impersonator when the user leaves his computer without logging off. Keystroke dynamics methods can be made useful to verify a user by extracting some typing features then, after the authentication process has successfully ended. From the last decade several studies proposed the use of keystroke dynamics as a behavioral biometric tool to verify users. We propose a new method, for representing the keystroke patterns by joining similar pairs of consecutive keystrokes. The above proposed method is used to consider clustering the di-graphs which are based on their temporal features. In this project, authentication system is provide to project management system that make more Secure management system without acknowledging unauthorized user. The Project Management System addresses the management of software projects. It provides the framework for organizing and managing resources in such a way that these resources deliver all the work required to complete a software project within defined scope, time and cost constraints. The system applies only to the management of software projects and is a tool that facilitates decision making.
Diagnosing lungs cancer Using Neural NetworksIJSRD
Artificial Neural Networks is the new technology. It is the branch of Artificial Intelligence and also it is an accepted new technology. Now a days Neural Networks Plays a Vital role in Medicine, Particularly in some fields such as cardiology, oncology etc. And also it has many applications in many areas like Science and Technology, Education, Business, Business and Manufacturing, etc. Neural Networks is most useful for making the decision more Effective. In this Paper, by the use of Neural Networks how the severe disease Lungs Cancer has been diagnosed more effectively. This Paper discussed about how the Lungs cancer can be identified effectively in earlier stages and diagnosed using Neural Networks and some devices. The Neural Networks has been successfully applied in Carcinogenesis. The main aim of this research is by the use of Neural Networks the Carcinogenesis can be diagnosed more cost-effective, easy to use techniques and methods. This Paper discussed about how the Lungs cancer can be identified effectively in earlier stages and diagnosed using Neural Networks and some devices. Sputum Cytology is used to detect the Lungs Cancer in Early stages.
A Survey on Sentiment Analysis and Opinion MiningIJSRD
In Today’s world, the social media has given web users a place for expressing and sharing their thoughts and opinions on different topics or events. For this purpose, the opinion mining has gained the importance. Sentiment classification and Opinion Mining is the study of people’s opinion, emotions, attitude towards the product, services, etc. Sentiment Analysis and Opinion Mining are the two interchangeable terms. There are various approaches and techniques exist for Sentiment Analysis like Naïve Bayes, Decision Trees, Support Vector Machines, Random Forests, Maximum Entropy, etc. Opinion mining is a useful and beneficial way to scientific surveys, political polls, market research and business intelligence, etc. This paper presents a literature review of various techniques used for opinion mining and sentiment analysis.
A Defect Prediction Model for Software Product based on ANFISIJSRD
Artificial intelligence techniques are day by day getting involvement in all the classification and prediction based process like environmental monitoring, stock exchange conditions, biomedical diagnosis, software engineering etc. However still there are yet to be simplify the challenges of selecting training criteria for design of artificial intelligence models used for prediction of results. This work focus on the defect prediction mechanism development using software metric data of KC1.We have taken subtractive clustering approach for generation of fuzzy inference system (FIS).The FIS rules are generated at different radius of influence of input attribute vectors and the developed rules are further modified by ANFIS technique to obtain the prediction of number of defects in software project using fuzzy logic system.
Experimental Investigation of Granulated Blast Furnace Slag ond Quarry Dust a...IJSRD
In this experimental work ninety nine cubes has been prepared having dimension 70.7x70.7x70.7 mm are cast as per IS:4031 (2000). In this experimental investigation cement mortar mix 1:3 by volume were selected for 0%, 20%, 40%, 60%, 80% and 100% partially replacement of natural sand (NS) by Granulated blast furnace slag (GBFS) and quarry dust (QD) [3 cubes on each parameter respectively] for W/C ratio of 0.55 respectively. All the cubes were tested under compressive testing machine. To compare the average compressive strength of natural sand (NS) with granulated blast furnace slag (GBFS) and quarry dust (QD).
Product Quality Analysis based on online ReviewsIJSRD
Customers satisfaction is the most important criteria before buying any product. Technology today has grown to such an extent that every smallest possible query is found on internet. An individual can express his reviews towards a product through Internet. This allows others to have a brief idea about the product before buying one for them. In this paper, we take into account all the challenges and limitations encountered while reading the online reviews and time being consumed in understanding quality of the product from the reviews. We include several methods and algorithms that help the consumer to understand the Quality of the product in better way.
Solving Fuzzy Matrix Games Defuzzificated by Trapezoidal Parabolic Fuzzy NumbersIJSRD
The matrix game theory gives a mathematical background for dealing with competitive or antagonistic situations arise in many parts of real life. Matrix games have been extensively studied and successfully applied to many fields such as economics, business, management and e-commerce as well as advertising. This paper deals with two-person matrix games whose elements of pay-off matrix are fuzzy numbers. Then the corresponding matrix game has been converted into crisp game using defuzzification techniques. The value of the matrix game for each player is obtained by solving corresponding crisp game problems using the existing method. Finally, to illustrate the proposed methodology, a practical and realistic numerical example has been applied for different defuzzification methods and the obtained results have been compared
Study of Clustering of Data Base in Education Sector Using Data MiningIJSRD
Data mining is a technology used in different disciplines to search for significant relationships among variables in n number of data sets. Data mining is frequently used in all types’ areas as well as applications. In this paper the application of data mining is attached with the field of education. The relationship between student’s university entrance examination results and their success was studied using cluster analysis and k-means algorithm techniques.
Fault Tolerance in Big Data Processing Using Heartbeat Messages and Data Repl...IJSRD
Big data is a popular term used to define the exponential evolution and availability of data, includes both structured and unstructured data. The volatile progression of demands on big data processing imposes heavy burden on computation, communication and storage in geographically distributed data centers. Hence it is necessary to minimize the cost of big data processing, which also includes fault tolerance cost. Big Data processing involves two types of faults: node failure and data loss. Both the faults can be recovered using heartbeat messages. Here heartbeat messages acts as an acknowledgement messages between two servers. This paper depicts about the study of node failure and recovery, data replication and heartbeat messages.
Investigation of Effect of Process Parameters on Maximum Temperature during F...IJSRD
In case of friction stir welding, the maximum temperature along the weld line within appropriate range at tool workpiece interface is responsible for quality of welded joint. Through this paper, an attempt is made to establish a relationship between the input process parameters and the maximum temperature along the weld line during friction stir welding of aluminium alloy AA-7075. The design of pre-experimental simulation has been performed in accordance with full factorial technique. The simulation of friction stir welding has been performed by varying input parameters, tool rotational speed and welding speed. The analysis of variance (ANOVA) is used to investigate the effect of input parameters on maximum temperature during friction stir welding. A correlation was established between input parameters and maximum temperature by multiple regression lines. This study indicates that the tool rotational speed is the main input parameter that has high statistical influence on maximum temperature along the weld line during friction stir welding of aluminium alloy AA-7075.
Review Paper on Computer Aided Design & Analysis of Rotor Shaft of a RotavatorIJSRD
The intent of this paper is to study the various forces and stress acting on a rotor shaft of a standard rotavator which is subjected to transient loading. The standard models of rotavator, having a progressive cutting sequence was considered for the study and analysis. The study was extended to various available models having different cutting blade arrangement. The study was carried on different papers and identifies the various forces acting on a Rotor shaft of a rotavator. The positions of the torque and forces applied are varied according to the model considered. The response was obtained by considering the angle of twist and equivalent stress on the rotor shaft. This paper presented a methodology for conducting transient analysis of rotor shaft of a rotavator,
A Survey on Data Mining Techniques for Crime Hotspots PredictionIJSRD
A crime is an act which is against the laws of a country or region. The technique which is used to find areas on a map which have high crime intensity is known as crime hotspot prediction. The technique uses the crime data which includes the area with crime rate and predict the future location with high crime intensity. The motivation of crime hotspot prediction is to raise people’s awareness regarding the dangerous location in certain time period. It can help for police resource allocation for creating a safe environment. The paper presents survey of different types of data mining techniques for crime hotspots prediction.
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
We all have good and bad thoughts from time to time and situation to situation. We are bombarded daily with spiraling thoughts(both negative and positive) creating all-consuming feel , making us difficult to manage with associated suffering. Good thoughts are like our Mob Signal (Positive thought) amidst noise(negative thought) in the atmosphere. Negative thoughts like noise outweigh positive thoughts. These thoughts often create unwanted confusion, trouble, stress and frustration in our mind as well as chaos in our physical world. Negative thoughts are also known as “distorted thinking”.
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
How to Split Bills in the Odoo 17 POS ModuleCeline George
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing for Rural Areas
1. IJSRD - International Journal for Scientific Research & Development| Vol. 3, Issue 10, 2015 | ISSN (online): 2321-0613
All rights reserved by www.ijsrd.com 798
An Efficient DTN Routing Algorithm for Automatic Crime Information
Sharing for Rural Areas
Neha Agarwal1
Sujeet Bhadouriya2
2
Assistant Professor
1,2
Department of Computer Science
1,2
NITM Gwalior, India
Abstract— Delay Tolerant Network shows many issues that
are exist in traditional network. Opportunistic network
emerge as interesting evolution in MANET. Mobile nodes in
the opportunistic network communicate with each other
even in case of no route connection. In this paper a kiosk (or
hub station) that is connected to villages to establish internet
connection. Such kiosk is placed where traffic frequency is
high. We will use high frequency sensor in vehicles. When
passing through kiosk, high frequency sensor will establish
connection to kiosk & kiosk will connect villages to
internet. This system is very useful in crime information
sharing services. As an example, if there are a person who is
victim of any crime or in a trouble condition. He/she have
mobile devices connect to internet. They send a trouble
message which is passed to near kiosk and passed on to
vehicles and forward their information to police station. This
system is helpful in villages, where network communication
is not proper.
Key words: Opportunistic network, DTN, Epidemic, Prophet
I. INTRODUCTION
Delay Tolerant Networks (DTN) are remote systems in
which nodes are irregularly joined and there is no ensure
that a path exists from source to destination at any time
instance. Today, there are numerous illustrations of such
systems including tracking of wildlife systems [1], military
systems and vehicular systems. In addition, the wide spread
use of various types of devices with remote capacities
among individuals and their surroundings has enabled the
likelihood of opportunistic urban routing of messages. In
DTN an opportunistic network provides communication
among different routing from different wireless networks.
In standard system, mostly time nodes are
connected. In case of DTN, connectivity is not properly
maintained but it is still desirable to allow communication
between nodes. Therefore the delivery of packets in
traditional routing protocols is not possible between the
hosts. So end to end connectivity between nodes required.
The node mobility is other reason for absence of end to end
connectivity. It also introduces the issue of lack of
knowledge about current position of node, if mobility
pattern is not known.
Delay tolerant network includes a variety of
applications in situations such as deep-space communication
and crisis environments. In this article introduce routing
protocol in DTNs. Multicast [2] supports the distribution of
data packets to a no. of users, when a service is required for
many potential DTN applications. Due to the characteristic
of frequent partitioning in DTNs, routing is a challenging
issue.
Delay in the Delay-tolerant networking may differ
depending upon the nodes location. There are mostly four
delays kinds. a) Processing delay- time taken through
routers to the procedure the packet header. b) Queuing
delay-time in routing queues the packet spends. c)
Transmission time- takes time to packets bits push onto the
link. d) Propagation delay-time for a signal to destination
reach. Delay-tolerant networking lacks instantaneous end-
to-end path. Because of this, Ad hoc On Demand Distance
Vector (AODV) and Dynamic Source Routing protocol may
be fail to the route establish. These protocols first establish a
route and after the route has been recognized, forward the
real information to destination. When these instantaneous
paths of end –to-end are complex to routing protocols
establish, the store-carry-forward method is used. There are
numerous examples of this network in the real life.
Numerous rural projects connectivity involve conventional
internet access attempt provide to remote areas.
Delay in DTN may vary contingent on the area of
hubs. There are chiefly four sorts of postponements. a)
Processing deferral time taken by the switches to transform
the parcel header. b) Queuing deferral time the parcel
spends in directing lines. c) Transmission time-time it takes
to push the bundles bits onto the connection. d) Propagation
postponement time for a sign to achieve its destination.
DTN needs prompt end-to-end way. Because of this, AODV
and DSR conventions may neglect to build up course. These
conventions first set up a course and after course has been
set up, forward the real information to destination. At the
point when these momentary end –to-end ways are hard to
set up directing conventions, the store-convey forward plan
is utilized.
There are numerous illustrations of this system, in
actuality. Numerous provincial network activities include
endeavor to give customary web access to remote zone
II. OPPORTUNISTIC NETWORK
Opportunistic network is an MANET extension. Wireless
networks‟ features, such as users mobility disconnection
and also links‟ instability, nodes, network segment, are seen
as exceptions in classical network. This makes the MANET
design extensively much Difficult [3].
Opportunistic networks [4] are created out of the
mobile devices approved through people, without any
relying on the any network topology. Opportunistic
networks consider partitions, disconnections, mobility, etc.
as norms instead of exceptions. In the mobility of the
network opportunistic is used as a method to present
between disconnected„groups‟ of the nodes, communication
rather than a disadvantage to be resolve.
In the opportunistic networking a whole path
between two different nodes wishing to the communicate is
unavailable [5]. Opportunistic networking aims to solve this
issue through eliminate the physical end-to-end connectivity
assumption and permit such nodes to the information
exchange. Through applying the paradigm of store-carry-
2. An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing for Rural Areas
(IJSRD/Vol. 3/Issue 10/2015/174)
All rights reserved by www.ijsrd.com 799
and-forward [6] middle nodes store data when there is no
any forwarding opportunity towards the endpoint, and also
exploit any other future contact opportunity with the other
different mobile devices to the bring the data closer and also
closer to endpoint.
Therefore routing is the most compelling issue. The
well-organized routing protocols design for the
opportunistic networks is commonly a hard mission because
of the about network topology information absence. Routing
performance depends on the information of network
topology [7]. Unfortunately, this knowledge type is not
forever presented. Context knowledge is a basic piece of the
information to design effective routing protocols. Context
knowledge signifies users‟ working address and also
establishment, probability of the meeting with other
different users or particular places visiting. It represents the
present effective atmosphere and also user’s behavior. It is
the most help full to classify appropriate forwarders based
on the context knowledge about the endpoint. We can
categorize the basic approaches of routing proposed in
literature based on the context knowledge users quantity
they exploit. Particularly, we recognize two phases,
corresponding to the context-aware protocols and context-
oblivious.
III. ROUTING PROTOCOLS
In common routing protocols in the DTN are classified into
2 basic group which is based on property is used to
destination discover: Flooding families & forwarding
families. To discover the evaluation, two various methods of
knowledge and replication are used. The replication is used
in flooding approach & there are numerous algorithms to the
manage of multiple copies data & to make those copies.
While the information is used in the forwarding approach &
few works have been devoted to derive much effective
technique to find various network state knowledge & then to
use it make routing result.
A. Epidemic Routing:
In this protocol each nodes can be become the transporter,
and it is confirmed that data can be delivered with the high
possibility. However, the network resources are consumed
greatly. Data are spread to each neighbors. When there is no
any room in data queue, dispossessed oldest data. Data are
always forwarded according to a policy of FIFO and no
bound on various replicas are considered [8].
Fig. 1: Epidemic Routing Protocol Method
B. Probabilistic Routing:
PROPHET [6], a Protocol of Probabilistic Routing applying
Transitivity and Encounters History define use of the
observations that the real users typically in the move
predictable fashion. If a user has location visit various times
before, there is much probability to location visit again.
PROPHET uses this knowledge to routing performance
progress. To the accomplish this, PROPHET maintains
delivery predictability metric at each node. This represents
metric data release probability of the host to an endpoint.
PROPHET is same to the Epidemic Routing but it initiates a
novel delivery predictability idea. Delivery predictably is
node to the encounter a various endpoint probability. When
two meet nodes, they also exchange knowledge delivery
predictability using summary vectors. This knowledge is
used to the update delivery predictability metric knowledge.
When a data comes at a node, node checks that endpoint is
presented or not. If endpoint is not obtainable, data stores
node and upon every encounters with the another different
device, it takes data transfer based decision transferred
information to the other different node if the other different
node has probability of higher data delivery to the endpoint
[6].
C. Spray & wait
Spray-and-Wait (SnW) [9] protocol a simple scheme
proposed which is manages to overcome shortcomings of
the epidemic routing and other different flooding-based
approach, and also avoids the performance issue inherent in
the utility-based method. Spray-and-Wait (SnW) [9]
protocol limits the various copies through associating with
all copy the numerous additional copies to spread. When no
more spreading is permitted carrying node keeps the packet
until it either meets the endpoint or the packet is dropped
because of lifetime expiry or buffer overflow.
IV. LITERATURE REVIEW
Anshul Verma et.al [11] in the opportunistic networks a
simultaneous way existence is not assumed to the transmit a
information between a sender to a receiver. Knowledge
about the context in which users is a key piece of
information to the effective routing protocols design in
networks. But this knowledge type is not always presented.
When users are most isolated, context knowledge cannot be
dispersed, and also cannot be used for the assuming efficient
routing endpoint. In such cases, context oblivious based on
method are only way to the enable communication in
between various users. in the network As faster as users
become more social, context information spreads, and also
context based routing becomes an effective solution. In this
paper they propose an integrated routing protocol that is able
to utilize context knowledge as faster as it becomes existing
and also falls back to the endpoint which is based routing
when the context knowledge is not presented. Then, we
provide comparison between PROPHET and Epidemic;
these are representative of context aware routing and context
oblivious protocols.
Sushant Jain et.al [12] delay-tolerant networking
routing issue is formulate, where data are to be change the
end-to-end across a graph connectivity that is the time-
varying but also whose dynamics may be called as in
advance. The challenge has added the finite buffers
3. An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing for Rural Areas
(IJSRD/Vol. 3/Issue 10/2015/174)
All rights reserved by www.ijsrd.com 800
constraints at each nodes and the common property that the
no any contemporaneous end-to-end may ever exist. This
condition limits classical routing methods applicability that
tends to outages treat as the failures and also seeks to an
existing end-to-end path find purpose. They proposed for
routing algorithms framework in such atmosphere. We then
develop various algorithms and then use simulations to
performance compare regarding the quantity of information
they require about any network topology. We obtain that, as
expected, algorithms applying the least information tend to
the achieve badly. We also obtain that with limited extra
information, far less than total global information; effective
algorithms can be for routing constructed in such
atmosphere. To the best of our data this is first such of
routing investigation problem in DTNs.
Vikas et.al [8] DTN (Delay/Disruption tolerant
networking) is another network communication techniques
class developed to the sustain long link delay and also
frequent link disruption. Lot of work have been done in the
estimate the performance and effectiveness of the different
type of DTN Protocols when they are applied on different
environment (like the environment where we don’t have
continuous path between source and sink e.g. Village
network, IPN (interplanetary network) etc.). In this paper
presented a study on evaluation of the TCPCL
(Transmission Control Protocol Convergence Layer) for
Communication and also long-delay communication (eg.
MaxProp, Epidemics Routing etc.). A comparative study of
several TCPCL has also been carried out.
B. Shubashini et.al [11] Delay-tolerant networks
are a new development in network research, the hope of
connecting people and devices that hitherto were either
unable to communicate, only at great cost. In this paper
review on existing method for routing in such networks. For
this investigate ways amount of changes per fits best under
the instantaneous conditions with their features such as
intermittent connectivity, resource limitation and high delay.
The fuzzy membership functions can be adaptively
constructed based on known network parameters. The fuzzy
decision mechanism is very simple compared to complex
prediction mechanisms used in many other DTN protocols.
V. PROPOSED WORK
MANET permits nodes with the wireless adaptors to
communicate with the one another without infrastructure of
pre-existing network. Accessible protocols of ad hoc
routing, while robust to quickly network topology altering,
assume the connected path presence from the source
endpoint. We are implementing a network in which high
frequency sensor are used. In our proposed system, we are
introducing a network establishment process using high
frequency sensor used in vehicles. We will create a kiosk
which will connect all the villages situated nearby kiosk’s
location. All the villages will connect to the server
(internet). This process is useful in medical system. A
person can use this connection to upload patient’s symptoms
& get medical help as soon as possible.
Fig. 2: Network Connectivity Model
A. Algorithm
When the one node encounters another node, then we
subtract the simulation time and last encounter Time and
compare them with I_TYP (typical interconnection time in
seconds value I_TYP=1800)
(SimulationTime - LastEncounterTime) < I_TYP)
With the help of that we can change the delivery probability
calculation
if(LastEncounterTime==0)
PEncounter = PEncMax;
Else
if((SimulationTime - LastEncounterTime) < I_TYP)
{
PEncounter=PEncMax*((SimulationTime -
LastEncounterTime)/ I_TYP);
}
Else
{
PEncounter = PEncMax;
double oldValue = getPredFor (host);
double newValue = oldValue + (1-oldValue) *
PEncounter;
preds.put(host, newValue);
LastEncounterTime.put(host, simulationTime);
}
1) We can improve the time of message holding by every
node by increasing the value of aging constant (old
value of aging constant is 0.98 to new values of aging
constant is 0.999885791).
The predictabilities intended for every destinations D further
than E are “aged”
P(M,D)new = P(M,D)old * YK
2) Predictabilities be exchange among and E, they are
transitive property of the predictability of endpoint
Dintended for which E have a P(E,D) value on the
statement that M is likely to meet E again.
Double pold = getPredFor(e.getKey());
pNew = pForHost * e.getValue()*beta;
if(pNew > pold)
preds.put(e.getkey(), pNew);
}
}
P(M,D)new = P(M,D)old +(1-P(M,D)old) * P(M,E) *
P(E,D) * B where B is a scaling constant.
In our proposed work we improved the value of
B(transitivity property), if the last encounter time of node is
near to the old than we will take the old value otherwise we
will take the new value.
4. An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing for Rural Areas
(IJSRD/Vol. 3/Issue 10/2015/174)
All rights reserved by www.ijsrd.com 801
VI. RESULT ANALYSIS
A. Buffer Time
Number of
Nodes
Epidemic
Routing
Prophet
Routing
Prophet2
Routing
20 2680 2745 2786
25 2276 2575 2523
30 2714 2887 2989
Table 1: Shows the buffer time of Epidemic, Prophet, and
ProphetV2.
B. Latency
Number of
Nodes
Epidemic
Routing
Prophet
Routing
Prophet2
Routing
20 2375 2523 2076
25 2501 2157 2494
30 3023 2948 3012
Table 2: Shows the latency of Epidemic, Prophet, and
ProphetV2.
In the table 1&2 shown above consider three different
routing protocols such as Epidemic, Prophet, and Prophetv2
for varying number of nodes. For buffer time and latency the
table shown number of node increase our proposed
prophetv2 buffer time and latency decreases.
Fig. 3: Shows Comparison of number of nodes and drop
relay routing protocols
Figure 3. Shows the relay routing for different values of
routing protocols. The relay of routing shows the proposed
protocol is better from prophet when no. of nodes is 20. But
when increase in number of nodes prophet and prophetv2
the relay of routing is bitter difference. As the number of
nodes increases the relay of proposed protocol also
improved.
Fig. 4: Shows Comparison of number of nodes and delivery
probability routing protocols
Figure4. Shows the delivery probability for different values
of routing protocols. The delivery_probability of the
prophetv2 protocol is higher than the Epidemic, Prophet as
the number of nodes increases. At 20 nodes the delivery
prob of epidemic is slightly better than other protocol but as
no. of nodes increases proposed prophetV2 is better from
other protocol. As the number of nodes increases the
delivery probability of proposed protocol also increases.
Fig. 5: Shows Comparison of number of nodes and delivery
packet
Figure 5. Shows the delivery packet for different values of
routing protocols. The delivery of maximum packets shows
the message sending capability of the proposed protocol.
The number of packets sent by the ProphetV2 protocol is
better than PROPHET, and Epidemic routing protocols as
no. of nodes increases. As the number of nodes increases the
packet delivery of proposed protocol also increases.
VII. CONCLUSION
In this work, we have proposed an enhanced routing for the
opportunistic networks and also performance evaluated
across a performance range‟ values, in the comparison using
Epidemic, PROPHET and PROPHETV2 routings. We have
observed that the proposed enhanced routing is able to the
meet out the issue of other different routing method for the
networks opportunistic, particularly the information delivery
and delay probability, when the context knowledge about
5. An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing for Rural Areas
(IJSRD/Vol. 3/Issue 10/2015/174)
All rights reserved by www.ijsrd.com 802
user is accessible or not. The current findings clearly
indicate that the context-based forwarding is a most
interesting communication method in the opportunistic
networks; however, in flooding-based protocols comparison
it is not appropriate. The current routing is able to provide
improved outcome in the presence as well as context
knowledge absence, particularly in term of data delivery and
delay probability.
REFERENCES
[1] Abey Abraham Jebapriya S “Routing strategies in Delay
Tolerant Networks: a Survey” International Journal of
Computer Applications (0975 – 8887) Volume 42–
No.19, March 2012.
[2] W. Zhao, M. Ammar, and E. Zegura.,2005 Multicasting
in delay tolerant networks: Semantic models and routing
algorithms. Technical report, College of Computing,
Georgia Institute of Technology.
[3] Borgia, E., Conti, M., Delmastro, F. and Pelusi, L.
(2005) „Lessons from an Ad-Hoc network test-bed:
middleware and routing issues‟, Ad Hoc and Sensor
Wireless Networks, an International Journal, Vol. 1.
[4] Pelusi, L., Passarella, A. and Conti, M. (2006)
„Opportunistic networking: data forwarding in
disconnected mobile ad hoc networks‟, IEEE
Communications Magazine, Vol. 44, pp.134–141.
[5] Marco Conti and Mohan Kumar, “Opportunities in
opportunistic computing” Published by the IEEE
Computer Society, JANUARY 2010, pp. 42-50.
[6] Fall, K. (2003) „A delay-tolerant network architecture
for challenged internets‟, Paper presented in the
Proceedings of the 2003 ACM Conference on
Applications, Technologies, Architectures, and Protocols
for Computer Communications (SIGCOMM 2003),
pp.27–34.
[7] Jain, S., Fall, K. and Patra, R. (2004) „Routing in a delay
tolerant network‟, Paper presented in the Proceedings of
the 2004 ACM Conference on Applications,
Technologies, Architectures, and Protocols for Computer
Communications (SIGCOMM 2004), pp.145–158, New
York, NY: ACM.
[8] Mr.VIKASH, R.K.Singh “A Survey on Comparative
Study of RoutingProtocol in Delay-Tolerant Networks”
(IJCSIT) International Journal of Computer Science and
Information Technologies, Vol. 6 (2) , 2015, 1731-1736.
[9] T. Spyropoulos, K. Psounis, and C.S. Raghavendra,
“Efficient Routing in Intermittently Connected Mobile
Networks: The Multiple-Copy Case,” IEEE/ACM Trans.
Networks, vol. 16, no. 1, pp. 77-90, Feb. 2008.
[10] Anshul Verma, Dr. Anurag Srivastava “Integrated
Routing Protocol for Opportunistic Networks” IJACSA)
International Journal of Advanced Computer Science
and Applications, Vol. 2, No.3, March 2011 .
[11] B.Shubashin, Dr.Antony Selvadoss Thanamani “An
Opportunistic On Routing Protocols and Persisting
Challenges in Delay-Tolerant Networking” International
Journal of Innovative Research in Computer and
Communication Engineering (An ISO 3297: 2007
Certified Organization) Vol. 2, Issue 8, August 2014.
[12] Sushant Jain, Kevin Fall, Rabin Patra “Routing in a
Delay Tolerant Network” SIGCOMM’04, Aug. 30–Sept.
3, 2004, Portland, Oregon, USA. Copyright 2004 ACM
1581138628/ 04/0008. ...$5.00.