Deploying Long-Lived and Cost-effective Hybrid Sensor Networks

Slides:



Advertisements
Similar presentations
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.
Advertisements

Coverage by Directional Sensors Jing Ai and Alhussein A. Abouzeid Dept. of Electrical, Computer and Systems Engineering Rensselaer Polytechnic Institute.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
Ear-Phone: An End-to-End Participatory Urban Noise Mapping System -Rajib Kumar Rana, Chun Tung Chou, Salil S. Kanhere, Nirupama Bulusu, Wen Hu -School.
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.
The Cache Location Problem IEEE/ACM Transactions on Networking, Vol. 8, No. 5, October 2000 P. Krishnan, Danny Raz, Member, IEEE, and Yuval Shavitt, Member,
Ant Colonies As Logistic Processes Optimizers
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Layered Diffusion based Coverage Control in Wireless Sensor Networks Wang, Bang; Fu, Cheng; Lim, Hock Beng; Local Computer Networks, LCN nd.
1 Target-Oriented Scheduling in Directional Sensor Networks Yanli Cai, Wei Lou, Minglu Li,and Xiang-Yang Li* The Hong Kong Polytechnic University, Hong.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
SensEye: A Multi-Tier Camera Sensor Network by Purushottam Kulkarni, Deepak Ganesan, Prashant Shenoy, and Qifeng Lu Presenters: Yen-Chia Chen and Ivan.
Introduction Due to the recent advances in smart grid as well as the increasing dissemination of smart meters, the electricity usage of every moment in.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
Decentralized Scattering of Wake-up Times in Wireless Sensor Networks Amy L. Murphy ITC-IRST, Trento, Italy joint work with Alessandro Giusti, Politecnico.
07/21/2005 Senmetrics1 Xin Liu Computer Science Department University of California, Davis Joint work with P. Mohapatra On the Deployment of Wireless Sensor.
Network Aware Resource Allocation in Distributed Clouds.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
Scalable Data Aggregation for Dynamic Events in Sensor Networks Kai-Wei Fan Kai-Wei Fan, Sha Liu, and Prasun.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
Resource/Accuracy Tradeoffs in Software-Defined Measurement Masoud Moshref, Minlan Yu, Ramesh Govindan HotSDN’13.
College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.
Section 6-5 The Central Limit Theorem. THE CENTRAL LIMIT THEOREM Given: 1.The random variable x has a distribution (which may or may not be normal) with.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Efficient k-Coverage Algorithms for Wireless Sensor Networks Mohamed Hefeeda.
Lecture 4 TTH 03:30AM-04:45PM Dr. Jianjun Hu CSCE569 Parallel Computing University of South Carolina Department of.
Optimal Self-placement of Heterogeneous Mobile Sensors in Sensor Networks Lidan Miao AICIP Research Oct. 19, 2004.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
DISTIN: Distributed Inference and Optimization in WSNs A Message-Passing Perspective SCOM Team
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.
A Coverage-Preserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in WSNs Azzedine Boukerche, Xin Fei PARADISE Research Lab Univeristy.
Wireless Sensor Networks Wake-up Receivers
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Prof. Yu-Chee Tseng Department of Computer Science
Introduction to Wireless Sensor Networks
Xiaobing Wu, Guihai Chen and Sajal K. Das
Presented by Munezero Immaculee Joselyne PhD in Software Engineering
Ahmed Helmy Computer and Information Science and Engineering (CISE)
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
Infer: A Bayesian Inference Approach towards Energy Efficient Data Collection in Dense Sensor Networks. G. Hartl and B.Li In Proc. of ICDCS Natalia.
Power Efficient Monitoring Management In Sensor Networks
Degree-aware Hybrid Graph Traversal on FPGA-HMC Platform
Barrier Coverage with Optimized Quality for Wireless Sensor Networks
Presented By: Darlene Banta
A Better Approximation for Minimum Total Routing Path Clustering Problem in 2-D Underwater Sensor Networks Wei Wang, Donghyun Kim, and Weili Wu, A Better.
MECH 3550 : Simulation & Visualization
Parallel Programming in C with MPI and OpenMP
Connected Sensor Cover Problem
Survey on Coverage Problems in Wireless Sensor Networks - 2
BICRITERIA OPTIMIZATION OF ENERGY EFFICIENT PLACEMENT AND ROUTING IN HETEROGENOUS WIRELESS SENSOR NETWORKS Mustafa Gökçe Baydoğan School of Computing,
Hongchao Zhou, Fei Liu, Xiaohong Guan
Outline Kulkarni, P., Ganesan, D., Shenoy, P., and Lu, Q. SensEye: a multi-tier camera sensor network. In Proceedings of the 13th Annual ACM international.
Overview: Chapter 2 Localization and Tracking
Presentation transcript:

Deploying Long-Lived and Cost-effective Hybrid Sensor Networks As any graduate student knows, every research project has chiefs who bark out the orders and one Indian who do the actual work. I am the chief, so I’ll try to do a bit better than Dilbert’s boss in explaining this work. Nirupama Bulusu, Portland State University joint work with Wen Hu, Chun-tung Chou, Sanjay Jha (University of New South Wales) 2018/11/11

