Social dynamic mesh communication network control method

Abstract

The invention discloses a social dynamic mesh communication network control method, which comprises the following steps of: network initialization and node discovery: when a social network is started, each node starts to broadcast own information, after surrounding nodes receive the broadcast information, the broadcast information is recorded in a local neighbor node list, and the neighbor node list is recorded in a local neighbor node list; initiating a connection request for the resident receiving node meeting the connection condition, and establishing initial social network connection; data transmission: when an initial node needs to send data to a target node, if a path directly leading to the target node exists in a routing table, directly sending a data packet to the target node, and if a direct path does not exist, selecting an optimal next hop node by the routing node according to an intelligent routing algorithm until the data packet reaches the target node; according to the method, the communication efficiency can be remarkably improved, the experience of a user in a high-density interaction environment is optimized, the scalability, the flexibility and the response capability of the network are enhanced, and meanwhile, the safety and the stability of the network are improved.

Description

Technical Field

[0001] The present invention relates to the technical field of communication networks, and particularly to a control method for a social dynamic mesh communication network Background Art With the rapid advancement of urbanization, the population density and degree of functional agglomeration are continuously increasing, and the demand for urban intelligent management is also growing. In large public places where cultural, entertainment, and commercial activities are highly concentrated, people have a very strong demand for real-time interaction

[0002] When traditional centralized infrastructure meets the demands of such high-density urban interaction spaces, many problems are exposed. The centralized network structure can no longer meet the increasingly complex and diverse communication needs, and there is an urgent need for a new network architecture to solve these communication challenges

[0003] The existing technologies have the following problems (1) In terms of scalability, with the sharp increase in the number of users and interaction demands, it is difficult for centralized infrastructure to flexibly expand to adapt to such changes, resulting in network congestion and performance degradation

[0004] (2) In terms of flexibility, its fixed architecture mode cannot be dynamically adjusted according to different scenarios and real-time demands

[0005] (3) In terms of response ability, since all data needs to be processed and forwarded by the central node, there is an obvious delay in information transmission, which cannot meet the timeliness requirements of real-time interaction. These limitations make traditional methods inefficient in high-density interaction environments, and due to excessive reliance on the central node, there are potential security vulnerabilities. Once the central node fails or is attacked, the entire network system may be paralyzed Summary of the Invention The purpose of the present invention is to provide a control method for a social dynamic mesh communication network, which can significantly improve communication efficiency, optimize the user experience in high-density interaction environments, enhance the scalability, flexibility, and response ability of the network, and at the same time improve the security and stability of the network

[0006] To achieve this purpose, the present invention adopts the following technical solutions Provide a control method for a social dynamic mesh communication network, characterized by including the following steps S1: Network initialization and node discovery: When the social network starts, each node begins to broadcast information about its own existence. After the surrounding nodes receive the broadcast information, they record it in the local neighbor node list, and each node evaluates the feasibility of establishing a connection with each neighbor node based on the received neighbor node information. For neighbor nodes that meet the connection conditions, a connection request is initiated to establish an initial social network connection S2: Data Transmission: When the initial node needs to send data to the target node, the initial node checks its own routing table to find the best path to the target node. If there is a direct path to the target node in the routing table, the data packet is directly sent to the target node. If there is no direct path, the routing node selects an optimal next-hop node according to the intelligent routing algorithm. The initial node sends the data packet to the optimal next-hop node. After receiving the data packet, the next-hop node also selects the next-hop node according to its own routing table and algorithm until the data packet reaches the target node.

[0007] As an optimal solution of the social dynamic mesh communication network control method, the nodes include: user nodes, information source nodes, functional module nodes and routing nodes; the user nodes are user mobile terminals, the routing nodes are used to promote and optimize the transmission of network signals, the information source nodes are used to monitor and update the occupancy of parking spaces in the parking lot scenario, and the functional module nodes are used to provide real-time navigation and visual guidance using the received information.

[0008] As an optimal solution of the social dynamic mesh communication network control method, it further includes the following steps: S3: When a new node joins the network, the new node broadcasts its own information. After the surrounding nodes receive the information, they evaluate whether to establish a connection with the new node. If a connection is established, the node updates its own routing table, includes the new node in the neighbor node list, and broadcasts the information of the new node to other neighbor nodes so that other nodes can also update the routing table.

