An Adaptive and Multi-Service Routing Protocol for Wireless Sensor Networks
Jaydip Sen

TL;DR
This paper introduces an adaptive, query-based routing protocol for wireless sensor networks that dynamically supports multiple Quality of Service levels such as energy efficiency, reliability, and low latency without reconfiguring nodes.
Contribution
It proposes a novel routing algorithm that offers multi-QoS support in WSNs with low computational complexity and no need for reconfiguration or redeployment.
Findings
The algorithm effectively supports various QoS requirements.
Simulation results show improved efficiency over existing routing protocols.
The protocol maintains low computational complexity.
Abstract
Wireless Sensor Networks (WSNs) are highly distributed networks consisting of a large number of tiny, low-cost, light-weight wireless nodes deployed to monitor an environment or a system. Each node in a WSN consists of three subsystems: the sensor subsystem which senses the environment, the processing subsystem which performs local computations on the sensed data, and the communication subsystem which is responsible for message exchange with neighboring sensor nodes. While an individual sensor node has limited sensing region, processing power, and energy, networking a large number of sensor nodes give rise to a robust, reliable, and accurate sensor network covering a wide region. Thus, routing in WSNs is a very important issue. This paper presents a query-based routing protocol for a WSN that provides different levels of Quality of Service (QoS): energy-efficiency, reliability, low…
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.
