This document summarizes and compares existing routing protocols for delay tolerant networks. It presents routing protocols such as first contact, direct delivery, PROPHET, spray and wait, and epidemic routing. It also proposes a new dynamic spray and wait protocol that considers the quality of nodes based on their activity level. Simulation results show that the proposed algorithm that considers message size, number of copies, and time to live performs better than the traditional drop front approach in terms of delivery probability, buffer time average, overhead ratio, packets dropped, and hop count average.
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...eSAT Journals
Abstract DTN (Delay Tolerant Network) is a new concept in the field of wireless networks. It enables communication in challenged environment where traditional network fails. Unlike other ad hoc wireless network it does not demand for end to end node connectivity. DTN is based on store carry and forward principle. This mechanism is implemented using bundle protocol. DTN nodes have capabilities such as radio interface, movement, persistent storage, message routing and energy consumption .Here a node might accumulate a message in its buffer and carry it for limited time, waiting till a suitable forwarding opportunity is acquired. Multiple message duplication into the network is done to increase delivery probability. The main objective of DTN Routing is to build a powerful network between various nodes (mobile devices, planetary vehicles etc) so that good delivery probability and less delay are obtained. This unique mechanism poses a security challenge. A sophisticated attack observed is black hole attack in which malicious intermediate node are present in network that can provide attacked forged metrics to another node. The aim of this work is to simulate and analyze routing protocol of DTN when nodes enter in environment with black hole attack. The work has been carried out with ONE (opportunistic network environment) simulator. The performance of routing protocols (RAPID and Spray and Wait) are tested for different number of attacking nodes. The analysis indicates there is decrease in delivery probability, hop count average and buffer time average. But latency average first increases and then start decreasing. The overhead ratio increases using Spray and Wait Protocol but with RAPID protocol, it decreases with increasing black hole attacking nodes. Index Terms: DTN, ONE, etc.
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...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
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
This document summarizes a project seminar presentation on analyzing the performance of the epidemic routing protocol in delay tolerant networks under different mobility models. The key points are:
1) The objective is to evaluate the epidemic routing protocol's delivery probability, overhead ratio, and average buffer time when varying the buffer size and under different mobility models including random waypoint, map-based, shortest path, and map route models.
2) Simulation results show that the shortest path mobility model provides the best performance for the epidemic routing protocol in terms of high delivery probability, low overhead ratio, and efficient buffer usage.
3) Additional analysis varying the number of nodes found that performance is best when more nodes are present and becomes static with
PRoPHET uses its delivery predictability of node encounters and transitivity to forward bundles to its neighbor node. Regardless of their distance, it faces delivery dilemmas in a source node and drawbacks of low delivery ratio and high delay in case two or more neighbor nodes carry equal delivery predictability. To solve such consequences, we propose a Distance and Probabilistic Routing Protocol using History of Encounters and Transitivity (DPRoPHET) with the use of cross layer implementation for distance value retrieval. Our simulation results show that, by adding distance metric to the existing delivery predictability vector, DPRoPHET outperforms PRoPHET.
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
This document summarizes three routing strategies - Cluster and Chain Based (CCB), Transmission Ranges and Chain Based (TRCB), and GRAdient Broadcast (GRAB) - proposed for wireless sensor networks to improve energy efficiency. CCB uses both clustering from LEACH and chain formation from PEGASIS to transmit sensor data to the base station. TRCB uses transmission ranges and distances to transmit sensor data within clusters to heads, which then form chains to the base station. GRAB builds and maintains a cost field to efficiently transmit data along descending costs towards the base station along multiple paths. Simulation results show GRAB performs better than CCB and TRCB in terms of network lifetime.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...eSAT Journals
Abstract DTN (Delay Tolerant Network) is a new concept in the field of wireless networks. It enables communication in challenged environment where traditional network fails. Unlike other ad hoc wireless network it does not demand for end to end node connectivity. DTN is based on store carry and forward principle. This mechanism is implemented using bundle protocol. DTN nodes have capabilities such as radio interface, movement, persistent storage, message routing and energy consumption .Here a node might accumulate a message in its buffer and carry it for limited time, waiting till a suitable forwarding opportunity is acquired. Multiple message duplication into the network is done to increase delivery probability. The main objective of DTN Routing is to build a powerful network between various nodes (mobile devices, planetary vehicles etc) so that good delivery probability and less delay are obtained. This unique mechanism poses a security challenge. A sophisticated attack observed is black hole attack in which malicious intermediate node are present in network that can provide attacked forged metrics to another node. The aim of this work is to simulate and analyze routing protocol of DTN when nodes enter in environment with black hole attack. The work has been carried out with ONE (opportunistic network environment) simulator. The performance of routing protocols (RAPID and Spray and Wait) are tested for different number of attacking nodes. The analysis indicates there is decrease in delivery probability, hop count average and buffer time average. But latency average first increases and then start decreasing. The overhead ratio increases using Spray and Wait Protocol but with RAPID protocol, it decreases with increasing black hole attacking nodes. Index Terms: DTN, ONE, etc.
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...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
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
This document summarizes a project seminar presentation on analyzing the performance of the epidemic routing protocol in delay tolerant networks under different mobility models. The key points are:
1) The objective is to evaluate the epidemic routing protocol's delivery probability, overhead ratio, and average buffer time when varying the buffer size and under different mobility models including random waypoint, map-based, shortest path, and map route models.
2) Simulation results show that the shortest path mobility model provides the best performance for the epidemic routing protocol in terms of high delivery probability, low overhead ratio, and efficient buffer usage.
3) Additional analysis varying the number of nodes found that performance is best when more nodes are present and becomes static with
PRoPHET uses its delivery predictability of node encounters and transitivity to forward bundles to its neighbor node. Regardless of their distance, it faces delivery dilemmas in a source node and drawbacks of low delivery ratio and high delay in case two or more neighbor nodes carry equal delivery predictability. To solve such consequences, we propose a Distance and Probabilistic Routing Protocol using History of Encounters and Transitivity (DPRoPHET) with the use of cross layer implementation for distance value retrieval. Our simulation results show that, by adding distance metric to the existing delivery predictability vector, DPRoPHET outperforms PRoPHET.
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
This document summarizes three routing strategies - Cluster and Chain Based (CCB), Transmission Ranges and Chain Based (TRCB), and GRAdient Broadcast (GRAB) - proposed for wireless sensor networks to improve energy efficiency. CCB uses both clustering from LEACH and chain formation from PEGASIS to transmit sensor data to the base station. TRCB uses transmission ranges and distances to transmit sensor data within clusters to heads, which then form chains to the base station. GRAB builds and maintains a cost field to efficiently transmit data along descending costs towards the base station along multiple paths. Simulation results show GRAB performs better than CCB and TRCB in terms of network lifetime.
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.
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.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
Delay Tolerant Network (DTN) is a promising technology which aims to provide efficient
communication between devices in a network with no guaranteed continuous connectivity. Most
of the existing routing schemes for DTNs achieve message delivery through message replication
and forwarding. However, due to the lack of contemporaneous end-to-end communication path,
designing routing protocols that can achieve high delivery rate with low communication
overhead is a challenging problem. Some routing protocols appear with high similarity, but
their performance are significantly different. In this paper, we evaluate several popular routing
protocols in DTNs, including Epidemic, Spray and Wait, PRoPHET, and 3R through extensive
trace-driven simulations. The objective is to evaluate the performance of different routing
schemes using different data traces and investigate the optimal configuration setting for each
routing scheme. This paper provides important guidances on the design and selection of routing
protocols for given delay tolerant networks.
ROUTING PROTOCOLS FOR DELAY TOLERANT NETWORKS: SURVEY AND PERFORMANCE EVALUATIONijwmn
Delay Tolerant Networking (DTN) is a promising technology that aims to provide efficient communication
between devices in a network with no guaranteed continuous connectivity. Most existing routing schemes
for DTNs exploit the advantage of message replication to achieve high message delivery rate. However,
these schemes commonly suffer from large communication overhead due to the lack of efficient mechanisms
to control message replication. In this paper we give a brief survey on routing protocols designed for
DTNs, and evaluate the performance of several representative routing protocols including Epidemic, Spray
and Wait, PRoPHET, and 3R through extensive trace-driven simulations. Another objective of this work is
to evaluate the security strength of different routing schemes under common DTN attacks such as the black
hole attack. The results and analysis presented in this paper can provide useful guidance on the design and
selection of routing protocols for given delay-tolerant applications.
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...cscpconf
Network-wide broadcasting is a fundamental operation for mobile ad hoc networks. Inbroadcasting, a source node sends a message to all other nodes in the network. Under ordinary
flooding procedure, each node transmits the broadcast message to all of its 1-hop downlinkneighbours, i.e. all nodes residing within its radio-range. Receiving the broadcast message all those downlink neighbours reply with an acknowledgement. Since in an ad hoc network a node
may have multiple uplink neighbours, in ordinary flooding procedure, a node is supposed to receive the broadcast message from all those uplink neighbours and send acknowledgement to all of them, generating huge message contention and collision. This is popularly referred to as
the broadcast storm problem. The present article is focused to remove the broadcast redundancy within 2-hop neighbourhood and beyond, as much as possible by prioritizing the 1-
hop downlink neighbours of a node. Priority of a 1-hop downlink neighbour of a node ni increases if it is equipped with a large number of 1-hop downlink neighbours, large radiorange,
high remaining battery power and very small number of uplink neighbours closer to the broadcast source than ni
. ni waits a predefined amount of time to receive proactive
acknowledgements from the 1-hop downlink neighbours having less priority. If it does not receive acknowledgement from those downlink neighbours within the waiting time, it sends the
broadcast message to them. A fuzzy controller named Priority Assignor (PA) is embedded in every node that determines the priority of a 1-hop downlink neighbour. Simulation results firmly
establish that the proposed protocol FP2 B produces high broadcast delivery ratio at muchlesser message cost, compared to other state-of-the-art broadcast algorithms.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Performance Evaluation of Binary Spray and Wait OppNet Protocol in the Contex...Dr. Mazlan Abbas
The document discusses the performance evaluation of the Binary Spray and Wait opportunistic network (OppNet) routing protocol in the context of emergency scenarios. It motivates the use of OppNets for emergency communications when traditional infrastructure is unavailable. Simulation results show that the Binary Spray and Wait protocol achieves good delivery probability and latency. The optimal buffer size is found to be 30MB, and speedier nodes like cars can carry larger message sizes like images but not videos. Future work includes testing the protocol on real emergency scenario data and smartphones.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
This document proposes and evaluates a new routing protocol called Conditional Shortest Path Routing (CSPR) for delay tolerant networks. CSPR uses a new metric called conditional intermeeting time to determine link costs, which measures the average time between two nodes meeting given that one node previously met a third node. Through simulations using real mobility traces, CSPR is shown to achieve higher delivery rates and lower end-to-end delays than existing shortest path routing protocols that use conventional intermeeting times as link costs. The conditional intermeeting time better captures link characteristics and allows for more effective forwarding decisions in routing messages.
Supporting efficient and scalable multicastingingenioustech
The document proposes a new multicast protocol called Efficient Geographic Multicast Protocol (EGMP) to support efficient and scalable multicasting over mobile ad hoc networks. EGMP uses a virtual zone-based structure for scalable group membership management. It constructs a network-wide zone-based bi-directional tree to achieve more efficient membership management and multicast delivery. Several strategies are introduced to improve efficiency, including using zone depth to build an optimal tree structure and integrating location search with membership management. Simulation results show EGMP has high delivery ratio and low overhead under different scenarios, and is scalable to both group size and network size.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
New strategy to optimize the performance of spray and wait routing protocolijwmn
Delay Tolerant Networks have been (DTN) have been developed to support the irregular connectivity often
separate networks. The main routing problem in this type of network is embarrassed by time that is
extremely long, since connections are intermittent and opportunistic. Routing protocols must take into
account the maximum constraint encountered in this type of environment , use effective strategies
regarding the choice of relay nodes and buffer management nodes to improve the delivery of messages and
the time of their delivery . This article proposes a new strategy that optimizes the routing Spray and wait.
The proposed method uses the information contained in the messages delivered mostly paths traversed by
the messages before arriving at their destination and the time when nodes have receive these messages.
Simulation results show that the proposed strategy can increase the probability of delivery and minimizing
overhead unlike FIFO technology used with the default routing ' sprat and wait'
Impact of mobility models on supp tran optimized dtn spray and wait routing p...ijmnct
The delay-tolerant networks (DTN) are networks that support communication between nodes when
connectivity is intermittent, due to the difficulties encountered in this type of environment, such as node
mobility frequently changing network topology, this which does not allow to route messages directly
between the source and destination, the routing algorithms must consider mobility to increase the rate of
message delivery. In our previous work of Supp-Tran we examine that spray and wait router was not
showing good delivery probability in case of SPMBM mobility model and FIFO forwarding strategy
compared to our Supp-Tran strategy.
This paper compares the behavior of the FIFO strategy used by default with spray and wait routing
protocol and that of our Supp-Tran strategy under different type of mobility, to do that the most mobility
models used are chosen to show how mobility model affects the forwarding strategy using as performance
metric such as delivery probability, the number of dropped messages , buffer time average, the overhead
ratio and average number of hops.
1) LEACH is a hierarchical routing protocol for wireless sensor networks that aims to lower energy consumption by forming clusters of nodes and rotating cluster head roles among nodes.
2) The document discusses several enhancements made to the original LEACH protocol to improve network lifetime, throughput, and coverage area, including E-LEACH, EHE-LEACH, and multi-level LEACH.
3) Simulation results show that the enhanced protocols increase network lifetime by 40-49% compared to the original LEACH protocol.
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
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.
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsIDES Editor
In this paper we explore the area of congestion
avoidance in computer networks. We provide a brief overview
of the current state of the art in congestion avoidance and also
list our extension to the TCP congestion avoidance mechanism.
This extension was previously published on an international
forum and in this paper we describe an improved version which
allows multiprotocol support. We list preliminary results
carried out in a simulation environment.
New introduced approach called Advanced Notification
Congestion System (ACNS) allows TCP flows prioritization
based on the TCP flow age and priority carried in the header
of the network layer protocol. The aim of this approach is to
provide more bandwidth for young and high prioritized TCP
flows by means of penalizing old greedy flows with a low
priority. Using ACNS, substantial network performance
increase can be achieved.
Performance evaluation of mofo buffer management technique with different rou...eSAT Journals
Abstract Delay Tolerant Networks (DTNs) uses the store-carry-forward scheme for the delivery of the messages, with this way data transmission can be successfully done despite of the absence of continuous end-to-end paths. The opportunities of message forwarding in such types of networks usually are limited due to the absence of contemporaneous paths. In such networks, the “store-carry-forward” methodology is used for the transmission of the messages to be delivered to their intend destinations in a hop by hop manner. It arises many problems like how to schedule the messages, how to drop the messages in the buffer due to the impulsive nature of the nodes. It also arises many challengeable situations like short contact durations between the two nodes, limited storage capacity of nodes and so on. This paper evaluates the performance of MOFO buffer management technique with three routing protocols i.e. Epidemic, Prophet and MaxProp under variable message buffer sizes (5MB to 40MB). Such evaluation can improve the performance of the opportunistic networks by reducing the overhead ratio, enhancing the delivery rate, minimizing latency average and hop count average in a certain degree. So four performance evaluation metrics namely delivery probability, latency average, overhead ratio and hop count average are used in this study. This study uses ONE (Opportunistic Network Environment) simulator for the performance evaluation of the MOFO buffer management technique and routing protocols. The evaluation results shows that the performance of different protocols can benefit to optimizing the performance of delay tolerant networks in terms of delivery probability, Latency average, Overhead ratio and Hop count average of messages with the increase in message buffer size. Finally, this study suggested that which routing protocol is most suitable with MOFO buffer management technique. Keywords: Delay Tolerant Networks, Buffer Management, Routing Protocols, MOFO, Epidemic, Prophet, MaxProp
This document evaluates different spray-based routing approaches for delay tolerant networks (DTNs). It summarizes the spray and wait routing algorithm and some variants proposed to improve it. The document performs simulations to compare the delivery ratio, overhead ratio, and average latency of the basic spray and wait approaches to variants that incorporate utility metrics or acknowledgements. The results show that a composite method that includes delivery predictability and acknowledgements outperforms the other variants in terms of delivery ratio and average latency.
The document summarizes a research study on the effect of case hardening treatment on the structure and properties of automobile gears. Specifically, it analyzes three gear materials: EN353, 20MNCR5, and SAE8620. The study examines the heat treatment procedures, microstructure, inclusion ratings, hardness gradients, and conclusions. Key findings include that inclusion ratings were within desired limits for all materials, 20MNCR5 showed the highest hardness gradient, and EN353 exhibited a sudden drop in hardness at the case depth of 0.6mm likely due to its lower chromium content.
A production - Inventory model with JIT setup cost incorporating inflation an...IJMER
A production inventory model with Just-In-Time (JIT) set-up cost has been developed in which inflation and time value of money are considered under an imperfect production process. The demand rate is considered to be a function of advertisement cost and selling price. Unit production cost is considered incorporating several features like energy and labour cost, raw material cost and development cost of the manufacturing system. Development cost is assumed to be a function of reliability parameter.
Considering these phenomena, an analytic expression is obtained for the total profit of the model. The model provides an analytical solution to maximize the total profit function.A numerical example is presented to illustrate the model along with graphical analysis. Sensitivity analysis has been carried out to identify the most sensitive parameters of the model.
The magazine uses a bright color scheme and prominent masthead to attract older, loyal viewers interested in weekly television programs. It encourages brand loyalty through its website listed in the masthead and provides value with multiple television program features and images. The largest headline teases a mystery to engage readers in learning more about the main story.
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.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
Delay Tolerant Network (DTN) is a promising technology which aims to provide efficient
communication between devices in a network with no guaranteed continuous connectivity. Most
of the existing routing schemes for DTNs achieve message delivery through message replication
and forwarding. However, due to the lack of contemporaneous end-to-end communication path,
designing routing protocols that can achieve high delivery rate with low communication
overhead is a challenging problem. Some routing protocols appear with high similarity, but
their performance are significantly different. In this paper, we evaluate several popular routing
protocols in DTNs, including Epidemic, Spray and Wait, PRoPHET, and 3R through extensive
trace-driven simulations. The objective is to evaluate the performance of different routing
schemes using different data traces and investigate the optimal configuration setting for each
routing scheme. This paper provides important guidances on the design and selection of routing
protocols for given delay tolerant networks.
ROUTING PROTOCOLS FOR DELAY TOLERANT NETWORKS: SURVEY AND PERFORMANCE EVALUATIONijwmn
Delay Tolerant Networking (DTN) is a promising technology that aims to provide efficient communication
between devices in a network with no guaranteed continuous connectivity. Most existing routing schemes
for DTNs exploit the advantage of message replication to achieve high message delivery rate. However,
these schemes commonly suffer from large communication overhead due to the lack of efficient mechanisms
to control message replication. In this paper we give a brief survey on routing protocols designed for
DTNs, and evaluate the performance of several representative routing protocols including Epidemic, Spray
and Wait, PRoPHET, and 3R through extensive trace-driven simulations. Another objective of this work is
to evaluate the security strength of different routing schemes under common DTN attacks such as the black
hole attack. The results and analysis presented in this paper can provide useful guidance on the design and
selection of routing protocols for given delay-tolerant applications.
FUZZY-CONTROLLED POWER-AWARE PROACTIVE-ACKNOWLEDGEMENT BASED BROADCASTING (FP...cscpconf
Network-wide broadcasting is a fundamental operation for mobile ad hoc networks. Inbroadcasting, a source node sends a message to all other nodes in the network. Under ordinary
flooding procedure, each node transmits the broadcast message to all of its 1-hop downlinkneighbours, i.e. all nodes residing within its radio-range. Receiving the broadcast message all those downlink neighbours reply with an acknowledgement. Since in an ad hoc network a node
may have multiple uplink neighbours, in ordinary flooding procedure, a node is supposed to receive the broadcast message from all those uplink neighbours and send acknowledgement to all of them, generating huge message contention and collision. This is popularly referred to as
the broadcast storm problem. The present article is focused to remove the broadcast redundancy within 2-hop neighbourhood and beyond, as much as possible by prioritizing the 1-
hop downlink neighbours of a node. Priority of a 1-hop downlink neighbour of a node ni increases if it is equipped with a large number of 1-hop downlink neighbours, large radiorange,
high remaining battery power and very small number of uplink neighbours closer to the broadcast source than ni
. ni waits a predefined amount of time to receive proactive
acknowledgements from the 1-hop downlink neighbours having less priority. If it does not receive acknowledgement from those downlink neighbours within the waiting time, it sends the
broadcast message to them. A fuzzy controller named Priority Assignor (PA) is embedded in every node that determines the priority of a 1-hop downlink neighbour. Simulation results firmly
establish that the proposed protocol FP2 B produces high broadcast delivery ratio at muchlesser message cost, compared to other state-of-the-art broadcast algorithms.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Performance Evaluation of Binary Spray and Wait OppNet Protocol in the Contex...Dr. Mazlan Abbas
The document discusses the performance evaluation of the Binary Spray and Wait opportunistic network (OppNet) routing protocol in the context of emergency scenarios. It motivates the use of OppNets for emergency communications when traditional infrastructure is unavailable. Simulation results show that the Binary Spray and Wait protocol achieves good delivery probability and latency. The optimal buffer size is found to be 30MB, and speedier nodes like cars can carry larger message sizes like images but not videos. Future work includes testing the protocol on real emergency scenario data and smartphones.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
This document proposes and evaluates a new routing protocol called Conditional Shortest Path Routing (CSPR) for delay tolerant networks. CSPR uses a new metric called conditional intermeeting time to determine link costs, which measures the average time between two nodes meeting given that one node previously met a third node. Through simulations using real mobility traces, CSPR is shown to achieve higher delivery rates and lower end-to-end delays than existing shortest path routing protocols that use conventional intermeeting times as link costs. The conditional intermeeting time better captures link characteristics and allows for more effective forwarding decisions in routing messages.
Supporting efficient and scalable multicastingingenioustech
The document proposes a new multicast protocol called Efficient Geographic Multicast Protocol (EGMP) to support efficient and scalable multicasting over mobile ad hoc networks. EGMP uses a virtual zone-based structure for scalable group membership management. It constructs a network-wide zone-based bi-directional tree to achieve more efficient membership management and multicast delivery. Several strategies are introduced to improve efficiency, including using zone depth to build an optimal tree structure and integrating location search with membership management. Simulation results show EGMP has high delivery ratio and low overhead under different scenarios, and is scalable to both group size and network size.
A cross layer optimized reliable multicast routing protocol in wireless mesh ...ijdpsjournal
The Optimal way to create a protocol in Wireless Mesh Networks
is to take into account a cross layer due
to the interference among wireless transmissions.
In this paper
,
w
e focus on designing and implementing
a
reliable
multicast protocol
called Me
sh Reliable Multicast Protocol (MRMP).
A
recovery tree
built
dynamically
which is joining with
the multicast routing tree.
U
sing the recovery tree
the packet losses are
repaired locally
.
This Cross layer
Technique
between network layer (
multicast routing)
and transport layer
(
reliability) using simulation
results
prove
the effectiveness
and optimization
of
cross layer
in WMNs
compare with the conventional layer
New strategy to optimize the performance of spray and wait routing protocolijwmn
Delay Tolerant Networks have been (DTN) have been developed to support the irregular connectivity often
separate networks. The main routing problem in this type of network is embarrassed by time that is
extremely long, since connections are intermittent and opportunistic. Routing protocols must take into
account the maximum constraint encountered in this type of environment , use effective strategies
regarding the choice of relay nodes and buffer management nodes to improve the delivery of messages and
the time of their delivery . This article proposes a new strategy that optimizes the routing Spray and wait.
The proposed method uses the information contained in the messages delivered mostly paths traversed by
the messages before arriving at their destination and the time when nodes have receive these messages.
Simulation results show that the proposed strategy can increase the probability of delivery and minimizing
overhead unlike FIFO technology used with the default routing ' sprat and wait'
Impact of mobility models on supp tran optimized dtn spray and wait routing p...ijmnct
The delay-tolerant networks (DTN) are networks that support communication between nodes when
connectivity is intermittent, due to the difficulties encountered in this type of environment, such as node
mobility frequently changing network topology, this which does not allow to route messages directly
between the source and destination, the routing algorithms must consider mobility to increase the rate of
message delivery. In our previous work of Supp-Tran we examine that spray and wait router was not
showing good delivery probability in case of SPMBM mobility model and FIFO forwarding strategy
compared to our Supp-Tran strategy.
This paper compares the behavior of the FIFO strategy used by default with spray and wait routing
protocol and that of our Supp-Tran strategy under different type of mobility, to do that the most mobility
models used are chosen to show how mobility model affects the forwarding strategy using as performance
metric such as delivery probability, the number of dropped messages , buffer time average, the overhead
ratio and average number of hops.
1) LEACH is a hierarchical routing protocol for wireless sensor networks that aims to lower energy consumption by forming clusters of nodes and rotating cluster head roles among nodes.
2) The document discusses several enhancements made to the original LEACH protocol to improve network lifetime, throughput, and coverage area, including E-LEACH, EHE-LEACH, and multi-level LEACH.
3) Simulation results show that the enhanced protocols increase network lifetime by 40-49% compared to the original LEACH protocol.
A Review on Geographical Location Based Energy Efficient Direction Restricted...IJRES Journal
Delay Tolerant Network (DTNs) is a wireless network that experiences frequent connectivity and due to mobility of nodes long duration partitions occurred during transmission of data. DTN has the main feature that there is not full path present from source to destination. In Delay Tolerant Network (DTN), traditional routing protocol for mobile Ad-hoc protocol to be ineffective to extend of message transmission between different nodes. Delay tolerant networks (DTNs) are used in many applications like in deep space communications, under water Acoustic Network, Sparsely Populated Areas Networks Etc. In such network a routing with minimum energy congumption is major issue. In this paper, we try to explore a routing issue in DTN. First energy requirement and routing with their corresponding countermeasures in DTN are explained. Moving nodes in DTN keep the updating of network as well energy at every stage. By using the geographical concept the location of each node is maintained by updating in topology. There are many routing protocols are available for routing purpose in DTN.
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.
Towards Seamless TCP Congestion Avoidance in Multiprotocol EnvironmentsIDES Editor
In this paper we explore the area of congestion
avoidance in computer networks. We provide a brief overview
of the current state of the art in congestion avoidance and also
list our extension to the TCP congestion avoidance mechanism.
This extension was previously published on an international
forum and in this paper we describe an improved version which
allows multiprotocol support. We list preliminary results
carried out in a simulation environment.
New introduced approach called Advanced Notification
Congestion System (ACNS) allows TCP flows prioritization
based on the TCP flow age and priority carried in the header
of the network layer protocol. The aim of this approach is to
provide more bandwidth for young and high prioritized TCP
flows by means of penalizing old greedy flows with a low
priority. Using ACNS, substantial network performance
increase can be achieved.
Performance evaluation of mofo buffer management technique with different rou...eSAT Journals
Abstract Delay Tolerant Networks (DTNs) uses the store-carry-forward scheme for the delivery of the messages, with this way data transmission can be successfully done despite of the absence of continuous end-to-end paths. The opportunities of message forwarding in such types of networks usually are limited due to the absence of contemporaneous paths. In such networks, the “store-carry-forward” methodology is used for the transmission of the messages to be delivered to their intend destinations in a hop by hop manner. It arises many problems like how to schedule the messages, how to drop the messages in the buffer due to the impulsive nature of the nodes. It also arises many challengeable situations like short contact durations between the two nodes, limited storage capacity of nodes and so on. This paper evaluates the performance of MOFO buffer management technique with three routing protocols i.e. Epidemic, Prophet and MaxProp under variable message buffer sizes (5MB to 40MB). Such evaluation can improve the performance of the opportunistic networks by reducing the overhead ratio, enhancing the delivery rate, minimizing latency average and hop count average in a certain degree. So four performance evaluation metrics namely delivery probability, latency average, overhead ratio and hop count average are used in this study. This study uses ONE (Opportunistic Network Environment) simulator for the performance evaluation of the MOFO buffer management technique and routing protocols. The evaluation results shows that the performance of different protocols can benefit to optimizing the performance of delay tolerant networks in terms of delivery probability, Latency average, Overhead ratio and Hop count average of messages with the increase in message buffer size. Finally, this study suggested that which routing protocol is most suitable with MOFO buffer management technique. Keywords: Delay Tolerant Networks, Buffer Management, Routing Protocols, MOFO, Epidemic, Prophet, MaxProp
This document evaluates different spray-based routing approaches for delay tolerant networks (DTNs). It summarizes the spray and wait routing algorithm and some variants proposed to improve it. The document performs simulations to compare the delivery ratio, overhead ratio, and average latency of the basic spray and wait approaches to variants that incorporate utility metrics or acknowledgements. The results show that a composite method that includes delivery predictability and acknowledgements outperforms the other variants in terms of delivery ratio and average latency.
The document summarizes a research study on the effect of case hardening treatment on the structure and properties of automobile gears. Specifically, it analyzes three gear materials: EN353, 20MNCR5, and SAE8620. The study examines the heat treatment procedures, microstructure, inclusion ratings, hardness gradients, and conclusions. Key findings include that inclusion ratings were within desired limits for all materials, 20MNCR5 showed the highest hardness gradient, and EN353 exhibited a sudden drop in hardness at the case depth of 0.6mm likely due to its lower chromium content.
A production - Inventory model with JIT setup cost incorporating inflation an...IJMER
A production inventory model with Just-In-Time (JIT) set-up cost has been developed in which inflation and time value of money are considered under an imperfect production process. The demand rate is considered to be a function of advertisement cost and selling price. Unit production cost is considered incorporating several features like energy and labour cost, raw material cost and development cost of the manufacturing system. Development cost is assumed to be a function of reliability parameter.
Considering these phenomena, an analytic expression is obtained for the total profit of the model. The model provides an analytical solution to maximize the total profit function.A numerical example is presented to illustrate the model along with graphical analysis. Sensitivity analysis has been carried out to identify the most sensitive parameters of the model.
The magazine uses a bright color scheme and prominent masthead to attract older, loyal viewers interested in weekly television programs. It encourages brand loyalty through its website listed in the masthead and provides value with multiple television program features and images. The largest headline teases a mystery to engage readers in learning more about the main story.
Effect of Co doping on the structural and physical properties of SrC4H4O6.3H2...IJMER
Single crystals of strontium tartrate and cobalt doped strontium tartrate crystals were
grown by the single diffusion gel growth technique. The growth conditions were optimized by varying
the parameters such as pH, concentration of the gel, gel setting time and concentration of the reactants.
Silica gel was used as the growth medium with test tubes as crystallization vessels. Crystals having
different morphologies were obtained (transparent and few opaque). The grown crystals were
characterized by carrying out PXRD, SXRD, FTIR spectral, UV-Vis-NIR spectral, SHG, PL spectral,
AAS, microhardness and TG/DTA measurements. The tri hydrate crystals belong to the monoclinic
crystal system and the tetra hydrate crystals belong to orthorhombic crystal system and are optically
transparent, NLO active, mechanically soft and thermally stable up to 100 °C. AAS measurement
revealed the presence of Co atoms in the doped crystals. Results indicate that Co-doping significantly
increases SHG efficiency. Details are presented
The document proposes a strategy for clustering distributed databases using self-organizing maps (SOM) and K-means algorithms. The strategy applies SOM locally to each distributed data set to obtain representative subsets, then combines the results and applies SOM and K-means globally. Specifically, it performs local SOM clustering, sends representative data to a central site, applies SOM again on the combined data, then uses K-means on the unified map to produce the final clustering result.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
The document provides tips for small business marketing to quickly generate revenue. It recommends tapping into an existing customer list by creating a special offer just for customers and sending them an email to re-engage them. Doing this regularly, such as every few weeks, can significantly boost revenue. Maintaining communication with current customers through targeted offers is an untapped opportunity for many small businesses.
El documento describe el Sistema Térmico TABLAROCA® de USG, el cual proporciona aislamiento térmico para viviendas a través de la instalación de materiales como tablero de yeso y lana mineral en muros y techos. El sistema ofrece ahorros de energía de hasta 38% y mantiene las viviendas entre 4-8°C más frescas o calientes. El valor "R" mide la resistencia térmica de los materiales y cuanto mayor es este valor, mejor puede resistir la transferencia de calor.
This document discusses various separation axioms related to rg-open sets. It begins by defining rg-closed sets and rg-limit points. It then introduces concepts such as rg-normal, rg-US, and rg-S1 spaces. The main part of the document characterizes properties of rg-T0 spaces and rg-R0 spaces. It shows several equivalent definitions for these spaces and establishes various properties that hold in such spaces, such as every rg-limit point being a rg-T0-limit point. It also discusses rg-R1 spaces and shows properties that hold in rg-compact rg-R1 spaces, such as being a Baire space.
Hybrid Photovoltaic and thermoelectric systems more effectively converts solar energy into electrical energy. Two sources of energy are used one of the energy is solar,that converts radiant light into electrical energy and heat energy which will convert heat into electricity.Photovoltaic cells and thermoelectric modules are used to capture and convert the energy into electricity.Furthermore solar-thermoelectric hybrid system is environmental friendly and has no harmful emissions.Solar-thermoelectric hybrid system increases the overall reliability without sacrificing the quality of power generated.In this paper an overview of the previous research and development of technological advancement in the solar-thermoelectric hybrid systems is presented.
The document outlines three key steps for search engine internet marketing: 1) Give customers what they want through keyword research and targeting, 2) Use keywords on your website and off your website in content and links, and 3) Continually update and improve your website to engage Google. Following these three steps of focusing on customers, keywords, and ongoing website development will help small businesses succeed with internet marketing and access the large portion of customers searching online.
The document discusses some key patterns in the minds of creative geniuses. It identifies several factors: wasting no time on unproductive activities but instead engaging in self-exploration and learning; developing confidence through challenges; getting children to think through puzzles, games, and problem-solving; ensuring proper diet, nutrition, exercise to get oxygen to the brain; and balancing different learning styles such as visual, auditory, and kinesthetic. The document advocates an active approach to learning that challenges children in a balanced way.
The Centre de Conservation du Livre (CCL) is a non-governmental organization located in Arles, France that provides training, expertise, documentation, and international cooperation in the preservation of documentary heritage collections including books, manuscripts, archives, photographs, and graphic works. CCL offers specialized courses for professionals and coordinates international projects funded by organizations like UNESCO and the European Commission focused on preservation, digitization, and disaster planning. CCL also operates an online digital library called E-Corpus that provides open access to over 500,000 documents from various heritage collections.
Effect of Air Entrainment on Compressive Strength, Density, and Ingredients o...IJMER
The micro air bubbles in concrete mix act as fine aggregates which lead to reduction of the
aggregates. The reduction of fine aggregates will cause reduction of water required for concrete mix
without impairing the strength of concrete mix. This reduction has to be considered in designing an air
entrained concrete mix. Theoretical (equations) and experimental study have been carried out to study the
effect of air entrainment on compressive strength, density and ingredients of fresh concrete mix. During
all the study, water cement ratio (w/c) was maintained constant at 0.5 to study the affection of air
entrainment (a %) on concrete mix. The results have shown substantial decreasing in cement, water,
aggregates and concrete density followed with decreasing in compressive strength of concrete. The results
of this study has given more promising to use it as a guide for concrete mix design to choose the most
appropriate concrete mix design economically.
This document summarizes a research paper about changing land use dynamics in the residential neighborhood of Vani Vilasa Mohalla in Mysore, India. It finds that the neighborhood was originally developed in the 1930s but is now experiencing rapid transformation from solely residential to mixed-use. Land that was originally zoned for housing is being converted to commercial, public, and semi-public uses, increasing density and straining infrastructure. The summary analyzes land use changes from 1960-2012 and housing typology changes over time. It also examines population growth and applies the Hirschmann-Herfindahl model to identify diversity of land use changes.
Michael and his angels fought against Satan and his angels in heaven, casting Satan and his followers out of heaven down to earth. Satan had been in a high position in heaven as a cherub that covered God's throne room, but was found to be in sin. His sin involved peddling some kind of "merchandise" that filled heaven with violence. This caused a war in heaven where Michael and his angels defeated Satan and his followers, casting them out. Approximately one-third of the angels in heaven followed Satan.
Stress Analysis of Precast Prestressed Concrete Beams during LiftingIJMER
The use of long span prestressed beams in bridge construction is very common. Even if the
sections are economical the erection of the beam still poses a challenge in construction. Not much work
has been done in the analysis of stress and deflection at erection stage. This paper deals with the
behavior of precast prestressed beams during lifting. Since the spans of these beams are large, it may
fail due to cracking during erection. In this paper a detailed 3-dimensional Finite Element Analysis of 2
prestressed beam sections was done with incorporating the effect of initial imperfections and prestress.
Results were obtained for both prestressed beam and non-prestressed beam and were compared with
Moen’s formulae. To include the effect of prestressing cables in the beam new additional formulae were
introduced and used in combination with the Moen’s. The results obtained were approximately validated
with the Finite Element Analysis results. It is seen that the prestressing cables have a significant effect
on the behavior of a beam during lifting. For a prestressed beam the overhang length should be kept
minimum for safe erection which is opposite in the case of a normal beam.
This document introduces and studies properties of strongly wgrα-continuous and perfectly wgrα-continuous functions between topological spaces. It shows that if a function is perfectly wgrα-continuous, then it is also perfectly continuous and strongly wgrα-continuous. If a function is strongly wgrα-continuous and the codomain space is T_wgrα, then the function is also continuous. The composition of two perfectly wgrα-continuous functions is also perfectly wgrα-continuous. The document also introduces wgrα-compact and wgrα-connected spaces and studies some of their properties.
Efficient Of Multi-Hop Relay Algorithm for Efficient Broadcasting In MANETSijircee
The document proposes a multi-hop relay algorithm to improve broadcasting efficiency in mobile ad hoc networks (MANETs). It aims to optimize end-to-end delay, packet delivery ratio (PDR), and energy consumption during broadcasting. The algorithm uses source, broadcast, and relay queues at each node to facilitate multi-hop transmissions. It transmits packets using either single-hop, two-hop, or multi-hop relaying depending on the location of the destination node. The algorithm is shown to reduce average end-to-end delay by 3.37%, increase PDR by 1.36%, and reduce average energy consumption per node by 10% compared to previous techniques through simulation experiments.
This document discusses delay tolerant networks (DTNs) and social-aware routing protocols for DTNs. It begins with an overview of DTNs and their characteristics like intermittent connectivity and lack of end-to-end paths. It then describes the DTN architecture including the bundle layer and bundle protocol. Several categories of DTN routing schemes are presented, including message ferry-based, opportunity-based, and prediction-based. Social-aware routing protocols leverage the social ties between nodes to determine message forwarding. Examples discussed include Epidemic Routing, Spray and Wait, and PROPHET. Performance metrics and the ONE simulator are also summarized.
This document discusses delay tolerant networks (DTNs) and social-aware routing protocols for DTNs. It begins with an overview of DTNs and their characteristics like intermittent connectivity and lack of end-to-end paths. It then describes the DTN architecture including the bundle layer and bundle protocol. Several categories of DTN routing schemes are presented, including message ferry-based, opportunity-based, and prediction-based. Social-aware routing protocols leverage the social ties between nodes to determine message forwarding. Examples discussed include Epidemic Routing, Spray and Wait, and PROPHET. Performance metrics and the ONE simulator are also summarized.
An Extensive Literature Review of Various Routing Protocols in Delay Tolerant...IRJET Journal
This document summarizes an extensive literature review on routing protocols in delay tolerant networks (DTNs). It begins by defining DTNs as wireless networks with intermittent connectivity where nodes use a store-carry-forward mechanism. Common routing protocols for DTNs like epidemic, spray and wait, and prophet are described. The document then reviews several papers that propose and evaluate new routing algorithms or improvements for DTNs, analyzing metrics like delivery ratio, overhead, and latency. Key factors considered include node contact histories, social characteristics, energy constraints, and message prioritization. Finally, it suggests the contact duration between nodes could be an important parameter to further optimize routing in DTNs.
Iaetsd a secured based information sharing scheme viaIaetsd Iaetsd
The document proposes a secured based information sharing scheme for delay tolerant networks using smartphones. It suggests using a discover-predict-deliver (DPD) approach for efficient content sharing. Specifically, DPD employs machine learning to identify meaningful locations from a user's mobility patterns using a hidden Markov model. Simulation results show DPD can discover and deliver 87% of content within two hours when only 30% of nodes initially have the content. The document also aims to reduce energy consumption using asymmetric multicore processors and efficient sensor scheduling with probabilistic optimal multi-parameter duty cycles.
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc NetworksIJCNCJournal
When packets are sending in multi-hop mobile unintended networks numerous problems occur like flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of packets simultaneously in MANETs that using the slot assignments approach, when additional channels are transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the mobile ad hoc network for collision control and reliable communication. This paper proposes two new broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced performance within the different environments. Evaluation of simulation results with other well-known exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best within the wireless network and channel bandwidths are well utilized within the network.
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKSIJCNCJournal
When packets are sending in multi-hop mobile unintended networks numerous problems occur like
flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of
packets simultaneously in MANETs that using the slot assignments approach, when additional channels are
transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of
the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and
therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the
mobile ad hoc network for collision control and reliable communication. This paper proposes two new
broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of
efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced
performance within the different environments. Evaluation of simulation results with other well-known
exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best
within the wireless network and channel bandwidths are well utilized within the network.
A Comprehensive Study on Vehicular Ad-Hoc Delay Tolerant Networking for Infra...inventionjournals
Generally, traditional networks presume the presence of some path between endpoints. Today, however, new applications, environments and types of devices are challenging these assumptions. In Delay Tolerant Networks (DTNs), an end-to-end path from source to destination may not exist. Nodes may connect and exchange their information in an opportunistic way. This book represents a broad overview of DTNs, particularly focusing on Vehicular Ad-hoc DTNs, their main characteristics, challenges and our research on this field. In the near future, cars are expected to be equipped with devices that will allow them to communicate wirelessly i.e. Wi-Fi. However, there will be strict restrictions to the duration of their connections with other vehicles, whereas the conditions of their links will greatly vary; DTNs as well as Ad-hoc DTNs present an attractive solution. Therefore, Vehicular Ad-hoc DTNs constitute an attractive research field. For practical implementation, we have used two Android devices for a little range of Wi-Fi. So, by this we are trying to give us better accuracy to go further. Thorough out this document, we have mentioned those techniques we came across and also those techniques and algorithms that we used in our proposed method.
Content Sharing over Smartphone-Based Delay-Tolerant NetworksIJERA Editor
With the growing number of smartphone end users, peer-to-peer ad hoc content giving is likely to occur often. Thus, new articles sharing mechanisms must be developed since traditional information delivery schemes will not be efficient with regard to content sharing due to the sporadic connectivity between smartphones on the market. To obtain data delivery such challenging environments, researchers include proposed the employment of store-carry-forward methodologies, in which a node stores a communication and holds it until a forwarding prospect arises through an encounter together with other nodes. Most past works in this field have dedicated to the conjecture of whether two nodes could encounter the other, without thinking about the place and also time from the encounter. In this particular paper, we propose to her discover-predict-deliver as a possible efficient articles sharing scheme for delay-tolerant touch screen phone networks. In this proposed scheme, contents are usually shared while using the mobility information of people. Specifically, our strategy employs the mobility understanding algorithm to spot places inside your own home and outdoor.
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 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
This document discusses routing strategies in delay tolerant networks (DTNs) using wireless sensor network (WSN) nodes for localization applications. It first provides background on WSNs and DTNs, and then reviews common DTN routing protocols like epidemic routing, PROPHET, spray and wait, and MaxProp. The aim of the dissertation is to propose a new routing protocol for DTNs using WSN nodes where GPS is unavailable. It discusses using a hybrid of knowledge-based and additional node-based routing. The document outlines simulating the proposed filtered flooding protocol in NS-2 to evaluate delivery ratio and delay for a mining activity scenario. Results show delivery ratio is high for small networks but decreases with more nodes, while delay is
This document summarizes a research paper that proposes using two-hop relay with erasure coding to increase message delivery probability in mobile ad hoc networks (MANETs). It develops a finite-state absorbing Markov chain framework to model the message delivery process. Based on this, it derives closed-form expressions for message delivery probability under different message lifetimes and sizes. The key findings are that two-hop relay with erasure coding can improve delivery probability compared to traditional routing, and the probability varies based on message parameters and node density.
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
Enhanced Multicast routing for QoS in delay tolerant networksIRJET Journal
This document summarizes research on enhanced multicast routing protocols for quality of service in delay tolerant networks. It proposes a novel multicast routing approach using the MAODV protocol and compares its performance to existing QBMR and DTN-DM protocols. Delay tolerant networks experience intermittent connectivity and long delays. Store-carry-forward is commonly used for data transfer between nodes. The proposed MAODV protocol improves storage and forwarding capabilities of mobile nodes and bundle message communication to multiple destinations. Its performance is evaluated based on metrics like throughput, routing load, and packet delivery fraction compared to existing protocols.
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
Delay Tolerant Network shows many issues that are exist in traditional network. Opportunistic network emerge as interesting evolution in MANET. Mobile nodes in the opportunistic network communicate with each other even in case of no route connection. In this paper a kiosk (or hub station) that is connected to villages to establish internet connection. Such kiosk is placed where traffic frequency is high. We will use high frequency sensor in vehicles. When passing through kiosk, high frequency sensor will establish connection to kiosk & kiosk will connect villages to internet. This system is very useful in crime information sharing services. As an example, if there are a person who is victim of any crime or in a trouble condition. He/she have mobile devices connect to internet. They send a trouble message which is passed to near kiosk and passed on to vehicles and forward their information to police station. This system is helpful in villages, where network communication is not proper.
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...ijceronline
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.
Comparative Analysis of Different TCP Variants in Mobile Ad-Hoc Network partha pratim deb
The document analyzes the performance of different TCP variants (New Reno, Reno, Tahoe) with MANET routing protocols (AODV, DSR, TORA) through simulation. It finds that in scenarios with 3 and 5 nodes, AODV has better throughput than DSR and TORA for all TCP variants. Throughput decreases for all variants as node count increases. New Reno provides multiple packet loss recovery and is the best choice for AODV in MANETs due to its consistent performance with changes in node count. Further analysis of additional protocols and TCP variants is recommended.
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.
A Study on Translucent Concrete Product and Its Properties by Using Optical F...IJMER
- Translucent concrete is a concrete based material with light-transferring properties,
obtained due to embedded light optical elements like Optical fibers used in concrete. Light is conducted
through the concrete from one end to the other. This results into a certain light pattern on the other
surface, depending on the fiber structure. Optical fibers transmit light so effectively that there is
virtually no loss of light conducted through the fibers. This paper deals with the modeling of such
translucent or transparent concrete blocks and panel and their usage and also the advantages it brings
in the field. The main purpose is to use sunlight as a light source to reduce the power consumption of
illumination and to use the optical fiber to sense the stress of structures and also use this concrete as an
architectural purpose of the building
Developing Cost Effective Automation for Cotton Seed DelintingIJMER
A low cost automation system for removal of lint from cottonseed is to be designed and
developed. The setup consists of stainless steel drum with stirrer in which cottonseeds having lint is mixed
with concentrated sulphuric acid. So lint will get burn. This lint free cottonseed treated with lime water to
neutralize acidic nature. After water washing this cottonseeds are used for agriculter purpose
Study & Testing Of Bio-Composite Material Based On Munja FibreIJMER
The incorporation of natural fibres such as munja fiber composites has gained
increasing applications both in many areas of Engineering and Technology. The aim of this study is to
evaluate mechanical properties such as flexural and tensile properties of reinforced epoxy composites.
This is mainly due to their applicable benefits as they are light weight and offer low cost compared to
synthetic fibre composites. Munja fibres recently have been a substitute material in many weight-critical
applications in areas such as aerospace, automotive and other high demanding industrial sectors. In
this study, natural munja fibre composites and munja/fibreglass hybrid composites were fabricated by a
combination of hand lay-up and cold-press methods. A new variety in munja fibre is the present work
the main aim of the work is to extract the neat fibre and is characterized for its flexural characteristics.
The composites are fabricated by reinforcing untreated and treated fibre and are tested for their
mechanical, properties strictly as per ASTM procedures.
Hybrid Engine (Stirling Engine + IC Engine + Electric Motor)IJMER
Hybrid engine is a combination of Stirling engine, IC engine and Electric motor. All these 3 are
connected together to a single shaft. The power source of the Stirling engine will be a Solar Panel. The aim of
this is to run the automobile using a Hybrid engine
Fabrication & Characterization of Bio Composite Materials Based On Sunnhemp F...IJMER
This document summarizes research on the fabrication and characterization of bio-composite materials using sunnhemp fibre. The document discusses how sunnhemp fibre was used to reinforce an epoxy matrix through hand lay-up methods. Various mechanical properties of the bio-composites were tested, including tensile, flexural, and impact properties. The results of the mechanical tests on the bio-composite specimens are presented. Potential applications of the sunnhemp fibre bio-composites are also suggested, such as in fall ceilings, partitions, packaging, automotive interiors, and toys.
Geochemistry and Genesis of Kammatturu Iron Ores of Devagiri Formation, Sandu...IJMER
The Greenstone belts of Karnataka are enriched in BIFs in Dharwar craton, where Iron
formations are confined to the basin shelf, clearly separated from the deeper-water iron formation that
accumulated at the basin margin and flanking the marine basin. Geochemical data procured in terms of
major, trace and REE are plotted in various diagrams to interpret the genesis of BIFs. Al2O3, Fe2O3 (T),
TiO2, CaO, and SiO2 abundances and ratios show a wide variation. Ni, Co, Zr, Sc, V, Rb, Sr, U, Th,
ΣREE, La, Ce and Eu anomalies and their binary relationships indicate that wherever the terrigenous
component has increased, the concentration of elements of felsic such as Zr and Hf has gone up. Elevated
concentrations of Ni, Co and Sc are contributed by chlorite and other components characteristic of basic
volcanic debris. The data suggest that these formations were generated by chemical and clastic
sedimentary processes on a shallow shelf. During transgression, chemical precipitation took place at the
sediment-water interface, whereas at the time of regression. Iron ore formed with sedimentary structures
and textures in Kammatturu area, in a setting where the water column was oxygenated.
Experimental Investigation on Characteristic Study of the Carbon Steel C45 in...IJMER
In this paper, the mechanical characteristics of C45 medium carbon steel are investigated
under various working conditions. The main characteristic to be studied on this paper is impact toughness
of the material with different configurations and the experiment were carried out on charpy impact testing
equipment. This study reveals the ability of the material to absorb energy up to failure for various
specimen configurations under different heat treated conditions and the corresponding results were
compared with the analysis outcome
Non linear analysis of Robot Gun Support Structure using Equivalent Dynamic A...IJMER
Robot guns are being increasingly employed in automotive manufacturing to replace
risky jobs and also to increase productivity. Using a single robot for a single operation proves to be
expensive. Hence for cost optimization, multiple guns are mounted on a single robot and multiple
operations are performed. Robot Gun structure is an efficient way in which multiple welds can be done
simultaneously. However mounting several weld guns on a single structure induces a variety of
dynamic loads, especially during movement of the robot arm as it maneuvers to reach the weld
locations. The primary idea employed in this paper, is to model those dynamic loads as equivalent G
force loads in FEA. This approach will be on the conservative side, and will be saving time and
subsequently cost efficient. The approach of the paper is towards creating a standard operating
procedure when it comes to analysis of such structures, with emphasis on deploying various technical
aspects of FEA such as Non Linear Geometry, Multipoint Constraint Contact Algorithm, Multizone
meshing .
Static Analysis of Go-Kart Chassis by Analytical and Solid Works SimulationIJMER
This paper aims to do modelling, simulation and performing the static analysis of a go
kart chassis consisting of Circular beams. Modelling, simulations and analysis are performed using 3-D
modelling software i.e. Solid Works and ANSYS according to the rulebook provided by Indian Society of
New Era Engineers (ISNEE) for National Go Kart Championship (NGKC-14).The maximum deflection is
determined by performing static analysis. Computed results are then compared to analytical calculation,
where it is found that the location of maximum deflection agrees well with theoretical approximation but
varies on magnitude aspect.
In récent year various vehicle introduced in market but due to limitation in
carbon émission and BS Séries limitd speed availability vehicle in the market and causing of
environnent pollution over few year There is need to decrease dependancy on fuel vehicle.
bicycle is to be modified for optional in the future To implement new technique using change in
pedal assembly and variable speed gearbox such as planetary gear optimise speed of vehicle
with variable speed ratio.To increase the efficiency of bicycle for confortable drive and to
reduce torque appli éd on bicycle. we introduced epicyclic gear box in which transmission done
throgh Chain Drive (i.e. Sprocket )to rear wheel with help of Epicyclical gear Box to give
number of différent Speed during driving.To reduce torque requirent in the cycle with change in
the pedal mechanism
Integration of Struts & Spring & Hibernate for Enterprise ApplicationsIJMER
This document discusses integrating the Spring, Struts, and Hibernate frameworks to develop enterprise applications. It provides an overview of each framework and their features. The Spring Framework is a lightweight, modular framework that allows for inversion of control and aspect-oriented programming. It can be used to develop any or all tiers of an application. The document proposes an architecture for an e-commerce website that integrates these three frameworks, with Spring handling the business layer, Struts the presentation layer, and Hibernate the data access layer. This modular approach allows for clear separation of concerns and reduces complexity in application development.
Microcontroller Based Automatic Sprinkler Irrigation SystemIJMER
Microcontroller based Automatic Sprinkler System is a new concept of using
intelligence power of embedded technology in the sprinkler irrigation work. Designed system replaces
the conventional manual work involved in sprinkler irrigation to automatic process. Using this system a
farmer is protected against adverse inhuman weather conditions, tedious work of changing over of
sprinkler water pipe lines & risk of accident due to high pressure in the water pipe line. Overall
sprinkler irrigation work is transformed in to a comfortableautomatic work. This system provides
flexibility & accuracy in respect of time set for the operation of a sprinkler water pipe lines. In present
work the author has designed and developed an automatic sprinkler irrigation system which is
controlled and monitored by a microcontroller interfaced with solenoid valves.
On some locally closed sets and spaces in Ideal Topological SpacesIJMER
This document introduces and studies the concept of δˆ s-locally closed sets in ideal topological spaces. Some key points:
- A subset A is δˆ s-locally closed if A can be written as the intersection of a δˆ s-open set and a δˆ s-closed set.
- Various properties of δˆ s-locally closed sets are introduced and characterized, including relationships to other concepts like generalized locally closed sets.
- It is shown that a subset A is δˆ s-locally closed if and only if A can be written as the intersection of a δˆ s-open set and the δˆ s-closure of A.
- Theore
Intrusion Detection and Forensics based on decision tree and Association rule...IJMER
This paper present an approach based on the combination of, two techniques using
decision tree and Association rule mining for Probe attack detection. This approach proves to be
better than the traditional approach of generating rules for fuzzy expert system by clustering methods.
Association rule mining for selecting the best attributes together and decision tree for identifying the
best parameters together to create the rules for fuzzy expert system. After that rules for fuzzy expert
system are generated using association rule mining and decision trees. Decision trees is generated for
dataset and to find the basic parameters for creating the membership functions of fuzzy inference
system. Membership functions are generated for the probe attack. Based on these rules we have
created the fuzzy inference system that is used as an input to neuro-fuzzy system. Fuzzy inference
system is loaded to neuro-fuzzy toolbox as an input and the final ANFIS structure is generated for
outcome of neuro-fuzzy approach. The experiments and evaluations of the proposed method were
done with NSL-KDD intrusion detection dataset. As the experimental results, the proposed approach
based on the combination of, two techniques using decision tree and Association rule mining
efficiently detected probe attacks. Experimental results shows better results for detecting intrusions as
compared to others existing methods
Natural Language Ambiguity and its Effect on Machine LearningIJMER
This document discusses natural language ambiguity and its effect on machine learning. It begins by introducing different types of ambiguity that exist in natural languages, including lexical, syntactic, semantic, discourse, and pragmatic ambiguities. It then examines how these ambiguities present challenges for computational linguistics and machine translation systems. Specifically, it notes that ambiguity is a major problem for computers in processing human language as they lack the world knowledge and context that humans use to resolve ambiguities. The document concludes by outlining the typical process of machine translation and how ambiguities can interfere with tasks like analysis, transfer, and generation of text in the target language.
Today in era of software industry there is no perfect software framework available for
analysis and software development. Currently there are enormous number of software development
process exists which can be implemented to stabilize the process of developing a software system. But no
perfect system is recognized till yet which can help software developers for opting of best software
development process. This paper present the framework of skillful system combined with Likert scale. With
the help of Likert scale we define a rule based model and delegate some mass score to every process and
develop one tool name as MuxSet which will help the software developers to select an appropriate
development process that may enhance the probability of system success.
Material Parameter and Effect of Thermal Load on Functionally Graded CylindersIJMER
The present study investigates the creep in a thick-walled composite cylinders made
up of aluminum/aluminum alloy matrix and reinforced with silicon carbide particles. The distribution
of SiCp is assumed to be either uniform or decreasing linearly from the inner to the outer radius of
the cylinder. The creep behavior of the cylinder has been described by threshold stress based creep
law with a stress exponent of 5. The composite cylinders are subjected to internal pressure which is
applied gradually and steady state condition of stress is assumed. The creep parameters required to
be used in creep law, are extracted by conducting regression analysis on the available experimental
results. The mathematical models have been developed to describe steady state creep in the composite
cylinder by using von-Mises criterion. Regression analysis is used to obtain the creep parameters
required in the study. The basic equilibrium equation of the cylinder and other constitutive equations
have been solved to obtain creep stresses in the cylinder. The effect of varying particle size, particle
content and temperature on the stresses in the composite cylinder has been analyzed. The study
revealed that the stress distributions in the cylinder do not vary significantly for various combinations
of particle size, particle content and operating temperature except for slight variation observed for
varying particle content. Functionally Graded Materials (FGMs) emerged and led to the development
of superior heat resistant materials.
Energy Audit is the systematic process for finding out the energy conservation
opportunities in industrial processes. The project carried out studies on various energy conservation
measures application in areas like lighting, motors, compressors, transformer, ventilation system etc.
In this investigation, studied the technical aspects of the various measures along with its cost benefit
analysis.
Investigation found that major areas of energy conservation are-
1. Energy efficient lighting schemes.
2. Use of electronic ballast instead of copper ballast.
3. Use of wind ventilators for ventilation.
4. Use of VFD for compressor.
5. Transparent roofing sheets to reduce energy consumption.
So Energy Audit is the only perfect & analyzed way of meeting the Industrial Energy Conservation.
An Implementation of I2C Slave Interface using Verilog HDLIJMER
This document describes the implementation of an I2C slave interface using Verilog HDL. It introduces the I2C protocol which uses only two bidirectional lines (SDA and SCL) for communication. The document discusses the I2C protocol specifications including start/stop conditions, addressing, read/write operations, and acknowledgements. It then provides details on designing an I2C slave module in Verilog that responds to commands from an I2C master and allows synchronization through clock stretching. The module is simulated in ModelSim and synthesized in Xilinx. Simulation waveforms demonstrate successful read and write operations to the slave device.
Discrete Model of Two Predators competing for One PreyIJMER
This paper investigates the dynamical behavior of a discrete model of one prey two
predator systems. The equilibrium points and their stability are analyzed. Time series plots are obtained
for different sets of parameter values. Also bifurcation diagrams are plotted to show dynamical behavior
of the system in selected range of growth parameter
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...Zilliz
Join us to introduce Milvus Lite, a vector database that can run on notebooks and laptops, share the same API with Milvus, and integrate with every popular GenAI framework. This webinar is perfect for developers seeking easy-to-use, well-integrated vector databases for their GenAI apps.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Full-RAG: A modern architecture for hyper-personalizationZilliz
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
20 Comprehensive Checklist of Designing and Developing a WebsitePixlogix Infotech
Dive into the world of Website Designing and Developing with Pixlogix! Looking to create a stunning online presence? Look no further! Our comprehensive checklist covers everything you need to know to craft a website that stands out. From user-friendly design to seamless functionality, we've got you covered. Don't miss out on this invaluable resource! Check out our checklist now at Pixlogix and start your journey towards a captivating online presence today.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
1. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.4, July-Aug. 2012 pp-1732-1735 ISSN: 2249-6645
Effective routing protocols for delay tolerant network
Sukhbirl, Dr. Rishipal Singh2
1
M.Tech Student, 2Assistant Prof. CSE Deptt.
Guru jambheshwar university science & technology, hisar
Abstract: Delay-tolerant Networking (DTN) enables
communication in sparse mobile ad-hoc networks and
other challenged environments where traditional
networking fails and new routing and application
protocols are required. Past experience with DTN routing
and application protocols has shown that their
performance is highly dependent on the underlying
mobility and node characteristics. Evaluating DTN
protocols across many scenarios requires suitable
simulation tools. This paper presents the existing routing
protocols techniques and Comparative study of existing Figure 1: Time Evolving Behavior of the Network
routing protocols of Delay-Tolerant Networks based upon efficiently.
the metrics like Overhead Ratio, Hop Count and Buffer
Size. DTN follow store carry and forward approach.
Node should carry the message until proper custodian is
I. INTRODUCTION not found. Because of resource limitation each node in
Delay tolerant networks are an emerging field of DTN has some fix size of buffer. Node store the message
networks that show some different characteristics from in its own buffer until the next custodian is found in the
today’s internet such as intermittent connectivity, long path towards the destination. As the buffer size is limited
delays etc. Delay tolerant networks arise in a variety of node should follow some policy to decide which message
situation like disaster relief, military rescue operations, is dropped when the buffer size is full. Develop an
rural internet access etc. There are some critical situations algorithm and a weight function to make this decision that
where the ability to communicate make a significant effectively choose message to be dropped. As a result
difference for human lives. In DTN decision to drop a proposed algorithm has been compare with already
message is taken on several constraints like size of existing DROP FRONT policy. The approach better
message, no of copies, time to live and buffer size etc. results in terms of delivery probability, buffer time avg
In DTN, end to end path is very rare and unstable in nature and Hop count avg..
and opportunity to establish complete route is negligible.
DTN support those applications, whose time requirement II. RELATED WORK
is hours or even day or longer. It is necessary to deliver The major objective of routing in DTNs is to deliver
high priority message during “contact” phase [1]. DTN packets from the source to the destination by means of the
enable communication by taking advantage of Temporary mobility of nodes. Since the end-to-end path may not be
connections to relay data in a fashion similar to Postal available, routing schemes have to optimize data
network instead of requiring an end to end network path to dissemination by utilizing the connectivity information
be available. and network conditions maintained by each node. For
However communication in DTN is a very challenging example, in [3], the routing scheme based on the estimates
task. Traditional network simply assume a complete of the average inter contact time between the mobile nodes
connected graph should be there and a period of time that in the network was proposed. This routing scheme was
is long enough to allow communication. In DTN there designed to minimize the packet delivery time. The
might not even be end to end path between a pair of nodes routing properties in terms of loop-free forwarding and
at any moment of time as shown in the figure 1 [2]. Due to polynomial convergence were studied, which ensure the
this unique feature of DTN, existing routing algorithm that performance of the packet delivery in DTNs. In [4], the
are developed for Internet and MANETS do not packet-delivery scheme based on the super node
performing well. Reason for this is that all these algorithm architecture and epidemic routing was introduced. With
assume that the network is connected and end to end path epidemic routing, the packets are forwarded to other
exist between each pair of nodes. DTN are often resource contacted nodes (i.e., nodes with a direct connection).
limited and not able to deliver required performance in Unlike traditional epidemic routing, the packets are
case of intermittent connectivity. Due to given resource forwarded to the super nodes to improve the performance
limitation and uncertainty in DTN it is very difficult to and reduce overhead. The super nodes are then responsible
deliver data. in carrying the packets to the destination.
www.ijmer.com 1732 | Page
2. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.4, July-Aug. 2012 pp-1732-1735 ISSN: 2249-6645
III. ROUTING PROTOCOLS The Epidemic and The Spray and Wait routing
(a) First contact: – This is simplest strategy to transmit protocols forward messages without taking node mobile
the data from source to destination in DTN. This transmit patterns into consideration, therefore the delivery utility is
message immediately as soon as the source and destination too low.
come in contact with each other directly. This is possible Now present the notion of QoN. QoN indicates the
when the source and destination are one hop apart or activity of a node, or the number one node meets other
immediately neighbor of each other. different nodes within a given interval. In the same period
(b) Direct delivery:- Scheme lets the source hold the data of time, the more nodes that one node meets, the greater
until it comes in contact with the destination. This simple the QoN. The variation of QoN can dynamically
strategy uses one message transmission. It is a degenerate represents the node activity in a given period of time.
case of flooding family, requiring no info about network
but requires a direct path between source and destination. V. Drop policy algorithm
Hence if no contact occurs, message is not delivered. Let us assume
(c) ProPHET:-Improve the routing performance by n= number of nodes in the network
adopting the probabilistic scheme that reflects the contact t= number of digits in n
observation of nodes. However, the single copy Bavail=buffer available at particular node
forwarding based on the probability may affect to the Mnew=new message
performance with limitation of the initial probability Snew=size of new incoming message
distribution and a message drop. The limited buffer space Ni(t)=no copies of message i at time t
and use of an ACK message should be investigated to Ttl= time to live /*time duration in which message is live
enhance the performance further. means message is useful only this time duration */
Finally, although Spray and Wait can overcome the Rtli=remaing time to live of message for message i
shortcomings of Epidemic routing protocol, the usability
of the wait phase with an efficient single copy forwarding 5.1 Proposed Algorithm
scheme and the optimal decision of an initial spray number When two nodes communicate with each other they share
are open issues. message to each other. It might be possible when they
(d) Spray and Wait:- The operation of Spray and Wait communicate the buffer available is not enough to
consists of two phases: accommodate a new message. At that time scheduling take
the spray phase and the wait phase. In the spray phase, place. Each node have two options at that moment of time:
when a node generates a message, the node makes N first it will discard a new message and second one is that it
copies of the message to spread it to relay nodes. When the will drop some message from its buffer and make some
node meets the other node, the node checks N (i.e., N > 1). room for the new message.
If the node has the spray message, the node hands over the Until now all DTN routing protocol follow the DROP
message and revised N (i.e., N/2) to the other node. After FRONT message approach in which they drop message
the spray phase is finished, each of N nodes carrying a from the front of nodes buffer queue.
message copy performs the direct message transmission
until it successfully delivered the message to the 5.2 Weight function
destination. This function value makes the decision to drop a message
(e) Epidemic Routing: - Epidemic routing is an early from the node buffer. This weight function consider
sparse network routing protocol proposed for DTN. It various properties of the message and node. As a result it
assumes that each node has unlimited storage space and gives a value on basis of that a node drop a particular
bandwidth. Therefore every node can store all the message whose value is minimum.
messages transmitted during "contact" phase. This use the Let N= no of nodes in the network
concept of database replication also a relay node can MaxTTL= maximum value of time to live of any node in
exchange the entire message during "contact" phase. Each the network
node maintains list of messages in the database called While(Snew>Bavail)
summary vector. {
Mid=call message equal (Snew); /* Search those message
IV. Dynamic Spray and Wait with Quality of in the buffer of node whose size is equal to or greater then
Node (QoN) the size of incoming new message. This function will
return the message id of those messages who will be drop
4.1. Delivery utility according to SRT algo */
When delivery rate stay the same, consider the relationship Bavail=Bavail+ MessageCollection.get(MID).Size();
between network overhead and delivery utility. Delivery Delete MessageCollection.get(MID);
utility is defined as the ratio of the number of messages }
received by destination nodes to the number of messages /* Body of the function call messageEqual(Snew) */
forwarded by relay nodes, as shown in Equation Int callmessageEqual(Snew)
(1). {
Messages of received For (each message M in node buffer)
delivery_utility=-------------------------------- {
Messages of forwarded If (Mni>=Snew)
4.2. The definition of Quality of Node (QoN) Add MessageCollection m; /* message id */}
}
www.ijmer.com 1733 | Page
3. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.4, July-Aug. 2012 pp-1732-1735 ISSN: 2249-6645
/* Then apply a weight function on MessageCollection m.
*/
float F,F1,α;
/* initially F1 contain the function value (F) of m0
message */
int MessageId;
While (MessageCollection m)
{
F=a*(size of message)+ b/N *(no of copies) + c/MaxTTL
a=b+α+1;
α = 1/n
b=10n; Figure 2: Drop Front, SRT Drop Delivery Probability
c =RTLi /* remaining time to live */ W.R.T to Routers
If (F<F1)
{ 7.2 Comparison Based on Buffer Time Average
F1=F; Figure 3 indicates that the buffer time average for SRT
Messageid=MessageCollection.get(F); DROP and DROP FRONT policy for various routers. The
} value of buffer time average is large in SRT drop as
Return MessageId; compared to DROP FRONT. High value of buffer time
average increase the probability of message delivery in the
} DTN paradigm. High value of buffer time average also
VI. SIMULATION decreases the drop ratio. Figure 3 shows that SRT DROP
One is an agent based discrete event simulator increases the buffer time average as compared to DROP
engine. The main functions of one simulator are the FRONT.
modeling of node movement, inter node contact, routing
and message handling. Analysis of the result are done
through visualization or reports. Movement models are
used to implement the node movement.
Connectivity between the nodes depends on their location
and communication range. Routing modules are used to
implement the routing function that decide which message
to forward. Finally the message are generated through
event generator. The graphical user interface(GUI)
displays a visualization of the simulation.
VII. RESULTS Figure 3: Drop Front, SRT Drop Buffer Time Avg. W.R.T
The results given below indicate the comparative study to Routers
between DROP FRONT and SRT. The results show the
comparison between DROP FRONT and SRT drop policy. 7.3 Comparison Based on Overhead Ratio
These results prove that it is beneficial to use SRT drop The overhead ratio with respect to various routers has been
policy as it improves the performance of any DTN. plotted in figure 4 for SRT DROP and DROP FRONT.
The results show that the SRT DROP is less in terms of
7.1 Comparison Based on Delivery Probability overhead ratio in all routers. Overhead ratio in DIRECT
The comparative study of DROP FRONT and SRT DROP DELIVERY router is zero due to direct transmission while
policy with respect to delivery probability has been plotted the overhead ratio is decreases in epidemic, prophet, fc,
in the figure 2. The DROP FRONT policy drops the front spray and waits up to a significant level. SRT DROP less
messages from the buffer; however the SRT drops the no of messages as compare to DROP FRONT because it
bigger size message. But in case of FIRST CONTACT and drop the message of nearly greater or equal size of
DIRECT DELIVERY router the probability of encounter messages.
is less as a result the delivery probability is not increasing
significant as compared to previous results.
Figure 4: Drop Front, SRT Drop Overhead Ratio W.R.T to
Routers
www.ijmer.com 1734 | Page
4. International Journal of Modern Engineering Research (IJMER)
www.ijmer.com Vol.2, Issue.4, July-Aug. 2012 pp-1732-1735 ISSN: 2249-6645
Delay-Tolerant Wireless Sensor Networks” IEEE 978-1-
7.4 Comparison Based on Packet Dropped 4244-3750-4-2009
The results in the figure 5 show that the SRT DROP drops [2] Z. Zhang, Routing in Intermittently Connected Mobile Ad
less no. of messages as compared to DROP FRONT Hoc Networks and Delay Tolerant Networks: Overview
and Challenges, in IEEE Commun. Surveys , vol. 8, no.1,
because it drops the message of nearly greater or equal
1st Quarter 2006.
size of messages. Therefore, the network overhead also [3] V. Conan, J. Leguay, and T. Friedman, “Fixed point
decreases. opportunistic routing in delay tolerant networks,” IEEE J.
Sel. Areas Commun., vol. 26, no. 5, pp. 773–782, Jun.
2008.
[4] H. Samuel, W. Zhuang, and B. Preiss, “Routing over
interconnected heterogeneous wireless networks with
intermittent connections,” in Proc. IEEE ICC, May 2008,
pp. 2282–2286.
[5] E.P.C. Jones and P.A.S. Ward, “Routing Strategies for
Delay-Tolerant Networks”, Computer Communications,
2008
[6] U. Lee, S.Y. Oh, K.W. Lee, M.Gerla, “RelayCast: scalable
Multicast Routing in Delay Tolerant Networks”, IEEE,
2008
[7] J. Burgess, B. Gallagher, D. Jensen and B.N. Levine,
Figure 5: Drop Front,SRT Drop Packet Drop W.R.T to “MaxProp: Routing for Vehicle-Based Disruption-tolerant
Routers Networks”, Proc. Of IEEE INFOCOM, April 2006
7.5 Comparison Based on Hop Count Avg. [8] A. Lindgren, A. Doria, O. Schelen, “Probabilistic Routing
Figure 6 shows the hop count for various routers for SRT in Intermittently Connected Networks”, ACM
DROP and DROP FRONT policy. The lower value of hop SIGMOBILE Mobile Computing and Communications
count means that message has consumed less resource to Review, Vol. 7, Issue 3, pp. 19-20, July, 2003
[9] A. Balasubramanian, B.N. Levine, and A.Venkataramani,
reach its destination. SRT DROP drops the messages
“DTN Routing as a Resource Allocation Problem”, Proc.
whose size is nearly equal to the incoming message. Due of ACM SIGCOMM, Aug 2007
to this logic it will drop less no of messages and decreases [10] J. Shen, S. Moh, and I. Chung, “Routing Protocols in
the value of hop count average. Delay Tolerant Networks: A Comparative Survey”, 23rd
International Conference on Circuits/Systems, Computers
and Communications, (ITC-CSCC 2008)
[11] E.P.C. Jones, L.Li, P.A.S. Ward, “Practical Routing in
Delay-Tolerant Networks”, IEEE Transactions on Mobile
Computing, Vol. 6, No. 8, Aug 2007
[12] G. Sandulescu and S.N. Tehrani, “Opportunistic DTN
Routing with Window-aware Adaptive replication” Proc.
of ACM on AINTEC, Nov 2008
[13] C. Liu and J. Wu, “Scalable Routing in Delay tolerant
Networks”, Proc. of ACM on MobiHoc, Vol. 9, No. 14,
pp. 51-60, Sep 2007
[14] M. Demmer, K. FSR: “DTLSR: Delay Tolerant routing for
Figure 6: Drop Front,SRT Drop Hop Count W.R.T to Developing Regions”, Proc. of ACM on NDSR, 2007
Routers [15] B. Burns, O. Brook, B.N. Levine, “MORA routing and
VIII. CONCLUSION Capacity Building in Disruption-Tolerant Networks”
In this paper investigated SRT DROP policy with [16] Y. Liao, K. Tan, Z. Zhang and L. Gao, “Estimation based
DROP FRONT policy with respect to DTN routing Erasurecoding routing in Delay tolerant Networks” Proc.
of IWCMC, July 2006
protocols. Results shows that our SRT DROP policy [17] L. J. Chen, C.H. Yu, T. Sun, Y.C. Chen and H.H. Chu, “A
perform well with respect to delivery probability, buffer Hybrid Routing Approach for Opportunistic Networks”,
time, overhead ratio, hop count average and packet Proc. of ACM SIGCOMM on Challenged Networks, 2006
dropped. It should motivate to examine SRT DROP policy [18] D. Marasigan and P. Rommel, “MV routing and capacity
to other existing drop policy. building in disruption tolerant networks,” in Proceedings
Compare the SRT DROP POLICY with DROP FRONT of IEEE INFOCOM, vol. 1, pp. 398–408, March 2005.
policy. This comparison motivate to compare SRT DROP [19] Q. Li and D. Rus, “Sending messages to mobile users in
policy with DROP LARGEST POLICY because both disconnected ad-hoc wireless networks,” in Proceedings of
policy gives importance to size of messages. The routing ACM MobiCom, pp. 44–55, August 2000.
[20] W. Zhao, M. Ammar, and E. Zegura, “A message ferrying
protocol other then the EPIDEMIC, FC, DIRECT
approach for data delivery in sparse mobile ad hoc
DELIVERY, SPRAY ANDWAIT and PROPHET routing networks,” in Proceedings of ACM MobiHoc, (New York,
protocols are also an interesting direction of work. NY, USA), pp. 187–198, ACM Press, May 2004.
[21] W. Zhao, M. Ammar, and E. Zegura, “Controlling the
REFERENCES mobility of multiple data transport ferries in a delay-
[1] Abbas Nayebi, Hamid Sarbazi-Azad, and Gunnar Karlsson tolerant network,” in Proceedings of IEEE INFOCOM,
Sharif University of Technology, Tehran, Iran Royal vol. 2, pp. 1407–1418 vol. 2, April 2005.
Institutc of Technology(KTH) Stockholm, Sweden
“Routing, Data Gathering, and Neighbor Discovery in
www.ijmer.com 1735 | Page