Battery-aware super-peer and fountain coding in Java P2P systems

Peer-to-peer (P2P) file sharing protocols like BitTorrent have revolutionized content distribution, but they struggle in disaster scenarios with unreliable connectivity and energy-constrained nodes. We present a Java-based P2P system that enhances BitTorrent with a novel “Disaster Mode” featuring battery-aware super-peer selection and fountain coding. The design elects a well-powered peer as leader, broadcasts redundant encoded chunks, uses sparse acknowledgments (ACKs) to minimize feedback, and seamlessly falls back to standard BitTorrent once networks stabilize. In Disaster Mode, a chosen super-peer with the highest battery coordinates a one-to-many fountain-coded file broadcast, while peers send periodic bitmap ACKs instead of per-chunk ACKs. In tests with 5–50 peers and 0–30% packet loss, the Disaster Mode improved file completion times by up to 2.3x and sustained ~ 25–30% higher throughput under severe loss compared to vanilla BitTorrent. A battery-rich super-peer reduced average completion time by ~ 20% versus a random leader selection. The results demonstrate that integrating an energy-aware hierarchy and rateless coding, a form of rateless erasure code, dramatically increases P2P resilience. The hybrid approach retains BitTorrent’s efficiency in good conditions while enabling robust operation during network disruptions, making it attractive for emergency and mobile scenarios.

Authors

Institutions

Publication Details

Journal
Discover Internet of Things
Published
2025-11-19
DOI
https://doi.org/10.1007/s43926-025-00240-3
Primary Topic
Peer-to-Peer Network Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Battery-aware super-peer and fountain coding in Java P2P systems

Amit Sinhal, Anay Sinhal, Arpana Sinhal
Discover Internet of Things
Peer-to-Peer Network Technologies
article

Battery-aware super-peer and fountain coding in Java P2P systems

Amit Sinhal, Anay Sinhal, Arpana Sinhal
article en

Abstract

Peer-to-peer (P2P) file sharing protocols like BitTorrent have revolutionized content distribution, but they struggle in disaster scenarios with unreliable connectivity and energy-constrained nodes. We present a Java-based P2P system that enhances BitTorrent with a novel “Disaster Mode” featuring battery-aware super-peer selection and fountain coding. The design elects a well-powered peer as leader, broadcasts redundant encoded chunks, uses sparse acknowledgments (ACKs) to minimize feedback, and seamlessly falls back to standard BitTorrent once networks stabilize. In Disaster Mode, a chosen super-peer with the highest battery coordinates a one-to-many fountain-coded file broadcast, while peers send periodic bitmap ACKs instead of per-chunk ACKs. In tests with 5–50 peers and 0–30% packet loss, the Disaster Mode improved file completion times by up to 2.3x and sustained ~ 25–30% higher throughput under severe loss compared to vanilla BitTorrent. A battery-rich super-peer reduced average completion time by ~ 20% versus a random leader selection. The results demonstrate that integrating an energy-aware hierarchy and rateless coding, a form of rateless erasure code, dramatically increases P2P resilience. The hybrid approach retains BitTorrent’s efficiency in good conditions while enabling robust operation during network disruptions, making it attractive for emergency and mobile scenarios.

Discover Internet of ThingsVol. 5(1)
University of Florida (US), Manipal University Jaipur, JK Lakshmipat University (IN)
Openalex Percentile: Top 59%
Peer-to-Peer Network Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.