Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.

Slides:



Advertisements
Similar presentations
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
Advertisements

ENERGY-EFFICIENT COMMUNICATIONS PROTOCOL FOR WIRELESS MICROSENSOR NETWORKS W. Heinzelman, A. Chandrakasan, H. Balakrishnan, Published in 2000.
Presented by Rick Skowyra
Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU An Application Specific Protocol Architecture for Wireless Microsensor.
Presentation: Energy Efficient Communication Protocol for Wireless Microsensor Networks Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan.
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Mikhail Nesterenko Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari.
Kyung Tae Kim, Hee Yong Youn (Sungkyunkwan University)
An Application-Specific Protocol Architecture for Wireless Microsensor Networks Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan (MIT)
CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Introduction to Wireless Sensor Networks
Improvement on LEACH Protocol of Wireless Sensor Network
Aeon LEACH An Efficient LEACH protocol in Heterogeneous and Homogenous Wireless Sensor Networks Under Guidance Of: Dr. Mohammad Mozumdar Presented By :
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
Low-Energy Adaptive Clustering Hierarchy An Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks M. Aslam hayat.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
Kai Li, Kien Hua Department of Computer Science University of Central Florida.
LEACH-SC Presented By M. Jaffar Khan
A novel Energy-Efficient and Distance- based Clustering approach for Wireless Sensor Networks M. Mehdi Afsar, Mohammad-H. Tayarani-N.
1 An Energy-Efficient Unequal Clustering Mechanism for Wireless Sensor Networks Chengfa Li, Mao Ye, Guihai Chen State Key Laboratory for Novel Software.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang 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.
APTEEN: A Hybrid Protocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks Arati Manjeshwar, Dharma P. Agrawaly.
Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Fault Tolerant and Mobility Aware Routing Protocol for Mobile Wireless Sensor Network Name : Tahani Abid Aladwani ID :
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
CuMPE : CLUSTER-MANAGEMENT AND POWER EFFICIENT PROTOCOL FOR WIRELESS SENSOR NETWORKS ITRE’05 Information Technology: Research and Education Shen Ben Ho.
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.
Multimedia & Networking Lab
Effect of Redundancy on Mean Time to Failure of Wireless Sensor Networks Anh Phan Speer, Ing-Ray Chen Paper Presented by: Misha, Neha & Vidhya CS 5214.
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,
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
Design of a distributed energy efficient clustering (DEEC) algorithm for heterogeneous wireless sensor networks.
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.
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.
Bandwidth Constrained Energy Efficient Transmission Protocol in Wireless Sensor Networks Jain-Shing LIU and Chun-Hung Richard LIN,Nonmembers IEICE TRANS.
Wireless Sensor Network Protocols Dr. Monir Hossen ECE, KUET Department of Electronics and Communication Engineering, KUET.
Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
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.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Hybrid Indirect Transmissions (HIT) for Data Gathering in Wireless Micro Sensor Networks with Biomedical Applications Jack Culpepper(NASA), Lan Dung, Melody.
Collaborative Broadcasting and Compression in Cluster-based Wireless Sensor Networks Anh Tuan Hoang and Mehul Motani National University of Singapore Wireless.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
MCEEC: MULTI-HOP CENTRALIZED ENERGY EFFICIENT CLUSTERING ROUTING PROTOCOL FOR WSNS N. Javaid, M. Aslam, K. Djouani, Z. A. Khan, T. A. Alghamdi.
Group Members Usman Nazir FA08-BET-179 M.Usman Saeed FA08-BET-173
Routing and Clustering Xing Zheng 01/24/05. References Routing A. Woo, T. Tong, D. Culler, "Taming the Underlying Challenges of Reliable Multihop Routing.
A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks Di Tian, and Nicolas D. Georanas ACM WSNA ‘ 02.
Simulation of DeReClus Yingyue Xu September 6, 2003.
Centralized Transmission Power Scheduling in Wireless Sensor Networks Qin Wang Computer Depart., U. of Science & Technology Beijing Edward Y. Hua Wireless.
“LPCH and UDLPCH: Location-aware Routing Techniques in WSNs”. Y. Khan, N. Javaid, M. J. Khan, Y. Ahmad, M. H. Zubair, S. A. Shah.
A Bit-Map-Assisted Energy- Efficient MAC Scheme for Wireless Sensor Networks Jing Li and Georgios Y. Lazarou Department of Electrical and Computer Engineering,
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)
An Application-Specific Protocol Architecture for Wireless Microsensor Networks 컴퓨터 공학과 오영준.
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
1 Power-efficient Clustering Routing Protocol Based on Applications in Wireless Sensor Network Authors: Tao Liu and Feng Li Form:International Conferecnce.
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
Energy-Efficient Communication Protocol for Wireless Microsensor Networks by Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Presented.
Distributed Energy Efficient Clustering (DEEC) Routing Protocol
Introduction to Wireless Sensor Networks
Net 435: Wireless sensor network (WSN)
Edinburgh Napier University
Presentation transcript:

Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui Cao, Huan Li

Tufts Wireless Laboratory Tufts University School Of Engineering Wireless sensor network is one of the most important cyber physical systems Clustering is an effective technique to improve the energy efficiency and network lifetime. The one-hop transmission from the heads to the data collection center is not scalable. The multi-hop transmission approach may lead to “hot spot” Introduction