Our Sensor Net App Cane Toad Monitoring Requirements “Cane toads will progressively shell shock an unsuspecting Kakadu environment, in particular they will come close to wiping out native quoll populations, poison large masses of goannas and disturb the food supply of many native animals.” Requirements Cheap, wide-area sensing coverage … but sophisticated processing, communication for target localization and vocalization Cane Toad Explosion So, I’ll start this talk by describing a motivating app. Which is monitoring cane-toads. Cane-toads are not a native species to Australia and were introduced there for pest control. Because they had no natural predators, they are multiplying in rapid numbers and endangering the species. Our goal is to build a sensor system that can track the population of cane-toads, as well as their location. This is done by running machine learning Algorithms which analyze the frog chorus. This is an application which demonstrates the need for both cheap, and Wide sensing coverage as well as sophisticated processing and communication to run the machine learning algorithms in the network. 2018/11/11 Co

Hybrid Sensor Networks How do you achieve these goals? By having a mix of both cheap, resource-impoverished devices Which provide you abundant coverage; And resource-rich devices such as the Stargates which provide much more Functionality. You can think of a two-tier network in which the motes communicate With the Stargates using Chipcon radios, and Stargates have an additional Out of band communication in which Stargates can talk with each other. Platforms A Hierarchical View 2018/11/11

Previous Work: Data Anycast Deliver data to preferably nearest micro-server, which can Forward it using out of band, broadband (802.11b, 802.11g) communications link Store/process it Perform the desired actuation Build up a reverse-tree at each sensor efficiently (scalability, adaptability/mobility, little over-head/energy efficient, distributed, simplicity) Reference: Wen Hu, Nirupama Bulusu, and Sanjay Jha, “A communication paradigm for hybrid sensor/actuator networks,” in Proceedings of the IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2004), Barcelona, Spain, October 2004. An interesting question is how communications and control should be Structured in such hybrid systems, which sort of require a greater synergy between devices than would be possible in traditional networks. In our previous work, we have thought of an anycast architecture, where instead of sending all data back to a central root node, the nodes just deliver data to preferably the nearest micro-server, which can take the appropriate action depending on the app. - For example, forwarding it on a high bandwidth link. 2018/11/11

This Paper: Deployment Issues What is the maximum network lifetime possible for a given number of micro-servers? What is the optimal micro-server placement of micro-servers to achieve maximum lifetime? Is the deployment cost-effective? How to achieve optimal cost benefit? When studying the performance of our communication paradigm, it became clear that any reasonable performance analysis depending on our understanding of how these sensors and micro-servers are deployed, and we will explored those issues in this paper. Specifically, three questions we asked are: 2018/11/11

Cost Model Energy consumption limitation of sensor To study the problem, we start with the simple assumption that sensors And micro-servers will be placed in a 2D grid layout. We proposed a cost-model that accounts for different event rates, communication costs, energy variations between sensors and micro-servers. And trying to maximize the system lifetime under these cost constraints. Energy consumption limitation of Micro-server (assuming sensors, micro-servers in 2D grid layout) 2018/11/11

A Tabu Search Algorithm The model is a huge combinatorial problem. An approximation tabu-search algorithm Algorithm benchmark (a 20 grid network) This is a combinatorially very complex problem, because it requires us to consider all possible combinations of placing microservers in a huge grid. So, the major contribution of this paper is a Tabu-search algorithm which Is an approximation algorithm. You benchmark the algorithm against Cplex solver for a 20-grid network. And we find that our results match the optimal results but our computation is significantly faster. So, how does the Tabu search algorithm work. In a nutshell, basically it prepares a tabu-list of microservers, and iterates at each step, though a process of intensification of the good results and diversification of other microservers. 2018/11/11

Network lifetime of a 100 grid network This graph plots the network lifetime as a function of the number of microservers. Not surprisingly, the network lifetime Increases as the number of micro-servers increases And you see that the best case lifetime can be nearly 5 times better than The worst case lifetime. If you just scattered sensors at random, and the spatiotemporal event patterns were fairly uniform You would expect it to lie somewhere in between these two graphs. 2018/11/11

Micro-server Placement 2018/11/11

Cost-effectiveness (network size=100, vary k) We all know that we can arbitrarily increase the lifetime of the network by adding more microservers, but how cost-effective is it? In order to understand that, we use a normalized lifetime/unit cost metric, which Is basically the network lifetime divided by the cost of the network, which is the cost of sensors + microservers. K represnts the ratio of the micro-server cost to the sensor cost. This graph shows the normalized lifetime as a function of the number of microservers for a 100-grid network, for different values of k. We see two trends: There is a clear peak in terms of the micro-servers beyond which you don’t get significant performance benefits. The lifetime benefits itself fall off as the cost of the microservers increases relative to the sensors, which is what you would expect. 2018/11/11

Cost-effectiveness (k=50, vary network size) This graph keeps the cost ratio constant, and varies the network size. Not suprisingly, you can see that as the size of the network increases, the cost-benefit of having the same micros-servers increases. Again, the interesting thing about this graph is the existence of inflection points. 2018/11/11

Concluding Thoughts A methodology for studying hybrid sensor deployment (cost model + tabu search algorithm) spatiotemporal event rates captured as discrete variables learn from inference, use to reconfigure micro-server deployment applicable to storage, computation etc. Use as engineering guideline, not as a guarantee 2018/11/11