Bounded relay hop mobile data gathering in wireless sensor networks

Slides:

Advertisements

Similar presentations

A Moving Strategy for Mobile Sink in Secure Data Collection Zhou Sha.

Advertisements

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

TDMA Scheduling in Wireless Sensor Networks

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

Delay-Minimized Route Design for Wireless Sensor-Actuator Networks Edith C.-H. Ngai 1, Jiangchuan Liu 2, and Michael R. Lyu 1 1 Department of Computer.

Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks Xueyan Tang Jianliang Xu Sch. of Comput. Eng., Nanyang Technol. Univ.,

Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.

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

Cache Placement in Sensor Networks Under Update Cost Constraint Bin Tang, Samir Das and Himanshu Gupta Department of Computer Science Stony Brook University.

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

Geographic Gossip: Efficient Aggregations for Sensor Networks Author: Alex Dimakis, Anand Sarwate, Martin Wainwright University: UC Berkeley Venue: IPSN.

The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.

Rendezvous Planning in Mobility- assisted Wireless Sensor Networks Guoliang Xing; Tian Wang; Zhihui Xie; Weijia Jia Department of Computer Science City.

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

Delay Analysis of Large-scale Wireless Sensor Networks Jun Yin, Dominican University, River Forest, IL, USA, Yun Wang, Southern Illinois University Edwardsville,

Energy Saving In Sensor Network Using Specialized Nodes Shahab Salehi EE 695.

Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.

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

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

Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.

Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.

Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang

Efficient Gathering of Correlated Data in Sensor Networks

Miao Zhao, Ming Ma and Yuanyuan Yang

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.

Grammati Pantziou 1, Aristides Mpitziopoulos 2, Damianos Gavalas 2, Charalampos Konstantopoulos 3, and Basilis Mamalis 1 1 Department of Informatics, Technological.

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

SoftCOM 2005: 13 th International Conference on Software, Telecommunications and Computer Networks September 15-17, 2005, Marina Frapa - Split, Croatia.

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.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

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.

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.

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

Minimum Average Routing Path Clustering Problem in Multi-hop 2-D Underwater Sensor Networks Presented By Donghyun Kim Data Communication and Data Management.

Athanasios Kinalis ∗, Sotiris Nikoletseas ∗, Dimitra Patroumpa ∗, Jose Rolim† ∗ University of Patras and Computer Technology Institute, Patras, Greece.

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

Converge-Cast: On the Capacity and Delay Tradeoffs Xinbing Wang Luoyi Fu Xiaohua Tian Qiuyu Peng Xiaoying Gan Hui Yu Jing Liu Department of Electronic.

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

Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,

A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.

A Multicast Mechanism in WiMax Mesh Network Jianfeng Chen, Wenhua Jiao, Pin Jiang, Qian Guo Asia-Pacific Conference on Communications, (APCC '06)

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

A Quorum-Based Energy-Saving MAC Protocol Design for Wireless Sensor Networks Chih-Min Chao, Yi-Wei Lee IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2010.

Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,

Mobility assistance in Wireless Sensor Network Xiujuan Yi Nalini Venkatasubramanian University of California, Irvine.

Murat Demirbas Onur Soysal SUNY Buffalo Ali Saman Tosun U. San Antonio Data Salmon: A greedy mobile basestation protocol for efficient data collection.

An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.

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

Distributed Data Gathering Scheduling in Multi-hop Wireless Sensor Networks for Improved Lifetime Subhasis Bhattacharjee and Nabanita Das International.

Seminar on Joint Scheduling for Wireless Sensor Network (Proposed by: Chong Liu, Kui Wu, Yang Xiao, Bo Sun) Presented by: Saurav Kumar Bengani.

Data Gathering in Wireless Sensor Networks with Mobile Collectors Ming Ma and Yuanyuan Yang State University of New York, Stony Brook 1 IEEE Parallel and.

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

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

Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati (Fellow IEEE) IEEE Transactions on Mobile Computing, March 2012.

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.

Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.

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

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)

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.

