An efficient data packet iteration and transmission algorithm in opportunistic social networks
- 24 Downloads
Effective data transmission is a key technology in researching opportunistic networks. Increased data packet transmission among nodes can easily cause the death of nodes, especially in social networks environment. However, effective packet transmission is seldom discussed in existing algorithms in opportunistic networks research. In this study, an efficient data packet iteration and transmission (EDPIT) algorithm, which selects data packets via iteration, is proposed to save energy and overhead during transmission. The effective transmission among nodes in this algorithm improves the transmission rate of data packets. With satisfactory results from simulation and comparison with some existing algorithms, the EDPIT algorithm is found to not only reduce energy consumption but also improve the delivery ratio and overhead in opportunistic social networks.
KeywordsOpportunistic social networks Efficient data packet Transmission Iteration
JW, ZC and MZ designed the project and drafted the manuscript, collected the data, wrote the code and performed the analysis. All participated in finalizing and approved the manuscript.
This work was supported in The National Natural Science Foundation of China (61672540);Hunan Provincial Natural Science Foundation of China (2018JJ3299, 2018JJ3682); ChinaPostdoctoral Science Foundation funded project (2017M612586); Foundation of Central SouthUniversity (185684); Major Program of National Natural Science Foundation of China (71633006).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no competing interests (all financial).
- Mayer JM, Hiltz SR, Barkhuus L et al (2016) Supporting opportunities for context-aware social matching: an experience sampling. In: Study. conference on human factors in computing systems. ACM. https://doi.org/10.1145/2858036.2858175
- Nguyen P, Nahrstedt K (2016) Context-aware crowd-sensing in opportunistic mobile social networks. In: IEEE, international conference on mobile ad hoc and sensor systems. IEEE, pp 477–478. https://doi.org/10.1109/MASS.2015.80
- Ristanovic N, Theodorakopoulos G, Le Boudec JY (2012) Traps and pitfalls of using contact traces in performance studies of opportunistic networks. NFOCOM, 2012 Proceedings IEEE. Ieee, pp 1377–1385. https://doi.org/10.1109/INFCOM.2012.6195502
- Wang G, Wang B, Gao Y (2010) Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. In: Proceedings of the IEEE international conference on communications and mobile computing (CMC), vol 3, pp 452–456. https://doi.org/10.1109/CMC.2010.83
- Wu XH, Gu XF, Poslad S (2016) Routing algorithm based on social relations in opportunistic networks. In: International computer conference on wavelet active media technology and information processing. IEEE, pp 146–149. https://doi.org/10.1109/ICCWAMTIP.2015.7493963
- Yuan P, Wang W, Wang C (2015) Poster: an adaptive copy spraying scheme for data forwarding in mobile opportunistic networks. In: Proceedings of the 16th ACM international symposium on mobile ad hoc networking and computing. ACM, pp 377–378. https://doi.org/10.1145/2746285.2764862