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.

Slides:

Advertisements

Similar presentations

Smooth Path Construction for Data Mule Tours in Wireless Sensor Networks By: Andrew Wichmann, Justin Chester, and Turgay Korkmaz.

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.

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

Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.

A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.

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.

Network Correlated Data Gathering With Explicit Communication: NP- Completeness and Algorithms R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano,

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

Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.

Distributed Sensing and Data Collection Via Broken Ad Hoc Wireless Connected Networks Mobile Robots By Alan FT Winfield Presented By Navpreet Bawa.

Networked Slepian–Wolf: Theory, Algorithms, and Scaling Laws R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano, Member, IEEE, Martin Vetterli,

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.

Optimizing Lifetime for Continuous Data Aggregation With Precision Guarantees in Wireless Sensor Networks Xueyan Tang and Jianliang Xu IEEE/ACM TRANSACTIONS.

CS230 Project Mobility in Energy Harvesting Wireless Sensor Network Nga Dang, Henry Nguyen, Xiujuan Yi.

Connected Dominating Sets in Wireless Networks My T. Thai Dept of Comp & Info Sci & Engineering University of Florida June 20, 2006.

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

1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.

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.

Miao Zhao, Ming Ma and Yuanyuan Yang

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

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

Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.

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

Distributed Anomaly Detection in Wireless Sensor Networks Ksutharshan Rajasegarar, Christopher Leckie, Marimutha Palaniswami, James C. Bezdek IEEE ICCS2006(Institutions.

Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.

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.

Prediction-based Object Tracking and Coverage in Visual Sensor Networks Tzung-Shi Chen Jiun-Jie Peng,De-Wei Lee Hua-Wen Tsai Dept. of Com. Sci. and Info.

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

Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks

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

VAPR: Void Aware Pressure Routing for Underwater Sensor Networks

Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.

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

/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.

Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.

Bounded relay hop mobile data gathering in wireless sensor networks

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

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

University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.

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

Covering Points of Interest with Mobile Sensors Milan Erdelj, Tahiry Razaﬁndralambo and David Simplot-Ryl INRIA Lille - Nord Europe IEEE Transactions on.

Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Wensheng Zhang, and Chuang Wang Department of Computer Science, Iowa State University.

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

Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.

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

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.

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

Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.

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

Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.

1 A Cross-Layer Scheduling Algorithm With QoS Support in Wireless Networks Qingwen Liu, Student Member, IEEE, Xin Wang, Member, IEEE, and Georgios B. Giannakis,

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

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

Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Ming Ma and Yuanyuan Yang Department of Electrical & Computer Engineering.

Distributed Topology Control In Wireless Sensor Networks with Assymetric Links Presenter: Himali Saxena.

Saran Jenjaturong, Chalermek Intanagonwiwat Department of Computer Engineering Chulalongkorn University Bangkok, Thailand IEEE CROWNCOM 2008 acceptance.

1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),

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)

Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.

Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.

Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic.

I owa S tate U niversity Laboratory for Advanced Networks (LAN) Coverage and Connectivity Control of Wireless Sensor Networks under Mobility Qiang QiuAhmed.

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

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,

Distributed Minimum-Cost Clustering for Underwater Sensor Networks

Presentation transcript:

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 Distributed Processing (IEEE IPDPS) 2008

Outline Introduction Previous work Goal Assumption Single-hop data gathering potocol(SHDGP) Data Gathering with Multiple M-Collectors Performance evaluation 2

Introduction Wireless sensor network (WSN) is composed of several sensor nodes deployed and scattered over a specific monitoring region for collecting sensed data. 3

Introduction 4

5

Previous work When only a small number of data mules are available and not all sensors are connected, data mules may not cover all the sensors in the network. D. Jea, A.A. Somasundara and M.B. Srivastava, “Multiple controlled mobile elements (data mules) for data collection in Sensor Networks,” 2005 IEEE/ACM International Conference on Distributed Computing in Sensor Systems (DCOSS ’05), June

Goal Large scale homogeneous networks Can be used in both connected networks and disconnected networks 7

Assumption M-collectors move at a fixed speed, and ignore the time for making turns and data transmission Sensing data is generally collected at a low rate and is not so delay-sensitive. 8

Single-hop data gathering(SHDGP) 9 Candidate polling points Sensor Wireless links S1 S2 S3 S4 S5 Sensor:S1~S5 Neighbor set of l1,l2,l6:{S1,S2} l1 l2 l3 l4 l6 l7 l5 Neighbor set of l3,l4,l5,l7:{S3,S4,S5} Candidate polling point set:{l1~l7} F: The family of neighbor sets. S: Neighbor set.

Single-hop data gathering(SHDGP) 10

Minimum Set Cover problems Single-hop data gathering(SHDGP) 11 P: Contain all polling points. U: Contain the set of remaining uncovered sensors. Traveling Salesman Problem (TSP) for points in the plane A B C D E

Single-hop data gathering(SHDGP) Determine the sequence to visit 12 Wireless links

Single-hop data gathering(SHDGP) Find an approximate shortest tour on points of tree. 13 Wireless links

Data Gathering with Multiple M- Collectors Multiple Traveling Salesman Problem(MTSP) Find a set of data gathering sub-tours, such that the number of M-collectors can be minimized. 14

Data Gathering with Multiple M- Collectors 15

Let L max be the upper bound on the length of any sub-tour of any sub-tour Data Gathering with Multiple M- Collectors 16 L max /2

Let L max be the upper bound on the length of any sub-tour of any sub-tour Data Gathering with Multiple M- Collectors 17 L max /2

Data Gathering with Multiple M- Collectors 18

Data Gathering with Multiple M- Collectors 19

Data Gathering with Multiple M- Collectors 20

Performance evaluation Simulation parametersInitial values Bandwidth200 Kbps Payload80 bytes Terrain1000m × 1000m Number of nodes600, 800, 1000 Node placementUniform Radio Range40, 60, 80M Propagation modelTWO-RAY 21

Performance evaluation 22

Performance evaluation 23

Performance evaluation 24

Conclusinos Proposed data gathering becomes more flexible and adaptable to the unexpected changes of the network topology. Greedy algorithm can greatly reduce the moving length compared to the covering line algorithm and is close to the optimal algorithm in small networks. 25