Query Driven Data Collection and Data Forwarding in Intermittently Connected Mobile Sensor Networks Wei WU 1, Hock Beng LIM 2, Kian-Lee TAN 1 1 National.

Slides:



Advertisements
Similar presentations
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
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,
Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet Presented by Eric Arnaud Makita
Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,
CS710 IEEE Transactions on vehicular technology 2005 A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou,
Presentation by: Drew Wichmann Paper by: Samer Hanoun and Saeid Nahavandi 1.
TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
1 Routing Techniques in Wireless Sensor networks: A Survey.
Defending Against Traffic Analysis Attacks in Wireless Sensor Networks Security Team
The Cougar Approach to In-Network Query Processing in Sensor Networks By Yong Yao and Johannes Gehrke Cornell University Presented by Penelope Brooks.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Rendezvous Planning in Mobility- assisted Wireless Sensor Networks Guoliang Xing; Tian Wang; Zhihui Xie; Weijia Jia Department of Computer Science City.
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
Connected Dominating Sets in Wireless Networks My T. Thai Dept of Comp & Info Sci & Engineering University of Florida June 20, 2006.
Energy Saving In Sensor Network Using Specialized Nodes Shahab Salehi EE 695.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Sidewinder A Predictive Data Forwarding Protocol for Mobile Wireless Sensor Networks Matt Keally 1, Gang Zhou 1, Guoliang Xing 2 1 College of William and.
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
A Sweeper Scheme for Localization and Mobility Prediction in Underwater Acoustic Sensor Networks K. T. DharanC. Srimathi*Soo-Hyun Park VIT University Vellore,
GUI: GPS-Less Traffic Congestion Avoidance in Urban Area with Inter-Vehicular Communication Presenter: Zhen Jiang or
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
Gathering Data in Wireless Sensor Networks Madhu K. Jayaprakash.
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.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
Presented BY:- S.KOTESWARA RAO 09511A0528. INTRODUCTION Bluetooth is wireless high speed data transfer technology over a short range ( meters).
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
VAPR: Void Aware Pressure Routing for Underwater Sensor Networks
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.
1 Virtual Patrol : A New Power Conservation Design for Surveillance Using Sensor Networks Prasant Mohapatra, Chao Gui Computer Science Dept. Univ. California,
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
788.11J Presentation “Deploying a Wireless Sensor Network on an Active Volcano” Presented by Ahmed Farouk Ibrahim Gaffer.
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
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.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
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,
Dynamic Routing in Mobile Ad Hoc Network 報告者:呂佐鴻 指導教授:李鴻璋.
Bounded relay hop mobile data gathering in wireless sensor networks
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Opportunistic Flooding in Low-Duty- Cycle Wireless Sensor Networks with Unreliable Links Shuo Goo, Yu Gu, Bo Jiang and Tian He University of Minnesota,
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
Mobile Sensor Deployment for a Dynamic Cluster-based Target Tracking Sensor Network Niaoning Shan and Jindong Tan Department of Electrical and Computter.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
Mobile-Assisted Localization by Stitching in Wireless Sensor Networks IEEE ICC 2011 Han Wang, Wangdong Qi, Kun Wang, Peng Liu, Li Wei and Yasong Zhu PLA.
Grid-Based Energy-Efficient Routing from Multiple Sources to Multiple Mobile Sinks in Wireless Sensor Networks Kisuk Kweon, Hojin Ghim, Jaeyoung Hong and.
Autonomous Messenger Based Routing in Disjoint clusters of Mobile Sensor Network Authors: Nisar Hundewale, Qiong Cheng, Xiaolin Hu, Anu Bourgeois, Alex.
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)
Structure-Free Data Aggregation in Sensor Networks.
1 Terrain-Constrained Mobile Sensor Networks Shu Zhou 1, Wei Shu 1, Min-You Wu 2 1.The University of New Mexico 2.Shanghai Jiao Tong University IEEE Globecom.
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.
TTDD: A Two-tier Data Dissemination Model for Large- scale Wireless Sensor Networks Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, Lixia Zhang (UCLA) Mobicom.
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
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.
Nov. 29, 2006GLOBECOM /17 A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
How to minimize energy consumption of Sensors in WSN Dileep Kumar HMCL 30 th Jan, 2015.
Enabling QoS Multipath Routing Protocol for Wireless Sensor Networks
Salah A. Aly ,Moustafa Youssef, Hager S. Darwish ,Mahmoud Zidan
A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks
Presentation transcript:

