1 Mathematical Modeling and Algorithms for Wireless Sensor Networks Bhaskar Krishnamachari Autonomous Networks Research Group Department of Electrical.

Slides:



Advertisements
Similar presentations
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang Wang University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC.
Advertisements

6LoWPAN Extending IP to Low-Power WPAN 1 By: Shadi Janansefat CS441 Dr. Kemal Akkaya Fall 2011.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
SELF-ORGANIZING MEDIA ACCESS MECHANISM OF A WIRELESS SENSOR NETWORK AHM QUAMRUZZAMAN.
TDMA Scheduling in Wireless Sensor Networks
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
IEEE SECON, October 6, 2004 Research Funding for Sensor Networks: An Academic Perspective Bhaskar Krishnamachari Autonomous Networks Research Group Department.
TTDD: A Two-tier Data Dissemination Model for Large- scale Wireless Sensor Networks Haiyun Luo Fan Ye, Jerry Cheng Songwu Lu, Lixia Zhang UCLA CS Dept.
1 Crosslayer Design for Distributed MAC and Network Coding in Wireless Ad Hoc Networks Yalin E. Sagduyu Anthony Ephremides University of Maryland at College.
Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors S. Kumar, T. Lai, M. Posner and P. Sinha, BROADNETS ’ 2007.
Localized Techniques for Power Minimization and Information Gathering in Sensor Networks EE249 Final Presentation David Tong Nguyen Abhijit Davare Mentor:
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.
Sprint ATL, July 19, Networking Wireless Sensors: New Challenges Bhaskar Krishnamachari Autonomous Networks Research Group Department of Electrical.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
NOSS PI Meeting, October 18, 2004 Data-Centric Active Querying in Sensor Networks: The ACQUIRE Project Bhaskar Krishnamachari Co-PI: Ahmed Helmy Department.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
1 Random Walks in WSN 1.Efficient and Robust Query Processing in Dynamic Environments using Random Walk Techniques, Chen Avin, Carlos Brito, IPSN 2004.
Wireless Distributed Sensor Networks Special Thanks to: Jasvinder Singh Hitesh Nama.
NSF-RPI Workshop on Pervasive Computing and Networking, April 29-30, Self Optimization in Wireless Sensor Networks Bhaskar Krishnamachari Autonomous.
Connected Dominating Sets in Wireless Networks My T. Thai Dept of Comp & Info Sci & Engineering University of Florida June 20, 2006.
Energy Conservation in wireless sensor networks Kshitij Desai, Mayuresh Randive, Animesh Nandanwar.
Medium Access Control With Coordinated Adaptive Sleeping for Wireless Sensor Networks Debate 1 - Defense Joseph Camp Anastasios Giannoulis.
Delay Efficient Sleep Scheduling in Wireless Sensor Networks Gang Lu, Narayanan Sadagopan, Bhaskar Krishnamachari, Anish Goel Presented by Boangoat(Bea)
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
1 Energy Efficient Communication in Wireless Sensor Networks Yingyue Xu 8/14/2015.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
1 Chalermek Intanagonwiwat (USC/ISI) Ramesh Govindan (USC/ISI) Deborah Estrin (USC/ISI and UCLA) DARPA Sponsored SCADDS project Directed Diffusion
Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
TRUST, Spring Conference, April 2-3, 2008 Taking Advantage of Data Correlation to Control the Topology of Wireless Sensor Networks Sergio Bermudez and.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.
Scalable Data Aggregation for Dynamic Events in Sensor Networks Kai-Wei Fan Kai-Wei Fan, Sha Liu, and Prasun.
Why Visual Sensor Network & SMAC Implementation Group Presentation Raghul Gunasekaran.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
SenMetrics Towards Efficient Routing in Wireless Sensor Networks Bhaskar Krishnamachari Autonomous Networks Research Group Department of Electrical.
1 An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Network Gang Lu, Bhaskar Krishnamachari, and Cauligi Raghavendra.
MAC Protocols In Sensor Networks.  MAC allows multiple users to share a common channel.  Conflict-free protocols ensure successful transmission. Channel.
Presenter: Abhishek Gupta Dept. of Electrical and Computer Engineering
1 Delay Efficient Sleep Scheduling in Wireless Sensor Networks Gang Lu, Narayanan Sadagopan, and Bhaskar Krishnamachari IEEE INFOCOM, Miami, FL, March.
Using Polynomial Approximation as Compression and Aggregation Technique in Wireless Sensor Networks Bouabdellah KECHAR Oran University.
Energy and Latency Control in Low Duty Cycle MAC Protocols Yuan Li, Wei Ye, John Heidemann Information Sciences Institute, University of Southern California.
NTU IM Page 1 of 35 Modelling Data-Centric Routing in Wireless Sensor Networks IEEE INFOCOM Author: Bhaskar Krishnamachari Deborah Estrin Stephen.
ELECTIONEL ECTI ON ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks Shamim Begum, Shao-Cheng Wang, Bhaskar.
Maximizing the lifetime of WSN using VBS Yaxiong Zhao and Jie Wu Computer and Information Sciences Temple University.
An Adaptive Energy-Efficient and Low- Latency MAC for Data Gathering in Wireless Sensor Networks Gang Lu, Bhaskar Krishnamachari, and Cauligi S. Raghavendra.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Yu Gu and Tian He Minnesota Embedded Sensor System (MESS) Department of Computer Science & Engineering This work is supported by.
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.
Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵
Turkmen Canli ± and Ashfaq Khokhar* Electrical and Computer Engineering Department ± Computer Science Department* The University of Illinois at Chicago.
UNIT IV INFRASTRUCTURE ESTABLISHMENT. INTRODUCTION When a sensor network is first activated, various tasks must be performed to establish the necessary.
Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati (Fellow IEEE) IEEE Transactions on Mobile Computing, March 2012.
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
A Bit-Map-Assisted Energy- Efficient MAC Scheme for Wireless Sensor Networks Jing Li and Georgios Y. Lazarou Department of Electrical and Computer Engineering,
Oregon Graduate Institute1 Sensor and energy-efficient networking CSE 525: Advanced Networking Computer Science and Engineering Department Winter 2004.
Minimum Power Configuration in Wireless Sensor Networks Guoliang Xing*, Chenyang Lu*, Ying Zhang**, Qingfeng Huang**, and Robert Pless* *Washington University.
MAC Protocols for Sensor Networks
MAC Protocols for Sensor Networks
Introduction to Wireless Sensor Networks
Computing and Compressive Sensing in Wireless Sensor Networks
Net 435: Wireless sensor network (WSN)
Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks
Luis J. Gonzalez UCCS – CS526
Presentation transcript:

