Authors: Ioannis Komnios Sotirios Diamantopoulos Vassilis Tsaoussidis ComNet Group.

Slides:



Advertisements
Similar presentations
Robin Kravets Tarek Abdelzaher Department of Computer Science University of Illinois The Phoenix Project.
Advertisements

Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future.
Scalable Routing in Delay Tolerant Mobile Networks Hao Wen 1 Jia Liu, Chuang Lin, Fengyuan Ren, Chuanpin Fu 1 Department of Computer Science, Tsinghua.
ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES ZHENSHENG ZHANG.
A Novel Framework of Message Scheduling in Delay Tolerant Networks (DTNs) with Buffer Limitation Dr. Pin-Han Ho Associate Professor University of Waterloo,
- Paper By Yunfeng Lin, Baochun Li, Ben Liang. Outline Motivation Constraints in DTN Network coding Vs Replication Binary Spraying Vs Epidemic routing.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
Contact quality based forwarding strategy for delay tolerant network Qaisar Ayub, Sulma Rashid, M.Soperi Mohd Zahid, Abdul Hanan Abdullah Adviser:Frank.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
On Using Probabilistic Forwarding to Improve HEC-based Data Forwarding in Opportunistic Networks Ling-Jyh Chen 1, Cheng-Long Tseng 2 and Cheng-Fu Chou.
A Probabilistic Misbehavior Detection Scheme towards Efficient Trust Establishment in Delay-tolerant Networks Haojin Zhu, Suguo Du, Zhaoyu Gao, Mianxiong.
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks Temporally-Ordered Routing Algorithm (TORA) IEEE INFOCOM 112/4/20031Authors.
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
1 Part 3. Research Themes Social-based Communication Epidemiology Complex Networks Human Mobility Social Phenomena DTN Capacity.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Mesh Networks A.k.a “ad-hoc”. Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology- each.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 22 Introduction to Computer Networks.
DTNLite: Reliable Data Delivery in Sensornets Rabin Patra and Sergiu Nedevschi UCB Nest Retreat 2004.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
Potential-Based Entropy Adaptive Routing for Disruption Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT DTNRG, IETF 76 Hiroshima,
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks By Kiana Karimpour.
Effective Buffer and Storage Management in DTN Nodes Stylianos Dimitriou, and Vassilis Tsaoussidis Dept. of Electrical and Computer Engineering Democritus.
Infrastructure of MANETs  MANETS are without a fixed infrastructure  Network Graphs in MANETS are rarely or ever connected  MANET routing protocols.
International Workshop on Satellite and Space Communications 2009, IWSSC 2009, 9-11 September 2009, Siena, Italy Evaluation of CCSDS File Delivery Protocol.
Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,
A Hybrid Routing Approach for Opportunistic Networks Ling-Jyh Chen 1, Chen-Hung Yu 2, Tony Sun 3, Yung-Chih Chen 1, and Hao-hua Chu 2 1 Academia Sinica.
1 Delay Tolerant Network Routing Sathya Narayanan, Ph.D. Computer Science and Information Technology Program California State University, Monterey Bay.
CA-RTO: A Contention- Adaptive Retransmission Timeout I. Psaras, V. Tsaoussidis, L. Mamatas Demokritos University of Thrace, Xanthi, Greece This study.
Link Estimation, CTP and MultiHopLQI. Learning Objectives Understand the motivation of link estimation protocols – the time varying nature of a wireless.
V. Tsaoussidis, DUTH – Greece
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
BZUPAGES.COM Presentation On SWITCHING TECHNIQUE Presented To; Sir Taimoor Presented By; Beenish Jahangir 07_04 Uzma Noreen 07_08 Tayyaba Jahangir 07_33.
Design, Implementation and Tracing of Dynamic Backpressure Routing for ns-3 José Núñez-Martínez Research Engineer Centre Tecnològic de Telecomunicacions.
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
Dzmitry Kliazovich University of Luxembourg, Luxembourg
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
CSR: Cooperative Source Routing Using Virtual MISO in Wireless Ad hoc Networks IEEE WCNC 2011 Yang Guan, Yao Xiao, Chien-Chung Shen and Leonard Cimini.
Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.
1 Part 3. Research Themes Social-based Communication Epidemiology Complex Networks Human Mobility Social Phenomena DTN Capacity.
© SITILabs, University Lusófona, Portugal1 Chapter 2: Social-aware Opportunistic Routing: the New Trend 1 Waldir Moreira, 1 Paulo Mendes 1 SITILabs, University.
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
Introduction Computer networks: – definition – computer networks from the perspectives of users and designers – Evaluation criteria – Some concepts: –
A Cross-Layer Approach for Cooperative Networks By Ioannis Krikidis, John Thompson and Norbert Goertz, Senior Presentation prepared by: Amir Minayi Jalil.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
Structure-Free Data Aggregation in Sensor Networks.
March 9, Broadcasting with Bounded Number of Redundant Transmissions Majid Khabbazian.
Chien-Shiu Lin, Wei-Shyh Chang, Ling-Jyh Chen, Cheng-Fu Chou, and Ting-Kai Huang.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
2010 IEEE Global Telecommunications Conference, GLOBECOM 2010 Zheng Guo; Bing Wang; Jun-Hong Cui Prediction Assisted Single-copy Routing in Underwater.
Delay-Tolerant Networks (DTNs)
DELAY TOLERANT NETWORK
Static and Default Routing
Feng Li, Jie Wu, Avinash Srinivasan
ECE 544 Protocol Design Project 2016
After 3.2 Revised
A survey in Delay Tolerant Networks Andrew Steinberg and Rafael Papa.
Header Store & Haul Improving Mobile Ad-Hoc Network Connectivity through Repeated Controlled Flooding Thesis Presentation Robert Tyson Thedinger Department.
Presentation transcript:

Authors: Ioannis Komnios Sotirios Diamantopoulos Vassilis Tsaoussidis ComNet Group

Problem Routing in DTN environments is an open issue  No consensus reached yet Several approaches have been proposed  Each one of them may perform better under specific conditions, eg. DTNs with small delays or with random connectivity pattern ComNet Group 2

Paper objective Which routing protocol performs better in Space environment, where conditions such as long delays and high error rates are present Research Methodology Emulations using ComNet Lab’s DTN testbed Statistical analysis 3 ComNet Group

Protocol Description Epidemic routing  Transmitted data is continuously replicated until all nodes receive a copy  If a path towards the receiver is to become available any time in the future, it will be utilized for successful delivery  Drawback: Excessive use of network resources (bandwidth, storage) ComNet Group 4

Protocol Description Probabilistic Routing Protocol using History of Encounters and Transitivity (PRoPHET)  It utilizes knowledge of previous encounters to calculate a delivery predictability to each node  Opportunistic contacts are utilized too  Drawback: there is message exchange prior to each transmission ComNet Group 5

Protocol Description Contact Graph Routing (CGR)  It utilizes knowledge of all scheduled future communication contacts  Routes can be static, dynamic or default  No exchange of connectivity information prior to data transmission is needed  Drawback: opportunistic contacts cannot be exploited ComNet Group 6

Protocol Description Epidemic Routing PRoPHET Routing Contact Graph Routing Energy-EfficientNo Yes AutonomousYes No Contacts ExploitedAll Scheduled Only QoSNo Yes ComNet Group 7

Experimental Results ComNet Group 8 Round-Trip Time Impact on Task Completion Time  Topology: 2-hop, alternate path  Transmission: 100 packets of 10 KB each, one every 5 seconds

Experimental Results ComNet Group 9 Task Completion Time for varying RTT using PRoPHET  Topology: Single-hop  Transmission: 50 packets of 10KB each, one every 5 seconds

Experimental Results ComNet Group 10 Task Completion Time for varying Filesize  Topology: 2-hop, alternate path  Transmission: one file of variable size

Experimental Results ComNet Group 11 Task Completion Time for varying PRoPHET’s Hello Timer values  Topology: 2-hop, alternate path, 2 seconds delay at every link  Transmission: 100 packets of 10 KB each, one every 5 seconds

Experimental Results ComNet Group 12 Task Completion Time for varying number of intermediate nodes using PRoPHET  Transmission: one file of variable size

Conclusions ComNet Group 13 CGR achieves considerably better performance than Epidemic and PRoPHET routing when delay is in the order of seconds PRoPHET does not perform well even for short delay values, neither for small nor for large filesizes

Any questions? ComNet Group 14 Thank you…