Energy-Aware Target Localization in Wireless Sensor Networks Yi Zou and Krishnendu Chakrabarty IEEE (PerCom’03) Speaker: Hsu-Jui Chang.

Slides:



Advertisements
Similar presentations
A Data Dissemination Method for Supporting Mobile Sinks in Hierarchical Routing Protocol of WSN APAN 2008 Jieun Cho 4, August,
Advertisements

Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
1 Sensor Deployment and Target Localization Based on Virtual Forces Y. Zou and K. Chakrabarty IEEE Infocom 2003 Conference, pp ,. ACM Transactions.
An Energy-Efficient Communication Scheme in Wireless Cable Sensor Networks Xiao Chen Neil C. Rowe epartment of Computer Science Department of Computer Science.
An Application-Specific Protocol Architecture for Wireless Microsensor Networks Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan (MIT)
Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.
A novel Energy-Efficient and Distance- based Clustering approach for Wireless Sensor Networks M. Mehdi Afsar, Mohammad-H. Tayarani-N.
Broadcasting Protocol for an Amorphous Computer Lukáš Petrů MFF UK, Prague Jiří Wiedermann ICS AS CR.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
Deployment Strategies for Differentiated Detection in Wireless Sensor Network Jingbin Zhang, Ting Yan, and Sang H. Son University of Virginia From SECON.
Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
Layered Diffusion based Coverage Control in Wireless Sensor Networks Wang, Bang; Fu, Cheng; Lim, Hock Beng; Local Computer Networks, LCN nd.
APTEEN: A Hybrid Protocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks Arati Manjeshwar, Dharma P. Agrawaly.
1 Sensor Placement and Lifetime of Wireless Sensor Networks: Theory and Performance Analysis Ekta Jain and Qilian Liang, Department of Electrical Engineering,
An Energy-efficient Target Tracking Algorithm in Wireless Sensor Networks Wang Duoqiang, Lv Mingke, Qin Qi School of Computer Science and technology Huazhong.
CuMPE : CLUSTER-MANAGEMENT AND POWER EFFICIENT PROTOCOL FOR WIRELESS SENSOR NETWORKS ITRE’05 Information Technology: Research and Education Shen Ben Ho.
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.
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
A Framework for Energy- Saving Data Gathering Using Two-Phase Clustering in Wireless Sensor Networks Wook Chio, Prateek Shah, and Sajal K. Das Center for.
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,
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Preserving Area Coverage in Wireless Sensor Networks by using Surface Coverage Relay Dominating Sets Jean Carle, Antoine Gallais and David Simplot-Ryl.
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.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
P-Percent Coverage Schedule in Wireless Sensor Networks Shan Gao, Xiaoming Wang, Yingshu Li Georgia State University and Shaanxi Normal University IEEE.
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
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.
An Energy-Aware Periodical Data Gathering Protocol Using Deterministic Clustering in Wireless Sensor Networks (WSN) Mohammad Rajiullah & Shigeru Shimamoto.
An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks Min Qin and Roger Zimmermann Computer Science Department, Integrated Media Systems.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Chinh T. Vu, Yingshu Li Computer Science Department Georgia State University IEEE percom 2009 Delaunay-triangulation based complete coverage in wireless.
Coverage and Energy Tradeoff in Density Control on Sensor Networks Yi Shang and Hongchi Shi University of Missouri-Columbia ICPADS’05.
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.
A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks Di Tian, and Nicolas D. Georanas ACM WSNA ‘ 02.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Decentralized Energy-Conserving and Coverage-Preserving Protocols for Wireless Sensor Networks Chi-Fu Huang, Li-Chu Lo, Yu-Chee Tseng, and Wen-Tsuen Chen.
SenSys 2003 Differentiated Surveillance for Sensor Networks Ting Yan Tian He John A. Stankovic Department of Computer Science, University of Virginia November.
GholamHossein Ekbatanifard, Reza Monsefi, Mohammad H. Yaghmaee M., Seyed Amin Hosseini S. ELSEVIER Computer Networks 2012 Queen-MAC: A quorum-based energy-efficient.
Saran Jenjaturong, Chalermek Intanagonwiwat Department of Computer Engineering Chulalongkorn University Bangkok, Thailand IEEE CROWNCOM 2008 acceptance.
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.
I-Hsin Liu1 Event-to-Sink Directed Clustering in Wireless Sensor Networks Alper Bereketli and Ozgur B. Akan Department of Electrical and Electronics Engineering.
Strong Barrier Coverage of Wireless Sensor Networks Benyuan Liu, Olivier Dousse, Jie Wang and Anwar Saipulla University of Massachusetts Lowell and Deutsche.
Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.
EASE: An Energy-Efficient In-Network Storage Scheme for Object Tracking in Sensor Networks Jianliang Xu Department of Computer Science Hong Kong Baptist.
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.
Deploying Sensors for Maximum Coverage in Sensor Network Ruay-Shiung Chang Shuo-Hung Wang National Dong Hwa University IEEE International Wireless Communications.
KAIS T Sensor Deployment Based on Virtual Forces Reference: Yi Zou and Krishnendu Chakarabarty, “Sensor Deployment and Target Localization Based on Virtual.
Repairing Sensor Network Using Mobile Robots Y. Mei, C. Xian, S. Das, Y. C. Hu and Y. H. Lu Purdue University, West Lafayette ICDCS 2006 Speaker : Shih-Yun.
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.
1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.
Straight Line Routing for Wireless Sensor Networks Cheng-Fu Chou, Jia-Jang Su, and Chao-Yu Chen Computer Science and Information Engineering Dept., National.
Salah A. Aly ,Moustafa Youssef, Hager S. Darwish ,Mahmoud Zidan
Distributed Energy Efficient Clustering (DEEC) Routing Protocol
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,
Hongchao Zhou, Fei Liu, Xiaohong Guan
Presentation transcript:

