TrafficView: A Scalable Traffic Monitoring System Tamer Nadeem, Sasan Dashtinezhad, Chunyuan Liao, Liviu Iftode* Department of Computer Science University.

Slides:



Advertisements
Similar presentations
Fast Algorithms For Hierarchical Range Histogram Constructions
Advertisements

EPIDEMIC DENSITY ADAPTIVE DATA DISSEMINATION EXPLOITING OPPOSITE LANE IN VANETS Irem Nizamoglu Computer Science & Engineering.
GrooveSim: A Topography- Accurate Simulator for Geographic Routing in Vehicular Networks 簡緯民 P
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,
1 Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Yu-Ta Chen 2006 Advanced Wireless Network.
Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking David B. Johnson Department of Computer Science Rice University Monarch.
Real Time Flow Handoff in Ad Hoc Wireless Networks using Mobility Prediction William Su Mario Gerla Comp Science Dept, UCLA.
Vehicle-to-Vehicle Wireless Communication Protocols for Enhancing Highway Traffic Safety - A Comparative Study of Data Dissemination Models for VANETs.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Designing an Inter-Vehicular Network Stack for Car-to-Car Communication Pravin Shankar Department of Computer Science Rutgers University.
Lane Reservation for Highways (Position Paper) Nishkam Ravi 1, Stephen Smaldone 1, Liviu Iftode 1, and Mario Gerla 2 1 Computer Science Rutgers University,
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Computer Science Department Stony Brook University.
1 Efficient Retrieval of User Contents in MANETs Marco Fiore, Claudio Casetti, Carla-Fabiana Chiasserini Dipartimento di Elettronica, Politecnico di Torino,
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
VITP and CARS: A Distributed Service Model and Rate Adaptation for VANETs Liviu Iftode Department of Computer Science Rutgers University.
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
Department of Computer Engineering Koc University, Istanbul, Turkey
A Distance Routing Effect Algorithm for Mobility (DREAM)* Stefano Basagni Irnrich Chlamtac Violet R. Syrotiuk Barry A. Woodward.
TrafficView: A Driver Assistant Device for Traffic Monitoring based on Car-to-Car Communication Sasan Dashtinezhad, Tamer Nadeem Department of CS, University.
1 Vehicular Sensor Networks for Traffic Monitoring In proceedings of 17th International Conference on Computer Communications and Networks (ICCCN 2008)
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
Energy-efficient Self-adapting Online Linear Forecasting for Wireless Sensor Network Applications Jai-Jin Lim and Kang G. Shin Real-Time Computing Laboratory,
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
CARS: Context Aware Rate Selection for Vehicular Networks Pravin Shankar Tamer Nadeem Justinian Rosca
Routing and Data Dissemination. Outline Motivation and Challenges Basic Idea of Three Routing and Data Dissemination schemes in Sensor Networks Some Thoughts.
1 Requirements for the Transmission of Streaming Video in Mobile Wireless Networks Vasos Vassiliou, Pavlos Antoniou, Iraklis Giannakou, and Andreas Pitsillides.
Tonghong Li, Yuanzhen Li, and Jianxin Liao Department of Computer Science Technical University of Madrid, Spain Beijing University of Posts & Telecommunications.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Machine Learning Approach to Report Prioritization with an Application to Travel Time Dissemination Piotr Szczurek Bo Xu Jie Lin Ouri Wolfson.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Disseminating Traffic Data over Vehicles on Road  A Preliminary Proposal to the ITA Demo Project Presented by Bo Xu.
Effects of Multi-Rate in Ad Hoc Wireless Networks
A study of Intelligent Adaptive beaconing approaches on VANET Proposal Presentation Chayanin Thaina Advisor : Dr.Kultida Rojviboonchai.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Small-Scale and Large-Scale Routing in Vehicular Ad Hoc Networks Wenjing Wang 1, Fei Xie 2 and Mainak Chatterjee 1 1 School of Electrical Engineering and.
1 Virtual Patrol : A New Power Conservation Design for Surveillance Using Sensor Networks Prasant Mohapatra, Chao Gui Computer Science Dept. Univ. California,
1 Data Naming in Vehicle-to-Vehicle Communications HU Yao Goto Lab
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Differential Ad Hoc Positioning Systems Presented By: Ramesh Tumati Feb 18, 2004.
Presented By, Shivvasangari Subramani. 1. Introduction 2. Problem Definition 3. Intuition 4. Experiments 5. Real Time Implementation 6. Future Plans 7.
Thesis Presentation Chayanin Thaina Advisor : Asst.Prof. Dr. Kultida Rojviboonchai.
Rate-Based Channel Assignment Algorithm for Multi-Channel Multi- Rate Wireless Mesh Networks Sok-Hyong Kim and Young-Joo Suh Department of Computer Science.
Optimizing CASCADE Data Aggregation for VANETs Khaled Ibrahim and Michele C. Weigle Department of Computer Science, Old Dominion University MASS 2008.
Performance Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Author:Fei Xie, Kien A. Hua, Wenjing Wang, and Yao H. Ho 2007 IEEE Speaker:
Kun-chan Lan and Chien-Ming Chou National Cheng Kung University
Cooperative Location- Sensing for Wireless Networks Authors : Haris Fretzagias Maria Papadopouli Presented by cychen IEEE International Conference on Pervasive.
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
An Efficient Gigabit Ethernet Switch Model for Large-Scale Simulation Dong (Kevin) Jin.
Adaptive Sleep Scheduling for Energy-efficient Movement-predicted Wireless Communication David K. Y. Yau Purdue University Department of Computer Science.
1 A Multi-Rate Routing Protocol with Connection Entropy for MANETs Cao Trong Hieu, Young Cheol Bang, Jin Ho Kim, Young An Kim, and Choong Seon Hong Presenter:
Chapter 14 : Modeling Mobility Andreas Berl. 2 Motivation  Wireless network simulations often involve movements of entities  Examples  Users are roaming.
An Improved Vehicular Ad Hoc Routing Protocol for City Environments Moez Jerbi, Sidi-Mohammed Senouci, and Rabah Meraihi France Telecom R&D, Core Network.
An Efficient Gigabit Ethernet Switch Model for Large-Scale Simulation Dong (Kevin) Jin.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 1 Implementation and Evaluation of AODV with Proactive Route Announcements.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
Realistic Mobility Models for Vehicular Ad hoc Network (VANET) Simulations ITST 高弘毅 洪佳瑜 蔣克欽.
Geographical Data Aggregation
A comparison of Ad-Hoc Routing Protocols
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Presentation transcript:

