On the Lifetime of Wireless Sensor Networks

Slides:



Advertisements
Similar presentations
Directed Diffusion for Wireless Sensor Networking
Advertisements

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.
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
1 Routing Techniques in Wireless Sensor networks: A Survey.
PEDS September 18, 2006 Power Efficient System for Sensor Networks1 S. Coleri, A. Puri and P. Varaiya UC Berkeley Eighth IEEE International Symposium on.
1-1 Topology Control. 1-2 What’s topology control?
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Topology Control.
Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid
Energy Saving In Sensor Network Using Specialized Nodes Shahab Salehi EE 695.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.
WSN Done By: 3bdulRa7man Al7arthi Mo7mad AlHudaib Moh7amad Ba7emed Wireless Sensors Network.
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Multi-Resolution Spatial and Temporal Coding in a Wireless Sensor Network for Long-Term Monitoring Applications You-Chiun Wang, Member, IEEE, Yao-Yu Hsieh,
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
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.
Authors: N. Javaid, M. Aslam, K. Djouani, Z. A. Khan, T. A. Alghamdi
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Wireless sensor and actor networks: research challenges
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
Ben Miller.   A distributed algorithm is a type of parallel algorithm  They are designed to run on multiple interconnected processors  Separate parts.
Distributed Algorithms for Dynamic Coverage in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver.
Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.
Abstract 1/2 Wireless Sensor Networks (WSNs) having limited power resource report sensed data to the Base Station (BS) that requires high energy usage.
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)
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
Wireless Sensor Network: A Promising Approach for Distributed Sensing Tasks.
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
Mingze Zhang, Mun Choon Chan and A. L. Ananda School of Computing
Medium Access Control. MAC layer covers three functional areas: reliable data delivery access control security.
In the name of God.
Wireless Sensor Networks
Wireless Sensor Networks
Prof. Yu-Chee Tseng Department of Computer Science
Xin Liu Department of Computer Science Univ. of California, Davis
Enabling QoS Multipath Routing Protocol for Wireless Sensor Networks
Abstract In this paper, the k-coverage problem is formulated as a decision problem, whose goal is to determine whether every point in the service area.
Overview of Wireless Networks:
Threshold sensitive Energy Efficient sensor Network (TEEN)
Ioana Apetroaei Ionuţ-Alexandru Oprea Bogdan-Eugen Proca
Introduction to Wireless Sensor Networks
Wireless Sensor Network (WSN)
Data Collection and Dissemination
Wireless Sensor Network Architectures
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
Lifetime Elongation in Wireless Sensor Networks Using Heterogeneity
Net 435: Wireless sensor network (WSN)
Bluetooth Based Smart Sensor Network
SEP routing protocol in WSN
Wei Li, Flávia C. Delicato Paulo F. Pires, Young Choon Lee
A Survey on Routing Protocols for Wireless Sensor Networks
Coverage and Connectivity in Sensor Networks
Data Collection and Dissemination
Barrier Coverage with Optimized Quality for Wireless Sensor Networks
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,
Detecting Denial-of-Service Attacks against Sensor Networks
Requirements Definition
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.
Simulation for Data collection and uploading in IoT island
Overview: Chapter 4 Infrastructure Establishment
Distributed Minimum-Cost Clustering for Underwater Sensor Networks
Presentation transcript:

On the Lifetime of Wireless Sensor Networks Isabel Dietrich Falko Dressler ACM Transaction on Sensor Networks, 2009 Presented by Group 6 Tianyi Pan

Why Limited Lifetime for WSNs? Various application domains Wildlife monitoring Precision agriculture Logistics applications Environmental conditions

Outline of the Paper Analysis of existing lifetime definitions Overview of the parameters influencing network lifetime Concise redefinition of network lifetime Application of the definition

Existing Lifetime Definitions Based on the number of alive nodes. Based on sensor coverage. Based on connectivity. Based on application quality of services requirements Based on combined measures

Lifetime Based on the Number of Alive Nodes n-of-n lifetime 𝑇 𝑛 𝑛 = min 𝑣∈𝑉 𝑇 𝑣 Normally too short and neglects redundancy Not capable with hardware failures k-of-n lifetime 𝑇 𝑛 𝑘 : at least k out of n nodes are alive Cannot cope with critical nodes m-in-k-of-n: at least k out of n nodes alive and none of the m critical nodes fail The time till the first cluster head fail Require static clusters, which is unrealistic Time till all nodes fail Too optimistic

