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
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.
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 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.
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.
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.
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.
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
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.
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.
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
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
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.
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.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Opportunistic Networking: Extending Internet Communications Through Spontaneo...Waldir Moreira
The increasing number of personal devices with wireless communication capabilities makes it possible the creation of spontaneous networks in which devices communicate occasionally depending on contact opportunities. This intermittent communication may be due to mobility and power-limitations of devices, physical obstacles and distance, resulting in the possible nonexistence of end-to-end paths toward a destination. In summary, spontaneous networks are characterized by being highly dynamic, composed of mobile and static nodes that are able to take advantage of opportunistic time-varying contacts.
This tutorial aims to give an introduction to the challenges and research issues behind the development of
opportunistic networking solutions able to boost the deployment of spontaneous networks. Special attention will be
given to the fundamental building block: routing over opportunistic networks. Since the effciency of spontaneous
networks depends upon the way contacts occur between carriers of communication devices, special attention will
also be given to the analysis of method to detect social structures based on opportunistic contacts. To emphasize
the impact that opportunistic networking technology may have, this tutorial ends up with the description of major
aspects of future forwarding schemes: interest-based and information-centric forwardings.
This presentation was given as a tutorial in the IEEE 3rd Latin-American Conference on Communications (LATINCOM), on Oct 26th, 2011, in Belém/PA, Brazil.
http://www.ieee-latincom.ufpa.br/
Exploiting Wireless Networks, through creation of Opportunity Network – Wirel...ijasuc
Spotting Opportunity today and recognizing the same is the vision of the expert. The wireless
communication network regime is one such environment that offers such a platform for many working
scientific, academic and engineering experts. Henceforth, “Opportunistic-network” is a recent evolution
of the above said phenomena in the wireless community. They function by spontaneous cooperation &
coordination giving birth to a special type network called wireless-mobile-adhoc-network (W-MAN). As
said, these networks are formed instantaneously in a random manner – breaking the conventional
mathematically evolved algorithms’, and provided the quintessential of a network(s) that exist in
neighbourhood(s) or approachable limits. Is more of situational based, exploited for specialized purpose
or advantage, which mimics all the characteristic of a well evolved network. Such networks, lack an endto-end path, contact, cooperation and coordination; which is mainly opportunity based, and break or
even disintegrate soon after discovery, thus the challenge lay in integration, construction and probable
sustenance or even mid-way reconstruction till purpose. One can cite many realistic scenarios fitting to
this situation. For example, wildlife tracking sensor networks, military networks, vehicular ad hoc
networks to mention a few. To transmit information under such circumstances/scenarios researchers have
proposed various efficient forwarding (single copy), replication routing and controlled based schemes. In
this paper, we propose to explore, investigate and analyze most of the schemes [1] [2] [3] [4] [5] [6] and
present the findings of the said scheme by consolidating critical parameters and issues and towards the
end of this paper, algorithms, possible solutions to deal with such complex and dynamic situations
through W-MAN scheme suggested by us.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
SocialDTN: a DTN Implementation for Digital and Social InclusionWaldir Moreira
SocialDTN is also part of the DTN-Amazon project fruit of a partnership between SITILabs and GERCOM/UFPA. This presentation introduces this DTN implementation for digital and social inclusion.
This presentation was given on my behalf by Dr. Cerqueira in the ACM MobiCom Workshop on Lowest Cost Denominator Networking for Universal Access (LCDNet 2013), on September 30th, 2013 in Miami, USA.
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.
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.
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
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.
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.
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
Hexagonal based Clustering for Reducing Rebroadcasts in Mobile Ad Hoc NetworksIJTET Journal
Abstract— In mobile ad hoc networks multihop routing is performed in order to communicate the packets from the source to destination. The nodes within these networks are dynamic due which frequent path change occurs which can cause frequent link breakages and induces route discoveries. These route discoveries can introduce overhead in terms of contention, collision and rebroadcasts which are non-negligible. Here, the paper discusses a hexagonal based clustering for reducing rebroadcasts thus maximizing the lifetime of the networks and providing coverage area thus reducing the end – end delays.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
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.
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.
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.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Opportunistic Networking: Extending Internet Communications Through Spontaneo...Waldir Moreira
The increasing number of personal devices with wireless communication capabilities makes it possible the creation of spontaneous networks in which devices communicate occasionally depending on contact opportunities. This intermittent communication may be due to mobility and power-limitations of devices, physical obstacles and distance, resulting in the possible nonexistence of end-to-end paths toward a destination. In summary, spontaneous networks are characterized by being highly dynamic, composed of mobile and static nodes that are able to take advantage of opportunistic time-varying contacts.
This tutorial aims to give an introduction to the challenges and research issues behind the development of
opportunistic networking solutions able to boost the deployment of spontaneous networks. Special attention will be
given to the fundamental building block: routing over opportunistic networks. Since the effciency of spontaneous
networks depends upon the way contacts occur between carriers of communication devices, special attention will
also be given to the analysis of method to detect social structures based on opportunistic contacts. To emphasize
the impact that opportunistic networking technology may have, this tutorial ends up with the description of major
aspects of future forwarding schemes: interest-based and information-centric forwardings.
This presentation was given as a tutorial in the IEEE 3rd Latin-American Conference on Communications (LATINCOM), on Oct 26th, 2011, in Belém/PA, Brazil.
http://www.ieee-latincom.ufpa.br/
Exploiting Wireless Networks, through creation of Opportunity Network – Wirel...ijasuc
Spotting Opportunity today and recognizing the same is the vision of the expert. The wireless
communication network regime is one such environment that offers such a platform for many working
scientific, academic and engineering experts. Henceforth, “Opportunistic-network” is a recent evolution
of the above said phenomena in the wireless community. They function by spontaneous cooperation &
coordination giving birth to a special type network called wireless-mobile-adhoc-network (W-MAN). As
said, these networks are formed instantaneously in a random manner – breaking the conventional
mathematically evolved algorithms’, and provided the quintessential of a network(s) that exist in
neighbourhood(s) or approachable limits. Is more of situational based, exploited for specialized purpose
or advantage, which mimics all the characteristic of a well evolved network. Such networks, lack an endto-end path, contact, cooperation and coordination; which is mainly opportunity based, and break or
even disintegrate soon after discovery, thus the challenge lay in integration, construction and probable
sustenance or even mid-way reconstruction till purpose. One can cite many realistic scenarios fitting to
this situation. For example, wildlife tracking sensor networks, military networks, vehicular ad hoc
networks to mention a few. To transmit information under such circumstances/scenarios researchers have
proposed various efficient forwarding (single copy), replication routing and controlled based schemes. In
this paper, we propose to explore, investigate and analyze most of the schemes [1] [2] [3] [4] [5] [6] and
present the findings of the said scheme by consolidating critical parameters and issues and towards the
end of this paper, algorithms, possible solutions to deal with such complex and dynamic situations
through W-MAN scheme suggested by us.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
SocialDTN: a DTN Implementation for Digital and Social InclusionWaldir Moreira
SocialDTN is also part of the DTN-Amazon project fruit of a partnership between SITILabs and GERCOM/UFPA. This presentation introduces this DTN implementation for digital and social inclusion.
This presentation was given on my behalf by Dr. Cerqueira in the ACM MobiCom Workshop on Lowest Cost Denominator Networking for Universal Access (LCDNet 2013), on September 30th, 2013 in Miami, USA.
DTN-Amazon: Digital/Social Inclusion in the Amazon RegionWaldir Moreira
DTN-Amazon is a project developed in a partnership between SITILabs and Federal University of Para (UFPA/Brazil) since 2011. The main goal is to promote digital/social inclusion in the Amazon region by bringing Internet access to remote, infrastructureless locations such as the the riverside communities nearby UFPA. The project has implemented middleware solutions that are actually being experimented in a 7-node testbed at UFPA.
This presentation was given in TecWeb 2013 on April 16th, 2013 at University Lusofona in Lisbon, Portugal.
Crowd Assisted Approach for Pervasive Opportunistic SensingWaldir Moreira
The advances in the areas of microelectronics and telecommunications are helping to materialize the vision of a pervasive computing model through the incorporation of sensors and communication interfaces into objects of everyday life. In recent years, there has been a growing interest in crowd assisted sensing applications, in which people serve as the building block that can be exploited to offer pervasive opportunistic sensing at scale. This paper describes a new crowd assisted pervasive opportunistic sensing framework able of exploiting people's mobility to overcome the coverage limitation of sensors and the diversity of devices, expanding the scale of sensing applications.
This presentation was given in the 2nd IEEE PerCom Workshop on Crowd Assisted Sensing Pervasive Systems and Communications (CASPer 2015), on March 27th, 2015 in St. Louis, USA.
Social-aware Opportunistic Routing Protocol based on User's Interactions and ...Waldir Moreira
Nowadays, routing proposals must deal with a panoply of heterogeneous devices, intermittent connectivity, and the users' constant need for communication, even in rather challenging networking scenarios. Thus, we propose a Social-aware Content-based Opportunistic Routing Protocol, SCORP, that considers the users' social interaction and their interests to improve data delivery in urban, dense scenarios. Through simulations, using synthetic mobility and human traces scenarios, we compare the performance of our solution against other two social-aware solutions, dLife and Bubble Rap, and the social-oblivious Spray and Wait, in order to show that the combination of social awareness and content knowledge can be bene cial when disseminating data in challenging networks
This presentation was given on my behalf by Dr. Mendes in the 5th International Conference on Ad Hoc Networks (ADHOCNETS 2013), on October 16th, 2013 in Barcelona, Spain.
Always Offline: Delay-Tolerant Networking for the Internet of ThingsDaniel Austin
Discussion of IoT networks and DTNs, including some speculation on social behavior-based routing and the similarities between the IoT and the ecology of living things.
When wireless networking virtualization is used in environments where multiple users share the same location, the technology can be considered as an alternative to the multipath because data can be networked over multiple technologies, where the case of 3G and WiFi Direct is specifically considered in this paper. Delay Tolerant Networks (DTNs) are recently proposed in delay-optimized versions which can support traffic exchange in realtime. This paper proposes the base recipe for a generic application which applies these technologies for a wide range of practical uses.
Disruption Tolerant Network Coding scenarios often rises from mobile wireless networks where due to limited transmission power, fast node mobility,sparse node density, and frequent equipment failures, there is often no contemporaneous path from the source to destination nodes. Before going to the depth of DTN, it is recommended to review traditional non-coding routing schemes for broadcast and unicast applications in DTNs, and the basic operations of Random Linear Coding (RLC).
In this presentation, we will discuss the characteristics of systematic promotion policy, principles, types and meaning of Transfer, promotion and demotion.
To know more about Welingkar School’s Distance Learning Program and courses offered, visit:
http://www.welingkaronline.org/distance-learning/online-mba.html
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
Now-a-days, wireless networks increase rapidly in the area of telecommunication networks. Mobile ad hoc network (MANET) is most popular wireless network because it is no need of framework, no base station and cost-effective. For communication purpose, we use routing protocol such as AODV (Ad hoc on demand distance vector) protocol, DSDV (Destination sequenced distance vector) protocol, WRP (Wireless routing protocol), ZRP (Zone routing protocol), DSR (Dynamic source routing protocol). In this book, we more learn about AODV routing protocol because it gives the better result as comparisons of other routing protocol. In the MANET, various attacks on the network such as black hole, worm-hole attacks etc. In group of flying insect algorithm is used in routing protocol such as ant, fog, fish, birds, honeybee etc. algorithm. We choose the ant algorithm to simulate the project on MATLAB and to find out the different parameters. This algorithm is used for find out the shortest path between source to destination for fastest communcation between to nodes.
An efficient ant optimized multipath routing in wireless sensor networkEditor Jacotech
Today, the Wireless Sensor Network is increasingly gaining popularity and importance. It is the more interesting and stimulating area of research. Now, the WSN is applied in object tracking and environmental monitoring applications. This paper presents the self-optimized model of multipath routing algorithm for WSN which considers definite parameters like delay, throughput level and loss and generates the outcomes that maximizes data throughput rate and minimizes delay and loss. This algorithm is based on ANT optimization technique that will bring out an optimal and organized route for WSN and is also to avoid congestion in WSN, the algorithm incorporate multipath capability..
Performance Analysis and Simulation of OLSR Routing Protocol in MANET ijcnac
Mobile ad hoc network is a collection of wireless nodes that are communicate other
nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an
autonomous system that means no need for depaentd other nodes it have own capability
to handle and controlling all funcitionlity, to sending and receiving all information form
one device to other device. MANET has power full feature that controlling itself by
dynamic nature, multihop,low power and configuration of the system. In this paper we
analyzing, simulation and implements the TC messages and HELLO Message by MPR of
OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet
simulator to simulate and implement the performance of OLSR routing protocols takes
various performance metrics like hello message sent (HMS) , hello message received
(HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages
received on Constant Bit Rate (CBR) using random waypoint model. In this paper check
the performance OLSR routing protocol gives effective performance for lage networks.
Performance Comparison and Analysis of Mobile Ad Hoc Routing ProtocolsCSEIJJournal
A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peer-to-peer routing instead
of static network infrastructure to provide network connectivity. MANETs have applications in rapidly
deployed and dynamic military and civilian systems. The network topology in a MANET usually changes
with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing
protocols may not be suitable for MANETs. Researchers are designing new MANET routing protocols
and comparing and improving existing MANET routing protocols before any routing protocols are
standardized using simulations. However, the simulation results from different research groups are not
consistent with each other. This is because of a lack of consistency in MANET routing protocol models
and application environments, including networking and user traffic profiles. Therefore, the simulation
scenarios are not equitable for all protocols and conclusions cannot be generalized. Furthermore, it is
difficult for one to choose a proper routing protocol for a given MANET application. According to the
aforementioned issues, this paper focuses on MANET routing protocols. Specifically, my contribution
includes the characterization of different routing protocols and compare and analyze the performance of
different routing protocols.
Traffic Engineering in Software Defined Networking SDNijtsrd
The traditional single path routing can cause imbalanced link utilization and is not efficient for all traffic types such as long lived large flows. Moreover, it can lead to low network throughput and high network latency. Traffic engineering TE is a key solution to solve these problems of single path. The main purpose of TE is to optimize the network resource utilization and improve network performance by measuring and controlling network traffic. One of the TE approach for large flows is multipath routing which distribute traffic load among available multiple paths. However, most of multipath solutions do not classify traffic flows for example elephant or mice and do not concern the existing delays of routes. Therefore, to be intelligent multipath routing based on traffic types, we proposed three main folds 1 large flow detection approach by using sFlow analyzer in real time, 2 measuring end to end delays of available paths between source node and destination node where large flow occurred and 3 reroute the large flow to minimum round trip time delay path in order to improve network performance. Through experimental results, our proposed method gains over 30 77 throughput improvement over reactive forwarding application which is implemented in ONOS controller. Aung Htein Maw "Traffic Engineering in Software-Defined Networking (SDN)" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26618.pdfPaper URL: https://www.ijtsrd.com/computer-science/computer-network/26618/traffic-engineering-in-software-defined-networking-sdn/aung-htein-maw
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
Online opportunistic routing using Reinforcement learningHarshal Solao
Cognitive radio network hold the key to achieve better radio bandwidth utilization and improve the quality of wireless application. The topology of Cognitive radio ad-hoc network can change dynamically through frequently changing nodes.
This project work propose a scheme that uses a reinforcement learning method to route the packet from source to destination in which nodes share channel information to each other to select best relay node among them.The main goal of this work
is to compute prior time channel availability using of Hidden Markov Model. This
scheme model strategic interaction among multiple cognitive nodes for selecting best
candidate forwarder and maximize average per packet reward between source and
destination. That collectively addresses the issue of learning and routing in an opportunistic manner even in the absence of reliable knowledge about channel statistics and network model.
A COMPARATIVE ANALYSIS ON ROUTING PROTOCOLS OF MOBILE AD HOC NETWORKijcseit
In this modern era, Mobile Ad hoc Network (MANET) is widely used for its mobility and self-configuring
features. Hence, a better security approach is needed for maintaining high level network performance in
mobile ad hoc network. This paper presents the comparative analysis of quality of service (QoS) of MANET
protocols. In this regard, three types of most widely used protocols, named, Ad hoc On-demand Distance
Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing Protocol (OLSR) have
been used to analyze. Therefore, AODV is selected in distributed ad hoc setting for the path discovery.
Also, AODV is a reactive improvement of Dynamic Destination Sequence Vector (DSDV) protocol. On the
other hand, the number of route broadcast is decreased by source routes on demand in AODV, which is
opposite of DSDV algorithm. In this research, the quality of service parameters of network paths are also
included to develop trust in the links to defend from various attacks. Moreover, a comparative analysis of
delay, congestion, packet losses, transit time between source and destination is illustrated on AODV and
DSR. In simulation time, packet drop-outs and link failures for probe packets are examined and analyzed
under network attack.
A COMPARATIVE ANALYSIS ON ROUTING PROTOCOLS OF MOBILE AD HOC NETWORKijcseit
In this modern era, Mobile Ad hoc Network (MANET) is widely used for its mobility and self-configuring
features. Hence, a better security approach is needed for maintaining high level network performance in
mobile ad hoc network. This paper presents the comparative analysis of quality of service (QoS) of MANET
protocols. In this regard, three types of most widely used protocols, named, Ad hoc On-demand Distance
Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing Protocol (OLSR) have
been used to analyze. Therefore, AODV is selected in distributed ad hoc setting for the path discovery.
Also, AODV is a reactive improvement of Dynamic Destination Sequence Vector (DSDV) protocol. On the
other hand, the number of route broadcast is decreased by source routes on demand in AODV, which is
opposite of DSDV algorithm. In this research, the quality of service parameters of network paths are also
included to develop trust in the links to defend from various attacks. Moreover, a comparative analysis of
delay, congestion, packet losses, transit time between source and destination is illustrated on AODV and
DSR. In simulation time, packet drop-outs and link failures for probe packets are examined and analyzed
under network attack.
Interference-Aware Multipath Routing In Wireless Sensor NetworksMinor projr...Rakesh Behera
Routing in wireless sensor networks has been considered an important field of research over the past decade. Wireless sensor network essentially consists of data Sensor Nodes and Video Sensor Nodes, which senses both sound and motion of events. Single path routing protocol has been used for route discovery. Though this protocol reduces computation complexity and resource utilization, there are some disadvantages like reduced network throughput, network performance, increased traffic load and delay in data delivery. To overcome these drawbacks a new protocol called Interference Aware Multi-path Routing(IAMR) is proposed to improve the reliability of data transmission, fault-tolerance, Quality of Service. Here, the traffic intersection spread out among the multiple paths. This technique is applied between the sources and sink to reduce routing overhead and energy consumption. The proposed protocol is simulated using NS2
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...ijsrd.com
In Mobile Ad hoc network (MANETS), no fixed infrastructure is available. Different wireless hosts are free to move from one location to another without any centralized administration, so, the topology changes rapidly or unpredictably. Every node operates as router as well as an end system. Routing in MANETs has been a challenging task ever since the wireless networks came into existence. The major reason for this is continues changes in network topology because of high degree of node mobility. The MANET routing protocols have mainly two classes: Proactive routing (or table-driven routing) protocols and Reactive routing (or on-demand routing) protocols. In this paper, we have analyzed various Random based mobility models: Random Waypoint model, Random Walk model, Random Direction model and Probabilistic Random Walk model using AODV and DSDV protocols in Network Simulator (NS 2.35). The performance comparison of MANET mobility models have been analyzed by varying number of nodes using traffic TCP. The comparative conclusions are drawn on the basis of various performance metrics such as: Routing Overhead (packets), Packet Delivery Fraction (%), Normalized Routing Load, Average End-to-End Delay (milliseconds) and Packet Loss (%).
In this modern era, Mobile Ad hoc Network (MANET) is widely used for its mobility and self-configuring
features. Hence, a better security approach is needed for maintaining high level network performance in
mobile ad hoc network. This paper presents the comparative analysis of quality of service (QoS) of MANET
protocols. In this regard, three types of most widely used protocols, named, Ad hoc On-demand Distance
Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing Protocol (OLSR) have
been used to analyze. Therefore, AODV is selected in distributed ad hoc setting for the path discovery.
Also, AODV is a reactive improvement of Dynamic Destination Sequence Vector (DSDV) protocol. On the
other hand, the number of route broadcast is decreased by source routes on demand in AODV, which is
opposite of DSDV algorithm. In this research, the quality of service parameters of network paths are also
included to develop trust in the links to defend from various attacks. Moreover, a comparative analysis of
delay, congestion, packet losses, transit time between source and destination is illustrated on AODV and
DSR. In simulation time, packet drop-outs and link failures for probe packets are examined and analyzed
under network attack.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Fundamentals of Electric Drives and its applications.pptx
Project
1. Project Seminar
On
“Performance Analysis of
Epidemic Routing Protocol in DTN”
Presented by:
Jashanpreet pal Kaur
M.Tech- CE
2. Why DTN??????
Adhoc networks
1)The protocols first establish
a end to end path between
source and destination to
communicate.
2)Delays are more
DTN
1)Follow Store & Forward
approach
• Intermittent connectivity
• Opportunistic N/w’s
2)Less delays (delay tolerate
3)Consist of variousprotocols:
Epidemic, PRoHET, Spray
&wait, direct delivery, First
contact
3. What is Epidemic Routing Protocol??
• Flooding based protocol
• Like disease spreading
• Useful in an environment of
infinite buffer space and
bandwidth.
• The Goal is to deliver a
message with high
probability with minimum
delay
4. PROJECT OBJECTIVE
• The main objective is to check that for which mobility
models among the Random waypoint, Map based
mobility , Shortest Path Movement, and Map Route
based movement the Epidemic protocol performs best
when buffer size at each node is varied.
• At what range of nodes its performance is best or static.
5. Methodology Used
• ONE –Opportunistic Networking Environment Simulator
( Latest version 1.4.1)
• Java Based Simulator for research in DTN’s
• Runs on Linux,Windows or any platform that supporting
a Java
• Users can simulate different scenarios in easily and flexible
manner for routing protocols based on mobility models.
6. Continue……
• It combines Movement models, Routing simulations,
Visualization and Reports into one program.
7. Project Work:
Simulation Parameters:
Protocol: Epidemic
Initially take 60 nodes
Interface: Bluetooth interface
5 group of nodes: 1st =20 ; 2nd , 3rd =18 and 4th ,5th =2
Message TTL = 300min (5 hours)
Varying buffer sizes = 5M, 10M, 15M, 20M,25M
Performance metrics: 1) Delivery Probability
2) Overhead Ratio
3) Average Buffer Size
8. Performance
Metrics
Definition
Delivery
Probability
Overhead
Ratio
Average
Buffer Time
defined as fraction of total number of messages
that are correctly delivered to final destination
within a given time period.
used to estimate the extra number of packets
needed by the routing protocol for actual delivery
of the data packets.
used to estimate the average time that messages
stayed in the buffer at each node.
9. Movement models: 1) Random Waypoint
Fig: RandomWay Point
Two Parameters
a) Pause Time (pt)
b) MaxSpeed (Vmax)
Each node starts at a random
location p0
Pause for a pt–time while then
select a new destination and moves
to that destination at random speed
(0, Vmax)
Nodes moves along a zig-zag path
p0
p3
p1
p2
p4
p5
11. 2) Map Based Movement
It constrain the node movement to predefined paths.
All the nodes can move according to predefined paths
towards destination.
Eg.: cars can be prevented from driving indoors.
12. 2.a) Shortest Path Map Based:
Next destination node is to be
selected based on POI data
contained in map data. POI
contains the distance between
each node.
Eg: cars travelling on the road
2.b) Map Route Based:
Nodes always select the next
destination based on route
they are previously selected.
Eg: Bus and tram routes or line
only stops on routes are
defined and then buses using
that routes move from stop
to stop.
stops on each stop for a
configured time then selects
a next
stop to reach a destination.
1
5
1
3
4
2
3
13. Simulation Setup
Step 1: Setup a scenario for simulation
(Name, Time and Nodes group)
Step 2: Specify the Network Interface (Bluetooth Interface)
Step 3: Specify group of nodes, TTL of message, Buffer size
at each node
Step 4: Mobility model setting
Step 5: time for message creation
Step 6: reports creation setting
Step 7: GUI settings ( image is set where nodes move)
14. Running Simulation
At last run the simulation 5 time for each buffer
size
we have 5 scenario for each movement model and total
scenario are =20
Simulation is run in the command prompt
Their reports are generated in the reports folder
Now for the above three metrics we have to compared
for all mobility models
one –b5
one
16. For Overhead Ratio:
25
20
15
10
5
Random way Point Map Based Movement
450
400
350
300
250
200
150
100
50
Shortest Path Map Based Map Route Based
16
14
12
10
8
6
4
2
0
5M 10M 15M 20M 25M
0
5M 10M 15M 20M 25M
25
20
15
10
5
0
5M 10M 15M 20M 25M
0
5M 10M 15M 20M 25M
17. For Average Buffer Time :
18000
16000
14000
12000
10000
8000
6000
4000
2000
0
5M 10M 15M 20M 25M
RandomWay
MapBased
ShortestPath
MapRoute
Average Buffer Time....
Result : Shortest path model provides the best performance of
epidemic routing protocol.
18. Delivery Overhead Average
Probability Ratio Buffer Time
Models
Random Waypoint
Movement Model
Constant decreases but constant at
Sometimes const. large buffer
size
Map Based
Movement Model
Low more decrease greatly
than RWP but Increase
sometime const.
Shortest Path Map
Based Movement
Model
High Continuously Average
Decreases Increase
Map Route Based
Movement Model
Very low Constant Constant
Result : Shortest path model provides the best performance of
epidemic routing protocol.
19. Range of nodes for best performance:
Now the nodes are varied from 60 to 50,30,20
Delivery Probability for varied nodes using shortest path
0.6
model:
0.5
0.4
0.3
0.2
0.1
0
5M 10M 15M 20M 25M
60 Nodes
50 Nodes
30 Nodes
20 Nodes
Delivery Ratio......
Buffer Size ......
20. Average Buffer Time for varied nodes using shortest path
model:
14000
12000
10000
8000
6000
4000
2000
0
5M 10M 15M 20M 25M
60 Nodes
50 Nodes
30 Nodes
20 Nodes
Buffer size......
Average Buffer Size.....
21. Overhead ratio for varied nodes using shortest path
model:
25
20
15
10
5
0
5M 10M 15M 20M 25M
60 Nodes
50 Nodes
30 Nodes
20 Nodes
Overhead Ratio....
Buffer Size......
Result : when the number of nodes are more it provides the
best utilization and when number of nodes are less then its
performance becomes static.
22. Conclusion
The analysis of scenarios concludes that the shortest path
map based mobility model is best among all for routing
using epidemic routing protocol. Then after varying the
number of nodes concludes that this model provides the
best delivery ratio and less overheads when number of
nodes is more and static performance when number of
nodes are too less.
23. Future Scope
There are two main problems in the epidemic routing
protocol. It comsumes a lot of resources and unauthorized
access to the messages. Then it is further interesting to see
the malicious node effects to recover the messages from
them and for decreasing the resource consumption instead
of using FIFO strategy, we can any other strategy or
removing the messages from the buffer that has already
forwarded. The Quota sampling is used instead of using the
flooding strategy.
24. References
[1] Professor Jorg Ott of Helinski University of Technology: “A Tutorial paper on the
Opportunistic Networking Environment Simulator” presented in May 29, 2008
[2] Paritosh Puri, M.P Singh: “A Survey paper on Delay Tolerant Networking”presented in
2013.
[3] Harminder Singh Bindra and A. L. Sangal:“ The Performance comparison of the
RAPID,
Epidemic, PRoHET routing protocols in DTN ” presented in the April 2, 2012.
[4] Anders Lindgreny, Avri Doria, Olov Schelen: “The Probabilistic Routing in case of DTN
Intermittently Connected Networks” presented in December 2002.
[5] Neena V V, V Mary Anita Rajam: “Performance Analysis of Epidemic Routing Protocol
for
Opportunistic Networks in Different Mobility Patterns ” presentesd in Jan. 09, 2013.
[6] Forrest Warthman : “A Tutorial Delay tolerant networks” presented in May 3, 2003.
[7] Sushant Jain, Kevin Fall, Rabin Patra: “Routing in DTN” presented in Aug 4, 2008.