[0009] As an optimal solution of the social dynamic mesh communication network control method, it further includes the following steps: S4: When a node leaves the network, its neighbor nodes will detect the connection interruption, immediately update the routing table, delete the connection information related to the leaving node, and find a new path to replace the original path passing through the leaving node.

[0010] Advantages of the present invention: 1. Improve communication efficiency: The decentralized peer-to-peer structure avoids the bottleneck limitation of the central node. Data can be transmitted in parallel among multiple nodes, allowing flexible, large-scale, real-time data transmission and dynamic resource allocation, greatly shortening the data transmission delay, improving communication efficiency, and being able to quickly respond to users' communication requests and achieve real-time interaction in a high-density interaction environment.

[0011] 2. Enhance scalability: The network can automatically adjust the topology according to the joining and leaving of nodes. The addition of new nodes will not cause too much burden on the entire network, and the network scale can be flexibly expanded to adapt to the growing communication needs in urban areas.

[0012] 3. Improve flexibility: Each node can dynamically adjust its communication strategy according to the surrounding network environment. The network can be adaptively optimized according to different application scenarios and real-time requirements, providing more flexible communication services.

[0013] 4. Optimize the user experience: Fast communication response and stable network connection provide a smoother interaction experience for users in cultural, entertainment, commercial and other activity venues. Whether it is real-time video transmission, online games or mobile payment applications, etc., they can all be better supported.

[0014] 5. Enhance network security: Since there is no single central control point, the risk of the entire network paralysis caused by the failure or attack of the central node is reduced. Even if some nodes have problems, the network can still maintain basic communication functions through the routing and forwarding of other nodes, improving the security and stability of the network.

[0015] 6. Simplify the layout and reduce costs: The decentralization of the node network and the new dynamic mesh communication network control method enable the network to meet the requirements with only common Bluetooth or WIFI communication without the support of external high-speed networks, greatly reducing the complexity of the layout of network hardware devices. Brief Description of the Drawings

[0016] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the embodiments of the present invention will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0017] Figure 1 It is a schematic diagram of the connection of each functional module node described in an embodiment of the present invention; Figure 2 It is a distribution diagram of parking spaces and functional areas in a parking lot described in an embodiment of the present invention; Figure 3 It is the operation interface of the user node program described in an embodiment of the present invention; Figure 4 It is the display effect of the functional node described in an embodiment of the present invention. Detailed Embodiment

[0018] The embodiments of the present disclosure will be described in detail below with reference to the drawings.

[0019] The following specific examples illustrate the embodiments of the present disclosure. Those skilled in the art can easily understand the other advantages and effects of the present disclosure from the content disclosed in this specification. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all of the embodiments. The present disclosure can also be implemented or applied through other different specific embodiments, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of the present disclosure. It should be noted that, without conflict, the following embodiments and the features in the embodiments can be combined with each other. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present disclosure without making creative efforts belong to the scope of protection of the present disclosure.

[0020] An embodiment of the present invention provides a method for controlling a social dynamic mesh communication network, including the following steps: S1: Network initialization and node discovery: When the social network starts, each node begins to broadcast information about its own existence, including the identifiers, communication capabilities, current loads, etc. of various types of nodes. After receiving the broadcast information, the surrounding nodes record it in the local neighbor node list. At the same time, each node evaluates the feasibility of establishing a connection with each neighbor node according to the received neighbor node information and the social objective requirements, such as considering whether the signal strength is sufficient, whether the load of the neighbor node is too high, whether the situation is urgent, etc. For neighbor nodes that meet the connection conditions, the node will actively initiate a connection request to establish an initial social network connection.

[0021] Among them, the nodes adopt a decentralized design: each node can not only send and receive data, but also make intelligent routing and forwarding decisions on the data passing through itself. The nodes are equipped with a sensing module to sense the surrounding network environment and node status in real time, including information such as signal strength and node load. At the same time, the nodes are built-in with intelligent algorithms to dynamically adjust their own communication strategies according to the sensed information, such as selecting the optimal communication path and adjusting the data transmission rate.