Tufts Wireless Laboratory Tufts University School Of Engineering Related Works LEACH is an application-specific data dissemination protocol that proposed to use clustering to save energy and prolong the network lifetime for sensor networks. –LEACH-C –DCHS –HEED –EEUC

Tufts Wireless Laboratory Tufts University School Of Engineering Structuralized Clustering Structure a large scale sensor network with small equal units. The number of clusters are calculated according to the workload of the heads and the distance to the base station. The cluster size should be unequally assigned so that the unit close to the base station should have more clusters. Adopt energy-aware head reelection strategy and relay algorithm for inter-cluster transmission. Demonstrate that the proposed cluster architecture and head selection algorithm have good performance in terms of scalability and energy efficiency.

Tufts Wireless Laboratory Tufts University School Of Engineering Network Model Nodes are uniformly distributed One fixed base station far away from the network center All nodes have the same processing capacities, including CPU, storage and initial energy The power supply of nodes are limited The nodes’ positions in the network are fixed Assume that the whole area is divided by units with equal size, and clusters are constructed within a given unit. All members will report directly to the corresponding cluster head using TDMA schedule under one-hop transmission. For inter-cluster communication, cluster heads forward their data to the head in the neighboring unit, and eventually to the base station.

Tufts Wireless Laboratory Tufts University School Of Engineering Network Model

Tufts Wireless Laboratory Tufts University School Of Engineering Energy Model In sensor nodes, data transmission consumes much more energy than sensing and data processing. Only the energy consumption for data transmission are considered, the overhead introduced by the routing and MAC layer are ignored Energy Model: transmitter dissipates energy to run the radio electronics and the power amplifier, and the receiver dissipates energy to run the radio electronics Assume the intra-cluster communication is running at the distance less than d 0, and the inter-cluster relay distance is larger than d 0

Tufts Wireless Laboratory Tufts University School Of Engineering Energy Model (continues) Where E elec is the electronics energy, ε fs d 2 and ε mp d 4 are the amplifier energy and d 0 is the distant threshold To receive this message: To transmit a k-bit message at distance d:

Tufts Wireless Laboratory Tufts University School Of Engineering Network Partition To achieve even energy depletion and mitigate “hot spot” problem. The units that are closer to the base station should have more clusters Assume that heads do perfect data aggregation in this model, where each head aggregates the received member data to a single packet Assume that head election algorithm and routing algorithm can guarantee each node in the unit will have equal chance to relay data

Tufts Wireless Laboratory Tufts University School Of Engineering Network Partition (continues) Assume there are j units and the number of nodes in the i th unit is n i. For heads in unit_i (1<=i<j), the energy consumed by each head: where C i is the cluster heads number, d i is the inter-cluster transmission distance, and E DA is the cluster head aggregation energy dissipation for each bit.

Tufts Wireless Laboratory Tufts University School Of Engineering Network Partition (continues) The energy consumed by each head in unit_j Each cluster head in the network should have the same energy consumption: Once the cluster member and heads in the first unit or the last unit in the network is given, the heads of clusters in other units can be calculated accordingly.

Tufts Wireless Laboratory Tufts University School Of Engineering Cluster operations Base station could just randomly select the cluster heads for all units at the initial phase Assume the base station will ensure that all nodes will be covered by at least one head Base station will broadcast an initial message containing the number of clusters and the head IDs for each unit in the whole network Cluster set-up phase, data relaying phase, and cluster re-selection phase

Tufts Wireless Laboratory Tufts University School Of Engineering Cluster set-up phase Assumed nodes in different units are able to know their home unit by their own IDs After initial message, head broadcast a message to notify other nodes near around for cluster set-up All nodes except the heads will need to choose joining one of the heads in the unit Use signal strength and the distance as deciding factor

Tufts Wireless Laboratory Tufts University School Of Engineering Data relaying phase The relay node candidates are the set of cluster heads in the next hop, or unit. A head forward its aggregated data to the head that has the largest amount of remaining energy in the next unit. The intrareporting and inter-relay process will last till the remaining energy in one of the heads decreases below a given threshold or till the end of a round

Tufts Wireless Laboratory Tufts University School Of Engineering Cluster head re-selection phase The time interval for each round should last at least till the farthest cluster finishes reporting data to the base station Each node will broadcast its remaining energy in turn Nodes with the highest remaining energy become heads System goes into the cluster set-up phase and continues a new round.

Tufts Wireless Laboratory Tufts University School Of Engineering Simulation Using NS2 Simulate with a rectangle sensing field that is divided into equal units Each unit in the network is a square area with 100 nodes deployed; the size of the unit is 62m*62m The initial energy of each node is 2J d 0 is 87m, E elec is 50nJ/bit ε fs is 10pJ/bit/m2, ε mp is pJ/bit/m 4 E DA is 5nJ/bit/signal Data packet size is 525 bytes (sensing data 500 bytes and the head overhead 25 bytes)

Tufts Wireless Laboratory Tufts University School Of Engineering At the initial stage, when the head aggregation times increases, the network lifetime increases At about 50 – 150, reaches the maximum value Effect of head reelection frequency

Tufts Wireless Laboratory Tufts University School Of Engineering Head number and network lifetime Network is composed of four units and the head aggregation time is set as 50 The network lifetime has the longest value when the head number is about 10% of nodes

Tufts Wireless Laboratory Tufts University School Of Engineering Remaining energy