Abstract
Current research on routing in wireless sensor computing concentrates on increasing the service lifetime, enabling scalability for large number of sensors and supporting fault tolerance for battery exhaustion and broken nodes. A sensor node is naturally exposed to various sources of unreliable communication channels and node failures. Sensor nodes have many failure modes, and each failure degrades the network performance. This work develops a novel mechanism, called Reliable Routing Mechanism (RRM), based on a hybrid cluster-based routing protocol to specify the best reliable routing path for sensor computing. Table-driven intra-cluster routing and on-demand inter-cluster routing are combined by changing the relationship between clusters for sensor computing. Applying a reliable routing mechanism in sensor computing can improve routing reliability, maintain low packet loss, minimize management overhead and save energy consumption. Simulation results indicate that the reliability of the proposed RRM mechanism is around 25% higher than that of the Dynamic Source Routing (DSR) and ad hoc On-demand Distance Vector routing (AODV) mechanisms.
Highlights
Recent advances in MEMS (Micro-Electro-Mechanical Systems) technology and wireless communications have led to small and low-cost sensors with increasingly powerful processing and networking capabilities
The reliability of data delivery for Reliable Routing Mechanism (RRM) improved between 25% and 43%, which is higher than that of Ad hoc On-demand Distance Vector routing (AODV) and Dynamic Source Routing (DSR) mechanism
The Reliable Routing Mechanism (RRM) combining the merits of cluster structure and reliability essential is proposed in this study
Summary
Recent advances in MEMS (Micro-Electro-Mechanical Systems) technology and wireless communications have led to small and low-cost sensors with increasingly powerful processing and networking capabilities. Routing protocols for ad hoc networks are generally classified into three parts, namely on-demand, table-driven and hybrid. The latency of discovering the routing path is low in table-driven routing protocols, the amount of control packets along with new or broken nodes generates a high network overhead. The structure reduces the overhead of the network and bandwidth usage, saving energy, and is appropriate for a wireless sensor computing. This study proposes a novel mechanism involving a hybrid cluster-based routing protocol for sensor computing that selects the most reliable routing path. The proposed mechanism can improve routing reliability, maintain low packet loss, minimize management overhead and save energy consumption.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