[0022] S2: Data Transmission: Assume that node A wants to send data to node B. Node A first checks its own routing table to find the best path to node B. If there is a direct path to node B in the routing table, the data packet is sent directly to node B. If there is no direct path, the routing node selects an optimal next-hop node, such as node C, according to the intelligent routing algorithm (considering factors such as node load and path hops). Node A sends the data packet to node C. After receiving the data packet, node C also selects the next-hop node according to its own routing table and algorithm to continue forwarding the data packet until the data packet finally reaches node B. During the entire transmission process, each node checks the data packet to ensure data integrity. If it is found that the data packet is incorrect, the sending node will be requested to resend it.

[0023] S3: During the operation of the network, other nodes may join or leave, and signal strength may change. When a new node D joins the network, node D broadcasts its own information. After the surrounding nodes receive the information, they evaluate whether to establish a connection with node D. If a connection is established, the node updates its own routing table, includes node D in the neighbor node list, and broadcasts the information of node D to other neighbor nodes so that other nodes can also update their routing tables.

[0024] S4: When node E leaves the network, its neighbor nodes will detect the connection interruption, immediately update the routing table, delete the connection information related to node E, and find a new path to replace the original path passing through node E. At the same time, the node will continuously monitor the signal strength between itself and neighbor nodes. If the signal strength weakens, the node will try to adjust the communication parameters (such as increasing the transmission power, adjusting the frequency, etc.), or find other neighbor nodes with better signals as an alternative path.

[0025] Among them, this design uses wireless communication technology to establish a network containing different peer nodes. These nodes include user nodes, information source nodes, functional module nodes, and routing nodes.

[0026] The user node is the user's mobile phone.

[0027] The routing nodes facilitate and optimize the transmission of network signals to ensure effective data transmission in high-density urban interaction spaces such as parking lots and concert venues.

[0028] The information source node, such as a sensor node, is responsible for real-time monitoring and updating the occupancy status of parking spaces in the parking lot scenario. Subsequently, these updates will be propagated to other nodes in the network.

[0029] The functional module nodes, such as display devices and LED indicators, use the received information to provide real-time navigation and visual guidance. This enables users to quickly find available parking spaces and enhances the overall parking experience.

[0030] Their connection relationship is as Figure 1 shown.

[0031] Node 0 corresponds to the user node, node 1 corresponds to the information source node, node 2 corresponds to the functional module node, and node 3 corresponds to the routing node. These four types of peer nodes establish a small-scale peer-to-peer network ecosystem to facilitate peer-to-peer interaction without relying on a central server. Expanding this network will extend the potential applications of this design to larger-scale scenarios.

[0032] When a user requests navigation to a specific target location (e.g., a parking space near a supermarket or cinema, a concert seat, or other locations based on their specific needs), the system uses sensor nodes distributed throughout the venue to monitor the status of each location in real time. These sensor nodes are equipped with devices such as distance sensors and weight sensors, which can continuously update the occupancy status of each location and transmit this data to the main nodes within the venue.

[0033] The following is a network application case designed according to the social network solution and based on Figure 1 the parking lot of a certain shopping mall, but the implementation manner of the present invention is not limited thereto.

[0034] I. The functional data of each area's parking spaces are as follows: 1. Area A (Module A): 25 numbered parking spaces, and there are a parking lot entrance and a self-service car wash area (west); 2. Area B (Module B): 25 numbered parking spaces, and there are a self-service car wash area (west) and a shopping mall pedestrian entrance (north); 3. Area C (Module C): 25 numbered parking spaces, and there are a shopping mall pedestrian entrance (north) and a parking point redemption area (east): 4. Area D (Module D): 25 numbered parking spaces, and there are a parking point redemption area (east) and a parking lot exit.

[0035] II. Case function implementation According to the shown basic social network architecture, we built a real hardware platform, selected smartphones as user nodes, and developed a WeChat mini-program driven by smartphones, as Figure 3 shown.