TrafficView: A Scalable Traffic Monitoring System Tamer Nadeem, Sasan Dashtinezhad, Chunyuan Liao, Liviu Iftode* Department of Computer Science University of Maryland, College Park *Now with Rutgers University

2 TrafficView Enable drivers to see vehicles in front of their cars, farther than they can see, in real-time Use vehicle-to-vehicle ad hoc networks

3 How TrafficView Works Each vehicle has an embedded system –GPS receiver (location, speed, time) –Short-range wireless NIC –On-Board Diagnostics interface (optional) Receive data from remote vehicle Non-validated dataset Validate Validated dataset Local data Display Broadcast data

4 Need for Data Aggregation Ad hoc networks of vehicles are dynamic Data propagation must be simple Send all data in one packet (up to MTU) Use data aggregation to put as much information as possible in one packet

5 How Far Can You See? Problem –How to aggregate data to see vehicles as far as possible with “acceptable” accuracy loss Natural Solution –Aggregate data for vehicles that are close to each other –Perform more aggregation as distance increases

6 Outline Motivation and Problem Definition Data Representation Aggregation Algorithms Evaluation Conclusions and Future Work

7 Data Representation Vehicles store records: –Vehicle ID (ID), position (POS), speed (SPD), broadcast time (BT) Broadcast time: the time at which the originating vehicle sent out the record An aggregated record contains more than one ID

8 Aggregated Records Having n records Calculate the aggregated record’s fields: POS and SPD are weighted averages.

9 Aggregation Algorithms Ratio-based Cost-based

10 Ratio-based Aggregation Current Vehicle Aggregation ratio: inverse of the number of records that would be aggregated in one record Portion value: amount of the remaining space in the broadcast message 3. In each region, each two consecutive records that are closer than the merge threshold, are merged 1. Calculate region boundaries 2. Calculate merge thresholds

11 Cost-based Algorithm The Ratio-based algorithm selects the records to be aggregated blindly! Assign a cost to merging two records, select records corresponding to lowest cost Cost function: –High cost to close vehicles –Minimize error due to merging records –Minimize number of cars in merged records

12 Information Aging Problem –Vehicles move and change speed –Records can be out-of-date –Received information might be invalid Solution –Delete record if no information about that vehicle is received in a while –Compute expected delay for each record received –Store record only if |actual delay – expected delay| < threshold

13 Evaluation Metrics Road Scenarios Simulation Results

14 Metrics Visibility –Average distance ahead about which a vehicle has information Accuracy –Average position error introduced due to aggregation Knowledge Percentage –Average percentage of vehicles in each region ahead about which a vehicle has information

15 Evenly distributed entries and exits Random constant speed during time intervals Changing lanes randomly Traffic Model

16 Simulations NS-2 simulations –802.11b with 11Mbps bandwidth –transmission range of 250m –MTU = 2312 bytes 15,000m road, 4 lanes 300s duration of simulation Algorithms: –Ratio-based, Cost-based, Non-aggregation, and Brute-force Cost- based Selected parameters using preliminary simulations

17 Scenarios Name# of nodesAvg. speed (m/s)Avg. gap (m) Rush-hour City High-density highway Low-density highway

18 Effect of Road Parameters on Visibility (1) Ratio-based Aggregation Cost-based Aggregation

19 Effect of Road Parameters on Visibility (2) Non-aggregation Brute-force Cost-based

20 Visibility (High-density Highway)

21 Accuracy (High-density Highway)

22 Knowledge Percentage (High-density Highway)

23 What We Learned Intuitively, cost-based algorithm appeared to be a better choice Cost-based algorithm is only marginally better for relatively closer distances Ratio-based algorithm is better for farther away distances and is more flexible

24 Conclusions TrafficeView provides drivers with real- time view of vehicles in front of their cars Designed and evaluated two aggregation algorithms using realistic road scenarios Ratio-based algorithm is a good algorithm –Good visibility and small position error

25 Future Work Working on prototype implementation Linear programming model to automatically calculate the aggregation parameters Privacy and Trust

26 Thank You!