Contact quality based forwarding strategy for delay tolerant network Qaisar Ayub, Sulma Rashid, M.Soperi Mohd Zahid, Abdul Hanan Abdullah Adviser:Frank.

Slides:



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

Transportation-aware Routing in Delay Tolerant Networks (DTNs) Asia Future Internet 2008 Taekyoung Kwon Seoul National University.
Supporting Cooperative Caching in Disruption Tolerant Networks
ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES ZHENSHENG ZHANG.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
A Novel Framework of Message Scheduling in Delay Tolerant Networks (DTNs) with Buffer Limitation Dr. Pin-Han Ho Associate Professor University of Waterloo,
Delay bounded Routing in Vehicular Ad-hoc Networks Antonios Skordylis Niki Trigoni MobiHoc 2008 Slides by Alex Papadimitriou.
CSLI 5350G - Pervasive and Mobile Computing Week 3 - Paper Presentation “RPB-MD: Providing robust message dissemination for vehicular ad hoc networks”
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.
University of Waterloo & UOIT & INRIA Lille Presenter: Rongxing Lu
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Deadline-sensitive Opportunistic Utility-based Routing in Cyclic Mobile Social Networks Mingjun Xiao a, Jie Wu b, He Huang c, Liusheng Huang a, and Wei.
Grammati Pantziou 1, Aristides Mpitziopoulos 2, Damianos Gavalas 2, Charalampos Konstantopoulos 3, and Basilis Mamalis 1 1 Department of Informatics, Technological.
Incentive Based Data Sharing in Delay Tolerant Mobile Networks.
A Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Meenakshi Mittal ©2010 International Journal of Computer Applications ( )Volume.
ROUTING ALGORITHMS IN AD HOC NETWORKS
Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,
Authors: Ioannis Komnios Sotirios Diamantopoulos Vassilis Tsaoussidis ComNet Group.
Lab for Advanced Network Design, Evaluation and Research Mobility Profile based Routing Within Intermittently Connected Mobile Ad hoc Networks (ICMAN)
Cooperation in DTN-Based Network Architectures
Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.
Routing In Socially Selfish Delay Tolerant Networks Chan-Myung Kim
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
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.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks Reporter: Yanlin Peng Wenrui Zhao, Mostafa Ammar, College of Computing,
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
Research into the hybridization of the PRoPHET and ERP network routing algorithms George Mason University INFS 612 (Spring 2013) Project Group 4: Richard.
Content Dissemination in Mobile Social Networks Cheng-Fu Chou.
A Sociability-Based Routing Scheme for Delay-Tolerant Networks May Chan-Myung Kim
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
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.
An Improved Vehicular Ad Hoc Routing Protocol for City Environments Moez Jerbi, Sidi-Mohammed Senouci, and Rabah Meraihi France Telecom R&D, Core Network.
Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Multicasting in delay tolerant networks a social network perspective networks October2012 In-Seok Kang
© 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.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Chien-Shiu Lin, Wei-Shyh Chang, Ling-Jyh Chen, Cheng-Fu Chou, and Ting-Kai Huang.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Network Valery Naumov, and Thomas R. Gross Proceedings of IEEE 26 th International Conference on Computer.
-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.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Analysis the performance of vehicles ad hoc network simulation based
Delay-Tolerant Networks (DTNs)
DELAY TOLERANT NETWORK
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Multi-Hop Broadcast from Theory to Reality:
Cross-layer DTN Task Scheduling in Disaster Recovery
Header Store & Haul Improving Mobile Ad-Hoc Network Connectivity through Repeated Controlled Flooding Thesis Presentation Robert Tyson Thedinger Department.
Presentation transcript:

Contact quality based forwarding strategy for delay tolerant network Qaisar Ayub, Sulma Rashid, M.Soperi Mohd Zahid, Abdul Hanan Abdullah Adviser:Frank. Yeong-Sung Lin Present by Li-Min Zheng

Agenda  Introduction  The review of DTN routing protocols  System model  Simulations and results  Conclusion

Introduction

 The ad hoc protocols maintain routing information about intermediate links from source to destination before the transmission of data.  These privileges are impossible in delay tolerant network, where frequency of disconnections is high due to network partitioning, node movement, dynamic topology change and periodic shutdown of low energy nodes.  The applications such as wildlife monitoring, military and urban areas network are possessed with such attributes.

Introduction  In delay tolerant network, the message transmission is achieved via intermittent opportunistic connections by adopting store carry and forward paradigm wherein node stores an incoming message in its buffer, carries it while moving, and forwards when comes within the transmission range of other nodes.  The DTN routing protocols can be either single copy or multi-copy.  single copy  multi-copy.

Introduction  Consider a city-based environment partitioned into multiple regions caused by the intersection of buildings.  Pedestrians  Bus  Trains  cars  cabs  DTN in city-based environment  good-quality nodes  message drops

Introduction  We have proposed message forwarding strategy called as Contact Quality Based Forwarding Strategy(CQBFS) for city based environments composed of heterogeneous network traffic, including pedestrians, cars, city buses, trains and cabs.  We have monitored the current activity of nodes by modifying the transmit factor and drop factor with detailed algorithmic descriptions.  We have proposed an efficient buffer management quality impact based buffer management policy to reduce the impact of message drop on the network throughput.  We have analyzed the performance of existing and proposed strategy by the real time trace Sassy and Helsinki city Finland with well known routing protocols such as PRoPHET,Epidemic, Maxprop and Time to live(TTL)basedrouting.

