1 Random Walks in WSN 1.Efficient and Robust Query Processing in Dynamic Environments using Random Walk Techniques, Chen Avin, Carlos Brito, IPSN 2004.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science.
The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
Coverage by Directional Sensors Jing Ai and Alhussein A. Abouzeid Dept. of Electrical, Computer and Systems Engineering Rensselaer Polytechnic Institute.
Presentation by: Drew Wichmann Paper by: Samer Hanoun and Saeid Nahavandi 1.
Infocom'04Ossama Younis, Purdue University1 Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-Efficient Approach Ossama Younis and Sonia.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Information Networks Small World Networks Lecture 5.
Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.
Navigating Nets: Simple algorithms for proximity search Robert Krauthgamer (IBM Almaden) Joint work with James R. Lee (UC Berkeley)
Small-World Graphs for High Performance Networking Reem Alshahrani Kent State University.
Analysis of Network Diffusion and Distributed Network Algorithms Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization.
SASH Spatial Approximation Sample Hierarchy
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Theory of Data Flow and Random Placement.
Geographic Gossip: Efficient Aggregations for Sensor Networks Author: Alex Dimakis, Anand Sarwate, Martin Wainwright University: UC Berkeley Venue: IPSN.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Priority Models Sashka Davis University of California, San Diego June 1, 2003.
How To Explore a Fast Changing World (On the Cover Time of Dynamic Graphs) Chen Avin Ben Gurion University Joint work with Michal Koucky & Zvi Lotker (ICALP-08)
Information Brokerage and Delivery to Mobile Sinks HyungJune Lee, Branislav Kusy, Martin Wicke.
Delay Efficient Sleep Scheduling in Wireless Sensor Networks Gang Lu, Narayanan Sadagopan, Bhaskar Krishnamachari, Anish Goel Presented by Boangoat(Bea)
Modeling Data-Centric Routing in Wireless Sensor Networks Bhaskar Krishnamachari, Deborah Estrin, Stephan Wicker.
Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques Chen Avin Carlos Brito.
Complexity of Bellman-Ford Theorem. The message complexity of Bellman-Ford algorithm is exponential. Proof outline. Consider a topology with an even number.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
Efficient Gathering of Correlated Data in Sensor Networks
Computing and Communicating Functions over Sensor Networks A.Giridhar and P. R. Kumar Presented by Srikanth Hariharan.
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Random Walks on Distributed N etworks Masafumi Yamash ita (Kyushu Univ., Japan)
HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Algorithms for Radio Networks Exercise 11 Stefan Rührup
Many random walks are faster than one Noga AlonTel Aviv University Chen AvinBen Gurion University Michal KouckyCzech Academy of Sciences Gady KozmaWeizmann.
Complexity of Bellman-Ford
On Non-Disjoint Dominating Sets for the Lifetime of Wireless Sensor Networks Akshaye Dhawan.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.
Nearest Neighbor Queries Chris Buzzerd, Dave Boerner, and Kevin Stewart.
A correction The definition of knot in page 147 is not correct. The correct definition is: A knot in a directed graph is a subgraph with the property that.
Trade-offs Between Mobility and Density for Coverage in Wireless Sensor Networks Wei Wang, Vikram Srinivasan and Kee-Chaing Chua National University of.
11/25/2015 Wireless Sensor Networks COE 499 Localization Tarek Sheltami KFUPM CCSE COE 1.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
NTU IM Page 1 of 35 Modelling Data-Centric Routing in Wireless Sensor Networks IEEE INFOCOM Author: Bhaskar Krishnamachari Deborah Estrin Stephen.
A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
KAIS T On the problem of placing Mobility Anchor Points in Wireless Mesh Networks Lei Wu & Bjorn Lanfeldt, Wireless Mesh Community Networks Workshop, 2006.
Exact Inference in Bayes Nets. Notation U: set of nodes in a graph X i : random variable associated with node i π i : parents of node i Joint probability:
Two Connected Dominating Set Algorithms for Wireless Sensor Networks Overview Najla Al-Nabhan* ♦ Bowu Zhang** ♦ Mznah Al-Rodhaan* ♦ Abdullah Al-Dhelaan*
Self-stabilizing energy-efficient multicast for MANETs.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
Distributed Algorithms for Dynamic Coverage in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver.
March 9, Broadcasting with Bounded Number of Redundant Transmissions Majid Khabbazian.
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
Traveling Salesman Problems Motivated by Robot Navigation
Coverage and Connectivity in Sensor Networks
Department of Computer Science University of York
Introduction Wireless Ad-Hoc Network
Speaker : Lee Heon-Jong
Presentation transcript:

1 Random Walks in WSN 1.Efficient and Robust Query Processing in Dynamic Environments using Random Walk Techniques, Chen Avin, Carlos Brito, IPSN Random Walks on Sensor Networks, Luisa Lima, Joao Barros, WiOpt 2007, Limassol, Cyprus, April, 2007.

2 Random Walks for Query Processing WSN features a highly dynamic environment State-based solutions for information extraction (clusters, spanning trees) introduce single points of failure, like clusterheads or roots of spanning trees Increased failure rate of nodes requires sophisticated failure recovery mechanism (increasing the overall complexity) This leads to severe impact on the overall performance of the network (in terms of energy efficiency or bandwidth wasted)