[0036] The node module has 521K SRAM on-chip memory and 8M off-chip memory PSRAM, providing rich storage space. Its transmission power is +4Bm, and its mesh transmission distance reaches 100m. The information node source uses ultrasonic parking space sensors, and the node selects the LED display function, which can be configured for each area according to actual needs. The routing node numbers for each social network module are A, B, C, D, and E. Each node has a unique ID value and its application program. User node information is shared with all required nodes through an autonomous connection and disconnection communication interaction mechanism.

[0037] In the experiment, module E is closest to the user node. A, B, C, and D are distributed in different areas of the parking lot. After the autonomous network is powered on, various nodes can freely join or leave. The user first notifies module E through the smartphone that the target area he wants to go to is D. At this time Figure 4 (a) is the destination the user wants to reach. After E obtains the user information, the other 4 user nodes learn about the user's destination through the network. Each node synthesizes the information source node and other nodes with relevant data, and gives the user the best driving route on the function node screen corresponding to their respective areas, as shown in Figure 4 (b) shows that the function node in area B guides the car owner to the best route to area D.

[0038] 1) The ABCD display is a dynamic process: for example, if the E function module node (already in the car) wants to go to area C, the node broadcasts this information to the ABCD function module nodes. After receiving the message, the ABCD module nodes place a screen at the turning or key positions in their respective areas, and the screen tells E how to go. For example, at this time, the display screen corresponding to the B module node shows: Turn left ahead to go to area C.

[0039] 2) Scan the code with the mobile phone, and then a small program interface will pop up (the small program interface includes map guidance, the number of parking spaces, etc.). There can be area selection on it. After manually selecting, it is sent to the E module node through the social network.

[0040] 3) Each information source node in each area accesses the parking space sensor to realize real-time update of the number of parking spaces. Communication can also be achieved between the ABCD module nodes to communicate their respective parking space situations and update their respective databases. 4) Adopt technologies such as license plate recognition and parking space sensors (or other methods) to convey the parking location to the mobile phone through the ABCD module nodes for the car owner to find the car.

[0041] Appendix: Function module node prompt information The ABCD sub-region function module nodes can display three lines of text, and the number of nodes in each region can be easily expanded. Considering the situation of multiple mobile terminals, multiple routing nodes such as FJK can also be added.

[0042] 1) When the E-module node (on the mobile phone) selects Area A A shows: Right side or right transfer to Parking Area A, go forward to the mall pedestrian entrance (north), turn right to go to the self-service car wash area (west); B shows: Turn right and then turn right to go to Parking Area A, turn right to go to the mall pedestrian entrance (north), go straight and turn right to the self-service car wash area (west); C shows: Turn right and then turn right to go to Parking Area A, go straight and the right side is the parking points redemption area (east): Turn right and go straight to the parking exit. D shows: After turning right, go straight to reach Parking Area A; go forward to the parking lot exit; turn right and keep going straight to the self-service car wash area (west); 2) When the E-module node (mobile phone) selects Area B A shows: Go straight to the end and the right side is Parking Area B, go forward to the self-service car wash area (west), go straight and turn right to the mall pedestrian entrance (north); B shows: Right side or right transfer to Parking Area B, turn right to go to the mall pedestrian entrance (north), go straight to the end and turn right to the self-service car wash area (west); C shows: Turn right and go straight to the end and the right side is Parking Area B, turn right and go straight and the right side is the parking points redemption area (east): Go straight to the end is the parking lot exit; D shows: After turning right, go straight and then turn right to reach Parking Area B; go forward to the parking lot exit; turn right and go straight to the end to the self-service car wash area (west).

[0043] 3) When the E-module node (mobile phone) selects Area C A shows: Go straight to the end, turn right to the end to reach Parking Area C, go forward to the self-service car wash area (west), go straight and turn right to the mall pedestrian entrance (north); B shows: Turn right to the end to reach Parking Area C, turn right to go to the mall pedestrian entrance (north), go straight to the end and turn right to the self-service car wash area (west); C shows: Right side or right transfer to Parking Area C, turn right and go straight and the right side is the parking points redemption area (east); go straight to the end is the parking lot exit; D shows: Turn right and then turn right and go straight and the right side is Parking Area C; go forward to the parking lot exit; turn right and go straight to the end to the self-service car wash area (west).