1 Mathematical Modeling and Algorithms for Wireless Sensor Networks Bhaskar Krishnamachari Autonomous Networks Research Group Department of Electrical Engineering-Systems USC Viterbi School of Engineering

2 Wireless Sensor Networks Large scale networks of small embedded devices, each with sensing, computation and communication capabilities. Use of wireless networks of embedded computers “could well dwarf previous milestones in the information revolution” - National Research Council Report: Embedded, Everywhere, Research pioneered at USC/ISI

3 Structural monitoringBio-habitat monitoring Military surveillanceDisaster management Industrial monitoring Note: images used may be copyrighted. Used here for limited educational purposes only. Not intended for commercial or public use. Home/building security Wide Ranging Applications

4 Challenges Scarce energy, low bandwidth Unattended ad-hoc deployment Very large scale High noise and fault rates Dynamic / uncertain environments High variation in application-specific requirements

5 Autonomous Networks Research Group 10 Ph.D. students in EE and CS Primary focus: modeling, analysis, optimization and algorithms for routing and querying in wireless sensor networks. Highlights of ongoing research activities: –experimental studies of wireless link quality –a fundamental theorem concerning random geometric graphs –analysis of routing with compression –linear/non-linear flow optimization formulations of WSN routing –best radio signal strength-based localization technique to date –new querying and search techniques for WSN –algorithms for low latency scheduling and routing