A Novel Virtual Anchor Node- based Localization Algorithm for Wireless Sensor Networks Pengxi Liu, Xinming Zhang, Shuang Tian, Zhiwei Zhao, Peng Sun Department.

Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.

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.

Computing and Compressive Sensing in Wireless Sensor Networks

Presented by: Rohit Rangera

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

Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks

Distributed Minimum-Cost Clustering for Underwater Sensor Networks

Edinburgh Napier University

Presentation transcript:

Bounded relay hop mobile data gathering in wireless sensor networks Miao Zhao and Yuanyuan Yang Stony Brook University, New York IEEE TRANSACTIONS ON COMPUTERS, VOL. 61, NO. 2, FEBRUARY 2012

Outline Introduction Goal BRH-MDC Problem Centralized Algorithm for BRH-MDC Problem Distributed Algorithm for BRH-MDC Problem Performance Evaluation Conclusion

Introduction Data gathering in WSN Multi-hop relay High energy consumption 300 sensors deployed over a 300 m * 300 m field. Relay routing along shortest paths with minimum hop counts

Introduction Employing mobile collectors Mobile data gathering by visiting each sensor and static data sink. It will take the mobile collector about 66.9 minutes on the tour when it moves at an average speed of 1 m/s.

Introduction tradeoff Employing mobile collectors Low energy consumption tradeoff Energy saving Collection latency High collection latency

Goal Proposing a polling-based approach that pursues a tradeoff between the energy saving and data collection latency Achieves a balance between the relay hop count for local data aggregation and the moving tour length of the mobile collector.

BRH-MDC Problem Network assumption The mobile collector has the freedom to move to any place in the sensing field

BRH-MDC Problem Basic idea Find a set of special nodes referred to as polling points (PPs) in the network The PPs are compactly distributed and close to the data sink. The number of the PPs is the smallest Static data sink Sensor Polling point d-hop bound Mobile collector tour Relay routing path

BRH-MDC Problem Relay hop count should be bounded ( d-hop ) A sensor network may expect to achieve a certain level of systematic energy efficiency. Eg. If each transmission costs one unit of energy and the energy efficiency of 0.33 packet/energy_unit is expected 3 energy_unit/packet 4 energy_unit/packet 2-hop bound 3 energy_unit/packet The bound is necessary due to buffer constraint on the sensors.

BRH-MDC Problem Formulation

BRH-MDC Problem Formulation PP i PP u

BRH-MDC Problem Formulation PP u Layer =1 Layer =2 PP u i j

BRH-MDC Problem Formulation PP u Layer =0

BRH-MDC Problem Formulation PP u v v PP PP u v PP PP

BRH-MDC Problem Formulation PP Sink u π PP PP PP PP 3 u 2

Outline Introduction Goal BRH-MDC Problem Centralized Algorithm for BRH-MDC Problem Distributed Algorithm for BRH-MDC Problem Performance Evaluation Conclusion

Centralized Algorithm for BRH-MDC Problem Shortest Path Tree based Data Collection Algorithm (SPT-DCA) Energy saving and data collection latency Constraint of the relay hop bound (d-hop) The sensors selected as the PPs are compactly distributed and close to the data sink. The number of the PPs is the smallest under the constraint of the relay hop bound.

Centralized Algorithm for BRH-MDC Problem Iteration 1 6 20 5 16 14 24 15 2 17 21 7 8 d-hop = 2-hop 1 25 19 18 11 3 13 10 23 22 12 9 4

Centralized Algorithm for BRH-MDC Problem Iteration 2 6 20 5 16 14 24 15 2 17 21 7 8 d-hop = 2-hop 1 25 19 = 1-hop 18 11 3 13 10 12 23 22 9 4

Centralized Algorithm for BRH-MDC Problem Final result 6 20 5 16 14 24 15 2 17 21 7 8 d-hop = 2-hop 1 25 19 11 18 3 13 10 23 22 12 9 4

Outline Introduction Goal BRH-MDC Problem Centralized Algorithm for BRH-MDC Problem Distributed Algorithm for BRH-MDC Problem Performance Evaluation Conclusion

