## 5 Solution of the Design and Testing  
### Positioning and Construction  
**Real Case 1. **_Design and Network Architecture of Smart Town._  
1. Mandates of coverage and methodologies of scrutiny. The orchestration of wireless mesh networks typically entails two schemata. One involves the positioning of nodes, the frequency channels allocated to the transceivers mounted on these nodes, the count of transceivers dedicated to inter-node communication, and the routers shouldering the gateway role. Concurrently, an alternative deployment methodology permits nodes to autonomously configure a wireless mesh network. These nodes possess the capability to discern the existence of a wireless mesh network in  
Figure 35: Log forwarding process flowchart. Figure 36: Message queue illustration. their proximity, configure settings automatically, and seamlessly integrate into the wireless network. The evaluation of wireless network deployment necessitates scrutiny on two fronts [56; 57]. Channel allocation  
When optimizing, network throughput stands as a paramount consideration in the wireless network; a node can be equipped with multiple transceivers. ZigBee devices strategically delineate 16 available channels within the frequency spectrum of 2400-2483.5 MHz, employing four-phase modulation direct-sequence spread spectrum technology. Within a multi-channel milieu, a node can adopt two techniques to exploit multi-channel technology as follows:  
* Equip a node with several wireless transceivers, each operating on a channel distinct from the others. * Employ a solitary wireless transceiver on a node that dynamically switches between different channels. The subsequent elucidation delves into two divergent paradigms in reference to planning. Load-aware channel allocation  
A centralized algorithm for channel allocation endeavors to fulfill the network traffic demands of each link, allocating channels based on the anticipated load of each link. The connection's capacity hinges on the channel allocation algorithm [58], dictating how the path is determined. The initial capacity of a connection is computed by dividing the total aggregated channel capacity of the two nodes by the number of other connections within the interference range of the two nodes. Each channel is assumed to operate at 250 kbps in two nodes, with a planned availability of four channels, yielding a total channel capacity of 1000 kbps. If within the radio frequency range of the two nodes, there exist six other links, the initial capacity for the two nodes is calculated as 1000/6 kbps. Channels are allocated based on the acquired expected load and the number of transceivers on each node, ensuring that the available channels on each link are at least commensurate with the anticipated load. In this process, introducing a parameter founded on the \"degree of interference\" implies that the interference range between the two nodes falls within the interference range. If the channel assigned to the link and the channel to be assigned to the link together encompass the total expected load, then, in two nodes with three planned channels, five interference degree values are calculated, and the channel with the lowest interference degree is selected and allocated to the two nodes. If both nodes have received designated channels, prior to data transmission, a check is conducted to ascertain the existence of a common channel. Subsequently, a channel with minimal interference between the two nodes is identified for use. Channel assignments  
In the aforementioned method of channel allocation, to ensure the preservation of the network topology, if the transceivers of two nodes operate on different channels, universality between the two points is forfeited. Hence, a channel allocation method is proposed for connection maintenance, ensuring that the shortest path between any two points in the network remains unaltered post channel allocation. Each node is assigned an initial priority order in a fixed topology, alongside a priority order in a fixed path.