CarTorrent ® : Cars get to have fun too Kevin C. Lee and Ian S. Yap TA: Uichin Lee Prof Mario Gerla.

Slides:



Advertisements
Similar presentations
Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Advertisements

Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
MicroCast: Cooperative Video Streaming on Smartphones Lorenzo Keller, Anh Le, Blerim Cic, Hulya Seferoglu LIDS, Christina Fragouli, Athina Markopoulou.
CodeTorrent: Content Distribution using Network Coding in VANET Uichin Lee, JoonSang Park, Joseph Yeh, Giovanni Pau, Mario Gerla Computer Science Dept,
Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking David B. Johnson Department of Computer Science Rice University Monarch.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
FleaNet : A Virtual Market Place on Vehicular Networks Uichin Lee, Joon-Sang Park Eyal Amir, Mario Gerla Network Research Lab, Computer Science Dept.,
Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
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.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
CS 672 Paper Presentation Presented By Saif Iqbal “CarNet: A Scalable Ad Hoc Wireless Network System” Robert Morris, John Jannotti, Frans Kaashoek, Jinyang.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Probability Grid: A Location Estimation Scheme for Wireless Sensor Networks Presented by cychen Date : 3/7 In Secon (Sensor and Ad Hoc Communications and.
SensIT PI Meeting, April 17-20, Distributed Services for Self-Organizing Sensor Networks Alvin S. Lim Computer Science and Software Engineering.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
Content Distribution in Vehicular Ad Hoc Network Computer Science Dept, UCLA Dec. 14, 2006 IBM UCLA.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Jadavpur University Centre for Mobile Computing & Communication Implementation of Ad-Hoc Mesh Network Presentation by: Sudipto Das Rajesh Roy.
Mobile Ad-hoc Pastry (MADPastry) Niloy Ganguly. Problem of normal DHT in MANET No co-relation between overlay logical hop and physical hop – Low bandwidth,
1 Vehicular Networks - Content distribution and data retrieval Slides are integrated from researchers at UCLA.
CCH: Cognitive Channel Hopping in Vehicular Ad Hoc Networks Brian Sung Chul Choi, Hyungjune Im, Kevin C. Lee, and Mario Gerla UCLA Computer Science Department.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Professor OKAMURA Laboratory. Othman Othman M.M. 1.
Redes Inalámbricas Máster Ingeniería de Computadores 2008/2009 Tema 7.- CASTADIVA PROJECT Performance Evaluation of a MANET architecture.
Denial of Service (DoS) Attacks in Green Mobile Ad–hoc Networks Ashok M.Kanthe*, Dina Simunic**and Marijan Djurek*** MIPRO 2012, May 21-25,2012, Opatija,
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.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Professor OKAMURA Laboratory. Othman Othman M.M. 1.
Alexander Afanasyev Tutors: Seung-Hoon Lee, Uichin Lee Content Distribution in VANETs using Network Coding: Evaluation of the Generation Selection Algorithms.
Scalable Web Server on Heterogeneous Cluster CHEN Ge.
BitTorrent enabled Ad Hoc Group 1  Garvit Singh( )  Nitin Sharma( )  Aashna Goyal( )  Radhika Medury( )
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
Implementation of Collection Tree Protocol in QualNet
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
Experience Sharing in Mobile Peer Communities EPI Planete, INRIA International Consortium Meeting (Oulou) 10 June, 2009.
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
1 Efficient Backbone Synthesis Algorithm for Multi-Radio Wireless Mesh Networks Huei-jiun Ju and Izhak Rubin Electrical Engineering Department University.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Bit Torrent Nirav A. Vasa. Topics What is BitTorrent? Related Terms How BitTorrent works Steps involved in the working Advantages and Disadvantages.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
DETECTION AND IGNORING BLACK HOLE ATTACK IN VANET NETWORKS BASED LATENCY TIME CH. BENSAID S.BOUKLI HACENE M.K.FAROUAN 1.
CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.
Mobile IP for Mobile Ad hoc Networks
An example of peer-to-peer application
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
A standalone content sharing application for spontaneous
A comparison of Ad-Hoc Routing Protocols
Introduction to Wireless Sensor Networks
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking
Ad-hoc On-demand Distance Vector
Dewan Tanvir Ahmed and Shervin Shirmohammadi
CarTorrent : Swarming Protocol for Vehicular Networks
ModelNet: A Large-Scale Network Emulator for Wireless Networks Priya Mahadevan, Ken Yocum, and Amin Vahdat Duke University, Goal:
Motion-Aware Routing in Vehicular Ad-hoc Networks
Dhruv Gupta EEC 273 class project Prof. Chen-Nee Chuah
Multi-Level Hierarchies for Scalable Ad hoc Routing
Presentation transcript:

CarTorrent ® : Cars get to have fun too Kevin C. Lee and Ian S. Yap TA: Uichin Lee Prof Mario Gerla

Introduction Vehicular Ad-hoc networks(VANETs) have these characteristics: Vehicular Ad-hoc networks(VANETs) have these characteristics: 1. Nodes have high computing power 2. Nodes highly mobile 3. Intermittent connectivity 4. Locally Dense networks 5. Cooperation between nodes not guaranteed An interesting application for VANETs is implementation of a peer-to-peer file-sharing system/protocol An interesting application for VANETs is implementation of a peer-to-peer file-sharing system/protocol Many names for it, in our project, its CarTorrent, modeled the Bit Torrent Protocol Many names for it, in our project, its CarTorrent, modeled the Bit Torrent Protocol

Problem How does a car discover its peers and know their addresses? How does a car discover its peers and know their addresses? What should be the address of the car? What should be the address of the car? How can a file be broken up into smaller pieces to be distributed out among the peers interested in downloading it? How can a file be broken up into smaller pieces to be distributed out among the peers interested in downloading it? How to efficiently and dynamically track file availability and transfer behavior? How to efficiently and dynamically track file availability and transfer behavior?

A two-layer approach : A two-layer approach : AODV lower layer performs route maintenance tasks and discovery of neighbors AODV lower layer performs route maintenance tasks and discovery of neighbors CarTorrent exploits the info provided by lower layer to grab or send files from/to peers CarTorrent exploits the info provided by lower layer to grab or send files from/to peers Our Solution AODV Routing Layer( and Discovery ) CarTorrent Application

Architecture RecvPacketThread Client ReceiveGossipThreadSendGossipThreadFileSplitter RecvPacketThread ListenThread RecvPacketThread CarTorrent File Manager

Components Client: Client: A tabbed frame that encapsulates information for subcomponents A tabbed frame that encapsulates information for subcomponents 3 tabs; share, download, and search 3 tabs; share, download, and search FileSplitter: FileSplitter: Splits a shared file into parts Splits a shared file into parts Combines downloaded parts into a file Combines downloaded parts into a file CarTorrent File Manager: CarTorrent File Manager: Keeps track of pieces of files from gossips Keeps track of pieces of files from gossips Includes the algorithms to find rarest pieces, closest pieces, and rarest closest pieces Includes the algorithms to find rarest pieces, closest pieces, and rarest closest pieces

Components (cont.) SendGossipThread: SendGossipThread: A thread that sends gossip msgs periodically A thread that sends gossip msgs periodically Two types of gossips: Two types of gossips: Gossips originated from itself Gossips originated from itself Gossips received from nearby neighbors Gossips received from nearby neighbors Gossips received from nearby neighbors are sent based on probabilities assigned to interesting and not interesting gossips Gossips received from nearby neighbors are sent based on probabilities assigned to interesting and not interesting gossips Gossips are interesting if client wants the file Gossips are interesting if client wants the file Gossips are not interesting if the client does not Gossips are not interesting if the client does not ReceiveGossipThread: ReceiveGossipThread: A thread that unblocks when receiving a gossip A thread that unblocks when receiving a gossip Discards the gossip if from itself else queues the gossip Discards the gossip if from itself else queues the gossip Gossips are sent to CarTorrent File Manager for managing Gossips are sent to CarTorrent File Manager for managing

Components (cont.) ListenThread: ListenThread: Listens for incoming download request Listens for incoming download request Spawns a RecvPacketThread to process incoming packets Spawns a RecvPacketThread to process incoming packets RecvPacketThread: RecvPacketThread: Processes the incoming packets based on packet type Processes the incoming packets based on packet type If packet type == DATA_REQ, send parts that are requested If packet type == DATA_REQ, send parts that are requested If packet type == DATA, write the data to the local file-system and combine it if all parts have been received If packet type == DATA, write the data to the local file-system and combine it if all parts have been received

Implementation Details AODV based on open-source Linux implementation from Uppsala University in the Netherlands AODV based on open-source Linux implementation from Uppsala University in the Netherlands CarTorrent layer written in Java with a GUI interface to browse/share/download files CarTorrent layer written in Java with a GUI interface to browse/share/download files

Choosing the peer for the file Rarest-Closest First Strategy Rarest-Closest First Strategy Download the rarest piece from the closest peer Download the rarest piece from the closest peer Analyzed to be better than the conventional Bit-Torrent rarest piece only without worrying about proximity of peers [1] Analyzed to be better than the conventional Bit-Torrent rarest piece only without worrying about proximity of peers [1]

Demo Series of pictures demonstrating the sharing of a picture file from one source to two clients Series of pictures demonstrating the sharing of a picture file from one source to two clients Three laptops( two running Linux, one with Windows) Three laptops( two running Linux, one with Windows) If you are interested in seeing the live demo, do drop by BH4681 If you are interested in seeing the live demo, do drop by BH4681

The nodes

Lets share this file

Sharing the file

Sharing the file

Browsing the shared file

Downloading the file

View the downloaded files Rate(Mbps)

Future Work Variable piece length to adapt to clients bandwidth Variable piece length to adapt to clients bandwidth Test in environments with larger distances between nodes (true multi-hop) Test in environments with larger distances between nodes (true multi-hop) Add a mechanism to detect the absence of a file in the network by either: Add a mechanism to detect the absence of a file in the network by either: expiring file pieces (after no gossips) expiring file pieces (after no gossips) sending out explicit leaving gossip msgs sending out explicit leaving gossip msgs Being able to identify failed transfers and get same file piece(s) from other nodes Being able to identify failed transfers and get same file piece(s) from other nodes

Conclusion Implementation of Car Torrent and tested on a real ad-hoc platform Implementation of Car Torrent and tested on a real ad-hoc platform Simple GUI interface simulates what the real system can be Simple GUI interface simulates what the real system can be Java implementation means that the system can be deployed cross-platform Java implementation means that the system can be deployed cross-platform

Related Work Vehicular Sensor Networks Vehicular Sensor Networks CarTel : MIT CarTel : MIT MobEyes : UCLA MobEyes : UCLA SPAWN : UCLA SPAWN : UCLA Scalable co-operative downloading of data among vehicles Scalable co-operative downloading of data among vehicles

References [1] A. Nandan, S. Das, G. Pau M.Y. Sanadidi and M. Gerla. Cooperative Downloading in Vehicular Ad-hoc Wireless Networks. [2] Sundaram Rajagopalan and Chien-Chung Shen. A Cross-layer Decentralized BitTorrent for Mobile Ad hoc Networks.

Question & Answer ?