Improving Prediction in the Routing Layer of Wireless Networks Through Social Behaviour 2 nd URV Doctoral Workshop in Computer Science and Mathematics,

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

Robin Kravets Tarek Abdelzaher Department of Computer Science University of Illinois The Phoenix Project.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
CS4550: Computer Networks II network layer basics 3 routing & congestion control.
Bayesian Piggyback Control for Improving Real-Time Communication Quality Wei-Cheng Xiao 1 and Kuan-Ta Chen Institute of Information Science, Academia Sinica.
G. Alonso, D. Kossmann Systems Group
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
1 Distributed Adaptive Sampling, Forwarding, and Routing Algorithms for Wireless Visual Sensor Networks Johnsen Kho, Long Tran-Thanh, Alex Rogers, Nicholas.
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
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
Probabilistic Aggregation in Distributed Networks Ling Huang, Ben Zhao, Anthony Joseph and John Kubiatowicz {hling, ravenben, adj,
Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
Chapter 12 - Forecasting Forecasting is important in the business decision-making process in which a current choice or decision has future implications:
Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery Using NeuroSearch Presentation for the Agora Center InBCT-seminar Mikko Vapa, researcher InBCT 3.2.
Energy-efficient Self-adapting Online Linear Forecasting for Wireless Sensor Network Applications Jai-Jin Lim and Kang G. Shin Real-Time Computing Laboratory,
Energy Conservation in wireless sensor networks Kshitij Desai, Mayuresh Randive, Animesh Nandanwar.
Layer-3 Routing Natawut Nupairoj, Ph.D. Department of Computer Engineering Chulalongkorn University.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Speed and Direction Prediction- based localization for Mobile Wireless Sensor Networks Imane BENKHELIFA and Samira MOUSSAOUI Computer Science Department.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
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.
Tracking and Predicting Link Quality in Wireless Community Networks (WCN) 3 rd Int. Workshop on Community Networks and Bottom-up-Broadband, CNBuB 2014.
Network Aware Resource Allocation in Distributed Clouds.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Tracking and Predicting End-to-End Quality in Wireless Community Networks (WCN) 4 th Int. Workshop on Community Networks and Bottom-up-Broadband, CNBuB.
1/30 Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks Wireless and Sensor Network Seminar Dec 01, 2004.
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.
A study of Intelligent Adaptive beaconing approaches on VANET Proposal Presentation Chayanin Thaina Advisor : Dr.Kultida Rojviboonchai.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
Implementation of Collection Tree Protocol in QualNet
Reducing Energy Consumption in Human- centric Wireless Sensor Networks The 2012 IEEE International Conference on Systems, Man, and Cybernetics October.
A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.
Secure In-Network Aggregation for Wireless Sensor Networks
1 Service Sharing with Trust in Pervasive Environment: Now it’s Time to Break the Jinx Sheikh I. Ahamed, Munirul M. Haque and Nilothpal Talukder Ubicomp.
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
Using a History-Based Approach to Predict Topology Control Information in Mobile Ad Hoc Networks 7 th Int. Conf. on Internet and Distributed Computing.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
© SITILabs, University Lusófona, Portugal1 Chapter 2: Social-aware Opportunistic Routing: the New Trend 1 Waldir Moreira, 1 Paulo Mendes 1 SITILabs, University.
Ad hoc Routing for Multilevel Power Saving Protocols Matthew J. Miller, Nitin H. Vaidya Ad Hoc Networks 2008 January University of Illinois at Urbana-Champaign,
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
OLSRp: Predicting Control Information to Achieve Scalability in OLSR Ad Hoc Networks Esunly Medina ф Roc Meseguer ф Carlos Molina λ Dolors Royo ф Santander.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Accurate WiFi Packet Delivery Rate Estimation and Applications Owais Khan and Lili Qiu. The University of Texas at Austin 1 Infocom 2016, San Francisco.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
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.
Introduction to Machine Learning, its potential usage in network area,
William Stallings Data and Computer Communications
Dominik Kaspar, Eunsook Kim, Carles Gomez, Carsten Bormann
Introduction to Wireless Sensor Networks
Christophe Dubach, Timothy M. Jones and Michael F.P. O’Boyle
Data and Computer Communications
IT351: Mobile & Wireless Computing
Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006
Presentation transcript:

Improving Prediction in the Routing Layer of Wireless Networks Through Social Behaviour 2 nd URV Doctoral Workshop in Computer Science and Mathematics, DCSM-2015 November 13 th, Tarragona Pere Millán 1 (PhD advisors: Carlos Molina 1, Roc Meseguer 2 ) 1 Universitat Rovira i Virgili, Tarragona, Spain 2 Universitat Politècnica de Catalunya, Barcelona, Spain

Motivation Link & End-to-End/Path Quality Prediction in Wireless Community Networks Predicting Topology Control Information (TCI) Improving Prediction Through Social Behaviour Conclusions & Future Work OLSR Outline 2

Emerging models for Future Internet across Europe: – Community networking (FunkFeuer Viena, Guifi.net, …) – Bottom-up-Broadband initiative Description: – Communities of citizens build, operate and own open IP-based networks – A key infrastructure for individual and collective digital participation 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 (PQ) 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

Link & End-to-End/Path Quality Prediction in Wireless Community Networks Predicting Topology Control Information (TCI) Improving Prediction Through Social Behaviour Conclusions & Future Work OLSR Outline 8

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 9

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 10

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 11

A sample of variation of LQ values of a link over a day Variation of LQ values 12

Results 1: Link Quality 13

Comparison of learning algorithms Time series analysis and prediction can be used to predict the next link quality value? 4 classification algorithms : Support Vector Machines (SVM) k-Nearest Neighbors (KNN) Regression Trees (RT) Gaussian Processes for Regression (GPR) 4 classification algorithms : Support Vector Machines (SVM) k-Nearest Neighbors (KNN) Regression Trees (RT) Gaussian Processes for Regression (GPR) 14 Data sets: Training: 1728 instances (6 days) Test: 288 instances (1 day) Lag window: last 12 instances Data sets: Training: 1728 instances (6 days) Test: 288 instances (1 day) Lag window: last 12 instances BEST WORSE Very high success rate: >95%

Degradation of RT model over time What is the accuracy of the prediction models over time? 15 Average MAE of the overall network and its approximation to a linear function Linear function: slope = b = Linear function: slope = b = A linear function can be used to model the degradation of the RT over time ½ day 6 days Variability of errors increases linearly with the number of instances of the test data set It is important to train the model again after a period of time Linear function: we could easily determine a trade-off between error & frequency of model updates. 97%  84%

Results 2: Path Quality 16

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) 17 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