Query Driven Data Collection and Data Forwarding in Intermittently Connected Mobile Sensor Networks Wei WU 1, Hock Beng LIM 2, Kian-Lee TAN 1 1 National University of Singapore 2 Nanyang Technological University DMSN 2010,

2 Outline Sparse mobile sensor network Problem: long query answering time Proposal: query-driven data collection and location-based data forwarding  System model and assumptions  Query-driven data collection  Location-based data forwarding  Simulation results Conclusion

3 Mobile Sensor Networks (MSNs) Dynamic networks formed by mobile sensors. Mobile sensors  On ground, aerial, wearable NASA UAV NASA Nokia UTK

4 Applications of MSNs Reconnaissance Disaster rescue Environment monitoring

5 Sparse MSNs A MSN is sparse when  The number of sensors is small, Mobile sensors are more expensive than stationary sensors  Task field is big,  Wireless communication range is limited. Characteristics  The topology is dynamic.  The connection between nodes is intermittent.

6 Problem The query response time at the base station can be long.  Data forwarding to BS is done in a carry-and- forward manner.  Only a small portion of data objects are forwarded to the base station. Limited data availability at the base station.  The base station cannot disseminate queries to the sensor nodes.

7 Mobile Data Collector Mobile data collector  A mobile node that moves to the sensors to collect data objects and returns to the base station.  Can be a normal mobile sensor or a special mobile unit.

8 Our Study Purpose: reduce the query response time at the base station. Basic idea: use a mobile data collector (MDC) to do query-driven data collection.  The base station sends a pending query to a mobile data collector (MDC).  The MDC moves to the sensors to find query answer and returns to the base station.

9 Challenge  The sensor net is disconnected.  How can the MDC find the sensor that has query result? Solution  Use spatial predicate in the query to direct the MDC ’ s movement.  The mobile sensors collaborate with the MDC, forward data objects to neighbors along data objects ’ collection path.

10 Sparse MSNs System Model One base station  Receives queries from users;  Receives data objects from mobile nodes. A number of mobile sensors  Move in a task field;  acquire data objects periodically;  Forward data towards BS when connected. One mobile data collector (MDC)  Gets query from BS;  Moves to collect data objects from mobile sensors;  Returns to BS.

11 Assumptions Mobile sensors have GPS units. Data objects have location metadata. Queries have spatial predicates.  A query requests for a data object acquired at a specific location.  A data object can be used to answer the query if the data object was acquired at (or very close to) query location. Sensors spend most energy on movement. Sensors have enough storage.

12 Collection Path and Forwarding Region Qp: a query requesting for a data object acquired at (near) p. Dp: a data object acquired at location p. Collection Path for Dp. Path(Dp)  The shortest physical path in the field from the base station to p. Forwarding Region for Dp. Region(Dp)  The union of the points in the field whose distances to Path(Dp) are shorter than sensors ’ communication range r.  The area covered by the MDC ’ s wireless signal when it moves on Path(Dp).

13 Collection Path and Forwarding Region (Cont ’ d) Each data object has a collection path and a forwarding region. The MDC moves along Path(Dp) to collect data for Qp. Mobile sensors facilitate the MDC ’ s data collection.  Mobile sensors (best effort) forward data objects to neighbors in data objects ’ forwarding regions. Increase the chance that MDC will meet a sensor that carries Dp.  Forward data objects towards the base station. Reduce the MDC ’ s move distance.

14 Simple Examples Example 1 Example 2Example 3 S2 forwards Dp to S3.S2 forwards Dp to S1.S2 forwards Dp 1 to S3.

15 Location-based Data Forwarding Sensors forward data objects to sensors in data objects ’ forwarding region. Also forward data objects towards the base station. Decisions are made based on sensors ’ locations and data objects ’ location metadata. Sensor Si carrying data object Dp encounters a sensor Sj that does not have Dp. If Si is in Region(Dp)  If Sj is also in Region(Dp) and Sj is closer to the BS Si forwards Dp to Sj Else  If Sj is in Region(Dp) or Sj is closer to Region(Dp) Si forwards Dp to Sj