6 1. Impact of Spatial Correlation on Routing with Compression Pattem, Krishnamachari, Govindan, “Impact of Spatial Correlation on Routing with Compression in Wireless Sensor Networks,” IPSN [IPSN ‘04 Best Student Paper Award]

7 Spatial Correlation Model Inter-node spacing d Correlation level c Number of nodes n Entropy of single source H 1 A parameterized expression for the joint entropy of n linearly placed equally spaced nodes

8 Cluster-based Routing with Compression

9 Analysis Data from s nodes is compressed sequentially before routing to the sink. We can derive expressions for the energy cost as a function of the cluster size s: Can then derive an expression for the optimal cluster size as a function of the network size and correlation level:

10 Cluster-based routing + compression Suggests the existence of a near-optimal cluster (about 15) that is insensitive to correlation level!

11 Near-Optimal Clustering Can formalize the notion of near-optimality using a maximum difference metric: We can then derive an expression for the near-optimal cluster size: This is independent of the correlation level, but does depend on the network size, number of sources, and location of the sink. For the above scenario, it turns out s no = 14 (which explains the results shown).

12 Near-Optimal Clustering

13 Summary These results (further extended to 2D scenarios in recent work) indicate that a simple, non-adaptive, cluster-based routing and compression strategy is robust and efficient.

14 2. Delay Efficient Sleep Scheduling Lu, Sadagopan, Krishnamachari, Goel “Delay Efficient Sleep Scheduling in Wireless Sensor Networks,” IEEE Infocom [2005 USC EE-Systems Dept. Best Student Paper Award]

15 Sleep Latency Largest source of energy consumption is keeping the radio on (even if idle). Particularly wasteful in low-data-rate applications. Solution: Globally synchronized duty-cycled sleep-wakeup cycles. E.g. S- MAC (Ye, Heidemann ‘02) Another Problem: increased sleep latency time

16 Setup/Assumptions Each node is assigned one slot out of k to be an active reception slot which is advertised to all neighbors that may have to transmit to it. Nodes sleep on all other slots unless they have a packet to transmit. We assume low traffic so that only sleep latency is dominant and there is low interference/contention.

17 General Problem Formulation The per-hop sleep delay is the difference between reception slots of neighboring nodes Data between any pair of nodes are routed on lowest-delay path between them Goal: assign reception slots to nodes to minimize the worst case end to end delay (delay diameter)

18 DESS Problem Formulation Given a graph G, assign one of k reception slots to each node to minimize the maximum shortest- cost-path delay between any two points in the network

19 NP-Hardness

20 Although problem is NP-hard in general (hence no known polynomial time algorithms), can derive optimal solutions for some special cases with structure Tree: alternate between 0 and k/2. Gives worst delay diameter of dk/2 Ring: sequential slot assignment has best possible delay diameter of (1 - 1/k)*n A constant factor approximation can be obtained in case of the square grid by using the solution for the ring as a building block Special Cases: Tree, Ring

21 Special Case: Grid A solution for the grid is to use an arrangement of concentric rings Can prove that this provides a constant factor approximation

22 Multi-Schedule Solutions If each node is allowed to adopt multiple schedules, then can find much more efficient solutions: Grid: delay diameter of at most d + 8k (create four cascading schedules at each node, one for each direction) Tree: delay diameter of at most d+4k (create two schedules at each node, one for each direction) On general graphs can obtain a O( (d + k)log n) approximation for the delay diameter

23 Summary Sleep schedules should be intelligently designed to enable low-latency routing while maintaining energy efficiency Ongoing work looks at adaptively assigning these schedules depending on current flows in the network (rather than worst-case over all possible flows)