EtEQ Prediction with RBR algorithm How can we reach a satisfactory level of prediction? 18 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 19 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)? 20 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

Motivation Link & End-to-End/Path Quality Prediction in Wireless Community Networks Predicting Topology Control Information (TCI) Improving Prediction Through Social Behaviour Conclusions & Future Work OLSR Outline 21

Motivation Several social computing participation strategies use mobile ad hoc or opportunistic networks 22

Routing protocols in mobile collaboration scenarios – Must be simple, efficient, reliable and quickly adapt to changes in the network topology – Should minimize delivery of topology control information (TCI) to avoid consuming too much devices’ energy Link-state proactive-routing protocols: – Low latency (using an optimized and known data-path ) – Cost: periodically flooding the network with TCI Motivation … and when the number of nodes is high … 23

… can overload the network!!! 24

… can we address the problem of delivering much control information through the network? 25

Idea: – Use historical Topology Control Information (TCI) to make predictions of the next control packets (CP). Questions to answer: – What performance and limits has this approach? – In which mobile computing scenarios this proposal can provide a real benefit? Predicting TCI using Past Information 26

Each node keeps updated locally (in a table) the recent TCI history received from its neighbors. Prediction at each node: – Input: recent TCI history. – Output: a prediction of TCI for each neighbor (guess network topology without delivering control info). Prediction can be done when previous TCI received matches TCI previously stored. HBP predicts a state already appeared in the past. HBP Assumptions 27

