KAIS T A Bidding Protocol for Deploying Mobile Sensors 발표자 : 권 영 진 Guiling Wang, Guohong Cao, Tom LaPorta The Pennsylvania State University IEEE, ICNP.

Slides:

Advertisements

Similar presentations

1 Review: Mobile Sensor Networks An Overview prepared by Y.C. Wang and Y.C. Tseng.

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,

Coverage by Directional Sensors Jing Ai and Alhussein A. Abouzeid Dept. of Electrical, Computer and Systems Engineering Rensselaer Polytechnic Institute.

Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.

1 Sensor Deployment and Target Localization Based on Virtual Forces Y. Zou and K. Chakrabarty IEEE Infocom 2003 Conference, pp ,. ACM Transactions.

Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.

Guang Tan, Stephen A. Jarvis, and Anne-Marie Kermarrec IEEE Transactions on Mobile Computing, VOL. 8, NO.6, JUNE Yun-Jung Lu.

Movement-Assisted Sensor Deployment Author : Guiling Wang, Guohong Cao, Tom La Porta Presenter : Young-Hwan Kim.

Online Distributed Sensor Selection Daniel Golovin, Matthew Faulkner, Andreas Krause theory and practice collide 1.

산업 및 시스템 공학과 통신시스템 및 인터넷보안연구실 김효원 Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks Wensheng Zhang and Guohong Cao.

Coverage Preserving Redundancy Elimination in Sensor Networks Bogdan Carbunar, Ananth Grama, Jan Vitek Computer Sciences Department Purdue University West.

KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.

1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.

Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks Wei-Peng Chen*, Jennifer C. Hou and Lui Sha Department of Computer Science.

On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.

1 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, Mani Srivastava IEEE TRANSACTIONS ON MOBILE.

A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.

SMART: A Scan-based Movement- Assisted Sensor Deployment Method in Wireless Sensor Networks Jie Wu and Shuhui Yang Department of Computer Science and Engineering.

IEEE TSMCA 2005 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS Presented by 황재호.

1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.

Achieving Minimum Coverage Breach under Bandwidth Constraints in Wireless Sensor Networks Maggie X. Cheng, Lu Ruan and Weili Wu Dept. of Comput. Sci, Missouri.

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

1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.

Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.

1 Sensor Placement and Lifetime of Wireless Sensor Networks: Theory and Performance Analysis Ekta Jain and Qilian Liang, Department of Electrical Engineering,

Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha Presented by Ray Lam Oct 23, 2004.

Direct movement has long relocation time and overuses the redundant sensor Motivation Coverage under random deployment Coverage under clustering All the.

Authors: Sheng-Po Kuo, Yu-Chee Tseng, Fang-Jing Wu, and Chun-Yu Lin

Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.

Dynamic Coverage Enhancement for Object Tracking in Hybrid Sensor Networks Computer Science and Information Engineering Department Fu-Jen Catholic University.

Localization With Mobile Anchor Points in Wireless Sensor Networks

Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.

WMNL Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks Ridha Soua, Leila Saidane, Pascale Minet 2010 IEEE Ninth International.

Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.

Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.

Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.

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

1 A Bidding Protocol for Deploying Mobile Sensors GuilingWang, Guohong Cao, and Tom LaPorta Department of Computer Science & Engineering The Pennsylvania.

ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.

Pei-Ling Chiu Mobile Sensor Networks. Pei-Ling Chiu2 Outline Research Framework Paper: ”Movement-Assisted Sensor Deployment” Related Work Discussion.

Co-Grid: an Efficient Coverage Maintenance Protocol for Distributed Sensor Networks Guoliang Xing; Chenyang Lu; Robert Pless; Joseph A. O ’ Sullivan Department.

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.

P-Percent Coverage Schedule in Wireless Sensor Networks Shan Gao, Xiaoming Wang, Yingshu Li Georgia State University and Shaanxi Normal University IEEE.

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

Neighborhood-Based Topology Recognition in Sensor Networks S.P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann Corby Ziesman.

Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.

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.

1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.

By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.

