Xiaoyuan Liang, Jie Tian, Guiling Wang New Jersey Institute of Technology Deploying Mobile Survivability-Heterogeneous Sensor Networks for Barrier Coverage.

Slides:



Advertisements
Similar presentations
Distributed Algorithms for Mobile Sensor Networks Chelsea Sanders Ben Tullis.
Advertisements

Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.
Movement-Assisted Sensor Deployment Author : Guiling Wang, Guohong Cao, Tom La Porta Presenter : Young-Hwan Kim.
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.
Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.
Wireless Sensor Network and Applicaions(WSNA2002) A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks Di Tian, Nicolas D. Georganas.
Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, Lixia Zhang
Differentiated Surveillance for Sensor Networks Ting Yan, Tian He, John A. Stankovic CS294-1 Jonathan Hui November 20, 2003.
Deployment Strategies for Differentiated Detection in Wireless Sensor Network Jingbin Zhang, Ting Yan, and Sang H. Son University of Virginia From SECON.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
SMART: A Scan-based Movement- Assisted Sensor Deployment Method in Wireless Sensor Networks Jie Wu and Shuhui Yang Department of Computer Science and Engineering.
A Survey on Energy Efficient MAC Protocol for Wireless Sensor Networks Huma Naushad.
Layered Diffusion based Coverage Control in Wireless Sensor Networks Wang, Bang; Fu, Cheng; Lim, Hock Beng; Local Computer Networks, LCN nd.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Exposure In Wireless Ad-Hoc Sensor Networks S. Megerian, F. Koushanfar, G. Qu, G. Veltri, M. Potkonjak ACM SIG MOBILE 2001 (Mobicom) Journal version: S.
1 A Coverage-Preserving & Hole Tolerant Based Scheme for the Irregular Sensing Range in WSN Azzedine Boukerche, Xin Fei, Regina B. Araujo PARADISE Research.
Direct movement has long relocation time and overuses the redundant sensor Motivation Coverage under random deployment Coverage under clustering All the.
Introduction To Wireless Sensor Networks Wireless Sensor Networks A wireless sensor network (WSN) is a wireless network consisting of spatially distributed.
Achieving Long-Term Surveillance in VigilNet Pascal A. Vicaire Department of Computer Science University of Virginia Charlottesville, USA.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Project Introduction 이 상 신 Korea Electronics Technology Institute.
TRUST, Spring Conference, April 2-3, 2008 Taking Advantage of Data Correlation to Control the Topology of Wireless Sensor Networks Sergio Bermudez and.
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol
Dynamic Coverage Enhancement for Object Tracking in Hybrid Sensor Networks Computer Science and Information Engineering Department Fu-Jen Catholic University.
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
THE COVERAGE PROBLEM IN THREE-DIMENSIONAL WIRELESS SENSOR NETWORKS Journal of Interconnection Networks 8.03 (2007): Authors: Chi-Fu Huang; Tseng.
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Distributed Anomaly Detection in Wireless Sensor Networks Ksutharshan Rajasegarar, Christopher Leckie, Marimutha Palaniswami, James C. Bezdek IEEE ICCS2006(Institutions.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
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.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
Algorithms for Wireless Sensor Networks Marcela Boboila, George Iordache Computer Science Department Stony Brook University.
Relative Accuracy based Location Estimation in Wireless Ad Hoc Sensor Networks May Wong 1 Demet Aksoy 2 1 Intel, Inc. 2 University of California, Davis.
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
Optimal Self-placement of Heterogeneous Mobile Sensors in Sensor Networks Lidan Miao AICIP Research Oct. 19, 2004.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Redeployment for Mobile Wireless Sensor Networks Weihong Fan, Hengyang Zhang and Xuanping Cai Yunhui Liu Yunhui LiuJoint Center of Intelligent Sensing.
Chinh T. Vu, Yingshu Li Computer Science Department Georgia State University IEEE percom 2009 Delaunay-triangulation based complete coverage in wireless.
Covering Points of Interest with Mobile Sensors Milan Erdelj, Tahiry Razafindralambo and David Simplot-Ryl INRIA Lille - Nord Europe IEEE Transactions on.
Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Wensheng Zhang, and Chuang Wang Department of Computer Science, Iowa State University.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Sanjay K. Dhurandher, Mohammad S. Obaidat, Fellow of IEEE and Fellow of SCS, Siddharth Goel and Abhishek Gupta CAITFS, Division of Information Technology,
Ching-Ju Lin Institute of Networking and Multimedia NTU
Shibo He 、 Jiming Chen 、 Xu Li 、, Xuemin (Sherman) Shen and Youxian Sun State Key Laboratory of Industrial Control Technology, Zhejiang University, China.
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
Mobile Sensor Deployment for a Dynamic Cluster-based Target Tracking Sensor Network Niaoning Shan and Jindong Tan Department of Electrical and Computter.
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati (Fellow IEEE) IEEE Transactions on Mobile Computing, March 2012.
SenSys 2003 Differentiated Surveillance for Sensor Networks Ting Yan Tian He John A. Stankovic Department of Computer Science, University of Virginia November.
Jinfang Jiang, Guangjie Han, Lei Shu, Han-Chieh Chao, Shojiro Nishio
A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks Di Tian, Nicolas D. Georganas First ACM international workshop on Wireless.
Outline Introduction Network model Two-phase algorithm Simulation
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.
Strong Barrier Coverage of Wireless Sensor Networks Benyuan Liu, Olivier Dousse, Jie Wang and Anwar Saipulla University of Massachusetts Lowell and Deutsche.
Structures for In-Network Moving Object Tracking in Wireless Sensor Networks Chih-Yu Lin and Yu-Chee Tseng Department of Computer Science and Information.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Energy-Aware Target Localization in Wireless Sensor Networks Yi Zou and Krishnendu Chakrabarty IEEE (PerCom’03) Speaker: Hsu-Jui Chang.
1 Terrain-Constrained Mobile Sensor Networks Shu Zhou 1, Wei Shu 1, Min-You Wu 2 1.The University of New Mexico 2.Shanghai Jiao Tong University IEEE Globecom.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
1 Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks Anand Visvanathan and Jitender Deogun Department of Computer Science and Engg,
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
Coverage and Deployment 1. Coverage Problems Coverage: is a measure of the Quality of Service (QoS) of a sensor network How well can the network observe.
Prof. Yu-Chee Tseng Department of Computer Science
Overview of Wireless Networks:
Presentation transcript:

Xiaoyuan Liang, Jie Tian, Guiling Wang New Jersey Institute of Technology Deploying Mobile Survivability-Heterogeneous Sensor Networks for Barrier Coverage Motivation Wireless Sensor Networks have been widely employed in many long-term surveillance applications. Intruder detection is one very important long- term field surveillance application. Network Model Goal Our goal is to construct a barrier to detect intruders outdoors and to maintain it working as long as possible under different weather conditions. we propose a greedy barrier construction algorithm to solve the problem. A minimum energy consumption in either minimizing the number of moving robust sensors or the total distance of moving robust sensors is considered in each coordinator to increase the network lifetime. Introduction However, as a tiny electronic device, an on-duty sensor node which is dropped outside is vulnerable to many environmental attributes or detriments, such as rain or snow. To increase the survivability of a sensor node outdoor, one way is to equip it with additional protections to make it for example waterproof [5]. In the intruder detection, sensors are deployed in a long- belt field to detect intruders. Intruder’s objective is to traverse the monitored area. For example, in a battlefield, an enemy may try to traverse a protected area to conduct some malicious tasks, the successful detection of which before he passes through is important. It is a new kind of wireless sensor network, a mobile survivability-heterogeneous sensor network composed of both static regular sensors without protections and mobile robust sensors with protections. A mobile robust sensor is reliable, moveable and can work under both sunny and rainy weather. Fig. 1 Wired Intruder Detection System Fig. 3 Robomote, a sensor with the moveable ability Fig. 2 Environmental disaster outside Default Barrier Construction During the sunny weather, the barrier is constructed with both regular and robust sensors. If no holes in the barrier, If there are holes, robust sensors move to repair. Mobile Sensor Reallocation When the rainy weather is coming, only robust sensors can work. First, divide the whole area into grids and pick out coordinators, Then, merge grids Finally, move robust sensors based on two methods Methods Fig. 4 The figure of the barrier after construction Fig. 5 Robust sensors move to repair the hole Fig. 6 Grid division and coordinator selection Fig. 7 Grid merging and coordinator reselection Fig. 8 Move robust sensors to the regular sensors’ places in the original barrier Fig. 9 Move robust sensors to the positions on the straight line between two edge noeds Results Fig. 10 The number of moved robust sensors under different densities of robust sensors Fig. 11 The total moving distance of robust sensors under different densities of robust sensors Fig. 11 The barrier’s life time under densities of robust sensors Evaluation Setup The regular sensors’ density ρ g is 0.01 in a 10000m ✕ 10m long-belt area. The density of regular sensors is 0.01 while the density of robust sensors is changeable. The sensing and communication ranges are 10m and 20m, respectively. The results are the average of 100 times simulations. Evaluation Results The total moving distance of robust sensor when rain comes once. The lifetime of the barrier.The number of moved robust sensors when rain comes once.