## 5 Solution of the Design and Testing
### Positioning and Construction
The algorithm sequentially assigns the sending and receiving methods to each node device. When all transceivers of a node have been allocated, the priority is elevated to its maximum, as depicted in Figure 37.  
Assume that node A to node E is assigned random priority values ranging from 1 to 5, with node D holding the highest priority. After detecting interference values, the transceiver of node D utilizes channel 1 to connect with node C. Post connection completion, with remaining unconnected transceivers, the connection is passed to the next one with the highest weight without entirely sacrificing flexibility. At this juncture, the c transceiver in node C has used only channel 1, so in Step 2, channel 1 is also employed to connect with the e transceiver in node B. Node B, having lost its elasticity entirely, sees the highest-weighted connection returned to node D, connecting with the g transceiver of node E through channel 2. Eventually, the one with the highest weight returns to node B, employing channel 3 to connect transceivers d and f.  
2. Gateway distribution of routing nodes  
The strategic allocation of gateways necessitates prudent consideration, as an excessive number may amplify the expenses of network deployment. Conversely, an abundance of gateways has the potential to metamorphose into a performance bottleneck, precipitating the tardy conveyance of service data packets or gridlock. In assuming initial knowledge of all node locations, the gateway positions of designated routes, and the traffic requisites for each node, the objective of the gateway placement algorithm is to ascertain which channels can be opened or closed. The algorithm persists its computation until all traffic aligns with user requirements or until the entirety of the traffic conduits is operational. This algorithm, designated the maximum-flow algorithm, computes the cumulative traffic volume [59]. In the network deployment delineated in this investigation, owing to the absence of a substantial need for transmitting an extensive volume of packet messages in response to the tag signals received by each device, and given the vast expanse of the smart community, it is judicious not to predetermine the closure of all gateways and other routing devices, opting instead to activate them as necessary. 3. Positioning principle  
Positioning technologies germane to wireless networks predominantly encompass the utilization of signal strength, denoted as the received signal strength index (RSSI), the Time of Arrival (ToA), the Angle of Arrival (AoA), and the Phase of Arrival (PoA), complemented by an Assisted Global Positioning System (A-GPS). In this architectural framework, location information assumes a pivotal role, ameliorating data dissemination across the wireless network and proficiently regulating packet quantity. Low-power GPS sensing devices designed for expansive environments have been employed, and the ensuing discourse delves into prevailing positioning methodologies. 1. Signal strength positioning  
The envisioned application environment for this case study predominantly embraces outdoor positioning methodologies, primarily within unobstructed, open spaces. Hence, the chosen method entails utilizing the signal transmission strength to calculate distance. Figure 37: Topology connection maintains channel allocation. The signal attenuation model, elucidated in Equation (5), serves as the foundation for estimating the transmission distance based on signal strength. \[PL(d)= \propto\left(\frac{d}{d_{0}}\right)^{n} \tag{5}\]  
Here, PL(d) embodies a function encapsulating the signal attenuation entwined with distance. The variable 'n', typically within the range of 2 to 4, signifies the rate of signal attenuation concerning distance. The estimation of transmission distance is frequently enshrouded in substantial measurement discrepancies, a manifestation induced by a myriad of uncontrollable environmental variables and the intricacies of signal propagation.