Abstract
In Mobile Wireless Sensor Networks (MWSNs) where mobile sensor nodes densely exist, it is desirable to gather sensor data from the minimum number of sensor nodes which are necessary to guarantee the sensing coverage in order to reduce communication traffic. In the past, we have proposed a data gathering method using mobile agents in dense MWSNs. However, since this method assumes that only one sink is present in a network, it cannot effectively reduce traffic in environments where multiple sinks exist. In this paper, we propose a mobile agents control scheme which guarantees multiple sinks’ coverages and efficiently gathers sensor data. In the proposed method, mobile agents are communalized if their sensing points overlap, and sensor data are aggregated to transmit them to same direction.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Scenargie 1.6 Base Simulator revision 10864, Space-Time Engineering, http://www.spacetime-eng.com/.
References
Banimelhem, O., Khasawneh, S.: GMCAR: grid-based multipath with congestion avoidance routing protocol in wireless sensor networks. Ad Hoc Netw. 10(7), 1346–1361 (2012)
Camp, T., Boleng, J., Davies, V.: A survey of mobility models for ad hoc network research. Wireless Commun. Mob. Comput. 2(5), 483–502 (2002)
Cha, S., Talipov, E., Cha, H.: Data delivery scheme for intermittently connected mobile sensor networks. Comput. Commun. 36(5), 504–519 (2013)
Goto, K., Sasaki, Y., Hara, T., Nishio, S.: Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks. In: Proceedings of MoMM 2011, pp. 58–65 (2011)
Heissenbüttel, M., Braun, T., Bernoulli, T., Wälchli, M.: BLR: beacon-less routing algorithm for mobile ad hoc networks. Comput. Commun. 27(11), 1076–1086 (2004)
Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. North-Holland, Amsterdam (1992). ISBN: 044489098X
Jabeur, N., Zeadally, S., Sayed, B.: Mobile social networking applications. Commun. ACM 56(3), 71–79 (2013)
Landsiedel, O., Götz, S., Wehrle, K.: Towards scalable mobility in distributed hash tables. In: Proceedings of P2P 2006, pp. 203–209 (2006)
Lu, K.-H., Hwang, S.-F., Su, Y.-Y., Chang, H.-N., Dow, C.-R.: Hierarchical ring-based data gathering for dense wireless sensor networks. Wireless Pers. Commun. 64(2), 347–367 (2012)
Mitra, P., Poellabauer, C.: Efficient group communications in location aware mobile ad-hoc networks. Pervasive Mob. Comput. 8(2), 229–248 (2012)
Yashiro, T.: A new paradigm of V2V communication services using nomadic agent. In: Proceedings of V2VCOM 2006, pp. 1–6 (2006)
Acknowledgment
This research is partially supported by the Grant-in-Aid for Scientific Research (S)(21220002), and (B)(24300037) of the Ministry of Education, Culture, Sports, Science and Technology, Japan.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Goto, K., Sasaki, Y., Hara, T., Nishio, S. (2014). A Mobile Agents Control Scheme for Multiple Sinks in Dense Mobile Wireless Sensor Networks. In: Stojmenovic, I., Cheng, Z., Guo, S. (eds) Mobile and Ubiquitous Systems: Computing, Networking, and Services. MobiQuitous 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 131. Springer, Cham. https://doi.org/10.1007/978-3-319-11569-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-11569-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11568-9
Online ISBN: 978-3-319-11569-6
eBook Packages: Computer ScienceComputer Science (R0)