In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSNpaperpublications3
Abstract: For Hybrid wireless network there is need of efficient data routing protocol for improvement of network capability and scalability. By using Distributed Three Hop routing protocol (DTR), we improve capacity of Hybrid network and Reduce overhead. In early Two- Hop Transmission protocol is used for eliminate route maintenance and limited number of hop in routing for Hybrid Wireless Network but it only considers the node transmission within a single cell while DTR can Also deals with Inter-cell communication in real word. DTR is Top-quality from Other routing Protocol to analyses the hybrid wireless networks with the parametric quantity such as throughput, QoS, packet loss, overhead (due to traffic), channel quality, load balancing, routing delivery, scalability and power consumption. DTR also has a congestion control algorithm to avoid load congestion in base station in the case of unbalanced traffic distributions in networks. DTR makes significantly lower overhead by eliminating route monitoring and maintenance. To enhance the efficiency of routing protocol in wireless network Weight Based Data Assignment technique is used for data allocation in distributed routing protocol using the technique of least delay detection to maintain less data congestion in the network . for that DTR divides a message data stream into segments and transmits the segments in a distributed manner.
Keywords: Data Fragmentation, Responses Delay, Hybrid Wireless Network, Three of Routing Protocol, Fuzzy Logic.
Title: Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSN
Author: Amruta A. Mandhare, Kashmira J. Mayekar, Sayali L. Khanekar, Sarika V.Bodake, Sayali S. Bale.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
An optimistic sector oriented approach to mitigate broadcast storm problem in...IAEME Publication
In mobile ad hoc networks (MANETs), due to frequent changes in topology there exist more
link breakages which lead to high rate of path failures and route discoveries, which cause an
increased routing control overhead. Thus, it is necessary to reduce the overhead of route discovery in
the design of routing protocols for MANETs. In a route discovery, broadcasting may be an
elementary and effective data dissemination mechanism, wherever a mobile node blindly
rebroadcasts the first received route request packets unless it has a route to the destination, and
therefore it causes the broadcast storm problem. This paper proposes an optimistic approach OpSOA
to mitigate the broadcasting storm problem and to scale back the communication overheads of
routing protocols by forming sectors within the network and finding the route to destination by two
sectors at a time. The simulation result shows that the proposed mechanism substantially reduces
route requests. Since the proposed protocol searches for the destination sector wise thereby reducing
network wide broadcast of routing requests, traffic, collision and contention. There by there can be
an increase in the packet delivery ratio and decrease in the average end-to-end delay
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSNpaperpublications3
Abstract: For Hybrid wireless network there is need of efficient data routing protocol for improvement of network capability and scalability. By using Distributed Three Hop routing protocol (DTR), we improve capacity of Hybrid network and Reduce overhead. In early Two- Hop Transmission protocol is used for eliminate route maintenance and limited number of hop in routing for Hybrid Wireless Network but it only considers the node transmission within a single cell while DTR can Also deals with Inter-cell communication in real word. DTR is Top-quality from Other routing Protocol to analyses the hybrid wireless networks with the parametric quantity such as throughput, QoS, packet loss, overhead (due to traffic), channel quality, load balancing, routing delivery, scalability and power consumption. DTR also has a congestion control algorithm to avoid load congestion in base station in the case of unbalanced traffic distributions in networks. DTR makes significantly lower overhead by eliminating route monitoring and maintenance. To enhance the efficiency of routing protocol in wireless network Weight Based Data Assignment technique is used for data allocation in distributed routing protocol using the technique of least delay detection to maintain less data congestion in the network . for that DTR divides a message data stream into segments and transmits the segments in a distributed manner.
Keywords: Data Fragmentation, Responses Delay, Hybrid Wireless Network, Three of Routing Protocol, Fuzzy Logic.
Title: Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSN
Author: Amruta A. Mandhare, Kashmira J. Mayekar, Sayali L. Khanekar, Sarika V.Bodake, Sayali S. Bale.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...IJCERT
IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
http://www.ijcert.org offers Discount for Indian research Scholars
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Analysis of multi hop relay algorithm for efficient broadcasting in manetseSAT 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
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK ijiert bestjournal
There are number of routing protocols proposed for the data transmission in WSN. Initially single path routing schemes with number of variations are proposed. Sti ll there were some drawbacks in single path routing . Single path routing was unable to provide the reliability and h igh throughput. Also security level was not conside red while routing. Recently,to remove the drawbacks of the s ingle path routing new routing technique is propose d called as multipath routing. In this paper we discussed the different multipath routing protocols with number of variants. Initiall y multipath routing was proposed for the purpose of guaranteed delivery of packet to sink in case of link or node failure. There are other protocols which are proposed for the reli ability,energy saving,security and high throughpu t. Some multipath routing protocols have discussed the load balancing and security during packet transmission.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
Rate Adaptation for Time Varying Channels Using Distributed Relay Selectionpaperpublications3
Abstract: Fixed systems used in cooperative communication suffer from multiplexing loss and low spectral efficiency due to the half duplex constraint of relays. To improve the multiplexing gain, successive relaying is proposed. This allows concurrent transmission of the source and relays. However, the severe inter-relay interference becomes a key challenge. Here Rate Adaptation for Time Varying Channels Using Distributed Relay Selection is proposed, which is capable of adapting the relay’s rate using distributed relay selection.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Experimental analysis of channel interference in ad hoc networkijcsa
In recent times, the use of ad hoc networks is a common research area among a researcher. Designing an
efficient and reliable network is not easy task. Network engineer faces many problems at the time of
deploying a network such as interference; Signal coverage, proper location of access point etc. channel
interference in one of them which must be considered at the time of deploying WLAN indoor environments
because channel interference impacts the network throughput and degrade the network performance.
In this experiment, we design a two WLAN BSS1 and BSS2 and investigate the impact of interference on
nodes. BSS1 contains three FTP clients and BSS2 contains two FTP client and their jobs is to upload data
to FTP Server Initially, they are far from each other. BSS1 moves toward BSS2 and after some time at
particular position both BSSs overlaps to each other. When BSSs overlaps to each other interference is
high and decrease network performance and increase upload time.
Decreasing of quantity of radiation de fects inijcsa
Recently we introduced an approach to increase sharpness of diffusion-junction and implanted-junction
heterorectifiers. The heterorectifiers could by single and as a part of heterobipolar transistors. However
manufacturing p-n-junctions by ion implantation leads to generation of radiation defects in materials of
heterostructure. In this paper we introduce an approach to use an overlayer and optimization of annealing
of radiation defects to decrease quantity of radiation defects.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...IJCERT
IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
http://www.ijcert.org offers Discount for Indian research Scholars
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
Optimized Link State Routing (OLSR) protocol is a proactive type of routing protocol that uses Multipoint
Relay (MPR) set as the virtual backbone structure. The existing literature has identified various issues with
respect to its backbone structure and has accordingly proposed improvements. In this paper, the focus is on
improving the OLSR protocol by employing a Connected Dominating Set (CDS) based virtual backbone
structure that is dynamically adaptable to rapid topology changes. A new Dynamically Adaptable Improved
Optimized Link State Routing (DA-IOLSR) protocol is proposed that uses the local topology information to
adapt the virtual backbone to topology changes. This assumes significance especially in networks that
experience very high mobility. Changes in the network topology caused by node additions, node deletions
and node mobility are taken care of. Simulations are carried out to assess the performance of DA-IOLSR
protocol and OLSR protocol. Packet delivery achieved by both the protocols is examined under varying
mobility by using various combinations of node speed and pause time values. It is found that DA-IOLSR
protocol provides better packet delivery as compared to OLSR protocol, under varying mobility conditions.
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
ENERGY EFFICIENT MULTICAST ROUTING IN MANET ijac journal
In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive
Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for
Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design
where the network layer and medium access control layer functionality are done in a single integrated
layer design. The basic design of the architecture is to establish and maintain an active multicast tree
surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling
the particular node from sleep to awake mode while the remaining nodes of the same path are maintained
at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across
nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons
are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides
superior energy efficiency, competitive QoS performance and bandwidth efficiency.
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self-administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction normalized routing load, average end to end delay by varying speed of nodes, traffic sources and mobility.
Analysis of multi hop relay algorithm for efficient broadcasting in manetseSAT 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
A SURVEY ON MULTIPATH ROUTING STRATEGY IN MULTI-HOP WIRELESS SENSOR NETWORK ijiert bestjournal
There are number of routing protocols proposed for the data transmission in WSN. Initially single path routing schemes with number of variations are proposed. Sti ll there were some drawbacks in single path routing . Single path routing was unable to provide the reliability and h igh throughput. Also security level was not conside red while routing. Recently,to remove the drawbacks of the s ingle path routing new routing technique is propose d called as multipath routing. In this paper we discussed the different multipath routing protocols with number of variants. Initiall y multipath routing was proposed for the purpose of guaranteed delivery of packet to sink in case of link or node failure. There are other protocols which are proposed for the reli ability,energy saving,security and high throughpu t. Some multipath routing protocols have discussed the load balancing and security during packet transmission.
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...Eswar Publications
Ad hoc networks are collections of mobile nodes communicating with each other using wireless media without any fixed infrastructure. During both route discovery and traversal of route-reply packets from destination to source,
broadcast of packets is required which incurs huge message cost. The present article deals with the message cost
reduction during transmission of route-reply from destination to source. Also the redundancy that is visible within the 2-hop neighborhood of a node is minimized during broadcasting of route-reply. This improves the average lifetime of network nodes by decreasing the possibility of network partition. The scheme of 2NI can be used with any reactive routing protocol in MANETs.
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
A Mobile Ad-Hoc Network (MANET) is a decentralized network of mobile node that are connected to an arbitrary topology via wireless connections. The breakdown of the connecting links between adjacent nodes will probably lead to the loss of the transferred data packets. In this research, we proposed an algorithm for link prediction (LP) to enhance the link break provision of the ad hoc on-demand remote protocol (AODV). The proposed algorithm is called the AODV Link Break Prediction (AODVLBP). The AODVLBP prevents link breaks by the use of a predictive measure of the changing signal. The AODVLBP was evaluated using the network simulator version 2.35 (NS2) and compared with the AODV Link prediction (AODVLP) and the AODV routing protocols. The simulation results reveal the effectiveness of AODVLBP in improving network performance in terms of average end-to-end delay, packet delivery ratio, packet overhead ratio, and packet drop-neighbour break.
Rate Adaptation for Time Varying Channels Using Distributed Relay Selectionpaperpublications3
Abstract: Fixed systems used in cooperative communication suffer from multiplexing loss and low spectral efficiency due to the half duplex constraint of relays. To improve the multiplexing gain, successive relaying is proposed. This allows concurrent transmission of the source and relays. However, the severe inter-relay interference becomes a key challenge. Here Rate Adaptation for Time Varying Channels Using Distributed Relay Selection is proposed, which is capable of adapting the relay’s rate using distributed relay selection.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Experimental analysis of channel interference in ad hoc networkijcsa
In recent times, the use of ad hoc networks is a common research area among a researcher. Designing an
efficient and reliable network is not easy task. Network engineer faces many problems at the time of
deploying a network such as interference; Signal coverage, proper location of access point etc. channel
interference in one of them which must be considered at the time of deploying WLAN indoor environments
because channel interference impacts the network throughput and degrade the network performance.
In this experiment, we design a two WLAN BSS1 and BSS2 and investigate the impact of interference on
nodes. BSS1 contains three FTP clients and BSS2 contains two FTP client and their jobs is to upload data
to FTP Server Initially, they are far from each other. BSS1 moves toward BSS2 and after some time at
particular position both BSSs overlaps to each other. When BSSs overlaps to each other interference is
high and decrease network performance and increase upload time.
Decreasing of quantity of radiation de fects inijcsa
Recently we introduced an approach to increase sharpness of diffusion-junction and implanted-junction
heterorectifiers. The heterorectifiers could by single and as a part of heterobipolar transistors. However
manufacturing p-n-junctions by ion implantation leads to generation of radiation defects in materials of
heterostructure. In this paper we introduce an approach to use an overlayer and optimization of annealing
of radiation defects to decrease quantity of radiation defects.
Regularized Weighted Ensemble of Deep Classifiers ijcsa
Ensemble of classifiers increases the performance of the classification since the decision of many experts
are fused together to generate the resultant decision for prediction making. Deep learning is a classification algorithm where along with the basic learning technique, fine tuning learning is done for improved precision of learning. Deep classifier ensemble learning is having a good scope of research.Feature subset selection is another for creating individual classifiers to be fused for ensemble learning. All these ensemble techniques faces ill posed problem of overfitting. Regularized weighted ensemble of deep support vector machine performs the prediction analysis on the three UCI repository problems IRIS,Ionosphere and Seed data set, thereby increasing the generalization of the boundary plot between the
classes of the data set. The singular value decomposition reduced norm 2 regularization with the two level
deep classifier ensemble gives the best result in our experiments.
Spams are unwanted and also undesirable emails which are mass sent to the numerous victims. Further
penetration of spams into electronic processors and communication equipments such as computers and
mobiles as well as lack of control on the information shared on the internet and other communication
networks and also inefficiency of the spam detecting methods developed for Persian contexts are among the
main challenging issues of the Persian subscribers. This paper presents a novel and efficient method for
thematic identification of Persian spams. The proposed method is capable of identifying the Persian, spams
and also “Penglish” spams. “Penglish” is made up of two words Persian and English and demonstrates a
Persian text which is written by English alphabetic letters. Based on the experimental analysis of the 10000
spams of different type the efficiency of the proposed method is evaluated to be more than 98%. The
presented method is also capable of updating its databases taking the advantage of the feedbacks received
from the users.
PERFORMANCE EVALUATION OF TUMOR DETECTION TECHNIQUES ijcsa
Automatic segmentation of tumor plays a vital role in diagnosis and surgical planning. This paper deals
with techniques which providing solution for detecting hepatic tumor in Computed Tomography (CT)
images. The main aim of this work is to analyze performance of tumor detection techniques like Knowledge
Based Constraints, Graph Cut Method and Gradient Vector Flow active contour. These three techniques
are computed using sensitivity, specificity and accuracy. From the evaluated result, knowledge based
constraints method is better than other graph cut method and gradient vector flow active contour.
IMPLEMENTATION OF SECURITY PROTOCOL FOR WIRELESS SENSORijcsa
Intrusion Detection is one of the methods of defending against these attacks. In the proposed a security protocol for homogeneous wireless sensor network; network with all nodes are of same type. Clustering is used to improve the energy efficiency. Zone-Based Cluster Protocol (ZBCA) is used for selection of cluster head which is effective in scalability and energy consumption. Single hop technique is used for
communication within normal nodes and cluster head to base station. Simulation of proposed algorithm is performed in MATLAB. Sleep Deprivation Attack has been analyzed where attacker changes the environmental values by an artificial event. Attacker produces an event in environment due to which nodes have to sense the environment more than once in the same round that increase the power consumption of
the node. This interrupt reduces the network life time as nodes are not allowed to go in sleep mode and they are not able to perform their function of data collection and reporting to Cluster head and Base Station properly. Proposed protocol identifies this attack and prevents it from happening by solating the attacker node.
With the surge in modern research focus towards Pervasive Computing, lot of techniques and challenges
needs to be addressed so as to effectively create smart spaces and achieve miniaturization. In the process of
scaling down to compact devices, the real things to ponder upon are the Information Retrieval challenges.
In this work, we discuss the aspects of multimedia which makes information access challenging. An
Example Pattern Recognition scenario is presented and the mathematical techniques that can be used to
model uncertainty are also presented for developing a system that can sense, compute and communicate in
a way that can make human life easy with smart objects assisting from around his surroundings.
PERFORMANCE EVALUATION OF TUMOR DETECTION TECHNIQUES ijcsa
Automatic segmentation of tumor plays a vital role in diagnosis and surgical planning. This paper deals
with techniques which providing solution for detecting hepatic tumor in Computed Tomography (CT)
images. The main aim of this work is to analyze performance of tumor detection techniques like Knowledge
Based Constraints, Graph Cut Method and Gradient Vector Flow active contour. These three techniquesare computed using sensitivity, specificity and accuracy. From the evaluated result, knowledge based constraints method is better than other graph cut method and gradient vector flow active contour.
A ROBUST APPROACH FOR DATA CLEANING USED BY DECISION TREEijcsa
Now a day’s every second trillion of bytes of data is being generated by enterprises especially in internet.To achieve the best decision for business profits, access to that data in a well-situated and interactive way is always a dream of business executives and managers. Data warehouse is the only viable solution that can bring the dream into veracity. The enhancement of future endeavours to make decisions depends on the availability of correct information that is based on quality of data underlying. The quality data can only be produced by cleaning data prior to loading into data warehouse since the data collected from different sources will be dirty. Once the data have been pre-processed and cleansed then it produces accurate results on applying the data mining query. Therefore the accuracy of data is vital for well-formed and reliable decision making. In this paper, we propose a framework which implements robust data quality to ensure consistent and correct loading of data into data warehouses which ensures accurate and reliable data analysis, data mining and knowledge discovery.
This work is proposed the feed forward neural network with symmetric table addition method to design the
neuron synapses algorithm of the sine function approximations, and according to the Taylor series
expansion. Matlab code and LabVIEW are used to build and create the neural network, which has been
designed and trained database set to improve its performance, and gets the best a global convergence with
small value of MSE errors and 97.22% accuracy.
3 d single gaas co axial nanowire solar cell for nanopillar-array photovoltai...ijcsa
Nanopillar array photovoltaics give unique advantages over today’s planar thin films in the areas of
optical properties and carrier collection, arising from their 3D geometry. The choice of the material
system, however, is essential in order to gain the advantage of the large surface/interface area associated
with nanopillars. Therefore, a well known Si and GaAs material are used in the design and studied in this
nanowire application. This work calculates and analyses the performance of the coaxial GaAs nanowire
and compared with that of Si nanowire using a semi-classical method. The current-voltage characteristics
are investigated for both under dark and AM1.5G illumination. It is found that GaAs nanowire gives almost
double efficiency with its counterpart Si nanowire. Their TCAD simulations can be validated reasonably
with that of published experimental result.
A HYBRID COA-DEA METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS ijcsa
The Cuckoo optimization algorithm (COA) is developed for solving single-objective problems and it cannot be used for solving multi-objective problems. So the multi-objective cuckoo optimization algorithm based on data envelopment analysis (DEA) is developed in this paper and it can gain the efficient Pareto frontiers. This algorithm is presented by the CCR model of DEA and the output-oriented approach of it.The selection criterion is higher efficiency for next iteration of the proposed hybrid method. So the profit function of the COA is replaced by the efficiency value that is obtained from DEA. This algorithm is
compared with other methods using some test problems. The results shows using COA and DEA approach for solving multi-objective problems increases the speed and the accuracy of the generated solutions.
Basic survey on malware analysis, tools and techniquesijcsa
The term malware stands for malicious software. It is a program installed on a system without the
knowledge of owner of the system. It is basically installed by the third party with the intention to steal some
private data from the system or simply just to play pranks. This in turn threatens the computer’s security,
wherein computer are used by one’s in day-to-day life as to deal with various necessities like education,
communication, hospitals, banking, entertainment etc. Different traditional techniques are used to detect
and defend these malwares like Antivirus Scanner (AVS), firewalls, etc. But today malware writers are one
step forward towards then Malware detectors. Day-by-day they write new malwares, which become a great
challenge for malware detectors. This paper focuses on basis study of malwares and various detection
techniques which can be used to detect malwares.
Nowadays peoples are actively involved in giving comments and reviews on social networking websites
and other websites like shopping websites, news websites etc. large number of people everyday share
their opinion on the web, results is a large number of user data is collected .users also find it trivial task
to read all the reviews and then reached into the decision. It would be better if these reviews are
classified into some category so that the user finds it easier to read. Opinion Mining or Sentiment
Analysis is a natural language processing task that mines information from various text forms such as
reviews, news, and blogs and classify them on the basis of their polarity as positive, negative or neutral.
But, from the last few years, user content in Hindi language is also increasing at a rapid rate on the Web.
So it is very important to perform opinion mining in Hindi language as well. In this paper a Hindi
language opinion mining system is proposed. The system classifies the reviews as positive, negative and
neutral for Hindi language. Negation is also handled in the proposed system. Experimental results using
reviews of movies show the effectiveness of the system.
Artificial neural network approach for more accurate solar cell electrical ci...ijcsa
The implementation of a neural network especially for improving the accuracy of the electrical equivalent
circuit parameters of a solar cell is proposed. These electrical parameters mainly depend on solar
irradiation and temperature, but their relationship is nonlinear and cannot be easily expressed by any
analytical equation. Therefore, the proposed neural network is trained once by using some measured
current–voltage curves, and the equivalent circuit parameters are estimated by only reading the samples of
solar irradiation and temperature very quickly. Taking the effect of sunlight irradiance and ambient
temperature into consideration, the output current and power characteristics of PV model are simulated
and optimized. Finally, the proposed model has been validated with datasheet and experimental data from
commercial PV module, Kotak PV-KM0060 (60Wp).The comparison show the higher accuracy of the ANN
model than the conventional one diode circuit model for all operating conditions.
Crime and violence are inherent in our political and social system. With the moving pace of technology, the
popularity of internet grows continuously, with not only changing our views of life, but also changing the
way crime takes place all over the world. We need a technology that can be used to bring justice to those
who are responsible for conducting attacks on computer systems across the globe. In this paper, we present
various measures being taken in order to control and deal with the crime related to digital devices. This
paper gives an insight of Digital Forensics and current situation of India in handling such type of crimes.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
A NEW IMPROVED QUANTUM EVOLUTIONARY ALGORITHM WITH MULTIPLICATIVE UPDATE FUNC...ijcsa
The Quantum Evolutionary Algorithm (QEA) is a new subcategory of evolutionary computation in which
the principles and concepts of quantum computation are used, and to display the solutions it utilizes a
probabilistic structure.Therefore, it causes an increase in the solution space. This algorithm has two major
problems: hitchhiking phenomenon and slow convergence speed.In this paper, to solve the problems a
multiplicative update function called quantum gate is proposed that in addition to considering the best
global solution ، considers the best solution of each generation. The results of one max and knapsack
problems and five famous numerical functions show that the proposed method has a significant advantage
compared with the basic algorithm in terms of performance, quality of solutions and convergence speed.
MODELLING FOR CROSS IGNITION TIME OF A TURBULENT COLD MIXTURE IN A MULTI BURN...ijcsa
The impact of Cross Ignition process (CI) in the gas turbine operation and environmental issue is still
investigated for extending the efficiency of gas turbine engines and meanwhile decreasing the environment
pollution.This paper presents various constructive influential parameters and analysis of their related
interaction during CI. A developed computational model for determination of cross-ignition time (CIT) is
proposed, based on previous relevant models for thermal analysis and for distinguishing of heat fluxes in
combustion processes.
Due to the first analysis of theoretical results, experimental investigation for various operating conditions
were essential to validate the developed computational model of the CIT. Thus, a simple experimental test
rig is designed for this purpose, and for validation of certain conditions of the computational model.
Meanwhile, for expanding the investigations in higher energy conversion and reducing expensive testprocedures,
that are conducted during critical test running, a new strategy is proposed for simulating the
thermal heat fluxes throughout the burners compartment model by implementation of Computational Fluid
Dynamic (CFD).
Finally, new constructive criteria based on the validated investigations will enable the future generation of
gas turbine combustors to operate in critical conditions.
COMPARISON AND EVALUATION DATA MINING TECHNIQUES IN THE DIAGNOSIS OF HEART DI...ijcsa
Heart disease is one of the biggest health problems in the world because of high mortality and morbidity
caused by the disease. The use of data mining on medical data brought valuable and effective life
achievements and can enhance medical knowledge to make necessary decisions. Data mining plays an
important role in the field of medical science to solve health problems and diagnose ailments in critical
conditions and in normal conditions. For this reason, in this paper, data mining techniques are used to
diagnose heart disease from a dataset that includes 200 samples from different patients. Techniques used to
diagnose heart disease include Bagging, AdaBoostM1, Random Forest, Naive Bayes, RBF Network, IBK,
and NNge that all the techniques used to diagnose heart disease use Weka tool. Then these techniques are
compared to determine which is more accurate in the diagnosis of heart disease that according to the
results, it was found that the RBF Network with the accuracy of 88.2% is the most accurate classification in
the diagnosis of heart disease.
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
Energy Saving DSR and Probabilistic Rebroadcast Mechanism are used to Increas...IJTET Journal
Abstract- MANETs are infrastructure less and can be set up anytime anywhere. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data broadcasting mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem and without consider the nodes energy level of route selection it leads to reduce the network lifetime. In this paper proposed to focus is on a two mechanism ESDSR and Neighbor coverage based Probabilistic rebroadcast to overcome those problems. A Energy Saving Dynamic Source Routing in MANETs (ESDSR) which will efficiently utilize the battery power consideration in the route selection time of mobile nodes in such a way that the network will get more life time and Neighbor coverage based Probabilistic rebroadcast mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. The simulation was carried out using the NS-2 network simulator.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
Detecting Good Neighbor Nodes and Finding Reliable Routing Path Based on AODV...IOSR Journals
Wireless operations allow services, such as long-range communications, that are impossible or
impractical to implement with the use of wires. It is supported by well-liked technique known as Adhoc Protocol
[1]. The term is commonly used in the telecommunications industry to refer to telecommunications systems e.g.
radio transmitters and receivers, remote controls etc. which use some form of energy e.g. radio waves, acoustic
energy, etc. to transfer information without the use of wires.[1] Information is transferred in this manner over
both short and long distances.In this, routes may be detached due to lively movement of nodes. So route
assortment and topology grouping is not easy and demanding issue. This type of networks is more vulnerable to
both internal and external attacks due to presence of wicked neighbour nodes[1][2s. Paper see the sights new
method using AODV protocol to find out good neighbour node and finding reliable path according to their
signal strength, flow capacity relative position of node in network.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
Abstract : As the network size increases the probability of congestion occurrence at nodes increases. This is because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses. In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing (IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput and packet delivery fraction. Keywords- DSDV, Hybrid protocol, AODV, IAODV, MANET
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
ROUTING IN OPTICAL MESH NETWORKS-A QOS PERSPECTIVEijasuc
Wireless Ad-Hoc Mesh Networks are characterized by static nodes connected in a mesh topology. A routing
protocol discovers and maintains the route for successful transmission of data in a network. The routing
protocol should also provide load balancing and fault tolerance for improved network performance. In
Free Space Optical networks (FSO) line of sight (LOS) should be maintained between the two
communicating nodes. In a multihop scenario maintaining LOS during routing is a challenge. In this paper
we propose a routing protocol Quality of Service-Directional Routing Protocol (QDRP) - which assures a
certain level of performance to a data flow in terms of delay and implemented on FSO MANET. Through
simulations it is observed that QDRP chooses the path with the least delay and performs satisfactorily
under varying node densities and transmission rates achieving end to end delay of .14 s and packet delivery
percentage of 96% when simulated for an area of 1300 m *1300 m for 100 nodes. This work explores the
potential of the proposed routing protocol for free space optical mesh networks. QDRP is compared with
ORRP (Orthogonal Rendezvous Routing Protocol) and AODV (Ad-Hoc on Demand Distance Vector), a
reactive protocol which is also implemented in free space optical environment. We support our conclusions
that QDRP gains in terms of packet delivery percentage, end to end delay and goodput.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR
ROUTING IN OPTICAL MESH NETWORKS-A QOS PERSPECTIVEijasuc
Wireless Ad-Hoc Mesh Networks are characterized by static nodes connected in a mesh topology. A routing
protocol discovers and maintains the route for successful transmission of data in a network. The routing
protocol should also provide load balancing and fault tolerance for improved network performance. In
Free Space Optical networks (FSO) line of sight (LOS) should be maintained between the two
communicating nodes. In a multihop scenario maintaining LOS during routing is a challenge. In this paper
we propose a routing protocol Quality of Service-Directional Routing Protocol (QDRP) - which assures a
certain level of performance to a data flow in terms of delay and implemented on FSO MANET. Through
simulations it is observed that QDRP chooses the path with the least delay and performs satisfactorily
under varying node densities and transmission rates achieving end to end delay of .14 s and packet delivery
percentage of 96% when simulated for an area of 1300 m *1300 m for 100 nodes. This work explores the
potential of the proposed routing protocol for free space optical mesh networks. QDRP is compared with
ORRP (Orthogonal Rendezvous Routing Protocol) and AODV (Ad-Hoc on Demand Distance Vector), a
reactive protocol which is also implemented in free space optical environment. We support our conclusions
that QDRP gains in terms of packet delivery percentage, end to end delay and goodput.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Efficient Destination Discovery using Geographical Gossiping in MANETsidescitation
Due to dynamic topology of Mobile ad hoc networks (MANETS), early designs of
routing protocols incur a large number of discovery packets while trying to discover a route
to a destination node in the network. To reduce the number of discovery packets,
geographical information assisted routing protocols came into picture. In case of
geographical ad hoc routing protocols, there is no need to discover a route to a destination
node. But, they need to discover the fresh location of a destination node to deliver data
packets to the destination location. Geographical information assisted ad hoc routing
protocols reduce discovery packet overhead using past information about the destination
node such as location, velocity and direction of motion. When a source node does not have
any information about a destination node, the existing geographical routing protocols use
flooding techniques or location database server to know the present location of the
destination. A flooding technique or a location database server induces large number of
control packets in the network. To reduce the number of control packets during location
discovery, we propose a novel geographical gossiping technique for MANETs. The
technique basically uses two types of gossiping viz. selective and random gossiping. We have
evaluated the performance of the proposed technique using qualnet simulator and
compared its performance with flooding technique and probability based gossiping
technique. The simulation results clearly show that our technique has considerably reduced
control packet overhead compared to flooding and probability based gossiping technique.
Similar to IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANET (20)
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANET
1. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
DOI:10.5121/ijcsa.2015.5504 39
IMPROVING PACKET DELIVERY RATIO WITH
ENHANCED CONFIDENTIALITY IN MANET
S.VASUDEVI
1
AND D.MARYPONRANI
2
1
Final year PG Student, 2
Assistant Professor
Department of Computer Science Engineering,
Dr.Sivanthi Aditanar College of Engineering, Tiruchendur, India
ABSTRACT
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need
of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.
The number of RREQ packet in the network gets added due to the increased amount of link failures. This
result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET.
KEYWORDS
MANET, routing protocols, routing overhead, Packet delivery ratio, cryptography algorithms.
1.INTRODUCTION
In Mobile Ad hoc networks, the nodes are considered to be mobile and the communication among
those nodes are done through dynamic routes. Here the route initially discovered gets change
from time to time because of the nodes mobility. This redundant route discovery causes the heavy
routing overhead and result in huge number of packet loss. Consequently it affects the delivery
rate of packets. So there is a great challenge in designing the routing protocol that suits host
mobility and link failure in MANET
The routing protocol in MANET are divided into three categories such as Proactive routing,
Reactive routing and Hybrid routing protocol. In Proactive routing, every node computes the path
to every other node in the MANET and stored it in its own routing table. This routing table is
periodically updated whenever changes happened in the route among the nodes. In Reactive
routing, path between the nodes are computed only when the demand for the route is needed. This
routing protocol is also termed as On-demand routing protocol. The third category Hybrid routing
combines both proactive and Reactive routing principles.
AODV and DSR are some of the conventional On-demand routing protocol in MANET. Both of
them[2] [4] uses pure flooding for route discovery. In Pure flooding, every node that receives the
2. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
40
route request packet can rebroadcast it to its neighbours if it is not the intended destination. This
results in duplication of request packet in some nodes. This kind of redundant retransmission
leads to contention, collision and redundancy and leads to the storm problem.
To Reduce this storm problem, several methods [1] like area-based methods ,probability-based
methods, flooding, neighbor-knowledge method are introduced. Probabilistic Scheme, Counter
based Scheme and Distance based Schemes are used to shrink the effect of storm problem [1]. In
Probabilistic Scheme, RREQ is forwarded depends on the determined probability value. In
Counter based Scheme, forwarding decisions are taken by Expected Additional Coverage (EAC).
In Distance based scheme, node’s distances are used to decide the packet retransmission.
On demand Tree based Routing and Scalable Broadcasting Algorithm are some techniques which
helps to reduce redundant retransmission. By means of using Probabilistic routing, packet loss
due to routing overhead is somewhat reduced, but there is a problem in fixed probabilistic value.
By combining both neighbor knowledge and probabilistic method[10], problems in the DPR[9] is
solved and also Packet delivery rate gets increased. Therefore in our work NCPR[10] is selected
as a routing protocol.
By means of NCPR, defects in pure flooding are neglected, this also leads to increased Packet
delivery ratio. Additional protection in Packet delivery is obtained by using effective security
mechanisms like hybrid cryptographic techniques for encrypting and decrypting the data packets.
Here the combination of AES (Advanced Encryption Standard)[12] and RSA (Rivest-Shamir-
Adleman) [15] are used for ensuring secure delivery of the data packets. By this, confidentiality
is also maintained.
2.RELATED WORKS
The reason for using Ad hoc network widely is its quick deployment nature and its less
dependency on external infrastructure. But routing is the serious issue because of the nodes
frequent movement. Some of the conventional routing protocols AODV and DSR are discussed in
the reference papers [1] and [2]. AODV proposed by C. Perkins, E. Belding-Royer, and S. Das
[1] is intended for use in an ad hoc network and it provides quick adaptation to dynamic link
conditions. This protocol solves the count to infinity problem that occurs because of routing
loops in MANET. This protocol fails to solve the routing overhead and hello packet overhead and
thus affects packet delivery ratio in MANET.
The other conventional routing protocol DSR proposed by D. Johnson, Y. Hu and D. Maltz [2]
supports efficient routing in MANET. In the header of the RREQ packet, source route is
maintained in DSR. This leads to higher packet size and sometimes the performance of the
network is affected because of the presence of stale cache.
Broadcast Storm problem in MANET is described by S.Y. Ni, Y.C. Tseng, Y.S. Chen, and J.P.
Sheu in reference paper [4]. S.Y. Ni, et.al.., propose several schemes to reduce redundant
rebroadcasts and to vary the timing of rebroadcasts to solve the storm problem. Probabilistic
scheme, Distance-based scheme, Counter based scheme and Cluster based schemes are proposed
in[4]. In Probabilistic Scheme[5] rebroadcast is done based on the computed probability value. If
determined probability value is equal to 1, it is similar to pure flooding. In Counter-Based
Scheme[4] and [5], the counter threshold value is used to decide rebroadcast of RREQ. In that
paper, to control the unnecessary rebroadcast of RREQ Expected Additional Coverage(EAC) is
used. Retransmission is prevented in case of very low EAC value.
3. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
41
Scalable Broadcasting Algorithm (SBA) proposed by W. Peng and X. Lu [8] aims to reduce the
broadcast redundancy in MANET. By using the redundant broadcast and local topology
information, unnecessary broadcasts are avoided. Thus network energy and bandwidth gets less
consumed. The main idea of SBA is “the node need not rebroadcast the received RREQ if all of
its neighbours have been covered by previous RREQ”.
OTRP proposed by H. AlAamri,M.Abolhasan, and T.Wysocki uses Tree-based Optimized
Flooding (TOF) algorithm to improve the scalability even though previous knowledge to the
destination is not available in ad hoc network.
The basic probabilistic route discovery method FPR discussed in [9] use the fixed probability
value without considering network density. In Fixed Probabilistic Routing, source can broadcast
RREQ with probability “P=1” i.e.,( simple flooding). Any neighbour node that receives that
RREQ, rebroadcast it to its neighbours with probability value less than 1. The probability value
used in FPR is same for all nodes and it does not varied based on the local topology features. It
result in unfair distribution of probability and to resolve this problem, forwarding probability
needs to be determined based on random distribution of mobile nodes and regions of varying
degrees of node density.
Dynamic Probabilistic route discovery (DPR) proposed by J.D. Abdulai, M. Ould-Khaoua, L.M.
Mackenzie, and A. Mohammed [9] uses dynamic forwarding probability values. These values are
found by considering local density of forwarding node and set of its covered neighbours. By
finding density of region in network using local neighbourhood information of that region ,local
density is estimated.
Sung Xin ,Jing Xia,En Bo Wang and Dan Keun proposed NCPR [10] which gives good delivery
ratio compared to DPR. Performance evaluation of symmetric encryption algorithms in MANET
like AES,DES,etc.., are computed by Md.MohirHossain and M.A.Matin in [12]. Xin Zhou and
Tang discuss about the RSA implementation and benifits of using those public key encryption
algorithm in [15]. In our previous work [17], NCPR with AES is used to render secure packet
delivery ratio. But there is a problem in secure key exchange of AES, since it is the private key
encryption algorithm. To resolve that problem,i.e., for ensuring secure AES key exchange, a
public key encryption algorithm RSA is used in our paper.
3.PROTOCOL DESCRIPTION
In this section, the protocol used for reducing the overhead during routing and security
mechanisms added to the data packet are discussed. Neighbor Coverage based Probabilistic
Routing protocol (NCPR) from reference paper [10] is used for effective routing and improved
packet delivery ratio. NCPR protocol can solves the redundant rebroadcast by forwarding the
packet with the rebroadcast probability that is computed from additional coverage ratio and
connectivity factor. Also the combination of symmetric and asymmetric cryptographic
mechanisms are added to ensure secure packet delivery.
3.1.Uncovered Node Computation
When the RREQ packet is broadcasted from source node, the neighbour nodes that receives the
RREQ can perform the uncovered neighbour computation to calculate the set of its neighbours
that doesn’t have the RREQ flooded from the source.
Initial Uncovered neighbour computation is done using the below formula :
UCN(݊௫) = N(݊௫) − [ N(݊௫) ∩ N(source) ] − {source}
4. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
42
Where UCN(݊௫) denotes uncovered neighbours of node. ݊௫ is one of the neighbour node of
source node. ‘source’ denotes the source node which broadcast the RREQ packet. N(݊௫)
represents the neighbours of node ݊௫ and N(source) denotes the neighbours of source node.
This computation takes the difference of neighbours of node ݊௫ and common neighbours of both
݊௫ and source.
3.2.Rebroadcast Delay and Rebroadcast Probability Calculation
After the computation of initial UCN, RREQ rebroadcast is delayed for some time interval. This
delay value is called Rebroadcast delay and using it rebroadcast order is determined .
According to [10], Rebroadcast delay is computed using below formula :
Where RBD(݊௫) denotes rebroadcast delay of node ݊௫. A small constant delay is used as
MaxDelay.
The node can set its timer based on that rebroadcast delay value. By using this delay time,
efficient transmission order is determined. If any redundant RREQ packet is received in from its
neighbour ݊௬ during this delay time, then the node ݊௫ can adjust its neighbour list in UCN as,
The duplicate RREQ packet received from the node ݊௬ is discarded after this adjustment. When
this delay timer gets expired, the node can gain its final UCN set. Rebroadcast probability is
determined by taking the product of additional coverage ratio and connectivity factor. Additional
coverage ratio is the ratio of uncovered neighbours of node ݊௫ to neighbours of the node ݊௫. It is
computed using below formula :
Connectivity factor (CF) is obtained by dividing connectivity metric 5.1774 log(n) by total
number of neighbours of node ݊௫, where n is the number of nodes in the MANET. The formula
for Connectivity factor is given as below :
3.3.Adding Security to Data Packet
In this paper, the data packets are secured using symmetric key algorithm to ensure
confidentiality. Here AES is used for encryption purposes. To solve the problem in symmetric
key distribution, an asymmetric algorithm RSA is used for secure transfer of AES key. Thus the
hybrid scheme is utilized for better results in secure delivery of packets.
AES stands for Advanced Encryption standard and is based on Rijndael cipher. It is one of the
symmetric cipher algorithm. It stores the compressed form of encrypted data resulted in small
size database. It provides faster encryption and decryption as well as confidentiality. But the
ACR(݊௫) =
|େ(ೣ)|
|(ೣ)|
CF((݊௫) =
ହ.ଵସ ୪୭(୬)
|(ೣ)|
RBD(݊௫) = MaxDelay × ቀ1 −
|(ୱ୭୳୰ୡୣ) ∩(ೣ) |
|(ୱ୭୳୰ୡୣ)|
ቁ
UCN(݊௫) = UCN(݊௫) − [UCN(݊௫) ∩ N(݊௬) ]
5. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
43
problem in symmetric cryptography is lack of security during key exchange between the source
and destination, since single key is used for both encryption and decryption. With the aim of
solve that symmetric key exchange problem, asymmetric key encryption technique named RSA is
utilized here.
RSA stands for Rivest Shamir and Adleman and it uses two keys (i.e.) public and private key for
encryption and decryption. Every source node can have its own public key and private key. The
source node encrypts the data using destination node’s public key and then the destination node
that receives the data can decrypt it using his own private key. By having these two keys, it
overcomes the secure key distribution problem occured in symmetric crypto system. But RSA
consumes more encryption time and it’s memory usage is also high. RSA is not preferred for data
encryption. AES does the data encryption in a reasonable time as compared to RSA, the only
problem is the failure in exchanging the key securely. So in this paper, RSA is used for
encrypting the AES key at the sender side and decrypting that at the receiver side. Through this
hybrid technique, secure packet delivery is ensured.
3.4.Flow of Algorithm
The route between the source ‘Src’ and the destination ‘Dest’ is computed using NCPR [10]
protocol. Then the data packet to be sent to the destination is encrypted using AES. Then the
symmetric key used by AES is encrypted by RSA. Once the encrypted AES key is received at the
destination, it can be decrypted using RSA thus obtains the Key to decrypt the data packet. Then
by using that key, data is decrypted by AES scheme. The flow of the algorithm are given below :
Figure 1. Flow of Algorithm
Start
A Node receives
RREQ from Src
Find Route to Dest using NCPR
protocol
Send RREP through that computed
Path
Src encrypt data packet using AES
Encrypt AES key using RSA before
transmit it into Dest
Send encypted AES key and
encrypted data to Dest
Dest perform RSA decyption on
encrypted AES key to obtain
original AES key
Data is decrypted using that
decrypted Key(AES original key)
using AES
Ensures Secure
Packet Delivery
6. International Journal on Computational Science & Applications (I
3.5.Implementation of Protocol
According to [10], the source code of AODV in NS
of using this protocol, hello packet overhead and overhead occurred due to the neighbor list in
RREQ are reduced.
The hello packet overhead is reduced by restricting the use of periodical hello mechanism. Instead
of hello packets, RREQ and RERR control packets are used. The mechanism specified in [11]
helps for hello packet overhead reduction. According to that paper [11] , the node can send hello
packet only if the elapsed time of RREQ is greater than hello interval
In RREQ packet, the neighbor list overhead is reduced by monitoring the changes of the node’s
neighbor table. RREQ header of the existing AODV is modified by inserting a fixed field that
represents the size of neighbor list in RREQ and dynamic ne
As the implementation of NCPR gets succeeded, the next step is to apply the AES algorithm to
encrypt the data Packet. Then the AES key is encrypted using RSA. At receiver side, AES key is
decrypted by RSA and using that key encrypted data pac
4.NETWORK ANALYSIS A
For simulate this protocol , NS-2 (v2.30) is used.
number of nodes may be set as 50,100 or 150. The transmission range of each node is
250m. The constant Bit Rate (CBR) traffic is used. The number of CBR connections may be
5,10,12 or 14. The size of packet is 512 bytes and packet rate is 4 packets/sec. The minimum
speed is 1m/sec. The maximum speed is 5m/sec. The simulation time is
Figure 2. Nodes and Connection details and Hybrid encryption and decryption
International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
Implementation of Protocol
the source code of AODV in NS-2 is modified to implement NCPR. By means
of using this protocol, hello packet overhead and overhead occurred due to the neighbor list in
The hello packet overhead is reduced by restricting the use of periodical hello mechanism. Instead
ello packets, RREQ and RERR control packets are used. The mechanism specified in [11]
helps for hello packet overhead reduction. According to that paper [11] , the node can send hello
packet only if the elapsed time of RREQ is greater than hello interval value.
In RREQ packet, the neighbor list overhead is reduced by monitoring the changes of the node’s
neighbor table. RREQ header of the existing AODV is modified by inserting a fixed field that
represents the size of neighbor list in RREQ and dynamic neighbor list.
As the implementation of NCPR gets succeeded, the next step is to apply the AES algorithm to
encrypt the data Packet. Then the AES key is encrypted using RSA. At receiver side, AES key is
decrypted by RSA and using that key encrypted data packet is decrypted using AES.
AND SIMULATION RESULTS
2 (v2.30) is used. The topology size is set as 1100m x 1100m
number of nodes may be set as 50,100 or 150. The transmission range of each node is
The constant Bit Rate (CBR) traffic is used. The number of CBR connections may be
5,10,12 or 14. The size of packet is 512 bytes and packet rate is 4 packets/sec. The minimum
speed is 1m/sec. The maximum speed is 5m/sec. The simulation time is set as 150 seconds.
Figure 2. Nodes and Connection details and Hybrid encryption and decryption
JCSA) Vol.5, No.5,October 2015
44
modified to implement NCPR. By means
of using this protocol, hello packet overhead and overhead occurred due to the neighbor list in
The hello packet overhead is reduced by restricting the use of periodical hello mechanism. Instead
ello packets, RREQ and RERR control packets are used. The mechanism specified in [11]
helps for hello packet overhead reduction. According to that paper [11] , the node can send hello
In RREQ packet, the neighbor list overhead is reduced by monitoring the changes of the node’s
neighbor table. RREQ header of the existing AODV is modified by inserting a fixed field that
As the implementation of NCPR gets succeeded, the next step is to apply the AES algorithm to
encrypt the data Packet. Then the AES key is encrypted using RSA. At receiver side, AES key is
The topology size is set as 1100m x 1100m. The
number of nodes may be set as 50,100 or 150. The transmission range of each node is set as
The constant Bit Rate (CBR) traffic is used. The number of CBR connections may be
5,10,12 or 14. The size of packet is 512 bytes and packet rate is 4 packets/sec. The minimum
set as 150 seconds.
Figure 2. Nodes and Connection details and Hybrid encryption and decryption
7. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
45
Initially the number of nodes and CBR connections needed are to be selected. Once these details
are gets selected, MANET with selected number of nodes and CBR connections are configured
and route discovery among every source and destination are done via NCPR [10] protocol. Then
the random input string and key is gets generated. Using that key value, that random input text is
encrypted at sender side using AES. After that, the key used for AES encryption is encrypted
using RSA for securing confidentiality of AES Key while transmission. At receiver side, that key
(encrypted by RSA) is decrypted using RSA decryption, thus obtains the key for decrypting the
data(input text). Using that decrypted key, data is decrypted by AES decryption. The changes
happened in the routing table are also displayed. These are depicted in Figure.2
In above window(figure.2), number of nodes are selected as 50 and number of CBR connections
are selected as 10. This denotes 10 different source and destination gets communicated within the
simulation time among 50 nodes. The communication among each source and destination are
done via NCPR routing protocol[10].
Figure 3.a Figure 3.b
Figure 3.(a)Route discovery (RREQ packet rebroadcast to Uncovered node with Rebroadcast Probability) ,
(b) Source 15 send encrypted data into destination node 17
Then CBR connections are started between source 15 and destination 17. So node 15 starts
broadcasted RREQ to reach node 17. The nodes that receives the RREQ can rebroadcast it to
uncovered neighbors with computed rebroadcast probability value as shown in figure 3.a.The
broadcasted RREQ packet reaches the destination node 17 and RREP starts unicasted. After the
RREP reach the source, the source node 15 sends the encrpted data packet to destination node 17
through the path from where RREP comes as shown in figure 3.b. As a denotion of successful
delivery of data packets, CBR packet gets received by the destination through that path. In case of
any packet drop due to the node movement, Route rediscovery occurred by following the same
above route discovery process.
8. International Journal on Computational Science & Applications (I
The Uncovered Neighbors(UCN) for each neighbor nodes of node 15 are computed and it gets
stored in one trace file. Then based on this UCN details, Additional Coverage Ratio(ACR) and
Connectivity Factor(CF) are computed. From that, Rebroadcast delay and Probabi
computed by taking the product of ACR and CF as shown below.
Figure 3. ACR,CF and Rebroadcast Probability for neighbors of 15 at time 10.
The implemented secure routing protocol i.e., Hybrid secure
with exixting NCPR) is evaluated by means of checking the packet delivery ratio obtained by
varying number of CBR connections.
Packet Delivery Ratio shortly termed
successfully arrived in the CBR destinations to the number of data packets generated by the CBR
sources.
The Packet Delivery Ratio obtained using 50 nodes and 10 connections are computed. Then by
varying the connections into 5,12 and 14, corresponding PDR value is calculated.
delivery ratio obtained as a result of varying number of CBR
Also the PDR value of implemented Hybrid secure
of existing protocols like DPR and AODV. As a result
secure-NCPR gives better results in Packet delivery than DPR and AODV.
International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
Uncovered Neighbors(UCN) for each neighbor nodes of node 15 are computed and it gets
Then based on this UCN details, Additional Coverage Ratio(ACR) and
Connectivity Factor(CF) are computed. From that, Rebroadcast delay and Probabi
computed by taking the product of ACR and CF as shown below.
Figure 3. ACR,CF and Rebroadcast Probability for neighbors of 15 at time 10.
The implemented secure routing protocol i.e., Hybrid secure-NCPR(It uses both RSA and AES
with exixting NCPR) is evaluated by means of checking the packet delivery ratio obtained by
varying number of CBR connections.
Packet Delivery Ratio shortly termed as PDR is the ratio of the number of data packets
successfully arrived in the CBR destinations to the number of data packets generated by the CBR
The Packet Delivery Ratio obtained using 50 nodes and 10 connections are computed. Then by
the connections into 5,12 and 14, corresponding PDR value is calculated.
delivery ratio obtained as a result of varying number of CBR connections are given in figure 4
Also the PDR value of implemented Hybrid secure-NCPR protocol is compared with PDR values
of existing protocols like DPR and AODV. As a result of comparison, It is concluded that Hybrid
NCPR gives better results in Packet delivery than DPR and AODV.
JCSA) Vol.5, No.5,October 2015
46
Uncovered Neighbors(UCN) for each neighbor nodes of node 15 are computed and it gets
Then based on this UCN details, Additional Coverage Ratio(ACR) and
Connectivity Factor(CF) are computed. From that, Rebroadcast delay and Probability gets
Figure 3. ACR,CF and Rebroadcast Probability for neighbors of 15 at time 10.
NCPR(It uses both RSA and AES
with exixting NCPR) is evaluated by means of checking the packet delivery ratio obtained by
as PDR is the ratio of the number of data packets
successfully arrived in the CBR destinations to the number of data packets generated by the CBR
The Packet Delivery Ratio obtained using 50 nodes and 10 connections are computed. Then by
the connections into 5,12 and 14, corresponding PDR value is calculated. The packet
connections are given in figure 4.
ith PDR values
on, It is concluded that Hybrid
9. International Journal on Computational Science & Applications (I
-
Figure 4. PDR for proposed method by varyi
among proposed protocol , AODV and DPR
5.CONCLUSIONS
In this paper, the routing protocol that reduces overhead problem occurred during route discovery
in MANET for improving the packet delivery ratio is discussed. By
storm problem that causes the serious contention, collision and redundant rebroadcast in the
network is resolved, thus reduces the routing overhead and ensures high packet delivery. Also the
combination of symmetric and asymm
secure packet delivery. Using AES algorithm, the data packets flows from source to destination
are encrypted, thus confidentiality
algorithm. Thus enhanced secure Packet delivery is achieved in MANET.
this protocol will be left for future enhancement
REFERENCES
[1] S. Das, E. Belding-Royer, C. Perkins, “AdHoc On
Routing” , RFC 3561, 2003.
[2] Y. Hu, D. Maltz & D. Johnson, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks
for IPversion 4”, IETF RFC 4728, 2007, vol. 15, pp. 153
[3] T. Wysocki,, M. Abolhasan and H. AlAamri, “On Optimising Route Discovery
Previous Route Information in MANET(OTRP)”, VTC in IEEE, 2009.
International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
Figure 4. PDR for proposed method by varying CBR connections and Comparison
among proposed protocol , AODV and DPR
In this paper, the routing protocol that reduces overhead problem occurred during route discovery
in MANET for improving the packet delivery ratio is discussed. By using this protocol, broadcast
storm problem that causes the serious contention, collision and redundant rebroadcast in the
network is resolved, thus reduces the routing overhead and ensures high packet delivery. Also the
combination of symmetric and asymmetric cipher algorithm (AES and RSA) is utilized to ensure
secure packet delivery. Using AES algorithm, the data packets flows from source to destination
, thus confidentiality is guaranteed. And AES key is securely transmitted via RSA
hm. Thus enhanced secure Packet delivery is achieved in MANET. QOS consideration of
this protocol will be left for future enhancement.
Royer, C. Perkins, “AdHoc On-Demand Distance Vector(Proactive routing)
Y. Hu, D. Maltz & D. Johnson, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks
for IPversion 4”, IETF RFC 4728, 2007, vol. 15, pp. 153-181,2009.
T. Wysocki,, M. Abolhasan and H. AlAamri, “On Optimising Route Discovery in Absence of
Previous Route Information in MANET(OTRP)”, VTC in IEEE, 2009.
JCSA) Vol.5, No.5,October 2015
47
on PDR Graph
In this paper, the routing protocol that reduces overhead problem occurred during route discovery
using this protocol, broadcast
storm problem that causes the serious contention, collision and redundant rebroadcast in the
network is resolved, thus reduces the routing overhead and ensures high packet delivery. Also the
etric cipher algorithm (AES and RSA) is utilized to ensure
secure packet delivery. Using AES algorithm, the data packets flows from source to destination
is guaranteed. And AES key is securely transmitted via RSA
QOS consideration of
Demand Distance Vector(Proactive routing)
Y. Hu, D. Maltz & D. Johnson, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks
in Absence of
10. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.5,October 2015
48
[4] Y. Ni, Sheu.J.P, Chen, “The Broadcast Storm Problem in a Mobile AdHoc Network”, IEEE/ACM
MobiCom,1999.
[5] Mackenzie, A. Mohammed, Perkin, and J.D.Abdulai, “Probabilistic Counter-Based Route Discovery
for Mobile Ad Hoc Networks”, Proceedings. Int’l Conf. Wireless Comm. And Mobile Computing:
Connecting the World Wirelessly (IWCMC ’09), pp. 1335-1339, 2009.
[6] B. Williams and T. Cam , “ Comparison of Broadcasting Techniques for Mobile Ad hoc Networks”,
Proceedings. ACM MobiHoc, pp. 194-205,2002.
[7] Mackenzie ,J.D. Abdulai, and M. Ould-Khaoua, “Improving Probabilistic Route Discovery in Mobile
Ad Hoc Networks”, Proceedings IEEE Conf. Local Computer Networks, pp. 739-746, (2007).
[8] X. Lu and Peng.w, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks”,
Proceedings, ACM MobiHoc, pp. 129-130, 2000.
[9] L.M. Mackenzie, J.D. Abdulai, M. Ould-Khaoua, and A. Mohammed, “Neighbour Coverage: A
Dynamic Probabilistic Route Discovery for Mobile Ad Hoc Networks”, Proceedings. Int’l
Symp.Performance Evaluation of Computer and Telecomm. Systems (SPECTS ’08), pp. 165-
17,2008.
[10] Sung Xin , Jing Xia, En Bo Wang and Dan Keun, “A Neighbor Coverage-Based Probabilistic
Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks”, proceedings
IEEE(2013) .
[11] Sung, Wang, X.M .Zhang., “An Estimated Distance Based Routing Protocol for Mobile Adhoc
Networks”, proceedings. IEEE Trans. Vehicular Technology, no. 7, pp. 3473-3484, Sept.2011.
[12] Md.MohirHossain and M.A.Matin, ”Performance Evaluation of Symmetric Encryption Algorithm in
MANET and LAN”, Proceedings.IEEE Technical postgraduates International conferernce, 2000.
[13] Badache.N, Khelladi.L, D.Djenouri, “A survey of security issues in mobile ad hoc and sensor
networks”, Proceedings. IEEE Communications Surveys and Tutorials Journal, pp 2-29, (December
2005).
[14] W., Agrawal, H.,Li. Deng, ”Routing security in wireless ad hoc networks”, Proceedings IEEE
Communications Magazine 40.pp . 70-75, (October 2002).
[15] Xin Zhou and Xiaofei Tang, "Research and Implementation of RSA Algorithm for Encryption and
Decryption", the 6th International Forum on Strategic Technology, pp. 1118 – 1121, 2011.
[16] Gurpreet Singh, Supriya, “A Study of Encryption Algorithms (RSA, DES, 3DES and AES) for
Information Security”, International Journal of Computer Applications (0975 – 8887) Volume 67–
No.19, April 2013
[17] S.Vasudevi, Ms.D.MaryPonrani, “Protocol for Improving Packet Delivery Ratio in MANET” in
International Journal of Advance Research In Science And Engineering , Vol. No.4, Special Issue
(02), March 2015,ISSN-2319-8354(E), Pg. No: 96-104