Abstract
This paper considers a delay tolerant network, where a message ferry travels multiple isolated clusters, collects data from nodes in the clusters, and finally delivers the data to a sink node. In our previous work, we proposed a self-organized data aggregation technique for collecting data from nodes efficiently, which can automatically accumulate data from cluster members to a limited number of cluster members called aggregators. The proposed scheme was developed based on the evolutionary game theoretic approach, in order to take account of the inherent selfishness of the nodes for saving their own battery life. The number of aggregators can be controlled to a desired value by adjusting the energy that the message ferry supplies to the aggregators. In this paper, we further examine the proposed system in terms of success of data transmission and system survivability. We first introduce a new type of game model with retransmissions. Through both theoretic and simulation approaches, we then reveal feasible parameter settings which can achieve a system with desirable characteristics: Stability, survival, and successful data transfer.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cerf, V., Burleigh, S., Hooke, A., Torgerson, L., Durst, R., Scott, K., Fall, K., Weiss, H.: Delay tolerant network architecture. Work in progress as an IETF RFC 4838 draft, http://www.ietf.org/rfc/rfc4838.txt
Fall, K.: A delay-tolerant network architecture for challenged internets. In: ACM SIGCOMM, pp. 27–34 (2003)
Fall, K., Hong, W.: Custody transfer for reliable delivery in delay tolerant networks. Tech. Rep. IRB-TR-03–030, Intel Research Berkeley (2003)
Kabir, K.H., Sasabe, M., Takine, T.: Evolutionary game theoretic approach to self-organized data aggregation in delay tolerant networks. IEICE Transactions on Communications E93-B(3), 490–500 (2010)
NetLogo, version 4.1, http://ccl.northwestern.edu/netlogo
Nowak, M.A.: Evolutionary dynamics: exploring the equations of life. Harvard University Press (2006)
Ohtsuki, H., Nowak, M.A.: The replicator equation on graphs. Journal of Theoretical Biology 243(1), 86–97 (2006)
Ohtsuki, H., Hauert, C., Lieberman, E., Nowak, M.A.: A simple rule for the evolution of cooperation on graphs. Nature 441(7092), 502–505 (2006)
Zhao, W., Ammar, M., Zegura, E.: A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: ACM MobiHoc, pp. 187–198 (2004)
Zhao, W., Ammar, M., Zegura, E.: Controlling the mobility of multiple data transport ferries in a delay-tolerant network. In: IEEE INFOCOM, pp. 1407–1418 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Kabir, K.H., Sasabe, M., Takine, T. (2012). Self-organized Data Aggregation among Selfish Nodes in an Isolated Cluster. In: Suzuki, J., Nakano, T. (eds) Bio-Inspired Models of Network, Information, and Computing Systems. BIONETICS 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32615-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-32615-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32614-1
Online ISBN: 978-3-642-32615-8
eBook Packages: Computer ScienceComputer Science (R0)