Machine Learning Approach to Report Prioritization with an Application to Travel Time Dissemination Piotr Szczurek Bo Xu Jie Lin Ouri Wolfson.

Slides:



Advertisements
Similar presentations
A Presentation by: Noman Shahreyar
Advertisements

Delay bounded Routing in Vehicular Ad-hoc Networks Antonios Skordylis Niki Trigoni MobiHoc 2008 Slides by Alex Papadimitriou.
指導教授:許子衡 教授 報告學生:馬敏修 2010/8/ Introduction 2. Geocast Routing Protocols  2.1 GAMER Overview 3. GAMER Details  3.1 Building the Mesh  3.2 Adaptation.
CSLI 5350G - Pervasive and Mobile Computing Week 3 - Paper Presentation “RPB-MD: Providing robust message dissemination for vehicular ad hoc networks”
“Location-Aided Routing (LAR) in Mobile Ad Hoc Network” by Young-bae ko Nitin H. Validya presented by Mark Miyashita.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Transportation mode detection using mobile phones and GIS information Leon Stenneth, Ouri Wolfson, Philip Yu, Bo Xu 1University of Illinois, Chicago.
Vehicle-to-Vehicle Wireless Communication Protocols for Enhancing Highway Traffic Safety - A Comparative Study of Data Dissemination Models for VANETs.
Decision Tree Algorithm
TrafficView: A Scalable Traffic Monitoring System Tamer Nadeem, Sasan Dashtinezhad, Chunyuan Liao, Liviu Iftode* Department of Computer Science University.
Novel Self-Configurable Positioning Technique for Multihop Wireless Networks Authors : Hongyi Wu Chong Wang Nian-Feng Tzeng IEEE/ACM TRANSACTIONS ON NETWORKING,
University1 GVGrid: A QoS Routing Protocol for Vehicular Ad Hoc Networks Weihua Sun, Hirozumi Yamaguchi, Koji Yukimasa, Shinji.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Probability Grid: A Location Estimation Scheme for Wireless Sensor Networks Presented by cychen Date : 3/7 In Secon (Sensor and Ad Hoc Communications and.
TRIP ASSIGNMENT.
Radial Basis Function Networks
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
DATA MINING : CLASSIFICATION. Classification : Definition  Classification is a supervised learning.  Uses training sets which has correct answers (class.
Tree-Based Double-Covered Broadcast for Wireless Ad Hoc Networks Weisheng Si, Roksana Boreli Anirban Mahanti, Albert Zomaya.
INTRODUCTION TO MACHINE LEARNING. $1,000,000 Machine Learning  Learn models from data  Three main types of learning :  Supervised learning  Unsupervised.
Machine Learning1 Machine Learning: Summary Greg Grudic CSCI-4830.
Lyon, June 26th 2006 ICPS'06: IEEE International Conference on Pervasive Services 2006 Routing and Localization Services in Self-Organizing Wireless Ad-Hoc.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Using Neural Networks in Database Mining Tino Jimenez CS157B MW 9-10:15 February 19, 2009.
ROBUST RESOURCE ALLOCATION OF DAGS IN A HETEROGENEOUS MULTI-CORE SYSTEM Luis Diego Briceño, Jay Smith, H. J. Siegel, Anthony A. Maciejewski, Paul Maxwell,
Tonghong Li, Yuanzhen Li, and Jianxin Liao Department of Computer Science Technical University of Madrid, Spain Beijing University of Posts & Telecommunications.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
A study of Intelligent Adaptive beaconing approaches on VANET Proposal Presentation Chayanin Thaina Advisor : Dr.Kultida Rojviboonchai.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Today Ensemble Methods. Recap of the course. Classifier Fusion
1 Data Naming in Vehicle-to-Vehicle Communications HU Yao Goto Lab
Simulation of the OLSRv2 Protocol First Report Presentation.
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
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.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
Intro DSR AODV OLSR TRBPF Comp Concl 4/12/03 Jon KolstadAndreas Lundin CS Ad-Hoc Routing in Wireless Mobile Networks DSR AODV OLSR TBRPF.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Ching-Ju Lin Institute of Networking and Multimedia NTU
2010 IEEE Fifth International Conference on networking, Architecture and Storage (NAS), pp , 2010 作者: Filip Cuckov and Min Song 指導教授:許子衡 教授 報告學生:馬敏修.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
1 Travel Times from Mobile Sensors Ram Rajagopal, Raffi Sevlian and Pravin Varaiya University of California, Berkeley Singapore Road Traffic Control TexPoint.
Structure-Free Data Aggregation in Sensor Networks.
A New Class of Mobility Models for Ad Hoc Wireless Networks Rahul Amin Advisor: Dr. Carl Baum Clemson University SURE 2006.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.
ParkNet: Drive-by Sensing of Road-Side Parking Statistics Irfan Ullah Department of Information and Communication Engineering Myongji university, Yongin,
Network Topologies for Scalable Multi-User Virtual Environments Lingrui Liang.
Computer Science Least Privilege and Privilege Deprivation: Towards Tolerating Mobile Sink Compromises in Wireless Sensor Network Presented by Jennifer.
Machine Learning Usman Roshan Dept. of Computer Science NJIT.
Instructor Materials Chapter 5: Dynamic Routing
Introduction to Wireless Sensor Networks
Wireless Sensor Network Architectures
THE NETWORK LAYER.
Chapter 5: Dynamic Routing
Routing in Packet Networks Shortest Path Routing
Machine Learning Today: Reading: Maria Florina Balcan
Presentation transcript:

Machine Learning Approach to Report Prioritization with an Application to Travel Time Dissemination Piotr Szczurek Bo Xu Jie Lin Ouri Wolfson

Agenda Background Model and Problem Definition Machine Learning Approach Application – Travel Time Dissemination Results Conclusion

Background Technology in vehicles –Computers –GPS –Communication devices (802.11p, C2C) Sensing of environment –Video cameras –GPS –Temperature –Automobile status: break sensors, accelerometers

Background Dissemination of information –Limited by connectivity and bandwidth Store-and-forward communication –Information is stored in a local database of limited size –Addresses connectivity issues Prioritization –Not all information may be communicated –Not all information may be stored –Need to select most useful information to be kept and communicated

Model and Problem Definition System: –Set of mobile nodes: physical entity capable of data computation, storage, and short range wireless communication –Nodes observe environment through sensing device (e.g. GPS) Reports: –Data derived from the sensing device –Fixed set of attributes and their values. (all reports have fixed size) –Created over time by nodes –Examples: Speed report (average speed, timestamp, vehicle id) Parking space report (parking meter id, availability) –Once created, stored in report database

Model and Problem Definition Report database –Local database maintained by each node –Limited in size Communication –Reports stored in the database are communicated over time to a subset of other nodes in the network –Broadcast communication: reports are sent to all nodes within transmission range –Communication protocol: decides when and how many reports to broadcast –Remaining question: which reports should be broadcast?

Model and Problem Definition Relevance value –Utility a report holds when it would be sent to other nodes, given the sending node’s current characteristics and the attribute values of the report –Highly application specific, difficult to specify –Value of a report can change over time –Can be a range of values (0..1) or Boolean (0 or 1) –Example: parking space availability (0 for occupied, 1 for not occupied) What to broadcast and keep in report database? –Find relevance value for each report and keep (or broadcast) the highest valued reports Problem: finding the relevance value of a report

Machine Learning Approach Idea: use received reports as input to a machine learning process Assumptions: –Nodes can judge the relevance of a report after it is received –Relevance value is based on a goal common to all nodes Method description: –Define a goal on which the relevance value is based –Relevance value of a report is then defined based on how close the report achieves the goal –For every incoming report, use report’s attributes and sender’s characteristics as input values. Use relevance value as output. This creates a training example. –Use a supervised machine learning algorithm to find a model for mapping inputs to outputs. –Use learned models to find the relevance value of a report

Machine Learning Approach Two ways of learning: –Online: models are updated while training –Offline: First, collect training examples Second, use learned model Offline learning –Advantage: Nodes do not incur overhead of learning –Disadvantage: model is not adaptable –Can also be used to bootstrap online learning –Used for finding useful attributes Research questions: –Can the relevance value be learned? –What advantage does the learned model offer?

Application – Travel Time Dissemination Assume every vehicle in system carries GPS, on-board computer with communication capabilities (e.g b) Each vehicle has a known destination to which it travels along the shortest path Vehicles measure travel times on road segments as they traverse them Travel times are encapsulated by reports. Each report contains: Report ID Road segment ID Travel time Time of measurement Reports are stored in reports database of a limited size (200 reports) Reports database is a list of all received or generated reports. List is ranked by ranking function. If database size is exceeded, lowest ranked report is discarded. Example of ranking function: r=1/ageOfReport

Application – Travel Time Dissemination Reports are disseminated over VANET Incoming and newly generated reports are used to update a digital map Digital map contains: –Road segment identifier –Coordinates of the segment endpoints –Road type –Travel time estimate (average of all reports for latest time interval; initially free-flow) –List of reports used for the estimate –Time period number (indicates 5-minute interval; initially - 1)

Application – Travel Time Dissemination Travel time updates –Executed at end of each 5-minute interval –All reports generated or received within that interval are used –For each road segment in digital map: Reports for the most current period are identified. All others are discarded. Report period number is then compared with that in digital map: >: Time period is updated and all reports are inserted in list. Travel time estimate is average of all inserted reports. <: All reports are discarded =: All reports are inserted in list; duplicates are discarded. Travel time estimate is average of all inserted reports. After each update, vehicles recalculate the shortest path to their destination

Application – Travel Time Dissemination Communication –Based on TrafficInfo algorithm –Combination flooding/periodic broadcasting –Flooding for freshly created reports –Periodic broadcasting of subset of reports from report database. Subset is chosen based on ranking function. Highest K ranked reports are chosen. –Size of subset (K) is determined by Good Citizen Formula. Based on transmission range, node density, and last broadcast time –Broadcast period is determined based on transmission range and vehicle velocity

Application – Travel Time Dissemination Example: 1.Vehicle A just traversed road segment 123 at time of 1:04pm (time period 2). The recorded travel time was 10 minutes. 2.Vehicle A creates a report with ID 1, using the measured travel time. Report contains: Report ID (1) Road segment ID (123) Travel time (10 minutes) Time of measurement (1:04pm) 3.Vehicle A updates its digital map at 1:05pm. Currently, it holds no reports for segment 1. The following changes are applied for road segment 123: Travel time estimate = 10 minutes List of reports: [report 1] Time period = 2

Application – Travel Time Dissemination Example (continued): 4.Vehicle A broadcasts report 1 at 1:06pm (in time period 3). 5.Vehicle B receives the report. 6.Vehicle B updates its digital map at 1:10pm. It currently has one report (report 2) for segment 123, with travel time of 11 minutes, for time period 2. The following changes are applied for road segment 123: Travel time estimate = 10.5 minutes List of reports: [report 1], [report 2]

Application – Travel Time Dissemination Learning the ranking function (offline) –Goal of application: vehicles choose the best (shortest) paths to their destinations –Relevance of a report: report is good when it changes the shortest path 0 if report does not change path 1 if report changes shortest path –Attributes: Age of report in time periods Distance to road segment in terms of free-flow travel time form vehicle’s current position to the road segment contained in report Road type: either highway or city street

Application – Travel Time Dissemination Learning (continued) –Learning examples created artificially by emulating different scenarios –25 learning epochs: Each epoch had vehicles placed randomly on a road network (region of Chicago) Random destination for each vehicle All vehicles have digital map with one report containing free-flow travel time and random period number between 0 and 100 Random segment is chosen from the road network. Its travel time is chosen from a uniform distribution between 0 and free-flow travel time 101 reports are created for each vehicle with ages Each report is about the chosen road segment and contains the assigned travel time Every vehicle applies the 101 reports independently. After each is applied it is checked whether the shortest path would change. If report would change path, a positive training example is created; otherwise a negative training example is created –Two road networks were used (from different regions of Chicago). On smaller region, 100 vehicles were used; 250 was used for the larger region.

Application – Travel Time Dissemination Learning (continued) –Weka learning toolkit was used for learning –Negative examples were downsampled to match positives –7677 positive and 7677 negative examples –5 classifiers were tested: Naïve Bayesian (NaiveBayes Weka implementation) Logistic Regression (using Logistic Weka implementation) Support Vector Machines (using SMO Weka implementation, w/ buildLogisticModels enabled) Artificial Neural Network (using Multilayer Perceptron Weka implementation) Decision Tree (using J48 Weka implementation)

Results 10-fold cross validation All algorithms, with exception of decision trees, performed similarly with an accuracy of approximately 83-84% The decision trees had the best accuracy of 96.22% –But unusable model: complex tree with most leaf nodes being homogeneous Logistic regression model most understandable: U = *age *distance *[road=highway] – *[road=city street]

Results 3 logistic regression models were derived: 1.Using region 1 examples 2.Using region 2 examples 3.Using examples from both regions No major difference in coefficients for all models, except for road type –This shows that the relevance values are dependent on the makeup of road network Usefulness of derived models in report prioritization –Tested SWANS/STRAW simulator –100 vehicles were randomly placed in region 1. Each travelled to random destinations for 1 hour. –Majority of highway segments had reduced speed limits (simulated accident scenario) –Number of broadcasted reports limited to 10 –Two evaluation metrics were used: Average Trip Time: average time to reach destination Total Path Travel Time Difference: calculated by taking the absolute value of the difference between travel time along the shortest path given vehicle’s current knowledge and full knowledge –Compared to common heuristics (1/(age+distance) used by TrafficInfo)

Results

Conclusion Proposed a machine learning approach to report prioritization for use in peer-to-peer environments Uses incoming reports in order to provide input to supervised machine learning algorithms Learned model can then be used by all nodes in order to rank the reports to be disseminated Accurate prediction is feasible Learned model outperformed heuristics in terms of disseminating the information most likely to affect the vehicle’s path