MiAN Cluster Partner Selection via Server-Mediated Proximity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing Mobile Internet Access Node (MiAN) Cluster System faces inefficiencies in finding and selecting partners, leading to prolonged time and power consumption during the pairing process due to traditional methods that require sequential channel searches and isolated, sometimes repeated, link layer binding processes.
Innovation Solution
A method involving a server, master MiANs, and slave MiANs with Proximity Interfaces, where the slave MiAN sends a pairing request to the server with geographical location information, receives proximity information about suitable master MiANs, and performs a targeted search on corresponding channels based on predetermined criteria such as distance, bandwidth, and network type to establish a communication connection efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional sequential channel search and binding methods are used, then all possible partners are searched, but the process takes more time and power
Solution Approach 1:
The patent applies preliminary action by having the server pre-calculate and provide proximity information including working channels of potential master MiANs before the slave MiAN begins its search. This allows the slave MiAN to skip unnecessary channel searches and directly attempt binding on the correct channels, significantly reducing pairing time while maintaining reliable partner selection.
Solution Approach 2:
The server acts as an intermediary that receives location information from the slave MiAN, calculates proximity to multiple master MiANs, and returns filtered proximity information. This intermediary processing eliminates the need for the slave MiAN to perform exhaustive sequential searches, resolving the contradiction between thorough search and time efficiency.
2Reliability
If traditional sequential channel search is performed, then all channels are covered, but power consumption increases
Solution Approach 1:
The server performs preliminary calculation of proximity information and working channels before the slave MiAN initiates binding. This pre-computation allows the slave MiAN to restrict its search to only the necessary channels, dramatically reducing power consumption during the pairing process while ensuring binding success on the correct channels.
Solution Approach 2:
The patent extracts only the relevant working channels from the complete set of possible channels by using the server's proximity calculation. The slave MiAN takes out and searches only on these extracted channels rather than all channels, reducing power consumption while maintaining binding success rate.
3Reliability
If exhaustive partner search is performed, then no suitable partner is missed, but the process becomes more complex
Solution Approach 1:
The server as an intermediary handles the complex task of calculating proximity to multiple master MiANs and determining working channels. This shifts the computational complexity from the slave MiAN to the server, simplifying the slave MiAN's pairing process while ensuring complete and accurate partner finding through the server's comprehensive calculations.
Solution Approach 2:
The server performs preliminary proximity calculations and channel determination before the slave MiAN needs to search. This pre-computation of partner information simplifies the subsequent binding process for the slave MiAN, reducing complexity while maintaining complete partner finding coverage.
4Reliability
If binding is attempted on incorrect channels, then partner selection may be rejected, but channel search time increases
Solution Approach 1:
The server performs preliminary determination of the correct working channels based on proximity calculations before the slave MiAN attempts binding. This ensures the slave MiAN searches only on the correct channels from the beginning, eliminating time wasted on incorrect channel searches and ensuring binding operation success.
Data Source
AI summary
Finding and selecting partners in a MiAN Cluster system is accomplished by a slave, a pairing request for requesting a pairing with a master to a server; receiving, by the slave, proximity information returned from the server based on the pairing request, the proximity information including information of working channels of a proximity interface of the master of the first kind, the master of the first kind being a master determined by the server according to the first geographical location and a geographical location of a master of the second kind previously obtained and supporting a clustering function where a distance between it and the slave meets a predetermined threshold; performing, by the slave, search on the corresponding channels according to the proximity information, and establishing a communication connection with the proximity interface of the master when a master is found.