Implementing A Greedy Chain Routing Technique With Spread Spectrum On Grid-Based WSNs
Hossein Sharifi Noghabi, Arash Ghazi Askar, Arash Boustani, Arash, Moghani, Motahareh Bahrami Zanjani

TL;DR
This paper introduces PGC, a greedy hierarchical routing protocol for grid-based wireless sensor networks that uses Spread Spectrum codes to enhance energy efficiency and robustness, outperforming LEACH in simulations.
Contribution
The paper proposes a novel greedy chain routing method using Spread Spectrum codes for energy-efficient and fault-tolerant wireless sensor networks.
Findings
PGC is more robust than LEACH.
PGC consumes less energy.
PGC shows higher fault tolerance.
Abstract
Wireless Sensor Networks (WSN) are set of energy-limited sensors, which recently have been point of interest due to their vast applications. One of the efficient ways to consume energy in these networks is to utilize optimal routing protocols. In this approach, we proposed a greedy hierarchical chain-based routing method, named, PGC (stands for Persian Greedy Chain) which route the network applying Spread Spectrum codes as a mask given to the grid cells. Due to similarities between the proposed method in this article and LEACH protocol, we compare this routing protocol with the proposed model from diverse aspects in the simulation section such as remaining energy and being fault tolerant and reliable. The results prove that presented method is more robust and efficient.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEnergy Efficient Wireless Sensor Networks · Energy Harvesting in Wireless Networks · Modular Robots and Swarm Intelligence