Decentralized Energy- Conserving and Coverage- Preserving Protocols for Wireless Sensor Networks

Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.

Shibo He 、 Jiming Chen 、 Xu Li 、, Xuemin (Sherman) Shen and Youxian Sun State Key Laboratory of Industrial Control Technology, Zhejiang University, China.

CS 851 Presentation: Differentiated Surveillance for Sensor Network Presented by Liqian Luo Reference: 1. T. Yan, T. He, and J. A. Stankovic, “Differentiated.

A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks Di Tian, and Nicolas D. Georanas ACM WSNA ‘ 02.

Mobile Sensor Deployment for a Dynamic Cluster-based Target Tracking Sensor Network Niaoning Shan and Jindong Tan Department of Electrical and Computter.

On Mitigating the Broadcast Storm Problem with Directional Antennas Sheng-Shih Wang July 14, 2003 Chunyu Hu, Yifei Hong, and Jennifer Hou Dept. of Electrical.

SenSys 2003 Differentiated Surveillance for Sensor Networks Ting Yan Tian He John A. Stankovic Department of Computer Science, University of Virginia November.

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

A Two-Tier Heterogeneous Mobile Ad Hoc Network Architecture and Its Load-Balance Routing Problem C.-F. Huang, H.-W. Lee, and Y.-C. Tseng Department of.

Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.

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

Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.

Energy-Aware Target Localization in Wireless Sensor Networks Yi Zou and Krishnendu Chakrabarty IEEE (PerCom’03) Speaker: Hsu-Jui Chang.

Deploying Sensors for Maximum Coverage in Sensor Network Ruay-Shiung Chang Shuo-Hung Wang National Dong Hwa University IEEE International Wireless Communications.

KAIS T Sensor Deployment Based on Virtual Forces Reference: Yi Zou and Krishnendu Chakarabarty, “Sensor Deployment and Target Localization Based on Virtual.

Repairing Sensor Network Using Mobile Robots Y. Mei, C. Xian, S. Das, Y. C. Hu and Y. H. Lu Purdue University, West Lafayette ICDCS 2006 Speaker ： Shih-Yun.

Coverage and Deployment 1. Coverage Problems Coverage: is a measure of the Quality of Service (QoS) of a sensor network How well can the network observe.

Prof. Yu-Chee Tseng Department of Computer Science

Movement-Assisted Sensor Deployment in WSN

Presentation transcript:

KAIS T A Bidding Protocol for Deploying Mobile Sensors 발표자 : 권 영 진 Guiling Wang, Guohong Cao, Tom LaPorta The Pennsylvania State University IEEE, ICNP 03

Contents Introduction Voronoi diagram Bidding protocol(key concepts, remained issues) Performance evaluations Conclusion 2 / 17 A Bidding Protocol for Deploying Mobile Sensors

Introduction ( 1/2 ) Mobile sensor Problems : How to deploy mobile sensors efficiently? “Three distributed self-deployment protocols” (Movement-Assisted Sensor Deployment, IEEE infocom 04) Use only mobile sensor  Not cost-effective 3 / 17 A Bidding Protocol for Deploying Mobile Sensors

Introduction ( 2/2 ) “Bidding protocol” Key idea : static sensor + mobile sensor Coverage holes : the area that sensor cannot cover Static sensor : detection of coverage holes Mobile sensor : heal of coverage holes 4 / 17 A Bidding Protocol for Deploying Mobile Sensors Sensor circle Coverage holes Static sensor Mobile sensor Hole healing

Terminologies of Voronoi diagram 5 / 17 A Bidding Protocol for Deploying Mobile Sensors Voronoi cell Voronoi diagram

Applying Voronoi diagram to Mobile sensor Put sensor on site points  Each sensor is responsible for the sensing task in Voronoi cells  Each sensor can examine the coverage hole locally 6 / 17 A Bidding Protocol for Deploying Mobile Sensors sensor

