A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...IOSR Journals
An Ad hoc network is a collection of wireless mobile hosts forming a temporary network without the
aid of any centralized administration or standard support services. MANET can be defined using unstable
network infrastructure, self-organizing network topology and independent node mobility. This becomes
obtainable due to their routing techniques; in other terms, routing is a backbone for MANET. However, due to
network load routing performance of MANET is degraded thus, some optimization on network routing strategy
is required.
In this paper, we introduce a new technique by using the concept of Genetic algorithm (GA) with
AODV Protocol to make routing decision in computer network.
The goal of this paper is to find the optimal path between the source and destination nodes and increased the
QoS and Throughput. We implemented and compare this a new technique with the traditional AODV, and we
shows that the new technique is better performance than the traditional AODV.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
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.
Survey of Reactive Routing Protocols for MANETIOSR Journals
A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any
network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes
are free to move about and organize themselves into a network. These nodes change position frequently. The
main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy
is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides
a scalable solution to relatively large network topologies. The design follows the idea that each node tries to
reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV
are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is
needed. The performance differentials are analyzed using varying performance metrics. These simulations are
carried out using the ns-2 network simulator
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...IOSR Journals
An Ad hoc network is a collection of wireless mobile hosts forming a temporary network without the
aid of any centralized administration or standard support services. MANET can be defined using unstable
network infrastructure, self-organizing network topology and independent node mobility. This becomes
obtainable due to their routing techniques; in other terms, routing is a backbone for MANET. However, due to
network load routing performance of MANET is degraded thus, some optimization on network routing strategy
is required.
In this paper, we introduce a new technique by using the concept of Genetic algorithm (GA) with
AODV Protocol to make routing decision in computer network.
The goal of this paper is to find the optimal path between the source and destination nodes and increased the
QoS and Throughput. We implemented and compare this a new technique with the traditional AODV, and we
shows that the new technique is better performance than the traditional AODV.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
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.
Survey of Reactive Routing Protocols for MANETIOSR Journals
A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any
network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes
are free to move about and organize themselves into a network. These nodes change position frequently. The
main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy
is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides
a scalable solution to relatively large network topologies. The design follows the idea that each node tries to
reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV
are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is
needed. The performance differentials are analyzed using varying performance metrics. These simulations are
carried out using the ns-2 network simulator
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
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.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Performance Analysis of Ad-hoc on Demand Distance Vector Routing (AODV) and D...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
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.
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
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.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
Survey of Reactive Routing Protocols for MANETIOSR Journals
Abstract : A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. The performance differentials are analyzed using varying performance metrics. These simulations are carried out using the ns-2 network simulator. Keywords – AODV, DSR, MANET, NS-2, Reactive routing protocols, Survey.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
Quick Routing for Communication in MANET using Zone Routing Protocolijceronline
rnational Journal of Computational Engineering Resaerch 2014, Volume 4 ~ Issue 11 (November 2014)
Abstract
The paper discusses the voltage control of a critical load bus using dynamic voltage restorer (DVR) in a distribution system. The critical load requires a balanced sinusoidal waveform across its terminals preferably at system nominal frequency of 50Hz .It is assumed that the frequency of the supply voltage can be varied and it is different from the system nominal frequency. The DVR is operated such that it holds the voltage across critical load bus terminals constant at system nominal frequency irrespective of the frequency of the source voltage. In case of a frequency mismatch, the total real power requirement of the critical load bus has to be supplied by the DVR. Proposed method used to compensate for frequency variation, the DC link of the DVR is supplied through an uncontrolled rectifier that provides a path for the real power required by the critical load to flow .A simple frequency estimation technique is discussed which are Discrete Fourier transform (DFT), ANN controller. The present work study the compensation principle and different control strategies of DVR used here are based on DFT, and ANN Controller .Through detailed analysis and simulation studies using MATLAB. It is shown that the voltage is completely controlled across the critical load.
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.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Performance Analysis of Ad-hoc on Demand Distance Vector Routing (AODV) and D...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
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.
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
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.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field
free for the nodes to move. The most important aspect of this kind of network turns into a great
disadvantage when it comes to commercial applications, take as an example: the automotive
networks that allow communication between a groups of vehicles. The ad hoc on-demand
distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main
functions. First, it enables route establishment between a source and a destination node by
initiating a route discovery process. Second, it maintains the active routes, which means finding
alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and
accurately. In this paper, we focused in the first point to enhance the local decision of each node
in the network by the quantification of the mobility of their neighbours. Quantification is made
around RSSI algorithm a well known distance estimation method.
Survey of Reactive Routing Protocols for MANETIOSR Journals
Abstract : A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. The performance differentials are analyzed using varying performance metrics. These simulations are carried out using the ns-2 network simulator. Keywords – AODV, DSR, MANET, NS-2, Reactive routing protocols, Survey.
Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the
nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it
comes to commercial applications, take as an example: the automotive networks that allow communication
between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed
for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source
and a destination node by initiating a route discovery process. Second, it maintains the active routes, which
means finding alternative routes in a case of a link failure and deleting routes when they are no longer
desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately.
In this paper, we focused in the first point to enhance the local decision of each node in the network by the
quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well
known distance estimation method.
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.
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.
Black-Hole and Wormhole Attack in Routing Protocol AODV in MANETIJCSEA Journal
Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a “BlackvHole” and “Wormhole” attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find
out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors’ and making them communicate through the wormhole link.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
Performance Evaluation of DSDV and MDSDV Routing Protocol with Varying Node D...IJERA Editor
Mobile Ad Hoc Networks (MANET) is an important and challenging research area. The routing protocol should detect and maintain a good route between source and destination nodes in these dynamic networks. Many routing protocols have been proposed for mobile ad hoc networks, and none can be considered as the best under all conditions. This thesis work consist a systematic comparative evaluation of a new multipath routing protocol for MANETS. The new protocol, called Multipath Destination Sequenced Distance Vector (MDSDV) is based on the well known single path Destination Sequenced Distance Vector (DSDV) is compared with known protocol DSDV. This work containing evaluates the protocols on a range of MANETS with between 50, 75 and 100 nodes, which are static nodes. The protocol comparison metrics are Throughput and Residual Energy.
Multipath Fault Tolerant Routing Protocol in MANET pijans
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically
exchange data among themselves without the reliance on a fixed base station or a wired backbone network
and it the makes the routing a crucial issue to the design of the MANET. Multiple path routing protocols
are shown to be performance-effective alternatives over single-path routing for ad hoc networks and it
represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves
load balancing and is more resilient to route failures..In this paper we propose an energy efficient
multipath fault tolerant routing protocol to improve the reliability of data routing in Mobile ad hoc
networks. The proposed RFTA is a multi objective routing protocol that meets diverse application
requirements by considering the changing conditions of the network. The efficiency of the proposed
protocol has been evaluated on different scenarios and there has been a noticeable improvement in the
packet delivery ratio and also in the reduction of end-to-end delay comparing to SMR,SMS and MDSR.
Link Reliability based Detection and Predecessor base Route Establishment for...IJERA Editor
Mobile Ad hoc Network (MANET) is consists of mobile hosts or sensor nodes proficient of functioning in
absence of infrastructure. Such networks should be capable of self forming, self organizing, self managing, self
recovering, and able to operate under dynamic conditions. The multi-hop communication phenomenon is used
to sending information to receiver. To attain this, each mobile node depends on its neighbor or range node to
forward the data packet to the destination. In fact, most of previous studies on MANET have implicitly assumed
that nodes are cooperative such as node cooperation becomes a very important issue in MANET. The attacker in
dynamic network are easily affected the routing performance and data receiving ratio is affected as compared to
normal performance of network as well as dropping of data is enhanced. The packets percentage is degrades is
the confirmation of attacker misbehavior. The characteristics of wormhole attack is to making the tunnel and
reply the positive acknowledgement of destination at time of route request and drop all the data deliver through
tunnel. The attacker is identified by the past and current data receiving and forwarding in MANET. The
proposed IPS (Intrusion Detection and Prevention System) provides the security on the basis of link reliability.
In this work, we proposed new link reliability based security through Predecessor based Route Establishment of
detecting routing misbehavior of wormhole attack for prevention in MANET. The attacker is blocked through
the broadcasting scheme used by proposed prevention scheme from their actual identification to neighbors. The
security provider nodes are blocking the communication of attacker and provide the secure communication
among the mobile nodes. The performance of proposed scheme is evaluated through performance metrics like
PDR and throughput.
Detection and Prevention of Sinkhole Attack on Zone Routing Protocol (ZRP) in...Editor IJMTER
Mobile Ad-hoc Network (MANET) is a kind of wireless network. A Wireless ad-hoc
network is a temporary network with no network infrastructure. The nodes communicate with each
other, they co-operate by forwarding data packets to other nodes in the network. Thus the nodes
find a path to the destination node using routing protocols. Due to the security vulnerabilities of
the routing protocols, wireless ad-hoc networks are unprotected to attacks of the malicious nodes.
One of these attacks is the Sinkhole Attack. Sinkhole attack is a kind of routing attack in MANET.
A sinkhole node tries to attract all the network packets to it-self from all neighboring nodes. This
paper focuses on to detect and prevent sinkhole node. By using a hybrid detection technique which
combines the advantages of both reactive and proactive routing Protocol to detect the black hole
node. It also shows performance of ZRP.
Comparison of Various Unicast-Multicast Routing Protocols for Mobile Ad-Hoc N...Editor IJMTER
A Mobile Ad-hoc Network (MANET) is a self configuring network which consists of
mobile nodes with no permanent infrastructure. In a MANETs, there is no difference between a host
node and a router so that all nodes can be source plus forwarders of traffic. The task of finding routes
in Mobile Ad-hoc Network (MANET) is an important factor in determining the efficiency of any
MANET routing protocols. This paper describes about the basic idea of different routing protocols
and its efficient use in MANET. There are several routing protocols based on UNICAST and
MULTICAST. This paper will conclude the main characteristics of these protocols with comparison
and suggest the best suited protocol for particular topology or network.
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR cscpconf
The progressive development of Synthetic Aperture Radar (SAR) systems diversify the exploitation of the generated images by these systems in different applications of geoscience. Detection and monitoring surface deformations, procreated by various phenomena had benefited from this evolution and had been realized by interferometry (InSAR) and differential interferometry (DInSAR) techniques. Nevertheless, spatial and temporal decorrelations of the interferometric couples used, limit strongly the precision of analysis results by these techniques. In this context, we propose, in this work, a methodological approach of surface deformation detection and analysis by differential interferograms to show the limits of this technique according to noise quality and level. The detectability model is generated from the deformation signatures, by simulating a linear fault merged to the images couples of ERS1 / ERS2 sensors acquired in a region of the Algerian south.
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATIONcscpconf
A novel based a trajectory-guided, concatenating approach for synthesizing high-quality image real sample renders video is proposed . The lips reading automated is seeking for modeled the closest real image sample sequence preserve in the library under the data video to the HMM predicted trajectory. The object trajectory is modeled obtained by projecting the face patterns into an KDA feature space is estimated. The approach for speaker's face identification by using synthesise the identity surface of a subject face from a small sample of patterns which sparsely each the view sphere. An KDA algorithm use to the Lip-reading image is discrimination, after that work consisted of in the low dimensional for the fundamental lip features vector is reduced by using the 2D-DCT.The mouth of the set area dimensionality is ordered by a normally reduction base on the PCA to obtain the Eigen lips approach, their proposed approach by[33]. The subjective performance results of the cost function under the automatic lips reading modeled , which wasn’t illustrate the superior performance of the
method.
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...cscpconf
Universities offer software engineering capstone course to simulate a real world-working environment in which students can work in a team for a fixed period to deliver a quality product. The objective of the paper is to report on our experience in moving from Waterfall process to Agile process in conducting the software engineering capstone project. We present the capstone course designs for both Waterfall driven and Agile driven methodologies that highlight the structure, deliverables and assessment plans.To evaluate the improvement, we conducted a survey for two different sections taught by two different instructors to evaluate students’ experience in moving from traditional Waterfall model to Agile like process. Twentyeight students filled the survey. The survey consisted of eight multiple-choice questions and an open-ended question to collect feedback from students. The survey results show that students were able to attain hands one experience, which simulate a real world-working environment. The results also show that the Agile approach helped students to have overall better design and avoid mistakes they have made in the initial design completed in of the first phase of the capstone project. In addition, they were able to decide on their team capabilities, training needs and thus learn the required technologies earlier which is reflected on the final product quality
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIEScscpconf
Using social media in education provides learners with an informal way for communication. Informal communication tends to remove barriers and hence promotes student engagement. This paper presents our experience in using three different social media technologies in teaching software project management course. We conducted different surveys at the end of every semester to evaluate students’ satisfaction and engagement. Results show that using social media enhances students’ engagement and satisfaction. However, familiarity with the tool is an important factor for student satisfaction.
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGICcscpconf
In real world computing environment with using a computer to answer questions has been a human dream since the beginning of the digital era, Question-answering systems are referred to as intelligent systems, that can be used to provide responses for the questions being asked by the user based on certain facts or rules stored in the knowledge base it can generate answers of questions asked in natural , and the first main idea of fuzzy logic was to working on the problem of computer understanding of natural language, so this survey paper provides an overview on what Question-Answering is and its system architecture and the possible relationship and
different with fuzzy logic, as well as the previous related research with respect to approaches that were followed. At the end, the survey provides an analytical discussion of the proposed QA models, along or combined with fuzzy logic and their main contributions and limitations.
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS cscpconf
Human beings generate different speech waveforms while speaking the same word at different times. Also, different human beings have different accents and generate significantly varying speech waveforms for the same word. There is a need to measure the distances between various words which facilitate preparation of pronunciation dictionaries. A new algorithm called Dynamic Phone Warping (DPW) is presented in this paper. It uses dynamic programming technique for global alignment and shortest distance measurements. The DPW algorithm can be used to enhance the pronunciation dictionaries of the well-known languages like English or to build pronunciation dictionaries to the less known sparse languages. The precision measurement experiments show 88.9% accuracy.
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS cscpconf
In education, the use of electronic (E) examination systems is not a novel idea, as Eexamination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments.
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICcscpconf
African Buffalo Optimization (ABO) is one of the most recent swarms intelligence based metaheuristics. ABO algorithm is inspired by the buffalo’s behavior and lifestyle. Unfortunately, the standard ABO algorithm is proposed only for continuous optimization problems. In this paper, the authors propose two discrete binary ABO algorithms to deal with binary optimization problems. In the first version (called SBABO) they use the sigmoid function and probability model to generate binary solutions. In the second version (called LBABO) they use some logical operator to operate the binary solutions. Computational results on two knapsack problems (KP and MKP) instances show the effectiveness of the proposed algorithm and their ability to achieve good and promising solutions.
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAINcscpconf
In recent years, many malware writers have relied on Dynamic Domain Name Services (DDNS) to maintain their Command and Control (C&C) network infrastructure to ensure a persistence presence on a compromised host. Amongst the various DDNS techniques, Domain Generation Algorithm (DGA) is often perceived as the most difficult to detect using traditional methods. This paper presents an approach for detecting DGA using frequency analysis of the character distribution and the weighted scores of the domain names. The approach’s feasibility is demonstrated using a range of legitimate domains and a number of malicious algorithmicallygenerated domain names. Findings from this study show that domain names made up of English characters “a-z” achieving a weighted score of < 45 are often associated with DGA. When a weighted score of < 45 is applied to the Alexa one million list of domain names, only 15% of the domain names were treated as non-human generated.
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...cscpconf
The amount of piracy in the streaming digital content in general and the music industry in specific is posing a real challenge to digital content owners. This paper presents a DRM solution to monetizing, tracking and controlling online streaming content cross platforms for IP enabled devices. The paper benefits from the current advances in Blockchain and cryptocurrencies. Specifically, the paper presents a Global Music Asset Assurance (GoMAA) digital currency and presents the iMediaStreams Blockchain to enable the secure dissemination and tracking of the streamed content. The proposed solution provides the data owner the ability to control the flow of information even after it has been released by creating a secure, selfinstalled, cross platform reader located on the digital content file header. The proposed system provides the content owners’ options to manage their digital information (audio, video, speech, etc.), including the tracking of the most consumed segments, once it is release. The system benefits from token distribution between the content owner (Music Bands), the content distributer (Online Radio Stations) and the content consumer(Fans) on the system blockchain.
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEMcscpconf
This paper discusses the importance of verb suffix mapping in Discourse translation system. In
discourse translation, the crucial step is Anaphora resolution and generation. In Anaphora
resolution, cohesion links like pronouns are identified between portions of text. These binders
make the text cohesive by referring to nouns appearing in the previous sentences or nouns
appearing in sentences after them. In Machine Translation systems, to convert the source
language sentences into meaningful target language sentences the verb suffixes should be
changed as per the cohesion links identified. This step of translation process is emphasized in
the present paper. Specifically, the discussion is on how the verbs change according to the
subjects and anaphors. To explain the concept, English is used as the source language (SL) and
an Indian language Telugu is used as Target language (TL)
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
In this paper, based on the definition of conformable fractional derivative, the functional
variable method (FVM) is proposed to seek the exact traveling wave solutions of two higherdimensional
space-time fractional KdV-type equations in mathematical physics, namely the
(3+1)-dimensional space–time fractional Zakharov-Kuznetsov (ZK) equation and the (2+1)-
dimensional space–time fractional Generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony
(GZK-BBM) equation. Some new solutions are procured and depicted. These solutions, which
contain kink-shaped, singular kink, bell-shaped soliton, singular soliton and periodic wave
solutions, have many potential applications in mathematical physics and engineering. The
simplicity and reliability of the proposed method is verified.
AUTOMATED PENETRATION TESTING: AN OVERVIEWcscpconf
The using of information technology resources is rapidly increasing in organizations,
businesses, and even governments, that led to arise various attacks, and vulnerabilities in the
field. All resources make it a must to do frequently a penetration test (PT) for the environment
and see what can the attacker gain and what is the current environment's vulnerabilities. This
paper reviews some of the automated penetration testing techniques and presents its
enhancement over the traditional manual approaches. To the best of our knowledge, it is the
first research that takes into consideration the concept of penetration testing and the standards
in the area.This research tackles the comparison between the manual and automated
penetration testing, the main tools used in penetration testing. Additionally, compares between
some methodologies used to build an automated penetration testing platform.
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORKcscpconf
Since the mid of 1990s, functional connectivity study using fMRI (fcMRI) has drawn increasing
attention of neuroscientists and computer scientists, since it opens a new window to explore
functional network of human brain with relatively high resolution. BOLD technique provides
almost accurate state of brain. Past researches prove that neuro diseases damage the brain
network interaction, protein- protein interaction and gene-gene interaction. A number of
neurological research paper also analyse the relationship among damaged part. By
computational method especially machine learning technique we can show such classifications.
In this paper we used OASIS fMRI dataset affected with Alzheimer’s disease and normal
patient’s dataset. After proper processing the fMRI data we use the processed data to form
classifier models using SVM (Support Vector Machine), KNN (K- nearest neighbour) & Naïve
Bayes. We also compare the accuracy of our proposed method with existing methods. In future,
we will other combinations of methods for better accuracy.
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...cscpconf
In order to treat and analyze real datasets, fuzzy association rules have been proposed. Several
algorithms have been introduced to extract these rules. However, these algorithms suffer from
the problems of utility, redundancy and large number of extracted fuzzy association rules. The
expert will then be confronted with this huge amount of fuzzy association rules. The task of
validation becomes fastidious. In order to solve these problems, we propose a new validation
method. Our method is based on three steps. (i) We extract a generic base of non redundant
fuzzy association rules by applying EFAR-PN algorithm based on fuzzy formal concept analysis.
(ii) we categorize extracted rules into groups and (iii) we evaluate the relevance of these rules
using structural equation model.
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATAcscpconf
In many applications of data mining, class imbalance is noticed when examples in one class are
overrepresented. Traditional classifiers result in poor accuracy of the minority class due to the
class imbalance. Further, the presence of within class imbalance where classes are composed of
multiple sub-concepts with different number of examples also affect the performance of
classifier. In this paper, we propose an oversampling technique that handles between class and
within class imbalance simultaneously and also takes into consideration the generalization
ability in data space. The proposed method is based on two steps- performing Model Based
Clustering with respect to classes to identify the sub-concepts; and then computing the
separating hyperplane based on equal posterior probability between the classes. The proposed
method is tested on 10 publicly available data sets and the result shows that the proposed
method is statistically superior to other existing oversampling methods.
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCHcscpconf
Data collection is an essential, but manpower intensive procedure in ecological research. An
algorithm was developed by the author which incorporated two important computer vision
techniques to automate data cataloging for butterfly measurements. Optical Character
Recognition is used for character recognition and Contour Detection is used for imageprocessing.
Proper pre-processing is first done on the images to improve accuracy. Although
there are limitations to Tesseract’s detection of certain fonts, overall, it can successfully identify
words of basic fonts. Contour detection is an advanced technique that can be utilized to
measure an image. Shapes and mathematical calculations are crucial in determining the precise
location of the points on which to draw the body and forewing lines of the butterfly. Overall,
92% accuracy were achieved by the program for the set of butterflies measured.
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...cscpconf
Smart cities utilize Internet of Things (IoT) devices and sensors to enhance the quality of the city
services including energy, transportation, health, and much more. They generate massive
volumes of structured and unstructured data on a daily basis. Also, social networks, such as
Twitter, Facebook, and Google+, are becoming a new source of real-time information in smart
cities. Social network users are acting as social sensors. These datasets so large and complex
are difficult to manage with conventional data management tools and methods. To become
valuable, this massive amount of data, known as 'big data,' needs to be processed and
comprehended to hold the promise of supporting a broad range of urban and smart cities
functions, including among others transportation, water, and energy consumption, pollution
surveillance, and smart city governance. In this work, we investigate how social media analytics
help to analyze smart city data collected from various social media sources, such as Twitter and
Facebook, to detect various events taking place in a smart city and identify the importance of
events and concerns of citizens regarding some events. A case scenario analyses the opinions of
users concerning the traffic in three largest cities in the UAE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGEcscpconf
The anonymity of social networks makes it attractive for hate speech to mask their criminal
activities online posing a challenge to the world and in particular Ethiopia. With this everincreasing
volume of social media data, hate speech identification becomes a challenge in
aggravating conflict between citizens of nations. The high rate of production, has become
difficult to collect, store and analyze such big data using traditional detection methods. This
paper proposed the application of apache spark in hate speech detection to reduce the
challenges. Authors developed an apache spark based model to classify Amharic Facebook
posts and comments into hate and not hate. Authors employed Random forest and Naïve Bayes
for learning and Word2Vec and TF-IDF for feature selection. Tested by 10-fold crossvalidation,
the model based on word2vec embedding performed best with 79.83%accuracy. The
proposed method achieve a promising result with unique feature of spark for big data.
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXTcscpconf
This article presents Part of Speech tagging for Nepali text using General Regression Neural
Network (GRNN). The corpus is divided into two parts viz. training and testing. The network is
trained and validated on both training and testing data. It is observed that 96.13% words are
correctly being tagged on training set whereas 74.38% words are tagged correctly on testing
data set using GRNN. The result is compared with the traditional Viterbi algorithm based on
Hidden Markov Model. Viterbi algorithm yields 97.2% and 40% classification accuracies on
training and testing data sets respectively. GRNN based POS Tagger is more consistent than the
traditional Viterbi decoding technique.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
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.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
2. 18 Computer Science & Information Technology (CS & IT)
and information from one node to another. There are many number of routing protocols have
been developed to accomplish this task. Some of this protocols are DSDV (Destination
Sequenced Distance Vector), AODV (Ad-hoc On-demand Distance Vector), Zone routing
protocol (ZRP) etc.
As in MANET the nodes are mobile so the topology (topology of network actually referred to the
structure if the network) is always changing and there could be a multipath propagation or path
loss are interference by other signal may occurred. So in this case we need a dynamic routing
protocol. There are two types of routing protocol – static and dynamic. Static routing protocol is
applicable where the network topology is fixed for example in case of LAN connection where a
physical connection exists between the nodes. And Dynamic routing protocol is applicable where
there is no any fixed topology such MANET. There are several routing protocol is exist for
Mobile Ad-Hoc network. They are mainly divided in three groups namely- 1.Proactive routing
protocol. 2. Reactive routing protocol. 3. Hybrid protocol. There are a number of protocols are
available under this category of protocols. We can explain by a picture.
In Ad-hoc network routing is challenging because in ad-hoc network there is no physical
connection between nodes so routing is very challenging in case of ad-hoc network. The various
are described in brief. Ad-hoc network use some sort of radio frequencies for the transition of
data or information. So there is a chance of get obstruction by various things like wall or
something like that. Interference due to weather or other frequency devices is also possible in that
case. Multipath propagation is at the time of propagating of a signal from source to destination
node it may possible that on the way of propagation of signal there is some obstacle which make
the signal propagate in the path beyond the direct line of sight due to reflection, refraction,
diffraction and scattering. Path loss is also a major problem in wireless communication. Path loss
is reduction of propagated signal strength as it moves far from sender node. Path loss can be
determined from the ratio of power of transmitted signal to the received signal. Interference is an
another problem of wireless communication because when a signal passing through air there may
be a number of signals present there which can interfere with each other and destroy the original
signal. Security is one of the biggest problems in case of wireless communication. As wireless
communication include no any wire for communication then the signal can be accessed by an
unauthorized person very easily which is obviously not a secured way to send information. Again
in ad-hoc network the nodes can be moveable that’s why the position of the nodes is changeable
randomly and also can join or leave the network. The main challenges in re-active routing
protocols are 1) High route discovery latency: Re-active routing protocol required high latency
time in route finding. This means that it does not discover a route until a flow is initiated. This
route discovery latency result can be high in large-scale mesh networks. 2) No reuse of routing
info: Re-active lacks an efficient route maintenance technique. The routing info is always
obtained on demand, including for common cause traffic also. 3) It is vulnerable to misuse: The
messages can be misused for insider attacks including route disruption, route invasion, node
isolation, and resource consumption.
2. RELATED WORKS
According to the proposal of Idrees et al. [9] in mobile ad-hoc networks, mobility of nodes plays
a vital role in the overall throughput of the network. As all nodes in an ad-hoc network also work
as a router. So if a node is moving on a regular basis then it must not act as a router because it can
cause path breakage very often. But there is no mechanism that an individual node can have any
information about the mobility of other nodes in the network. Mobility awareness about the
dynamic network topology can reduce this problem. They introduce a lightweight mobility aware
agent on each node of the network that helps nodes to know about the mobility status of other
nodes in the network. To achieve agent based mobility awareness all agents in the network
3. Computer Science & Information Technology (CS & IT) 19
broadcast their current location in the network periodically or semi periodically. Agents receiving
this information update their knowledgebase for the mobility information of their neighbors i.e.
stationary or in motion; that further helps to know about the direction of moving nodes. The
status of those nodes, which are moving away from a particular node, is different from those,
which are coming towards it. This movement is considered relative, if node-A is moving away
from a static node- B then agent placed at node-A predicts it and can exploit this information for
rerouting and link establishment. Placement of agents at network nodes help in many ways e.g. it
can use different environmental statistics of network for example speed of a particular node can
help for future predictions of network topology. In perfect agent based mobility aware network,
parameter like high mobility of a node is recorded that helps in different intelligent decisions. In
AODV the mobility status of any node is not considered at all while establishing a route between
two nodes. So if a mobile node moves in such a way that it is no longer able to help in
transferring data, a route error is generated causing a reroute discovery process. Same thing
happen again and again establishing routes after quick intervals resulting in the reduction of
overall throughput of the network. Mobility aware agent based ad hoc network prefers static
nodes in route discovery. It also restricts highly mobile nodes to be the part of routes. More static
nodes in the path help in establishing a route for a longer period, resulting in less reroute
discoveries. Furthermore, network statistics helps in its future prediction. The Ad hoc On-
Demand Distance Vector routing algorithm is initiated whenever a particular node wish to send
data to some other node. AODV allows mobile nodes to obtain routes quickly for new
destinations, and does not require nodes to maintain routes to destinations that are not in active
communication. When links break, AODV causes the affected set of nodes to be notified so that
they are able to invalidate the routes using the lost link. Although AODV allows mobile nodes to
inform about link breakage in a timely manner, but their proposed scheme helps in reducing this
link breakage by using the concept of mobility aware agent at each node. Following is the
enhanced route discovery process of AODV using the concept of mobility aware agent. Agent at
the source node broadcast a RREQ single when it determines that it needs a route to a destination
and does not have one available in its knowledgebase. This can happen if the destination is
previously unknown to the agent or if a previously valid route to the destination expire or it is
marked as invalid. When an agent on a node receives RREQ, it records previous hop address;
even it is received after the expiry time. Agent on second node generates RREP if it is itself
destination or it has an active route to destination. This RREP is sent to best neighbor. In
backward path best neighbor is that node which is not moving more frequently. This process of
the selection of best neighbor process is done at each intermediate agent based nodes. In this way
it is tried to establish a path between two nodes having maximum number of less mobile nodes.
During the selection of best neighbor. The key advantage of using this protocol is, instead of
using the high mobile node, it is using static node to establish the connection between sources to
destination. So, it reduces the possibility of link break as well as the overhead of establishing
connection between nodes. But the main problem in their proposal is that in most of the cases
nodes are mobile in ad-hoc network. So it is hard to find static node and creating connection
using them. Also proposed scheme is not applicable where all nodes are mobile in nature.
Yaser et al. [10] exploits two ideas. Their first protocol is Per Hop Mobility Aware AODV (PH-
MA-AODV) and the second is the Aggregate Mobility Aware AODV (Agg-AODV). Their MA-
AODV protocols offer major contributions and improve the performance of the original AODV
protocol. i. PH-MA-AODV Protocol: In the traditional AODV, the source node initiates a route
discovery process for the sake of finding the intended destination node. The same RREQ packet
may pass through several paths (routes) to find its way towards the destination. Upon receiving
the RREQ, the destination node replies back choosing the first route it gets, and consequently,
other routes with possibly better metrics and Quality of Service (QoS) are dropped. Their
contribution makes the traditional AODV conscious to the mobility when choosing the best route.
In other words, in PH-MA-AODV, each node computes its own mobility periodically. Then,
while initiating the Route Discovery process, each node decides to whether participate in the
4. 20 Computer Science & Information Technology (CS & IT)
discovery process and thus relay the RREQ further or not. Therefore, the overall selected route is
stable and more reliable. The main advantage of this protocol is instead of using the static node as
proposed by Idrees et al. [9] it use the comparatively less mobile node to create the connection
between source and destination node. Possibility of link breakage is also low. But the main
drawback of this protocol is as each node has the rides to take the decision whether to participate
in routing or not it is comparatively insecure and has a high possibility of compromising. An
extra overhead for each node for taking decision whether to participate or not in routing. ii. Agg-
AODV Protocol: The mechanism of PH-MA-AODV is partially applied in this approach in the
sense that periodically, each node computes its own mobility. However, unlike PH-MAAODV,
where the routing decision is made by the individual node as to whether participates in the route
discovery process (based on that node’s mobility), in Agg- AODV, upon receiving the RREQ
packet, if the recipient node is not the intended destination, it adds its own mobility to the RREQ
packet and forwards it further towards the destination. The destination node is responsible to store
the aggregated value of mobility along the path from itself to the source, and to compare this
value with future aggregated values that are obtained from other available paths towards the same
source. If there are more than one active path between the source and the destination, the
destination chooses the path whose aggregated mobility value is the least among all paths. It is
worthy to note that upon receiving the RREQ packet for the first time through a specific path, the
destination has no other choice but to select this path (regardless to its aggregated mobility value)
to send RREP back to the source. However, the decision to whether continue using this path
depends on the aggregated mobility of the subsequent paths. The main advantage of this protocol
is as it also uses the less mobile nodes to communicate it has all the advantages as previous. One
more advantage is that, here source takes the decision of choosing path. So it is more secure
comparatively to the previous. But the main problem is this method is not aware of the direction
of movement of nodes. It may choose the node which has less mobility value but the direction is
outwards from the source. In that case the node has the possibility of leaving the network.
Nadjib et al. [12] presented an algorithm where mobility of a node has been calculated by the
following way. According to the author, Mobility is an important parameter for MANETs routing
protocols evaluation and depends on several parameters. These parameters were represented by
node speed, or by the pause time when using the random way-point model. These representation,
however, are meaningless and do not reflect the topology changes. Nodes may move either in
high speed or a low pause time, but towards the same direction without causes any topological
change. On the other hand, node may have a low speed or a high pause time, but they move away
from each other, resulting in important topological change. This illustrates the weakness of this
mobility representation.
A more explanation that better express the network topological change was proposed by Larsson
et al [11]. Their proposal is based on relative node’s movement, and represents by a parameter
called mobility factor (mob) that’s depends on both, the nodes speed and the movement pattern
(direction). It is given by this following formula:
5. Computer Science & Information Technology (CS & IT) 21
In this implementation, this parameter (called mobility factor) is computed for an each interval of
time say, t = 0, t =At, t = 2At, ….. t = T. The main advantage of this proposal is this procedure
conceder the mobility for each nodes and relative mobility among them. It also tries to takes the
direction of movement in consideration. But the main disadvantage of this proposal is as it is just
a logical implementation of this formulation. So, it is hard to implement.
3. NETWORK MODEL AND ASSUMPTIONS
Here we are assuming that all nodes are GPS enable and they are connected to each other with bi-
directional antenna and range of each antenna is equal. Each node time to time requests the GPS
device to get their position in current time (that is co-ordinate in geographical domain). So
initially we are considering that each node of the network is aware of their current location with
respect to geographical co-ordinate.
At any instant of time, an ad-hoc network can be described by a graph of the nodes (routers+
hosts). Two nodes are connected (i.e., have an arc between them in the graph) If they can
communicate directly using their radios. Since one of the two may have a powerful transmitter
than the other, it is possible that A is connected to B but B is not connected to A [Figure. 1].
However, for simplicity, we will assume all communication is symmetric.
4. METHODOLOGY AND ALGORITHM
Our objective is to minimize the problems caused by mobility of the nodes in AODV (mainly link
breakage problem). So below we are proposing a methodology where an optimal static path is
chosen instead of choosing shortest path all the time to send data from source to destination.
To meet our requirement we slightly modified the HELLO message of AODV which is
broadcasted by each node among its neighbors to maintain its ROUTING TABLE. According to
our assumption each node has its position co-ordinate (Altitude, Longitude, and Height). We are
simply adding these three position parameters with the HELLO message field and broadcasting it
among neighbors. When the HELLO message will reach to its neighbor node, the neighbor node
will copy these three parameters to its ROUTING TABLE. The procedure will be followed by
each and every node of the network. By this way each node is getting the information about the
position of neighbors at free of cost for a certain interval of time.
6. 22 Computer Science & Information Technology (CS & IT)
Figure 1: Graphical representation of an Ad-Hoc Network
According to [Figure 1] A, B, F and G are the neighbors of node D. After receiving the HELLO
messages from neighbors (that is A, B, F, and G), node D updates the position field with its
neighbor’s corresponding position co-ordinate. A possible snap of D’s ROUTING TABLE is
given below. The use of last two fields will be discussed later. So node D has all the information
about the position of its neighbors. By following the same procedure every node in the network
maintains its ROUTING TABLE.
Table 1: ROUTING TABLE for node D
Dest. Next
Hop
Distance Active
Neighbors
Position
(XN,YN,ZN)
Flag Velocity
A A 1 F,G XA,YA,ZA -1
B B 1 F,G XB,YB,ZB
C B 2 F
E G 2
F F 1 A,B XF,YF,ZF 1
G G 1 A,B XG,YG,ZG
H F 2 A,B 0
I G 2 A,B
Where,
XN : Altitude of node N
YN : Longitude of node N
ZN : Height of node N
4.1. Route Discovery Procedure:
Whenever a node (source) tries to send data to another node (destination) it will first look into its
ROUTING TABLE. If source doesn’t find entry for destination it constructs a special ROUTE
REQUEST packet and broadcast it.
The format of ROUTE REQUEST packet is as follows,
EEEE
A
B
C
DDDD
IIIIHHHH
GGGG
FFFF
7. Computer Science & Information Technology (CS & IT) 23
Source
Address
Request
ID
Destination
Address
Source
Sequence
Destination
Sequence
Here Source Address, Request ID used to identify the request uniquely. As source broadcasts the
ROUTE REQUEST message to the network, so it is possible that same request may come to a
node by different path. Here we have slightly modified the AODV algorithm. When a node
receives the same ROUTE REQUEST message by more than one path, unlike AODV it will not
simply discard the massage which has came later. It keeps track all the neighbors node by which
the ROUTE REQUEST message appear, though the root may be a longer one. For example, if a
ROUTE REQUEST message from node A [Figure 1] reached to node G by the following 3 root
ADG, ABCEG and ADFHG. Then G will keep a reverse path entry for these three neighbors i.e.
D, E and H in its local memory. Every node will follow the same procedure and maintain the
record in a local database which is called REQUEST TABLE.
The REQUEST TABLE format is as follows,
Source Address Request ID Req. From
Neighbor
Here, Source Address, Request ID used to identify the ROUT REQUEST uniquely among the
several request made by other node also at the same time. These fields are copied from the
ROUTE REQUEST packet. Rest of the procedure is same as AODV.
4.1.1. Action taken by a node when ROUTE REQUEST packet appears to it:
Step 1: Copy Destination Address from route request.
Step 2: If Destination Address = node address
Step 2.1: Generate route reply.
Step 2.2: Unicast route reply to the neighbor.
Step 2.3: Discard route request.
Step 3: Else
Step 3.1: Update REQUEST TABLE.
Step 3.2: Broadcast route request to neighbours.
4.1.2. Action by a node to update REQUEST TABLE when it receives a ROUTE REQUEST
packet:
Step 1: copy (Source Address, Request ID) from route request.
Step 2: Search for same entry (Source Address, Request ID) in REQUEST TABLE.
Step 3: if (Source Address, Request ID) doesn’t match the entry in REQUEST TABLE then,
Step 3.1: Copy ROUTE REQUEST (Source Address, Request ID) to REQUEST
TABLE (Source Address, Request ID).
Step 3.2: Copy Address of the neighbor node from which route request appear to
REQUEST TABLE (Req. From Neighbor)
Comment: Enter (Source Address, Request ID) and address of the neighbor node (from
which the request appears) into the corresponding fields of REQUEST TABLE (that is
Req. From Neighbor).
Step 3.3: Broadcast route request.
Step 4: If (Source Address, Request ID) matches with existing table entry then,
Step 4.1: Copy Address of the neighbor node from which route request appear to
REQUEST TABLE (Req. From Neighbor).
Comment: Add address of the neighbor node (from which the request appears) to the
corresponding field of REQUEST TABLE (last field) for the same (Source Address,
Request ID) field value of REQUEST TABLE.
8. 24 Computer Science & Information Technology (CS & IT)
Step 4.2: Discard route request.
In AODV after appearing the ROUTE REQUEST message to the destination node, it generates a
ROUTE REPLY message and unicast the packet to the source through the shortest path. Our
algorithm mainly deals with this portion i.e. choosing of path by which the ROUTE REPLY
message reaches to the source node. Before going in details let go back to Table 1 to understand
the remaining two fields. Our aim is to select a path (to transfer data) which is static in nature i.e.
link breakage is minimum. To meet our requirements to send back the ROUTE REPLY message
to the source, here we are considering those nodes which are converging to each other and have
low velocity.
Being GPS enable each node knows the current location of its own and also knows the location of
its neighbors from its ROUTING TABLE (which is time to time update by the HELLO
MESSAGE). This piece of information is used to check whether the nodes are converging or
diverging from its neighbor.
So from the two co-ordinates (one is the node’s position co-ordinate and another is the position
co-ordinate of its neighbor) it will calculate the Euclidian distance. Let explain it with an
example, let at t1 time position co-ordinate of node D is (XDt1,YDt1,ZDt1) and position co-ordinate
of G is (XGt1,YGt1,ZGt1). So distance among D and G at time t1 is:
dist(t1)= ( (XDt1 - XGt1)2
+ (YDt1 - YGt1)2
+ (ZDt1 - ZGt1)2
) [sqrt: Square root function]
let after some time (at t2 time) position of D is (XDt2,YDt2,ZDt2) and position of G is
(XGt2,YGt2,ZGt2). So distance among D and G at time t2 is:
dist(t2)=sqrt( (XDt2 - XGt2)2
+ (YDt2 - YGt2)2
+ (ZDt2 - ZGt2)2
)
So there velocity of converging or diverging is:
velo(t1,t2)=( dist(t1) + dist(t2) ) / (t2 – t1). These velo(ti,ti+1) is the entry for the Velocity field of
ROUTING TABLE. By following the same procedure a node can calculate its distance from its
neighbor as well as its velocity at the time ti, where i=1, 2, 3, 4… and so on. Now if dist(t1) >
dist(t2) then the node D and G have came to each other at time interval (t2 – t1). So D and G have
converged to each other for that time instant. On the other hand if dist(t1) < dist(t2) then they
have diverged from each other. By this way each node gets the information whether it is
converging or diverging from its neighbor. Flag in ROUTING TABLE is used to keep track
whether a neighbor is converging or diverging. Initially flag value is set to 0 if a neighbor of a
node diverge from it then it set to +1 otherwise it set to -1. Let explain it with an example, if we
consider the above figure [Figure 1], here node D has four neighbors A, B, F and G. Among them
suppose node A and G are converging to each other. So, D will set its flag value to -1 for node A.
On the other hand if node D and F are diverging to each other then it will set its flag value to 1 for
neighbor F.
Format of the ROUTE REPLY message:
Source
Address
Request
ID
Destination
Address
Destination
Sequence
Lifetime
9. Computer Science & Information Technology (CS & IT) 25
4.1.3. Action taken by a node when ROUTE REPLY message appear to it:
Step 1: Copy (Source Address, Request ID) from ROUTE REPLY.
Step 2: Search REQUEST TABLE for same entry (Source Address, Request ID).
Step 3: If (Source Address, Request ID) match found then,
Step 3.1: Copy all address from REQUEST TABLE (Req. From Neighbor).
Comment: Collect address of all neighbor nodes which are store in Req. From
Neighbor field of REQUEST table for the same (Source Address, Request ID) field
value.
Step 3.2: For all neighbor node collected at previous step.
Comment: The node wills conceder its ROUTING TABLE to calculate the following
logic.
Step 3.2.1: If no of converging neighbor node = 0
Step: 3.2.1.1: Select the diverging node which has minimum velocity.
Comment: If all neighbors are diverging from the node then choose one of the diverging
node which has minimum velocity.
Step 3.2.2: If no of converging neighbor node =1
Step 3.2.2.1: If velocity of converging neighbor node < 2 * (minimum velocity
among the neighbors)
Step 3.2.2.1.1: Select the neighbor node to send route reply.
Step 3.2.2.2: Else
Step 3.2.2.2.1: Select the diverging node which has minimum velocity.
Comment: If only one converging neighbor node is available then select this neighbor
node to send the route reply message if the velocity of the neighbor node < 2 * (minimum
velocity among the entire neighbor node). Otherwise choose the diverging node which
has minimum velocity.
Step 3.2.3: If no of converging neighbor node >1
Step 3.2.3.1: For all converging neighbor node If velocity < 2 * (minimum
velocity among the neighbors)
Step 3.2.3.1.1: Select the converging node which has lower velocity.
Step 3.2.3.2: Else
Step 3.2.3.2.1: Select the diverging node which has minimum velocity.
Comment: If more than one converging node is available then choose the converging
node which has minimum velocity if the velocity of all of them < 2* (minimum velocity
among the neighbors). Otherwise select the node which satisfies the above condition. If
no one among the converging neighbor node satisfies the condition then select one of the
diverging nodes which have minimum velocity.
Step 4: Else
Step 4.1: Discard route reply.
10. 26 Computer Science & Information Technology (CS & IT)
Figure 2: Graphical representation of an Ad-Hoc Network
These above procedure will be followed by each node while selecting the path for sending the
ROUTE REPLY message to the source node. Let explain it with example. In [Figure 2] we
assume that node a want to send data to node I. To do this A will broadcast the ROUTE
REQUEST packet to its neighbor. Here we assume the ROUTE REQUEST packet reached to
node I by two paths one is ADGI and another is ADFHI. So node I has two entries in Req. From
Neighbor field of its REQUEST TABLE for the same (Source Address, Request ID), one is G
and another is H. Now if we assume the situation that, G and I are diverging to each other and H
and I are converging to each other. So, when node I send the route reply message to the source,
instead of choosing the neighbor G it will choose node H, as node H are converging in nature.
Now when route reply will reach to node H, it also executes the same logic to choose its neighbor
where it wills unicast the route reply message. These procedure will followed by each node until
source node (that is node A) reached.
5. EXPERIMENT RESULTS
We have simulated our proposed algorithm using JAVA Applet. The simulation procedure
simultaneously executes two algorithms one is Mobility Aware Routing Protocol (MARP) which
we have proposed here and another is Non Mobility Aware Routing Protocol (NMARP).
We have simulated these two algorithms in an 800 x 800 Applet window for different no of node
of different velocity. A node is represented by a name (like n[0], n[1], n[2],…etc) and their
position co-ordinate in applet window (like (150,300), (200,550), (700,400),… etc). A circle
around a node represents its antenna range. When circle of two nodes intersects with each other
that means they are within the range of each other, so they are connected and can communicate to
each other. For example, if the circle of n[0] and n[5] intersect to each other that means they are
connected and can exchange data to each other.
Our aim was to establish an optimistic static path from source to destination by which source can
transmit data to the destination. In Applet Window a line between nodes represents this path.
5.1. Simulation Result:
We have simulated this two algorithm (MARP and NMARP) separately for different number of
node. Below are the different scenarios for both the algorithm,
EEEE
A
B
C
DDDD
IIIIHHHH
GGGG
FFFF
11. Computer Science & Information Technology (CS & IT) 27
5.1.1. Scenario1:
No of Node: 9 Source Node: n[0] Destination Node: n[6]
5.1.2. Scenario2:
No of Node: 11 Source Node: n[0] Destination Node: n[6]
Figure 3: Showing Data Routing Path
from Source to Destination for Non
Mobility Aware Routing Protocol
(NMARP)
Figure 4: Showing Data Routing Path
from Source to Destination for
Mobility Aware Routing Protocol
(MARP)
Figure 5: Showing Data Routing Path
from Source to Destination for Non
Mobility Aware Routing Protocol
(NMARP)
Figure 6: Showing Data Routing
Path from Source to Destination for
Mobility Aware Routing Protocol
(MARP)
12. 28 Computer Science & Information Technology (CS & IT)
5.1.3. Scenario3:
No of Node: 13 Source Node: n[0] Destination Node: n[6]
Based on such different scenarios we have calculated several statistical values. The table below
represents these values:
Table 2: Comparison of no. of link break between NMARP & MARP for different no of nodes
No. of Node No. of Link
Break for
NMARP
No. of Link
Break for
MARP
4 1 0
7 2 1
8 3 2
9 5 2
10 9 4
11 9 6
12 11 6
13 13 9
NMARP: Non Mobility Aware Routing Protocol.
MARP: Mobility Aware Routing Protocol.
Based on the above statistics we have generated the Line Graph and the Bar Graph.
Figure 7: Showing Data Routing Path
from Source to Destination for Non
Mobility Aware Routing Protocol
(NMARP)
Figure 8: Showing Data Routing Path
from Source to Destination for
Mobility Aware Routing Protocol
(MARP)
13. Computer Science & Information Technology (CS & IT) 29
Figure 9: Graph Showing the Statistics for both NMARP and MARP
Figure 10: Bar Graph Showing the Statistics for both NMARP and MARP
From the above statistics it can be easily understand that frequency of link break in Mobility
Aware Routing Protocol (MARP) is much lower than the Non Mobility Aware Routing Protocol
(NMARP). If we consider this above two graphs then we can see that both the Line Graph and
Bar Graph values of Mobility Aware Routing Protocol (MARP) lies below the Line Graph and
Bar Graph values of Non Mobility Aware Routing Protocol (NMARP). So from the above
comparative studies which have done for different no of nodes, it can be easily conclude that the
Mobility Aware Routing Protocol (MARP) which we have proposed, always selects
comparatively static path than the other protocols.
14. 30 Computer Science & Information Technology (CS & IT)
Advantages of Using This Protocol:
Frequency of link break among nodes is much lower in this protocol. So this protocol gives more
static path between source and destination where nodes are mobile in nature.
As the rate of link break is much lower, so the rate of broadcasting of messages (Like HELLO
Message, ROUTE REQUEST Message, ROUTE REPLY Message, ERROR Message, etc.) is
also low in this protocol.
As the protocol use more static path to send data, so the frequency of broadcasting of messages
(Like HELLO Message, ROUTE REQUEST Message, ROUTE REPLY Message, ERROR
Message, etc.) is low in this case. So the energy loss for sending these messages is also low in this
protocol.
This protocol used more stable path to send data from source to destination. So, it is very much
suitable for sending large data where continuous connection is required among source and
destination.
6. CONCLUSIONS AND FUTURE WORK
So in this routing protocol we emphasize on more stable path rather than shortest path all the time
and as the protocol reduces the probability of link breakage the rate of broadcasting of ROUTE
REQUEST, ROUTE REPLY, HELLO, ERROR messages are also reduce. The protocol reduce
the topological changes, on the other hand it will also minimize the overhead of broadcasting
messages. This protocol can be very efficient at the time of sending the large data where
continuous connection among the source and destination is more preferable. If we consider the
two graphs in previous section then we can see that both the Line Graph and Bar Graph values of
Mobility Aware Routing Protocol (MARP) lies below the Line Graph and Bar Graph values of
Non Mobility Aware Routing Protocol (NMARP). So from the above comparative studies which
have done for different no of nodes, it can be easily conclude that the Mobility Aware Routing
Protocol (MARP) which we have proposed, always gives stable path and selects comparatively
static path than the other protocols.
In future we would like to perform extensive experiment with our algorithm using standard
network simulator like Glomosim or NS2 or OPNET modeler. We also like to enhance our
algorithm for other existing reactive routing protocols like ABR, DSR, TORA, CDRP, etc (other
than AODV).
REFERENCES
[1] http://ntrg.cs.tcd.ie/undergrad/4ba2.05/group11/index.html
[2] http://www.acorn.net.au/telecoms/adhocnetworks/adhocnetworks.cfm
[3] http://monet.postech.ac.kr/research.html
[4] Routing Protocols in Mobile Ad-hoc Networks by Krishna Gorantala. SWEDEN, June 15, 2006.
[5] Ad Hoc Networks Routing Protocols and Mobility by Djamel Djenouri, Abdelouahid Derhab and
Nadjib Badache. CERIST research center, USTHB University, ALGERIA.
[6] Wireless Ad-hoc Networks by Lu Han. October 8, 2004.
[7] AODV Routing Protocol by Georgy Sklyarenko. Seminar Technische Informatik, Freie University at
Berlin, Germany.
15. Computer Science & Information Technology (CS & IT) 31
[8] Ad hoc On Demand Distance Vector (AODV) Routing Protocol by Dr. Baruch Awerbuch & Dr.
Amitabh Mishra. Johns Hopkins, 2005.
[9] Enhancement in AODV Routing Using Mobility Aware Agents by Idrees, M. Yousaf, M.M. Jaffry,
S.W. Pasha, M.A. Hussain. IEEE 2005 International Conference on Emerging Technologies
September 17-18, Islamabad.
[10] Mobility Aware Routing Protocols for Mobile Ad hoc Networks by Yaser Khamayseh, Omar M.
Darwish, Sana A. Wedian. Published in: 2009 Fourth International Conference on Systems and
Networks Communications, IEEE Computer Society Washington, DC, USA. ISBN: 978-0-7695-
3775-7
[11] Routing Protocol in Wireless Ad-Hoc Networks by Larsson T. and Hedman N. Wireless Personal
Multimedia Communications, September 2001.
[12] Ad Hoc Network Routing Protocols and Mobility by Nadjib Badache, Djamel Djenouri. The
International Arab Journal of Information Technology , Vol. 3, No. 2, April,2006.
[13] Survey of Ad-hoc Routing Protocols by Jason Winnebeck, Benjamin Willis, Travis Thomas. Team
Adhocracy Presentation3 – April 23, 2007.
Authors:
Mr. Suman Halder is a B.Tech Graduate in Computer Science and Engineering from
West Bengal University of Technology, Kolkata, India.
Ms. Sukla Banerjee is an M.Tech in Information Technology. She is an Asst. Professor
of RCC Institute of Information Technology, West Bengal, India
Mr. Partha Pratim Meta is a B.Tech Graduate in Computer Science and Engineering from West Bengal
University of Technology, Kolkata, India.