Simulation and Analysis of Opportunistic Routing Protocols
|
|
- Alexina Norman
- 5 years ago
- Views:
Transcription
1 Simulation and Analysis of Opportunistic Routing Protocols 1 The Purpose The purpose of this assignment is to gain familiarity with a network simulation tool and to get experience in basic data analysis. The simulator that will be used is called ONE [2] and is common within the opportunistic networking research community. You will run the simulation using a simple network scenario and investigate the influence of the mobility model and performance of different routing protocols. 2 Simulator Overview ONE is a discrete event simulator, which means that events (e.g., packets to send, timeouts, etc.) are scheduled in a global event queue according to their time of execution. When a simulation is run the simulator removes events from the head of the queue, moves the simulator time to that of the currently removed event and executes it. When done, it continues to the next event and so forth. The simulator reads a configuration file that specifies the network, i.e., the movement of the nodes 1 and settings of the nodes in the network. Each simulation run generates a trace file containing all the data packets that are sent between the nodes during the course of the simulated scenario. By analyzing this file it is possible to determine the performance effect of parameter variations, different routing protocols and more. A simulation can be very useful since it is possible to scale the networks easily and therefore eliminate the need for time consuming and costly real 1 Each simulated computer or device is called a node. 1
2 world experiments. While the simulator is a powerful tool, it is important to remember that the ability to do predictions about the performance in the real world is dependent on the accuracy of the models in the simulator. 2.1 Grading This lab can give you at most 3 points in the course point system. Each of the 3 tasks in this lab can give you 1 point each. Only by answering ALL the questions in each specific task can you get 1 point for that task. So only by answering all the questions of this lab you have the possibly of getting 3 points. Many of the question does not have one correct answer but are instead designed to show us that you have understood and can reason about different concepts. 2.2 Running the Simulation The simulator is written in Java and with our scripts it can run on Unix, Linux, and Mac OS X. For further instructions on how to use the simulator we refer to the README file in the ONE directory. The steps you have to perform to get going with the lab are the following: 1. Download the ONE simulator through the link on the lab homepage. 2. Extract the zip file. 3. Download the lab code from the lab homepage. 4. Extract the lab code in the ONE simulator directory. For ease of use, we have created scripts that will run and analyze (most) of the scenarios that you are going to study. Your assignment is to interpret the analyzed data. 2.3 Simulator output When running the simulator with the provided scripts there is a lot of output in the form of log files and plots. You need to read and interpret these files correctly to be able to answer some of the questions. Everything you need to look at can be found in the downloaded lab directory. The following folders are of interest: 2
3 config - here you find the configuration files for the different task. Do not edit except for in Task 3. plots - here.eps files of plots are generated. Used in Task 2 and Task 3. reports - here log files for each of the three tasks can be found. On the top level there is an example file containing additional infer to help you understand the output. Make sure you read the provided example file! TaskX ABC MessageStatsReport.txt - summarized info on the overall performance. TaskX ABC EventLogReport.txt - shows every connection made and all the events within that connection. There are three different events that are logged. CONN, S and DE. CONN indicate that a connection goes up or down. S indicates message sent and DE message successfully delivered. 3 Assignment There are three main tasks to be solved in this lab. First, you will familiarize yourself with a two different mobility models. Second, you will investigate the behavior of two opportunistic routing protocols. Last, you will perform a simulation where you configure some parameters and analyze the result based on the knowledge you have acquired from the first two tasks. You are supposed to write the answers to the questions in the provided answers.txt file. NOTE! You will have to read the references to be able to answer the questions at the end of each task. 3.1 Task #1: Mobility models Mobility models represent the movement of mobile users, and how their location, velocity and acceleration change over time. 3
4 3.2 Simulation Scenario In this task you are going to use two different mobility models and compare the results they yield. The data that is generated during the experiment is always sent from a randomly chosen node to a randomly chosen receiver. The first task is to run the simulator with the GUI and observe how nodes move using the different mobility models. A common mobility model used in research on opportunistic networks is Random Waypoint (RWP) [1]. RWP is a artificial mobility model that try to capture the movement of humans. The second model you are to try out is map based and called Shortest Path Map-Based Movement (SPMBM) [2]. The map you will see in the GUI shows the city roads in Helsinki, Finland. Run the simulation for RWP by typing the following command in the ONE directory by typing: $./task1.sh rwp Press play in the GUI and zoom if necessary. You should be able to see nodes move around. You should run the simulation until you see a popup window with Simulation done. You can fast forward to speed up the simulation. Observe the movement of the nodes. Now, run a simulation with SPMBM. $./task1.sh map Question 1. Briefly describe how RWP and SPMBM works? Question 2. What are the advantages and disadvantages with the two models? Question 3. Suggest a different mobility model that address one or more of the shortcomings of the other two. What does it improve? 3.3 Task #2: Opportunistic Routing In this task, you are going to look at the behavior of two routing protocols. The first routing protocol is very simple, it sends a copy of each message in the buffer to every node it meets, this is called epidemic routing [4]. The second protocol called Spray-and-Wait [3] is a variant of epidemic routing but with some additional constraints. The source sends the message 4
5 to the first F number of nodes it comes in contact with where F is a configurable number that is set to 5 in this task. A node that has received the message is then only allowed to forward the message directly to the destination. This results in that there are at most 2 hops between source and destination. We will be using the RWP mobility model from Task 1 to model the movement in the network. Run the simulation for epidemic routing. $./task2.sh -b 1 epidemic Follow how data is routed in the network. Now, run a simulation with Spray-and-Wait. $./task2.sh -b 1 saw Question 4. How many copies does epidemic and spray-and-wait respectively generate? Why does it look this way? Question 5. How does end-to-end delay differ in the two routing protocols? Two diagrams that will help you answer can be found in the subdirectory plots. Question 6. Using the generated logs found in reports/task2/task2 ABC EventLogReport follow message with id M95. How many message replications are there of M95 using each of the two protocols? (Hint: using the unix command grep on a file with the -w flag might help you. Type man grep for details.) Question 7. What is is the delivery ratio in epidemic and spray-andwait? Why is it lower when spray-and-wait is used? 3.4 Task #3: Comparing simulation results Now you are going to look at how routing protocols interact and behave with different mobility models. We will use the two mobility models and routing protocols already introduced in this lab. You will also get an insight into how different parameter assumptions can greatly influence the behavior and results. In Figure 1 you see four different simulations with different protocols and mobility models. There are four scripts used in Task 3 (found in the config 5
6 folder). Note that there is one script for each of the four configurations. They contain additional information that might be useful. If you want to generate the graph in Figure 1, run the following command # of transmissions RwpEpidemicRouting MapEpidemicRouting RwpSprayAndWaitRouting MapSprayAndWaitRouting Average delay Figure 1: $./task3.sh Question 8. What are your conclusions regarding mobility models and routing protocols based on Figure 1? Now you are to edit the scripts, remember that you need to edit all four files in the exact same way! In turn configure the wifi and bluetooth scenario from Table 1 and edit the config scripts accordingly. You need to save the two generated.eps plots and provide them with your hand-in. Run the simulation. $./task3.sh Question 9. What can you observe when running the bluetooth scenario? Question 10. What can you observe when running the wifi scenario? 6
7 Configuration bluetooth wifi Transmission range (m) Bit rate (Mbps) Buffer size (MB) Packet size (MB) 1 1 Table 1: Simulation parameters. 4 Hand-in Instructions To pass the assignment follow the hand-in instructions below. You only need to do one hand-in for each group. Upload the two uncompressed files to the file area in the Studentportal. You should provide us with the following files 1. The provided answers.txt filled out with your answers to the lab questions. 2. The two.eps plots you produced in Task 3. One for bluetooth and one for wifi. 7
8 References [1] D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. Mobile Computing, pages , [2] A. Keränen, J. Ott, and T. Kärkkäinen. The ONE Simulator for DTN Protocol Evaluation. In SIMUTools 09: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, New York, NY, USA, ICST. [3] T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, WDTN 05, pages , New York, NY, USA, ACM. [4] A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical report,
Energy Consumption and Performance of Delay Tolerant Network Routing Protocols under Different Mobility Models
2016 7th International Conference on Intelligent Systems, Modelling and Simulation Energy Consumption and Performance of Delay Tolerant Network Routing Protocols under Different Mobility Models Bhed Bahadur
More informationComparing Delay Tolerant Network Routing Protocols for Optimizing L-Copies in Spray and Wait Routing for Minimum Delay
Conference on Advances in Communication and Control Systems 2013 (CAC2S 2013) Comparing Delay Tolerant Network Routing Protocols for Optimizing L-Copies in Spray and Wait Routing for Minimum Delay Anjula
More informationPerformance Analysis of Delay Tolerant Network Routing Protocols in Different Mobility Environments
Performance Analysis of Delay Tolerant Network Routing Protocols in Different Mobility Environments Bhed Bahadur Bista Faculty of Software and Information Science Iwate Prefectural University Takizawa
More informationArchna Rani [1], Dr. Manu Pratap Singh [2] Research Scholar [1], Dr. B.R. Ambedkar University, Agra [2] India
Volume 4, Issue 3, March 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Evaluation
More informationDesign and Implementation of Improved Routing Algorithm for Energy Consumption in Delay Tolerant Network
IJIRST International Journal for Innovative Research in Science & Technology Volume 3 Issue 07 December 2016 ISSN (online): 2349-6010 Design and Implementation of Improved Routing Algorithm for Energy
More informationCOMPARATIVE ANALYSIS OF DIFFERENT ROUTING PROTOCOLS IN DELAY TOLERANT NETWORKS
COMPARATIVE ANALYSIS OF DIFFERENT ROUTING PROTOCOLS IN DELAY TOLERANT NETWORKS Chintan B. Desai PG Student, Electronics and Communication Department, Charotar University of Science & Technology, Changa,
More informationDATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES B.Poonguzharselvi 1 and V.Vetriselvi 2 1,2 Department of Computer Science and Engineering, College of Engineering Guindy, Anna University Chennai,
More informationStudies with ns-2 and ns-3 based DTN Simulators
Studies with and based DTN Simulators Epidemic Routing, Spray and Wait DTN Congestion Control Jani Lakkakorpi Department of Communications and Networking (Comnet) 2.11.2012 Simulators.34 With alternative
More informationPERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR DELAY TOLERANT NETWORKS
PERFORMANCE ANALYSIS OF ROUTING PROTOCOLS FOR DELAY TOLERANT NETWORKS Sanjay Kumar, K. Suraj and Sudhakar Pandey Department of Information Technology, National Institute of Technology Raipur, India E-Mail:
More informationA Joint Replication-Migration-based Routing in Delay Tolerant Networks
A Joint -Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Dept. of Computer and Info. Sciences Temple University Philadelphia, PA 19122 Zhen Jiang Dept. of Computer Science West
More informationRouting in a Delay Tolerant Network Sushant Jain, Kevin Fall and Rabin Patra SIGCOMM Presented by Xun Gong
Routing in a Delay Tolerant Network Sushant Jain, Kevin Fall and Rabin Patra SIGCOMM 2004 Presented by Xun Gong Outline Delay Tolerant Networks Routing Problem in DTNs Multiple-copy Approach Flooding and
More informationSimulation of Epidemic, Spray and Wait and First Contact Routing Protocols in Delay Tolerant Network
Simulation of, Spray and Wait and First Contact Routing Protocols in Delay Tolerant Network 1 Monika Aneja, 2 Vishal Garg 1 (P.G. Student JMIT, Radaur, Yamunanagar) 2 (Assistant Professor JMIT Radaur Yamunanagar)
More informationNEW STRATEGY TO OPTIMIZE THE PERFORMANCE OF SPRAY AND WAIT ROUTING PROTOCOL
NEW STRATEGY TO OPTIMIZE THE PERFORMANCE OF SPRAY AND WAIT ROUTING PROTOCOL Mohamed Ababou 1, Rachid Elkouch 2, Mostafa Bellafkih 3 and Nabil Ababou 4 1 National Institute of Posts and Telecommunications
More informationRouting Protocol Approaches in Delay Tolerant Networks
Routing Protocol Approaches in Delay Tolerant Networks Shivi Shukla 1, Amit Munjal 2 and Y. N. Singh 2 AIM & ACT Dept., Banasthali Vidyapith, Rajasthan 1 EE Dept., Indian Institute of Technology, Kanpur
More informationANNALS of Faculty Engineering Hunedoara International Journal of Engineering
ANNALS of Faculty Engineering Hunedoara International Journal of Engineering Tome XIII [2015] Fascicule 4 [November] ISSN: 1584-2673 [CD-Rom; online] a free-access multidisciplinary publication of the
More informationEstimation based Erasure-coding Routing in Delay Tolerant Networks
Estimation based Erasure-coding Routing in Delay Tolerant Networks Yong Liao, Kun Tan, Zhensheng Zhang, Lixin Gao Dep. of Electrical & Computer Eng. Microsoft Research Asia San Diego Research Center University
More informationBOND: Unifying Mobile Networks with Named Data. Michael Meisel
BOND: Unifying Mobile Networks with Named Data Michael Meisel Ph.D. Dissertation Defense March 16, 2011 Freeform Wireless Networks Multi-hop Unpredictable mobility Can be connected or disconnected Examples:
More informationOptimized DTN-Routing for Urban Public Transport Systems
Optimized DTN-Routing for Urban Public Transport Systems Tobias Pögel Institute of Operating Systems and Computer Networks Technische Universität Braunschweig, Germany poegel@ibr.cs.tu-bs.de Abstract Communication
More informationUsing local speed information as routing metric for delay tolerant networks
Using local speed information as routing metric for delay tolerant networks FUQUAN ZHANG 1, INWHEE JOE, DEMIN GAO 1 AND YUNFEI LIU 1 1 College of Information and Sciences NanJing Forestry University NanJing
More informationIJSER. 1. Introduction. 1.1 Routing in DTN: Sukhpreet Kaur
International Journal of Scientific & Engineering Research, Volume 7, Issue 4, April-2016 1717 A Review of Energy Consumption on DTN Routing Protocols Sukhpreet Kaur Abstract: DTN is net of similar nets.
More informationSpray and forward: Efficient routing based on the Markov location prediction model for DTNs
. RESEARCH PAPER. SCIENCE CHINA Information Sciences February 2012 Vol. 55 No. 2: 433 440 doi: 10.1007/s11432-011-4345-1 Spray and forward: Efficient routing based on the Markov location prediction model
More informationPerformance of Efficient Routing Protocol in Delay Tolerant Network: A Comparative Survey. Namita Mehta 1 and Mehul Shah 2
, pp.151-158 http://dx.doi.org/10.14257/ijfgcn.2014.7.1.15 Performance of Efficient Routing Protocol in Delay Tolerant Network: A Comparative Survey Namita Mehta 1 and Mehul Shah 2 1 Student, Department
More informationSpray and Dynamic: Advanced Routing in Delay Tolerant Networks
Int. J. Communications, Network and System Sciences, 2012, 5, 98-104 http://dx.doi.org/10.4236/ijcns.2012.52013 Published Online February 2012 (http://www.scirp.org/journal/ijcns) Spray and Dynamic: Advanced
More information1. INTRODUCTION. Saravanan.A 1 and Dr.Sunitha Abburu 2
www.ijcsi.org 365 Computing Conditional Intermeeting Time in Conditional Shortest Path Routing Saravanan.A 1 and Dr.Sunitha Abburu 2 1 Adhiyamaan College of Engineering, Department of Computer Application,
More informationTRUST FRAMEWORK FOR DATA FORWARDING IN OPPORTUNISTIC NETWORKS USING MOBILE TRACES
TRUST FRAMEWORK FOR DATA FORWARDING IN OPPORTUNISTIC NETWORKS USING MOBILE TRACES B.Poonguzharselvi 1 and V.Vetriselvi 2 1,2 Department of Computer Science and Engineering, College of Engineering Guindy,
More informationAPPENDIX 1 SIMULATORS
113 APPENDIX 1 SIMULATORS The Network Simulator-2 (NS-2) and Opportunistic Network Environment (ONE) Simulators are used for simulation purpose. Movement report of ONE generates suitable movement data
More informationImprovement of Buffer Scheme for Delay Tolerant Networks
Improvement of Buffer Scheme for Delay Tolerant Networks Jian Shen 1,2, Jin Wang 1,2, Li Ma 1,2, Ilyong Chung 3 1 Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science
More informationBATMAN Store-and-Forward: the Best of the Two Worlds
Second International Workshop on Pervasive Networks for Emergency Management (PerNEM 2012) BATMAN Store-and-Forward: the Best of the Two Worlds Laurent Delosières and Simin Nadjm-Tehrani Department of
More informationSocial-Aware Routing in Delay Tolerant Networks
Social-Aware Routing in Delay Tolerant Networks Jie Wu Dept. of Computer and Info. Sciences Temple University Challenged Networks Assumptions in the TCP/IP model are violated DTNs Delay-Tolerant Networks
More informationImpact of Social Networks in Delay Tolerant Routing
Impact of Social Networks in Delay Tolerant Routing Eyuphan Bulut, Zijian Wang and Boleslaw K. Szymanski Department of Computer Science and Center for Pervasive Computing and Networking Rensselaer Polytechnic
More informationA Qualitative Survey on Multicast Routing in Delay Tolerant Networks
A Qualitative Survey on Multicast Routing in Delay Tolerant Networks Sushovan Patra 1, Sujoy Saha 2, Vijay Shah 1, Satadal Sengupta 1, Konsam Gojendra Singh 1, and Subrata Nandi 1 1 Department of Computer
More informationResearch Article Probabilistic Routing Based on Two-Hop Information in Delay/Disruption Tolerant Networks
Journal of Electrical and Computer Engineering Volume 215, Article ID 91865, 11 pages http://dx.doi.org/1.1155/215/91865 Research Article Probabilistic Routing Based on Two-Hop Information in Delay/Disruption
More informationCombined Mobile Ad-hoc and Delay/Disruption-tolerant Routing
This is an authors' version of the manuscript. Final version published in Proc. 13th International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW '14). Springer LNCS 8487, pp. 1-14, 2014. The final
More informationRouting Issues & Performance Of Different Opportunistic Routing Protocols In Delay Tolerant Network
Routing Issues & Performance Of Different Opportunistic Routing Protocols In Delay Tolerant Network Ankur Upadhyay Department of Computer Science & Engineering School of Engineering & Technology, IFTM
More informationTowards Distributed Network Classification for Mobile Ad hoc Networks
Towards Distributed Network Classification for Mobile Ad hoc Networks (Invited Paper) Dimitrios Antonellis Electrical Engineering Dept University of Southern California dimitria@usc.edu Ahmed Mansy College
More informationA SURVEY ON OPPORTUNISTIC ROUTING PROTOCOLS IN CELLULAR NETWORK FOR MOBILE DATA OFFLOADING
A SURVEY ON OPPORTUNISTIC ROUTING PROTOCOLS IN CELLULAR NETWORK FOR MOBILE DATA OFFLOADING Sanjit Kumar Dash 1, Chandrakanta Mahanty 2, Sasmita Mishra 3 and Jibitesh Mishra 1 1 College of Engineering and
More informationA Comparative Simulation of Opportunistic Routing Protocols Using Realistic Mobility Data Obtained from Mass Events
A Comparative Simulation of Opportunistic Routing Protocols Using Realistic Mobility Data Obtained from Mass Events Arno Barzan, Bram Bonné, Peter Quax, Wim Lamotte Hasselt University - tul - iminds Wetenschapspark
More informationComparative Study of Routing Protocols for Opportunistic Networks
Comparative Study of Routing Protocols for Opportunistic Networks Majeed Alajeely School of Information Technology Deakin University Melbourne, Australia Email: malajeel@deakin.edu.au Asma a Ahmad School
More informationOPS An Opportunistic Networking Protocol Simulator for OMNeT++
OPS An Opportunistic Networking Protocol Simulator for OMNeT++ Asanga Udugama, Anna Förster, Jens Dede, Vishnupriya Kuppusamy and Anas bin Muslim University of Bremen, Germany OMNeT++ Community Summit
More informationCost Efficient Erasure Coding based Routing in Delay Tolerant Networks
Cost Efficient Erasure Coding based Routing in Delay Tolerant Networks Eyuphan Bulut, Zijian Wang and Boleslaw K. Szymanski Department of Computer Science and Center for Pervasive Computing and Networking
More informationModeling Redundancy-based Routing in Delay Tolerant Networks
Modeling Redundancy-based Routing in Delay Tolerant Networks Yong Liao, Kun Tan, Zhensheng Zhang, Lixin Gao Dep. of Electrical & Computer Eng. Microsoft Research Asia San Diego Research Center University
More informationMethods to Resolve Traffic Jams using VANET
Methods to Resolve Traffic Jams using VANET Rohit Kumar Department of Computer Sc. & Engineering Chandigarh University, Gharuan Mohali, Punjab Abstract - In this paper we have proposed a method to avoid
More informationMessage Transmission with User Grouping for Improving Transmission Efficiency and Reliability in Mobile Social Networks
, March 12-14, 2014, Hong Kong Message Transmission with User Grouping for Improving Transmission Efficiency and Reliability in Mobile Social Networks Takuro Yamamoto, Takuji Tachibana, Abstract Recently,
More informationA CHECKPOINT BASED MESSAGE FORWARDING APPROACH FOR OPPORTUNISTIC COMMUNICATION
A CHECKPOINT BASED MESSAGE FORWARDING APPROACH FOR OPPORTUNISTIC COMMUNICATION Osman Khalid osman.khalid@ndsu.edu Limin Zhang limin.zhang@ndsu.edu Sajjad A. Madani COMSATS Institute of Information Technology,
More informationMDR Based Cooperative Strategy Adaptation in Wireless Communication
MDR Based Cooperative Strategy Adaptation in Wireless Communication Aswathy Mohan 1, Smitha C Thomas 2 M.G University, Mount Zion College of Engineering, Pathanamthitta, India Abstract: Cooperation among
More informationStudy on Indoor and Outdoor environment for Mobile Ad Hoc Network: Random Way point Mobility Model and Manhattan Mobility Model
Study on and Outdoor for Mobile Ad Hoc Network: Random Way point Mobility Model and Manhattan Mobility Model Ibrahim khider,prof.wangfurong.prof.yinweihua,sacko Ibrahim khider, Communication Software and
More informationEA-Epidemic: An Energy Aware Epidemic-Based Routing Protocol for Delay Tolerant Networks
Journal of Communications Vol. 12, No. 6, June 217 EA-Epidemic: An Energy Aware Epidemic-Based Routing Protocol for Delay Tolerant Networks Bhed B. Bista 1 and Danda B. Rawat 2 1 Iwate Prefectural University,
More informationImpact of Social Networks on Delay Tolerant Routing
Impact of Social Networks on Delay Tolerant Routing Eyuphan Bulut, Zijian Wang and Boleslaw K. Szymanski Department of Computer Science and Center for Pervasive Computing and Networking Rensselaer Polytechnic
More informationBuffer Dimensioning of Delay-Tolerant Network Nodes - A Large Deviations Approach
Buffer Dimensioning of Delay-Tolerant Network Nodes - A Large Deviations Approach Veeramani Mahendran, Thammana Praveen, and C. Siva Ram Murthy Department of Computer Science and Engineering Indian Institute
More informationExploiting Heterogeneity in Mobile Opportunistic Networks: An Analytic Approach
Exploiting Heterogeneity in Mobile Opportunistic Networks: An Analytic Approach 7 th Annual IEEE Communication Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (IEEE SECON 10)
More informationNodes Misbehavior in Vehicular Delay-Tolerant Networks
Nodes Misbehavior in Vehicular Delay-Tolerant Networks Naércio Magaia, Paulo Rogério Pereira, Miguel P. Correia INESC-ID/IST/UTL, Rua Alves Redol, 9. 1000-029 LISBOA, Portugal {naercio.magaia, miguel.p.correia}@ist.utl.pt,
More informationMaxHopCount: DTN congestion control algorithm under MaxProp routing
206 MaxHopCount: DTN congestion control algorithm under MaxProp routing Youssef HARRATI and Abdelmounaim ABDALI, Cadi Ayyad University, faculty of Sciences & Techniques / Laboratory of Applied Mathematics
More informationDesign of Simulator for Finding the Delay Distribution in Delay Tolerant Networking
Global Journal of Computer Science and Technology Network, Web & Security Volume 12 Issue 14 Version 1. Year 212 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals
More informationKeywords: Store and carry networks, Forwarding strategies, routing, DTN, Minimum hop transmission
Global Journal of Computer Science and Technology Volume 11 Issue 9 Version 1.0 May 2011 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) ISSN: 0975-4172
More informationFerry Access Points and Sticky Transfers: Improving Communication in Ferry-assisted DTNs
Ferry Access Points and Sticky Transfers: Improving Communication in Ferry-assisted DTNs Farzana Yasmeen, Nurul Huda, Shigeki Yamada Department of Informatics, Sokendai National Institute of Informatics
More informationRouting in Large-Scale Buses Ad Hoc Networks
1 Routing in Large-Scale Buses Ad Hoc Networks Michel Sede, Xu Li *, Da Li *, Min-You Wu * Laboratory for Computer Communications and Applications, EPFL, Switzerland * Department of Computer Science and
More informationA Genetic-Neural Approach for Mobility Assisted Routing in a Mobile Encounter Network
A Genetic-Neural Approach for obility Assisted Routing in a obile Encounter Network Niko P. Kotilainen, Jani Kurhinen Abstract--obility assisted routing (AR) is a concept, where the mobility of a network
More informationIntegrated Routing Protocol for Opportunistic Networks
Integrated Routing Protocol for Opportunistic Networks Anshul Verma Computer Science and Engineering Dept. ABV-Indian Institute of Information Technology and Management, Gwalior, India E-mail: anshulverma87@gmail.com
More informationOverhead Reduction In Delay Tolerant Networks
Overhead Reduction In Delay Tolerant Networks Azadeh Omidvar School of Electrical Engineering Iran University of Science and Technology Tehran, Iran omidvar@elec.iust.ac.ir Karim Mohammadi School of Electrical
More informationDTN Interworking for Future Internet Presented by Chang, Dukhyun
DTN Interworking for Future Internet 2008.02.20 Presented by Chang, Dukhyun Contents 1 2 3 4 Introduction Project Progress Future DTN Architecture Summary 2/29 DTN Introduction Delay and Disruption Tolerant
More informationPublication VI Institute of Electrical and Electronics Engineers (IEEE)
Publication VI Mikko Pitkänen, Ari Keränen, and Jörg Ott. 2008. Message fragmentation in opportunistic DTNs. In: Proceedings of the Second IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications
More informationhash chains to provide efficient secure solutions for DSDV [7].
A Ferry-based Intrusion Detection Scheme for Sparsely Connected Ad Hoc Networks M. Chuah, P.Yang, J. Han {chuah, pey24, jih26}@cse.lehigh.edu Department of Computer Science & Engineering Lehigh University
More informationOptimising Replication versus Redundancy in Window-aware Opportunistic Routing
Optimising Replication versus Redundancy in Window-aware Opportunistic Routing Gabriel Sandulescu University of Luxembourg gabriel.sandulescu@uni.lu Simin Nadjm-Tehrani Linköping University, Sweden simin@ida.liu.se
More informationIncreasing Reality for DTN Protocol Simulations
Increasing Reality for DTN Protocol Simulations Ari Keränen and Jörg Ott Helsinki University of Technology, Networking Laboratory {akeranen,jo}@netlab.tkk.fi Abstract Powerful personal devices provide
More informationBuffer Management in Delay Tolerant Networks
Buffer Management in Delay Tolerant Networks Rachana R. Mhatre 1 And Prof. Manjusha Deshmukh 2 1,2 Information Technology, PIIT, New Panvel, University of Mumbai Abstract Delay tolerant networks (DTN)
More informationNeed of Removing Delivered Message Replica from Delay Tolerant Network - A Problem Definition
I. J. Computer Network and Information Security, 2012, 12, 59-64 Published Online November 2012 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijcnis.2012.12.06 Need of Removing Delivered Message Replica
More informationGeographic information based Replication and Drop Routing (GeoRaDR): A Hybrid Message Transmission Approach for DTNs
Geographic information based Replication and Drop Routing (GeoRaDR): A Hybrid Message Transmission Approach for DTNs Dr. Santhi Kumaran Associate Professor, Dept of Computer Engineering,
More informationOn Information Sharing Scheme for Automatic Evacuation Guiding System Using Evacuees Mobile Nodes
On Information Sharing Scheme for Automatic Evacuation Guiding System Using Evacuees Mobile Nodes Nobuhisa Komatsu, Masahiro Sasabe, and Shoji Kasahara Graduate School of Information Science, Nara Institute
More informationProbabilistic Routing With Multi-copies in Delay Tolerant Networks
Probabilistic Routing With Multi-copies in Delay Tolerant Networks Ze Li and Haiying Shen Department of Computer Science and Computer Engineering University of Arkansas, Fayetteville, AR 7701 {zxl008,
More informationA comprehensive-integrated buffer management strategy for opportunistic networks
Pan et al. EURASIP Journal on Wireless Communications and Networking 2013, 2013:103 RESEARCH Open Access A comprehensive-integrated buffer management strategy for opportunistic networks Daru Pan 1*, Zhaohua
More informationThreshold Based Best Custodian Routing Protocol for Delay Tolerant Network
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL ISSN 1841-9836, 10(3):298-307, June, 2015. Threshold Based Best Custodian Routing Protocol for Delay Tolerant Network Q. Ayub, M. S. Mohd Zahid,
More informationThe DTN code has been tested with ns-2.35 [1]. There is no need to re-install ns-2 if ns-2.35 has already been installed.
DTN Code for ns-2.35 The DTN code has been tested with ns-2.35 [1]. There is no need to re-install ns-2 if ns-2.35 has already been installed. The DTN code may work with earlier ns-2 versions, too. However,
More informationOptimal Buffer Management Policies for Delay Tolerant Networks
Optimal Buffer Management Policies for Delay Tolerant Networks Chadi BARAKAT INRIA Sophia Antipolis, France Planète research group Joint work with Amir Krifa and Thrasyvoulos Spyropoulos Email: Chadi.Barakat@sophia.inria.fr
More informationRouting in a Delay Tolerant Network
Routing in a Delay Tolerant Network Vladislav Marinov Jacobs University Bremen March 31st, 2008 Vladislav Marinov Routing in a Delay Tolerant Network 1 Internet for a Remote Village Dial-up connection
More informationPerformance Evaluations of Various Message Ferry Scheduling Schemes with Two Traffic Classes Mooi Choo Chuah
Performance Evaluations of Various Message Ferry Scheduling Schemes with Two Traffic Classes Mooi Choo Chuah Peng Yang Department of Computer Science and Engineering Department of Computer Science and
More informationImproving Network Performance with Affinity based Mobility Model in Opportunistic Network
Improving Network Performance with Affinity based Mobility Model in Opportunistic Network Suvadip Batabyal, Parama Bhaumik Dept. of Information Technology Jadavpur University, Kolkata (WB), India {mailto.sbatabyal@gmail.com,
More informationMinimax Theory Based Scheme to Detect Selfish Node and Reduce Latency in Delay Tolerant Network
Conference on Advances in Communication and Control Systems 2013 (CAC2S 2013) Minimax Theory Based Scheme to Detect Selfish Node and Reduce Latency in Delay Tolerant Network Dhiraj kr. Mishra * M.Tech,
More informationCARPOOL: Connectivity Plan Routing Protocol
CARPOOL: Connectivity Plan Routing Protocol Ioannis Komnios and Vassilis Tsaoussidis Space Internetworking Center, Office 1, Building A, Panepistimioupoli Kimmeria, Department of Electrical and Computer
More informationApplication of Graph Theory in DTN Routing
Application of Graph Theory in DTN Routing Madan H. T. 1, Shabana Sultana 2 1 M. Tech. (CNE), NIE, Mysuru 2 Associate Professor, Dept. of Computer Science & Eng., NIE, Mysuru Abstract: Delay tolerant network
More informationAODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
More informationVDTNsim: A Simulation Tool for Vehicular Delay-Tolerant Networks
VDTNsim: A Simulation Tool for Vehicular Delay-Tolerant Networks Vasco N. G. J. Soares 1,2,3, Farid Farahmand 4, and Joel J. P. C. Rodrigues 1,2 1 Instituto de Telecomunicações, Portugal 2 Department of
More informationPerformance Analysis of Routing Protocol in Delay Tolerant Network
Performance Analysis of Routing Protocol in Delay Tolerant Network 1 Dharmendrasinh B. Solanki, 2 Mr. Pratik D. Patel 1 PG Student, 2 Assistant Professor, 1 Electronics and Communication Department, 1
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta Jetcheva Presentation by: Michael Molignano Jacob
More informationRouting in Delay Tolerant Networks (2)
Routing in Delay Tolerant Networks (2) Primary Reference: E. P. C. Jones, L. Li and P. A. S. Ward, Practical Routing in Delay-Tolerant Networks, SIGCOMM 05, Workshop on DTN, August 22-26, 2005, Philadelphia,
More informationA DTN Packet Forwarding Scheme Inspired by Thermodynamics
A DTN Packet Forwarding Scheme Inspired by Thermodynamics Mehdi Kalantari and Richard J. La Department of Electrical and Computer Engineering University of Maryland {mehkalan, hyongla}@umd.edu Abstract
More informationMolecular Statistics Exercise 1. As was shown to you this morning, the interactive python shell can add, subtract, multiply and divide numbers.
Molecular Statistics Exercise 1 Introduction This is the first exercise in the course Molecular Statistics. The exercises in this course are split in two parts. The first part of each exercise is a general
More informationMinimizing Average Spraying Cost for Routing in Delay Tolerant Networks
Minimizing Average Spraying Cost for Routing in Delay Tolerant Networks Eyuphan Bulut, Zijian Wang and Boleslaw K. Szymanski Department of Computer Science and Center for Pervasive Computing and Networking
More informationCommunity-Based Adaptive Buffer Management Strategy in Opportunistic Network
Community-Based Adaptive Buffer Management Strategy in Opportunistic Network Junhai Zhou, Yapin Lin ( ), Siwang Zhou, and Qin Liu College of Computer Science and Electronic Engineering, Hunan University,
More informationRouting with Multi-Level Social Groups in Mobile Opportunistic Networks
Routing with Multi-Level Social Groups in Mobile Opportunistic Networks Lunan Zhao Fan Li Chao Zhang Yu Wang School of Computer Science, Beijing Institute of Technology, Beijing, 100081, China. Department
More informationNetwork Routing Without Delay Using Message Scheduling
ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Special Issue 3, March 2014 2014 International Conference
More informationPreDA: Predicate Routing for DTN Architectures over MANET
Boston University OpenBU Computer Science http://open.bu.edu CAS: Computer Science: Technical Reports 9-- PreDA: Routing for Architectures over Esposito, Flavio Boston University Computer Science Department
More informationCapacity-Aware Routing Using Throw-Boxes
Capacity-Aware Routing Using Throw-Boxes Bo Gu, Xiaoyan Hong Department of Computer Science University of Alabama, Tuscaloosa, AL 35487 {bgu,hxy}@cs.ua.edu Abstract Deploying the static wireless devices
More informationImpact of Selective Dropping Attacks on Network Coding Performance in DTNs and a Potential Mitigation Scheme
1 Impact of Selective Dropping Attacks on Network Coding Performance in DTNs and a Potential Scheme M. Chuah, P. Yang Department of Computer Science & Engineering Lehigh University chuah@cse.lehigh.edu,
More informationDelay Tolerant Networks
Delay Tolerant Networks DEPARTMENT OF INFORMATICS & TELECOMMUNICATIONS NATIONAL AND KAPODISTRIAN UNIVERSITY OF ATHENS What is different? S A wireless network that is very sparse and partitioned disconnected
More informationInternational Journal of Computer Engineering and Applications, Volume XII, Special Issue, August 18, ISSN
International Journal of Computer Engineering and Applications, ANALYZING IMPACT OF FACTORS ON ROUTING DECISIONS IN OPPORTUNISTIC MOBILE NETWORKS Sonam Kumari 1, Dr. Itu Snigdh 2 Department of Computer
More informationI. INTRODUCTION. Keywords-disruption tolerant networks; custody transfer; route discovery; message ferry
Performance Comparison of Unicast Routing Schemes in DTNs Mooi Choo Chuah, Peng Yang, Brian D. Davison, Liang Cheng {chuah, pey204, davison, cheng}@cse.lehigh.edu Lehigh University Abstract Delay and disruption
More informationA ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DELAY-TOLERANT NETWORKS
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DELAY-TOLERANT NETWORKS ABSTRACT Zhang Huijuan and Liu Kai School of Software Engineering, Tongji University, Shanghai, China
More informationPerformance Analysis of CSI:T Routing in a Delay Tolerant Networks
Performance Analysis of CSI:T Routing in a Delay Tolerant Networks Hardika Kusuma Putri Telkom University Bandung, Indonesia Dkusuma007@gmail.com Leanna Vidya Yovita, and Ridha Muldina Negara Telkom University
More informationA Review on Routing In Partially Connected Ad-Hoc Network
Computing For Nation Development, March 10 11, 2011 Bharati Vidyapeeth s Institute of Computer Applications and Management, New Delhi Anupam Baliyan 1 and Sanjeev Gupta 2 1 IMR, Duhai, Ghaziabad, 9818327524
More informationARE VDTN ROUTING PROTOCOLS SUITABLE FOR DATA COLLECTION IN SMART CITIES: A PERFORMANCE ASSESSMENT
ARE VDTN ROUTING PROTOCOLS SUITABLE FOR DATA COLLECTION IN SMART CITIES: A PERFORMANCE ASSESSMENT 1 NABIL BENAMAR, 1 MARIA BENAMAR, 1 SARA AHNANA, 1 FATIMA ZAHRAE SAIYARI, 1 MOULAY DRISS EL OUADGHIRI,
More information