Cooperation in DTN-Based Network Architectures

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.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Incentive-Compatible Opportunistic Routing for Wireless Networks Fan Wu, Tingting Chen, Sheng Zhong (SUNY Buffalo) Li Erran Li Li Erran Li (Bell Labs)
Contact quality based forwarding strategy for delay tolerant network Qaisar Ayub, Sulma Rashid, M.Soperi Mohd Zahid, Abdul Hanan Abdullah Adviser:Frank.
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,
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
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
TSF: Trajectory-based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks Jaehoon Jeong, Shuo Guo, Yu Gu, Tian He,
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
DTNs Delay Tolerant Networks. Fall, Kevin. Intel Research, Berkeley. SIGCOMM 2003 Aug25, A Delay- Tolerant Network Architecture for Challenged Internets.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
A simulation-based comparative evaluation of transport protocols for SIP Authors: M.Lulling*, J.Vaughan Department of Computer science, University college.
Low Delay Marking for TCP in Wireless Ad Hoc Networks Choong-Soo Lee, Mingzhe Li Emmanuel Agu, Mark Claypool, Robert Kinicki Worcester Polytechnic Institute.
Denial of Service Resilience in Ad Hoc Networks Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly Designed by Yao Zhao.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
DELAY-TOLERANT NETWORKS Volodymyr Goncharov Freiburg Uni, WS 2009, Seminar Ad Hoc Netzwerke.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Proxy-assisted Content Sharing Using Content Centric Networking (CCN) for Resource-limited Mobile Consumer Devices Jihoon Lee, Dae Youb Kim IEEE Transactions.
Introduction to Delay Tolerant Networks Tzu-Chieh Tsai Department of Computer Science, National Cheng Chi University.
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
VIRTUAL ROUTER Kien A. Hua Data Systems Lab School of EECS University of Central Florida.
Gathering Data in Wireless Sensor Networks Madhu K. Jayaprakash.
Challenged Networking An Experimental Study of New Protocols and Architectures Erik Nordström.
1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.
GZ06 : Mobile and Adaptive Systems A Secure On-Demand Routing Protocol for Ad Hoc Networks Allan HUNT Wandao PUNYAPORN Yong CHENG Tingting OUYANG.
A Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Meenakshi Mittal ©2010 International Journal of Computer Applications ( )Volume.
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.
1 Delay Tolerant Network Routing Sathya Narayanan, Ph.D. Computer Science and Information Technology Program California State University, Monterey Bay.
On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing Argyrios Tasiopoulos MSc, student, AUEB Master Thesis presentation.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
Routing In Socially Selfish Delay Tolerant Networks Chan-Myung Kim
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.
Selfishness, Altruism and Message Spreading in Mobile Social Networks September 2012 In-Seok Kang
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,
Department of Computer Science Aruna Balasubramanian, Brian Neil Levine, Arun Venkataramani DTN Routing as a Resource Allocation Problem.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
A Sociability-Based Routing Scheme for Delay-Tolerant Networks May Chan-Myung Kim
1 TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks IEEE ICDCS’09, Montreal, Quebec, Canada Jaehoon Jeong, Shuo Gu, Yu Gu, Tian.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
An Evaluation of Routing Reliability in Non-Collaborative Opportunistic Networks Ling-Jyh Chen, Che-Liang Chiou, and Yi-Chao Chen Institute of Information.
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”,
Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.
© SITILabs, University Lusófona, Portugal1 Chapter 2: Social-aware Opportunistic Routing: the New Trend 1 Waldir Moreira, 1 Paulo Mendes 1 SITILabs, University.
Energy-Efficient Protocol for Cooperative Networks.
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
Ad-hoc Storage Overlay System (ASOS): A Delay-Tolerant Approach in MANETs Guang Yang 1, Ling-Jyh Chen 2, Tony Sun 1, Biao Zhou 1, Mario Gerla 1 1 University.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Delay-Tolerant Networks (DTNs)
DELAY TOLERANT NETWORK
Environment-Aware Reputation Management for Ad Hoc Networks
Kevin Lee & Adam Piechowicz 10/10/2009
Presentation transcript:

Cooperation in DTN-Based Network Architectures Authors: Vasco N. G. J. Soares1,2, Joel J. P. C. Rodrigues1 1 Instituto de Telecomunicações, University of Beira Interior, Covilhã, Portugal 2 Superior School of Technology, Polytechnic Institute of Castelo Branco, Portugal vasco.g.soares@ieee.org, joeljr@ieee.org Editors: Mohammad S. Obaidat1, Sudip Misra2 1 Monmouth University, USA 2 Ryerson University, Toronto, Canada obaidat@monmouth.edu, sudipm@iitkgp.ac.in

Outline Delay-Tolerant Network Vehicular Delay-Tolerant Network Cooperation in DTN-Based Networks Study of the Impact of Cooperation in a VDTN 4/23/2017

