Probabilistic Path Selection in Mobile Wireless Sensor Networks for Stochastic Events Detection
Mobile sensors cover more area over a fixed period of time than the same number of stationary sensors. With the combination of communication and mobility capabilities, we can envision a new class of proactive networks that are able to adapt themselves, via physical movement, to meet the need of different applications. In this paper we consider the following event capture problem: The stochastic events arrive at certain points, called points of interesting (PoIs), in the sensor field with a long enough duration time. Mobile sensors visit all PoIs start from Base Station (BS) with a fixed velocity and finally return to BS. An event is said to be captured if it is sensed by one of the mobile sensors before it fades away. Due to the over-detection problem when ever mobile sensors blindly visit every PoIs with the same interval time, we propose a general event detection framework (EDF) for mobile sensors using probabilistic path selection (PPS) protocol to reduce detection latency, and employ less number mobile nodes at the same time. A distinctive feature is that the system ensures that the detection delay of any event occurring at PoIs is statistically bounded, and mobile sensor framework (MSF) reduces transmitting delay from the time mobile sensor detecting event to return to BS simultaneously. Extensive experiments have been conducted and the results demonstrate that our algorithm allows us use less number mobile nodes within the delay bound and reduce the transmitting delay significantly.
KeywordsSensor Network Sensor Node Wireless Sensor Network Mobile Node Travel Salesman Problem
Unable to display preview. Download preview PDF.
- 1.Tolle, G., Polastre, J., Szewczyk, R., Culler, D., et al.: Amacroscope in the redwoods. In: ACM SenSys, pp. 51–63 (2005)Google Scholar
- 2.Xue, W., Luo, Q., Chen, L., Liu, Y.H.: Contour mapmatching for event detection in sensor networks. In: ACM SIGMOD (2006)Google Scholar
- 4.Zhang, X., Zhang, L., Chen, G.: Probabilistic Path Selection in Wireless Sensor Networks with Controlled Mobility. In: WCSP (2009)Google Scholar
- 5.Srinivasan, W.W.V., Chua, K.-C.: Trade-offs between mobility and density for coverage in wireless sensor networks. In: MobiCom (2007)Google Scholar
- 6.Chellappan, S., Bai, X., Ma, B., Xuan, D.: Sensor Networks Deployment Using Flip-Based Sensors. In: Proceedings of IEEE MASS (2005)Google Scholar
- 7.Howard, A., Mataric, M.J., Sukhatme, G.S.: Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem. In: International Symposium on Distributed Autonomous Robotic Systems (DARS 2004), pp. 299–308 (2002)Google Scholar
- 8.Zou, Y., Chakrabarty, K.: Sensor deployment and target localization based on virtual forces. In: 22nd Annual IEEE Conference on Computer Communications (INFOCOM), pp. 1293–1303 (2003)Google Scholar
- 9.Wang, G., Cao, G., Porta, T.L.: Movement-assisted sensor deployment. In: 23rd Annual IEEE Conference on Computer Communications (INFOCOM), pp. 2469–2479 (2004)Google Scholar
- 10.Liu, B., Brass, P., Dousse, O., Nain, P., Towsley, D.: Mobility improves coverage of sensor networks. In: MobiHoc (2005)Google Scholar
- 11.Bisnik, N., Abouzeid, A., Isler, V.: Stochastic event capture using mobile sensors subject to a quality metric. In: MOBICOM (2006)Google Scholar
- 13.Gandham, S.R., Dawande, M., Prakash, R., Venkatesan, S.: Energy efficient schemes for wireless sensor networks with multiple mobile base stations. In: Globecom (2003)Google Scholar
- 14.Xing, G., Wang, T., Jia, W., Li, M.: Rendezvous design algorithms for wireless sensor networks with a mobile base station. In: MobiHoc (2008)Google Scholar