Wireless Ad-Hoc Network Resource Allocation via Cluster Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless ad-hoc networks, resource allocation becomes inefficient due to increased calculation complexity and energy consumption as the network scale grows, and mobility of nodes requires frequent updates, leading to collisions and power issues.
Innovation Solution
The method involves dividing the network into clusters with elected cluster heads that perform distributed resource allocation, where each cluster collects and shares link information to avoid collisions, using a Broadcast Scheduling Algorithm (BSA) to allocate resources sequentially based on cluster IDs, minimizing complexity and power consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a centralized resource allocation algorithm is used where one node collects all link information, then collision control is improved, but calculation complexity and energy consumption increase sharply
Solution Approach 1:
The patent divides the wireless ad-hoc network into multiple clusters, with each cluster managed by a cluster head. This segmentation allows resource allocation to be performed locally within each cluster rather than centrally for the entire network, significantly reducing calculation complexity while maintaining collision control through localized scheduling.
Solution Approach 2:
The patent introduces cluster heads as intermediary nodes that collect link information from member nodes and perform resource allocation within their respective clusters. This intermediary structure eliminates the need for any single node to handle all network-wide link information, reducing calculation burden while maintaining effective collision control through the intermediary cluster heads.
2Reliability
If resource allocation is renewed frequently to handle node mobility, then communication reliability is improved, but energy consumption increases
Solution Approach 1:
By segmenting the network into clusters, the patent reduces the scope of resource allocation updates. When nodes move, only the local cluster needs to perform re-allocation rather than the entire network, significantly reducing energy consumption while maintaining communication reliability through localized updates.
Solution Approach 2:
The patent performs resource allocation renewal only for affected clusters rather than the entire network. This partial action approach reduces energy consumption by limiting updates to only those areas where node mobility has impacted communication, while still maintaining reliability in the affected regions.
3Area of stationary object
If the network scale increases, then network coverage is improved, but calculation load on individual nodes increases
Solution Approach 1:
The patent segments the large-scale network into multiple clusters, allowing the network to expand coverage while keeping calculation load localized to each cluster head. This segmentation enables the network to scale to larger areas without increasing the calculation burden on any single node, as each node only needs to manage its local cluster.
Solution Approach 2:
The patent introduces a hierarchical dimension to resource allocation, with cluster heads managing local allocation and potential coordination between clusters. This dimensional change from flat centralized allocation to hierarchical distributed allocation allows the network to scale in coverage area while distributing calculation load across multiple levels of the hierarchy.
Data Source
AI summary
Provided is a resource allocation method performed in a wireless network formed of a plurality of nodes, the resource allocation method including the operations of forming clusters and electing cluster heads respectively for the clusters; determining whether a node from among the plurality of nodes forming the wireless network is an edge node; if the node is not the edge node according to a result of the determining, collecting link information related to other nodes in a cluster that comprises the node, and delivering the link information to a cluster head of the cluster; and if the node is the edge node according to a result of the determining, otherwise, obtaining link information and scheduling information from an edge node of another cluster within a communication range with the cluster comprising the edge node, and delivering the link information and scheduling information to the cluster head. The resource allocation method decentralizes a load of calculations to several nodes, wherein the load may be centralized to one node in a large ad-hoc network, so that an energy efficiency of the node may be increased, and since the several nodes sequentially perform simple calculation, a total of the resource allocation time may be reduced.