Cited by 19Peer-to-Peer Network TechnologiesSmart Grid Energy ManagementEnergy Efficiency in Computing

EEP2P: An energy-efficient and economy-efficient P2P network protocol

Zhou, Ziqiao, Xie, Mengjun, Zhu, Ting, Xu, Wei, Yi, Ping, Huang, Zhichuan, Zhang, Qingquan, Xiao, Sheng·2014·International Green Computing Conference

Abstract

Peer-To-Peer (P2P) file-sharing protocols have been widely used for distributing massive data over the Internet. To satisfy the requirement of P2P platforms, like BitTorrent, edge devices have to be powered on continuously to either download files or assist other peers to download files, which could lead to the wasted energy, especially for those time-insensitive files such as online games or high-definition movies. Energy problem is not only related to energy consumption, but also to economic problems in the smart grid area for P2P. In this work, we present a framework combining the Time-Of-Use (TOU) pricing model and P2P protocols in smart grid area. Peers adjust their energy consumption per unit time based on the TOU pricing model automatically, by switching between a dormant state and an active state in accordance with a time schedule sequence. Our simulation results show that our protocol is both economically efficient and energy efficient for transferring files of various sizes on different systems such as Personal Computers (PCs) and mobile devices.

Integrity signals

Registry

Crossref · 10.1109/igcc.2014.7039171

Cites

34 of 34 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Energy efficient hashing algorithms can help extend the battery life of IIoT devices; although SHA-256 is probably the most popular hash algorithm due to Bitcoin, recent alternatives like Scrypt or X11 are faster, so they may reduce mining energy consumption.

    “It is also worth mentioning that energy efficient hashing algorithms can help to extend the battery life of IIoT devices: although SHA-256 is probably the most popular hash algorithm due to Bitcoin, recent alternatives like Scrypt [77] or X11 [78] are faster, so they may reduce mining energy consumption.”
  • P2P communications require edge devices to be powered on continuously, which could lead to waste energy.

    “P2P communications require edge devices that have to be powered on continuously, which could lead to waste energy [191], [192].”

    From A Review on the Use of Blockchain for the Internet of Things (2018) · cites this paper as [191]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Zhou, Z., Xie, M., Zhu, T., Xu, W., Yi, P., Huang, Z., Zhang, Q., & Xiao, S.
Affiliations
  • Shanghai Jiao Tong University (CN)
  • Binghamton University (US)
  • Hunan University (CN)
Venue
International Green Computing Conference
Publisher
IEEE
Published
2014-11
Pages
1-6
OpenAlex
W2061479960
Cited by
19
References
34
Citations by year
2025: 1 · 2024: 1 · 2023: 1 · 2021: 4 · 2020: 3 · 2019: 1 · 2018: 3 · 2017: 3 · 2015: 1 · 2014: 1
FWCI
1.30
Type
conference paper
Language
en
Open access
closed
Locations
International Green and Sustainable Computing Conference (publishedVersion)
Funders
National Science Foundation
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Peer-to-Peer Network Technologies
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Smart Grid Energy Management
  • Physical Sciences › Computer Science › Hardware and Architecture › Energy Efficiency in Computing
Keywords
peer-to-peer file sharing, energy efficiency, time-of-use pricing, smart grid, energy-aware protocols, dormant state, time scheduling, BitTorrent, mobile devices, economic efficiency

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review