A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive Protocols, Proactive Protocols and Hybrid Protocols. These traditional routing schemes are not pertinent to the so called Intermittently Connected Mobile Ad hoc Network (ICMANET). ICMANET is a form of Delay Tolerant Network, where there never exists a complete end – to – end path between two nodes wishing to communicate. The intermittent connectivity araise when network is sparse or highly mobile. Routing in such a spasmodic environment is arduous. In this paper, we put forward the indication of prevailing routing approaches for ICMANET with their benefits and detriments
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
In MANETs (mobile ad hoc network), security is common problem and lack of issues in
MANET network. When comparing to wired network, MANETs are harmed to security attacks due to the
scarcity of a trusted centralized enforce authority and limited resources. This paper proposed a technique
to avoid Blackhole node behaviour in AODV (Ad Hoc On-Demand Distance Vector) using Hexagonal
Encryption inNS2. Hexagonal Encryption has been chosen for low cost and high computation speed up.
Compared to existing blackhole detection technique, this proposed technique obtains better result by
stimulating in NS2.
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
COMPARING THREE PROTOCOLS OF DODV, DSR, DSDV FOR VANET NETWORKpijans
An ad hoc network is a network created by wireless hosts that can be mobile. This means that no infrastructure such as a central station, router, roaming, or anything else used by other networks to help network structure or anything else that other networks use to help Network structure, is not used. Rather, they are just a few wireless nodes connecting to non neighboring nodes with the help of the neighboring nodes. Wireless ad hoc mobile network (MANET) and Wireless ad hoc inter-car network (VANET), are among wireless networks which have the most effective parameters in the ability of this type of networksto transfer multimedia from source to destination. In this research, we examine the challenges and solutions presented in DODV, DSR, and DSDV protocols.
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
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.
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
In MANETs (mobile ad hoc network), security is common problem and lack of issues in
MANET network. When comparing to wired network, MANETs are harmed to security attacks due to the
scarcity of a trusted centralized enforce authority and limited resources. This paper proposed a technique
to avoid Blackhole node behaviour in AODV (Ad Hoc On-Demand Distance Vector) using Hexagonal
Encryption inNS2. Hexagonal Encryption has been chosen for low cost and high computation speed up.
Compared to existing blackhole detection technique, this proposed technique obtains better result by
stimulating in NS2.
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
COMPARING THREE PROTOCOLS OF DODV, DSR, DSDV FOR VANET NETWORKpijans
An ad hoc network is a network created by wireless hosts that can be mobile. This means that no infrastructure such as a central station, router, roaming, or anything else used by other networks to help network structure or anything else that other networks use to help Network structure, is not used. Rather, they are just a few wireless nodes connecting to non neighboring nodes with the help of the neighboring nodes. Wireless ad hoc mobile network (MANET) and Wireless ad hoc inter-car network (VANET), are among wireless networks which have the most effective parameters in the ability of this type of networksto transfer multimedia from source to destination. In this research, we examine the challenges and solutions presented in DODV, DSR, and DSDV protocols.
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
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.
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
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.
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environmentijsrd.com
In Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Every node operates as an end system and as a router to forward packets. In this paper mainly focused on Mac layer because this layer is most important for the data communication using control the packet loss and we worked on the comparison based performance of wimax802.16 and wireless802.11 networks using Ad hoc on- demand Distance Vector Routing Protocol and Dynamic Source Routing Protocol. In this paper we used the different maximum speed for the network. And this comparison based on unicast On-demand routing procedure and our simulation for mobile ad hoc networks discover and maintain only needed the design and follows the idea that each node by sending routing packets whenever a communication is requested and compared various parameter packet delivery ratio, normalized routing load and e-e delay. These simulations are carried out using the Network simulator version-2. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
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.
Target Detection System (TDS) for Enhancing Security in Ad hoc Networkijdpsjournal
The idea of an ad hoc network is a new pattern that allows mobile hosts (nodes) to converse without relying
on a predefined communications to keep the network connected. Most nodes are implicit to be mobile and
communication is implicit to be wireless. Ad-hoc networks are collaborative in the sense that each node is
assumed to relay packets for other nodes that will in return relay their packets. Thus all nodes in an ad-hoc
network form part of the network’s routing infrastructure. The mobility of nodes in an ad-hoc network
denotes that both the public and the topology of the network are extremely active. It is very difficult to
design a once-for-all target detection system. Instead, an incremental enrichment strategy may be more
feasible. A safe and sound protocol should at least include mechanisms against known assault types. In
addition, it should provide a system to easily add new security features in the future. Due to the
significance of MANET routing protocols, we focus on the recognition of attacks targeted at MANET
routing protocols.
Intrusion detection techniques for cooperation of node in MANET have been chosen as the security
parameter. This includes Watchdog and Path rater approach. It also nearby Reputation Based Schemes in
which Reputation concerning every node is measured and will be move to every node in network.
Reputation is defined as Someone’s donation to network operation. CONFIDANT [23], CORE [25],
OCEAN [24] schemes are analyzed and will be here also compared based on various parameters.
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
Performance Comparison of IAODV and OLSR Protocols under Black Hole Attackijsrd.com
A wireless ad-hoc network is a collection of mobile/semi-mobile nodes with no pre-established infrastructure, forming a temporary network.. MANET is a self organized and self configurable network where the mobile nodes move arbitrarily. The mobile nodes can receive and forward packets as a router. Each of the nodes has a wireless interface and communicates with each other over either radio or infrared. Laptop computers and personal digital assistants that communicate directly with each other are some examples of nodes in an ad-hoc network [4]. Nodes in the adhoc network are often mobile, but can also consist of stationary nodes, such as access points to the Internet. Semi mobile nodes can be used to deploy relay points in areas where relay points might be needed temporarily. Routing is a critical issue in MANET and hence the focus of this thesis along with the performance analysis of routing protocols. We compared two routing protocols i.e. IAODV and OLSR. Our simulation tool will be Network stimulator 2. The performance of these routing protocols is analyzed by three metrics: End to End delay, Packet delivery fraction and throughput.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...ijsrd.com
In Mobile Ad hoc network (MANETS), no fixed infrastructure is available. Different wireless hosts are free to move from one location to another without any centralized administration, so, the topology changes rapidly or unpredictably. Every node operates as router as well as an end system. Routing in MANETs has been a challenging task ever since the wireless networks came into existence. The major reason for this is continues changes in network topology because of high degree of node mobility. The MANET routing protocols have mainly two classes: Proactive routing (or table-driven routing) protocols and Reactive routing (or on-demand routing) protocols. In this paper, we have analyzed various Random based mobility models: Random Waypoint model, Random Walk model, Random Direction model and Probabilistic Random Walk model using AODV and DSDV protocols in Network Simulator (NS 2.35). The performance comparison of MANET mobility models have been analyzed by varying number of nodes using traffic TCP. The comparative conclusions are drawn on the basis of various performance metrics such as: Routing Overhead (packets), Packet Delivery Fraction (%), Normalized Routing Load, Average End-to-End Delay (milliseconds) and Packet Loss (%).
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Net...IJERA Editor
A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET). The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
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.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
Prediction of Atmospheric Pressure at Ground Level using Artificial Neural Ne...IJORCS
Prediction of Atmospheric Pressure is one important and challenging task that needs lot of attention and study for analyzing atmospheric conditions. Advent of digital computers and development of data driven artificial intelligence approaches like Artificial Neural Networks (ANN) have helped in numerical prediction of pressure. However, very few works have been done till now in this area. The present study developed an ANN model based on the past observations of several meteorological parameters like temperature, humidity, air pressure and vapour pressure as an input for training the model. The novel architecture of the proposed model contains several multilayer perceptron network (MLP) to realize better performance. The model is enriched by analysis of alternative hybrid model of k-means clustering and MLP. The improvement of the performance in the prediction accuracy has been demonstrated by the automatic selection of the appropriate cluster.
Duplicate Detection of Records in Queries using ClusteringIJORCS
The problem of detecting and eliminating duplicated data is one of the major problems in the broad area of data cleaning and data quality in data warehouse. Many times, the same logical real world entity may have multiple representations in the data warehouse. Duplicate elimination is hard because it is caused by several types of errors like typographical errors, and different representations of the same logical value. Also, it is important to detect and clean equivalence errors because an equivalence error may result in several duplicate tuples. Recent research efforts have focused on the issue of duplicate elimination in data warehouses. This entails trying to match inexact duplicate records, which are records that refer to the same real-world entity while not being syntactically equivalent. This paper mainly focuses on efficient detection and elimination of duplicate data. The main objective of this research work is to detect exact and inexact duplicates by using duplicate detection and elimination rules. This approach is used to improve the efficiency of the data.
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.
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environmentijsrd.com
In Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Every node operates as an end system and as a router to forward packets. In this paper mainly focused on Mac layer because this layer is most important for the data communication using control the packet loss and we worked on the comparison based performance of wimax802.16 and wireless802.11 networks using Ad hoc on- demand Distance Vector Routing Protocol and Dynamic Source Routing Protocol. In this paper we used the different maximum speed for the network. And this comparison based on unicast On-demand routing procedure and our simulation for mobile ad hoc networks discover and maintain only needed the design and follows the idea that each node by sending routing packets whenever a communication is requested and compared various parameter packet delivery ratio, normalized routing load and e-e delay. These simulations are carried out using the Network simulator version-2. The results presented in this work illustrate the importance in carefully evaluating and implementing routing protocols in an ad hoc environment.
PERFORMANCE ANALYSIS OF BROADCASTING IN MOBILE AD HOC NETWORKS USING CLUSTER ...ijasuc
Broadcasting is a fundamental service in Mobile Ad hoc Networks (MANETs). Cluster based approach
are proposed in literature to reduce the network collision, to reduce delay of packet transmission, to
reduce the energy consumption and improves the throughput. In this paper, a cluster- based
infrastructure is proposed for broadcasting in MANETs. The backbone of the network takes advantage of
the cluster structure and only requires cluster- heads and some selected gateways to forward the
broadcast packet. Each cluster head selects some gateways to forward the packet when it sends the
packet to all the cluster heads in its coverage set. Cluster structures have been simulated using mobile
simulator Glomosim 2.03, which gives better performance to reduce the network collision, to reduce
delay of packet transmission, to reduce the energy consumption and improves the throughput.
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.
Target Detection System (TDS) for Enhancing Security in Ad hoc Networkijdpsjournal
The idea of an ad hoc network is a new pattern that allows mobile hosts (nodes) to converse without relying
on a predefined communications to keep the network connected. Most nodes are implicit to be mobile and
communication is implicit to be wireless. Ad-hoc networks are collaborative in the sense that each node is
assumed to relay packets for other nodes that will in return relay their packets. Thus all nodes in an ad-hoc
network form part of the network’s routing infrastructure. The mobility of nodes in an ad-hoc network
denotes that both the public and the topology of the network are extremely active. It is very difficult to
design a once-for-all target detection system. Instead, an incremental enrichment strategy may be more
feasible. A safe and sound protocol should at least include mechanisms against known assault types. In
addition, it should provide a system to easily add new security features in the future. Due to the
significance of MANET routing protocols, we focus on the recognition of attacks targeted at MANET
routing protocols.
Intrusion detection techniques for cooperation of node in MANET have been chosen as the security
parameter. This includes Watchdog and Path rater approach. It also nearby Reputation Based Schemes in
which Reputation concerning every node is measured and will be move to every node in network.
Reputation is defined as Someone’s donation to network operation. CONFIDANT [23], CORE [25],
OCEAN [24] schemes are analyzed and will be here also compared based on various parameters.
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
Performance Comparison of IAODV and OLSR Protocols under Black Hole Attackijsrd.com
A wireless ad-hoc network is a collection of mobile/semi-mobile nodes with no pre-established infrastructure, forming a temporary network.. MANET is a self organized and self configurable network where the mobile nodes move arbitrarily. The mobile nodes can receive and forward packets as a router. Each of the nodes has a wireless interface and communicates with each other over either radio or infrared. Laptop computers and personal digital assistants that communicate directly with each other are some examples of nodes in an ad-hoc network [4]. Nodes in the adhoc network are often mobile, but can also consist of stationary nodes, such as access points to the Internet. Semi mobile nodes can be used to deploy relay points in areas where relay points might be needed temporarily. Routing is a critical issue in MANET and hence the focus of this thesis along with the performance analysis of routing protocols. We compared two routing protocols i.e. IAODV and OLSR. Our simulation tool will be Network stimulator 2. The performance of these routing protocols is analyzed by three metrics: End to End delay, Packet delivery fraction and throughput.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...ijsrd.com
In Mobile Ad hoc network (MANETS), no fixed infrastructure is available. Different wireless hosts are free to move from one location to another without any centralized administration, so, the topology changes rapidly or unpredictably. Every node operates as router as well as an end system. Routing in MANETs has been a challenging task ever since the wireless networks came into existence. The major reason for this is continues changes in network topology because of high degree of node mobility. The MANET routing protocols have mainly two classes: Proactive routing (or table-driven routing) protocols and Reactive routing (or on-demand routing) protocols. In this paper, we have analyzed various Random based mobility models: Random Waypoint model, Random Walk model, Random Direction model and Probabilistic Random Walk model using AODV and DSDV protocols in Network Simulator (NS 2.35). The performance comparison of MANET mobility models have been analyzed by varying number of nodes using traffic TCP. The comparative conclusions are drawn on the basis of various performance metrics such as: Routing Overhead (packets), Packet Delivery Fraction (%), Normalized Routing Load, Average End-to-End Delay (milliseconds) and Packet Loss (%).
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Net...IJERA Editor
A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET). The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
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.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
Prediction of Atmospheric Pressure at Ground Level using Artificial Neural Ne...IJORCS
Prediction of Atmospheric Pressure is one important and challenging task that needs lot of attention and study for analyzing atmospheric conditions. Advent of digital computers and development of data driven artificial intelligence approaches like Artificial Neural Networks (ANN) have helped in numerical prediction of pressure. However, very few works have been done till now in this area. The present study developed an ANN model based on the past observations of several meteorological parameters like temperature, humidity, air pressure and vapour pressure as an input for training the model. The novel architecture of the proposed model contains several multilayer perceptron network (MLP) to realize better performance. The model is enriched by analysis of alternative hybrid model of k-means clustering and MLP. The improvement of the performance in the prediction accuracy has been demonstrated by the automatic selection of the appropriate cluster.
Duplicate Detection of Records in Queries using ClusteringIJORCS
The problem of detecting and eliminating duplicated data is one of the major problems in the broad area of data cleaning and data quality in data warehouse. Many times, the same logical real world entity may have multiple representations in the data warehouse. Duplicate elimination is hard because it is caused by several types of errors like typographical errors, and different representations of the same logical value. Also, it is important to detect and clean equivalence errors because an equivalence error may result in several duplicate tuples. Recent research efforts have focused on the issue of duplicate elimination in data warehouses. This entails trying to match inexact duplicate records, which are records that refer to the same real-world entity while not being syntactically equivalent. This paper mainly focuses on efficient detection and elimination of duplicate data. The main objective of this research work is to detect exact and inexact duplicates by using duplicate detection and elimination rules. This approach is used to improve the efficiency of the data.
Channel Aware Mac Protocol for Maximizing Throughput and FairnessIJORCS
The proper channel utilization and the queue length aware routing protocol is a challenging task in MANET. To overcome this drawback we are extending the previous work by improving the MAC protocol to maximize the Throughput and Fairness. In this work we are estimating the channel condition and Contention for a channel aware packet scheduling and the queue length is also calculated for the routing protocol which is aware of the queue length. The channel is scheduled based on the channel condition and the routing is carried out by considering the queue length. This queue length will provide a measurement of traffic load at the mobile node itself. Depending upon this load the node with the lesser load will be selected for the routing; this will effectively balance the load and improve the throughput of the ad hoc network.
A Data Hiding Techniques Based on Length of English Text using DES and Attack...IJORCS
The comparing recent proposal for multimedia applications network security remains an important topic for researchers. The security deals with both wired and wireless communication. Network is defined as it is a large system consisting of many similar parts that are connected together to allow the movement or communication between or along the parts or between the parts and a control center. There are the main components of the network information system such as end systems (terminals, servers) and intermediate systems (hubs, switches, gateways). Every node has its own set of vulnerabilities that can be related to hardware, software, protocol stack etc. Nodes are interconnected by physical supports in a network for example connected with cables in wired Local Area Network (LAN) or radio waves (Wi-Fi) in Wireless Local Area Network (WLAN). Some nodes are able to provide services (FTP, HTTP browsing, database access). If two nodes want to communicate together, they must be interconnected physically and logically. Network security deals with also information hiding technique. Now day’s security deals with heterogeneous networks. The use of different wireless and wired network which are working on different platform is heterogeneous. So design of network security for such type of heterogeneous network is difficult task.
Help the Genetic Algorithm to Minimize the Urban Traffic on IntersectionsIJORCS
Control of traffic lights at the intersections of the main issues is the optimal traffic. Intersections to regulate traffic flow of vehicles and eliminate conflicting traffic flows are used. Modeling and simulation of traffic are widely used in industry. In fact, the modeling and simulation of an industrial system is studied before creating economically and when it is affordable. The aim of this article is a smart way to control traffic. The first stage of the project with the objective of collecting statistical data (cycle time of each of the intersection of the lights of vehicles is waiting for a red light) steps where the data collection found optimal amounts next it is. Introduced by genetic algorithm optimization of parameters is performed. GA begin with coding step as a binary variable (the range specified by the initial data set is obtained) will start with an initial population and then a new generation of genetic operators mutation and crossover and will Finally, the members of the optimal fitness values are selected as the solution set. The optimal output of Petri nets CPN TOOLS modeling and software have been implemented. The results indicate that the performance improvement project in intersections traffic control systems. It is known that other data collected and enforced intersections of evolutionary methods such as genetic algorithms to reduce the waiting time for traffic lights behind the red lights and to determine the appropriate cycle.
Performance Analysis of Mobile Adhoc Network Routing Protocols Over Tcppijans
In order to reduce the communication cost and time we are looking forward for successful implementation
of an infrastructure less network like Mobile Ad Hoc Network in all arena of wireless mobile
communication. But still it is a challenge to decide a most appropriate routing protocol for MANET. In
MANET there is no fixed topology due to the mobility of nodes, interference, multipath propagation and
path loss. Since MANET does not use fixed infrastructure rather it always have to find suitable router and
routing path for each communication, existing established routing protocol is not suitable for MANET to
function properly. Different Routing protocols have been proposed to meet the challenges with MANETs.
This paper evaluates the performances of four MANET routing protocols which are DSDV, AODV, DSR
and TORA over TCP, a Transport Layer Protocol. The performance metrics which are considered in this
paper are packet delivery fractions, normalized routing overload, end to end delay and throughput. DSDV
is a proactive protocol and the others are reactive protocols.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
Abstract Mobile networks have received great deal of attention during last few decades due to their potential applications such as large scale, improved flexibility and reduced costs. This proposed work addresses two problems associated with mobile network such as method to reduce overhead between the nodes, and energy balanced routing of packets by Co-Operative opportunistic routing for cluster based communication. We propose a modified algorithm that uses On-Demand Opportunistic Group mobility based clustering (ODOGMBC) for forming the cluster and predicting the cluster mobility by neighbourhood update algorithm. Cluster formation involves election of a mobile node as Cluster head. Each cluster comprises of cluster head and non-cluster head node that forms a cluster dynamically. Each node in the network continuously finds it neighbour by communicating with them, and nodes have consistent updated routing information in route cache by neighbourhood update algorithm. In routing process packet forwarded by the source node is updated by intermediate forwarder if topology undergo changes. This opportunistic routing scheme provides responsive data transportation and managing the node effectively, even in heavily loaded environment. Thus, our proposed routing technique helps us to reduce overhead, increases efficiency and better control of path selection. Keywords- Clustering, Forwarder, MANET, Prediction, Reactive, opportunistic routing.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS ijasuc
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured
with limited energy, computation and transmission power. Each node in the network coordinates with
every other node in forwarding their packets to reach the destination. Since these nodes operate in a
physically insecure environment; they are vulnerable to different types of attacks such as selective
forwarding and sinkhole. These attacks can inject malicious packets by compromising the node.
Geographical routing protocols of wireless sensor networks have been developed without considering the
security aspects against these attacks. In this paper, a secure routing protocol named secured greedy
perimeter stateless routing protocol (S-GPSR) is proposed for mobile sensor networks by incorporating
trust based mechanism in the existing greedy perimeter stateless routing protocol (GPSR). Simulation
results prove that S-GPSR outperforms the GPSR by reducing the overhead and improving the delivery
ratio of the networks.
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS ijasuc
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured
with limited energy, computation and transmission power. Each node in the network coordinates with
every other node in forwarding their packets to reach the destination. Since these nodes operate in a
physically insecure environment; they are vulnerable to different types of attacks such as selective
forwarding and sinkhole. These attacks can inject malicious packets by compromising the node.
Geographical routing protocols of wireless sensor networks have been developed without considering the
security aspects against these attacks. In this paper, a secure routing protocol named secured greedy
perimeter stateless routing protocol (S-GPSR) is proposed for mobile sensor networks by incorporating
trust based mechanism in the existing greedy perimeter stateless routing protocol (GPSR). Simulation
results prove that S-GPSR outperforms the GPSR by reducing the overhead and improving the delivery
ratio of the networks.
Ad hoc networks are the special networks formed for specific applications. Operating in ad-hoc mode
allows all wireless devices within range of each other to discover and communicate in a peer-to-peer
fashion without involving central access points. Many routing protocols like AODV, DSR etc have been
proposed for these networks to find an end to end path between the nodes. These routing protocols are
prone to attacks by the malicious nodes. There is a need to detect and prevent these attacks in a timely
manner before destruction of network services.
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.
Survey on Efficient and Secure Anonymous Communication in ManetsEditor IJCATR
Mobile ad-hoc networks require anonymous communications in order to thwart new wireless passive attacks; and to protect new
assets of information such as nodes locations, motion patterns, network topology and traffic patterns in addition to conventional identity and
message privacy. The transmitted routing messages and cached active routing entries leave plenty of opportunities for eavesdroppers.
Anonymity and location privacy guarantees for the deployed ad hoc networks are critical in military and real time communication systems,
otherwise the entire mission may be compromised. This poses challenging constraints on MANET routing and data forwarding. To address
the new challenges, several anonymous routing schemes have been proposed recently.
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
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.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
Similar to A Study of Routing Techniques in Intermittently Connected MANETs (20)
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 4). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
All paper submissions (http://www.ijorcs.org/submit-paper) are received and managed electronically by IJORCS Team. Detailed instructions about the submission procedure are available on IJORCS website (http://www.ijorcs.org/author-guidelines)
License plate recognition system is one of the core technologies in intelligent traffic control. In this paper, a new and tunable algorithm which can detect multiple license plates in high resolution applications is proposed. The algorithm aims at investigation into and identification of the novel Iranian and some European countries plate, characterized by both inclusion of blue area on it and its geometric shape. Obviously, the suggested algorithm contains suitable velocity due to not making use of heavy pre-processing operation such as image-improving filters, edge-detection operation and omission of noise at the beginning stages. So, the recommended method of ours is compatible with model-adaptation, i.e., the very blue section of the plate so that the present method indicated the fact that if several plates are included in the image, the method can successfully manage to detect it. We evaluated our method on the two Persian single vehicle license plate data set that we obtained 99.33, 99% correct recognition rate respectively. Further we tested our algorithm on the Persian multiple vehicle license plate data set and we achieved 98% accuracy rate. Also we obtained approximately 99% accuracy in character recognition stage.
FPGA Implementation of FIR Filter using Various Algorithms: A RetrospectiveIJORCS
This Paper is a review study of FPGA implementation of Finite Impulse response (FIR) with low cost and high performance. The key observation of this paper is an elaborate analysis about hardware implementations of FIR filters using different algorithm i.e., Distributed Arithmetic (DA), DA-Offset Binary Coding (DA-OBC), Common Sub-expression Elimination (CSE) and sum-of-power-of-two (SOPOT) with less resources and without affecting the performance of the original FIR Filter.
Using Virtualization Technique to Increase Security and Reduce Energy Consump...IJORCS
An approach has been presented in this paper in order to generate a secure environment on internet Based Virtual Computing platform and also to reduce energy consumption in green cloud computing. The proposed approach constantly checks the accuracy of stored data by means of a central control service inside the network environment and also checks system security through isolating single virtual machines using a common virtual environment. This approach has been simulated on two types of Virtual Machine Manager (VMM) Quick EMUlator (Qemu), HVM (Hardware Virtual Machine) Xen and outputs of the simulation in VMInsight show that when service is getting singly used, the overhead of its performance will be increased. As a secure system, the proposed approach is able to recognize malicious behaviors and assure service security by means of operational integrity measurement. Moreover, the rate of system efficiency has been evaluated according to the amount of energy consumption on five applications (Defragmentation, Compression, Linux Boot Decompression and Kernel Boot). Therefore, this has been resulted that to secure multi-tenant environment, managers and supervisors should independently install a security monitoring system for each Virtual Machines (VMs) which will come up to have the management heavy workload of. While the proposed approach, can respond to all VM’s with just one virtual machine as a supervisor.
Algebraic Fault Attack on the SHA-256 Compression FunctionIJORCS
The cryptographic hash function SHA-256 is one member of the SHA-2 hash family, which was proposed in 2000 and was standardized by NIST in 2002 as a successor of SHA-1. Although the differential fault attack on SHA-1compression function has been proposed, it seems hard to be directly adapted to SHA-256. In this paper, an efficient algebraic fault attack on SHA-256 compression function is proposed under the word-oriented random fault model. During the attack, an automatic tool STP is exploited, which constructs binary expressions for the word-based operations in SHA-256 compression function and then invokes a SAT solver to solve the equations. The simulation of the new attack needs about 65 fault injections to recover the chaining value and the input message block with about 200 seconds on average. Moreover, based on the attack on SHA-256 compression function, an almost universal forgery attack on HMAC-SHA-256 is presented. Our algebraic fault analysis is generic, automatic and can be applied to other ARX-based primitives.
Enhancement of DES Algorithm with Multi State LogicIJORCS
The principal goal to design any encryption algorithm must be the security against unauthorized access or attacks. Data Encryption Standard algorithm is a symmetric key algorithm and it is used to secure the data. Enhanced DES algorithm works on increasing the key length or complex S-BOX design or increased the number of states in which the information is to be represented or combination of above criteria. By increasing the key length, the number of combinations for key will increase which is hard for the intruder to do the brute force attack. As the S-BOX design will become the complex there will be a good avalanche effect. As the number of states increases in which the information is represented, it is hard for the intruder to crack the actual information. Proposed algorithm replace the predefined XOR operation applied during the 16 round of the standard algorithm by a new operation called “Hash function” depends on using two keys. One key used in “F” function and another key consists of a combination of 16 states (0,1,2…13,14,15) instead of the ordinary 2 state key (0, 1). This replacement adds a new level of protection strength and more robustness against breaking methods.
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...IJORCS
This paper presents a new algorithm for solving large scale global optimization problems based on hybridization of simulated annealing and Nelder-Mead algorithm. The new algorithm is called simulated Nelder-Mead algorithm with random variables updating (SNMRVU). SNMRVU starts with an initial solution, which is generated randomly and then the solution is divided into partitions. The neighborhood zone is generated, random number of partitions are selected and variables updating process is starting in order to generate a trail neighbor solutions. This process helps the SNMRVU algorithm to explore the region around a current iterate solution. The Nelder- Mead algorithm is used in the final stage in order to improve the best solution found so far and accelerates the convergence in the final stage. The performance of the SNMRVU algorithm is evaluated using 27 scalable benchmark functions and compared with four algorithms. The results show that the SNMRVU algorithm is promising and produces high quality solutions with low computational costs.
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 2). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
To view complete list of topics coverage of IJORCS, Aim & Scope, please visit, www.ijorcs.org/scope
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 1). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
Voice Recognition System using Template MatchingIJORCS
It is easy for human to recognize familiar voice but using computer programs to identify a voice when compared with others is a herculean task. This is due to the problem that is encountered when developing the algorithm to recognize human voice. It is impossible to say a word the same way in two different occasions. Human speech analysis by computer gives different interpretation based on varying speed of speech delivery. This research paper gives detail description of the process behind implementation of an effective voice recognition algorithm. The algorithm utilize discrete Fourier transform to compare the frequency spectra of two voice samples because it remained unchanged as speech is slightly varied. Chebyshev inequality is then used to determine whether the two voices came from the same person. The algorithm is implemented and tested using MATLAB.
A Review and Analysis on Mobile Application Development Processes using Agile...IJORCS
Over a last decade, mobile telecommunication industry has observed a rapid growth, proved to be highly competitive, uncertain and dynamic environment. Besides its advancement, it has also raised number of questions and gained concern both in industry and research. The development process of mobile application differs from traditional softwares as the users expect same features similar to their desktop computer applications with additional mobile specific functionalities. Advanced mobile applications require assimilation with existing enterprise computing systems such as databases, legacy applications and Web services. In addition, the lifecycle of a mobile application moves much faster than that of a traditional Web application and therefore the lifecycle management associated therein must be adjusted accordingly. The Security and application testing are more stimulating and interesting in mobile application than in Web applications since the technology in mobile devices progresses rapidly and developers must stay in touch with the latest developments, news and trends in their area of work. With the rising competence of software market, researchers are seeking more flexible methods that can adjust to dynamic situations where software system requirements are changing over time, producing valuable software in short duration and within low budget. The intrinsic uncertainty and complexity in any software project therefore requires an iterative developmental plan to cope with uncertainty and a large number of unknown variables. Agile Methodologies were thus introduced to meet the new requirements of the software development companies. The agile methodologies aim at facilitating software development processes where changes are acceptable at any stage and provide a structure for highly collaborative software development. Therefore, the present paper aims in reviewing and analysing different prevalent methodologies utilizing agile techniques that are currently in use for the development of mobile applications. This paper provides a detailed review and analysis on the use of agile methodologies in the proposed processes associated with mobile application skills and highlights its benefit and constraints. In addition, based on this analysis, future research needs are identified and discussed.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
Improving the Efficiency of Spectral Subtraction Method by Combining it with ...IJORCS
In the field of speech signal processing, Spectral subtraction method (SSM) has been successfully implemented to suppress the noise that is added acoustically. SSM does reduce the noise at satisfactory level but musical noise is a major drawback of this method. To implement spectral subtraction method, transformation of speech signal from time domain to frequency domain is required. On the other hand, Wavelet transform displays another aspect of speech signal. In this paper we have applied a new approach in which SSM is cascaded with wavelet thresholding technique (WTT) for improving the quality of speech signal by removing the problem of musical noise to a great extent. Results of this proposed system have been simulated on MATLAB.
An Adaptive Load Sharing Algorithm for Heterogeneous Distributed SystemIJORCS
Due to the restriction of designing faster and faster computers, one has to find the ways to maximize the performance of the available hardware. A distributed system consists of several autonomous nodes, where some nodes are busy with processing, while some nodes are idle without any processing. To make better utilization of the hardware, the tasks or load of the overloaded node will be sent to the under loaded node that has less processing weight to minimize the response time of the tasks. Load balancing is a tool used effectively for balancing the load among the systems. Dynamic load balancing takes into account of the current system state for migration of the tasks from heavily loaded nodes to the lightly loaded nodes. In this paper, we devised an adaptive load-sharing algorithm to balance the load by taking into consideration of connectivity among the nodes, processing capacity of each node and link capacity.
The Design of Cognitive Social Simulation Framework using Statistical Methodo...IJORCS
Modeling the behavior of the cognitive architecture in the context of social simulation using statistical methodologies is currently a growing research area. Normally, a cognitive architecture for an intelligent agent involves artificial computational process which exemplifies theories of cognition in computer algorithms under the consideration of state space. More specifically, for such cognitive system with large state space the problem like large tables and data sparsity are faced. Hence in this paper, we have proposed a method using a value iterative approach based on Q-learning algorithm, with function approximation technique to handle the cognitive systems with large state space. From the experimental results in the application domain of academic science it has been verified that the proposed approach has better performance compared to its existing approaches.
An Enhanced Framework for Improving Spatio-Temporal Queries for Global Positi...IJORCS
To efficiently process continuous spatio-temporal queries, we need to efficiently and effectively handle large number of moving objects and continuous updates on these queries. In this paper, we propose a framework that employs a new indexing algorithm that is built on top of SQL Server 2008 and avoid the overhead related to R-Tree indexing. To answer range queries, we utilize dynamic materialized view concept to efficiently handle update queries. We propose an adaptive safe region to reduce communication costs between the client and the server and to minimize position update load. Caching of results was utilized to enhance the overall performance of the framework. To handle concurrent spatio-temporal queries, we utilize publish/subscribe paradigm to group similar queries and efficiently process these requests. Experiments show that the overall proposed framework performance was able to outperform R-Tree index and produce promising and satisfactory results.
A PSO-Based Subtractive Data Clustering AlgorithmIJORCS
There is a tremendous proliferation in the amount of information available on the largest shared information source, the World Wide Web. Fast and high-quality clustering algorithms play an important role in helping users to effectively navigate, summarize, and organize the information. Recent studies have shown that partitional clustering algorithms such as the k-means algorithm are the most popular algorithms for clustering large datasets. The major problem with partitional clustering algorithms is that they are sensitive to the selection of the initial partitions and are prone to premature converge to local optima. Subtractive clustering is a fast, one-pass algorithm for estimating the number of clusters and cluster centers for any given set of data. The cluster estimates can be used to initialize iterative optimization-based clustering methods and model identification methods. In this paper, we present a hybrid Particle Swarm Optimization, Subtractive + (PSO) clustering algorithm that performs fast clustering. For comparison purpose, we applied the Subtractive + (PSO) clustering algorithm, PSO, and the Subtractive clustering algorithms on three different datasets. The results illustrate that the Subtractive + (PSO) clustering algorithm can generate the most compact clustering results as compared to other algorithms.
Dynamic Map and Diffserv Based AR Selection for Handoff in HMIPv6 Networks IJORCS
In HMIPv6 Networks, most of the existing handoff decision mechanisms deal mainly with the selection of Mobility Anchor Point (MAP), ignoring the selection of access router (AR) under each MAP. In this paper, we propose a new mechanism called “Dynamic MAP and Diffserv based ARs selection for Handoff in HMIPv6 networks” and it deals with selecting the MAP as well as ARs. MAP will be selected dynamically by checking load, session mobility ratio (SMR), Binding update cost and Location Rate. After selecting the best MAP, the Diffserv approach is used to select the AR under the MAP, based on its resource availability. The AR is implemented at the edge router of Diffserv. DiffServ can be used to provide low-latency to critical network traffic such as voice or streaming media while providing simple best-effort service to non-critical services such as web traffic or file transfers. By using this mechanism, we can assure that better resource utilization and throughput can be attained during Handoff in HMIPv6 networks.
From Physical to Virtual Wireless Sensor Networks using Cloud Computing IJORCS
In the modern world, billions of physical sensors are used for various dedications: Environment Monitoring, Healthcare, Education, Defense, Manufacturing, Smart Home, Agriculture Precision and others. Nonetheless, they are frequently utilized by their own applications and thereby snubbing the significant possibilities of sharing the resources in order to ensure the availability and performance of physical sensors. This paper assumes that the immense power of the Cloud can only be fully exploited if it is impeccably integrated into our physical lives. The principal merit of this work is a novel architecture where users can share several types of physical sensors easily and consequently many new services can be provided via a virtualized structure that allows allocation of sensor resources to different users and applications under flexible usage scenarios within which users can easily collect, access, process, visualize, archive, share and search large amounts of sensor data from different applications. Moreover, an implementation has been achieved using Arduino-Atmega328 as hardware platform and Eucalyptus/Open Stack with Orchestra-Juju for Private Sensor Cloud. Then this private Cloud has been connected to some famous public clouds such as Amazon EC2, ThingSpeak, SensorCloud and Pachube. The testing was successful at 80%. The recommendation for future work would be to improve the effectiveness of virtual sensors by applying optimization techniques and other methods.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
A Study of Routing Techniques in Intermittently Connected MANETs
1. International Journal of Research in Computer Science
eISSN 2249-8265 Volume 3 Issue 3 (2013) pp. 35-43
www.ijorcs.org, A Unit of White Globe Publications
doi: 10.7815/ijorcs. 33.2013.066
www.ijorcs.org
A STUDY OF ROUTING TECHNIQUES IN
INTERMITTENTLY CONNECTED MANETS
S. Ramesh1
, P. Ganesh Kumar2
1
Faculty/CSE, Anna University, Regional Centre Madurai, INDIA
Email: itz_ramesh87@yahoo.com
2
Professor/ECE, KLN College of Engineering, Sivagangai, INDIA
Email: ganesh_me@yahoo.com
Abstract: A Mobile Ad hoc Network (MANET) is a
self-configuring infrastructure less network of mobile
devices connected by wireless. These are a kind of
wireless Ad hoc Networks that usually has a routable
networking environment on top of a Link Layer Ad hoc
Network. The routing approach in MANET includes
mainly three categories viz., Reactive Protocols,
Proactive Protocols and Hybrid Protocols. These
traditional routing schemes are not pertinent to the so
called Intermittently Connected Mobile Ad hoc
Network (ICMANET). ICMANET is a form of Delay
Tolerant Network, where there never exists a complete
end – to – end path between two nodes wishing to
communicate. The intermittent connectivity araise
when network is sparse or highly mobile. Routing in
such a spasmodic environment is arduous. In this
paper, we put forward the indication of prevailing
routing approaches for ICMANET with their benefits
and detriments.
Keywords: MANET, ICMANET, Delay Tolerant
Networks, Routing Schemes, Performance Parameters.
I. INTRODUCTION
MANET is well – thought – out to be the rapid
deployment of independent mobile users. Substantial
examples include establishing survivable, efficient and
dynamic communication for emergency/rescue
operations, disaster relief efforts, and military
networks. Such network setups cannot count on
centralized and organized connectivity and can be
conceived as applications of Mobile Ad hoc Networks.
A MANET is an autonomous collection of mobile
users that communicate over relatively Band Width
constrained wireless links. Since the nodes are mobile,
the network topology may change rapidly and
unpredictably over time. In quintessence, the network
is decentralized; where all network activity including
discovering the topology and delivering messages
must be executed by nodes themselves, (i.e.) routing
functionality will be assimilated into mobile nodes.
The routing methodologies in such network are made
through traditional routing protocols like AODV (Ad
hoc on demand Distance Vector), DSR (Destination
Source Routing) etc. Ample routing algorithms have
been proposed for MANET. The MANET paves to a
new form of network called the ICMANET.
ICMANET is painstaking to be one of the new
areas in the field of wireless communication. Networks
under this class are potentially deployed in challenged
environments using isolated mobile devices with
limited resources. These are emerging as a promising
technology in applications such as in Wildlife
Management, Military Surveillance, Underwater
Networks and Vehicular Networks. ICMANET, also
known as the Delay Tolerant Network (DTN), is
typically different from traditional Mobile Ad hoc
Networks (MANETs), which means that in the latter;
communication between two nodes is possible at any
time via a path of intermediate nodes although this
path may vary with time. However, in an ICMANET
paths between to nodes have to be established only by
multihop paths that span over space and time. In other
words, there is no end – to – end path between the two
at any given instant. In this paper, we deliver a study
of possible routing schemes in ICMANET. The
traditional routing scheme that forms a basis for other
routing schemes in ICMANET is the Flooding based
routing. In this, one node sends packet to all other
nodes in the network. Each node acts as both a
transmitter and a receiver. Each node tries to forward
every message to every one of its neighbors [15]. The
results in every message eventually delivered to all
reachable parts of the network. In rest of this paper, we
will describe the various routing protocols available
for ICMANET.
II. EPIDEMIC ROUTING
The Epidemic Routing protocol is a Flooding based
routing protocol which states that periodic pair – wise
connectivity is necessitated for message delivery. The
protocol banks on immediate dissemination of
messages across the network. Routing occurs based on
the node mobility of carriers that are within distinctive
position of the network as in Figure 1 and Figure 2.
The protocol is designed in such a way that each host
2. 36 S. Ramesh, P. Ganesh Kumar
www.ijorcs.org
maintains a buffer. The buffer holds messages whose
origin is in that particular host, as well as messages of
the secondary hosts. It also sustains a hash table. The
host value catalogs the directory of messages that are
keyed by inimitable identifier associated with each
message.
A Summary Vector [13] is associated with the host,
to signpost which entries in table are set. The routing
comprises an anti – entropy session. When two hosts
are within the same communication range, one with
the least identifier inducts the anti – entropy session to
the one with larger identifier. Under this session two
hosts barter their summary vector, to explore the
messages that were not viewed by each other. Later
they request copies of messages that were not
reconnoitered by them. The routing scheme includes a
message identifier, hop count and an
acknowledgement request. (i) Message identifier –
unique 32 – bit number; is a combination of host ID
and a locally generated message ID (i.e.) 16 bit. (ii)
Hop count – value implies the distribution of
messages; similar to Time to Live (TTL) field. (iii)
acknowledgement request – acts a signal to the
destination requesting to endow acknowledgement for
message delivery.
It is studied [13] that goals of this routing scheme
include:
i. Maximum message delivery rate.
ii. Minimum message latency.
iii. Minimal resources consumption.
III. BEACONLESS ROUTING
The beaconless routing protocol is grounded on the
hypothesis where there never exists an intervallic
diffusion of beacons into the network. The convention
relies upon the acquaintance of geographical position
that aids in the reduction of overhead. Routing
primarily makes a choice of forwarding node in a
dispersed modus amidst its neighbors, without any
form of erudition about their location prevalence. The
forwarding of messages is accomplished by smearing
Dynamic Forwarding Delay (DFD) that indicts one of
the possible relay nodes, relays the message packets.
Relay nodes refers to the intermediate nodes in a
network.
The algorithm involves the following sequence of
steps in routing:
i. As a node broadcasts a packet, its neighboring node
receives it.
ii. DFD claims that only one of relay nodes transmits
the packet.
iii.Nodes with least delay deliver the packet first and
secondary relay nodes perceive the delivery and
abandon its reserved transmission of the same
packet.
From [12], it is known that some of the assumptions
are allied to BLR. (i) Nodes have a predetermined
knowledge of its own position via GPS, Galileo or any
other kind of positioning services. (ii) Nodes are aware
of two parameters viz., maximum delay and maximum
transmission.
From [12], it is eminent that, if a sender holds a
packet, it ascertain the destination, stores its
topographical coordinates, associated with its own
position, in the header of the packet. Each and every
relay node supersedes previous node’s position by its
current position in packet header before forwarding.
Packet is advertised to all neighbouring nodes. On
reception of packet, the only offered information of the
intermediate node is its own position, position of
previous and destination node that were extracted from
packet header. Nodes within forwarding area apply
DFD, prior to broadcasting of packets and those nodes
that are outside this area discard the received packet.
Destination nodes use passive acknowledgement. The
previous transmitting node also finds that the packets
are further delayed and clinches that other node has
received it successfully. The algorithm persists until
destination is reached and destination has to send
acknowledgement on reception. BLR applies an
adaptive and restricted reactive protocol based on
AODV in the vicinity of destination primarily to deal
with inaccuracies.
Figure 1: Routing of Messages at t==0
S
A
B
C
D
At t==0
3. A Study of Routing Techniques in Intermittently Connected MANETs 37
www.ijorcs.org
Figure 2: Routing of Messages at t > 0
The delay function is calculated using the formula
[12],
Add_delay = Max_delay ((r-p)/r)
Where r = maximum transmission radius.
P = progress.
Significance of BLR is to minimize delay and may
operate at promiscuous node. The performance of BLR
is based on the greedy mode which insists the
broadcast of all packets and do not hold any recovery
strategy when no node is found to be in the forwarding
area and the packets are just dropped. The advantage
of BLR is found to be, extensive battery power usage.
IV. CONTEXT AWARE ROUTING
The Context Aware Routing (CAR) algorithm
paves the forethought of asynchronous communication
in ICMANET. The algorithm endows a basement of
organizing the messages in the network. It addresses
that the nodes are able to exploit the context
information to make local decisions which imparts the
good delivery ratios and latencies with less overhead.
CAR is pain staked as a general framework to
predict and evaluate context information for superior
delivery of messages. The context here refers to the
aspects of system. The delivery process, in this
algorithm is based on the presence of receiver within
the identical set of nodes. The prospect of delivery of
messages is generated from the context information.
The algorithm states that if both source and destination
nodes are in the same network, message is delivered
synchronously. A proactive routing is used and is
presumed that every single node host transmits jointly
the information related to synchronously routing and a
list of delivery probability for the other host nodes. In
the mode of asynchronously routing, each host holds a
list of entries whose tuples are destination, best host,
and delivery probability. As a host is selected to be a
carrier and receives the message, it inserts into the
buffer.
The prediction of context information is as follows:
[11]
i. The host calculates its own delivery probability
based on (a) Prediction of future values. (b)
Deriving estimated values with utility theory.
ii. Host maintains a forwarding table with tuples next
hop and delivery probability for all known
destinations.
iii.Each and every host uses the prediction of delivery
probability at times of temporary disconnection.
iv. When a host does not hold any information about
the receiver, messages are transmitted to nodes with
higher mobility.
v. When carriers meets node with higher delivery
probability during its mobility, message is delivered
to it.
The evaluation of context information involves:
i. Local evaluation: - defines a static hierarchy or uses
a pre-emptive methodology.
ii. Significance based evaluation: - uses a utility
function.
Maximise {f (U (xi)) = ∑ 𝑤𝑖𝑛
𝑖=1 Ui (xi)} [11]
The performance of CAR is depicted as the number
of messages exchanged is more or less constant
regardless of buffer size, demonstrating its scalability.
V. BROWNIAN GOSSIP
The Brownian gossip is an amalgamation of gossip
and the random node mobility which provides a
scalable geographical routing. In this routing, each
node forwards the query related to other nodes
information with certain values of probability.
Gossiping is a resourceful approach for information
dissemination and is done with a probability viz.,
Pgossip. The probability value makes certain that the
query can reach the secondary nodes in the network
with highest probability. The algorithm is depicted
Figure 3.
The reply message is routed to the query originator.
To make a correct decision of propagating direction of
S
B
A
C
D
At t >0
4. 38 S. Ramesh, P. Ganesh Kumar
www.ijorcs.org
a query, hints about the location of destination is used.
The hints are obtained from the carriers. During the
node mobility, several nodes will be encountered and
this memory of encounters acts as hints.
Figure 3: Working of Brownian
Assume that a node A receives a query, it has
encountered node D at location (m, n) at time tD units
in the past. Node A forwards query to location (x, y),
as the nodes A, B meet, they acquire information about
the geographical position and updates its local caches
as follows:
Node A updates as,
{Node B, ti (XB, YB), Is Neighbor TRUE} [10]
Similarly node B updates its cache. The updating is
performed periodically based on the frequency of
beacon signals. When A, B are not immediate
neighbours’, the neighbour field is set FALSE. When
these nodes encounter new nodes, they gossip their
memory of encounters with probability Pgossip, [10]
which is chosen on the ground of (i) mobility pattern
of nodes (ii) traffic pattern in network .The query
packet contains of
{Source S, Locations (Xs, Ys), Target D, tm, Hops
h}[10]
When the propagated query reaches the receiver, it
replies back its current location (i.e.) (XD, YD) to the
sender.
The value of k copies is chosen as follows:
K = (min
(𝑡𝑐𝑢𝑟𝑟𝑒𝑛𝑡 − 𝑡𝑙𝑎𝑠𝑡−𝑒𝑛𝑐𝑜𝑢𝑛𝑡𝑒𝑟)
𝑐
, kmax) [10]
Where c, kmax = constants.
The Pgossip is determined by using,
Pigossip= max {f (Query Counti), g (AvgSpeedi)} [10]
Where Query Counti = number of times queried
within a time interval in past.
AvgSpeedi = average speed with which
each node has travelled in
past.
The gossip should take place at a time interval
of
2R
V
, where R = communication range, V= Speed of
node that is ready to gossip. The main advantage of
gossip is that the overhead is lowered as the network
does not transmit all the queries that were received.
VI. MOBILITY PROFILE BASED ROUTING
The mobility profile based routing addresses, a hub
– level routing method and two versions of user – level
routing methods. The routing involves a SOLAR–
HUB (Sociological Orbit aware Location
Approximation and Routing) which manipulates the
user profiles that aids in hub – level routing. The
multipath version of SOLAR–HUB delivers message
to most visited and second most visited destination
hubs via k – neighbor. The two user level routing
protocols are viz., Static SOLAR–KSP and Dynamic
SOLAR–KSP grounded on contact probability and k–
shortest paths and KSP is K- shortest paths.
The SOLAR–HUB algorithm [14] states that source
reaches destination by forwarding data to k of its own
neighbors. Every user computes delivery probability to
every hub as,
Delivery probability = max (travel probability, max
(contact probability (hub to k visit)*travel
probability)) [9]
The Static SOLAR–KSP algorithm computes the
contact probability P (U, V) and constructs a weighted
graph W (U, V).
W (U, V) =𝑙𝑜𝑔(
1
𝑃(𝑈,𝑉)
) [9]
The KSP is determined by [9] (i) initially path with
minimum total weight is chosen. (ii) Each path has
different next hop, then the KSP are given delivery
probability. The Dynamic SOLAR–KSP algorithm is a
combination of Static hub based information and
involves dynamic selection of next hop.
Regarding performance the HUB protocols are
eminent as follows:
i. SOLAR–HUB shows maximum throughput and
higher overhead.
ii. As user density increases, D–SOLAR KSP and S–
SOLAR KSP shows increase in delivery probability
and decrease in end – to – end delay.
iii.As number of hub increases and user density
decreases, D–SOLAR KSP and S–SOLAR KSP
shows a decrease in data throughput and increase in
end – to – end delay.
iv. The overhead of D–SOLAR KSP is minimal in
contrast to S–SOLAR KSP.
VII. DIRECTION BASED GEOGRAPHIC
ROUTING
The Direction Based Geographic Routing (DIG)
algorithm is grounded on geographic location of
packets that are routed in an average approximate ideal
path towards destination. The next hop in DIG is
chosen by considering the following factors [8]:
5. A Study of Routing Techniques in Intermittently Connected MANETs 39
www.ijorcs.org
i. Distance between relay node and destination node.
ii. Moving direction of the mobile node.
The algorithm postulates that when two nodes
encounter each other, the nodes exchange the
knowledge of their current location, moving direction
and the packets. The packets are forwarded to nodes
whose distance and moving direction are closest to
destination. The algorithm includes three steps [8]:
Source forwards each part of packet to a number of
neighbour nodes when it meets.
i. d>T (T is threshold distance) node chooses moving
direction α that is between [θ-ξ, θ+ξ], ξ=
Tn.arcsin�
r
d
� ≤ π
2� . [8]
ii. d<T node A forwards packet to node B if αB<
αA.[8]
DIG has decreased delay as the resources required
are less.
VIII. SINGLE COPY ROUTING
The single copy routing, from its nomenclature it
postulates that only a single copy of message packet is
carried to destination. This routing (i) employed when
low resource usage is critical (ii) improves the design
of routing schemes that uses multiple copies.
The routing schemes of single copy are, [7]
i. Direct transmission in which packets are delivered
directly to destination.
ii. Randomized routing in which one custodian
forwards to another one it meets with certain
probability P ∈(0, 1].
iii.Utility based routing that ground upon the
usefulness of a node in delivering message to
another node.
iv. Seek and focus (hybrid) has three phases [7]
a. Seek phase: - based on Utility<Uf (focus
threshold) and performs randomized routing.
b. Focus phase: - based on Utility>Uf, receives the
message then resets a timer and later performs
utility based function.
c. Reseek phase: - if tfocus expires, the timer is
modified and randomized routing is performed
based on utility functions.
v. Oracle – based optimal algorithm is aware of
movement with which, an optimal set of forwarding
decisions are made whose delivery probability
occurs at minimum time.
IX. MULTIPLE COPY ROUTING
The multiple copy scheme deals with the
mechanism of spraying a few copies of message and
then routing each copy in isolated manner to the
destination. The advantage of this scheme is stated as
[6]
i. Less transmission.
ii. Less delays.
iii.Higher scalability.
The design goals of multiple copy case is to, [6]
i. Perform fewer transmissions at all circumstances.
ii. Quicker message delivery.
iii.Maximum amount of messages generated are to be
delivered.
iv. Achieve high scalability.
v. Providing simple and minimum knowledge about
network.
The algorithm that holds multiple copy case routing
are Spray & Wait and Spray & Focus. The Spray and
Wait involves spraying multiple copies into the
network and waiting for the destination to be reached
before delivering the packet. The Spray and focus
engross spraying of fewer copies of message packets
into network and forwards packet based on the utility
function if and only if utility function of node B to
reach destination is greater than the sum of the utility
function of node A to reach destination and the utility
threshold.
X. SEMI PROBABLISTIC ROUTING
Semi Probabilistic Routing (SPR) algorithm
considers that the network is partitioned into tiny
portions that have a stable topology. The protocol
upholds the information about host mobility and
connectivity changes for more accurate message
forwarding. Information is also used to handle the
buffer space. In this, the mobile node maintains h hops
from itself. When the receiving node is present within
the sane zone of sending node, datas are delivered
synchronously whereas when synchronous deliveries
of messages are not admitted, datas are forwarded
towards a group of nodes that has the highest delivery
probability. The routing is a combination of both
probabilistic routing with deterministic decisions. The
algorithm has profile information that is described as a
set of attributes exploiting the overall aspects of the
system.
The probability of message delivery is calculated
for node i for data j as follows: [5]
Pij= �
1 , 𝑖𝑓 𝑛𝑜𝑑𝑒𝑖 𝑖𝑠 𝑎 𝑟𝑒𝑐𝑒𝑖𝑣𝑒𝑟 𝑜𝑓 𝑑𝑎𝑡𝑎 𝑗
𝑃𝑖𝑗𝑑 , 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
[5]
The Pijd denotes the intermediate node and is
calculated as,
Pij
d
= wcdc Ucdc, i + wcol, Ucol, ij [5]
6. 40 S. Ramesh, P. Ganesh Kumar
www.ijorcs.org
Where Ucdc, i = change degree of connectivity.
Ucol, ij = history of co-location of I with data
j.
Ucdc, i =
|𝑛(𝑡−𝑇)∪ 𝑛(𝑡)|− |𝑛−(𝑡−𝑇)𝑛 𝑛(𝑡)|
|𝑛(𝑡−𝑇)∪𝑛(𝑡)
[5]
Ucol, ij = �
1, 𝑖𝑓 𝑗′
𝑠𝑟𝑒𝑐𝑒𝑖𝑣𝑒𝑟 𝑖𝑠 𝑖𝑛 𝑖′
𝑠 𝑧𝑜𝑛𝑒
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
[5]
The data j is sent to nodes in the routing zone of
node i when the delivery probability is greater than the
forwarding threshold. This algorithm shows maximum
message delivery and minimum blind message
forwarding.
XI. CONTENTION BASED ROUTING
The Contention Based Routing postulates that the
efficiency of routing can be achieved only by taking
into account the contention and dead end [4]. The
Spray Select and Focus provides a better performance
considering the contention and dead ends. The
contention is referred to be as the competition for
resources. It is a condition, where two or more nodes
attempts to forward messages across network
simultaneously. The operation of Spray Select Focus is
depicted pictorially in Figure 4. Source node sends
multiple copies of message to various relay nodes.
When one of the relay nodes reaches destination, the
other copies are dropped [4]. Hence the route is
minimized and contention is avoided.
The algorithm holds three phases: [4]
i. In Spray phase L message copies are sprayed by
source.
ii. Select phase selects node and finds a shortest route
with the hop distance to destination.
iii. In Focus phase, the utility of node X to the
destination Y is calculated.
Figure: 4 Spray Select Focus
Node A forwards to node B only if the utility
function of B to D is greater than A (i.e) A broadcasts
to relay node B if and only if UB(D)>UA(D) [4].The
dead end is a situation, that occurs due to hardware or
power failure and hence the nod gets struck. This
algorithm proposes two ways [4] to recover from dead
ends.
i. By routing copies using bypass recovery.
ii. No routing is done; the focus phase will transmit
the copies directly.
XII. SPRAY AND HOP
The Spray and Hop is a routing protocol that holds
two phases namely, Spray phase that sprays few copies
of message into the network. Hop phase which occurs
after the spraying phase, a node that was not able to
find the destination, switches to the hop phase.
Spray Phase:
When a message is generated at the source node, it
creates k forwarding tokens. The spray phase
maintains a summary vector and its fields are shown in
Figure 7 [3].
Spray phase includes certain rules for forwarding
the messages and is described as follows:
i. When two nodes encounter each other, they
exchange their summary vectors and check for
messages that are in common.
ii. A node that has a message copy has k forwarding
tokens. When that encounters a node without
message, forwards the message copy and handover
certain forwarding tokens.
iii.A node transmits data to another node that has
greater remaining power.
iv. When more than one node possesses the same
message, node with greater residual energy has the
responsibility to forward message.
v. When a node has data packet and has a single
token, it forwards according to the hop phase.
Spraying is of two forms viz.,
a. Source Spray, in which the source node issues one
forward token each time and retains k-1 tokens for
itself.
b. Binary Spray, in which the source node issues half
of its token at each forward.
Hop Phase:
The hop phase occurs only when one forwarding token
is left with the source node. The utility function is used
to make a choice for relay node based on the residual
power and rediscovery interval. This technique
outperforms when the number of transmissions are
considered. It is said that as it uses utility function [3]
to choose the relay node rather than waiting to
encounter the destination, it is estimated that it has
better performance than spray and wait.
S
Accc
Ac
Ac
Ac
B D
reach
Ignored as one
of the copies
reaches the
destination
7. A Study of Routing Techniques in Intermittently Connected MANETs 41
www.ijorcs.org
XIII. SPRAY AND WAIT
The Spray and Wait is a scheme that sprays into the
network a fewer number of message copies and waits
until one of these nodes that holds the copies reaches
the destination. It is simple to implement and can be
optimized to achieve the depicted performance. The
Spray and wait has certain features as (i) Performing
fewer transmissions, (ii) Generating low contention
(iii) Achieving better delivery delay (iv) High
scalability.
The protocol has two phases [2]
a. Spray phase: L message copies are initially spread
by the source and other L distinct relay nodes
receives the copies.
b. Wait phase: When destination is not determined
during the spray phase, the relay node wait until
they determine the destination and then performs
direct transmission.
In this, when enough copies are spread into the
network, it is guaranteed that at least one node will
reach the destination. At this point, the source node
stops spraying and lets each custodian node to perform
the direct transmission. In choosing the L copies to be
sprayed initially two ways were used. The simplest
way is to spread the L copies to all L distinct nodes
that source node encounters initially. The secondary
technique is to use binary spray and wait [2], in which
the source node handoffs n
2� copies to the relay nodes
it encounters by keeping n
2� copies for itself. When
the source node is left with only one copy of message
it performs direct transmission. The spray and wait [2]
technique, that is highly robust and scalable. It is stated
that it is the only routing scheme that achieves both
low delivery delay and higher energy efficiency. It also
holds fewer transmissions for a single message to be
delivered.
XIV. LOCATION AWARE ROUTING ON DELAY
TOLERANT NETWORKS – LOCATION
DISSEMINATION
The Location Aware Routing On Delay tolerant
networks – Location Dissemination (LAROD-LODIS)
is a new form of routing that complements efficient
routing in the Intermittently Connected Mobile Ad hoc
Networks. The LAROD-LODIS, as the name indicates
it is an amalgamation of LAROD-Location Aware
Routing for Delay Tolerant Networks and LODIS-
Location Dissemination Services. The amalgamation
of these techniques suits ICMANET in a well – versed
way.
LAROD [1] routes packet only with partial
knowledge of the geographic positions. To impose low
overhead, it uses beaconless protocol to route packets.
It combines the routing scheme with store-carry-
forward technique and uses greedy packet forwarding
whenever required.
To broadcast a message, the custodian transmits
message. All nodes that stay within the specified
transmission range receive the packet. A delay timer is
set for each custodian; node whose delay timer expires
first becomes the new custodian. New custodian
forwards message. Relay nodes hearing this, assumes
that new custodian has taken form. If no such
transmission is heard, the old custodian retransmits
with some retransmission time tr. It is stated that, all
nodes do not hear the broadcast; hence duplication of
packets may occur. When paths of two copies cross
each other, only one forwards, while the other is
discarded. Each packet has a TTL [1], when it expires
the custodian discards the packet. When the
destination receives packet, it transmits
acknowledgement to source.
LODIS [1] maintains a local database, and updates
it by using the gossiping technique in addition to
routing. The database is updated by exchanging their
information in database as nodes encounter each other.
When the routing protocol requests a location from
LODIS, it provides the location with which the packets
are forwarded to destination and reduces delay. The
LAROD-LODIS maintains a constant overhead for all
possible loads and it has increased delivery ratio [1].
Source IP Data IP Destination Power of node Neighbour list Timeout
Figure 6: Data Field of Summary Vector
XV. COMPARISION OF ASSORTED PERFORMANCE METRICS
Table 1: Comparison of Assorted Performance Metrics
S.NO
ROUTING
TECHNIQUE
OVERHEAD
DELIVERY
LATENCY
TRANSMISSION
DELIVERY
RATE
1. Flooding Maximum Maximum
More number of
transmissions
-
2. Epidemic Maximum Minimum - Maximum
8. 42 S. Ramesh, P. Ganesh Kumar
www.ijorcs.org
3. BLR
Minimum (since it’s
based on position)
Reduced delay
Based on the
position of nodes
Independent of
the node
mobility
4. CAR Minimum Good - Good
5. Brownian Gossip Minimum
Comparatively
good
Based on the
probability Pgossip
Comparatively
good
6. SOLAR-HUB Maximum - - Maximum
7. D-SOLAR KSP Minimum
Decreased at
higher user
density
Increased as
number of hubs
increases
-
Increased with
high user
density
Decreased as
number of hubs
increases
8. S-SOLAR KSP Maximum
Decreased at
higher user
density
Increased as
number of hubs
increases
-
Increased with
high user
density
Decreased as
number of hubs
increases
9. DIG Minimum Optimal
Increases as delay
increases
Increases as
queue size
increases.
With large
queue size more
messages is
buffered and
fewer messages
are dropped.
10. Single Copy Minimum Good
Bad as copy gets
lost
Poor
11. Multiple Copy Maximum Optimal
Fewer
transmission
Maximum
12. SPR
Less as minimum
message forwarding
- - Maximum
13.
Binary Spray and
Wait
- Good Good -
14. Seek and Focus - -
Bad as single copy
gets lost
-
15. Spray Select Focus Optimal - -
Maximum as
route is
minimised
16. Spray and Hop Highly Scalable Slightly high
Decreased number
of transmissions
Maximum
17. LAROD-LODIS
Constant at all
nodes
Optimal
Fewer
transmissions
Maximum with
high probability
9. A Study of Routing Techniques in Intermittently Connected MANETs 43
www.ijorcs.org
XVI. CONCLUSION AND FUTURE WORK
This paper depicts the various routing techniques
that were possibly adapted in ICMANET,
Intermittently connected Mobile Ad hoc Network. It
also out frames the performance metrics of various
algorithms and their comparisons with each other. The
techniques described in this paper are analyzed in well
versed manner and their comparative evaluation is
depicted in the Table 15.1. These techniques prove the
possibility of routing in the partially connected ad hoc
networks. The study of these routing methodologies
aids in developing new techniques. As a result of this
study, it is found that the secure routing in this network
has not been accomplished. In accordance to
enhancement of this study, we would apply security
measures to the existing routing protocol and adhere to
secure communication between nodes in the network.
XVII. REFERENCES
[1] Erik Kuiper and Simin Nadim-Tehrani, “Geographical
Routing with Location Services in Intermittently
Connected MANETs”, IEEE Trans. Veh. Technol. vol.
60, no. 2, pp. 592 – 694, Feb. 2011. doi:
10.1109/TVT.2010.2091658
[2] T. Spyropoulos, K. Psounis, and C. S. Raghavendra,
“Spray and Wait :An Efficient Routing Scheme for
Intermittently Connected Mobile Networks” in Proc.
ACMSIGCOMM Workshop Delay - Tolerant
Networks, 2005, pp. 252-253. doi:
10.1145/1080139.1080143
[3] W. K. Lai, W. K. Chung, J. B. Tsai, and C. S. Shieh,
“Spray and Hop: Efficient Utility–Mobility Routing for
Intermittently Connected Mobile Networks” in
Proceeding of International Conference on
Communication and Networking, Chinacom., 2009.
doi: 10.1109/CHINACOM.2009.5339732.
[4] E. J. Jebajothi, V. Kavitha, and T. Kavitha, “Contention
Based Routing in Mobile Ad Hoc Networks with
Multiple Copies,” in International Journal of
Engineerng. and Technology, vol. 2, 2010, pp. 93-96.
[5] K. Shi, “Semi-Probablistic Routing in Intermittently
Connected Mobile Ad-Hoc Networks” in Journal of
Info. Science and Engg.,vol. 26, 2010, pp. 1677-1693.
[6] T. Spyropoulos, K. Psounis, and C. Ragavendra,
“Efficient Routing in Intermittently Connected Mobile
Networks: The Multiple-Copy Case,” IEEE/ACM
Trans. Netw., vol. 16, no. 1, pp. 77-90, Feb.2008. doi:
10.1109/TNET.2007.897964
[7] T. Spyropoulos, K. Psounis, and C. S. Ragavendra,
“Efficient Routing in Intermittently Connected Mobile
Networks: The Single-Copy Case,” IEEE/ACM
Transactions on Networking, vol. 16, no. 1, pp. 63–76,
Feb. 2008. doi: 10.1109/TNET.20070897962
[8] Z. Li, and H. Shen, “A Direction Based Geographic
Routing Scheme for Intermittently Connected Mobile
Networks,” in IEEE/IFIP International Conference on
Embedded and Ubiquitous Computing, 2008, pp. 359-
365. doi: 10.1109/EUC.2008.159,
[9] J. Ghosh, H. Q. Ngo, and C. Qiao, “Mobility Profile
based Routing within Intermittently Connected Mobile
Ad Hoc Networks” in Proceedings of ACM Wireless
Communications and Mobile Computing, 2006, pp.
551-556. doi: 10.1145/1143549.1143659
[10] R. R. Choudhury, “Brownian gossip: Exploiting Node
Mobility to Diffuse Information in Ad Hoc Networks,”
in Proc. Int. Conf. Collaborative Comput.: Netw., Appl.
Worksharing, 2005, pp. 1-5. doi:
10.1109/COLCOM.1651262
[11] M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive
Routing for Intermittently Connected Mobile Ad Hoc
Networks” in Proceedings of IEEE 6th International
Symposium, WoWMoM, 2005. doi:
10.1109/WOWMOM.2005.17
[12] M. Heissenbüttel, T. Braun, T. Bernoulli, and M.
Wälchi, “BLR: Beaconless Routing Algorithm for
Mobile Ad Hoc Networks”, Computer
Communications, vol. 27, no. 11, pp. 1076-1088, July
2004. doi: 10.1016/j.comcom.2004.01.012.
[13] A. Vahdat and D. Becker, “Epidemic Routing for
Partially Connected Ad Hoc Networks,” Duke Univ.,
Duhram, NC, TecH.Rep. CS-2000-06, 2000.
[14] J. Ghosh, C. Westphal, H. Ngo, and C. Qiao, “Bridging
Intermittently Connected Mobile Ad Hoc Networks
(ICMAN) with Sociological Orbits”.
http://joyghosh.com/
docs/INFOCOM_POSTER_SOLAR.pdf
[15] D. Cokuslu, K. Erciyes, “A Flooding based Routing
Algorithm for Mobile Ad Hoc Networks,” in IEEE
16th. Int. Conf. SIU 2008, pp. 1-5.
http://joyghosh.com/docs
/INFOCOM_POSTER_SOLAR.pdf
[16] S. Ramesh, P. Ganesh Kumar, “A Comparative
Analysis of Routing Techniques in Intermittently
Connected MANETs”, in Asian Journal of Scientific
Research. (In Press).
How to cite
S. Ramesh, P. Ganesh Kumar, " A Study of Routing Techniques in Intermittently Connected MANETs ".
International Journal of Research in Computer Science, 3 (3): pp. 35-43, May 2013. doi: 10.7815/ijorcs.
33.2013.066