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.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
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.
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...CSCJournals
In this paper, we address the problem of routing in “delay tolerant networks” (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and the destination at any time, especially when the destination is not in the same region of the source, what makes the traditional routing protocols inefficient in that transmission of the messages between nodes. We propose to combine the routing protocol Prophet and the model of \"transfer by delegation\" (custody transfer) to improve the routing in DTN network and to exploit the nodes as a common carriers of messages between the network partitioned. To implement this approach and assess those improvements and changes we developed a DTN simulator. Simulation examples are illustrated in the article.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
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.
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
Opportunistic networks are usually formed spontaneously by mobile devices equipped with
short range wireless communication interfaces. The idea is that an end-to-end connection may
never be present. Designing and implementing a routing protocol to support both service
discovery and delivery in such kinds of networks is a challenging problem on account of
frequent disconnections and topology changes. In these networks one of the most important
issues relies on the selection of the best intermediate node to forward the messages towards the
destination. This paper presents a mobile trace based routing protocol that uses the location
information of the nodes in the network. Using the trace information, next hop is selected to forward the packets to destination. Data forwarding is done via the selected nodes. The effectiveness is shown using simulation
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.
Routing in « Delay Tolerant Networks » (DTN) Improved Routing With Prophet an...CSCJournals
In this paper, we address the problem of routing in “delay tolerant networks” (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and the destination at any time, especially when the destination is not in the same region of the source, what makes the traditional routing protocols inefficient in that transmission of the messages between nodes. We propose to combine the routing protocol Prophet and the model of \"transfer by delegation\" (custody transfer) to improve the routing in DTN network and to exploit the nodes as a common carriers of messages between the network partitioned. To implement this approach and assess those improvements and changes we developed a DTN simulator. Simulation examples are illustrated in the article.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
Design And Evaluation of Time Slot Assignment Algorithm For IEEE 802.16j Rela...CSCJournals
In IEEE 802.16j relay networks, wireless communications are carried out based on TDMA where the wireless network resources are divided into multiple time slots and they are assigned to wireless links between relay nodes as transmission opportunities. The network performance is improved by decreasing the total number of different time slots assigned to all links in a single scheduling cycle, because it brings the increase in the transmission opportunities of the links per unit time. Although it can be achieved when multiple links utilize the same time slot, the capacity of such links is degraded due to the radio interference. On the other hand, since all links in the network need to have enough time slots to accommodate their traffic load, degrading the link capacity may increase the total number of different time slots in the scheduling cycle. Therefore, we should determine the time slot assignment by considering the above-mentioned tradeoff relationship. In this paper, we propose heuristic algorithms for time slot assignment problem in IEEE 802.16j relay networks, and evaluate them through extensive simulation experiments. Two algorithms based on different heuristic are introduced. One algorithm assigns a set of time slots to links by a greedy approach. The other algorithm determines a set of links that use a time slot by a brute-force search for maximizing the total link capacity. Performance evaluation results exhibit that the proposed algorithms reduces around 34% and 39% of the total time slots compared with the case where no link utilizes the same time slot, respectively. Meanwhile, they also show that calculation time of the latter algorithm is longer than that of the former algorithm to reduce the total time slots. Thus, we show that there is a tradeoff between performance and calculation time.
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGijseajournal
ABSTRACT
Messages routing over a network is one of the most fundamental concept in communication which requires simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it refers to the addition of a timing constraint in which messages should be received within a specified time delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of routing real-time messages on networks. We study whether it is possible to have an optimal on-line algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message routing’s algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual examples. Next, we explore the Unidirectional Ring topology in finding the transmission’s “makespan”.Lastly, we propose the same network modelling through the technique of Kinesthetic Learning Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the effectiveness of the KLA approach compared to the traditional teaching method.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS –...Editor IJCATR
In this paper, we design and formulate the inverted list based approach for providing safer path and effective
communication in DSR protocol.Some nodes in network can participate in network more frequenctly whereas some nodes are not
participating. Because of this there is the requirement of such an approach that will take an intelligent decision regarding the sharing of
bandwidth or the resource to a node or the node group. Dynamic source routing protocol (DSR) is an on-demand, source routing
protocol , whereby all the routing information is maintained (continually updated) at mobile nodes.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Packet Loss and Overlay Size Aware Broadcast in the Kademlia P2P SystemIDES Editor
Kademlia is a structured peer-to-peer (P2P)
application level network, which implements a distributed
hash table (DHT). Its key-value storage and lookup service is
made efficient and reliable by its well-designed binary tree
topology and dense mesh of connections between participant
nodes. While it can carry out data storage and retrieval in
logarithmic time if the key assigned to the value in question
is precisely known, no complex queries of any kind are
supported. In this article a broadcast algorithm for the
Kademlia network is presented, which can be used to
implement such queries. The replication scheme utilized is
compatible with the lookup algorithm of Kademlia, and it
uses the same routing tables. The reliability (coverage) of the
algorithm is increased by assigning the responsibility of
disseminating the broadcast message to many nodes at the
same time. The article presents a model validated with
simulation as well. The model can be used by nodes at runtime
to calculate the required level of replication for any desired
level of coverage. This calculation can take node churn, packet
loss ratio and the size of the overlay into account.
International Journal of Computational Engineering Research(IJCER) ijceronline
nternational 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.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
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.
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.
Stochastic Model to Find the Gallbladder Motility in Acromegaly Using Exponen...IJERA Editor
The purpose of the study was octreotide therapy in acromegaly is associated with an increased prevalence of gall stones, which may be the result of inhibition of gall bladder motility. Gall stone prevalence in untreated acromegalic patients relative to the general population is unknown, however and the presence of gall stones and gall bladder motility in these patients and in acromegalic patients receiving octreotide was therefore examined. Gall bladder emptying in untreated acromegalic subjects is impaired. Octreotide further increases post prandial residual gall bladder volume and this may be a factor in the increased gall stone prevalence seen in these patients.
Visible Light Induced Selective Photocatalytic Oxidation of Benzyl Amine to N...IJERA Editor
Irradiated semiconductor catalysis in the presence of molecular oxygen can be considered as an innovative and sustainable technique for organic transformations. The present work reports the preparation ofGraphene oxide/TiO2composite by improved Hummer’s method followed by hydrothermal technique. The prepared system was characterized by various physico-chemical techniques such as X-Ray diffraction, IR-Spectroscopy, UV-DRS, XPS, SEM and TEM Analysis.On reaction, benzylamine in CH3CN yieldedN-benzylidene-1-phenylmethanamine as the sole product. The reaction was monitored by GC-MS Analysis.
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.
Fuzzy Optimized Metric for Adaptive Network RoutingCSCJournals
Network routing algorithms used today calculate least cost (shortest) paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
Improving the scalability by contact information compression in routingijitjournal
The existence of reduced scalability and delivery leads to the development of scalable routing by contact
information compression. The previous work dealt with the result of consistent analysis in the performance
of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with
decreases in the routing performance. This paper focuses on improving the scalability and delivery through
contact information compression algorithm and also addresses the problem of power awareness routing to
increase the lifetime of the overall network. Thus implementing the contact information compression (CIC)
algorithm the estimated shortest path (ESP) is detected dynamically. The scalability and release are more
improved during multipath multicasting, which delivers the information to a collection of target
concurrently in a single transmission from the source.
Design And Evaluation of Time Slot Assignment Algorithm For IEEE 802.16j Rela...CSCJournals
In IEEE 802.16j relay networks, wireless communications are carried out based on TDMA where the wireless network resources are divided into multiple time slots and they are assigned to wireless links between relay nodes as transmission opportunities. The network performance is improved by decreasing the total number of different time slots assigned to all links in a single scheduling cycle, because it brings the increase in the transmission opportunities of the links per unit time. Although it can be achieved when multiple links utilize the same time slot, the capacity of such links is degraded due to the radio interference. On the other hand, since all links in the network need to have enough time slots to accommodate their traffic load, degrading the link capacity may increase the total number of different time slots in the scheduling cycle. Therefore, we should determine the time slot assignment by considering the above-mentioned tradeoff relationship. In this paper, we propose heuristic algorithms for time slot assignment problem in IEEE 802.16j relay networks, and evaluate them through extensive simulation experiments. Two algorithms based on different heuristic are introduced. One algorithm assigns a set of time slots to links by a greedy approach. The other algorithm determines a set of links that use a time slot by a brute-force search for maximizing the total link capacity. Performance evaluation results exhibit that the proposed algorithms reduces around 34% and 39% of the total time slots compared with the case where no link utilizes the same time slot, respectively. Meanwhile, they also show that calculation time of the latter algorithm is longer than that of the former algorithm to reduce the total time slots. Thus, we show that there is a tradeoff between performance and calculation time.
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGijseajournal
ABSTRACT
Messages routing over a network is one of the most fundamental concept in communication which requires simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it refers to the addition of a timing constraint in which messages should be received within a specified time delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of routing real-time messages on networks. We study whether it is possible to have an optimal on-line algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message routing’s algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual examples. Next, we explore the Unidirectional Ring topology in finding the transmission’s “makespan”.Lastly, we propose the same network modelling through the technique of Kinesthetic Learning Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the effectiveness of the KLA approach compared to the traditional teaching method.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
AN INVERTED LIST BASED APPROACH TO GENERATE OPTIMISED PATH IN DSR IN MANETS –...Editor IJCATR
In this paper, we design and formulate the inverted list based approach for providing safer path and effective
communication in DSR protocol.Some nodes in network can participate in network more frequenctly whereas some nodes are not
participating. Because of this there is the requirement of such an approach that will take an intelligent decision regarding the sharing of
bandwidth or the resource to a node or the node group. Dynamic source routing protocol (DSR) is an on-demand, source routing
protocol , whereby all the routing information is maintained (continually updated) at mobile nodes.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Packet Loss and Overlay Size Aware Broadcast in the Kademlia P2P SystemIDES Editor
Kademlia is a structured peer-to-peer (P2P)
application level network, which implements a distributed
hash table (DHT). Its key-value storage and lookup service is
made efficient and reliable by its well-designed binary tree
topology and dense mesh of connections between participant
nodes. While it can carry out data storage and retrieval in
logarithmic time if the key assigned to the value in question
is precisely known, no complex queries of any kind are
supported. In this article a broadcast algorithm for the
Kademlia network is presented, which can be used to
implement such queries. The replication scheme utilized is
compatible with the lookup algorithm of Kademlia, and it
uses the same routing tables. The reliability (coverage) of the
algorithm is increased by assigning the responsibility of
disseminating the broadcast message to many nodes at the
same time. The article presents a model validated with
simulation as well. The model can be used by nodes at runtime
to calculate the required level of replication for any desired
level of coverage. This calculation can take node churn, packet
loss ratio and the size of the overlay into account.
International Journal of Computational Engineering Research(IJCER) ijceronline
nternational 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.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
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.
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.
Stochastic Model to Find the Gallbladder Motility in Acromegaly Using Exponen...IJERA Editor
The purpose of the study was octreotide therapy in acromegaly is associated with an increased prevalence of gall stones, which may be the result of inhibition of gall bladder motility. Gall stone prevalence in untreated acromegalic patients relative to the general population is unknown, however and the presence of gall stones and gall bladder motility in these patients and in acromegalic patients receiving octreotide was therefore examined. Gall bladder emptying in untreated acromegalic subjects is impaired. Octreotide further increases post prandial residual gall bladder volume and this may be a factor in the increased gall stone prevalence seen in these patients.
Visible Light Induced Selective Photocatalytic Oxidation of Benzyl Amine to N...IJERA Editor
Irradiated semiconductor catalysis in the presence of molecular oxygen can be considered as an innovative and sustainable technique for organic transformations. The present work reports the preparation ofGraphene oxide/TiO2composite by improved Hummer’s method followed by hydrothermal technique. The prepared system was characterized by various physico-chemical techniques such as X-Ray diffraction, IR-Spectroscopy, UV-DRS, XPS, SEM and TEM Analysis.On reaction, benzylamine in CH3CN yieldedN-benzylidene-1-phenylmethanamine as the sole product. The reaction was monitored by GC-MS Analysis.
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.
To Study Effect of Various Parameters for Quality Improvement in Technical Ed...IJERA Editor
In the present Research Investigation an effort has been made to study the effect of various important parameters of technical education system on its quality. This is done by creating sub modules of important stakeholders of technical education system and studying their Interactions by constructing causal loop diagrams of various modules .The main objective of this Research study is to construct a system dynamic model based on the interactions among this sub-modules which can be taken as a base for optimal policy planning for achieving optimum level of quality in the technical education system.
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.
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.
Fixed points of contractive and Geraghty contraction mappings under the influ...IJERA Editor
In this paper, we prove the existence of fixed points of contractive and Geraghty contraction maps in complete metric spaces under the influence of altering distances. Our results extend and generalize some of the known results.
Performance of water and diluted ethylene glycol as coolants for electronic c...IJERA Editor
As the number of transistors increases with new generation of microprocessor chips, the power draw and heat load to dissipate during operation increases. As a result of increasing the heat loads and heat fluxes the Conventional cooling technologies such as fan, heat sinks are unable to absorb and heat transfer excess heat dissipated by these new microprocessor. So, new technologies are needed to improve the heat removal capacity. In the present work single phase liquid cooling system with mini channel is analyzed and experimentally investigated. Mini channels are chosen as to provide higher heat transfer co-efficient than conventional channel. Copper pipes of 0.36 mm diameter are taken to fabricate heat sink and heat exchanger. A pump is used to circulate the fluid through heat sink and heat exchanger. A solid heated aluminium block to simulate heat generated electronic component is used and electrical input is supplied to the heated aluminium block and cooling system is placed over the heated block. The performance of the cooling system is analyzed from the experimental data obtained. It is experimentally observed that the mini channel liquid cooling system with water as a coolant has better performance than diluted ethylene glycol as coolant at different flow rates. The surface temperature of the heated aluminium block with convective heat transfer co-efficient is observed
Automated Testing of C-Band Rotary Field Ferrite Phase ShifterIJERA Editor
This paper presents the methodology for an automatic test procedure based on LabVIEW for RF characterisation of C- band rotary field phase shifter. Using this software, the characteristics of the phase shifter intended for phased array application viz. differential phase shift, insertion loss, return loss, rms phase error, insertion phase are measured systematically and displayed graphically in user friendly format.
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.
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.
HeroCloud: The Next Generation Solution to Online Game Development HeroEngine
HeroCloud removes the business barriers to online game development-- with no up-front costs as well as covering the costs associated with running your game online. HeroCloud provides full access to HeroEngine, hosting, bandwidth, and access to billing and marketing systems in return for a 30% revenue share.
HeroEngine technology provides a groundbreaking online system where development teams build their games live in a what-you-see-is-what-you-get 3D environment with a rich suite of tools, where games come to life instantly as they are built. Licensees include BioWare (Star Wars: The Old Republic), ZeniMax Online, and many more around the world who demand a better process for developing and maintaining online worlds
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.
Stochastic Modeling Neutral Evolution by an Iambp of Cortisol Secretion of Br...IJERA Editor
Objective Fatigue is one of the most common and distressing symptoms by cancer patients and survivors. To evaluate cortisol responses to an experimental psychologic stressor in fatigued and non fatigued survivors. The focus is the frequency spectrum of the Infinite-Allele Markov branching process (IAMBP), namely the proportion having a given number of copies at a specified time point.
Studying and Comparing Sensing Capability of Single Walled Carbon Nanotubes f...IJERA Editor
In this study sensing capability of single walled carbon nanotubes (SWCNTs), of both zigzag (5, 0) and
armchair (4, 4) models were investigated for adsorption of O2 and N2 molecules were investigated using density
functional theory (DFT) method. Using this computational method, it is possible to obtain much more data to
apply in medical science and industrial technologies. Geometrical optimization have carried out using standard
set and B3LYP/6-311G* basis set of Gaussian 98 program. Those parts of SWCNT which have demonstrated
more contribution in adsorption energy, ΔEads (eV) were studied and compared. Electronic configurations were
discussed and the results were interpreted
An Automated Input Data Management Approach for Discrete Event Simulation App...IJERA Editor
Slipforming operation’s linearity is a source of planning complications, and operation is usually subjected to bottlenecks at any point, so careful planning is required in order to achieve success. On the other hand, Discrete-event simulation concepts can be applied to simulate and analyze construction operations and to efficiently support construction scheduling. Nevertheless, preparation of input data for construction simulation is very challenging, time consuming and human prone-error source. Therefore, to enhance the benefits of using DES in construction scheduling, this study proposes an integrated module to establish a framework for automating the generation of time schedules and decision support for Slipform construction projects, particularly through the project feasibility study phase by using data exchange between project data stored in an Intermediate database, DES and Scheduling software. Using the stored information, proposed system creates construction tasks attribute [e.g. activities durations, material quantities and resources amount], then DES uses all the given information to create a proposal for the construction schedule automatically. This research is considered a demonstration of a flexible Slipform project modeling, rapid scenario-based planning and schedule generation approach that may be of interest to both practitioners and researchers.
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
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.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
Route Stability in Mobile Ad-Hoc Networksarpublication
A Mobile Ad Hoc Network (MANET) is a wireless network consisting of mobile nodes, which can communicate with each other without any infrastructure support. In these networks, nodes typically cooperate with each other, by forwarding packets for nodes which are not in the communication range of the source node. A fundamental issue arising in mobile ad-hoc networks (MANETs) is the selection of the optimal path between any two nodes. A method that has been advocated to improve routing efficiency is to select the most stable path so as to reduce the latency and the overhead due to route reconstruction. In this work we study the stability of a routing path, which is subject to link failures caused by node mobility, and we consider as metrics of interest the duration and the availability of a path. Moreover, using the results on path duration and availability, we show how to determine the optimal path in terms of route stability, under the Random Direction mobility models.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Journals
Abstract Mobile networks have received great deal of attention during last few decades due to their potential applications such as large scale, improved flexibility and reduced costs. This proposed work addresses two problems associated with mobile network such as method to reduce overhead between the nodes, and energy balanced routing of packets by Co-Operative opportunistic routing for cluster based communication. We propose a modified algorithm that uses On-Demand Opportunistic Group mobility based clustering (ODOGMBC) for forming the cluster and predicting the cluster mobility by neighbourhood update algorithm. Cluster formation involves election of a mobile node as Cluster head. Each cluster comprises of cluster head and non-cluster head node that forms a cluster dynamically. Each node in the network continuously finds it neighbour by communicating with them, and nodes have consistent updated routing information in route cache by neighbourhood update algorithm. In routing process packet forwarded by the source node is updated by intermediate forwarder if topology undergo changes. This opportunistic routing scheme provides responsive data transportation and managing the node effectively, even in heavily loaded environment. Thus, our proposed routing technique helps us to reduce overhead, increases efficiency and better control of path selection. Keywords- Clustering, Forwarder, MANET, Prediction, Reactive, opportunistic routing.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
Analysis of multi hop relay algorithm for efficient broadcasting in manetseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
D0441722
1. V. Prema Tulasi et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 1), April 2014, pp.17-22
www.ijera.com 17 | P a g e
Delay Tolerant Network Routing Nature – A Study
V. Prema Tulasi1
, K. Satyanarayana2
, Revuri VARUN3
, VARUN Maramraju4
1
Assistant Professor, Dept Of Cse, Nalla Narasimha Reddy Educational Society's Group Of Institutions,
Hyderabad, Ap, India.
2
Assistant Professor, Dept Of Cse,Sphoorthy Engg College, Hyderabad, Ap, India
3,4
Assistatnt Professor,Dept Of Cse, Vaagdevi College Of Engineering,Bollikunta, Warangal, Ap, India
Abstract
Delay-Tolerant network (DTN) is a network in which no simultaneous end-to-end path exists. And the messages
delivered in the DTN usually have large delivery latency due to network partition. These special characteristics
make DTN routing a challenging problem. For this purpose, we updated the shortest path based routing
algorithms using conditional intermeeting times and proposed to route the messages over conditional shortest
paths. This proposes Conditional Shortest Path Routing (CSPR) protocol that route the messages over
conditional shortest paths in which the cost of links between nodes is defined by conditional intermeeting times
rather than the conventional intermeeting times.
Keywords: DTN, CSPR, Routing, Network;
I. INTRODUCTION
Routing in delay tolerant networks (DTN) is
a challenging problem because at any given time
instance, the probability that there is an end-to-end
path from a source to a destination is low. Since the
routing algorithms for conventional networks assume
that the links between nodes are stable most of the
time and do not fail frequently, they do not generally
work in DTN’s. Therefore, the routing problem is
still an active research area in DTN’s [1-10].
Routing algorithms in DTN’s utilize a
paradigm called store-carry-and-forward. When a
node receives a message from one of its contacts, it
stores the message in its buffer and carries the
message until it encounters another node which is at
least as useful (in terms of the delivery) as itself.
Then the message is forwarded to it. Based on this
paradigm, several routing algorithms with different
objectives (high delivery rate etc.) and different
routing techniques (single-copy [1-10], multi-copy
[1-10], erasure coding based [1-10] etc.) have been
proposed recently. However, some of these
algorithms [7] used unrealistic assumptions, such as
the existence of oracles which provide future contact
times of nodes. Yet, there are also many algorithms
(such as [1-10]) based on realistic assumption of
using only the contact history of nodes to route
messages opportunistically.
II. LITERATURE
Work on DTN networks shows that it is
possible to automatically route in networks, even
when nodes are mobile and the link quality varies.
There is a huge body of work on routing protocols
[11-22] and metrics [11-22] for this environment.
However, these protocols and metrics find end-to-end
paths, and do not support communication between
nodes in different network partitions. Recent studies
on routing problem in DTN’s have focused on the
analysis of real mobility traces (human [11-22],
vehicular [11-22] etc.). Different traces from various
DTN environments are analyzed and the extracted
characteristics of the mobile objects are utilized on
the design of routing algorithms for DTN’s. An
approach that uses a single copy of each message is
presented by Jain et al. [11-22]. They assume that the
contact schedule is completely known in advance,
and use this knowledge to create a number of routing
metrics. Their results show that the efficiency and
performance increases with the amount of
information used for the metric. The weakness of this
approach is that each node must have access to
accurate schedule data. To provide this information,
the routing must be manually configured with the
contact schedules, which must be repeated each time
the schedule changes. Handorean et al. explore
alternatives for distributing connectivity information,
but they still assume that each node knows its own
connectivity perfectly [11-22]. From the analysis of
these traces performed in previous work, we have
made two key observations. First, rather than being
memory less, the pair wise intermeeting times
between the nodes usually follow a log-normal
distribution [11-22]. Therefore, future contacts of
nodes become dependent on the previous contacts.
Second, the mobility of many real objects are non-
deterministic but cyclic. Hence, in a cyclic
MobiSpace [11-22], if two nodes were often in
contact at a particular time in previous cycles, then
RESEARCH ARTICLE OPEN ACCESS
2. V. Prema Tulasi et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 1), April 2014, pp.17-22
www.ijera.com 18 | P a g e
they will most likely be in contact at around the same
time in the next cycle.
III. ROUTING
In wireless sensor networks or in networking
sending the data or information in packets from
source sender to receiver destination, Sending data
from sender side system to receiver side routing is
classified into static and dynamic routing.
Static Routing: In this routing, information of all
networks must be entered manually by the
administrator on all routers. As routing data is
entered by the administrator there is no requirement
to perform any metric calculations to determine
paths. Advantages of static routing are: Doesn't
exchange any routing tables hence it doesn’t consume
any bandwidth. Again the bandwidths which may be
consumed in dynamic updates are saved. Low
processing power may suffice; hence we can use
cheaper routers. Higher Security as there is no
information being regarding routing on the
connecting links. Draw backs of static routing are
each remote network information is written manually.
Reconfiguration is problematic and tedious if there is
a change in the topology.
Fig. 1. Dynamic routers
Dynamic Routing: These routing protocols are used
to facilitate the exchange of routing information
between routers. Routing protocols allow routers to
dynamically learn information of all remote networks
and automatically add this information to their own
routing. Routing protocols determine the best path to
each network, which is then added to the routing
table. One of the primary benefits of using a dynamic
routing protocol is that routers exchange routing
information whenever there is a topology change.
This exchange allows routers to automatically learn
about new networks and also to find alternate paths if
there is a link failure to a current network. Static
routing over dynamic routing protocols requires less
administrative overhead, the actual procedure is
shown in Fig 1. However, the expense of using
dynamic routing protocols is dedicating part of a
router’s resources for protocol operation, including
CPU time and network link bandwidth. Despite the
benefits of dynamic routing, static routing still has its
place. There are times when static routing is more
appropriate and other times when dynamic routing is
the better choice.
IV. THEORETICAL ANALYSIS
In this section we analyze and briefly
discuss the Tools and algorithms which we used to
Emphatic import of conditional dynamic shortest
path routing in Delay Tolerant Network. In our
discussion, we shall first examine the algorithms and
their work. In this, we implement a shortest path
routing based algorithms. Based on these algorithms
we find the conditional intermeeting time. We
propose Conditional Shortest Path Routing (CSPR)
protocol that route the messages over conditional
shortest paths in which the cost of links between
nodes is defined by conditional intermeeting times
rather than the conventional intermeeting times.
Network Model: We model a DTN as a graph G =
(V , E) where the vertices (V ) are mobile nodes and
the edges (E) represent the connections between these
nodes. However, different from previous DTN
network models, we assume that there may be
multiple unidirectional (Eu) and bidirectional (Eb)
edges between the nodes. The neighbors of a
node i are denoted with N(i) and the edge sets are
given as follows: The above definition of Eu allows
for multiple unidirectional edges between any two
nodes. However, these edges differ from each other
in terms of their weights and the corresponding third
node. This third node indicates the previous meeting
and is used as a reference point while defining the
conditional intermeeting time (weight of the edge).
We illustrate a sample DTN graph with four nodes
and nine edges. Of these nine edges, three are
bidirectional with weights of standard intermeeting
times between nodes, and six are unidirectional edges
with weights of conditional intermeeting times.
Conditional Shortest Path Routing: Our algorithm
basically finds conditional shortest paths (CSP) for
each source-destination pair and routes the messages
over these paths. We define the CSP from a node n0
to a node nd as follows:
Here, t represents the time that has passed since the
last meeting of node n0 with n1 and is the
expected residual time for node n0 to meet with node
n1 given that they have not met in the last t time
3. V. Prema Tulasi et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 1), April 2014, pp.17-22
www.ijera.com 19 | P a g e
units. Can be computed with parameters
of distribution representing the intermeeting time
between n0 and n1. It can also be computed in a
discrete manner from the contact history of n0 and
n1.
Assume that node i observed d intermeeting
times with node j in its past. Let τ 1
Here, if none of the d observed intermeeting times is
bigger than t (this case occurs less likely as the
contact history grows), a good approximation can be
to assume . We will next provide an
example to show the benefit of CSP over SP. The
weights of edges (A, C) and (A, B) show the expected
residual time of node A with nodes C and B
respectively in both graphs. But the weights of edges
(C, D) and (B, D) are different in both graphs. While
in the left graph, they show the average intermeeting
times of nodes C and B with D respectively, in the
right graph, they show the average conditional
intermeeting times of the same nodes with D relative
to their meeting with node A. From the left graph, we
conclude that SP(A, D) follows (A,B,D). Hence, it is
expected that on average a message from node A will
be delivered to node D in 40 time units. However this
may not be the actual shortest delay path. As the
weight of edge (C, D) states in the right graph, node
C can have a smaller conditional intermeeting time
(than the standard intermeeting time) with node D
assuming that it has met node A. This provides node
C with a faster transfer of the message to node D
after meeting node A. Hence, in the right graph,
CSP(A, D) is (A,C,D) with the path cost of 30 time
units. Each node forms the aforementioned network
model and collects the standard and conditional
intermeeting times of their nodes between each other
through epidemic link state protocol. However, once
the weights are known, it is not as easy to find CSP’s
as it is to find SP’s. Consider Figure 5 where the
CSP(A, E) follows path 2 and CSP(A, D) follows (A,
B, D). This situation is likely to happen in a DTN, if
τD(E|B) ≥ τD(E|C) is satisfied. Running Dijkstra’s or
Bellman-ford algorithm on the current graph
structure cannot detect such cases and concludes that
CSP(A, E) is (A, B, D, E). Therefore, to obtain the
correct CSP’s for each source destination pair, we
propose the following transformation on the current
graph structure. Given a DTN graph G = (V,E), we
obtain a new graph where:
Note that the edges in Eb (in G) are made directional
in G’ and the edges in Eu between the same pair of
nodes are separated in E’. This graph transformation
keeps all the historical information that conditional
intermeeting times require and also keeps only the
paths with a valid history. For example, for a path
A,B,C,D in G, an edge like (CD,DA) in G’ cannot be
chosen because of the edge settings in the graph.
Hence, only the correct τ values will be added to the
path calculation. To solve the CSP problem however,
we add one vertex for source S (apart from its
permutations) and one vertex for destination node D.
We also add outgoing edges from S to each vertex
with weight . Furthermore, for the
destination node, D, we add only incoming edges
from each vertex with weight τi(D|j) and the
algorithm is shown in Algorithm 1.
ALGORITHM 1
update (node m, time t)
1:if m is seen first time then
2: firstTimeAt[m] t
3: else
4: increment βm by 1
5: lastTimeAt[m] t
6: end if
7: for each neighbor j € N and j ≠ m do
8: start a timer tmj
9: end for
10: for each neighbor j € N and j ≠ m do
11: for each timer tjm running do
12: S[j][m] += time on tjm
13: increment C[j][m] by 1
14: end for
15: delete all timers tjm
16: end for
17: for each neighbor i € N do
18: for each neighbor j € N and j ≠ i do
19: if S[j][i] ≠ 0 then
20: Ts(i|j) S[j][i] / C[j][i]
21: end if
22: end for
23: Ts(i) (lastTimeAt[i] − firstTimeAt[i] )
/ βi
24: end for
V. MODULES IMPLEMENTED
Modules implemented in this paper as
follows:
4. V. Prema Tulasi et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 1), April 2014, pp.17-22
www.ijera.com 20 | P a g e
Networking Module: Client-server computing or
networking is a distributed application architecture
that partitions tasks or workloads between service
providers (servers) and service requesters, called
clients. Often clients and servers operate over a
computer network on separate hardware. A server
machine is a high-performance host that is running
one or more server programs which share its
resources with clients. A client also shares any of its
resources; Clients therefore initiate communication
sessions with servers which await (listen to)
incoming requests.
Shortest Path Module: In multi-hop wireless
networks, packets are transferred through routes that
could be composed of multiple relay nodes between
sources and destinations. In many multi-hop wireless
networks, shortest path routing is often used for its
simplicity and scalability, and this is closely
approximated by straight line routing for large multi-
hop wireless networks. Thus, in this paper, we will
focus on straight line routing for delivering packets
from sources to destinations.
Straight Line Routing Module: Both simulations
and analysis show that the relay load over the
network, imposed by straight line routing, depends on
the model of the traffic pattern. Even if the system
settings are identical and straight line routing is
commonly adopted, the relay load induced by
“random” traffic could be distributed differently over
the network. This paradoxical result is a consequence
of the famous Bertrand’s paradox. Thus, in contrast
to traditional belief, there are many scenarios in
which straight line routing itself can balance the load
over the network, and in such cases explicit load-
balanced routing may not help mitigate the relaying
load.
Multi Hop Module: Analyze the load for a
homogeneous multi-hop wireless network for the
case of straight line routing in shortest path routing is
frequently approximated to straight line routing in
large multi-hop wireless networks. Since
geographical and geometric attributes of nodes and
routes affect the nodal load, we employ results from
geometric probabilities to solve the problem. Based
on our analytical results, we are able to show the
precise relationship between the number of nodes and
the load at each node, and the geographical
distribution of the relaying load over the network for
different scenarios. Interestingly, straight line routing
itself can balance the relay load over the disk in
certain cases.
VI. RESULTS
We conducted the simulation study from server to
client in sending the file through conditional shortest
path. We ran the conditional shortest path routing
algorithm for it. Initial number of nodes that are
selected for sending the file will be reduced after
applying the algorithm, so that few nodes are selected
as the shortest path, which are shown in Fig 2 and 3.
Fig 2 Results of shortest path
Fig 3 Results of Node connection
VII. COMPARATIVE STUDY
A Distributed adaptive fault- tolerant routing
scheme is proposed for an injured hypercube in
which each node is required to know only the
condition of its own links. Despite its simplicity, this
scheme is shown to be capable of routing messages
successfully in an injured n-dimensional hypercube
as long as the number of faulty components is less
than n. Moreover, it is proved that this scheme routes
messages via shortest paths with a rather high
probability, and the expected length of a resulting
path is very close so that of a shortest path. Since the
assumption that the number of faulty components is
less than n in an n-dimensional hypercube might limit
the usefulness of the above scheme, a routing scheme
based on depth-first search which works in the
presence of an arbitrary number of faulty components
is introduced. Due to the insufficient information on
faulty components, however, the paths chosen by this
scheme may not always be the shortest. In our
system, defines the intermeeting time concept
between nodes and introduces a new link metric
called conditional intermeeting time.
5. V. Prema Tulasi et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 1), April 2014, pp.17-22
www.ijera.com 21 | P a g e
It is the intermeeting time between two nodes given
that one of the nodes has previously met a certain
other node. This updated definition of intermeeting
time is also more convenient for the context of
message routing because the messages are received
from a node and given to another node on the way
towards the destination. Here, conditional
intermeeting time represent the period over which the
node holds the message. To show the benefits of the
proposed metric, the project proposes conditional
shortest path routing (CSPR) protocol in which
average conditional intermeeting times are used as
link costs rather than standard intermeeting times and
the messages are routed over conditional shortest
paths (CSP). By comparing CSPR protocol with the
existing shortest path (SP) based routing protocol
through real trace driven simulations the results
demonstrate that CSPR achieves higher delivery rate
and lower end-to-end delay compared to the shortest
path based routing protocols.
VIII. CONCLUSIONS
We introduced a new metric called
conditional intermeeting time inspired by the results
of the recent studies showing that nodes’
intermeeting times are not memory less and that
motion patterns of mobile nodes are frequently
repetitive. Then, we looked at the effects of this
metric on shortest path based routing in dtn’s. For
this purpose, we updated the shortest path based
routing algorithms using conditional intermeeting
times and proposed to route the messages over
conditional shortest paths. Finally, we ran
simulations to evaluate the proposed algorithm and
demonstrated the superiority of CSPR protocol over
the existing shortest path routing algorithms.
REFERENCES
[1] Delay tolerant networking research group,
http://www.dtnrg.org.
[2] T. Spyropoulos, K. Psounis,C. S.
Raghavendra, Efficient routing in
intermittently connected mobile networks:
The single-copy case, IEEE/ACM
Transactions on Networking, vol. 16, no. 1,
Feb. 2008.
[3] J. Burgess, B. Gallagher, D. Jensen, and B.
N. Levine, MaxProp: Routing for Vehicle-
Based Disruption- Tolerant Networks, In
Proc. IEEE Infocom, April 2006.
[4] A. Vahdat and D. Becker, Epidemic routing
for partially connected ad hoc networks,
Duke University, Tech. Rep. CS-200006,
2000.
[5] T. Spyropoulos, K. Psounis,C. S.
Raghavendra, Efficient routing in
intermittently connected mobile networks:
The multi-copy case, IEEE/ACM
Transactions on Networking, 2008.
[6] Y. Wang, S. Jain, M. Martonosi, and K.
Fall, Erasure coding based routing for
opportunistic networks, in Proceedings of
ACM SIGCOMM workshop on Delay
Tolerant Networking (WDTN), 2005.
[7] S. Jain, K. Fall, and R. Patra, Routing in a
delay tolerant network, in Proceedings of
ACM SIGCOMM, Aug. 2004.
[8] T. Spyropoulos, K. Psounis,C. S.
Raghavendra, Spray and Wait: An Efficient
Routing Scheme for Intermittently
Connected Mobile Networks, ACM
SIGCOMM Workshop, 2005.
[9] A. Lindgren, A. Doria, and O. Schelen,
Probabilistic routing in intermittently
connected networks, SIGMOBILE Mobile
Computing and Communication Review,
vol. 7, no. 3, 2003.
[10] E. P. C. Jones, L. Li, and P. A. S. Ward,
Practical routing in delay tolerant networks,
in Proceedings of ACM SIGCOMM
workshop on Delay Tolerant Networking
(WDTN), 2005.
[11] C. E. Perkins and P. Bhagwat. Highly
dynamic destination-sequenced distance-
vector routing (DSDV) for mobile
computers. In ACM SIGCOMM, 1994.
[12] C. E. Perkins and E. M. Royer. Ad-hoc on-
demand distance vector routing. In IEEE
WMCSA, 1999.
[13] E. M. Royer and C.-K. Toh. A review of
current routing protocols for ad hoc mobile
wireless networks. IEEE Personal
Communications, 6:46–55, 1999
[14] D. S. J. De Couto, D. Aguayo, J. Bicket, and
R. Morris. A high-throughput path metric
for multi-hop wireless routing. In ACM
MobiCom, 2003.
[15] R. Draves, J. Padhye, and B. Zill. Routing in
multi-radio, multi-hop wireless mesh
networks. In ACM MobiCom, 2004.
[16] X. Zhang, J. F. Kurose, B. Levine, D.
Towsley, and H. Zhang, Study of a Bus-
Based Disruption Tolerant Network:
Mobility Modeling and Impact on Routing,
In Proceedings of ACM MobiCom, 2007.
[17] R. Handorean, C. Gill, and G.-C. Roman.
Accommodating transient connectivity in ad
hoc and mobile settings. Lecture Notes in
Computer Science, 3001:305–322, March
2004.
[18] S. Srinivasa and S. Krishnamurthy, CREST:
An Opportunistic Forwarding Protocol
Based on Conditional Residual Time, in
Proceedings of IEEE SECON, 2009.
6. V. Prema Tulasi et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 4( Version 1), April 2014, pp.17-22
www.ijera.com 22 | P a g e
[19] P. U. Tournoux, J. Leguay, F. Benbadis, V.
Conan, M. Amorim, J. Whitbeck, The
Accordion Phenomenon: Analysis,
Characterization, and Impact on DTN
Routing, in Proceedings of Infocom, 2009.
[20] C. Liu and J. Wu, Routing in a Cyclic
Mobispace, In Proceedings of ACM
Mobihoc, 2008.
[21] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot,
R. Gass, and J. Scott, Impact of Human
Mobility on the Design of Opportunistic
Forwarding Algorithms, in Proceedings of
INFOCOM, 2006.
[22] S. Jain, K. Fall, and R. Patra, Routing in a
delay tolerant network, in Proceedings of
ACM SIGCOMM, Aug.
ABOUT AUTHORS:
V.PREMA TULASI working in Nalla
Narasimha Reddy Education Society’s Group of
Institutions as Assistant Professor, Computer Science
Department. Having 6 Years of experience in
teaching and published papers in various journals.
K. SATYANARAYANA Working as
Asst.prof, Dept of CSE in SPHOORTHY
ENGINEERING COLLEGE. Had 7+ Years of
experience in teaching, has done M.tech in Computer
science from JNTU, Hyderabad. His area of interest
is computer architecture - cache memory, pipelining,
computer networking, data mining.
Mr. Revuri Varun, Post Graduated in
Computer science and Engineering (M.Tech) ,
JNTUH , Hyderabad in 2011 and Graduated in
Information Technology(B.Tech) from JNTUH, in
2007. He is working as an Assistant Professor in
Department of Computer Science & Engineering in
Vaagdevi College Of Engineering, Warangal Dist,
AP, and India. He has 6 years of Teaching
Experience. His Research Interests Include Network
Security and Data Mining.
Mr. Varun Maramraju Post
Graduated in Software Engineering (M.Tech),
JNTUH, Hyderabad in 2012 and Graduated in
Information Technology (B.Tech) from JNTUH, in
2008. He is working as an Assistant Professor in
Department of Computer Science & Engineering in
Vaagdevi College Of Engineering, Warangal Dist,
AP, and India. He has 5 years of Teaching
Experience. His Research Interests Include Network
Security and Design and Analysis of Algorithms.