Energy-Aware Target Localization in Wireless Sensor Networks Yi Zou and Krishnendu Chakrabarty IEEE (PerCom’03) Speaker: Hsu-Jui Chang

Outline Introduction Preliminaries Target Location Procedure Simulation Conclusion

Introduction Energy is a critical resource in wireless sensor networks System lifetime needs to be prolonged through the use of energy-conscious sensing strategies

Introduction -Goal Reduces  Energy consumption  Communication bandwidth requirements Prolongs the lifetime of the wireless sensor network

Preliminaries -Assumption All nodes  Communicate with the cluster after initial deployment  Assumed to be homogeneous Cluster head  Knows the location of the sensors  Has more computation power

Preliminaries -Assumption The time for sending or receiving data is assumed to be the same The distance from the different nodes to the cluster head is ignored in the discussion on energy consumption The energy consumption for sensing is the same to each sensor node

Preliminaries -Sensor Detection Model Converts the physical sensing signals to probability-based values Evaluating the confidence level about the data collected by the sensor

Preliminaries -Sensor Detection Model r rere rere C xy (S i ) = 0 C xy (S i ) = e -λa β C xy (S i ) = 1 c xy (s i ): the coverage of the grid point P at (x,y) by sensor s i r: detection range r e : a measure of the uncertainty in sensor detection

Preliminaries -Energy Consumption Model Energy consumption  ψ s : sensing (J/s)  ψ t : transmitting (J/s)  ψ r : receiving (J/s)  E c : the energy for sensing activities  E c : sensor node for communication with the cluster head  E b : broadcasting data from the cluster head

Preliminaries -Energy Consumption Model K(t): the number of sensors involved in communication at the time instant t T s : the time duration that a sensor node is involved in sensing T: the time require for either retrieving data from a sensor node or the broadcasting of data from cluster head

Preliminaries -Sensor Detection Model T can be on of three values  T d : raw target data  T e : target event reporting  T q : query data T e ≦ T q << T d

Target Localization Procedure -Detection Probability Table S xy : a set of sensors can cover a grid point P(x,y)  |S xy | = k xy p xy (s j,i)  s j detects a target at P(x,y); p xy (s j,i) = c xy (s j )  otherwise p xy (s j,i) = 1-c xy (s j )

Target Localization Procedure -Detection Probability Table

Target Localization Procedure –Score-based Ranking i(t):  The index of p_table xy at time t  Calculated from S xy and S rep,xy

Δk rep,xy (t)  Measures the degree of difference in the set of sensors that reported and those sensors that can detect point P(x,y) at time instant t S rep,xy (t):  the set of sensors Can detect a target at point P(x,y) Have reported the detection of an object at time t Target Localization Procedure –Score-based Ranking

Target Localization Procedure –Selection of Sensors to Query S q (t): a set of the sensors selected by the cluster head for querying at time t P MS : the set of grid points with the highest scores

Target Localization Procedure –Selection of Sensors to Query

Target Localization Procedure –Procedural Description

Target Localization Procedure

Simulation Using MatLab 30 by 30 sensor field grid 20 sensors randomly replaced r=5, r e =4,λ=0.5, β=0.5 ψ r =400nJ/s, ψ t =400nJ/s, ψ s =1000nJ/s T d =100ms, T e =2ms, T q =4ms

Simulation

Conclusion Described an energy-aware target localization procedure The approach is based on the combination of  Two-step communication protocol between the cluster head and the sensors in the cluster  Probability localization algorithm