Tracking and Predicting End-to-End Quality in Wireless Community Networks (WCN) 4 th Int. Workshop on Community Networks and Bottom-up-Broadband, CNBuB.

Slides:



Advertisements
Similar presentations
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,
Advertisements

Xiaolong Zheng, Zhichao Cao, Jiliang Wang, Yuan He, and Yunhao Liu SenSys 2014 ZiSense Towards Interference Resilient Duty Cycling in Wireless Sensor Networks.
Data Mining Classification: Alternative Techniques
Yue Han and Lei Yu Binghamton University.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Spectrum Awareness in Cognitive Radio Systems based on Spectrum Sensing Miguel López-Benítez Department of Electrical Engineering and Electronics University.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Software Quality Ranking: Bringing Order to Software Modules in Testing Fei Xing Michael R. Lyu Ping Guo.
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Nov 4, Detection, Classification and Tracking of Targets in Distributed Sensor Networks Presented by: Prabal Dutta Dan Li, Kerry Wong,
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
PORT: A Price-Oriented Reliable Transport Protocol for Wireless Sensor Networks Yangfan Zhou, Michael. R. Lyu, Jiangchuan Liu † and Hui Wang The Chinese.
Vikramaditya Jakkula Washington State University First International Workshop on Smart Homes for Tele-Health.
Probabilistic Aggregation in Distributed Networks Ling Huang, Ben Zhao, Anthony Joseph and John Kubiatowicz {hling, ravenben, adj,
Sparse vs. Ensemble Approaches to Supervised Learning
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
Gentian Jakllari, Stephan Eidenbenz, Nick Hengartner, Srikanth V. Krishnamurthy & Michalis Faloutsos Paper in Infocom 2008 Link Positions Matter: A Non-Commutative.
Probabilistic Data Aggregation Ling Huang, Ben Zhao, Anthony Joseph Sahara Retreat January, 2004.
Robust Topology Control for Indoor Wireless Sensor Networks Greg Hackmann, Octav Chipara, and Chenyang Lu SenSys 2009 S Slides from Greg Hackmann at Washington.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
Eric Rozner - ETX.ppt1 A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S.J. Couto Daniel Aguayo John Bicket Robert Morris Presented.
1 Expected Data Rate (EDR): An Accurate High-Throughput Path Metric For Multi- Hop Wireless Routing Jun Cheol Park Sneha Kumar Kasera.
Energy-efficient Self-adapting Online Linear Forecasting for Wireless Sensor Network Applications Jai-Jin Lim and Kang G. Shin Real-Time Computing Laboratory,
Empirical Analysis of Transmission Power Control Algorithms for Wireless Sensor Networks CENTS Retreat – May 26, 2005 Jaein Jeong (1), David Culler (1),
FBRT: A Feedback-Based Reliable Transport Protocol for Wireless Sensor Networks Yangfan Zhou November, 2004 Supervisors: Dr. Michael Lyu and Dr. Jiangchuan.
Choosing an Accurate Network Model using Domain Analysis Almudena Konrad, Mills College Ben Y. Zhao, UC Santa Barbara Anthony Joseph, UC Berkeley The First.
Energy Conservation in wireless sensor networks Kshitij Desai, Mayuresh Randive, Animesh Nandanwar.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Chapter 5 Data mining : A Closer Look.
Experimental study of the effects of Transmission Power Control and Blacklisting in Wireless Sensor Networks Dongjin Son, Bhaskar Krishnamachari and John.
Data Mining Chun-Hung Chou
Active Learning for Class Imbalance Problem
Comparison of Data-driven Link Estimation Methods in Low-power Wireless Networks Hongwei Zhang Lifeng Sang Anish Arora.
Machine Learning1 Machine Learning: Summary Greg Grudic CSCI-4830.
IPCCC’111 Assessing the Comparative Effectiveness of Map Construction Protocols in Wireless Sensor Networks Abdelmajid Khelil, Hanbin Chang, Neeraj Suri.
Tracking and Predicting Link Quality in Wireless Community Networks (WCN) 3 rd Int. Workshop on Community Networks and Bottom-up-Broadband, CNBuB 2014.
1 Contact Prediction, Routing and Fast Information Spreading in Social Networks Kazem Jahanbakhsh Computer Science Department University of Victoria August.
Using Transactional Information to Predict Link Strength in Online Social Networks Indika Kahanda and Jennifer Neville Purdue University.
Routing Protocol Evaluation David Holmer
Link Estimation, CTP and MultiHopLQI. Motivation Data Collection needs to estimate the link quality –To select a good link.
Copyright: S.Krishnamurthy, UCR Power Controlled Medium Access Control in Wireless Networks – The story continues.
1/30 Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks Wireless and Sensor Network Seminar Dec 01, 2004.
Euro-Par, A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments Qian Zhu and Gagan Agrawal Department of.
Link Estimation, CTP and MultiHopLQI. Learning Objectives Understand the motivation of link estimation protocols – the time varying nature of a wireless.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Secure routing in wireless sensor network: attacks and countermeasures Presenter: Haiou Xiang Author: Chris Karlof, David Wagner Appeared at the First.
Packet Dispersion in IEEE Wireless Networks Mingzhe Li, Mark Claypool and Bob Kinicki WPI Computer Science Department Worcester, MA 01609
Cross-layer Packet Size Optimization for Wireless Terrestrial, Underwater, and Underground Sensor Networks IEEE INFOCOM 2008 Mehmet C. Vuran and Ian F.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
Reducing Energy Consumption in Human- centric Wireless Sensor Networks The 2012 IEEE International Conference on Systems, Man, and Cybernetics October.
Secure In-Network Aggregation for Wireless Sensor Networks
Performance Study of Localization Techniques in Zigbee Wireless Sensor Networks Ray Holguin Electrical Engineering Major Dr. Hong Huang Advisor.
Using a History-Based Approach to Predict Topology Control Information in Mobile Ad Hoc Networks 7 th Int. Conf. on Internet and Distributed Computing.
SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,
Optimal Dimensionality of Metric Space for kNN Classification Wei Zhang, Xiangyang Xue, Zichen Sun Yuefei Guo, and Hong Lu Dept. of Computer Science &
CS378 Final Project The Netflix Data Set Class Project Ideas and Guidelines.
Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors by Dennis DeCoste and Dominic Mazzoni International.
By: Gang Zhou Computer Science Department University of Virginia 1 Medians and Beyond: New Aggregation Techniques for Sensor Networks CS851 Seminar Presentation.
Brian Lukoff Stanford University October 13, 2006.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Improving Prediction in the Routing Layer of Wireless Networks Through Social Behaviour 2 nd URV Doctoral Workshop in Computer Science and Mathematics,
Hierarchical Trust Management for Wireless Sensor Networks and Its Applications to Trust-Based Routing and Intrusion Detection Wenhai Sun & Ruide Zhang.
OLSRp: Predicting Control Information to Achieve Scalability in OLSR Ad Hoc Networks Esunly Medina ф Roc Meseguer ф Carlos Molina λ Dolors Royo ф Santander.
1 A latent information function to extend domain attributes to improve the accuracy of small-data-set forecasting Reporter : Zhao-Wei Luo Che-Jung Chang,Der-Chiang.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006
DK presents Division of Computer Science, KAIST
Presentation transcript:

Tracking and Predicting End-to-End Quality in Wireless Community Networks (WCN) 4 th Int. Workshop on Community Networks and Bottom-up-Broadband, CNBuB 2015 August 26 th, Rome, Italy Pere Millán 1, C. Molina 1, E. Dimogerontakis 2, L. Navarro 2, R. Meseguer 2, B. Braem 3, C. Blondia 3 1 Universitat Rovira i Virgili, Tarragona, Spain 2 Universitat Politècnica de Catalunya, Barcelona, Spain 3 University of Antwerp – iMinds – MOSAIC, Antwerpen, België

Motivation [Link/End-to-End Quality] Prediction in [Wireless] Networks End-to-End Quality Prediction in Wireless Community Networks Experimental Methodology & Results Conclusions & Future Work OLSR Outline 2

Motivation 3

Community networks create measurable social impact providing the right and opportunity of communication 4

Community networks: – Large, heterogeneous, dynamic and decentralized structures Some challenges: – What is the effect of the asymmetrical features and unreliability of wireless communications on network performance and routing protocols? – Link quality tracking is a key method to apply when routing packets through an unreliable network. – Routing algorithms should avoid weak links whenever possible and as soon as possible. Motivation 5

Link quality (LQ) estimation/prediction approach increases the improvements in routing performance achieved through link quality tracking. – RT metrics do not provide enough information to detect degradation/activation of a link at the right moment. – Prediction techniques are needed to foresee link quality changes in advance and take the appropriate measures. Motivation 6

End-to-End Quality (EtEQ) or Path Quality extends the Link Quality (LQ) concept to the full communication path (sender-receiver) and is computed based on the quality (ETX) of the individual links that conform the communication path. Motivation 7

Main contributions: A detailed analysis of path properties and path ETX behavior in wireless community networks (WCN):  EtEQ prediction is possible and meaningful. Use of time series analysis to estimate EtEQ in the routing layer for real-world WCN. Clear evidence that EtEQ values computed through time series algorithms can make accurate predictions in WCN. A detailed analysis of prediction accuracy for the next step considering time of day and some steps ahead in future. In this work we present an analysis of End-to-End Quality tracking and prediction and differences with our previous LQ analysis 8

Prediction in WCN 9

FunkFeuer uses OLSR Routing Protocol: – Prediction of path changes can improve local node routing decisions, since it can provide the node with an estimation about the future local and remote events. – OLSR uses ETX to choose the next hop. ETX Metric: – Link: number of expected transmissions to send a packet over the link. – Path: sum of ETX values of links that form the path (≥ path Hops). Path ETX prediction: – Will allow more efficient routing decisions in an unstable environment. Background 10

Goals of Network Prediction: Routing Traffic Reduction: OLSRp, Kinetic Multipoint Relaying (KMPR). Energy Efficient Routing: LPR, MDR, E-DSR routing protocol. Link Quality prediction. Link Quality Prediction in WCN: LQ tracking: select higher quality links  max. delivery rate & min. traffic congest. LQ prediction: determine beforehand which links are more likely to change behavior. Idea: The routing layer can make better decisions at the appropriate moment. Link Quality Estimators (LQE) metrics: Measure quality of links between nodes based on physical or logical metrics. Physical metrics focus on the received signal quality: LQI, SNR, RSSI. Logical metrics focus on % of lost packets: RNP, ETX, PSR. To select the more suitable neighbor nodes when making routing decisions. Network Prediction 11

Compute Path Quality as aggregation of Link values: – MARA [28], EER [29], ETOP [30], EED/WEED [31]. Other relevant works: – MetricMap [32]: uses a learning-enabled method for LQ assessment. Also uses time series analysis to improve the routing protocol. – Maccari & Cigno [33]: quality of routes & techniques to select MPR nodes. – Cunha et al. [34]: detects path changes (NN4) and then remaps (DTRACK). – Millan et al. [13]: behaviour of LQ prediction in WCN, using Time-Series, several learning algorithms, to accurately predict future values. End-to-End Quality 12

Funkfeuer WCN (Austria): – links, OLSR-NG routing protocol. Open data set (Confine Project): – OLSR info, 404 nodes, 7 days, av. degree: 3.5, diameter: 18. – links with variations in LQ (higher prediction accuracy using all links). 4 Prediction Algorithms: – Support Vector Machines (SVM), k-Nearest Neighbors (kNN), Regression Trees (RT), Rule-Based Regression (RBR). Time Series Analysis & Forecasting: – Training and test sets validation approach. – Weka: machine learning/data mining approach to model time series, encodes time dependency via additional input fields (“lagged” variables). Metrics and Plots: Mean Absolute Error (MAE). MAE = sum(abs(predicted - actual)) / N Boxplots: classic representations of a statistical distribution of values. Experimental Methodology 13

Results 14

Comparison of TS learning algorithms Time series analysis can be used to predict future End-to-End quality values? 4 classification algorithms : Support Vector Machines (SVM) k-Nearest Neighbors (KNN) Regression Trees (RT) Rule-Based Regression (RBR) 4 classification algorithms : Support Vector Machines (SVM) k-Nearest Neighbors (KNN) Regression Trees (RT) Rule-Based Regression (RBR) 15 Data sets: Training: 2016 instances (7 days) Test: 288 instances (1 day) Lag window: last 12 instances Data sets: Training: 2016 instances (7 days) Test: 288 instances (1 day) Lag window: last 12 instances BEST WORST High percentage of success

Learning algorithms: error variability 16 3 of 4 algorithms (RT, RBR, SVM) achieved a similar accuracy for most of the links Some outliers have high errors … that increase the average values t-test result: RBR is a good candidate to make predictions

EtEQ Prediction with RBR algorithm How can we reach a satisfactory level of prediction? 17 Same Data sets: Training: 2016 instances (7 days) Test: 288 instances (1 day) Lag window: last 12 instances Same Data sets: Training: 2016 instances (7 days) Test: 288 instances (1 day) Lag window: last 12 instances Some hop paths have high dispersion … but we successfully predict a big percentage of fluctuations

EtEQ Prediction with RBR: accuracy Real and predicted values are very close 18 Deviation remains below 0.5 throughout the whole prediction Why ETX error has an increasing trend? (8:00 – 8:30 am)

EtEQ Prediction accuracy (day/night) Future work: 2 different predictors (day/night)? 19 Less deviations/errors Data sets: Training: 2016 instances (7 days) Test: 144 instances (1/2 day) Lag window: last 12 instances Data sets: Training: 2016 instances (7 days) Test: 144 instances (1/2 day) Lag window: last 12 instances Day (12 am – 12 pm) Night (12 pm – 12 am) More deviations/errors

Prediction of some steps ahead Time series analysis and prediction can be used to predict the value of EtEQ some time steps ahead into the future? 20 Good results for the majority of steps ahead Average MAE grows very slowly We could predict successfully the EtEQ several steps ahead in time.

21 Conclusions Future Work

Time series analysis is a promising approach to accurately predict LQs in Community Networks – Routing protocol performance can be improved by providing information to make appropriate and timely decisions to maximize the delivery rate and minimize traffic congestion. All algorithms achieved high percentages of success with average MAE per link between 2.4% and 5% when predicting the next value of EtEQ, being the Rule-Based Regression the best one. – RBR prediction shows an average absolute error less than 1. The error variability is similar for 3 of the algorithms: RT, RBR, SVM. – kNN performs worse due to outliers with larger errors. OLSR EtEQ Prediction: Conclusions 22

OLSR Future Work To extend this analysis to other community networks to evaluate if the observed behavior can be generalized. To identify which paths contribute most to the errors in the EtEQ prediction and to understand what factors make it more difficult to predict them. To study the impact of errors in routing decisions. To study a solution with 2 different predictors: Day/Night. To improve the prediction process by discarding those paths whose relation between EtEQ and prediction accuracy is above a certain threshold. 23

Thanks for Your Attention… Questions? 4th Int. Workshop on Community Networks and Bottom-up-Broadband, (CNBuB 2015)August 26th, Rome, Italy