1 Generalized Indexing for Energy-Efficient Access to Partially Ordered Broadcast Data in Wireless Networks Dimitrios Katsaros 1,2 Nikos Dimokas 1 Yannis.

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

Greedy Algorithms Greed is good. (Some of the time)
Interpolating the Air for Optimizing Wireless Data Broadcast Fotis Tsakiridis, Panagiotis Bozanis, Dimitrios Katsaros Dept. of Computer & Communication.
Searching on Multi-Dimensional Data
B+-Trees (PART 1) What is a B+ tree? Why B+ trees? Searching a B+ tree
Dimitrios Katsaros* † Yannis Manolopoulos* † Aristotle University, Greece *University of Thessaly, Greece Suffix Tree Based Prediction for Pervasive Computing.
COMP 451/651 Indexes Chapter 1.
2-dimensional indexing structure
1 Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes Yunfeng Lin, Ben Liang, Baochun Li INFOCOM 2007.
Data Broadcast in Asymmetric Wireless Environments Nitin H. Vaidya Sohail Hameed.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Cache Placement in Sensor Networks Under Update Cost Constraint Bin Tang, Samir Das and Himanshu Gupta Department of Computer Science Stony Brook University.
Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems Yingwu Zhu, Yiming Hu Appeared on IEEE Trans. on Parallel and Distributed Systems,
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
WiOpt’04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 24-26, 2004, University of Cambridge, UK Session 2 : Energy Management.
Vassilios V. Dimakopoulos and Evaggelia Pitoura Distributed Data Management Lab Dept. of Computer Science, Univ. of Ioannina, Greece
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks (WSNs) Murat Demirbas, Xuming Lu Dept of Computer Science and Engineering, University.
Extending Network Lifetime for Precision-Constrained Data Aggregation in Wireless Sensor Networks Xueyan Tang School of Computer Engineering Nanyang Technological.
B + -Trees (Part 1). Motivation AVL tree with N nodes is an excellent data structure for searching, indexing, etc. –The Big-Oh analysis shows most operations.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
B + -Trees (Part 1) COMP171. Slide 2 Main and secondary memories  Secondary storage device is much, much slower than the main RAM  Pages and blocks.
R-Trees 2-dimensional indexing structure. R-trees 2-dimensional version of the B-tree: B-tree of maximum degree 8; degree between 3 and 8 Internal nodes.
B + -Trees COMP171 Fall AVL Trees / Slide 2 Dictionary for Secondary storage * The AVL tree is an excellent dictionary structure when the entire.
Backtracking.
Geographic Routing Without Location Information A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica In Proceedings of the 9th Annual international Conference.
By Ravi Shankar Dubasi Sivani Kavuri A Popularity-Based Prediction Model for Web Prefetching.
DSI : A Fully Distributed Spatial Index for Location-based Wireless Broadcast Services Sungwon Jung Dept. of Computer Science and Engineering Sogang University.
ICS 220 – Data Structures and Algorithms Week 7 Dr. Ken Cosh.
Massively Distributed Database Systems Broadcasting - Data on air Spring 2014 Ki-Joune Li Pusan National University.
1 B Trees - Motivation Recall our discussion on AVL-trees –The maximum height of an AVL-tree with n-nodes is log 2 (n) since the branching factor (degree,
Network Aware Resource Allocation in Distributed Clouds.
Broadcast Protocols to Support Efficient Retrieval from Databases by Mobile Users By Anindya Datta, et al. Presented by Matt Miller February 20, 2003.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
Sensor Network Databases1 Overview: Chapter 6  Sensor Network Databases  Sensor networks are conceptually a distributed DB  Store collected data  Indexes.
CSCE350 Algorithms and Data Structure Lecture 17 Jianjun Hu Department of Computer Science and Engineering University of South Carolina
Oct 29, 2001CSE 373, Autumn External Storage For large data sets, the computer will have to access the disk. Disk access can take 200,000 times longer.
1 Chapter 17 Disk Storage, Basic File Structures, and Hashing Chapter 18 Index Structures for Files.
Benjamin AraiUniversity of California, Riverside Reliable Hierarchical Data Storage in Sensor Networks Song Lin – Benjamin.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Major objective of this course is: Design and analysis of modern algorithms Different variants Accuracy Efficiency Comparing efficiencies Motivation thinking.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
MA/CSSE 473 Day 28 Dynamic Programming Binomial Coefficients Warshall's algorithm Student questions?
Symbol Tables and Search Trees CSE 2320 – Algorithms and Data Structures Vassilis Athitsos University of Texas at Arlington 1.
IKI 10100: Data Structures & Algorithms Ruli Manurung (acknowledgments to Denny & Ade Azurat) 1 Fasilkom UI Ruli Manurung (Fasilkom UI)IKI10100: Lecture17.
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
Indexing and hashing Azita Keshmiri CS 157B. Basic concept An index for a file in a database system works the same way as the index in text book. For.
Data Structures TREES.
March 23 & 28, Csci 2111: Data and File Structures Week 10, Lectures 1 & 2 Hashing.
March 23 & 28, Hashing. 2 What is Hashing? A Hash function is a function h(K) which transforms a key K into an address. Hashing is like indexing.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
Marwan Al-Namari Hassan Al-Mathami. Indexing What is Indexing? Indexing is a mechanisms. Why we need to use Indexing? We used indexing to speed up access.
Toward a Packet Duplication Control for Opportunistic Routing in WSNs Georgios Z. Papadopoulos, Julien Beaudaux, Antoine Gallais, Periklis Chatzimisios,
Data dissemination in wireless computing environments
Spatial Indexing Techniques Introduction to Spatial Computing CSE 5ISC Some slides adapted from Spatial Databases: A Tour by Shashi Shekhar Prentice Hall.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Massively Distributed Database Systems Broadcasting - Data on air Spring 2015 Ki-Joune Li Pusan National University.
MA/CSSE 473 Day 30 B Trees Dynamic Programming Binomial Coefficients Warshall's algorithm No in-class quiz today Student questions?
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.
Chapter 11. Chapter Summary  Introduction to trees (11.1)  Application of trees (11.2)  Tree traversal (11.3)  Spanning trees (11.4)
Distributed Skip Air Index for Smart Broadcasting in Intelligent Transportation Systems Leandros Maglaras and Dimitrios Katsaros Department of Computer.
Nikos Dimokas1 Dimitrios Katsaros2 (presentation)
Azita Keshmiri CS 157B Ch 12 indexing and hashing
Introduction to Wireless Sensor Networks
Broadcast Information Dissemination
Net 435: Wireless sensor network (WSN)
Nikos Dimokas1 Dimitrios Katsaros (presentation) Leandros Tassiulas2
Dynamic Programming II DP over Intervals
Presentation transcript:

1 Generalized Indexing for Energy-Efficient Access to Partially Ordered Broadcast Data in Wireless Networks Dimitrios Katsaros 1,2 Nikos Dimokas 1 Yannis Manolopoulos 1 10 th IEEE IDEAS Symposium, New Delhi, India, 11-13/12/ Informatics Dept., Aristotle University, Thessaloniki, Greece 2 Computer & Comm. Engineering Dept., University of Thessaly, Volos, Greece

2 Data broadcasting in WSN Heterogeneous sensor net: resource-rich & ordinary sensor nodes Resource-rich nodes (proxies, base stations) serving instructions to ordinary nodes Ordinary nodes “carry data forward”

3 Data broadcasting in Cellular nets Data “on air” General interest data: e.g. stock market Local interest data: e.g. restaurants, hotels

4 Data broadcasting in MANETs Automated battlefield intelligence tactical information

5 Data broadcasting characteristics Contradictory requirements: Small access latency, i.e., the time between when a node needs some data and the moment the node gets these data Small tuning time, i.e., the time a node spends monitoring the communication channel (to save energy) To achieve energy savings: Mobile hosts support active or doze mode Ordinary sensor nodes support active (transmit, receive, idle) or sleeping mode Characteristics: Not all data are of interest to all clients (s kewed access pattern) Not necessary global ordering among data (only partial ordering)

6 Low energy consumption  Indexing Common in the database world B + -trees, R-trees, Hashing …. etc. Complication magnetic disk: random access medium broadcast channel: “one-dimensional” medium Broadcast indexing (so far) only for global data ordering Variations of B-trees, skip-lists, hashing, signatures Good for uniform access pattern Variations of Huffman and Alphabetic trees Unbalanced structures (not binary but k-ary) Good for skewed access pattern Our proposal : the POBI index supports Skewed access pattern Partial data ordering Generalizes Huffman trees and Alphabetic trees

7 Terminology and assumptions resource-rich host (server) broadcasting n equi-sized items through a single broadcast channel, each item denoted as R i resource-starving ordinary hosts tune into the channel flat broadcast : each item R i appears exactly once in the broadcast cycle; neither client caching nor prefetching server is aware of the item popularities Pr(R i ) I pb (R i ) : number of index probes to reach R i d(α i ) : fanout of an index node α i Path(R i ) : set of index nodes from tree root to R i we adopt a generic model for the average cost

8 Relevant work – Broadcast Indexing Uniform access pattern (unrealistic) (1,m) indexing : interleave m copies of the broadcast index, alike a B-tree Distributed index : improve upon (1,m)-indexing IEEE TKDE’97 IEEE TKDE’06 Exponential index : distributed structure, alike skip-lists

9 IEEE TKDE’03 R1R2R3R4R5R6R7R8R9R10R Skewed access pattern (realistic) Variant Fanout tree (VF) : k-ary version of the classic binary Huffman tree pairs of [ Ri, Pr ( Ri )] : record and access probability of the record assumes no ordering at all among Ri, thus it is not a search tree, i.e, internal nodes ( a 1,a 2,a 3,…) can not guide the searching Relevant work – Broadcast Indexing

10 Skewed access pattern (realistic) k-ary Alphabetic tree (kAT) : k-ary version of the classic binary Alphabetic tree pairs of [ Ri, Pr ( Ri )] : record and access probability of the record assumes global ordering among Ri, thus it is a search tree, i.e, internal nodes (1,2,3,…) can guide the searching ACM MONET’96 Relevant work – Broadcast Indexing

11 Less relevant – WSN Indexing index is NOT BROADCASTED over the channel, but STORED in distributed fashion among nodes examples GHT : distributed geographic hashing scheme DIM : based on the k-d quadtree structure: divides network into zones; each node mapped to one zone; maps m-d space to zones; zones organized into a virtual binary tree DIFS : based on the quadtree structure: every node (except the root) has more than one parent for relieving hot-spots DIST : based on the quadtree structure: different spatial resolutions TSAR : based on Skip Graphs

12 Generalizing VF and kAT Suppose the existence of bins (groups) Bi. Bin items are not ordered, items in different bins are ordered Case 1 : Only one bin B1 and all items in it R1R1 R2R2 RnRn Indexing ? VF tree Case 2 : As many bins as the items; exactly one item in each bin R1R1 R2R2 RnRn Indexing ? kAT tree

13 POBI : Generalizing VF and kAT A bin may contain more than one item If only one bin, then previous Case 1 If as many bins as items, then previous Case 2 Practical problem instances Sensor measurements : temperature vs. humidity Battlefields : enemy movements vs. friendly losses Cellular : different projections of relations

14 POBI : Problem definition Problem definition n data items and their access probabilities m number of bins and a membership function construct the index with minimal cost by respecting the partial order, i.e., in an inorder tree traversal x precedes y, if x  B i and y  B j and i < j

15 POBI design – First attempts Brute force  exponentially many permutations generate all possible permutation of the n items obeying group membership and inter-group ordering build an alphabetic tree for the groups Random ordering inside each group and build k-ary alphabetic tree for the grpoups: kATr Sort the items of each group in non-descending (non-increasing) order and build an alphabetic tree for the groups: kATi ( kATd )

16 POBI design – Final attempt Objective: push the less popular items of each group deeper into the resulting broadcast tree Method create subtrees; each subtree corresponds to one group (bin) treat each subtree as a node; the subtree’s cost is its root’s weight apply alphabetic tree construction method to all subtrees Challenge: devise a subtree creation method

17 MostPop : place the most popular item at the tree root, then proceed similarly wrt the branches of the root EqWeig : choose a root that equalizes the weight of the branches POBI : construct a Huffman tree with variant fanout over the items of each group Create a father node x with children all the items n 1, …, n y Sort n 1, …, n y in non-ascending popularity Find a node z such that: Create a new node n x as child of x, father of nodes n z+1, …, n y Recurse wrt both nodes x and n x until no change POBI design – Variations

18 Evaluation setting Since no prior similar work exists, we compare: Straightforward extension of VF, with random ordering inside each group Straightforward extension of kAT, with random ordering inside each group kATi and kATd MostPop and EqWeig and POBI Evaluation wrt: number of items, default 500 number of groups, default 10 relative group size, default 0.1 (Zipf skew theta) relative group popularity, default 0.1 (Zipf skew theta) Performance metric Index access cost

19 Impact of the #nodes (1/2)

20 Impact of the #nodes (2/2)

21 Impact of the #groups (1/2)

22 Impact of the #groups (2/2)

23 Impact of the relative group size (1/2)

24 Impact of the relative group size (2/2)

25 Impact of the relative group popularity

26 Summary and contributions Defined and investigated for the first time indexing broadcast information of partially ordered data Proved that it naturally generalizes two problems proposed earlier in the literature Proposed approximate algorithms to generate the broadcast search trees; optimal algorithms require solving exponential number of subproblems Simulated an environment to evaluate the performance POBI – Partial Ordering Broadcast Index has been proven to prevail