The review of DTN routing protocols

System model

System Model

 Model Name:Contact quality based forwarding strategy (CQBFS)  The existing probabilistic models compute quality value for a node in terms of delivery probability that is based on encountering frequency to meet message destination.  The proposed CQBFS modifies the operational architecture of transmit and drop factor(Ayub et al.,2013a) along with quality impact based buffer management policy and presents the comprehensive algorithmic descriptions of designed methodology by using following fourmodules:  Self-Statistical Update Module(SSUM)  Neighboring Statistical Update Module(NSUM)  Quality Update Module(QUM)  Contact Quality Scheduler(CQS)

System Model

 Self-Statistical Update Module(SSUM)

System Model

 Neighboring Statistical Update Module(NSUM)  The following four vectors are used to store the statistics about neighboring nodes: (i)Recent Encounter Vector (REV) (ii) Trans- mit Count Vector (TCV) (iii) Drop Count Vector (DCV) (iv)Receive Count Vector (RCV).

System Model  Neighboring Statistical Update Module(NSUM)  Recent Encounter Vector (REV)

System Model  Neighboring Statistical Update Module(NSUM)  Transmit Count Vector (TCV)

System Model  Neighboring Statistical Update Module(NSUM)  Drop Count Vector (DCV)

System Model  Neighboring Statistical Update Module(NSUM)  Receive Count Vector (RCV).

System Model  Neighboring Statistical Update Module(NSUM)

System Model

 Quality Update Module(QUM) (i)DF(Drop fator) (ii) TF(Trasmit factor) (iii) QV(Quality vector)

System Model  Quality Update Module(QUM)

System Model  Quality Update Module(QUM)

System Model  Quality Update Module(QUM)

System Model

 Contact Quality Scheduler(CQS)  The CQB scheduler consists of (i)Message Forwarding Unit (MFU) (ii)Buffer Management Unit (BMU)

System Model  Contact Quality Scheduler(CQS)  Message Forwarding Unit (MFU)

System Model  Contact Quality Scheduler(CQS)  Buffer Management Unit (BMU)  In the proposed buffer scheduling policy, we have used a vector titled as Quality Impact Vector (QIV).  The quality impact vector consists of Message Id and its Quality Impact (QI).  The QI has different meanings for source and relay.  source message  relay message

System Model  Contact Quality Scheduler(CQS)  Buffer Management Unit (BMU)

System Model  Contact Quality Scheduler(CQS)  Buffer Management Unit (BMU)

System Model  Contact Quality Scheduler(CQS)

Simulations and results

 The assessment of routing protocols has been investigated under ONE (Keränen et al., 2009) simulator. ONE is a discrete event simulator written in JAVA and has been particularly used by a numerous researchers to analyze the disrupted store- carry- forward applications.  We have compared the CQBFS with PRoPHET, Epidemic MAXPROP and TTL based routing protocols in terms of minimizing the number of transmissions, message drop, overhead and increasing delivery ratio.  Two Scenario:  SCENARIO-01: real time trace sassy  SCENARIO-02: Helsinki city based environment

Simulations and results  SCENARIO-01: real time trace sassy  The trace consists of 25 mobile devices carried by the pedestrians.  In scenario 1 the proposed CQBFS is compared with PRoPHET, Epidemic, Maxprop and TTL based routing protocols under the metric of  transmissions  message drop  delivery ratio

Simulations and results  SCENARIO-01: real time trace sassy

Simulations and results  SCENARIO-01: real time trace sassy

Simulations and results  SCENARIO-01: real time trace sassy

Simulations and results  SCENARIO-02: Helsinki city based environment  Consists of heterogeneous traffic : (i)Pedestrians (20 each community, 0.5 km/h to 1.5 km/h, 2MB) (ii)Cars (20 each community,3 km/h to 7 km/h,2MB) (iii)Cabs (20, 3 km/h to 14 km/h, 2MB) (iv)Trams (3, 7 km/h to 10 km/ h,50MB) (v)Buses (3, 7 km/h to 10 km/ h,50MB)

Simulations and results  SCENARIO-02: Helsinki city based environment  In scenario 2 we have compared the proposed CQFS with PRoPHET, Epidemic and TTL based routing protocols based on  delivery ratio  end-to-end delay  hop count average

Simulations and results  SCENARIO-02: Helsinki city based environment

Simulations and results  SCENARIO-02: Helsinki city based environment

Simulations and results  SCENARIO-02: Helsinki city based environment

Conclusion

 In this paper, we have proposed Contact Quality Based For- warding Strategy that observes the quality of current contact in terms of its ability to carry the received messages. The various heuristics were used to determine the accuracy of suitable inter- mediate node as a message carrier. Moreover, a buffer manage- ment policy was proposed to reduce the impact of message drop on network throughput. We have measured the accuracy of existing and proposed forwarding by using real time mobility traces such as Sassy and Helsinki city. The proposed CQBFS out- performs existing PRoPHET, Epidemic, Maxprop and TTL based routing protocols in terms of minimizing the transmissions, delivery delay, hop count average and raising the delivery ratio.

Thanks for your listening