Layered Diffusion based Coverage Control in Wireless Sensor Networks Wang, Bang; Fu, Cheng; Lim, Hock Beng; Local Computer Networks, 2007. LCN 2007. 32nd.

Slides:



Advertisements
Similar presentations
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
Advertisements

Dynamic Object Tracking in Wireless Sensor Networks Tzung-Shi Chen 1, Wen-Hwa Liao 2, Ming-De Huang 3, and Hua-Wen Tsai 4 1 National University of Tainan,
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU An Application Specific Protocol Architecture for Wireless Microsensor.
Kyung Tae Kim, Hee Yong Youn (Sungkyunkwan University)
Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl.
S-MAC Sensor Medium Access Control Protocol An Energy Efficient MAC protocol for Wireless Sensor Networks.
Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.
Using Auxiliary Sensors for Pair-Wise Key Establishment in WSN Source: Lecture Notes in Computer Science (2010) Authors: Qi Dong and Donggang Liu Presenter:
1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.
Investigating Mac Power Consumption in Wireless Sensor Network
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks Zhihui Chen; Ashfaq Khokhar ECE/CS Dept., University of.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid
Authors: Joaquim Azevedo, Filipe Santos, Maurício Rodrigues, and Luís Aguiar Form : IET Wireless Sensor Systems Speaker: Hao-Wei Lu sleeping zigbee networks.
Energy Saving In Sensor Network Using Specialized Nodes Shahab Salehi EE 695.
Tree-Based Double-Covered Broadcast for Wireless Ad Hoc Networks Weisheng Si, Roksana Boreli Anirban Mahanti, Albert Zomaya.
By : Himali Saxena. Outline Introduction DE-MAC Protocol Simulation Environment & Results Conclusion.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
TRUST, Spring Conference, April 2-3, 2008 Taking Advantage of Data Correlation to Control the Topology of Wireless Sensor Networks Sergio Bermudez and.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
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,
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
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.
Presented by Fei Huang Virginia Tech April 4, 2007.
WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
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.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
Trade-offs Between Mobility and Density for Coverage in Wireless Sensor Networks Wei Wang, Vikram Srinivasan and Kee-Chaing Chua National University of.
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.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up for Wireless Sensor Networks Zhihui Chen and Ashfaq Khokhar ECE Department, University.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Computer Network Lab. Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks SenSys ’ 03 Xiaorui Wang, Guoliang Xing, Yuanfang.
A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and.
Ching-Ju Lin Institute of Networking and Multimedia NTU
An Energy-Efficient MAC Protocol for Wireless Sensor Networks Speaker: hsiwei Wei Ye, John Heidemann and Deborah Estrin. IEEE INFOCOM 2002 Page
KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.
A Reliability-oriented Transmission Service in Wireless Sensor Networks Yunhuai Liu, Yanmin Zhu and Lionel Ni Computer Science and Engineering Hong Kong.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Adaptive Power Control Algorithm for Ad Hoc Networks with Short and Long Term Packet Correlations Jun Zhang, Zuyuan Fang, and Brahim Bensaou Dept. of Computer.
Prolonging the Lifetime of Wireless Sensor Networks via Unequal Clustering Stanislava Soro Wendi B. Heinzelman University of Rochester IPDPS 2005.
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.
Critical Area Attention in Traffic Aware Dynamic Node Scheduling for Low Power Sensor Network Proceeding of the 2005 IEEE Wireless Communications and Networking.
Jinfang Jiang, Guangjie Han, Lei Shu, Han-Chieh Chao, Shojiro Nishio
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks Arijit Ghosh and Tony Givargis Center for Embedded.
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)
Energy-Aware Target Localization in Wireless Sensor Networks Yi Zou and Krishnendu Chakrabarty IEEE (PerCom’03) Speaker: Hsu-Jui Chang.
Max do Val Machado Raquel A. F. Mini Antonio A. F. Loureiro DCC/UFMG DCC/PUC Minas DCC/UFMG IEEE ICC 2009 proceedings Advisor : Han-Chieh Chao Student.
Mingze Zhang, Mun Choon Chan and A. L. Ananda School of Computing
Distributed Energy Efficient Clustering (DEEC) Routing Protocol
Net 435: Wireless sensor network (WSN)
Wireless Mesh Networks
Investigating Mac Power Consumption in Wireless Sensor Network
Speaker : Lee Heon-Jong
Presentation transcript:

Layered Diffusion based Coverage Control in Wireless Sensor Networks Wang, Bang; Fu, Cheng; Lim, Hock Beng; Local Computer Networks, LCN nd IEEE Conference on Oct Page(s): Digital Object Identifier /LCN Local Computer Networks, LCN nd IEEE Conference on 報告 : 林美佐

Outline  一、 Introduction  二、 System Model and Basic Idea  三、 Layered Diffusion based Coverage Control  四、 Performance Evaluation  五、 Conclusions

一、 Introduction (1/2)  Coverage control is used to select as few active nodes as possible from all deployed sensor nodes such that sufficient coverage of the monitored area can be guaranteed, while reducing the energy consumption of each individual sensor node to prolong the network lifetime.  This paper presents a Layered Diffusion based Coverage Control (LDCC)