Bidding protocol ( key concepts) ( 1/7 ) Important questions How to estimate coverage hole? Which mobile sensor should move to the place? Where should the mobile sensor move? Bid ( for static sensor ) estimated size of hole Base price ( for mobile sensor ) estimate of generated coverage hole after it leaves the current place 7 / 17 A Bidding Protocol for Deploying Mobile Sensors

Bid Estimation( in Static Sensor ) Farthest Voronoi vertex is the target location of mobile sensor Bid is the area of the inner circle 8 / 17 A Bidding Protocol for Deploying Mobile Sensors Bidding protocol ( key concepts) ( 2/7 ) Healing of most largest hole d Bid = π * ( d – sensing_range) 2  relative size of coverage hole

Bidding protocol ( key concepts) ( 3/7 ) Base price evaluation( in mobile sensor ) Initial value is 0 The accepted bid is a new base price Meaning of a bid and a base price 9 / 17 A Bidding Protocol for Deploying Mobile Sensors Bid: estimate of healed hole Base price : estimate of upcoming hole

Bidding protocol ( key concepts) ( 4/7 ) 10 / 17 A Bidding Protocol for Deploying Mobile Sensors Let’s put it all together ! Bidding protocol flows( round by round ) Service advertisement Initialization Serving Bidding Termination Construct Voronoi diagram

Bidding protocol ( key concepts) ( 5/7 ) Service advertisement Mobile sensor broadcasts their base price and location Base price is set to zero initially Bidding Calculate bids and target location for the mobile sensor Send bids to closest mobile sensor whose base price is lower than bids 11 / 17 A Bidding Protocol for Deploying Mobile Sensors

Bidding protocol ( key concepts) ( 6/7 ) Serving Mobile sensor choose the highest bids and heal coverage holes Accepted bids becomes new base price Termination If base price of all mobile sensor is higher than bids, then terminate 12 / 17 A Bidding Protocol for Deploying Mobile Sensors

Bidding protocol ( key concepts) ( 7/7 ) 13 / 17 A Bidding Protocol for Deploying Mobile Sensors Mobile sensor Static sensor 93% coverage at round 5 40 sensors, 12 mobile sensors 82% coverage

Performance evaluations ( 1/3 ) Evaluation methodology Main cost Number of sensor Number of round Environment Ns-2 simulator 40 sensors and 10 independent experiments Some considerations Trade off between cost and coverage Cost ratio between the mobile sensor and the static sensor 14 / 17 A Bidding Protocol for Deploying Mobile Sensors

Performance evaluations ( 2/3 ) 15 / 17 A Bidding Protocol for Deploying Mobile Sensors Random deployment : just use static sensor Bidding protocol : static sensor + mobile sensor VEC algorithm : mobile sensor Random deployment Bidding protocol VEC algorithm Trade off The more mobile sensor are used, The better coverage is obtained But the sensor cost will be increased

Performance evaluations ( 3/3 ) 16 / 17 A Bidding Protocol for Deploying Mobile Sensors

Conclusions Voronoi diagram can be applied to a sensor network using a greedy heuristic method Mixture of a static sensor and a mobile sensor can achieve a good balance between coverage and cost 17 / 17 A Bidding Protocol for Deploying Mobile Sensors

Extra ( 1/4 ) Duplicate healing 18 / 17 A Bidding Protocol for Deploying Mobile Sensors

Extra ( 2/4 ) Duplicate healing detection 19 / 17 A Bidding Protocol for Deploying Mobile Sensors A B Broadcast Check if base price of A > base price of B If yes, run detection algorithm If detected, set base price of A to zero

Extra ( 3/4 ) Detection Algorithm Detecting threshold = π * ( d min – sensing_range) 2 d min : Distance to closest neighbor IF ( detecting threshold < new base price || d min < sensing_range ) THEN duplication occurs 20 / 17 A Bidding Protocol for Deploying Mobile Sensors

Extra ( 4/4 ) 21 / 17 A Bidding Protocol for Deploying Mobile Sensors A,B is mobile sensor Snapshot in the middle of round N f ’s base price is calculated without consideration of N e at N f Detecting threshold < New base price New base price of B d min Why Detecting threshold < New base price?