On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,

Slides:

Advertisements

Similar presentations

The Selective Intermediate Nodes Scheme for Ad Hoc On-Demand Routing Protocols Yunjung Yi, Mario gerla and Taek Jin Kwon ICC 2002.

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.

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.

Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU An Application Specific Protocol Architecture for Wireless Microsensor.

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.

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

Improvement on LEACH Protocol of Wireless Sensor Network

Low-Energy Adaptive Clustering Hierarchy An Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks M. Aslam hayat.

1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.

NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.

Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.

Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.

Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.

CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.

Vikramaditya. What is a Sensor Network?  Sensor networks mainly constitute of inexpensive sensors densely deployed for data collection from the field.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

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

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.

A Distributed Framework for Correlated Data Gathering in Sensor Networks Kevin Yuen, Ben Liang, Baochun Li IEEE Transactions on Vehicular Technology 2008.

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.

On Energy-Efficient Trap Coverage in Wireless Sensor Networks Junkun Li, Jiming Chen, Shibo He, Tian He, Yu Gu, Youxian Sun Zhejiang University, China.

Distributed Monitoring and Aggregation in Wireless Sensor Networks INFOCOM 2010 Changlei Liu and Guohong Cao Speaker: Wun-Cheng Li.

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.

A Low-Latency and Energy-Efficient Algorithm for Convergecast in Wireless Sensor Networks Authors Sarma Upadhyayula, Valliappan Annamalai, Sandeep Gupta.

An Energy-Aware Periodical Data Gathering Protocol Using Deterministic Clustering in Wireless Sensor Networks (WSN) Mohammad Rajiullah & Shigeru Shimamoto.

SIMPLE: Stable Increased Throughput Multi-hop Link Efficient Protocol For WBANs Qaisar Nadeem Department of Electrical Engineering Comsats Institute of.

Bounded relay hop mobile data gathering in wireless sensor networks

A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.

MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,

Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.

1 ICC 2013, 9-13 June, Budapest, Hungary Localization packet scheduling for an underwater acoustic sensor network By Hamid Ramezani & Geert Leus.

Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.

KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.

Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +

Modeling End-to-end Distance for Given Number of Hops in Dense Planar Wireless Sensor Networks April Chan-Myung Kim

Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,

ICIIS Peradeniya, Sri Lanka1 An Enhanced Top-Down Cluster and Cluster Tree Formation Algorithm for Wireless Sensor Networks H. M. N. Dilum Bandara,

2016/2/19 H igh- S peed N etworking L ab. Using Soft-line Recursive Response to Improve Query Aggregation in Wireless Sensor Networks High-Speed Networking.

FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.

GholamHossein Ekbatanifard, Reza Monseﬁ, Mohammad H. Yaghmaee M., Seyed Amin Hosseini S. ELSEVIER Computer Networks 2012 Queen-MAC: A quorum-based energy-efﬁcient.

“LPCH and UDLPCH: Location-aware Routing Techniques in WSNs”. Y. Khan, N. Javaid, M. J. Khan, Y. Ahmad, M. H. Zubair, S. A. Shah.

Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.

Selection and Navigation of Mobile Sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.

Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime Z. Maria Wang, Emanuel Melachrinoudis Department of Mechanical and Industrial Engineering.

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)

Load-Balanced Clustering in Wireless Sensor Networks Gaurav Gupta and Mohamed Younis IEEE International Conference on Communications, (ICC 2003)

Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.

Minimum Power Configuration in Wireless Sensor Networks Guoliang Xing*, Chenyang Lu*, Ying Zhang**, Qingfeng Huang**, and Robert Pless* *Washington University.

An Efficient Real-Time Routing with Presence of Concave Voids in Wireless Sensor Networks Mohamed Aissani Abdelhamid Mellouk, Nadjib Badache, and Brahim.

Wireless Networks Projects Roberto Riggio, PhD CREATE-NET Via Alla Cascata 56/c 38123, Povo (TN)

MAC Protocols for Sensor Networks

Computing and Compressive Sensing in Wireless Sensor Networks

Lifetime Elongation in Wireless Sensor Networks Using Heterogeneity

Distributed Energy Efficient Clustering (DEEC) Routing Protocol

Net 435: Wireless sensor network (WSN)

Seema Bandyopadhyay and Edward J. Coyle

Padmalaya Nayak, and Bhavani Vathasava

Leach routing protocol in WSN

