Presentation is loading. Please wait.

Presentation is loading. Please wait.

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.

Published byIsaac Merritt Modified over 8 years ago

Similar presentations

Presentation on theme: "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."— Presentation transcript:

1 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

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

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

4 Introduction 4

5 5

6 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 2005. 6

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

8 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

9 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.

10 Single-hop data gathering(SHDGP) 10

11 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

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

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

14 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

15 Data Gathering with Multiple M- Collectors 15

16 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

17 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

18 Data Gathering with Multiple M- Collectors 18

19 Data Gathering with Multiple M- Collectors 19

20 Data Gathering with Multiple M- Collectors 20

21 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

22 Performance evaluation 22

23 Performance evaluation 23

24 Performance evaluation 24

25 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

Download ppt "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."

Similar presentations

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

Smooth Path Construction for Data Mule Tours in Wireless Sensor Networks By: Andrew Wichmann, Justin Chester, and Turgay Korkmaz.
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.

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.

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.

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.

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.

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,

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.,

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.

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.

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,

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.

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.

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.

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.

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.

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.

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.

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)

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.

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.

Similar presentations

Ads by Google