Delay-Tolerant Network (DTN) Overlays a protocol layer, called bundle layer, that it is meant to provide internetworking on heterogeneous networks operating on different transmission media Store-carry-and-forward paradigm These networks experience any combination of the following: Sparse connectivity Long or variable delay Intermittent connectivity Asymmetric data rate High latency High error rates No end-to-end connectivity 4/23/2017

Delay-Tolerant Network (DTN) Application Domains Interplanetary networks Underwater networks Wildlife tracking networks Data MULEs Transient networks Disaster recovery networks People networks Military tactical networks Vehicular networks 4/23/2017

Vehicular Delay-Tolerant Network (VDTN) VDTN architecture appears as a network architecture proposal based on the DTN architecture, that aims to provide innovative solutions for challenged vehicular communications VDTN applications Urban Scenario Disseminate information advertisements Disseminate safety related information Distribute multimedia content Monitoring networks to collect data … Rural Connectivity Provide data communications to undeveloped remote areas Disaster recovery networks 4/23/2017

VDTN Layered Architecture Based on the principle of asynchronous, bundle-oriented communication from the DTN architecture Store-carry-and-forward paradigm 4/23/2017

VDTN Layered Architecture However, the design of the VDTN network architecture, and its protocol layering, presents unique characteristics: IP over VDTN approach Control plane and data plane decoupling Out-of-band signaling 4/23/2017

VDTN Layered Architecture Control plane and data plane separation Control plane functions Signaling messages exchange, node localization, resources reservation (at the data plane) and routing, among others Data plane functions Buffer management and scheduling, traffic classification, data aggregation/de-aggregation, and forwarding, among others Distinct planes suggests that they can operate independently using their own layers and protocols 4/23/2017

VDTN Layered Architecture Out-of-band signaling Control plane Uses a separate, dedicated, low-power, low bandwidth, and long-range link to exchange signaling information Data plane Uses a high-power, high bandwidth, and short- range link to exchange data bundles 4/23/2017

Cooperation in DTN-Based Networks Cooperation is a key issue to the success of data communication in DTNs In a cooperative environment, network nodes collaborate with each other, storing and distributing bundles not only in their own interest, but also in the interest of other nodes This increases the number of possible transmission paths, improving the robustness to failure of individual nodes 4/23/2017

Cooperation in DTN-Based Networks In a non-cooperative environment, network nodes exhibit a selfish behavior This behavior can be caused by several reasons, such as, resource limitations (e.g. storage, energy) or rogue operation (malicious behavior) This leads to degradation of the network performance 4/23/2017

Cooperation in DTN-Based Networks Although cooperation is highly important to improve the limited capability of network nodes and, consequently, in increasing the overall network performance, to the best our knowledge, little research has been done in this field This chapter surveys recent advances related with the field of cooperation on delay tolerant networks Furthermore, it presents a study that evaluates the impact of cooperative behavior on the performance of a VDTN

Cooperation in DTN-Based Networks Previous works (1) Panagakis et al., “On the Effects of Cooperation in DTNs”, COMSWARE 2007 State that the literature related to the performance of DTN routing protocols usually assumes fully cooperative environments, which can be an unrealistic assumption Define cooperation as the probability of a node to forward message copies or dropped them on their arrival, and evaluate its effect in terms of delivery delay and transmission overhead on Epidemic, Two-Hop and Binary Spray and Wait routing Buttyán et al., “Barter-Based Cooperation in Delay-Tolerant Personal Wireless Networks”, WOWMOM 2007 Study the problem of selfish node behavior in DTNs used for personal wireless communications Propose a mechanism to discourage selfish node behavior during message exchange based on the principles of barter. This barter-based approach is analyzed with a game- theoretic model

Cooperation in DTN-Based Networks Previous works (2) Shevade et al., “Incentive-Aware Routing in DTNs”, ICNP 2008 Also demonstrate the degradation of a DTN network performance due to selfish node behavior Propose an incentive-aware DTN routing scheme to stimulate cooperation, which is based on the use of pair-wise tit-for-tat (TFT) incentive mechanism Resta et al., “The Effects of Node Cooperation Level on Routing Performance in Delay Tolerant Networks”, SECON 2009 Present a theoretical framework for evaluating the effects of different degrees of node cooperation on the performance of DTN routing protocols (Epidemic, Two-Hop, and Binary Spray and Wait) The observed results show that Binary Spray and Wait has the better resilience to lower node cooperation, while presenting the best compromise between packet delivery ratio and message overhead

