Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 12th IEEE International Conference on Mobile Data Management (MDM’11), June.

Slides:



Advertisements
Similar presentations
Dynamic Generation of Data Broadcasting Programs for Dynamic Generation of Data Broadcasting Programs for a Broadcast Disk Array in a Mobile Computing.
Advertisements

Empirical Algorithmics Reading Group Oct 11, 2007 Tuning Search Algorithms for Real-World Applications: A Regression Tree Based Approach by Thomas Bartz-Beielstein.
1 Top-K Algorithms: Concepts and Applications by Demetris Zeinalipour Visiting Lecturer Department of Computer Science University of Cyprus Department.
MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
MicroCast: Cooperative Video Streaming on Smartphones Lorenzo Keller, Anh Le, Blerim Cic, Hulya Seferoglu LIDS, Christina Fragouli, Athina Markopoulou.
TI: An Efficient Indexing Mechanism for Real-Time Search on Tweets Chun Chen 1, Feng Li 2, Beng Chin Ooi 2, and Sai Wu 2 1 Zhejiang University, 2 National.
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Constructing Popular Routes from Uncertain Trajectories Ling-Yin Wei 1, Yu Zheng 2, Wen-Chih Peng 1 1 National Chiao Tung University, Taiwan 2 Microsoft.
LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
A Platform for the Evaluation of Fingerprint Positioning Algorithms on Android Smartphones C. Laoudias, G.Constantinou, M. Constantinides, S. Nicolaou,
1 Crosslayer Design for Distributed MAC and Network Coding in Wireless Ad Hoc Networks Yalin E. Sagduyu Anthony Ephremides University of Maryland at College.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Multimedia Streaming in Dynamic Peer-to-Peer Systems and Mobile Wireless.
Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 NSF Workshop on Sustainable Energy Efficient Data Management (SEEDM), Arlington,
Multi-Objective Evolutionary Algorithms Matt D. Johnson April 19, 2007.
Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 Workshop on Research Directions in Situational-aware Self-managed Proactive.
Vassilios V. Dimakopoulos and Evaggelia Pitoura Distributed Data Management Lab Dept. of Computer Science, Univ. of Ioannina, Greece
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
An Evolutionary Bluetooth Scatternet Formation Protocol Students: Mirko Gilioli Elallali Mohammed.
Perimeter-based Data Acquisition and Replication in Mobile Sensor Networks Panayiotis Andreou (Univ. of Cyprus) Demetrios Zeinalipour-Yazti (Univ. of Cyprus)
SenseSwarm: A Perimeter-based Data Acquisition Framework for Mobile Sensor Networks Demetrios Zeinalipour-Yazti (Open Univ. of Cyprus) Panayiotis Andreou.
Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MobiDE 2011, June 12 th, Athens, Greece © Zeinalipour-Yazti Invited Talk.
Panayiotis G. Andreou, George Constantinou, Demetrios Zeinalipour-Yazti, George Samaras Department of Computer Science, University of Cyprus Panayiotis.
Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 Colloquium: Department of Computer Science, University of Pittsburgh, Sennott.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
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.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
2004, 9/1 1 Optimal Content-Based Video Decomposition for Interactive Video Navigation Anastasios D. Doulamis, Member, IEEE and Nikolaos D. Doulamis, Member,
Demetris Zeinalipour MHS: Minimum-Hot-Spot Query Trees for Wireless Sensor Networks Georgios Chatzimilioudis University of California - Riverside, USA.
Workload-aware Optimization of Query Routing Trees in Wireless Sensor Networks Panayiotis Andreou (Univ. of Cyprus) Demetris Zeinalipour-Yazti (Open Univ.
MINT Views: Materialized In-Network Top-k Views in Sensor Networks Demetrios Zeinalipour-Yazti (Uni. of Cyprus) Panayiotis Andreou (Uni. of Cyprus) Panos.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
ETC: Energy-driven Tree Construction in Wireless Sensor Networks Panayiotis Andreou (Univ. of Cyprus) Andreas Pamboris (Univ. of California – San Diego)
Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2012 © Chatzimilioudis, Zeinalipour-Yazti, Lee, Dikaiakos 1 “Continuous.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!
Socially-aware Query Routing in Mobile Social Networks Andreas Konstantinidis, Demetrios Zeinalipour-Yazti Department of Computer Science, University of.
Content Sharing over Smartphone-Based Delay- Tolerant Networks.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Parallel dynamic batch loading in the M-tree Jakub Lokoč Department of Software Engineering Charles University in Prague, FMP.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/ th IEEE International Conference on Mobile Data Management (MDM’11), June.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
Once posted, other YouTube users can post comments about the video, post their YouTube video responses, or rate the video. Videos that are uploaded to.
Routing and Scheduling in Multistage Networks using Genetic Algorithms Advisor: Dr. Yi Pan Chunyan Ji 3/26/01.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Web: ~ laoudias/pages/platform.htmlhttp://www2.ucy.ac.cy/ ~ laoudias/pages/platform.html
December 2015 Lifetime-aware Networks: It is Not What You Know but Who You Know Luca Chiaraviglio Marco Listanti Jairo A. Gutierrez William Liu GlobalSip.
Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 1/17 ERCIM Spring Meeting 2013, June 6, 2013, Nicosia,
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Stefanos Antaris Distributed Publish/Subscribe Notification System for Online Social Networks Stefanos Antaris *, Sarunas Girdzijauskas † George Pallis.
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Virtual Disaster Management Information Repository Based on Linked Open Data Yi-Lung Chen 1, Jyun-You Lin 1, Tsung-Hsien Chu 1, Jane Win-Shih Liu 2, IEEE.
Ing-Ray Chen, Member, IEEE, Hamid Al-Hamadi Haili Dong Secure and Reliable Multisource Multipath Routing in Clustered Wireless Sensor Networks 1.
GENETIC ALGORITHM By Siti Rohajawati. Definition Genetic algorithms are sets of computational procedures that conceptually follow steps inspired by the.
MHS: Minimum-Hot-Spot Query Trees for Wireless Sensor Networks
Architecture and Algorithms for an IEEE 802
Extending wireless Ad-Hoc
Demetrios Zeinalipour-Yazti (Univ. of Cyprus)
Computing and Compressive Sensing in Wireless Sensor Networks
AirPlace Indoor Positioning Platform for Android Smartphones
Introduction Secondary Users (SUs) Primary Users (PUs)
Spatio-Temporal WiFi Localization
Location Recommendation — for Out-of-Town Users in Location-Based Social Network Yina Meng.
Telco Big Data (TBD) Example:
Boltzmann Machine (BM) (§6.4)
Presentation transcript:

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/ th IEEE International Conference on Mobile Data Management (MDM’11), June 7th, 2011, Luleå, Sweden Multi-Objective Query Optimization in Smartphone Social Networks Andreas Konstantinidis, Demetrios Zeinalipour-Yazti, Panayiotis Andreou, George Samaras MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Smartphone Social Network 2 Latitude A social structure made up of individuals carrying smartphones used for Sharing and Collaboration (Content, Interest, Comments, Places, etc.)

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Smartphone Social Network 3 Main Functionality of these Services Who - What - When – Where Upload Photos / Tag (Comment) on Photos Facebook 50+ Billion Photos in 07/2010 “Check-in” (Places, Gowalla, Foursquare): let user's friends know where they are at the moment. receive location-based deals (e-loyalty card) Location History (Latitude)

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Smartphone Social Network 4 Mobile Social Network applications are projected to grow in the future.

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Motivating Example 5 Scenario: Five (5) User moving in Lower Manhattan collecting data (video, photos, sound, rss, …) U1 U2 U4 U5 U3

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras The Search Problem 6 Find Video of street artists performing right now? U1U2U3U4 U5 {(X,Y,T,obj) | X,Y: spatial, T: temporal, Obj: object} Fact: Content is Distributed and there is no Global Index! Problem: How to find the answer more “efficiently”. Query Processor (QP)

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Presentation Outline Introduction Background and Existing Solutions The SmartOpt Framework Preliminary Evaluation Ongoing and Future Work 7

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras A.Data Privacy –Social sites are already undergoing significant privacy restructuring (e.g., google buzz, facebook) B.Network Traffic and Local Processing –Objects are large (e.g., High Resolution photo) –3G/4G and WiFi traffic: i) depletes smartphone battery and ii) degrades network health* In 2009 AT&T’s customers affected by iPhone release. C.Short-range (Bluetooth, NFC) vs. Long Range (WiFi | 3G) Wireless Links –0.40W – No connections –0.52W – Bluetooth Connection Established –1.73W – Download 120KBps via 3G Background and Characteristics 8

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Motivating Example 9 U1 Query Processor (QP) Centralized Search (CS): –Build a big repository with all objects and tags currently utilized by all social networking sites –Scores bad in all three characteristics: Privacy, Network Traffic, Only Long-Link

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Motivating Example 10 Distributed Random Search (DRS): –Keep object/tags in-situ and conduct a distributed brute-force (p2p) search –Improves privacy but still not adequate: Privacy, Network Traffic, Only-Long U1U2U3U4 U5 Query Processor (QP)

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Presentation Outline Introduction Background and Existing Solutions The SmartOpt Framework Preliminary Evaluation Ongoing and Future Work 11

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras SmartOpt: Solution Outline 12 U1U2U3U4 U5 Interest Matrix (Profile) ArtsFood Cinema U1 X U2 XX U3 X U4 XX … Query Routing Tree (T) Disseminate Query using T Social Site QP (WiFi| 3G) Bluetooth (cheaper) Bluetooth (cheaper) Social Graph (G)

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Problem: Construct a QRT (X) over active users U’ that optimizes three (3) conflicting objectives, concurrently, in conducting query Q: –Α) Minimize Total Energy Consumption: –B) Minimize Response Time : –C) Maximize (Query Result) Recall : Definition of Objectives

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras SmartOpt Optimizer Founded on a Multi-Objective Evolutionary Algorithm using Decomposition (MOEAD). –Mimics the process of natural evolution by decomposing the problem into M subproblems. Optimizer Main Steps: –Initialization: Uniformly and Randomly generate a set of M Query Routing Trees. –For i:=1 to M apply: i) a genetic operator (select, crossover, mutation); ii) repair operator (disconnection, repetition, loops) and iii) population update operator –Repeat the above until a maximum number of generations has been produced.

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras SmartOpt Optimizer Representation and Initialization: Record the parent of each node in a vector (-1 for nodes with no parent)

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras SmartOpt Optimizer Crossover: Randomly select 2 parents Pr1,Pr2 and create offsprings O1,O2 by crossing the range between two random points X1,X2 New solution shares many of the parent characteristics found in parents.

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras SmartOpt Optimizer Mutation: Randomly select 2 indexes in each offspring and swap their parents. This step is expected to improve exploration and consequently the diversity of the initial solution However, this might create disconnections as this is shown next. 

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras SmartOpt Optimizer Repair: Correct problems that might show up in the offspring solutions (e.g., disconnected subtrees, infinite loops, etc.)

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Presentation Outline Introduction Background and Existing Solutions The SmartOpt Framework Preliminary Evaluation Ongoing and Future Work 19

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Experimental Results Average Performance of the Pareto Set. A. RECALL: Best Solution close to the answer set >95%

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Experimental Results 6x B. ENERGY: Almost 6 times more energy-efficient than CS Similar findings for Time

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Presentation Outline Introduction Background and Existing Solutions The SmartOpt Framework Preliminary Evaluation Ongoing and Future Work 22

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Ongoing and Future Work Look at other Multi-Objective Optimization alternatives such as the large body of skyline operators for disk-resident data. Fine-tune the search algorithm and compare it against the large literature of P2P search. Evaluate the SmartOpt prototype system over the SmartNet testbed of 50+ smartphones we are developing. 23

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/2010 MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Ongoing and Future Work 24 SmartNet Install APK, Upload File, Reboot, … Programming cloud for the development of smartphone network applications & protocols as well as experimentation with real smartphone devices.

Dagstuhl Seminar 10042, Demetris Zeinalipour, University of Cyprus, 26/1/ th IEEE International Conference on Mobile Data Management (MDM’11), June 7th, 2011, Luleå, Sweden Multi-Objective Query Optimization in Smartphone Social Networks Andreas Konstantinidis, Demetrios Zeinalipour-Yazti, Panayiotis Andreou, George Samaras MDM 2011 © Konstantinidis, Zeinalipour-Yazti, Andreou, Samaras Thanks! Questions?