In order to efficiently deal with location dependent messages in multi-sink wireless sensor networks (WSNs), it is key that the network informs sinks what geographical area is covered by which sink. The sinks are then able to efficiently route messages which are only valid in particular regions of the deployment. In our previous work (see the 5th and 6th cited documents), we proposed a combined coverage area reporting and geographical routing protocol for location dependent messages, for example, queries that are injected by sinks. In this paper, we study the case where we have static sinks and mobile sensor nodes in the network. To provide up-to-date coverage areas to sinks, we focus on handling node mobility in the network. We discuss what is a better method for updating the routing structure (i.e., routing trees and coverage areas) to handle mobility efficiently: periodic global updates initiated from sinks or local updates triggered by mobile sensors. Simulation results show that local updating perform very well in terms of query delivery ratio. Local updating has a better scalability to increasing network size. It is also more energy efficient than ourpreviously proposed approach, where global updating in networks have medium mobility rate and speed.
References
[1]
Luo, D.; Zuo, D.; Yang, X. An Optimal Sink Selection Scheme for Multi-Sink Wireless Sensor Networks. Proceedings of International Conference on Computer Science and Information Technology, Singapore, 29 August 2008; pp. 544–548.
[2]
Casari, P.; Castellani, A.P.; Cenedese, A.; Lora, C.; Rossi, M.; Schenato, L.; Zorzi, M. The Wireless Sensor Networks for City-Wide Ambient Intelligence (WISE-WAI) Project. Sensors 2009, 9, 4056–4082, doi:10.3390/s90604056. 22408513
[3]
Maihofer, C. A Survey of Geocast Routing Protocols. IEEE Commun. Surv. Tutor 2004, 6, 32–42.
[4]
Lee, J.J.; Krishnamachari, B.; Kuo, C.C.J. Determining Localized Tree Construction Schemes Based on Sensor Network Lifetime. EURASIP J. Wirel. Commun. Network 2010, 2010, 1–13.
[5]
van Hoesel, L.; Tüysüz-Erman, A.; Havinga, P. Combined Coverage Area Reporting and Geographical Routing in Wireless Sensor-Actuator Networks for Cooperating with Unmanned Aerial Vehicles. Proceedings of the 3rd ERCIM Workshop On eMobility, Enschede, The Netherlands, 27–28 May 2009; pp. 43–54.
[6]
van Hoesel, L.; Tüysüz-Erman, A.; Dilo, A.; Havinga, P. Geo-Casting of Queries Combined with Coverage Area Reporting for Wireless Sensor Networks. Ad Hoc Networks 2011. in review.
[7]
van Hoesel, L.; Tüysüz Erman, A.; Havinga, P. Ideas on Node Mobility Support in Schedule-Based Medium Access. Proceedings of ISSNIP’08: 4rd International Conference on Intelligent Sensors, Sensor Networks and Information Processing, Sydney, Australia, 15–18 December 2008; pp. 539–544.
[8]
Ali, M.; Voigt, T.; Uzmi, Z. Mobility Management in Sensor Networks. Proceedings of MSWSN: Mobility and Scalability in Wireless Sensor Networks Workshop Joint with 2nd DCOSS, San Francisco, CA, USA, 18 June 2006; pp. 131–140.
[9]
Intanagonwiwat, C.; Govindan, R.; Estrin, D. Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. Proceedings of Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom’00), Boston, MA, USA, 6–11 August 2000; pp. 56–67.
[10]
Yang, H.; Ye, F.; Sikdar, B. A Dynamic Query-Tree Energy Balancing Protocol for Sensor Networks. Proceedings of IEEE Conference on Wireless Communications and Networking (WCNC04), Atlanta, GA, USA, 21–25 March 2004; pp. 1715–1720.
[11]
Dimakis, A.; Sarwate, A.; Wainwright, M. Geographic Gossip: Efficient Averaging for Sensor Networks. IEEE Trans. Sign. Process 2008, 56, 1205–1216, doi:10.1109/TSP.2007.908946.
[12]
Zorzi, M.; Rao, R. Geographic Random Forwarding (GERAF) for Ad Hoc and Sensor Networks: Multihop Performance. IEEE Trans. Mobile Comput 2003, 2, 337–348, doi:10.1109/TMC.2003.1255648.
[13]
Karp, B.; Kung, H. GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. Proceedings of 6th Annual International Conference on Mobile Computing and Networking (MobiCom’00), Boston, MA, USA, 6–11 August 2000; pp. 243–254.
[14]
Kranakis, E.; Singh, H.; Urrutia, J. Compass Routing on Geometric Networks. Proceedings of 11th Canadian Conference on Computational Geometry (CCCG’99), Vancouver, BC, Canada, 15–18 August 1999; pp. 51–54.
[15]
Bose, P.; Morin, P.; Stojmenovi, I.; Urrutia, J. Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wireless Networks 2001, 7, 609–616, doi:10.1023/A:1012319418150.
[16]
Kim, Y.J.; Govindan, R.; Karp, B.; Shenker, S. Lazy Cross-Link Removal for Geographic Routing. Proceedings of the 4th International Conference on Embedded Networked Sensor Systems (SenSys’06), Boulder, CO, USA, 31 October 2006; pp. 112–124.
[17]
Leong, B.; Liskov, B.; Morris, R. Geographic Routing Without Planarization. Proceedings of the 3rd Symposium on Network Systems Design and Implementation (NSDI’06), San Jose, CA, USA, 8–10 May 2006.
[18]
Yu, Y.; Govindan, R.; Estrin, D. Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks. Technical Report UCLA/CSD-TR-01-0023;; Computer Science Department, UCLA: Los Angeles, CA, USA, 2001.
[19]
Ko, Y.; Vaidya, N. Anycasting-Based Protocol for Geocast Service in Mobile Ad Hoc Networks. Comput. Networks J 2003, 41, 743–760, doi:10.1016/S1389-1286(02)00437-1.
[20]
Park, V.; Corson, M. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. Proceedings of the 6th IEEE INFOCOM, Kobe, Japan, 7–12 April 1997; pp. 1405–1413.
[21]
Stojmenovic, I.; Ruhil, A.P.; Lobiyal, D.K. Voronoi Diagram and Convex Hull-Based Geocasting and Routing in Wireless Networks. Proceedings of the 8th IEEE Symposium on Computers and Communications (ISCC’03), Antalya, Turkey, 30 June 2003.
[22]
Dhurandher, S.; Obaidat, M.; Gupta, M. An Efficient Technique for Geocast Region Holes in Underwater Sensor Networks and Its Performance Evaluation. Simulat. Model. Pract. Theory 2011, 19, 2102–2116, doi:10.1016/j.simpat.2011.06.004.
[23]
Tüysüz Erman, A. Multi-Sink Mobile Wireless Sensor Networks: Dissemination Protocols, Design and EvaluationPh.D. Thesis. University of Twente, Enschede, The Netherlands, 2011.
[24]
Schmitt, J.; Zdarsky, F.; Roedig, U. Sensor Network Calculus with Multiple Sinks. Proceedings of IFIP NETWORKING 2006: Workshop on Performance Control in Wireless Sensor Networks, Coimbra, Portugal, 15–19 May 2006; pp. 6–13.
[25]
Das, A.; Dutta, D. Data Acquisition in Multiple-Sink Sensor Networks. ACM SIGMOBILE Mobile Comput. Commun. Rev 2005, 9, 82–85, doi:10.1145/1094549.1094561.
[26]
Dubois-Ferriere, H.; Estrin, D. Efficient and Practical Query Scoping in Sensor Networks. Proceedings of the 1st IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS’04), Fort Lauderdale, FL, USA, 25–27 October 2004.
[27]
The terms, convex hull and coverage area, are used interchangeably in this paper.
[28]
de Berg, M.; Cheong, O.; van Kreveld, M.; Overmars, M. Computational Geometry: Algorithms and Applications; Springer: Berlin, Germany, 2008.
[29]
Shamos, M.I. Computational GeometryPh.D. Thesis. Yale University, New Haven, CT, USA, 1978.
[30]
Toussaint, G. Solving Geometric Problems with the Rotating Calipers. Proceedings of IEEE Mediterranean Electrotechnical Conference (MELECON’83), Athens, Greece, 24–26 May 1983.
[31]
Schirra, S. How Reliable Are Practical Point-in-Polygon Strategies? Lect. Note. Comput. Sci 2008, 5193, 744–755.
[32]
Chazelle, B.; Dobkin, D. Detection is Easier than Computation. Proceedings of the 12th annual ACM Symposium on Theory of Computing, Los Angeles, CA, USA, 28–30 April 1980; pp. 146–153.
[33]
Eberly, D. Intersection of linear and circular components in 2D. 2000. Available online: http://www.geometrictools.com/ (accessed on 29 November 2011).
[34]
To check if its convex hull is changed, MN stores the previous convex hull. After comparison, it deletes the old convex hull.
[35]
Network Simulator ns-2. Available online: http://www.isi.edu/nsnam/ns/ (accessed on 29 November 2011).
[36]
The typical UAV speed is taken from the specification document of EU project AWARE (IST-2006-33579, http://www.aware-project.net ) and were used in the field experiments of AWARE in May 2009 in Seville, Spain.
[37]
Zheng, J.; Lee, M. A Comprehensive Performance Study of IEEE 802.15.4. In Sensor Network Operations; IEEE Press, Wiley Interscience: Hoboken, NJ, USA, 2006. Chapter 4,; pp. 218–237.
[38]
Tüysüz Erman, A.; Dilo, A.; Havinga, P. A Fault-Tolerant Data Dissemination Based on Honeycomb Architecture for Mobile Multi-Sink Wireless Sensor Networks. Proceedings of ISSNIP’10: 6th International Conference on Intelligent Sensors, Sensor Networks and Information Processing, Brisbane, Australia, 7–10 December 2010; pp. 97–102.