Overview Overview � Motivation Motivation � Self- Self -Organized Data Organized Data- -Energy Energy- -Aware Clustering Aware Clustering • Self • Self- -Organization Organization and Routing for Wireless Sensor Networks and Routing for Wireless Sensor Networks • Data size as a metric • Data size as a metric � Proposed Clustering and Routing Protocol (DECRO) Proposed Clustering and Routing Protocol (DECRO) � � Evaluation of Evaluation of Proped Proped protocol protocol � Ehssan Ehssan Sakhaee Sakhaee, Naoki , Naoki Wakamiya Wakamiya, Masayuki Murata , Masayuki Murata � Conclusion and Future Work Conclusion and Future Work � Graduate School of Information Science and Technology, Osaka Graduate School of Information Science and Technology, Osaka University, JAPAN University, JAPAN The 2009 International Symposium on Embedded and Pervasive Systems (EPS The 2009 International Symposium on Embedded and Pervasive Syste ms (EPS- -09) 09) In conjunction with the 7th IEEE/IFIP International Conference o In conjunction with the 7th IEEE/IFIP International Conference on Embedded and n Embedded and Ubiquitous Computing (EUC Ubiquitous Computing (EUC- -09) 09) Session B27 - Session B27 - August 30, 2009 August 30, 2009 Vancouver, CANADA Vancouver, CANADA EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 2 Self- Self -organizing systems organizing systems Data Size as a Metric Data Size as a Metric � In In self self- -organizing organizing systems, individual entities react systems, individual entities react Total data size transmitted by � members and clusterhead by following by following common rules common rules based on based on local local Compressed data size environment without any centralized control environment without any centralized control. . • Purely distributed, and no single point of failure! • Transmitted data size by members Purely distributed, and no single point of failure! Data size � In our model: In our model: � • Feedback using exchange of messages Normal node • Feedback using exchange of messages between between Clusterhead neighboring nodes neighboring nodes • • All nodes follow the same rules All nodes follow the same rules EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 3 EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 4 Data Size as a Metric Data Size as a Metric Proposed Protocol Proposed Protocol A self A self- -organizing Data organizing Data- -Energy Energy- -Aware Clustering Aware Clustering Total data size transmitted by � � members and clusterhead and Routing (DECRO) protocol for Wireless Sensor and Routing (DECRO) protocol for Wireless Sensor Compressed data size Networks ( Networks (WSNs WSNs) ) Transmitted data size by members 1. 1. Performs a distributed cluster formation based on the Performs a distributed cluster formation based on the Data size data size and residual energy of nodes. data size and residual energy of nodes. + Normal node Clusterhead 2. 2. Clusters at the edge of network perform initial routing Clusters at the edge of network perform initial routing of data, intermediate clusters towards the sink further of data, intermediate clusters towards the sink further aggregate and forward data towards the sink. aggregate and forward data towards the sink. sink edge of network 3. 3. Application: Suitable for quasi Application: Suitable for quasi- -concurrent reporting of concurrent reporting of all sensor data towards the sink. all sensor data towards the sink. EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 5 EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 6 1
DECRO Mechanism Flowchart of DECRO DECRO Mechanism Flowchart of DECRO Broadcast HoTSIM Wait t w Lower Neighboring Cluster (LNC) Calculate cost Become CH Set backoff timer Send CHC t c , t c(max) Highest Cluster (HC) 1 1 1 1 1 1 2 2 Wait sink Intermediate clusters 1 1 3 3 CH? until t c(max) 1 1 1 1 0 0 0 YES NO YES 2. Cluster Formation Phase await for data from t c expired? expires 2 2 3 3 3 1 1 1 3 1 1 1 1 1 higher clusters for further 4 4 NO 1 1 1 3 3 aggregation. 1 1 1 Listen 4 4 5 5 4 4 Wait t r expired? for CMD until t c(max) 4 4 5 5 5 5 expires 5 5 6 5 Unicast 4 4 5 5 YES 4. Routing Phase 4 5 5 5 Become NAD HC? 1. Hopcount-to-Sink 6 6 CM/GW Sleep 6 6 Lowest HoTS, Initialization Phase 5 6 YES 6 6 highest energy GW Unicast Cost i = e max – e i + (u i + u t )d -1 agg E T + u t E R NO E ic = e i – e iCMD - u i E T CMD to t hnc expired? NO best CH 3. Data Gathering Phase NO Listen AGW? Sleep for NAD YES EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 7 EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 8 Evaluation of DECRO Evaluation of DECRO Emerging Network Emerging Network � Parameter Setup Parameter Setup � sink • 10,000 nodes uniformly distributed • 10,000 nodes uniformly distributed • • Simulation area 500 m by 500 m Simulation area 500 m by 500 m • • 500nJ/bit for transmitter and receiver circuitry 500nJ/bit for transmitter and receiver circuitry • 100pJ/bit/m • 100pJ/bit/m 2 2 transmitter amplifier transmitter amplifier • Nodes have variable data sizes of up to 8000 bits. • Nodes have variable data sizes of up to 8000 bits. EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 9 EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 10 Total Network Energy with Varying Data Aggregation Total Network Energy with Varying Data Aggregation Average number of GW and non Average number of GW and non- -GW members formed GW members formed Efficiency Efficiency per cluster with varying transmission range. per cluster with varying transmission range. EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 11 EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 12 2
Relative energy consumption of CHs, Relative energy consumption of CHs, GWs GWs, and non , and non- - Total energy consumed vs Total energy consumed vs number of reports for number of reports for GWs. GWs . HEED HEED- -ER and DECRO with varying aggregation ER and DECRO with varying aggregation 35.00 HEED-ER(0%) DECRO(0%) total energy consumed by network(kJ) 30.00 HEED-ER(50%) DECRO(50%) 25.00 HEED-ER(90%) DECRO(90%) 20.00 15.00 10.00 5.00 0.00 1 2 3 4 5 6 7 8 9 10 no. of reports EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 13 EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 14 Conclusion and Future Work Conclusion and Future Work � Introduced DECRO, a self Introduced DECRO, a self- -organized clustering organized clustering � consisting of several phases. consisting of several phases. � Suitable for quasi Suitable for quasi- -concurrent reporting of sensors concurrent reporting of sensors’ ’ � data to the sink. data to the sink. � Simulation results show the effectiveness of DECRO Simulation results show the effectiveness of DECRO � Thank You. in efficiently gathering and reporting data to the sink. in efficiently gathering and reporting data to the sink. � Future work should investigate the effects of various Future work should investigate the effects of various � MAC MAC- -protocol implementations on the system. protocol implementations on the system. EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 15 EPS 2009 Self-Organized Data-Energy-Aware Clustering and Routing for Wireless Sensor Networks 16 3
Recommend
More recommend