16 Query-driven Data Collection The BS has a pending query Qp that requests for a data object acquired at p in the field. The BS sends Qp to the MDC. The MDC moves along Path(Dp) to collect Dp.  When connected to a sensor, it checks whether the sensor has a data object that can answer Qp. If so, the MDC gets the data object and moves back to BS.  The MDC also collects other data objects during the course. Mobile sensors forward data objects to the MDC when connected. MDC ’ s route is determined by query location.

17 Performance Study Simulation setup  Follows the system model.  600m* 600m task field.  Mobility model: random waypoint.  Bandwidth: 2Mbps. ParameterUnitDefaultRange Number of sensors n Move speed vMeters/s21-8 Data object size DKB Sense interval TsSecond Query interval TqSecond Communication range rMeter

18

19

20 Experiment Result Effect of the number of sensors

21 Experiment Result (2) Effect of move speed

22 Experiment Result (3) Effect of data object size

23 Summary In sparse mobile sensor networks, query response time at base station may be long. We propose  Query-driven data collection. Make use query ’ s location predicate.  Location-based data forwarding to facilitate query-driven data collection. Make use data objects ’ location metadata. Improve data availability along data collection path. Simulation results show that our solution can help reduce the average query response time at the base station.

24 Future Work Take query and data objects ’ temporal information also into account. Take nodes ’ trajectory into account. Multiple path forwarding. Data collection for multiple queries.

Thank you! Questions?

26 Query-driven Data Collection and Location-based Data Forwarding Query-driven data collection.  The MDC collects data objects for queries that it gets from the base station.  The collection path is determined by the query. Location-based Data forwarding for data collection  data forwarding decision based on data objects ’ location metadata and sensors ’ location.  Prioritize data objects for forwarding, to reduce MDC ’ s collection distance. Objective: reduce the query response time at the base station by reducing the distance that the MDC needs to move before finding query answer.

27 Prioritize Data Objects in Data Forwarding A sensor needs to decide what data objects to forward.  A sensor may (have acquired and) carry many data objects.  It can only forward a small number of data objects to a neighbor (due to limited connection time). Two situations:  Forward to a neighboring sensor. Prioritize based on quantitative measure of collection distance reduction.  Forward to the MDC. Prioritize based on collection path distance.

28 Data caching A sensor caches a data object locally after forwarding it to a neighboring sensor.  It does not forward it any more. Objective: improve data availability among mobile sensors. When the MDC encounters a sensor, it is more likely to get query answer from the sensor.

29 Forwarding to a Neighboring Sensor A sensor ’ s collection distance w.r.t a data object Dp. cd(si,dp)  The distance that the MDC needs to move to get Dp. If Circle(si, r) intersects Path(Dp), cd(si,dp) is the distance from BS to the intersection that is nearer to BS. If Circle(si,r) does not intersect Path(Dp), cd(si,dp) is the length of Dp.

30 Forwarding to a Neighboring Sensor A sensor ’ s collection distance w.r.t a data object Dp. cd(si,dp)  The distance that the MDC needs to move to get Dp. If Circle(si, r) intersects Path(Dp), cd(si,dp) is the distance from BS to the intersection that is nearer to BS. If Circle(si,r) does not intersect Path(Dp), cd(si,dp) is the length of Dp.

31 Forwarding to a Neighboring Sensor (Cont ’ d) Si, Sj, Dp Delta-collection-distance: cd(Si,Dp) – cd(Sj,Dp) It is the moving distance of MDC that is saved by the data forwarding if the MDC goes to collect Dp. Si prioritizes the data objects for forwarding to Sj based on their delta-collection-distances. The data object with the largest delta- collection-distance is forwarded first. For the data objects whose delta-collection-distances are zero. Si considers the data objects that are outside their forwarding regions. Si forwards Dp to Sj if Sj is closer to Dp ’ forwarding region.

32 Forwarding to the MDC When a sensor is connected to the MDC, the sensors forwards data objects to the MDC.  Objects are prioritized based on the lengths of their collection paths.  Objects whose locations are the furthest from the BS are forwarded to the MDC first.

33 Effect of Sense Interval

34 Effect of Query Interval

35 Effect of communication range