PhilArchive
open access
To Code or Not to Code: When and How to Use Network Coding in Energy Harvesting Wireless Multi-Hop Networks
The broadcast nature of communication in transmission media has driven the rise of network coding’s popularity in wireless networks. Numerous benefits arise from employing network coding in multi-hop wireless networks, including enhanced throughput, reduced energy consumption, and decreased end-to-end delay. These advantages are a direct outcome of the minimized transmission count. This paper introduces a comprehensive framework to employ network coding in these networks. It refines decision-making at coding and decoding nodes simultaneously. The coding-nodes employ optimal stopping theory to find optimal moments for packet transmission. Meanwhile, the decoding-nodes dynamically decide, through SMDP (Semi Markov Decision Process) problem formulation, whether to conserve energy by deactivating radio units or to stay active for improved coding by overhearing packets. The proposed framework, named ENCODE, enables nodes to learn how and when to use network coding over time. Simulation results compare its performance with existing approaches. Our simulation results shed new light on when and how to use network coding in wireless multi-hop networks more effectively.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- To Code or Not to Code: When and How to Use Network Coding in Energy Harvesting Wireless Multi-hop Networks#1064419
- Energy & throughput tradeoff in WSN with network coding#111636
- Towards the design of an energy-aware path selection metric for IEEE 802.11s wireless mesh network#1024470
- Adaptive Channel Hopping for IEEE 802.15. 4 TSCH-Based Networks: A Dynamic Bernoulli Bandit Approach#704653
- Probing for Better Age of Information in Energy-Harvesting Random Access Networks#141448
Record · ID 78329
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive