Research On Visual Intelligent Parking System In Housing Compounds For Public Parking Spaces

Intelligent parking is an important component of a smart city.However,in the past two decades,due to rapid economic and population growth,some old housing compounds that use public parking spaces have frequently experienced a shortage of parking spaces due to outdated planning,resulting in low parking space utilization rates and poor parking experiences for residents.In order to improve the parking efficiency and space utilization rates for users of public parking spaces in the housing compound,this article designs a visualized intelligent parking system for the housing compounds,which can display the location and status of each parking space in a We Chat mini program,allowing car owners to view the number and location of available parking spaces in the housing compound in real time.The main research contents of this paper are as follows:(1)This thesis proposes a Zigbee channel adaptive selection optimization strategy based on average RSSI to address the problem of Wi-Fi network interference on Zigbee networks within a residential area.The strategy involves the coordinator periodically collecting the instantaneous RSSI values of each node and calculating their average.If the average RSSI falls below a preset threshold within a certain period of time,the channel is adaptively switched to find a more suitable channel for network establishment.Experimental results show that this strategy,based on the traditional CSMA/CA algorithm,not only reduces data collisions on the same channel but also switches the Zigbee network to a better channel,further reducing data conflicts.(2)This thesis addresses the issues of network flooding during route discovery and uneven resource consumption among nodes on the optimal path leading to disconnections in traditional Zigbee routing algorithms.A ZBR(Zigbee Routing with Depth and Probability Factor)improvement algorithm is proposed,which combines node depth judgment and probability factors.In this algorithm,during the route discovery process,the depth of the destination node is determined to limit the broadcast depth of RREQ(Route REQuest)not exceeding the depth of the destination node’s parent node.Additionally,the algorithm calculates and stores the probability factor Pij of the transmission path from node Ni to node Nj in the neighbor table and routing table of node Ni.When a node needs to send data,it selects the next hop node based on the probability path in the routing table.Experimental results show that compared to traditional algorithms,this algorithm can overcome the limitation of storing only the optimal path in the routing table.It stores every probability path in the routing table,thereby reducing the number of dead nodes and improving the average remaining energy ratio.(3)This thesis proposes a visual intelligent parking system based on the We Chat Mini Program platform to address the problem of cumbersome steps for users to obtain non-visual parking space information.The system first uses ultrasonic sensors with sound velocity correction to detect parking space status and establishes a data transmission channel through Zigbee protocol and MQTT protocol.Then,a database table is designed based on an entityrelationship diagram(E-R diagram)to store user,residential area,and parking space information.Furthermore,to further reduce user browsing time,a parking space recommendation algorithm is proposed,which recommends the most suitable vacant parking space based on user login information and highlights it on the parking space interface.Finally,a combination of software and hardware is used to achieve visual representation of parking spaces on the We Chat Mini Program.