3 Random Walks for Query Processing Justifying random walks –No single point of failure for the method to operate (all nodes are equally unimportant at all times) –Only a connected neighbor required to keep the packet moving –Simple process of visiting nodes of graph G in some sequential random order –When token arrives at node v, information in token is updated with local info stored at node v High redundancy in network –No necessity to consult every node in the network –Introducing Partial Cover Time (PCT)

4 Network Cover Time Partial Cover Time, PCT –Expected number of steps required by a random walk to visit a constant fraction of the nodes (50%, 80%, 99%) Cover Time, C –Expected number of steps by a random walk to visit all nodes in the network (starting from an arbitrary node) Given graph G(V,E) and two arbitrary nodes i, j in G h ij expected number of steps to move from i to j h max, h min the max./min. over all ordered pairs of nodes in G

5 Network Cover Time Known results for C –Best case graphs (dense, highly connected graphs, such as the complete graph or d-regular graph with d>n/2 or the hypercube): C = O(nlog(n)) –Worst case graphs (when connectivity decreases and “ bottlenecks ” exist in the graph): C = O(n 3 ) Upper Bound for PCT (proof in the paper) –For 0≤c≤1 let PCT(c) be the expected time to cover nodes of a graph G –It is shown for PCT that reducing Matthews bound by an order of log(n), so it becomes linear in h max

6 Network Cover Time Comments on PCT For graphs where h max = n, the PCT linear in n Complete graph, star graph and hypercube are such graphs Covering x% of nodes in Hypercube (d-regular graph with d=log(n)) is O(n) Cover Time C in Hypercube is O(nlog(n)) For the grid (d-regular graph with d=4) h max = nlog(n) so PCT = O(nlog(n )) Sensor nets are ‘almost’ d-regular graphs that lie between the two (hypercube and grid)

7 Efficiency of PCT Experiments on grid, Hypercube, random graphs Random graphs generated as random geometric graph of n nodes on a unit grid with connectivity of max. range R –N = 4096 nodes –R = 0.04 units Figure depicts efficiency of PCT for –Grid –Random network with R = (aver. node degree 15) –Random network with R = 0.04 (aver. node degree 19) –Hypercube of degree 12

8 Efficiency of PCT O(n)

9 Quality of PCT Measure the quality of 80% cover –Metric: How far on average are the uncovered nodes from the ones that have been covered

10 Quality of PCT In random graph –About 90% of uncovered nodes are at most 2 hops away from a covered node In the grid –About 60% of uncovered nodes are at most 2 hops away from a covered node

11 Load Balancing Random walk is uncontrolled process Some nodes may be visited more than once (backtracking, walk in cycles) Those nodes spend more energy than others RW process is a Markov Chain –For long walks the process reaches stationary distribution π –Distribution π = {π 1, …, π n }, where π i is given by π i = d i / 2m (d i number of neighbors of node i and m number of edges in the network) If the graph is d-regular, then stationary distribution is uniform distribution

12 Load Balancing In our case, issuing ‘short’ walks due to PCT No guarantee that some nodes will be much more often visited than others Histogram presents number of visits to each node in 80% cover random walk The walk had steps

13 Load Balancing

14 Latency Random Walk is a sequential process Latency proportional to number of steps required to accomplish task If #steps = O(n) the applicability of the process is limited for large networks Possible idea: –Divide the network into regions –Perform random walks in parallel on each of them Our approach? To accelerate RW process??

15 Random Walks on Sensor Networks Exploitation of mobile nodes for data gathering purposes Two types of sensors: 1.Static sensor nodes with limited connectivity (taking local values) 2.Mobile, patrol node circulating area and collecting data Suffices mobile node to enter transmission range of static node for its data to be collected Node coverage: describing effectiveness of different mobile data gathering strategies

16 Random Walks on Sensor Networks Sensor network modelled as random geometric graph (n nodes, uniformly random placement, nodes within distance γ are connected) DEFINITION (Node Coverage) A sensor is collected if area defined by its transmission radius is visited at least once! Node coverage η(t): expected number of distinct sensor nodes collected until time t Goal of patrol node: To gather as much data as possible within a time frame / To maximize η(t)

17 Random Walks on Sensor Networks Individual sensor positions are unknown Mobile node performs random walk on unit square lattice Sensors within its transmission radius are queried Ratio between the transmission radius and step size (lattice size) needs to be carefully fixed

18 Node Coverage for unconstrained random walk Mathematical characterization of node coverage in terms of the following entities:

19 Node Coverage for unconstrained random walk Let E[S(t)] be the support of the walk at time t Average number of sites not visited until time t is N - E[S(t)] = N (cN) –σ N: number of possible sites in finite lattice c: σ: time scaling factor (t = σπ -1 Νln 2 cN)

20 Node Coverage for unconstrained random walk Theorem Bounds for expected node coverage E[η] of unconstrained random walk until time t

21 Node Coverage for unconstrained random walk

22 Node Coverage for unconstrained random walk Node coverage curves have a steep start Node coverage curves stagnate as time progresses For increasing number of visited sites the mobile node is likely to spend more and more time in those (visited sites) instead of the not yet visited ones