{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T10:39:55Z","timestamp":1763548795155,"version":"3.45.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Manipal University Jaipur"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Internet Things"],"DOI":"10.1007\/s43926-025-00240-3","type":"journal-article","created":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T10:36:31Z","timestamp":1763548591000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Battery-aware super-peer and fountain coding in Java P2P systems"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2058-7685","authenticated-orcid":false,"given":"Arpana","family":"Sinhal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8328-2336","authenticated-orcid":false,"given":"Anay","family":"Sinhal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6697-6995","authenticated-orcid":false,"given":"Amit","family":"Sinhal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"key":"240_CR1","unstructured":"Cohen B. Incentives build robustness in bittorrent. Workshop on Economics of Peer-to-Peer systems; 2003."},{"key":"240_CR2","doi-asserted-by":"publisher","unstructured":"Dongyu Q, Srikant R. Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In Proceedings SIGCOMM \u201804. 2004. https:\/\/doi.org\/10.1145\/1015467.1015508","DOI":"10.1145\/1015467.1015508"},{"key":"240_CR3","doi-asserted-by":"crossref","unstructured":"Legout A, Michiardi P. Rarest First and Choke Algorithms Are Enough. ArXiv. 2006. https:\/\/arxiv.org\/abs\/cs\/0609026","DOI":"10.1145\/1177080.1177106"},{"issue":"2","key":"240_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport L. The Part-Time Parliament. ACM Trans Comput Syst. 1998;16(2):133\u201369. https:\/\/doi.org\/10.1145\/279227.279229.","journal-title":"ACM Trans Comput Syst"},{"key":"240_CR5","doi-asserted-by":"publisher","unstructured":"Ongaro D, Ousterhout J. In Search of an Understandable Consensus Algorithm (Raft). In USENIX Annual Technical Conference. 2014; pp. 305\u2013319. https:\/\/doi.org\/10.5555\/2643634.2643666","DOI":"10.5555\/2643634.2643666"},{"key":"240_CR6","unstructured":"Piatek M, Isdal T, Anderson T, Krishnamurthy A, Venkataramani A. Do incentives build robustness in bit torrent. Networked Syst Des Implement. 2007. http:\/\/cs303.stanford.edu\/papers\/BitTyrant.pdf"},{"key":"240_CR7","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285258","author":"W John","year":"1998","unstructured":"John W, Byers M, Luby M, Mitzenmacher, Ashutosh Rege. A digital fountain approach to reliable distribution of bulk data. SIGCOMM Comput Commun Rev. 1998. https:\/\/doi.org\/10.1145\/285243.285258.","journal-title":"SIGCOMM Comput Commun Rev"},{"key":"240_CR8","unstructured":"Michael Luby. LT Codes. In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS \u201802). IEEE Computer Society, USA, 2002;271."},{"key":"240_CR9","doi-asserted-by":"crossref","unstructured":"Shokrollahi A. Raptor codes. IEEE Journals Magazine | IEEE Xplore. 2006. https:\/\/ieeexplore.ieee.org\/document\/1638543","DOI":"10.1109\/TIT.2006.874390"},{"key":"240_CR10","unstructured":"Maymounkov P. Online codes (No. TR2002-833). 2002 https:\/\/pdos.csail.mit.edu\/~petar\/papers\/maymounkov-online.pdf"},{"key":"240_CR11","doi-asserted-by":"publisher","unstructured":"Gkantsidis C, Rodriguez P. Network coding for large scale content distribution. INFOCOM. 2005; Vol. 4, pp. 2235\u20132245. https:\/\/doi.org\/10.1109\/infcom.2005.1498511","DOI":"10.1109\/infcom.2005.1498511"},{"key":"240_CR12","unstructured":"Chou PA, Wu Y, Jain K. Practical Network Coding. Proc. 45th Allerton Conf. on Communication, Control, and Computing. 2007"},{"key":"240_CR13","doi-asserted-by":"crossref","unstructured":"Katti S, Rahul H, Hu W, Katabi D, M\u2019Edard M, Crowcroft J. XORs in the Air: Practical wireless network coding. 2006. http:\/\/nms.csail.mit.edu\/~sachin\/papers\/copesc.pdf","DOI":"10.1145\/1159913.1159942"},{"key":"240_CR14","doi-asserted-by":"publisher","unstructured":"Parisis G, Sourlas V, Katsaros KV, Chai WK, Pavlou G, Wakeman I. Efficient content delivery through fountain coding in opportunistic information-centric networks. 2016. https:\/\/doi.org\/10.1016\/j.comcom.2016.12.005","DOI":"10.1016\/j.comcom.2016.12.005"},{"key":"240_CR15","doi-asserted-by":"publisher","first-page":"103825","DOI":"10.1016\/j.jnca.2024.103825","volume":"223","author":"O Lajam","year":"2024","unstructured":"Lajam O, Mohammed S. Optimizing efficiency of P2P content distribution with network coding: Principles, Challenges, and future directions. J Netw Comput Appl. 2024;223:103825. https:\/\/doi.org\/10.1016\/j.jnca.2024.103825.","journal-title":"J Netw Comput Appl"},{"key":"240_CR16","doi-asserted-by":"publisher","unstructured":"Rathi S, Borkotoky SS. Energy and delay efficient Fountain-Coded file transfer assisted by unreliable feedback. IEEE Netw Lett. 2023;991. https:\/\/doi.org\/10.1109\/LNET.2023.3318790.","DOI":"10.1109\/LNET.2023.3318790"},{"key":"240_CR17","unstructured":"Nilsson Plymoth A, Zhang Z. Energy Savings for Video Streaming Using Fountain Coding. In Proc. 19th ICIN (International Conference on Innovations in Clouds, Internet and Networks), 2016; pp. 264\u2013268. https:\/\/dl.ifip.org\/db\/conf\/icin\/icin2016\/1570252671.pdf"},{"key":"240_CR18","unstructured":"Yang B, Garcia-Molina H. Designing a Super-Peer Network. In Proc. 19th International Conference on Data Engineering (ICDE \u201803) 2003; pp. 49\u201360. http:\/\/ilpubs.stanford.edu:8090\/594\/1\/2003-33.pdf"},{"key":"240_CR19","doi-asserted-by":"publisher","unstructured":"Rollins S, Chang-Yit C. A Battery-Aware algorithm for supporting collaborative applications. In Springer eBooks 2009. pp. 594\u2013608. https:\/\/doi.org\/10.1007\/978-3-642-03354-4_44","DOI":"10.1007\/978-3-642-03354-4_44"},{"key":"240_CR20","unstructured":"Ramakrishnan KK, Yuksel M, Seferoglu H, Chen J. Resilient communication for first responders in disaster management. In Proceedings of the 18th ISCRAM Conference. 2021. https:\/\/idl.iscram.org\/files\/kkramakrishnan\/2021\/2382_K.K.Ramakrishnan_etal2021.pdf"},{"issue":"13","key":"240_CR21","doi-asserted-by":"publisher","first-page":"4484","DOI":"10.3390\/s21134484","volume":"21","author":"H Alanoud Alhussain, Kurdi","year":"2021","unstructured":"Alanoud Alhussain, Kurdi H, Altoaimy L. Managing trust and detecting malicious groups in Peer-to-Peer IoT networks. Sensors. 2021;21(13):4484\u20134484. https:\/\/doi.org\/10.3390\/s21134484.","journal-title":"Sensors"},{"key":"240_CR22","doi-asserted-by":"publisher","first-page":"102419","DOI":"10.1016\/j.jisa.2019.102419","volume":"50","author":"MA Ferrag","year":"2020","unstructured":"Ferrag MA, Maglaras, Leandros, Moschoyiannis S, Janicke H. Deep learning for cyber security intrusion detection: Approaches, Datasets, and comparative study. J Inform Secur Appl. 2020;50:102419. https:\/\/doi.org\/10.1016\/j.jisa.2019.102419.","journal-title":"J Inform Secur Appl"},{"key":"240_CR23","doi-asserted-by":"crossref","unstructured":"Mirsky Y et al. Kitsune: An Ensemble of Autoencoders for Online Network Intrusion Detection. In Proc. 2018 Network and Distributed System Security Symposium (NDSS). 2018 https:\/\/arxiv.org\/abs\/1802.09089","DOI":"10.14722\/ndss.2018.23204"},{"issue":"3","key":"240_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/mprv.2018.03367731","volume":"17","author":"Y Meidan","year":"2018","unstructured":"Meidan Y, et al. N-BaIoT: Network-Based detection of IoT botnet attacks using deep autoencoders. IEEE Pervasive Comput. 2018;17(3):12\u201322. https:\/\/doi.org\/10.1109\/mprv.2018.03367731.","journal-title":"IEEE Pervasive Comput"},{"key":"240_CR25","doi-asserted-by":"publisher","unstructured":"Kevin Fall. A delay-tolerant network architecture for challenged internets. In Proceedings of SIGCOMM \u201803. 2003 https:\/\/doi.org\/10.1145\/863955.863960","DOI":"10.1145\/863955.863960"}],"container-title":["Discover Internet of Things"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43926-025-00240-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43926-025-00240-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43926-025-00240-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T10:36:43Z","timestamp":1763548603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43926-025-00240-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["240"],"URL":"https:\/\/doi.org\/10.1007\/s43926-025-00240-3","relation":{},"ISSN":["2730-7239"],"issn-type":[{"value":"2730-7239","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"17 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable. (This study involved software simulations only, with no human or animal subjects.)","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"137"}}