NS-3 (4 hours) + BonnMotion. Mobility: Random Walk, Nomadic, SLAW. OLSR protocol (HELLO: 2 s / TC: 3 s). 300x300 m open area (beach, park). Free to move/interact. Node devices: All similar (capabilities ≈ iPhone 4). Wi-Fi (detect others & Exchange CI). Range: 80 m / BW ≥ 50 kbps. 10, 20, 30, 40 nodes, randomly deployed. 1 m/s (walking), 2 m/s (trotting), 4 m/s (running), and 6 m/s (bicycling). Experimental Framework 28

Results: Predictability Limits %TCI packets appeared in the past 3 mobility models (1 m/s) nodes density %TCI packets appeared in the past 3 mobility models (1 m/s) nodes density About 80% for 10 nodes High prediction potential About 80% for 10 nodes High prediction potential Prediction capability does not depend on mobility model Prediction limits decrease when node density increases. 29

Frequency of Observed Control Packets What control packets appear most frequently? 30% of control packets represent 70% total observed A small subset of packets represent the most delivered A small subset of packets represent the most delivered Does not depend on node density nor mobility models Many opportunities to predict with a small subset of packets. 30

History-based prediction (different policies) 31 Always predicts (wrongly) Much better results when using history (even random) History information provides more accurate predictions.

Fixed History-Depth vs. Dynamic (tree) 32 Tree minimizes noPred But increases significantly total hits … decreases hits+misses Confidence mechanism + tree = Better results: total hits maximized, few misses.

Motivation Link & End-to-End/Path Quality Prediction in Wireless Community Networks Predicting Topology Control Information (TCI) Improving Prediction Through Social Behaviour Conclusions & Future Work OLSR Outline 33

34 Improving Prediction through Social Behavior In a real scenario, wireless nodes ≈ smartphones Current research topic: Incorporate social behavior in prediction process Does this new factor improve results? Is this “social behavior” real or just virtual? Current research topic: Incorporate social behavior in prediction process Does this new factor improve results? Is this “social behavior” real or just virtual? Focus of our analysis: People mobility (guided visit in a museum) Time factors (day/night, workdays/weekend) Focus of our analysis: People mobility (guided visit in a museum) Time factors (day/night, workdays/weekend)

Motivation Link & End-to-End/Path Quality Prediction in Wireless Community Networks Predicting Topology Control Information (TCI) Improving Prediction Through Social Behaviour Conclusions & Future Work OLSR Outline 35

Time series analysis is a promising approach to accurately predict LQs in Community Networks 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. The error variability is similar for 3 of the algorithms: RT, RBR, SVM. – kNN performs worse due to outliers with larger errors. OLSR Link/Path Q Prediction: Conclusions 36

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 PQ 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 PQ and prediction accuracy is above a certain threshold. 37

Reduces network traffic and saves energy 50%-80% of packets appeared in the past, HBP upper limits are high for many scenarios Few packets contribute to total packets (high opportunity to predict TCI) At least 30% of correct predictions in a worst-case scenario (many nodes) History-based CI Prediction: Conclusions 38

Future Work 1)Analyze in detail all combinations of work scenarios - Considering node density, speed, and mobility patterns 2)Develop more complex confidence mechanisms -and combine prediction approaches -Their benefits can be accumulated? 3)Analyze prediction performance in opp networks involving heterogeneous environments - To address IoT-based solutions. 39

Thanks for Your Attention… Questions? 2nd URV Doctoral Workshop in Computer Science and Mathematics, DCSM November 13th, Tarragona