一、 Introduction (2/2)  The LDCC protocol does not require information on the node location coordinates when selecting active nodes. Instead, it exploits the hop count information, which is easily obtained in a WSN.  The LDCC protocol is very simple and does not require any sophisticated computation.

二、 System Model and Basic Idea(1/6)  It is to apply a triangular tessellation to cover the sensor field.

二、 System Model and Basic Idea(2/6)  In this paper, an active node (or a node in an active state) is a node with its sensing unit on and a sleep node (or a node in a sleep state) is one with its sensing unit off.  The main objective for coverage control is to select as few active sensor nodes as possible to cover as much of the sensor field as possible at any moment of time.

二、 System Model and Basic Idea(3/6)  Given that all sensor nodes use a fixed transmission power, the hop count measures how many transmissions are needed for a sensor node to deliver its packets to the base station.  If the transmission power is set such that the transmission range Rc equals to the length of each side of the equilateral triangle, then the sensor nodes on the circle with radius Rc are those nodes with hop count H = 1.

二、 System Model and Basic Idea(3/6) H=1

二、 System Model and Basic Idea(4/6)  The process of coverage control normally starts by a sensor node with a small hop count sending out an ACTIVE message to its neighbors upon expiration of its timer.

二、 System Model and Basic Idea(5/6)  For example, suppose that sensor node 1 first sends out an ACTIVE message attached with its hop count information.  After receiving an ACTIVE message, each node either needs to set its state to sleep or needs to reset its timer to a different time period according to its hop count information.  If a sensor node receives two or more ACTIVE messages sent from its neighbors with the same hop count as itself, it can then set itself to sleep.

二、 System Model and Basic Idea(6/6)  To enable the rotation between the sleep and the active state for each sensor node, the ACTIVE message can also attach a time period value stating how long is its active state, which will also be used for a sleep node to set its sleep time period.  Therefore, after some interval, all nodes become active again and the above procedure repeats for selecting the active sensor nodes for the next round.

三、 Layered Diffusion Based Coverage Control (1/9)  Layered diffusion is used to describe a message exchange process in which messages of some particular types are likely to be first generated by the base station or the nodes closest to the base station, and diffused from the nodes in a ring closest to the base station to the nodes in a ring farthest from the base station.  That is, a sensor node with a small hop count ignores the messages sent out by another node with a larger hop count.

三、 Layered Diffusion Based Coverage Control (2/9)  Hop count setup  The hop count information can be obtained by a layered diffusion process starting from the base station which sends out a HOP message to initialize the process.  At the time when sensor nodes are deployed, all nodes set their hop count to a very large value HMax, i.e., Hi = HMax for all i.  The process of the layered diffusion starts when the base station first sends out a HOP message with the hop count set to 0, H 0 = 0.  Each HOP message also contains the information of the transmission power (P r ) used for this message.

三、 Layered Diffusion Based Coverage Control (3/9)

三、 Layered Diffusion Based Coverage Control (4/9)  In an errorfree and collision-free environment, the above process of hop count setup can be performed only once if the transmission power does not need to be changed.  For the rest of this paper, the basic version of the proposed LDCC protocol does not consider transmission error and collision.

三、 Layered Diffusion Based Coverage Control (5/9)  Protocol description  The coverage control process is also carried out in a layered diffusion manner and can be combined with the hop count setup process (by merging the HOP and ACTIVE message into one message).  The advantage of this approach is to reduce the message exchange overhead.  The disadvantage is that the hop count message may not be accurate before the hop count setup process is completely finished, and this might introduce some performance loss.

三、 Layered Diffusion Based Coverage Control (6/9)  The execution of the LDCC protocol is divided into rounds and in each round, the base station initiates the coverage control process by sending out an ACTIVE message.  An ACTIVE message indicates that the sender has set itself to an active state and includes the sender’s hop count (H r ), transmission power (P r ) and active time in this round (T r ).  Each sensor node maintains a boolean variable(B) as a flag to indicate that a new round of coverage control has started. B is initialized to true at the time when the sensor network is deployed.

三、 Layered Diffusion Based Coverage Control (7/9)  Each sensor node also maintains several counters. These counters are initialized to 0. N1: to record the number of ticks passed after a node receives the last ACTIVE message. N2: to record the number of received ACTIVE messages sent from the node with the hop count smaller than its own. N3: to record the number of received ACTIVE messages sent from the node with the same hop count as its own.

三、 Layered Diffusion Based Coverage Control (8/9)

三、 Layered Diffusion Based Coverage Control (9/9)

四、 Performance Evaluation (1/4) The more sensor nodes go to sleep, the less area will be covered.

四、 Performance Evaluation (2/4) The proposed LDCC protocol results in very small message overhead even for very large number of deployed nodes.

四、 Performance Evaluation (3/4)

四、 Performance Evaluation (4/4) The message overhead of LDCC is almost negligible compared with that of PEAS.

五、 Conclusions  The LDCC protocol exploits the hop count information, which is very easy to obtain in a WSN, to select active sensor nodes.  Simulation results show that the LDCC protocol achieves high coverage ratio with the least number of active sensor nodes compared with that of the RIS and PEAS algorithms.  The message overhead of the LDCC is much smaller than that of the PEAS. Furthermore, the message overhead of LDCC is not very sensitive to the node density of the deployed network, and hence very large scale networks can greatly benefit from LDCC.