Deterministic Cluster Routing in Wireless Sensor Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cluster-based routing methods in wireless sensor networks, such as LEACH, suffer from inefficiencies due to random variations in the number of clusters and nodes, leading to increased energy consumption and inefficient load balancing.
Innovation Solution
A deterministic cluster-based routing method that uses location-based calculations to determine reference nodes, allocate sensor nodes into constant clusters, and optimize communication paths, thereby eliminating unnecessary control messages and ensuring consistent cluster sizes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If random cluster-based routing (LEACH protocol) is used, then cluster formation is simple and adaptive, but the number of clusters and nodes varies randomly causing inefficient load balancing and increased energy consumption
Solution Approach 1:
The patent changes the parameter of cluster formation from random probabilistic to deterministic based on node location coordinates. By calculating distance from a reference node and using threshold values, the system determines fixed cluster assignments, eliminating random variation and achieving consistent load distribution across rounds.
Solution Approach 2:
The patent performs preliminary calculation of node locations and distances from a reference node before cluster formation. This preliminary action enables deterministic cluster assignment in subsequent rounds, avoiding the need for random cluster head selection and reducing control message overhead.
2Adaptability or versatility
If random cluster-based routing is used, then cluster formation is flexible, but unnecessary control messages are generated causing increased protocol overhead
Solution Approach 1:
The patent changes the cluster formation mechanism from random to deterministic based on location parameters. This eliminates the need for random cluster head elections and associated control messages (ADV, JOIN, TDMA), significantly reducing protocol overhead while maintaining flexible cluster structure.
3Ease of manufacture
If random cluster-based routing is used, then initial setup is simple, but load balancing becomes inefficient due to varying cluster sizes
Solution Approach 1:
The patent changes from random cluster assignment to deterministic assignment based on node location coordinates and distance calculations. This ensures consistent cluster sizes and balanced load distribution across multiple rounds, improving reliability while maintaining simple initial setup procedures.
Data Source
AI summary
The present invention presents a location-based deterministic cluster routing technology that improves energy efficiency in wireless sensor networks. Existing random cluster-based routing technologies allocate the number of clusters and nodes for each round based on probability, but this random algorithm requires unnecessary messages and causes inefficient load balancing. On the other hand, the present invention proposes optimal routing between the head node and the sensing nodes for K clusters for each round by specifying the location of the sensing nodes. As a result, it is possible to innovate load balancing and at the same time extend network lifespan, thereby providing superior competitiveness, compared to existing technologies.