Effective Data Dissemination Scheme for Mobile Sink Group in Wireless Sensor Networks 


Vol. 35,  No. 10, pp. 907-914, Oct.  2010


PDF
  Abstract

There have been many routing protocols proposed for data dissemination to mobile sinks in wireless sensor networks (WSNs), and they regard each sink as individually distributed single entity without relationship of each other. Recently, mobile group entities have been introduced in WSNs. A group of mobile sinks stay closely and move together within a specific area. Although the existing routing protocols involved in multicasting can be applied in such a group communication application, they suffer from high congestion and control overhead due to individual location update and data dissemination. In this paper, we propose a data dissemination scheme for a mobile sink group to address this problem. Our proposed scheme first determines the region based on the locations of mobile sinks in a group, and transmits data packets to every mobile sink in the group area through data sharing within the designated area. Simulation results show that our scheme guarantees data delivery to a mobile sink group well.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Lee and S. Kim, "Effective Data Dissemination Scheme for Mobile Sink Group in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 10, pp. 907-914, 2010. DOI: .

[ACM Style]

Hyungjoo Lee and Sang-Ha Kim. 2010. Effective Data Dissemination Scheme for Mobile Sink Group in Wireless Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 35, 10, (2010), 907-914. DOI: .

[KICS Style]

Hyungjoo Lee and Sang-Ha Kim, "Effective Data Dissemination Scheme for Mobile Sink Group in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 10, pp. 907-914, 10. 2010.