This document summarizes a research paper that proposes a new routing algorithm for mobile ad hoc networks using fuzzy logic. The algorithm considers three input variables - signal power, mobility, and delay. It defines fuzzy sets and membership functions to map crisp normalized values of these variables to linguistic values. Rules are written to relate the input and output linguistic variables. The output represents the optimal route. The algorithm aims to address routing problems related to bandwidth, signal power, mobility, and delay in a distributed manner without relying on centralized control. It is designed to quickly adapt to changes in network topology.
Traffic engineering is one of the major issues that has to be addressed in Metro Ethernet networks for quality of service and efficient resource utilization. This paper aims at understanding the relevant issues and outlines novel algorithms for multipoint traffic engineering in Metro Ethernet. We present an algorithmic solution for traffic engineering in Metro Ethernet using optimal multiple spanning trees. This iterative approach distributes traffic across the network uniformly without overloading network resources. We also introduce a new traffic specification model for Metro Ethernet, which is a hybrid of two widely used traffic specification models, the pipe and hose models.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with
each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc
network have the attributes such as wireless connection, continuously changing topology, distributed operation
and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive &
hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the
Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed
simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed &
battery consumption. It has been observed that RIP has better network lifetime than other
6RLR-ABC: 6LOWPAN ROUTING PROTOCOL WITH LOCAL REPAIR USING BIO INSPIRED ARTIF...IJCNCJournal
In recent years, Micro-Electro-Mechanical System (MEMS) has successfully enabled the development of IPv6 over Low power Wireless Personal Area Network (6LoWPAN). This network is equipped with lowcost, low-power, lightweight and varied functions devices. These devices are capable of amassing, storing, processing environmental information and conversing with neighbouring sensors. These requisites pose a new and interesting challenge for the development of IEEE 802.15.4 together with routing protocol. In this work, 6LoWPAN Routing Protocol with Local Repair Using Bio Inspired Artificial Bee Colony (6RLRABC) has been introduced. This protocol supports connection establishment between nodes in an energyefficient manner while maintaining high packet delivery ratio and throughput and minimizing average endto-end delay. This protocol has been evaluated based on increasing generated traffic. The performance of the designed 6RLR-ABC routing protocol has been evaluated compared to 6LoWPAN Ad-hoc On-Demand Distance Vector (LOAD) routing protocol. LOAD protocol has been chosen since it is the most relevant existed 6LoWPANrouting protocol. The simulation results show that the introduced 6RLR-ABC protocol achieves lower packet average end-to-end delay and lower energy consumption compared to LOAD protocol.Additionally,the packet delivery ratio of the designed protocol is much higher than LOAD protocol. The proposed 6RLR-ABC achieved about 39% higher packet delivery ratio and about 54.8% higher throughput while simultaneously offering lower average end-to-end delay and lower average energy consumption than LOAD protocol.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
EFFECTS OF MAC PARAMETERS ON THE PERFORMANCE OF IEEE 802.11 DCF IN NS-3ijwmn
This paper presents the design procedure of the NS-3 script for WLAN that is organized according to the hierarchical manner of TCP/IP model. We configure all layers by using NS-3 model objects and set and modify the values used by objects to investigate the effects of MAC parameters (access mechanism, CWmin, CWmax and retry limit) on the performance metrics viz. packet delivery ratio, packet lost ratio, aggregated throughput, and average delay. The simulation results show that RTS/CTS access mechanism outperforms basic access mechanism in saturated state, whereas the MAC parameters have no significant impact on network performance in non-saturated state. A higher value of CWmin improves the aggregated throughput in expense of average delay. The tradeoff relationships among the performance metrics are also observed in results for the optimal values of MAC parameters. Our design procedure represents a good guideline for new NS-3 users to design and modify script and results greatly benefit the network design and management.
Traffic engineering is one of the major issues that has to be addressed in Metro Ethernet networks for quality of service and efficient resource utilization. This paper aims at understanding the relevant issues and outlines novel algorithms for multipoint traffic engineering in Metro Ethernet. We present an algorithmic solution for traffic engineering in Metro Ethernet using optimal multiple spanning trees. This iterative approach distributes traffic across the network uniformly without overloading network resources. We also introduce a new traffic specification model for Metro Ethernet, which is a hybrid of two widely used traffic specification models, the pipe and hose models.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with
each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc
network have the attributes such as wireless connection, continuously changing topology, distributed operation
and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive &
hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the
Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed
simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed &
battery consumption. It has been observed that RIP has better network lifetime than other
6RLR-ABC: 6LOWPAN ROUTING PROTOCOL WITH LOCAL REPAIR USING BIO INSPIRED ARTIF...IJCNCJournal
In recent years, Micro-Electro-Mechanical System (MEMS) has successfully enabled the development of IPv6 over Low power Wireless Personal Area Network (6LoWPAN). This network is equipped with lowcost, low-power, lightweight and varied functions devices. These devices are capable of amassing, storing, processing environmental information and conversing with neighbouring sensors. These requisites pose a new and interesting challenge for the development of IEEE 802.15.4 together with routing protocol. In this work, 6LoWPAN Routing Protocol with Local Repair Using Bio Inspired Artificial Bee Colony (6RLRABC) has been introduced. This protocol supports connection establishment between nodes in an energyefficient manner while maintaining high packet delivery ratio and throughput and minimizing average endto-end delay. This protocol has been evaluated based on increasing generated traffic. The performance of the designed 6RLR-ABC routing protocol has been evaluated compared to 6LoWPAN Ad-hoc On-Demand Distance Vector (LOAD) routing protocol. LOAD protocol has been chosen since it is the most relevant existed 6LoWPANrouting protocol. The simulation results show that the introduced 6RLR-ABC protocol achieves lower packet average end-to-end delay and lower energy consumption compared to LOAD protocol.Additionally,the packet delivery ratio of the designed protocol is much higher than LOAD protocol. The proposed 6RLR-ABC achieved about 39% higher packet delivery ratio and about 54.8% higher throughput while simultaneously offering lower average end-to-end delay and lower average energy consumption than LOAD protocol.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
EFFECTS OF MAC PARAMETERS ON THE PERFORMANCE OF IEEE 802.11 DCF IN NS-3ijwmn
This paper presents the design procedure of the NS-3 script for WLAN that is organized according to the hierarchical manner of TCP/IP model. We configure all layers by using NS-3 model objects and set and modify the values used by objects to investigate the effects of MAC parameters (access mechanism, CWmin, CWmax and retry limit) on the performance metrics viz. packet delivery ratio, packet lost ratio, aggregated throughput, and average delay. The simulation results show that RTS/CTS access mechanism outperforms basic access mechanism in saturated state, whereas the MAC parameters have no significant impact on network performance in non-saturated state. A higher value of CWmin improves the aggregated throughput in expense of average delay. The tradeoff relationships among the performance metrics are also observed in results for the optimal values of MAC parameters. Our design procedure represents a good guideline for new NS-3 users to design and modify script and results greatly benefit the network design and management.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Computational Engineering Research(IJCER)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.
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.
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.
The Extended Clustering Ad Hoc Routing Protocol (Ecrp)IJCNCJournal
Ad hoc networks are a collection of mobile nodes communicating via wireless channels without any fixed
infrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractive
applications in different fields. The topology of ad hoc networks changes dynamically, and each node in the
network can act as a host or router. With the increase in the number of wireless devices and large amount
of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a
scalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc Routing
Protocol (ECRP). This is a hybrid protocol, which combines reactive and proactive approaches in routing.
The protocol uses the Global Positioning System to determine the position of certain nodes in the network.
The evaluation methodology and simulation results obtained show that the protocol is efficient and scales
well in large networks
ANALYSIS AND STUDY OF MATHEMATICAL MODELS FOR RWA PROBLEM IN OPTICAL NETWORKSIJEEE
Blocking probability has been one of the key performance to solve Routing and Wavelength Assignment problem (RWA) indexes in the design of wavelength-routed all-optical WDM networks. To evaluate blocking probability different analytical model are introduced.
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
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.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Computational Engineering Research(IJCER)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.
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.
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.
The Extended Clustering Ad Hoc Routing Protocol (Ecrp)IJCNCJournal
Ad hoc networks are a collection of mobile nodes communicating via wireless channels without any fixed
infrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractive
applications in different fields. The topology of ad hoc networks changes dynamically, and each node in the
network can act as a host or router. With the increase in the number of wireless devices and large amount
of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a
scalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc Routing
Protocol (ECRP). This is a hybrid protocol, which combines reactive and proactive approaches in routing.
The protocol uses the Global Positioning System to determine the position of certain nodes in the network.
The evaluation methodology and simulation results obtained show that the protocol is efficient and scales
well in large networks
ANALYSIS AND STUDY OF MATHEMATICAL MODELS FOR RWA PROBLEM IN OPTICAL NETWORKSIJEEE
Blocking probability has been one of the key performance to solve Routing and Wavelength Assignment problem (RWA) indexes in the design of wavelength-routed all-optical WDM networks. To evaluate blocking probability different analytical model are introduced.
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
A Mobile Ad-hoc Network (MANET) is a collection of mobile nodes that communicate and collaborate with each other without reliance on any pre-existing infrastructure. In MANETs, wireless links are subject to frequent breakages due to nodes high mobility. While several routing protocols such AODV and DSR have been designed for MANETs, many of operate efficiently under low network mobility conditions and do not adapt well with high mobility conditions. Therefore, considering mobility is a demanding task that should be performed efficiently and accurately. Here, we proposed novel mobility-aware routing protocol based on the well known Ad-hoc On Demand Distance Vector (AODV) routing protocol called: MA-AODV (Mobility Aware Ad-hoc On Demand Distance Vector) in an attempt to improve the handling of high mobility factor in ad-hoc networks. MA-AODV protocols perform periodic quantification of nodes mobility for the sake of establishing more stable paths between source/destination pairs, hence, avoiding the frequent link breakages associated with using unstable paths that contain high mobile nodes.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
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.
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.
My wife, Rosalyn San Antonio, created this powerpoint presentation as a gift to for our 7th Marriage Anniversary. The song is entitled "Forevermore" by the "Side A", a band popular here in the Philippines.
To the owners of the song and/or music that is used, "Copyright Infringement" is not intended, please let us keep the music on our video.
Thanks for the great music.
This course is intended to give an overview of the nature of hash functions, their cryptographic and security properties and time-stamping as a practical usage for hash functions.
The first part of the lecture series gives an overview of what hash functions are. In the second part, we take a look at the cryptographic security requirements for hash functions. The third part of the series deals with the matter of security properties of hash functions.
In the fourth part, we explore hash functions which are provably secure but inefficient and hash functions which can be used practically. The fifth part in the series shows a practical application of hash functions on the example of time-stamping.
In the sixth and seventh part of the lectures, we look at security requirements for hash functions used in time-stamping and ways of proving how specific hash functions meet requirements for hash functions.
Lecturer Ahto Buldas is a professor at Tallinn University of Technology and University of Tartu, specializing in complexity theory, combinatorics, cryptography and data security. He has worked extensively with hash functions and their usage in timestamping and together with Margus Niitsoo in 2010 showed how global scale time-stamping can be used with 256-bit hash functions.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
Abstract: A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc network have the attributes such as wireless connection, continuously changing topology, distributed operation and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive & hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed & battery consumption. It has been observed that RIP has better network lifetime than other.
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.
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.
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
Abstract : As the network size increases the probability of congestion occurrence at nodes increases. This is because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses. In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing (IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput and packet delivery fraction. Keywords- DSDV, Hybrid protocol, AODV, IAODV, MANET
Congestion Control in Manets Using Hybrid Routing ProtocolIOSR Journals
As the network size increases the probability of congestion occurrence at nodes increases. This is
because of the event driven nature of ad hoc networks that leads to unpredictable network load. As a result
congestion may occur at the nodes which receive more data than that can be forwarded and cause packet losses.
In this paper we propose a hybrid scheme that attempts to avoid packet loss due to congestion as well as reduce
end to end delay in delivering data packets by combining two protocols- Destination sequenced distance vector
routing (DSDV), which is a table driven or proactive protocol and Improved Ad-hoc on demand vector routing
(IAODV) which is an on-demand or reactive protocol that reduces packet loss due to congestion. The strategy
adopted is use DSDV for path selection and if congestion occurs than switch over to IAODV. The routing
performance of this model is then compared with IAODV and DSDV in terms of end to end delay, throughput
and packet delivery fraction
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKIJCSIT Journal
There are two methods to improve the performance of routing protocols in wireless mesh networks. One way is to improve the methods used for select the path. Second way is to improve the algorithms to add up the new characteristics of wireless mesh networks. We also propose a new protocol that is used for Multi Interfaces and Multiple Channels (MIMC) named as Hybrid Wireless Mesh Protocol.
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...ijsrd.com
In Mobile Ad hoc network (MANETS), no fixed infrastructure is available. Different wireless hosts are free to move from one location to another without any centralized administration, so, the topology changes rapidly or unpredictably. Every node operates as router as well as an end system. Routing in MANETs has been a challenging task ever since the wireless networks came into existence. The major reason for this is continues changes in network topology because of high degree of node mobility. The MANET routing protocols have mainly two classes: Proactive routing (or table-driven routing) protocols and Reactive routing (or on-demand routing) protocols. In this paper, we have analyzed various Random based mobility models: Random Waypoint model, Random Walk model, Random Direction model and Probabilistic Random Walk model using AODV and DSDV protocols in Network Simulator (NS 2.35). The performance comparison of MANET mobility models have been analyzed by varying number of nodes using traffic TCP. The comparative conclusions are drawn on the basis of various performance metrics such as: Routing Overhead (packets), Packet Delivery Fraction (%), Normalized Routing Load, Average End-to-End Delay (milliseconds) and Packet Loss (%).
Comparative Performance Evaluation of Ad-hoc on Demand Distance Vector Routin...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 study of adhoc routing protocols for cbr trafficeSAT Journals
Abstract Mobile ad hoc network (MANET) is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. A Reactive (on-demand) routing strategy is a popular routing category for wireless adhoc routing. The primary objective of this paper is to do comparative study of the performance of routing protocols Destination-Sequenced Distance-Vector (DSDV), Dynamic Source Routing (DSR) and Ad-hoc on demand Distance Vector (AODV) for wireless ad hoc networks in a simulated environment against varying network parameters. The evaluations are done by means of simulations using NS-2 network simulator. The study was done on the basis of performance metrics: throughput, packet delivery function, end-to-end delay, routing overhead and packet lost. Simulation results show that despite in most simulations reactive routing protocols DSR and AODV performed significantly better than proactive routing protocol DSDV for the CBR based traffic. Keywords- component; Mobile Adhoc Network, Routing protocol, DSR, AODV, DSDV
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.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™UiPathCommunity
In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni.
📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath:
Autopilot per Studio Web
Autopilot per Studio
Autopilot per Apps
Clipboard AI
GenAI applicata alla Document Understanding
👨🏫👨💻 Speakers:
Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant
Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath
Andrei Tasca, RPA Solutions Team Lead @NTT Data
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
By Design, not by Accident - Agile Venture Bolzano 2024
011001010 a
1. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications
(IJERA) www.ijera.com Vol. 1, Issue 1, pp.001-010
A Fuzzy Logic Based Network Dependent Routing Algorithm for
Ad hoc Wireless Networks
Dr. Sohan Garg1, Payal Kansal2, Viksit Kumar Sharma3
( 1Department of Computer Applications, Raj Kumar Goel Institute of Technology,
Delhi-Meerut Road, GZB (U.P.)
2
Department of IT, Lord Krishna College of Engineering Ghaziabad
3
Rajeev Academy for Technology and Management, Mathura (UP) )
Abstract: The development of Mobile Ad Hoc G (v, e), with a set of vertices v and a set of edges e.
network advocates self-organized wireless
Each vertex of the set v represents a network node and
interconnection of communication devices that
would either extend or operate in concert with the each edge of the set e represents a wireless link. The
wired networking infrastructure or, possibly, evolve total number of nodes is n = |v|. This key feature of
to autonomous networks. Unlike traditional wireless
networks, ad hoc networks do not rely on any fixed these networks enable them to be employed in places
infrastructure. Instead, hosts rely on each other to where an infrastructure is not available, such as in
keep the network connected. One main challenge in
disaster and on battle grounds, or we can say that the
design of these networks is their vulnerability to
security attacks. Despite the existence of well-known dynamic nature of these networks and the scarcity of
security mechanisms, additional vulnerabilities and
bandwidth in the wireless medium, along with the
features pertinent to this new networking paradigm
might render such traditional solutions limited power in mobile devices (such as PDA’s and
inapplicable. In particular, the absence of a central laptops) make routing in these networks a challenging
authorization facility in an open and distributed
communication environment is a major challenge, task. The topology of an ad hoc network changes due
especially due to the need for cooperative network to the movement of mobile hosts, which may lead to
operation. In MANET, any node may compromise
sudden packet losses and delays. In the mobile ad hoc
the routing protocol functionality by disrupting the
route discovery process. In this paper, we network due to the high mobility, low signal power and
understand the various routing problems related to
limited bandwidth the wireless links are frequently
bandwidth, signal power, mobility and delay. In this
paper we are proposing a new routing algorithm broken and new links are frequently established. Such
that is totally network dependent and will remove dynamic network topology presents a significant
the all routing problems
challenge for the network routing algorithms. Several
Keywords: Delay, Mobility, Mobile Ad hoc routing algorithms, such as shortest path routing
network, topology algorithm like DBF were proposed for ad hoc wireless
networks. But, these algorithms suffer from very slow
1. Introduction
convergence (the “routing to infinity” problem).
Ad hoc networks are made up of a number of nodes, Besides, DBF-like algorithms incur large update
which are capable of performing routing without using message penalties. Protocols that attempted to cure
a dedicated centralized controller as a base station. Ad some of the shortcomings of DBF, such as Destination-
hoc networks can be represented as a connected graph Sequences Distance Vector routing were proposed.
www.ijera.com 01
2. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
However, synchronization and extra processing the algorithm is simple as well as having low
overhead are common in these protocols. Other communication overhead and storage requirements.
protocols that rely on the information from the The algorithm has been simulated in MATLAB 7.2 in
predecessor of the shortest path solve the slow which we have uses the Fuzzy Logic tool kit.
convergence problem of DBF. However, the
processing requirements of these protocols may be The Fuzzy Logic is an innovative approach to help
quite high, because of the way they process the update control non-repeating or unpredictable systems control
message. Realizations of the path findings algorithms, accuracy. It uses a list of rules rather than complicated
like the wireless routing protocol, are able to eliminate mathematical expression. Fuzzy Logic was introduced
the “counting-to-infinity” problem and reduce the by L.A. Zadeh in 1965. Fuzzy Logic is also known as
occurrence of temporary loops, often with less control fuzzy rule based system and this is a non linear
traffic than traditional distance vector schemes. The mapping technique of input data into output. Fuzzy
main disadvantage of WRP is the fact that routing Logic system is composed of five functional blocks.
nodes constantly maintain full routing information in 2. The Proposed Routing Algorithm
each network node, which was obtained as relatively
high cost in wireless resources. In the Temporary Here Fuzzy Logic has been used for routing and
Ordered Routing Algorithm the resulting route replies management of an ad hoc wireless network. The
are also flooded, in a controlled manner, to distribute proposed fuzzy logic based routing algorithm takes into
routes in the form of directed acyclic graphs (DAGs) account of three input variables, signal power and
rooted at the destination. In contrast, protocols such as mobility and delay. The absolute value of each of these
Dynamic Source Routing and ad hoc on demand parameters can take a large range at different points on
distance vector unicast the route reply back to the the network. We have considered the normalized
querying source, along a path specified by a sequence values for each parameter. Now, ‘crisp’ normalized
of node addresses accumulated during the route query values are being converted into fuzzy variables. For
phase. In the case of DSR, the node addresses are this, three fuzzy sets have been defined for each
accumulated in the query packet and are returned to the variable. The sets, low (from 0 to 0.4), medium (from
source, to be used for source routing. AODV, on the 0.2 to 0.8) and high (from 0.6 to 1.0) have been used
other hand, distributes the discovered route in the form for the input variable signal power (figure 1) and the
of next-hop information stored at each node in the sets, poor (from 0 to 0.4), average (from 0.2 to 0.8) and
route. These algorithms do not satisfy the requirements excellent (from 0.6 to 1.0) have been used for input
of an ad hoc wireless network completely and despite variable delay (figure 2) and the sets, low (from 0 to
their shortcomings, these works lay the foundation for 0.4), medium (from 0.2 to 0.8) and high (from 0.6 to
the development of our protocol. In this paper we 1.0) have been used for the input variable mobility
propose a new routing protocol for ad hoc wireless (figure 3). The normalized value of each parameter is
networks, which address some of the problems with the mapped into the fine sets. Each value will have some
existing approaches. In spite of all these improvements, grade of membership function for each set. The
www.ijera.com 02
3. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
memberships that have been defined for each of the protocol is distributed in nature without relying on
fuzzy set for any particular input variable are triangular centralized authorities.
in shape. Next the rules of inference have been written. 4. Entering/Departing nodes: This protocol is able to
Initially total 27 rules were devised. The crisp value of quickly adapt to entering or departing nodes in the
input variable was given and a defuzzified crisp value network, without having to restructure the entire
for selected variable was calculated from the derived network.
algorithm. An output linguistic variable is used to 5. On Demand operation: Since a uniform traffic
represent the route. Proposed optimal routes are based distribution cannot be assumed within the network, the
upon the fuzzy rules for different ranges of the metric routing algorithm must adapt to the traffic pattern on a
availability. The routes (figure 4) are defined as below demand or need basis, thereby utilizing power and
optimal (from 0 to 0.4), suboptimal (from 0.2 to 0.8) bandwidth resources more efficiently.
and optimal (from 0.6 to 1.0) between two mobile Our problem is to find the optimal and suitable route
hosts. The below optimal indicates not optimal path, from source to the destination based on mobility, signal
the sub optimal indicates good path and the optimal power and delay. The system is based on the fuzzy
path indicates the best path. The proposed routing inference system. The major components of the system
algorithm can apply to different routing metrics. These consist of the knowledge base, decision making,
routes have to satisfy the mobility, signal power and fuzzification and defuzzification. Now we will write
delay requirements of the network. The grade of the fuzzy rules based on the mobility, signal power and
membership function can be any where between 0 and delay and try to find out the optimal path or route.
1 for each fuzzy set. The defuzzified crisp value for
selected variable was calculated from the derived
algorithm. The proposed Fuzzy Logic & bandwidth
based routing algorithm for ad-hoc wireless network is
classified as “A Fuzzy Logic Based Network
Dependent Routing Algorithm for Ad hoc Wireless
Networks”. This algorithm contains the following
characteristics:
1. Freedom from loops: In the proposed algorithm the
paths derived from the routing tables of all nodes have
no loops.
2. Fast Route Convergence: The new routing protocol
provides a new and stable route as soon as possible
Figure 1. Input Variable ‘Signal power’
after a topology change.
3. Distributed Implementation: As we know those ad
hoc networks are autonomous and self-organizing, this
www.ijera.com 03
4. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
The Fuzzy Inference rules for the proposed routing
algorithm are following:
1. If (signal power is low) and (mobility is low) and
(delay is poor) then the route will be below optimal.
2. If (signal power is low) and (mobility is low) and
(delay is average) then the route will be below optimal.
3. If (signal power is low) and (mobility is low) and
(delay is excellent) then the route will be sub optimal.
4. If (signal power is low) and (mobility is medium)
and (delay is poor) then the route will be below
Figure 2. Input Variable ‘Delay’
optimal.
5. If (signal power is low) and (mobility is medium)
and (delay is average) then the route will be sub-
optimal.
6. If (signal power is low) and (mobility is medium)
and (delay is excellent) then the route will be sub
optimal.
7. If (signal power is low) and (mobility is high) and
(delay is poor) then the route will be below optimal.
8. If (signal power is low) and (mobility is high) and
(delay is average) then the route will be below optimal.
Figure 3. Input Variable ‘Mobility’ 9. If (signal power is low) and (mobility is high) and
(delay is excellent) then the route will be sub-optimal.
10. If (signal power is medium) and (mobility is low)
and (delay is poor) then the route will be sub- optimal.
11. If (signal power is medium) and (mobility is low)
and (delay is average) then the route will be optimal.
12. If (signal power is medium) and (mobility is low)
and (delay is excellent) then the route will be optimal.
13. If (signal power is medium) and (mobility is
medium) and (delay is poor) then the route will be
below optimal.
14. If (signal power is medium) and (mobility is
medium) and (delay is average) then the route will be
Figure 4. Output Variable ‘Route’
sub optimal.
www.ijera.com 04
5. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
15. If (signal power is medium) and (mobility is
medium) and (delay is excellent) then the route will be
optimal.
16. If (signal power is medium) and (mobility is high)
and (delay is poor) then the route will be below
optimal.
17. If (signal power is medium) and (mobility is high)
and (delay is average) then the route will be sub
optimal.
18. If (signal power is medium) and (mobility is high)
and (delay is excellent) then the route will be optimal.
19. If (signal power is high) and (mobility is low) and
(delay is poor) then the route will be sub-optimal.
20. If (signal power is high) and (mobility is low) and Figure 5. ‘Route’ O/P w.r.t. ‘Mobility’ and
(delay is average ) then the route will be optimal. ‘Signal Power’
21. If (signal power is high) and (mobility is low) and
(delay is excellent) then the route will be optimal. In figure 5 signal power and mobility are the
22. If (signal power is high) and (mobility is medium) fuzzy input variable for the proposed routing
and (delay is poor) then the route will be sub-optimal. algorithm which lies on the horizontal axes and
23. If (signal power is high) and (mobility is medium) route is the output variable which has been shown
and (delay is average) then the route will be sub- on the vertical axis. It is very clear from the figure
optimal. that at constant signal power and low mobility the
24. If (signal power is high) and (mobility is medium) Route is below optimal, but for any value of the
and (delay is excellent) then the route will be optimal. signal power if we increase the mobility then the
25. If (signal power is high) and (mobility is high) and route also increases and becomes sub-optimal.
(delay is poor) then the route will be below - optimal. Finally at high mobility the route will be below
26. If (signal power is high) and (mobility is high) and optimal for constant signal power.
(delay is average) then the route will be sub-optimal.
27. If (signal power is high) and (mobility is high) and
(delay is excellent) then the route will be optimal.
The routes based upon the above rules have been
shown with the help of the following graphs:
www.ijera.com 05
6. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
poor delay. But as the delay becomes high, route
Figure 6 ‘Route’ O/P w.r.t. ‘Signal Power’ and increases up to sub optimality and optimality when the
‘Delay’ mobility is medium and high respectively.
In figure 6 the inputs of the algorithm (signal power
and delay) are on the horizontal axes and the output
(route) is on the vertical axis. According to the figure It
is clear that at constant delay and low signal power the
route is below optimal but if the signal power is
increased up to medium the route is sub optimal for
poor delay. In the same way at high signal power and
poor delay the route becomes below optimal. If delay is
increased up to average at high signal power then the
route is suboptimal but route becomes optimal at
excellent delay and at high signal power.
Figure 8. ‘Route’ O/P w.r.t. Medium ‘Signal Power’,
Low ‘Mobility’ and Excellent ‘Delay’
The figure 8 illustrates that when signal power is
medium (0.504), mobility is low (0.0812) and delay is
excellent (0.885) then in this condition the route is
optimal (0.861). So this algorithm works well when
mobility is low and signal power is medium.
Figure 7. ‘Route’ O/P w.r.t. ‘Mobility’ and ‘Delay’
In figure 7 delay and mobility are the input variables
and route is the output variable. The 3 D decision
surface illustrate that route is below optimal for poor
delay and low mobility. As the mobility is increased up
to medium the route will be sub optimal. Again the
similar process occurs and route is below optimal for
www.ijera.com 06
7. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
Figure 9. ‘Route’ O/P w.r.t. Medium ‘Signal
Power’, Medium ‘Mobility’ and Excellent ‘Delay’ Figure 10. ‘Route’ O/P w.r.t. Medium ‘ Signal
In figure 9 we have seen that route is optimal at low Power’, Low ‘Mobility’ and Average ‘Delay’
mobility, medium signal power and at excellent delay This is very clear from the figure 10 that in this
but against it when we increase the mobility towards protocol the value of the signal power (0.47) and
medium (0.517) at medium signal power (0.504) and mobility (0.115) is same as in figure 6.8 but the
excellent delay (0.919) the route is again optimal. So difference is that when we will decrease the delay up to
this algorithm works well at medium mobility also. average (0.509) then the route is still optimal, but as we
will increase the mobility then the route will be sub
optimal.
3. Simulation Results
In decision surface (figure 5) the input variables signal
power and mobility lie on horizontal axes and the
www.ijera.com 07
8. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
output variable route lies on vertical axis. It shows that again but as we increase the mobility then route
at constant signal power the route is below optimal for becomes suboptimal.
low mobility. But any signal power if we increase the 4. Conclusions
mobility the route also starts increasing and becomes Due to the unprecedented growth in the scale and
sub optimal. Finally when the mobility becomes high, diversity of mobile computing devices, new
the route will be below optimal for constant signal horizons for wireless connectivity has come into
power. Now as we increase the signal power the route view. In this chapter, we have shown the
starts increasing towards optimality and becomes importance of an ad hoc routing protocol and some
optimal for low and medium mobility. In figure 6 the of the previous works. Following that we have
inputs of the algorithm are on the horizontal axes and proposed our new routing protocol based on
the output of the algorithm is on the vertical axis. Here, mobility, signal power and delay, where the
with the help of 3D surface we observe that at constant segmentation of nodes will substantially reduce the
delay and low signal power the route is below optimal overhead of the entire network and speed up the
but if the signal power is increased up to medium the routing process. After fully describing its functions
route is sub optimal for poor delay. Similarly at high and mechanism, we have suggested various
signal power and poor delay the route becomes below optimizations to the protocol and utilized the
optimal. It can also be observed that with average delay concept of stability index. Finally, we have done
and high signal power the route is suboptimal and if we limited trials to show that our protocol is functional
increase delay up to excellent the route is optimal at and effective; we do see the need in further
high signal power. In figure 7 the input variables experimentation in order to accurately access the
mobility and delay lie at horizontal axes and the route practical effectiveness of our protocol in a medium
at vertical axis. Here, we see that for poor delay and to large size network.
low mobility the route is below optimal. As the
References:
mobility increases and arrive up to medium the route
[1] A. James Freebersyser, B. Leiner, “A DoD
will be sub optimal. Again the similar phenomenon
perspective on mobile ad hoc networks”, in:
occurs and route is below optimal for poor delay. But
Charles E. Perkin (Ed.), Ad hoc Networking,
as the delay becomes high, route increases up to sub
Addison Wesley Reading, May 2001, pp.29-51.
optimality and optimality when mobility is medium
[2] J. Macker and S. Corson, “Mobile Ad hoc
and high respectively. In figure 8 we see that at
Networks (MANET)”, IETF WG
medium signal power (0.504), low mobility (0.0812)
Charter.,http://www.ietf.org/html.charters/manetC
and excellent delay(0.885) the route is optimal (0.86)
arter.html,1997.
and as we increase the only mobility towards
[3] IEEE Computer Society LAN MAN Standards
medium(0.517) then the route is again optimal (0.865)
Committee,”Wireless LAN medium access control
which has been shown in the figure 9. In figure 10,
(MAC) and physical layer (PHY) specifications”,
with medium signal power (0.47), low mobility (0.115)
IEEE Std. 802.11, 1997, pp. 11-97.
and average delay (0.509) the route becomes optimal
www.ijera.com 08
9. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
[4] M.S. Corson, J.P. Maker, J.H. Ernicione “Internet [13] J.J. Garcia Aceves,”Distributed routing algorithm
based mobile ad hoc networking”, IEEE Internet using internidal coordination”, Proc. IEEE
Computing, 3 (4), 1999, pp. 63-70. INFOCOM’, New Orleans, LA, 1998, pp.85-96.
[5] E. M. Royer and C. K. Toh, “A review of current [14] E.M. Gafni and D. P. Bertsekas,” Distributed
routing protocols for ad hoc mobile wireless algorithm for generating loop-free routes in networks
networks”, IEEE Personal Communications Magazine, with frequently changing topology”,
April 1999, pp. 46-55. IEEE Transactions on Communications, Vol. Com-29,
[6]I. Chlamtac and A. Lerner, “Link allocation in mobile no. 1, Jan. 1981
radio networks with noisy channel”, In IEEE , pp. 11-18.
INFOCOM, Bar Harbour. [15] M. S. Corson and A. Ephremides, “A distributed
www.openu.ac.il/Personal_sites/anat-lerner.html, FL, routing algorithm for mobile wireless networks”, ACM
April 1986. Journal for Wireless Networks, Feb. 1995, pp. 61-81.
[7] I. Chlamtac and A. Lerner, “Fair algorithms for [16] C.E. Perkins and P. Bhagwat, “Highly dynamic
maximal link activiation in multi-hop radio networks”, destination sequenced distance –vector routing (DSDV)
IEEE Transactions on Communications COM-3, Issue- for mobile computers,” ACM SIGCOMM, Vol.24, no.4,
7, Vol. 35, 1987, pp. 739-746. Oct.1994, pp. 234-244.
[8] A. Adya, P. Bahl, J. Padhye, A. Wolman, and L. Zhou. [17] S. Murthy and J.J. Garcia-Luna-Aceves, “An efficient
“A Multi –radio unification protocol for IEEE routing protocol for wireless networks,” ACM Mobile
802.11 wireless networks”. In IEEE International Networks and App. J., Special issue on Routing in
conference on broadband networks, (BroadNets), 2004. Mobile communication Networks, Oct. 1996, pp. 183-
[9] C. Siva Ram Murthy and B.S. Manoj, “Ad hoc 187.
Wireless Networks Architecture and Protocols”, [18] J.M. McQuillan, I. Richer, E. Rosen, “The new routing
Prentice Hall, 2004. algorithm for ARPANET”, IEEE Transaction of
[10] M.S. Corson, S. Batsel and J. Macker, “Architecture Communication Vol. 28, Issue May 1980, pp. 711-719.
consideration for mobile mesh networking”, [19] D.B. Johnson, D. A. Maltz and Y.C. Hu., “ The
Conference Proceeding, IEEE, Vol.1 21-24 Oct. 1996, dynamic source routing protocol for mobile ad hoc
pp. 225-229. networks (DSR),” IETF Mobile Ad hoc Networks
[11] P. Merlin and A. Segall, “A fail safe distributed routing Working Group, Internet Draft, 16 Apr. 2003.
protocol”, IEEE Transactions on Communications, [20] C. Bettstetter and C. Wagner. (March 2002), The
COM-27 (9), Sep. 1979, pp. 1280-1287. Spatial Node Distribution of the RandomWaypoint
[12] J.M. Jaffe and P.H. Moss, “A responsive distributed Mobility Model. In Proceedings of the German
routing algorithm for computer networks”, IEEE Workshop on Mobile Ad hoc Networks (WMAN),
Transactions on Communications, COM-30 (7): July pages 41–58, Ulm, Germany.
1982, pp. 1758-1762. [21]C. Bettstetter, (2001), “Mobility modeling in wireless
networks: Categorization, smooth movement, and
www.ijera.com 09
10. Dr. Sohan Garg et al. / International Journal of Engineering Research and Applications (IJERA)
www.ijera.com Vol. 1, Issue 1, pp.001-010
border effects,” ACM Mob. Comput. Commun. Rev., wireless networks,” in Proc. 4th ACM Int. Workshop
vol. 5, no. 3, pp. 55–66. on Modeling Analysis and Simulation of Wireless and
[22] C. Bettstetter, (Sept. 2001),“Smooth is better than Mobile Systems (MSWiM), Rome, pp. 19–27
sharp: a random mobility model for simulation of
www.ijera.com 010