Optimization method for wireless mobile network route selection
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
An optimization method and mobile network technology, applied in wireless network protocols, wireless communication, electrical components, etc., can solve problems such as slow topology changes, slow node movement, and no nodes can be found, so as to reduce the possibility of packet loss , Improve delivery success rate, increase the effect of delivery success rate
Inactive Publication Date: 2013-07-10
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF3 Cites 20 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0006] (4) Due to the existence of communication obstacles (such as high-rise buildings, etc.), although the nodes are within the communication range of each other, they cannot communicate;
[0011] (1) Although the processing process converges quickly, the path found is also a relatively short path from the source point to the destination point, but when it is applied to a highly dynamic wireless mobile network, the network topology changes very frequently, especially the node density is not In very large cases, the node moves very fast. Often, before the message is forwarded from the source point to the destination point, the link node has already moved, the link is frequently broken, and the node cannot be found when the message is forwarded, resulting in loss. Bag;
[0012] (2) When the network topology is large or the node density is large, it is unrealistic to know the topology of the entire network in real time, and it will also cause a considerable network load, resulting in network congestion that seriously affects network performance
[0017] (1) When the network nodes are relatively dense, such as the rush hour of commuting vehicles or the bustling area of the city center, the node moves slowly at this time, and the topology changes slowly, but each time a message is forwarded, it still looks for the next hop node through greedy routing , resulting in a lot of unnecessary delivery, increasing network load and delay;
[0018] (2) The right-hand rule in the repair strategy, the selected next-hop node is likely to be forwarded in a direction away from the destination node, increasing the delay, and it is very likely to run out of forwarding time and cause packet loss
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0069] Taking the vehicle-mounted ad hoc network as an example, the specific steps for realizing the routing selection of the present invention are as follows:
[0070] S101: The node receives the unicast message;
[0071] S102: If the destination node of the message is not the current node, routing is required;
[0072] S103: Determine whether the node is in the local area, that is, whether the number of neighbors of the node is greater than or equal to the fixed value Q1 (in this embodiment, Q1 is set to 8), if so, execute S103-1; otherwise, execute S103-2 ;
[0073] S103-1: use Dijkstra algorithm for routing, if the routing fails, indicating that the destination node is not in the local area, then perform step S103-2;
[0074] S103-2: Use the GPCR+ algorithm for routing. If the routing fails (that is, the node fails to deliver the message within the forwarding time of the received message), then execute step S103-3.
[0075] S103-3: Store the message, set a period of tim...
Embodiment 2
[0077] When the distance between the source point and the destination point is too far, due to the influence of the radio propagation distance and the obstruction of obstacles in the urban environment, the packet loss phenomenon will be more serious. The routing algorithm of the present invention can introduce roadside unit RSU for assistance, so as to improve the defect when the source point and the destination point are too far away. RSU only forwards packets in two cases, respectively, when GPCR+ routing and forwarding fall into local optimum, and the distance between source node and destination node is too far, RSU does not participate in the routing selection of local area. There are two types of RSUs introduced in the present invention: ordinary RSUs and central RSUs.
[0078] Ordinary RSU: It consists of a wireless module and a wired module. The wireless module communicates with ordinary vehicles, and the wired part communicates with the central RSU. Its distribution i...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
PUM
Login to view more
Abstract
The invention discloses an optimization method for wireless mobile network route selection, and belongs to the field of wireless mobile networks. The specific technical scheme includes: according to the number of neighbors of network nodes, dynamically defining local areas in a network in real time, partitioning the nodes with the number of the neighbors larger than a defined value into the local areas with large intensity, routing the nodes in the local areas according to network topology of the local areas of current sending nodes and based on a unisource shortest route, and routing the nodes outside the local areas by adoption of a routing protocol based on geographic locations; and if routing fails, the sending nodes store messages to be sent, and after T time, performing the routing selection again. The optimization method for the wireless mobile network routing selection can be applied to high dynamic wireless mobile networks including vehicle-mounted self-organization networks and the like. According to the optimization method for the wireless mobile network routing selection, the routing based on the geographic locations is fully combined with the routing based on the network topology, the routing based on the geographic locations and the routing based on the network topology are called according to occasions, a message delivery success rate is increased, time delay is reduced, and overall performance of the network is enhanced.
Description
technical field [0001] The invention relates to a wireless mobile network, in particular to an optimization method for route selection in a highly dynamic wireless mobile network. Background technique [0002] With the development of wireless mobile networks, various wireless mobile networks are widely used in people's lives, such as vehicular ad hoc networks. As a highly dynamic wireless mobile network, vehicular ad hoc networks have the following salient features: [0003] (1) The distribution of node density is uneven. In different locations and areas, the density distribution of nodes is different in different time periods. For example, the density of nodes is very high in downtown areas and rush hours, while the density of nodes in highways and suburban areas is very small. ; [0004] (2) The network topology changes frequently, and the position change rate of each node depends on the node density in the area where it is located. If the node moves at a high speed, the ...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to view more 
Login to view more