Lifetime Based on Sensor Coverage Time till certain coverage requirement cannot be met Area/volume coverage Target coverage Barrier coverage Detect all trespassing activities in a region 𝛼-coverage Only 𝛼 percent of the region of interest must be covered (by at least 1 sensor) k-coverage Each point of interest in the region must be covered by at least k sensors.

Lifetime Based on Connectivity The minimum time that the size of the largest connected component drops to a certain size. The minimum time that the percentage of nodes having paths to the sink drops to a certain value. Total number of packets transmitted to the sink. Dependent on algorithms (variation in # packets) Cannot clearly indicate the lifetime Number of successful data gathering trips

Lifetime Based on Application Quality of Services Requirements The time period during which the WSN continuously satisfies the application requirement Too abstract, application characteristics unspecified The time until the network no longer provides an acceptable event detection ratio A specific application requirement yet still vague

Lifetime Based on Combined Measures Coverage & Connectivity The time when either drops below a threshold Cardinality of the largest connected component, number of alive nodes, 𝛼-coverage The time when any of the three is unsatisfied Share the issues with single aspect Can omit some aspects

Overview of the Parameters Node mobility and topology changes Heterogeneity Application characteristics Quality of service

Node Mobility and Topology Changes Mobility happens in all WSNs Node failure in static WSN (similar to mobility) Sensors moved by external forces Mobility can complicate analysis of lifetime Connection can be lost and then recover System “die” and resurrect Mobility can improve sensor coverage Act as relay Mobile sinks

Heterogeneity Varying battery power and power consumption Cluster head may have much larger energy reservoir Some nodes may need to send more data Some location may need to be covered by different types of sensor Transmission ranges can vary Different mobility patterns

Application Characteristics Sensors carry different tasks of an application Need to work in synergy Destination for data packets can affect communication patterns (with multiple sinks) Node activity level Activity can be triggered by: Events Regular time intervals Other nodes

Quality of Service Coverage Event detection ratio Exposure Connectivity (availability, latency, loss) Requirements on continuous service Observation accuracy Main QoS parameters for WSNs

The Concise Definition of Lifetime Basic notations Set of sensor types Y Set of all sensor nodes 𝑆 𝑌 , 𝑆 𝑌 =𝑛 Set of alive nodes Set of active nodes Set of active nodes (relaxed) Set of sink nodes 𝐵 𝑡 ⊂ 𝑆 𝑌

Basic Notations Communication graph 𝐺 𝑡 =(𝑉 𝑡 ,𝐸(𝑡)) Ability of two nodes to communicate in the time interval [𝑡−Δ𝑡,𝑡] Set of target points Sensing area for type 𝑦

Relax the Hard Constraints Graceful degradation Quality drops when hit a soft limit, before hitting the hard limit No “sudden death” 𝜁≥1 means perfect fulfilment 𝜁<0 means no fulfilment In between indicates the service level Time-integrated criteria Requirement can be fulfilled (at least once) within time intervals, not at every time point.

The Criteria Alive nodes: the portion of alive nodes in all existing nodes 𝜓 𝑙𝑛 𝑡 = 𝑢 𝑡 𝑛 Latency: the portion of packets having shorter delay that pre-specified max latency 𝑙 Delivery ratio: portion of packets received correctly

The Criteria Connectivity Indicator for node 𝑣 having connection to any active sink node in 𝐵(𝑡) The portion of active nodes having a connection to a sink

The Criteria Area coverage: fraction of region covered by type-y sensors Target coverage: fraction of targets covered by type-y sensors 𝒌-coverage: single read may be inaccurate

The Criteria Barrier coverage Detect and track all intruder in the region Sensor must cover all possible paths the intruder may take

The Criteria Connected coverage Required in need of transmitting the data of any point of interest to a sink at any time Coverage only possible via the sensor nodes that are connected to a sink

Network Lifetime System up/down times Service disruption Each working interval Accumulated network lifetime 𝒁 𝒂 = 𝒊=𝟎 𝒆 𝒕 𝒊 𝒂 Total network lifetime 𝒁 𝒕 = 𝒕 𝒆 Allowed disruption

Mapping of Existing Definitions

Mapping of Applications

Mapping of Applications Habitat monitoring Sensors need to have connectivity to the sink at least once per time interval (a day) Allow outages for some time (a day) Not critical, not coverage

Mapping of Applications Intrusion detection Connected barrier coverage Short delay and limited packet loss No service disruption Critical and coverage

Mapping of Applications Smart buildings Intermittent coverage of the whole area Send data to sink once every time interval Short disruption allowed Coverage, not critical

Mapping of Applications Human physiological data Need continuous connection to the sink Short delay and limited packet loss’ No service disruption Critical but not coverage

Questions?