Leach routing protocol in WSN

ADVISOR : Professor Yeong-Sung Lin STUDENT : Hung-Shi Wang

Speaker : Lee Heon-Jong

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.

Distributed Minimum-Cost Clustering for Underwater Sensor Networks

Edinburgh Napier University

Presentation transcript:

On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE, Fu-Jen Catholic University Adviser: Jonathan C. Lu, Ph.D. Speaker: Yen-Fong Wang

Outline Abstract Introduction Related work Optimal placement of cluster-heads (OPC) algorithm Simulation results Conclusion Reference

I. Abstract In wireless sensor network, the network lifetime is an important issue when the size of the network is large The cluster-heads near the sink get overloaded and drained out sooner Formulate an optimization problem and find the optimum number of cluster-heads to be deployed and their optimum transmission ranges

Outline Abstract Introduction Related work Optimal placement of cluster-heads (OPC) algorithm Simulation results Conclusion Reference

II. Introduction There are two basic network architectures in WSN Multi-hop Cluster-heads Multi-hop: The sensor nodes are homogeneous and they transmit data packets via intermediate sensor nodes in a multi-hop fashion to the sink Cluster heads: The whole area is divided into a number of cluster regions Cluster-heads reduce the number of transmissions by aggregating the sensed information thereby minimizing the energy dissipation in the network

Outline Abstract Introduction Related work Optimal placement of cluster-heads (OPC) algorithm Simulation results Conclusion Reference

III. Related work The lifetime of the sensor nodes is balanced by varying the radio’s transmission range Sensor nodes reach the cluster-head station using Single-hop mode Multi-hop mode Hybrid communication mode The cluster-heads Gather the sensed information from sensor nodes Perform the required computation Have long transmission range than that of the sensor nodes

Outline Abstract Introduction Related work Optimal placement of cluster-heads (OPC) algorithm Simulation results Conclusion Reference

IV. OPC Algorithm Places additional cluster-heads near the sink to handle the high load Provides the optimum density and radio transmission range for the cluster-heads in order to achieve the maximum network lifetime with the minimum network cost Network model The network is divided into number of clusters Cluster-heads transmit packets to the data sink in a multi-hop path via other cluster-heads Sensor nodes communicate with their cluster-heads either in a single or multi-hop path

IV. Cluster architecture in wireless sensor network

IV. OPC Algorithm Relationship between node density and transmission range Optimum number of cluster-heads problem is non linear integer programming problem (NLP)

IV. OPC Algorithm Varying dense placement algorithm The cluster-heads near the sink will run out of power sooner and reduce the network lifetime Minimum number of cluster-heads required : the minimum number of cluster-heads required r : the transmission range for cluster-heads

IV. Varying dense placement of cluster-heads 1 2 3 4 5 6

IV. OPC Algorithm Cluster-heads can reduce the transmission range, in order to save energy

IV. OPC Algorithm The hop distance between the sink and the border cluster- heads is N, where The objective is to minimize the network cost is K: the number of packets transmitted by a cluster-heads after collecting the data from sensor nodes

Outline Abstract Introduction Related work Optimal placement of cluster-heads (OPC) algorithm Simulation results Conclusion Reference

V. Simulation results Use GloMoSim simulator to simulate the results Compared uniform dense placement (UDP), varying dense placement (VDP) and OPC algorithms in the network lifetime, collisions and latency Simulation parameters Network size (Terrain radius): 1000 – 2000 meters Bandwidth: 48 kbps Packet size 512 bytes Transmission range (UDP/VDP): 200 meters Transmission range (OPC): 80-200 meters MAC protocol: IEEE 8.2.11 DCF

V. Network lifetime for different network sizes

V. Effect of varying traffic on collisions

V. Effect of varying traffic on latency

Outline Abstract Introduction Related work Optimal placement of cluster-heads (OPC) algorithm Simulation results Conclusion Reference

VI. Conclusion The optimum number if cluster-heads required and their respective transmission ranges This paper’s algorithm achieves the maximum network lifetime with the minimum network cost and less number of collisions

Outline Abstract Introduction Related work Optimal placement of cluster-heads (OPC) algorithm Simulation results Conclusion Reference

VII. Reference On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks Dhanaraj, M.; Siva Ram Murthy, C.; IEEE International Conference on Communications, 2007. ICC `07. 24-28 June 2007