Cooperation in DTN-Based Networks Previous works (3) Altman, “Competition and Cooperation Between Nodes in Delay Tolerant Networks with Two Hop Routing”, Lecture Notes in Computer Science, Network Control and Optimization Analyzes competitive and cooperative operation in DTNs considering a Two-Hop routing strategy The effect of competition between network nodes is studied in a game theoretical setting Solis et al., “Controlling Resource Hogs in Mobile Delay-Tolerant Networks”, Computer Communications, Elsevier Introduce the concept of “resource hog” as a network node that attempts to send more of its own data and possibly forward less peer data than a typical well-behaved node A performance evaluation through simulation reveals that the delivery ratio of “well- behaved” nodes decreases significantly in the presence of a reduced number of nodes acting as “resource hogs” The work also proposes and evaluates resource management solutions to deal with the “resource hogs” problem

Study of the Impact of Cooperation in a VDTN Simulation Settings (network setup) Modified version of the Opportunistic Network Environment (ONE) Simulator New modules added (VDTN architecture model, buffer management scheme, scheduling and drop policies for evaluating the impact of node cooperation) Simulation time of a 12-hour period (e.g., from 8:00 to 20:00) 100 Mobile Nodes (e.g. vehicles) Random pause times between 5 and 15 m Speed of 30 km/h Buffer size varies between 25, 50, 75 and 100 Megabytes across the simulations 5 Stationary Relay Nodes 500 Mbytes message buffer size Placed at selected crossroads Helsinki simulation scenario

Study of the Impact of Cooperation in a VDTN Simulation Settings (network setup) Data Bundles Size is uniformly distributed in the range of [250 K, 2 M] Bytes Inter-bundle creation interval in the range [15, 30] seconds Random source and destination vehicles Time-to-live (TTL) of 180 minutes Data bundles transmitted through a link with a data rate of 6 Mbps and an omni-directional transmission range of 30 meters Epidemic and Binary Spray and Wait are used as the underlying routing schemes Performance metrics: bundle delivery probability; bundle delivery delay We analyze different performance results when mobile nodes employ 10, 20, 30, 40, or 50 percent of their buffer capacity and bandwidth resources to cooperate in bundle relay

Study of the Impact of Cooperation in a VDTN Epidemic routing (1) Delivery Probability 20 % of cooperation percentage means that: 20% of a node’s buffer capacity is used to store bundles relayed by other nodes, while the remaining 80% are available to store its bundles In addition, at a contact opportunity, only 20% of the transmission link bandwidth will be used to relay the other nodes bundles When network nodes use a 25 MB buffer, increasing the cooperation percentage from 10% to 20%, results in improving the overall delivery ratio in 13% A better delivery ratio can be obtained using a 25 MB buffer size and a 30% cooperation percentage, instead of a 100 MB buffer with a 10% cooperation percentage Effect of node cooperation percentage on the delivery probability

Study of the Impact of Cooperation in a VDTN Epidemic routing (2) Delivery Delay Increasing the mobile nodes buffer size, contributes to increase the delivery ratio, but also increases the average delivery delay This effect is reinforced by the increase of the nodes’ cooperation percentage that also contributes to increase the average time that bundles spend in buffers before being delivered Using a 25 MB buffer, when cooperation percentage is lower than 20%, the storage space available for cooperating in the bundle relay process is very close to the average bundle size, which results in a very low number of cooperative bundles stored, and leads to frequent drops of such bundles Effect of node cooperation percentage on the delivery delay

Study of the Impact of Cooperation in a VDTN Binary spray and wait routing (1) Delivery Probability The effect of cooperation, as an effective strategy to increase the overall network bundle delivery, is even more pronounced in this routing protocol When mobile nodes have a 25 MB buffer size, changing the cooperation percentage from 10% to 50%, increases the bundles delivery ratio in approximately 19%, 12%, 8%, and 7%, respectively Employing a 100 MB buffer with a 10% cooperation percentage results in a similar delivery probability to a 25 MB buffer with a 40% cooperation percentage Effect of node cooperation percentage on the delivery probability

Study of the Impact of Cooperation in a VDTN Binary spray and wait routing (2) Delivery Delay Spray and Wait routing not only registers better delivery ratios, but also achieves better delivery delays than Epidemic flooding-based routing However, cooperation does not have a significant effect on the average delay registered in this routing protocol Furthermore, similar average delays are registered for buffer sizes greater than 25 MB, and cooperation percentages greater than 20% This behavior was expected since similar delivery probabilities are observed in these cases Effect of node cooperation percentage on the delivery delay

Conclusions Delay tolerant networking (DTN) is a timely topic that addresses communication in challenged network environments DTN-based networks like vehicular delay-tolerant networks (VDTNs) rely on cooperation behavior to help deliver bundles across sporadically connected nodes Non-cooperative behaviors adversely affect the network operation and performance This study addressed the research problem of node cooperation in DTN-based network architectures The related literature about this topic was surveyed A study to evaluate the impact of cooperation on the performance of VDTNs using two routing protocols was driven Results demonstrate the importance of cooperation to improve the bundle delivery ratio