This paper presents a routing performance analysis of structured P2P overlay network. Due to the rapid development and hectic life, sharing data wirelessly is essential. P2P allows participating peers move freely by joining and leaving the network at any convenience time. Therefore, it exists constraint when one measuring the network performance. Moreover, the design of structured overlay networks is fragmented and with various design. P2P networks need to have a reliable routing protocol. In order to analyse the routing performance, this work simulates three structured overlay protocols-Chord, Pastry and Kademlia using OMNeT++ with INET and OverSim module. The result shows that Pastry is the best among others with 100% routing efficiency. However, Kademlia leads with 12.76% and 18.78% better than Chord and Pastry in lookup hop count and lookup success latency respectively. Hence, Pastry and Kamelia architectures will have a better choice for implementing structured overlay P2P network.
Ad Hoc Networks are infrastructure less network in which nodes are connected by Multi-hop wireless links. Each node is acting as a router as it supports distributed routing. Routing challenges occurs as there are frequent path breaks due to the mobility. Various application domains include military applications, emergency search and rescue operations and collaborative computing. The existing protocols used are divided into proactive and on demand routing protocols. The various new routing algorithms are also designed to optimize the performance of a network in terms of various performance parameters. Dual reinforcement routing is learning based approach used for routing. This paper describes the implementation, mathematical evaluation and judging the performance of a network and analyze it to find the performance of a network.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...Saurabh Mishra
This document compares the performance of three routing protocols - DSDV, AODV, and DSR - for mobile ad hoc networks by simulating networks of varying sizes using the Qualnet simulator. The main findings are that AODV performed most efficiently for network sizes of 30, 40, and 50 nodes, and that performance decreased for all three protocols as the number of nodes increased. For a network of 50 nodes, the three protocols exhibited different performance levels at different node counts.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
On the routing overhead in infrastructureless multihop wireless networksNarendra Singh Yadav
Routing in infrastructureless multihop wireless networks is a challenging task and has received a vast amount of attention from researchers. This has lead to development of many different routing protocols each having their own superiorities and pitfalls making it very difficult to decide on a better protocol under vulnerable scenarios in such networks. In this paper the performance of three routing protocols (DSR, AODV and CBRP) in terms of routing overhead in bytes and in packets is presented under growing density and varying mobility in different traffic conditions. The simulation results show that CBRP outperforms both DSR and AODV in all scenarios.
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.
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
Ad Hoc Networks are infrastructure less network in which nodes are connected by Multi-hop wireless links. Each node is acting as a router as it supports distributed routing. Routing challenges occurs as there are frequent path breaks due to the mobility. Various application domains include military applications, emergency search and rescue operations and collaborative computing. The existing protocols used are divided into proactive and on demand routing protocols. The various new routing algorithms are also designed to optimize the performance of a network in terms of various performance parameters. Dual reinforcement routing is learning based approach used for routing. This paper describes the implementation, mathematical evaluation and judging the performance of a network and analyze it to find the performance of a network.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...Saurabh Mishra
This document compares the performance of three routing protocols - DSDV, AODV, and DSR - for mobile ad hoc networks by simulating networks of varying sizes using the Qualnet simulator. The main findings are that AODV performed most efficiently for network sizes of 30, 40, and 50 nodes, and that performance decreased for all three protocols as the number of nodes increased. For a network of 50 nodes, the three protocols exhibited different performance levels at different node counts.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
On the routing overhead in infrastructureless multihop wireless networksNarendra Singh Yadav
Routing in infrastructureless multihop wireless networks is a challenging task and has received a vast amount of attention from researchers. This has lead to development of many different routing protocols each having their own superiorities and pitfalls making it very difficult to decide on a better protocol under vulnerable scenarios in such networks. In this paper the performance of three routing protocols (DSR, AODV and CBRP) in terms of routing overhead in bytes and in packets is presented under growing density and varying mobility in different traffic conditions. The simulation results show that CBRP outperforms both DSR and AODV in all scenarios.
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.
IMPROVED NETWORK CONNECTIVITY IN MANETSIJCNCJournal
The growth in wireless communication technologies has resulted in a considerable amount of
attention given to mobile adhoc networks. All mobile hosts in an adhoc network are embedded with
packet forwarding capabilities. It is decentralized and is independent of infrastructure. Since mobile
hosts in an adhoc network usually move freely, the topology of the network changes dynamically and
disconnection occurs frequently. These characteristics require the routing protocols to find an
alternative path towards the destination for data transfer. The existing on-demand routing protocols
does the alternative path establishment only after the disconnection of links in the existing path. The
data sent by the source during alternate path establishment period will be lost leading to incomplete
data transfer. The network traffic will therefore increase considerably. This problem can be overcome
by establishing an alternative path when the existing path is more likely to be broken, by sending a
warning message to the source indicating the likelihood of disconnection. In this paper an attempt has
been made to analyze a protocol that improves the network connectivity by preempting the alternative
path before the existing link gets failed by monitoring the signal strength and ‘age of the path’.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
This document compares the performance of four routing protocols (AODV, DSR, OLSR, GRP) under the security attack of node misbehavior in mobile ad hoc networks (MANETs). The document presents background information on MANETs and the four routing protocols. It then discusses two types of misbehaving nodes (partially selfish and fully selfish) that are modeled in simulations. The simulations vary the percentage of misbehaving nodes and measure performance metrics like packet delivery ratio, end-to-end delay, data dropped, and load. The results show that packet delivery ratio decreases and data dropped increases as the percentage of misbehaving nodes increases for all protocols. OLSR generally has the lowest delay while
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
Performance analysis of routing protocols and tcp variants under http and ftp...IJCNCJournal
MANET stands for mobile ad-hoc network that has multi-hop and dynamic nature, where each station changes its location frequently and automatically configures itself. In this paper, four routing protocols
that areOLSR,GRP,DSR, and AODV are discussed along with three TCP variants that are SACK, New Reno and Reno. The main focus of this paper is to study the impact
scalability, mobility and traffic loads on routing protocols and TCP variants. Thepaper results shows that the proactive protocols OLSR and GRP outperform the reactive protocols AODV and DSR with the same nodes size, nodes speed, and traffic load. On the other hand, the TCP variants research reveal the superiority of the TCP SACK variant over the other two variants in case of adapting to varying network size, while the TCP Reno variant acts more
robustly in varying mobility speeds and traffic loads.
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
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.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node mobility.
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETijasuc
This document summarizes and compares two extended versions of the AODV routing protocol for mobile ad hoc networks (MANETs): Reverse AODV (RAODV) and Multicast AODV (MAODV). RAODV aims to improve routing performance by allowing multiple route reply messages, while MAODV allows nodes to send multicast data packets through a multicast group tree. The document outlines the key features and operations of each protocol, including route discovery processes. It then evaluates and compares the performance of RAODV and MAODV using metrics like end-to-end delay and overhead while varying the number of nodes.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
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.
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...ijasuc
This document analyzes the performance of two reactive MANET routing protocols, DSR and DSDV, under TCP Vegas and TCP Newreno variants through simulations. The simulations measured packet delivery ratio, average end-to-end delay, and total packets dropped. The results showed that DSDV generally had a higher packet delivery ratio but also higher end-to-end delay and more packet drops compared to DSR. DSR performed better in terms of delay and drops due to its on-demand route discovery, while DSDV maintained more consistent routes leading to better packet delivery.
Shortest Tree Routing With Security In Wireless Sensor NetworksIJERA Editor
We propose STR to resolve the main reasons of overall network performance degradation of ZTR, which are the detour path problem and the traffic concentration problem. Second, we prove that the 1-hop neighbor nodes used by STR improve the routing path efficiency and alleviate the traffic load concentrated on tree links in ZTR. Third, we analyze the performance of ZTR, STR, and AODV by differentiating the network conditions such as network density, ZigBee network constraints, traffic types, and the network traffic. For modification security purpose we are also encrypting the data packets during transmission. So that the intermediate nodes are not able to view the data during transmission. For Encryption process, we are using RC4 Algorithm. Short cut tree routing is used for minimizing the routing path from source to destination.
Gateway Forwarding Schemes For Manet-Internet Connectivityijsrd.com
In the real world one of the most important challenge for the broad implementation of mobile ad hoc network (MANET) technology is the finding way to capably interconnect them with the Internet. Yet, such interconnections are very difficult due to differences in mobility, addressing and routing between MANETs and reside IP networks. Imprecise address and routing techniques are hard to integrate. In this paper we propose the half tunnels as a powerful transition technique to integrate various networks. In this paper, we will also discuss some existing solutions like default routes host route etc to interconnect MANETs with the Internet, but on analysis we find them lacking in robustness and flexibility. For example, many solutions do not consider the presence of multiple gateways, and in such scenarios they either fail, or are less efficient due to the lack of multi-homing capabilities.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
This document summarizes a research paper that evaluates the performance of two routing protocols (AODV and DSDV) under different traffic patterns (TCP and CBR) in a mobile ad hoc network (MANET) simulation. The paper describes MANET characteristics and challenges for routing. It provides an overview of reactive (AODV), proactive (DSDV), and hybrid routing protocols. It also defines TCP and CBR traffic patterns. The research aims to analyze and compare the packet delivery ratio and end-to-end delay of AODV and DSDV under different traffic loads using the NS-2 simulator. Preliminary results show that reactive protocols perform better in terms of these metrics.
Multi-path TCP (MP-TCP) has the prospective to
significantly advance applications performance by using multiple
paths evidently. Multipath TCP was intended and employed as a
backward compatible replacement for TCP. For this reason, it
exposes the standard socket API to the applications that cannot
control the utilization of the different paths. This is a key feature
for applications that are unaware of the multipath nature of the
network. On the contrary, this is a limitation for applications
that could benefit from specific knowledge to use multiple paths
in a way that fits their needs. Therefore, hosts are often
connected by multiple paths, but TCP restricts communications
to a single path per transport connection. Resource usage within
the network would be more efficient where these multiple paths
able to be used concurrently. This should enhance user
experience through improved resilience to network failure and
higher throughput. In this paper, we have focused on MPTCP
and discussed the performance issues and its solution. We believe
our concept will be useful for future works of MPTCP
performance evaluation.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
This document proposes a new fuzzy logic-based routing protocol for mobile ad-hoc networks (MANETs) that considers path stability, residual energy of nodes, and bandwidth for optimal path selection at the source node. It also proposes adjusting the transmission rate at the source node based on end-to-end delay and packet loss ratio measured at the destination node. This cross-layer approach uses two fuzzy logic systems - one for path selection based on stability and bandwidth, and another for transmission rate adjustment based on delay and packet loss. The goal is to select stable paths and prevent congestion for more efficient data transmission in MANETs.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
Multimedia Streaming in Wireless Ad Hoc Networks According to Fuzzy Cross-lay...Editor IJCATR
1) The document describes a fuzzy logic-based routing protocol for multimedia streaming in wireless ad hoc networks. It aims to select optimal routes taking into account factors like node mobility, available bandwidth, and battery energy levels.
2) The protocol uses fuzzy logic rules and membership functions to calculate a "stability rate" for network links based on their characteristics. This is used to select routes with minimum mobility and maximum bandwidth and energy.
3) Simulation results using the OPNET simulator show that the proposed fuzzy logic approach has fewer lost data packets compared to the standard AODV routing protocol, especially over time, indicating it selects more reliable routes for multimedia streaming in mobile ad hoc networks.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Quality of Service Routing in Mobile Ad hoc Networks Using Node Mobility and ...IJNSA Journal
Exceptionally dynamic networks are Mobile Ad hoc Networks. Quality of Service (QoS) routing in such
Networks are frequently limited by the network split due to either energy depletion or node mobility of the
mobile nodes. In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths
becomes essential. Such paths assist in the optimal traffic distribution and consistency in case of path
breakages. Thus, to accommodate such problem, we present a node-disjoint multipath protocol. The metric
system of measurement used to select the paths takes into account the stability of the nodes and the
equivalent links.
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
This document compares the performance of four routing protocols (AODV, DSR, OLSR, GRP) under the security attack of node misbehavior in mobile ad hoc networks (MANETs). The document presents background information on MANETs and the four routing protocols. It then discusses two types of misbehaving nodes (partially selfish and fully selfish) that are modeled in simulations. The simulations vary the percentage of misbehaving nodes and measure performance metrics like packet delivery ratio, end-to-end delay, data dropped, and load. The results show that packet delivery ratio decreases and data dropped increases as the percentage of misbehaving nodes increases for all protocols. OLSR generally has the lowest delay while
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
Performance analysis of routing protocols and tcp variants under http and ftp...IJCNCJournal
MANET stands for mobile ad-hoc network that has multi-hop and dynamic nature, where each station changes its location frequently and automatically configures itself. In this paper, four routing protocols
that areOLSR,GRP,DSR, and AODV are discussed along with three TCP variants that are SACK, New Reno and Reno. The main focus of this paper is to study the impact
scalability, mobility and traffic loads on routing protocols and TCP variants. Thepaper results shows that the proactive protocols OLSR and GRP outperform the reactive protocols AODV and DSR with the same nodes size, nodes speed, and traffic load. On the other hand, the TCP variants research reveal the superiority of the TCP SACK variant over the other two variants in case of adapting to varying network size, while the TCP Reno variant acts more
robustly in varying mobility speeds and traffic loads.
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
The major objective of our work is to explore a security enhanced dynamic routing algorithm based on distributed routing information widely supported in existing wired and wireless networks. The message authentication is the main area to be considered in WSN’s. Most of the wireless networks are attacked for detecting the data’s that are transmitted in between the users. We aim at the randomization of delivery paths for data transmission to provide considerably small path similarity (i.e., the number of common links between two delivery paths) of two consecutive transmitted packets. The proposed algorithm should be easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP) for wired networks and Destination-Sequenced Distance Vector (DSDV) protocol for wireless networks over existing infrastructures. These protocols shall not increase the number of control messages if the proposed algorithm is adopted. An analytic study will be presented for the proposed routing algorithm, and a series of simulation study will be conducted to verify the analytic results and to show the capability of the proposed algorithm.
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.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
The document summarizes an Efficient Position-Based Opportunistic Routing (EPOR) protocol proposed for mobile ad hoc networks. EPOR takes advantage of geographic routing and the broadcast nature of wireless transmissions. When a packet is transmitted, overhearing nodes can act as forwarding candidates. The best forwarder is chosen, but if it fails to forward in time, a suboptimal candidate will forward instead to avoid transmission interruptions. Simulation results show EPOR achieves higher packet delivery ratios and lower end-to-end delays than GPSR and AOMDV routing protocols, even under high node mobility.
PERFORMANCE EVALUATION ON EXTENDED ROUTING PROTOCOL OF AODV IN MANETijasuc
This document summarizes and compares two extended versions of the AODV routing protocol for mobile ad hoc networks (MANETs): Reverse AODV (RAODV) and Multicast AODV (MAODV). RAODV aims to improve routing performance by allowing multiple route reply messages, while MAODV allows nodes to send multicast data packets through a multicast group tree. The document outlines the key features and operations of each protocol, including route discovery processes. It then evaluates and compares the performance of RAODV and MAODV using metrics like end-to-end delay and overhead while varying the number of nodes.
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
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.
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...ijasuc
This document analyzes the performance of two reactive MANET routing protocols, DSR and DSDV, under TCP Vegas and TCP Newreno variants through simulations. The simulations measured packet delivery ratio, average end-to-end delay, and total packets dropped. The results showed that DSDV generally had a higher packet delivery ratio but also higher end-to-end delay and more packet drops compared to DSR. DSR performed better in terms of delay and drops due to its on-demand route discovery, while DSDV maintained more consistent routes leading to better packet delivery.
Shortest Tree Routing With Security In Wireless Sensor NetworksIJERA Editor
We propose STR to resolve the main reasons of overall network performance degradation of ZTR, which are the detour path problem and the traffic concentration problem. Second, we prove that the 1-hop neighbor nodes used by STR improve the routing path efficiency and alleviate the traffic load concentrated on tree links in ZTR. Third, we analyze the performance of ZTR, STR, and AODV by differentiating the network conditions such as network density, ZigBee network constraints, traffic types, and the network traffic. For modification security purpose we are also encrypting the data packets during transmission. So that the intermediate nodes are not able to view the data during transmission. For Encryption process, we are using RC4 Algorithm. Short cut tree routing is used for minimizing the routing path from source to destination.
Gateway Forwarding Schemes For Manet-Internet Connectivityijsrd.com
In the real world one of the most important challenge for the broad implementation of mobile ad hoc network (MANET) technology is the finding way to capably interconnect them with the Internet. Yet, such interconnections are very difficult due to differences in mobility, addressing and routing between MANETs and reside IP networks. Imprecise address and routing techniques are hard to integrate. In this paper we propose the half tunnels as a powerful transition technique to integrate various networks. In this paper, we will also discuss some existing solutions like default routes host route etc to interconnect MANETs with the Internet, but on analysis we find them lacking in robustness and flexibility. For example, many solutions do not consider the presence of multiple gateways, and in such scenarios they either fail, or are less efficient due to the lack of multi-homing capabilities.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
This document summarizes a research paper that evaluates the performance of two routing protocols (AODV and DSDV) under different traffic patterns (TCP and CBR) in a mobile ad hoc network (MANET) simulation. The paper describes MANET characteristics and challenges for routing. It provides an overview of reactive (AODV), proactive (DSDV), and hybrid routing protocols. It also defines TCP and CBR traffic patterns. The research aims to analyze and compare the packet delivery ratio and end-to-end delay of AODV and DSDV under different traffic loads using the NS-2 simulator. Preliminary results show that reactive protocols perform better in terms of these metrics.
Multi-path TCP (MP-TCP) has the prospective to
significantly advance applications performance by using multiple
paths evidently. Multipath TCP was intended and employed as a
backward compatible replacement for TCP. For this reason, it
exposes the standard socket API to the applications that cannot
control the utilization of the different paths. This is a key feature
for applications that are unaware of the multipath nature of the
network. On the contrary, this is a limitation for applications
that could benefit from specific knowledge to use multiple paths
in a way that fits their needs. Therefore, hosts are often
connected by multiple paths, but TCP restricts communications
to a single path per transport connection. Resource usage within
the network would be more efficient where these multiple paths
able to be used concurrently. This should enhance user
experience through improved resilience to network failure and
higher throughput. In this paper, we have focused on MPTCP
and discussed the performance issues and its solution. We believe
our concept will be useful for future works of MPTCP
performance evaluation.
MDSR to Reduce Link Breakage Routing Overhead in MANET Using PRMIOSR Journals
This document proposes a modification to the Dynamic Source Routing (DSR) protocol called Modified DSR (MDSR) to reduce routing overhead caused by frequent link breakages in mobile ad hoc networks. MDSR adds a link breakage prediction algorithm that uses signal strength measurements to predict when a link may break. Intermediate nodes monitor signal strength and warn the source node if a link may soon break. This allows the source to proactively rebuild the route or switch to a backup route to avoid disconnection. Simulation results showed MDSR can reduce the number of dropped packets by at least 25% compared to standard DSR. The document also discusses how DSR works and the proposed proactive route maintenance concept in M
This document proposes a new fuzzy logic-based routing protocol for mobile ad-hoc networks (MANETs) that considers path stability, residual energy of nodes, and bandwidth for optimal path selection at the source node. It also proposes adjusting the transmission rate at the source node based on end-to-end delay and packet loss ratio measured at the destination node. This cross-layer approach uses two fuzzy logic systems - one for path selection based on stability and bandwidth, and another for transmission rate adjustment based on delay and packet loss. The goal is to select stable paths and prevent congestion for more efficient data transmission in MANETs.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
Multimedia Streaming in Wireless Ad Hoc Networks According to Fuzzy Cross-lay...Editor IJCATR
1) The document describes a fuzzy logic-based routing protocol for multimedia streaming in wireless ad hoc networks. It aims to select optimal routes taking into account factors like node mobility, available bandwidth, and battery energy levels.
2) The protocol uses fuzzy logic rules and membership functions to calculate a "stability rate" for network links based on their characteristics. This is used to select routes with minimum mobility and maximum bandwidth and energy.
3) Simulation results using the OPNET simulator show that the proposed fuzzy logic approach has fewer lost data packets compared to the standard AODV routing protocol, especially over time, indicating it selects more reliable routes for multimedia streaming in mobile ad hoc networks.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Performance Evaluation of Routing Protocols in University Networkijtsrd
In an enterprise network, multiple dynamic routing protocols are used for forwarding packets with the best routes. Therefore, performance of the network is based on routing protocols and the route redistribution is an important issue in an enterprise network that has been configured by multiple different routing protocols in its routers. So, aim of the system is to analyze the performance and comparison of different Interior Gateway routing protocols. Routing is depended on many parameters critical such as network convergence time, Ethernet delay, throughput, end to end delay, jitter, packet delivery, security and bandwidth, etc. In this paper, the analysis of characteristics and the performance of the different routing protocols as Routing Information Protocol RIP , Open Shortest Path First OSPF and Enhanced Interior Gateway Routing Protocol EIGRP are evaluated in a university network. The performance evaluation are based on end to end packet delay, network convergence time, packet delay variation and administrative distance, etc. The analysis focuses on the performance of the routing protocols with its routing table in a simulator. The Simulation software can be used to evaluate and compare the performance of the routing protocols. The simulator return the routing table for each node or router in the university network which would contain the best path to reach the remote destination on the metric chosen based on the routing protocol implemented. The simulation software give results used to evaluate the performance of routing protocols, the performance of different routing protocols will be compared, and to analyze the convergence time and administrative distance of routing protocols. Kyaw Zay Oo "Performance Evaluation of Routing Protocols in University Network" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26582.pdfPaper URL: https://www.ijtsrd.com/engineering/information-technology/26582/performance-evaluation-of-routing-protocols-in-university-network/kyaw-zay-oo
Peer to Peer Approach based Replica and Locality Awareness to Manage and Diss...IJCNCJournal
Distributed Hash Table (DHT) based structured peer-to-peer (P2P) systems provide an efficient method of disseminating information in a VANET environment owing to its high performance and properties (e.g., self-organization, decentralization, scalability, etc.). The topology of ad hoc vehicle networks (VANET) varies dynamically; its disconnections are frequent due to the high movement of vehicles. In such a topology, information availability is an ultimate problem for vehicles, in general, connect and disconnect frequently from the network. Data replication is an appropriate and adequate solution to this problem. In this contribution, to increase the accessibility of data, which also increases the success rate of the lookup, a method based on replication in the Vanet network is proposed named LAaR-Vanet. Also, this replication strategy is combined with a locality-awareness method to promote the same purpose and to avoid the problems of long paths. The performance of the proposed solution is assessed by a series of in-depth simulations in urban areas. The obtained results indicate the efficiency of the proposed approach, in terms of the following metrics: lookup success rate, the delay, and the number of the logical hop.
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.
The document describes a study that used simulation to compare the performance of the RIPv2 and EIGRP routing protocols. Specifically, it simulated the time it takes a protocol data unit (PDU) packet to travel from a source to destination under each protocol. The simulation found that for the given network topology and scenarios tested, PDU packets traveled faster on average when using RIPv2 compared to EIGRP.
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.
Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSNpaperpublications3
Abstract: For Hybrid wireless network there is need of efficient data routing protocol for improvement of network capability and scalability. By using Distributed Three Hop routing protocol (DTR), we improve capacity of Hybrid network and Reduce overhead. In early Two- Hop Transmission protocol is used for eliminate route maintenance and limited number of hop in routing for Hybrid Wireless Network but it only considers the node transmission within a single cell while DTR can Also deals with Inter-cell communication in real word. DTR is Top-quality from Other routing Protocol to analyses the hybrid wireless networks with the parametric quantity such as throughput, QoS, packet loss, overhead (due to traffic), channel quality, load balancing, routing delivery, scalability and power consumption. DTR also has a congestion control algorithm to avoid load congestion in base station in the case of unbalanced traffic distributions in networks. DTR makes significantly lower overhead by eliminating route monitoring and maintenance. To enhance the efficiency of routing protocol in wireless network Weight Based Data Assignment technique is used for data allocation in distributed routing protocol using the technique of least delay detection to maintain less data congestion in the network . for that DTR divides a message data stream into segments and transmits the segments in a distributed manner.
Keywords: Data Fragmentation, Responses Delay, Hybrid Wireless Network, Three of Routing Protocol, Fuzzy Logic.
Title: Distributed Three Hop Routing Protocol for Enhancing Routing Process in WSN
Author: Amruta A. Mandhare, Kashmira J. Mayekar, Sayali L. Khanekar, Sarika V.Bodake, Sayali S. Bale.
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
In the last decade Peer to Peer technology has been thoroughly explored, becauseit overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
In this paper we present algorithms for the construction and the maintenance of a hybrid P2P overlay multicast tree based on topological distances. The essential idea of these algorithms is to build a multicast tree by choosing neighbours close to each other. The topological distances can be easily obtained by the browser using the geolocation API. Thus the implementation of algorithms can be done web-based in a distributed manner.
We present proofs of our algorithms as well as experimental results and evaluations.
The Hybrid AODV routing protocol for path establishment in MANETIRJET Journal
This document proposes a hybrid routing protocol for path establishment in mobile ad hoc networks (MANETs) that combines the Ad Hoc On-Demand Distance Vector (AODV) routing protocol with bio-inspired optimization techniques. The performance of AODV is improved by applying ant colony optimization and bee colony optimization techniques to establish paths from source to destination nodes. The proposed approach then applies cuckoo search algorithm to further optimize path establishment. Simulation results show that the hybrid protocol has lower delay, lower packet loss, and higher throughput compared to basic AODV and an improved version of AODV.
Analyse the performance of mobile peer to Peer network using ant colony optim...IJCI JOURNAL
The document describes analyzing the performance of a mobile peer-to-peer network using ant colony optimization. It proposes using a distributed spanning tree (DST) structure to improve efficiency by reducing the large number of messages. The DST is optimized using ant colony optimization to give an optimal solution. Simulation results show the approach reduces the number of messages, average delay, and increases packet delivery ratio in the network.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Ad Hoc Networks are infrastructure less network in which nodes are connected by Multi-hop wireless links. Each node is acting as a router as it supports distributed routing. Routing challenges occurs as there are frequent path breaks due to the mobility. Various application domains include military applications, emergency search and rescue operations and collaborative computing. The existing protocols used are divided into proactive and on demand routing protocols. The various new routing algorithms are also designed to optimize the performance of a network in terms of various performance parameters. Dual reinforcement routing is learning based approach used for routing. This paper describes the implementation, mathematical evaluation and judging the performance of a network and analyze it to find the performance of a network.
Throughput Maximization using Spatial Reusability in Multi Hop Wireless Networkijtsrd
Energy is a valuable resource in wireless networks. For many multi hop networking scenarios, nodes require power for performing their operation, so requiring capable power management to make certain connectivity across the network. Though when wireless networks are attached outside power source due to obstruction between lively links the network may demand excessive energy per unit time Power due to this the overall performance is reduced. Since network life time or network capacity is depend on the power efficiency, many efforts to study energy efficient networks in the wireless network community. In multi hop wireless networks well organized routing algorithms are significant for network performance. We dispute that by carefully considering spatial reusability of the wireless communication media, we can reduce the overhead in multi hop wireless networks. To support our argument, propose Broadcast Tree Construction BTC and compare them with existing routing and multi path routing protocols, respectively. Our estimate outcome shows that proposed protocols significantly improve the end to end throughput compared with existing protocols. We also introduce the sleep scheduling approach for energy consumption and hybrid cryptography for security of data that can be prevent the data leakage and jammer attacks. Twinkal P. Dudhagawali | Prof. L. K. Gautam | Prof. V. P. Vaidya ""Throughput Maximization using Spatial Reusability in Multi Hop Wireless Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-3 , April 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23489.pdf
Paper URL: https://www.ijtsrd.com/engineering/information-technology/23489/throughput-maximization-using-spatial-reusability-in-multi-hop-wireless-network/twinkal-p-dudhagawali
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
- The document discusses developing quality of service (QoS) in Internet of Things (IoT) networks by using priority routing for real-time data.
- It proposes a novel solution that integrates mobile ad hoc networks (MANETs) to improve delivery of high priority real-time application data over low latency MANET paths.
- Experimental results showed the proposed approach was effective in reducing network overhead and congestion, while also improving routing protocol performance in terms of packet delay and throughput.
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTS ijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTSijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally.
Similar to Routing performance of structured overlay in Distributed Hash Tables (DHT) for P2P (20)
Square transposition: an approach to the transposition process in block cipherjournalBEEI
The transposition process is needed in cryptography to create a diffusion effect on data encryption standard (DES) and advanced encryption standard (AES) algorithms as standard information security algorithms by the National Institute of Standards and Technology. The problem with DES and AES algorithms is that their transposition index values form patterns and do not form random values. This condition will certainly make it easier for a cryptanalyst to look for a relationship between ciphertexts because some processes are predictable. This research designs a transposition algorithm called square transposition. Each process uses square 8 × 8 as a place to insert and retrieve 64-bits. The determination of the pairing of the input scheme and the retrieval scheme that have unequal flow is an important factor in producing a good transposition. The square transposition can generate random and non-pattern indices so that transposition can be done better than DES and AES.
Hyper-parameter optimization of convolutional neural network based on particl...journalBEEI
The document proposes using a particle swarm optimization (PSO) algorithm to optimize the hyperparameters of a convolutional neural network (CNN) for image classification. The PSO algorithm is used to find optimal values for CNN hyperparameters like the number and size of convolutional filters. In experiments on the MNIST handwritten digit dataset, the optimized CNN achieved a testing error rate of 0.87%, which is competitive with state-of-the-art models. The proposed approach finds optimized CNN architectures automatically without requiring manual design or encoding strategies during training.
Supervised machine learning based liver disease prediction approach with LASS...journalBEEI
In this contemporary era, the uses of machine learning techniques are increasing rapidly in the field of medical science for detecting various diseases such as liver disease (LD). Around the globe, a large number of people die because of this deadly disease. By diagnosing the disease in a primary stage, early treatment can be helpful to cure the patient. In this research paper, a method is proposed to diagnose the LD using supervised machine learning classification algorithms, namely logistic regression, decision tree, random forest, AdaBoost, KNN, linear discriminant analysis, gradient boosting and support vector machine (SVM). We also deployed a least absolute shrinkage and selection operator (LASSO) feature selection technique on our taken dataset to suggest the most highly correlated attributes of LD. The predictions with 10 fold cross-validation (CV) made by the algorithms are tested in terms of accuracy, sensitivity, precision and f1-score values to forecast the disease. It is observed that the decision tree algorithm has the best performance score where accuracy, precision, sensitivity and f1-score values are 94.295%, 92%, 99% and 96% respectively with the inclusion of LASSO. Furthermore, a comparison with recent studies is shown to prove the significance of the proposed system.
A secure and energy saving protocol for wireless sensor networksjournalBEEI
The research domain for wireless sensor networks (WSN) has been extensively conducted due to innovative technologies and research directions that have come up addressing the usability of WSN under various schemes. This domain permits dependable tracking of a diversity of environments for both military and civil applications. The key management mechanism is a primary protocol for keeping the privacy and confidentiality of the data transmitted among different sensor nodes in WSNs. Since node's size is small; they are intrinsically limited by inadequate resources such as battery life-time and memory capacity. The proposed secure and energy saving protocol (SESP) for wireless sensor networks) has a significant impact on the overall network life-time and energy dissipation. To encrypt sent messsages, the SESP uses the public-key cryptography’s concept. It depends on sensor nodes' identities (IDs) to prevent the messages repeated; making security goals- authentication, confidentiality, integrity, availability, and freshness to be achieved. Finally, simulation results show that the proposed approach produced better energy consumption and network life-time compared to LEACH protocol; sensors are dead after 900 rounds in the proposed SESP protocol. While, in the low-energy adaptive clustering hierarchy (LEACH) scheme, the sensors are dead after 750 rounds.
Plant leaf identification system using convolutional neural networkjournalBEEI
This paper proposes a leaf identification system using convolutional neural network (CNN). This proposed system can identify five types of local Malaysia leaf which were acacia, papaya, cherry, mango and rambutan. By using CNN from deep learning, the network is trained from the database that acquired from leaf images captured by mobile phone for image classification. ResNet-50 was the architecture has been used for neural networks image classification and training the network for leaf identification. The recognition of photographs leaves requested several numbers of steps, starting with image pre-processing, feature extraction, plant identification, matching and testing, and finally extracting the results achieved in MATLAB. Testing sets of the system consists of 3 types of images which were white background, and noise added and random background images. Finally, interfaces for the leaf identification system have developed as the end software product using MATLAB app designer. As a result, the accuracy achieved for each training sets on five leaf classes are recorded above 98%, thus recognition process was successfully implemented.
Customized moodle-based learning management system for socially disadvantaged...journalBEEI
This study aims to develop Moodle-based LMS with customized learning content and modified user interface to facilitate pedagogical processes during covid-19 pandemic and investigate how teachers of socially disadvantaged schools perceived usability and technology acceptance. Co-design process was conducted with two activities: 1) need assessment phase using an online survey and interview session with the teachers and 2) the development phase of the LMS. The system was evaluated by 30 teachers from socially disadvantaged schools for relevance to their distance learning activities. We employed computer software usability questionnaire (CSUQ) to measure perceived usability and the technology acceptance model (TAM) with insertion of 3 original variables (i.e., perceived usefulness, perceived ease of use, and intention to use) and 5 external variables (i.e., attitude toward the system, perceived interaction, self-efficacy, user interface design, and course design). The average CSUQ rating exceeded 5.0 of 7 point-scale, indicated that teachers agreed that the information quality, interaction quality, and user interface quality were clear and easy to understand. TAM results concluded that the LMS design was judged to be usable, interactive, and well-developed. Teachers reported an effective user interface that allows effective teaching operations and lead to the system adoption in immediate time.
Understanding the role of individual learner in adaptive and personalized e-l...journalBEEI
Dynamic learning environment has emerged as a powerful platform in a modern e-learning system. The learning situation that constantly changing has forced the learning platform to adapt and personalize its learning resources for students. Evidence suggested that adaptation and personalization of e-learning systems (APLS) can be achieved by utilizing learner modeling, domain modeling, and instructional modeling. In the literature of APLS, questions have been raised about the role of individual characteristics that are relevant for adaptation. With several options, a new problem has been raised where the attributes of students in APLS often overlap and are not related between studies. Therefore, this study proposed a list of learner model attributes in dynamic learning to support adaptation and personalization. The study was conducted by exploring concepts from the literature selected based on the best criteria. Then, we described the results of important concepts in student modeling and provided definitions and examples of data values that researchers have used. Besides, we also discussed the implementation of the selected learner model in providing adaptation in dynamic learning.
Prototype mobile contactless transaction system in traditional markets to sup...journalBEEI
1) Researchers developed a prototype contactless transaction system using QR codes and digital payments to support physical distancing during the COVID-19 pandemic in traditional markets.
2) The system allows sellers and buyers in traditional markets to conduct fast, secure transactions via smartphones without direct cash exchange. Buyers scan sellers' QR codes to view product details and make e-wallet payments.
3) Testing showed the system's functions worked properly and users found it easy to use and useful for supporting contactless transactions and digital transformation of traditional markets. However, further development is needed to increase trust in digital payments for users unfamiliar with the technology.
Wireless HART stack using multiprocessor technique with laxity algorithmjournalBEEI
The use of a real-time operating system is required for the demarcation of industrial wireless sensor network (IWSN) stacks (RTOS). In the industrial world, a vast number of sensors are utilised to gather various types of data. The data gathered by the sensors cannot be prioritised ahead of time. Because all of the information is equally essential. As a result, a protocol stack is employed to guarantee that data is acquired and processed fairly. In IWSN, the protocol stack is implemented using RTOS. The data collected from IWSN sensor nodes is processed using non-preemptive scheduling and the protocol stack, and then sent in parallel to the IWSN's central controller. The real-time operating system (RTOS) is a process that occurs between hardware and software. Packets must be sent at a certain time. It's possible that some packets may collide during transmission. We're going to undertake this project to get around this collision. As a prototype, this project is divided into two parts. The first uses RTOS and the LPC2148 as a master node, while the second serves as a standard data collection node to which sensors are attached. Any controller may be used in the second part, depending on the situation. Wireless HART allows two nodes to communicate with each other.
Implementation of double-layer loaded on octagon microstrip yagi antennajournalBEEI
This document describes the implementation of a double-layer structure on an octagon microstrip yagi antenna (OMYA) to improve its performance at 5.8 GHz. The double-layer consists of two double positive (DPS) substrates placed above the OMYA. Simulation and experimental results show that the double-layer configuration increases the gain of the OMYA by 2.5 dB compared to without the double-layer. The measured bandwidth of the OMYA with double-layer is 14.6%, indicating the double-layer can increase both the gain and bandwidth of the OMYA.
The calculation of the field of an antenna located near the human headjournalBEEI
In this work, a numerical calculation was carried out in one of the universal programs for automatic electro-dynamic design. The calculation is aimed at obtaining numerical values for specific absorbed power (SAR). It is the SAR value that can be used to determine the effect of the antenna of a wireless device on biological objects; the dipole parameters will be selected for GSM1800. Investigation of the influence of distance to a cell phone on radiation shows that absorbed in the head of a person the effect of electromagnetic radiation on the brain decreases by three times this is a very important result the SAR value has decreased by almost three times it is acceptable results.
Exact secure outage probability performance of uplinkdownlink multiple access...journalBEEI
In this paper, we study uplink-downlink non-orthogonal multiple access (NOMA) systems by considering the secure performance at the physical layer. In the considered system model, the base station acts a relay to allow two users at the left side communicate with two users at the right side. By considering imperfect channel state information (CSI), the secure performance need be studied since an eavesdropper wants to overhear signals processed at the downlink. To provide secure performance metric, we derive exact expressions of secrecy outage probability (SOP) and and evaluating the impacts of main parameters on SOP metric. The important finding is that we can achieve the higher secrecy performance at high signal to noise ratio (SNR). Moreover, the numerical results demonstrate that the SOP tends to a constant at high SNR. Finally, our results show that the power allocation factors, target rates are main factors affecting to the secrecy performance of considered uplink-downlink NOMA systems.
Design of a dual-band antenna for energy harvesting applicationjournalBEEI
This report presents an investigation on how to improve the current dual-band antenna to enhance the better result of the antenna parameters for energy harvesting application. Besides that, to develop a new design and validate the antenna frequencies that will operate at 2.4 GHz and 5.4 GHz. At 5.4 GHz, more data can be transmitted compare to 2.4 GHz. However, 2.4 GHz has long distance of radiation, so it can be used when far away from the antenna module compare to 5 GHz that has short distance in radiation. The development of this project includes the scope of designing and testing of antenna using computer simulation technology (CST) 2018 software and vector network analyzer (VNA) equipment. In the process of designing, fundamental parameters of antenna are being measured and validated, in purpose to identify the better antenna performance.
Transforming data-centric eXtensible markup language into relational database...journalBEEI
eXtensible markup language (XML) appeared internationally as the format for data representation over the web. Yet, most organizations are still utilising relational databases as their database solutions. As such, it is crucial to provide seamless integration via effective transformation between these database infrastructures. In this paper, we propose XML-REG to bridge these two technologies based on node-based and path-based approaches. The node-based approach is good to annotate each positional node uniquely, while the path-based approach provides summarised path information to join the nodes. On top of that, a new range labelling is also proposed to annotate nodes uniquely by ensuring the structural relationships are maintained between nodes. If a new node is to be added to the document, re-labelling is not required as the new label will be assigned to the node via the new proposed labelling scheme. Experimental evaluations indicated that the performance of XML-REG exceeded XMap, XRecursive, XAncestor and Mini-XML concerning storing time, query retrieval time and scalability. This research produces a core framework for XML to relational databases (RDB) mapping, which could be adopted in various industries.
Key performance requirement of future next wireless networks (6G)journalBEEI
The document provides an overview of the key performance indicators (KPIs) for 6G wireless networks compared to 5G networks. Some of the major KPIs discussed for 6G include: achieving data rates of up to 1 Tbps and individual user data rates up to 100 Gbps; reducing latency below 10 milliseconds; supporting up to 10 million connected devices per square kilometer; improving spectral efficiency by up to 100 times through technologies like terahertz communications and smart surfaces; and achieving an energy efficiency of 1 pico-joule per bit transmitted through techniques like wireless power transmission and energy harvesting. The document outlines how 6G aims to integrate terrestrial, aerial and maritime communications into a single network to provide ubiquitous connectivity with higher
Noise resistance territorial intensity-based optical flow using inverse confi...journalBEEI
This paper presents the use of the inverse confidential technique on bilateral function with the territorial intensity-based optical flow to prove the effectiveness in noise resistance environment. In general, the image’s motion vector is coded by the technique called optical flow where the sequences of the image are used to determine the motion vector. But, the accuracy rate of the motion vector is reduced when the source of image sequences is interfered by noises. This work proved that the inverse confidential technique on bilateral function can increase the percentage of accuracy in the motion vector determination by the territorial intensity-based optical flow under the noisy environment. We performed the testing with several kinds of non-Gaussian noises at several patterns of standard image sequences by analyzing the result of the motion vector in a form of the error vector magnitude (EVM) and compared it with several noise resistance techniques in territorial intensity-based optical flow method.
Modeling climate phenomenon with software grids analysis and display system i...journalBEEI
This study aims to model climate change based on rainfall, air temperature, pressure, humidity and wind with grADS software and create a global warming module. This research uses 3D model, define, design, and develop. The results of the modeling of the five climate elements consist of the annual average temperature in Indonesia in 2009-2015 which is between 29oC to 30.1oC, the horizontal distribution of the annual average pressure in Indonesia in 2009-2018 is between 800 mBar to 1000 mBar, the horizontal distribution the average annual humidity in Indonesia in 2009 and 2011 ranged between 27-57, in 2012-2015, 2017 and 2018 it ranged between 30-60, during the East Monsoon, the wind circulation moved from northern Indonesia to the southern region Indonesia. During the west monsoon, the wind circulation moves from the southern part of Indonesia to the northern part of Indonesia. The global warming module for SMA/MA produced is feasible to use, this is in accordance with the value given by the validate of 69 which is in the appropriate category and the response of teachers and students through a 91% questionnaire.
An approach of re-organizing input dataset to enhance the quality of emotion ...journalBEEI
The purpose of this paper is to propose an approach of re-organizing input data to recognize emotion based on short signal segments and increase the quality of emotional recognition using physiological signals. MIT's long physiological signal set was divided into two new datasets, with shorter and overlapped segments. Three different classification methods (support vector machine, random forest, and multilayer perceptron) were implemented to identify eight emotional states based on statistical features of each segment in these two datasets. By re-organizing the input dataset, the quality of recognition results was enhanced. The random forest shows the best classification result among three implemented classification methods, with an accuracy of 97.72% for eight emotional states, on the overlapped dataset. This approach shows that, by re-organizing the input dataset, the high accuracy of recognition results can be achieved without the use of EEG and ECG signals.
Parking detection system using background subtraction and HSV color segmentationjournalBEEI
Manual system vehicle parking makes finding vacant parking lots difficult, so it has to check directly to the vacant space. If many people do parking, then the time needed for it is very much or requires many people to handle it. This research develops a real-time parking system to detect parking. The system is designed using the HSV color segmentation method in determining the background image. In addition, the detection process uses the background subtraction method. Applying these two methods requires image preprocessing using several methods such as grayscaling, blurring (low-pass filter). In addition, it is followed by a thresholding and filtering process to get the best image in the detection process. In the process, there is a determination of the ROI to determine the focus area of the object identified as empty parking. The parking detection process produces the best average accuracy of 95.76%. The minimum threshold value of 255 pixels is 0.4. This value is the best value from 33 test data in several criteria, such as the time of capture, composition and color of the vehicle, the shape of the shadow of the object’s environment, and the intensity of light. This parking detection system can be implemented in real-time to determine the position of an empty place.
Quality of service performances of video and voice transmission in universal ...journalBEEI
The universal mobile telecommunications system (UMTS) has distinct benefits in that it supports a wide range of quality of service (QoS) criteria that users require in order to fulfill their requirements. The transmission of video and audio in real-time applications places a high demand on the cellular network, therefore QoS is a major problem in these applications. The ability to provide QoS in the UMTS backbone network necessitates an active QoS mechanism in order to maintain the necessary level of convenience on UMTS networks. For UMTS networks, investigation models for end-to-end QoS, total transmitted and received data, packet loss, and throughput providing techniques are run and assessed and the simulation results are examined. According to the results, appropriate QoS adaption allows for specific voice and video transmission. Finally, by analyzing existing QoS parameters, the QoS performance of 4G/UMTS networks may be improved.
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Sinan KOZAK
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Supermarket Management System Project Report.pdfKamal Acharya
Supermarket management is a stand-alone J2EE using Eclipse Juno program.
This project contains all the necessary required information about maintaining
the supermarket billing system.
The core idea of this project to minimize the paper work and centralize the
data. Here all the communication is taken in secure manner. That is, in this
application the information will be stored in client itself. For further security the
data base is stored in the back-end oracle and so no intruders can access it.
Digital Twins Computer Networking Paper Presentation.pptxaryanpankaj78
A Digital Twin in computer networking is a virtual representation of a physical network, used to simulate, analyze, and optimize network performance and reliability. It leverages real-time data to enhance network management, predict issues, and improve decision-making processes.
Build the Next Generation of Apps with the Einstein 1 Platform.
Rejoignez Philippe Ozil pour une session de workshops qui vous guidera à travers les détails de la plateforme Einstein 1, l'importance des données pour la création d'applications d'intelligence artificielle et les différents outils et technologies que Salesforce propose pour vous apporter tous les bénéfices de l'IA.
Mechatronics is a multidisciplinary field that refers to the skill sets needed in the contemporary, advanced automated manufacturing industry. At the intersection of mechanics, electronics, and computing, mechatronics specialists create simpler, smarter systems. Mechatronics is an essential foundation for the expected growth in automation and manufacturing.
Mechatronics deals with robotics, control systems, and electro-mechanical systems.
Applications of artificial Intelligence in Mechanical Engineering.pdfAtif Razi
Historically, mechanical engineering has relied heavily on human expertise and empirical methods to solve complex problems. With the introduction of computer-aided design (CAD) and finite element analysis (FEA), the field took its first steps towards digitization. These tools allowed engineers to simulate and analyze mechanical systems with greater accuracy and efficiency. However, the sheer volume of data generated by modern engineering systems and the increasing complexity of these systems have necessitated more advanced analytical tools, paving the way for AI.
AI offers the capability to process vast amounts of data, identify patterns, and make predictions with a level of speed and accuracy unattainable by traditional methods. This has profound implications for mechanical engineering, enabling more efficient design processes, predictive maintenance strategies, and optimized manufacturing operations. AI-driven tools can learn from historical data, adapt to new information, and continuously improve their performance, making them invaluable in tackling the multifaceted challenges of modern mechanical engineering.
2. ISSN: 2302-9285
Bulletin of Electr Eng and Inf, Vol. 8, No. 2, June 2019 : 389 – 395
390
Chord is the first DHT-based structured P2P overlay protocol [7]. It uses consistent hashing and
hashes each peer and key into a same m-bit circular identifier (Id) space, where m is a system parameter [7].
Chord peer uses routing tables to route the lookup message to the destination peer in O(log N) complexity,
where N is total number of peers. Chord uses periodic stabilization mechanism to correct the routing table
periodically. Pastry organizes each peers in 128-bit circular Id space that uses prefix matching to route the
messages in O(logb N) complexity, where N is total number peers and b is system parameter [8].
Neighbouring peers periodically exchange keep-alive messages in order to maintain the routing table.
Finally, Kademlia organizes each peer by assigning 160-bit Id and the each peer contains list of entries
known as routing buckets [6]. Kademlia uses XOR based closeness algorithm to calculate the closest peers,
then sends parallel lookup messages to multiple buckets at complexity of O(logb N), where N is total number
of peers and b is system parameter. Kademlia peer employs maintenance algorithm which periodically
checks the routing buckets through which there has not been a lookup since last stabilization. Kademlia only
ensures that at least one entry in each bucket is alive since last stabilization, where as Chord and Pastry
ensures all routing entries are alive and up to date.
Structured overlays use its corresponding routing algorithm and the routing table to route the
messages to the destination peer. The random join and leave of peers in P2P system causes the routing table
to be incorrect and out of date. This routing timeout may results in lookup failure. The rate of failure is
dependent on the rate of peer join and leave or known as mean lifetime of the peers. Each structured overlay
uses the maintenance algorithm to keep the routing table up_to_date. The correctness of the routing table
depends on how frequently the routing table is maintained. Hence, the routing performance increases with the
increase in frequency of maintenance. The asymptotic analysis of routing performance of the structured
overlay protocols - Chord, Pastry and Kademlia are logarithmic. This paper present the analysis of routing
performance on structured overlay in DHT which are Chord, Pastry and Kademlia to find better structured
overlay for P2P network. In this study, the analysis is according to the performance metric in terms of routing
efficiency, lookup hop count and lookup success latency. However, due to the simulation resource limitation,
we only simulate 100-500 peers of P2P networks and range of 100-1000 sec of mean lifetime.
There are also previous related works that compare the structured DHT overlay network. In [5], the
routing performance comparison are also among Chord, Pastry and Kademlia, where only routing efficiency
is being considered. Routing efficiency is calculated as the ratio of successfully routed messages to total
number of messages sent. The simulation increases with mean lifetime of peers. The result shows that
Kademlia has the best routing efficiency followed by Pastry and Chord. A simulation carried out by [9] on
Chord, Pastry, Kademlia, Broose and EpiChord in mobile networks having high churn rate. From the result,
Kademlia are also chosen to be the best P2P overlay to implement on the mobile nodes based on routing
efficiency. Due to the importance of lookup latency and routing efficiency, [10] developed a mathematical
model that combine these two metrics. They found that value of effective latency using the mathematical
model matches their simulations. This reason motivates to simulate the other performance metric which is the
workload per node or the lookup hop count. Thus, this work analyzed three performance metrics which are
routing efficiency, lookup success latency and lookup hop count.
The remainder of the paper is organized as follows. Section 2 illustrate the research method on
simulating Chord, Pastry and Kademlia. Section 3 demonstrates the results and analysis on the routing
performance according to the experiments. Finally, the whole paper is concluded in Section 4.
2. RESEARCH METHOD
This work simulates structured overlay protocols using OMNeT++ with INET [11] and OverSim
module. OverSim is an open-source P2P simulation framework that has 3-tier architecture designed using the
NED language [3]. OverSim has been described as a powerful tool for evaluating and developing P2P
applications [12, 13]. Figure 1 shows the 3-tier architecture consists of three layers such as application layer,
overlay layer and underlay layer.
In application layer, key-based routing (KBR) is implemented where it periodically sends test
messages to random nodes and records different parameters such as number of lookup, message sent, the
number of lookup failed, messages delay and hop-counts [8]. In the same layer, P2P Apps for example DHT
TestApp is used to test the DHT application, by performing DHT PUT and GET requests with randomly
generated data items [14]. Important to realize, these applications are implemented as modules and interface
with overlays through KBR API, which represent basic capabilities common to all structure overlays. In the
overlay layer, OverSim provides a number of different network models, for both structured (Chord,
Kademlia, Pastry, Broose and Koorde etc.) and unstructured overlays (GIA etc) [14]. In the underlay
network, the INET framework can be used for routing protocol implementation and also support wireless and
3. Bulletin of Electr Eng and Inf ISSN: 2302-9285
Routing performance of structured overlay in Distributed Hash Tables (DHT) for P2P (Rafiza Ruslan)
391
mobile simulation as well [5]. In addition, OverSim provides multiple underlay models to allow detail
simulation; and provides single host underlay for simulation of a single node.
Figure 1. 3-tier simulation framework implemented in OverSim simulator [3]
In this simulation, the routing efficiency, lookup hop count and lookup success latency of the peers
are calculated and recorded. The data presented in section 3 is the mean of 3 independent experiments. The
following performance metrics have been analyzed in order to measure the performance [15].
Routing Efficiency: Routing efficiency also known as lookup success rate is calculated by taking
the ratio of total number of lookup messages managed to succees before timeout and the total number of
lookup messages broadcastes by the system. This metric is calculated using (1).
(1)
Lookup Hop count: Hop count or workload per peer is calculated by taking the ratio of total
broadcasted complex query messages and total number of nodes required to successfully forward the
messages to the destination node. This is defined in (2).
(2)
Lookup Success Latency: Lookup success latency is defined as the time taken for a packet of data
to get from one designated point to another and sometimes measured as the time required for a packet to be
returned to its sender.
This work simulates the routing performance for different network size and mean lifetime of the
peers as mentioned in Table 1. In this simulation, the number of peers were limit to 500. The mean lifetime
of the peers are varied between 100 sec to 1000 sec. This limitation is due to the limited resources for
executing the simulation.
Table 1. Parameters used for simulation
Name of the Parameters
Architecture
Chord Pastry Kademlia
Number of peers 100, 200, 300, 400, 500 100, 200, 300, 400, 500 100, 200, 300, 400, 500
Mean life-time of the peer (sec) 100, 300, 500, 700, 1000 100, 300, 500, 700, 1000 100, 300, 500, 700, 1000
3. RESULTS AND ANALYSIS
3.1. Routing efficiency
Two scenarios has been conducted to collect the routing efficiency results. First experiment which is
increasing network size from 100 to 500 peers with the fixed mean lifetime of 1000 sec. Figure 2 illustrates
the routing efficiency vs network size.
4. ISSN: 2302-9285
Bulletin of Electr Eng and Inf, Vol. 8, No. 2, June 2019 : 389 – 395
392
Figure 2. The results on Chord, Pastry and Kademlia based on routing efficiency vs network size
Chord has the lowest routing efficiency over network size among Pastry and Kademlia. The lowest
routing efficiency ratio is Chord where the ratio is 0.8579 at 100 peers and gradually decrease when the
network size increase to 500 peers. Pastry maintained the routing efficiency to 1.0 until network size 500
peers then drop to 0.9998. Kademlia has a slightly lower ratio compared to Pastry. If the routing efficiency is
1.0, meaning that it is a good routing with high network stability. Chord organizes its routing table in
single-dimensional space, whereas Pastry and Kademlia have bigger routing table and organized its routing
table in two-dimentional space. Second scenarios for routing efficiency are increasing mean lifetime with the
fixed network size (100 peers). Figure 3 illustrates the routing efficiency vs mean lifetime.
Figure 3. The results on Chord, Pastry and Kademlia based on routing efficiency vs mean lifetime
Based on Figure 3, the results are similar where, Chord has the lowest compared to Pastry and
Kademlia algorithm. The ratio is 0.0959 (Chord algorithm) on 100 seconds means lifetime. The ratio in
Chord is linearly increased as the mean lifetime increases. Kademlia has a slightly drop compared to Pastry.
The highest routing efficiency is the ratio of 1.0 which Pastry on 100 seconds to 1000 seconds mean lifetime.
This proves that Pastry are the best algorithm for routing efficiency.
3.2. Lookup hop count
In lookup hop count, the similar scenarios were conducted. First, increasing network size from 100
to 500 peers with fixed mean lifetime 1000 sec. Figure 4 illustrates the lookup hop count vs network size.
5. Bulletin of Electr Eng and Inf ISSN: 2302-9285
Routing performance of structured overlay in Distributed Hash Tables (DHT) for P2P (Rafiza Ruslan)
393
Figure 4. The results on Chord, Pastry and Kademlia based on lookup hop count vs network size
In Figure 4, lookup hop count for Pastry shows a constant ratio of 0 where the values were too
small. This is due to the roundup value process. Between Kademlia and Chord, Kademlia has the better
lookup hop count at 100 peers, where lookup hop count is 1.2763. Chord has the ratio of 3.1234. When the
network increases to 500 peers, both mean lookup hop count for Kademlia and Chord increased respectively.
The result shows Pastry has the lowest lookup hop count compared to Chord and Pastry. The lower the
lookup hop count, the better the routing protocol. This result replicates the previous routing efficiency result,
where Pastry has ratio of 1.0 routing effiency. Second simulation is increasing mean lifetime from 100 to
1000 sec with fixed network size of 100 peers. Figure 5 illustrates the lookup hop count vs mean lifetime.
Figure 5. The results on Chord, pastry and kademlia based on lookup hop count vs mean lifetime
Based on Figure 5, Pastry has similar results with lookup hop count vs network size, where the
lookup hop count is near to zero. Chord has the highest lookup hop count. Therefore, Pastry shows better
routing in lookup hop count among other algorithms.
3.3. Lookup success latency
Similar lookup success latency, two scenarios have been conducted with increasing network size
from 100 nodes to 500 nodes with the fixed mean lifetime 1000s. Figure 6 shows the plotted graph for the
lookup success latency vs network size.
6. ISSN: 2302-9285
Bulletin of Electr Eng and Inf, Vol. 8, No. 2, June 2019 : 389 – 395
394
Figure 6. The results on Chord, Pastry and Kademlia based on lookup success latency vs network size
Lookup success latency is where latency time takes for data packets to be stored or retrieved. The
lower lookup success latency are the better in the routing performance. As illustrated in Figure 6, Chord has
the highest lookup success latency and Kademlia has the lowest lookup success latency. Second simulation
were the increasing mean lifetime with the fixed network size of 100 peers. Figure 7 illustrates the lookup
success latency vs mean lifetime. Chord has the highest lookup success latency compared to Pastry and
Kademlia. Kademlia has the lowest lookup success latency.
Figure 7. The results on Chord, Pastry and Kademlia based on lookup success latency vs mean lifetime
This work simulates three performance metrics which are routing efficiency, lookup hop count and
lookup success latency. The parameter setting for network size is from 100 to 500 peers and the mean
lifetime is from 100-1000 sec. This set of simulation is considered a small-scale of network environment due
to the simulation resource limitation. The result shows that Pastry has the highest ratio in routing efficiency.
The results are not similar to the previous research by [5]. However, the difference of routing efficiency
between Pastry and Kademlia is not significant. It is assume that if the simulation executes in a large scale of
network and in a higher mean lifetime, Kademlia has the possibility to obtain highest ratio in routing
efficiency similar to the result obtained by [5]. Chord has the lowest routing efficiency due to Chord
organizes its routing table in single-dimensional space, whereas Pastry and Kademlia have bigger routing
table and organized its routing table in two-dimentional space. Lookup hop count is defined as the workload
7. Bulletin of Electr Eng and Inf ISSN: 2302-9285
Routing performance of structured overlay in Distributed Hash Tables (DHT) for P2P (Rafiza Ruslan)
395
per peer in the network [15]. A low ratio of lookup hop count is good for routing where the workload per
peer is low as well. The results for lookup hop count are that Pastry has the lowest ratio, followed by
Kademlia and Chord. The value obtained for Pastry from the simulation is rounded to 0. Here, the results for
lookup hop count are parallel to the results in routing efficiency for Pastry in this work. Finally, the last
simulation shows that Kademlia obtained the lowest lookup success latency ratio, followed by Pastry and
Chord. The lookup success latency between Kademlia and Pastry also has not much difference.
4. CONCLUSION
In conclusion, this project was completed and achieved its objective. The main objective of this
research was to simulate the structured overlay protocol Chord, Pastry, and Kademlia that use DHT using
OverSim Simulator using NED language. The second objective is to evaluate three DHT-based structure
overlays which are Chord, Pastry and Kademlia on the network performance in terms of routing efficiency,
lookup hop count and lookup success latency for P2P. The simulations have been divided into two scenarios,
the first scenario was created according to the increasing number of nodes and the second scenario were
created according increasing mean lifetime. For the first scenario in term of routing efficiency Pastry has the
best routing efficiency is 1.0. Next, in term of lookup hop count and lookup success latency Kademlia is the
best algorithm when has the lowest lookup hop count and lookup success latency. For the second scenario,
performance measure in term of routing efficiency the best algorithm is Pastry but not have much different
with Kademlia which slightly drop from Pastry. For lookup hop count and success latency Kademlia has the
lowest for these two performance measurements. This means Kademlia is the best algorithm among Pastry
and Chord.
ACKNOWLEDGEMENTS
We thank Dr. Saiful Khan from University of Oxford’s e-Research Centre and Dr. Mr. Mohammad
Elsheikh from Universiti Malaysia Perlis for the useful discussions, guidance, and assistance in this research.
REFERENCES
[1] M. Caleffi and L. Paura, “P2P over MANET: Indirect tree-based routing,” in 7th Annual IEEE International
Conference on Pervasive Computing and Communications, PerCom 2009, 2009, pp. 18–22.
[2] S. A. Abid, “An Application Of 3D Logical Structure In DHT Paradigm For Efficient Communication In
MANET-PhD Thesis,” Unversity of Malaya, Kuala Lumpur, 2014.
[3] J. Leng and T. Li, “Research on P2P Network Resource Search Model,” in International Conference Advanced
Engineering and Technology Research (AETR 2017) Research, 2018, vol. 153, no. Aetr 2017, pp. 55–60.
[4] C. Yan, “Distributed hash table based routing algorithm for wireless sensor networks,” in Proceedings-2014 5th
International Conference on Intelligent Systems Design and Engineering Applications, ISDEA 2014, 2014,
pp. 430–433.
[5] S. Khan, A. Gani, and M. Sreekandath, “The routing performance of logarithmic-hop structured P2P overlay,” 2011
IEEE Conf. Open Syst. ICOS 2011, pp. 208–213, 2011.
[6] P. Maymounkov and D. Mazi, “Kademlia : A Peer-to-peer Information System Based on the XOR Metric,”
PeertoPeer Syst., pp. 53–65, 2002.
[7] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable P2P Lookup Service for
Internet Applications,” Proc. of SIGCOMM, pp. 1–23, 2001.
[8] S. Khan, A. Gani, S. Raviraja, and Shashikantha, “A study of broadcasting over structured overlay,” 2015 7th Int.
Conf. Commun. Syst. Networks, COMSNETS 2015-Proc., 2015.
[9] F. Chowdhury, “Performance Evaluation of Structured Peer-to-Peer Overlays for Use on Mobile Networks,” 2014.
[10] N. Varyani, S. Nikhil, and V. S. Shekhawat, “Latency and routing efficiency based metric for performance
comparison of DHT overlay networks,” in Proceedings-IEEE 30th International Conference on Advanced
Information Networking and Applications Workshops, WAINA 2016, 2016, pp. 337–342.
[11] OMNeT++, INET Framework for OMNeT++. 2012.
[12] J. Moorhouse, L. Liu, Z. Li, and Z. Ding, “Modelling and Simulation of Peer-to-Peer Overlay Network Protocols
using OverSim,” 2013 UKSim 15th Int. Conf. Comput. Model. Simul., pp. 144–149, 2013.
[13] T. Kunz, B. Esfandiari, S. Ngozi, and F. Ockenfeld, “P2P Overlay Performance in Large-Scale MANETs,” Int. J.
Commun. Netw. Syst. Sci., pp. 147–173, 2018.
[14] J. Furness, M. Kolberg, and M. Fayed, “An evaluation of chord and pastry models in OverSim,” Proc.-UKSim-
AMSS 7th Eur. Model. Symp. Comput. Model. Simulation, EMS 2013, pp. 509–513, 2013.
[15] S. Khan, “Complex Searching Over Structured Overlay Under Dynamic Environment-Master Thesis,” University
Of Malaya, Kuala Lumpur, 2011.