[0044] 4) When the E-module node (mobile phone) selects Area D A shows: Go straight twice, turn right and detour to Parking Area D, go forward to the self-service car wash area (west), go straight and turn right to the mall pedestrian entrance (north); B shows: Turn right to the end and then turn right and go straight to Parking Area D, turn right to go to the mall pedestrian entrance (north), go straight to the end and turn right to the self-service car wash area (west); C shows: Go straight to the end is Parking Area D, turn right and go straight and the right side is the parking points redemption area (east): Go straight to the end is the parking lot exit: D display: Right side or right transfer to the D parking area; go forward to the parking lot exit; turn right and go straight to the self-service car wash area (west).

[0045] In the description of the present invention, it should be understood that the orientation or positional relationship indicated by terms such as "middle", "length", "upper", "lower", "front", "rear", "vertical", "horizontal", "inner", "outer", "radial", "circumferential", etc. is based on the orientation or positional relationship shown in the drawings, and is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation to the present invention.

[0046] In the present invention, unless otherwise clearly specified and limited, the first feature being "on" the second feature may be that the first and second features are in direct contact, or the first and second features are indirectly in contact through an intermediate medium. The meaning of "a plurality" is at least two, such as two, three, etc., unless otherwise clearly and specifically limited.

[0047] In the present invention, unless otherwise clearly specified and limited, terms such as "install", "connect", "couple", "fix", etc. should be understood in a broad sense. For example, it may be a fixed connection, a detachable connection, or integrated; it may be a mechanical connection, an electrical connection, or communicable with each other; it may be directly connected, or indirectly connected through an intermediate medium, and may be the communication inside two elements or the interaction relationship between two elements, unless otherwise clearly limited. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0048] The above is only to illustrate the embodiments of the present invention and is not intended to limit the present invention. For those skilled in the art, any modifications, equivalent replacements, improvements, etc. made without creative efforts within the spirit and principles of the present invention shall be included in the protection scope of the present invention.

Claims

1. A control method for a social dynamic mesh communication network, characterized in that, It includes the following steps: S1: Network initialization and node discovery: When the social network starts, each node begins to broadcast information about its own existence. After receiving the broadcast information, the surrounding nodes record it in the local neighbor node list. Moreover, each node evaluates the feasibility of establishing a connection with each neighbor node based on the received neighbor node information, and initiates a connection request to the neighbor nodes that meet the connection conditions to establish an initial social network connection; S2: Data transmission: When the source node wants to send data to the destination node, the source node checks its own routing table to find the best path to the destination node. If there is a direct path to the destination node in the routing table, the data packet is directly sent to the destination node. If there is no direct path, the routing node selects an optimal next-hop node according to the intelligent routing algorithm. The source node sends the data packet to the optimal next-hop node. After receiving the data packet, the next-hop node also selects the next-hop node according to its own routing table and algorithm until the data packet reaches the destination node.

2. The social dynamic network communication network control method according to claim 1, wherein The nodes include: user nodes, information source nodes, functional module nodes, and routing nodes; the user nodes are user mobile terminals, the routing nodes are used to promote and optimize the transmission of network signals, the information source nodes are used to monitor and update the occupancy of parking spaces in the parking lot scenario, and the functional module nodes are used to provide real-time navigation and visual guidance using the received information.

3. The social dynamic mesh communication network control method according to claim 1, characterized in that It also includes the following steps: S3: When a new node joins the network, the new node broadcasts its own information. After receiving the information, the surrounding nodes evaluate whether to establish a connection with the new node. If a connection is established, the node updates its own routing table, includes the new node in the neighbor node list, and broadcasts the information of the new node to other neighbor nodes so that other nodes can also update their routing tables.

4. The social dynamic network communication network control method according to claim 1, wherein It also includes the following steps: S4: When a node leaves the network, its neighbor nodes will detect the connection interruption, immediately update the routing table, delete the connection information related to the leaving node, and find a new path to replace the original path that passed through the leaving node.

Images