Distributed Algorithm for BRH-MDC Problem Priority based PP selection algorithm (PB-PSA) Energy saving and data collection latency The primary parameter is the number of d-hop neighbors, which are the sensors in its d-hop range. The secondary parameter is the minimum hop count to the data sink. TENTA_ PP TENTA_PP.ID TENTA_PP.d_Nbrs TENTA_PP.Hop Node identification The number of its d-hop neighbors The minimum hop count of the tentative PP to the data sink

Priority based PP selection algorithm (PB-PSA) Update TeENTA_PP.Hop Rule 1 : Choose the neighbor with maxiumTENTA_PP.d_Nbrs Round 1 d-hop=2-hop 1 TENTA_ PP =3 2 3 6 TENTA_ PP =4 TENTA_ PP =3 TENTA_ PP 4 5 TENTA_ PP = 5 TENTA_ PP = 5,4,6 TENTA_ PP =4 TENTA_PP.ID TENTA_PP.d_Nbrs TENTA_PP.Hop 5 2 4 3 2 6 2 1

Priority based PP selection algorithm (PB-PSA) Update TeENTA_PP.Hop Rule 2 : Choose the neighbor with minimum TENTA_PP.Hop Round 2 d-hop=2-hop 1 TENTA_ PP =3 2 3 6 TENTA_ PP =3 TENTA_ PP =4 TENTA_ PP =3 TENTA_ PP 4 5 TENTA_ PP =3 TENTA_ PP =4,3 TENTA_ PP =4 TENTA_PP.ID TENTA_PP.d_Nbrs TENTA_PP.Hop 4 3 2 3 1

Priority based PP selection algorithm (PB-PSA) 1 TENTA_ PP =3 2 3 6 TENTA_ PP =3 Declar TENTA_ PP =3 4 5 TENTA_ PP =3 TENTA_ PP =3

Priority based PP selection algorithm (PB-PSA) 1 PP =3 2 3 6 Declar 4 5

Priority based PP selection algorithm (PB-PSA) Hop count +random time duration d-hop=2-hop 1 2 3 4 5 TENTA_ PP =1 TENTA_ PP =2 TENTA_ PP =3 TENTA_ PP =4 TENTA_ PP =5 Round = 1 TENTA_ PP =2 TENTA_ PP =3 TENTA_ PP =4 TENTA_ PP =5 Round =2 TENTA_ PP =3 TENTA_ PP =4 TENTA_ PP =5 TENTA_ PP =2 TENTA_ PP =5

Performance Evaluation Simulation Parameter A network with 30 sensors scattered over a 70m x 70m square area. d is set to 2.(2-hop bound)

Performance Evaluation Performance of SPT-DCA and PB-PSA Increasing relay hop bound d L佈建範圍邊長 N感測器數 Rs傳輸半徑

Performance Evaluation Performance of SPT-DCA and PB-PSA Increasing transmission range Rs d=3 d=2 d=2 d=3

Performance Evaluation Authors: M. Ma and Y. Yang University: State University of New York, USA Paper: “Data Gathering in Wireless Sensor Networks with Mobile Collectors” Published from: IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2008.

SHDG scheme sensor Candidate polling point

SHDG scheme :The cost of an uncovered neighbor set S and equal to the shortest distance between S and any covered neighbor set. : denote the average cost to cover each uncovered sensor in S. =d1/3 4 6

Performance Evaluation Authors: D. Jea, A.A. Somasundara and M.B. Srivastava University: University of California, Los Angeles Title: “Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks” From: IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS), 2005.

CME scheme

CME scheme

Performance Evaluation Comparison with SHDG and CME

200 m CME 200 m

Conclusion The paper have studied mobile data gathering in wireless sensor networks The relay hop count of sensors for local data aggregation The tour length of the mobile collector Then presented two efficient algorithms to give practically good solutions. The results demonstrate that the proposed algorithms can greatly shorten the data collection tour length with a small relay hop bound

Thank you very much~