CN110769479A

CN110769479A - High-efficiency new-generation wireless network communication method

Info

Publication number: CN110769479A
Application number: CN201910891747.3A
Authority: CN
Inventors: 王晓喃; 殷旭东; 郑金龙
Original assignee: Changshu Institute of Technology
Current assignee: Changshu Institute of Technology
Priority date: 2019-09-20
Filing date: 2019-09-20
Publication date: 2020-02-07
Anticipated expiration: 2039-09-20
Also published as: CN110769479B

Abstract

The invention discloses a high-efficiency new generation wireless network communication method, wherein the new generation wireless network comprises a router and nodes; the router comprises a backbone router and an access router; the backbone router is provided with more than two upstream interfaces and more than two downstream interfaces, the upstream interfaces are connected with the backbone router, and the downstream interfaces are connected with the access router; the interfaces of the backbone router are all wired interfaces; the access router is provided with an upstream interface and a downstream interface, the upstream interface is connected with the backbone router, the downstream interface is connected with the node, the upstream interface is a wired interface, and the downstream interface is a wireless interface; each node is configured with a wireless interface to link with an access router or other nodes. The invention can effectively shorten the delay and the cost for obtaining the service data, improve the service quality, can be applied to the fields of road condition monitoring, environment monitoring, health care and the like, and has wide application prospect.

Description

High-efficiency new-generation wireless network communication method

Technical Field

The invention relates to a communication method, in particular to an efficient new generation wireless network communication method.

Background

In recent years, much research effort has been devoted to new generation wireless networks to enable rapid acquisition of network services through the new generation wireless networks. With the development of the new generation wireless network, the new generation wireless network will become a mode for providing services in the future.

At present, the realization mode of a new generation wireless network is realized by broadcasting, so that the delay and the cost are both large, and the network service performance is reduced. Therefore, how to reduce the delay and cost of providing data by a new generation wireless network becomes a hot issue of research in recent years.

Disclosure of Invention

The purpose of the invention is as follows: the technical problem to be solved by the present invention is to provide an efficient new generation wireless network communication method for overcoming the defects of the prior art.

The technical scheme is as follows: the invention discloses a high-efficiency new generation wireless network communication method, wherein the new generation wireless network comprises a router and nodes; the router comprises a backbone router and an access router;

the backbone router is provided with more than two upstream interfaces and more than two downstream interfaces, the upstream interfaces are connected with the backbone router, and the downstream interfaces are connected with the access router; the interfaces of the backbone router are all wired interfaces;

the access router is provided with an upstream interface and a downstream interface, the upstream interface is connected with the backbone router, the downstream interface is connected with the node, the upstream interface is a wired interface, and the downstream interface is a wireless interface;

each node is provided with a wireless interface which is linked with an access router or other nodes;

an access router and a plurality of nodes form a sub-network, and the nodes are closest to the access router in all the access routers; a backbone router, all access routers linked with the backbone router and all nodes of a sub-network where the access routers are located form a domain;

each interface is uniquely identified by an interface ID, and the interface with the interface ID of x is abbreviated as an interface x;

each access router and backbone router has coordinates of network uniqueness;

each access router and node has a network-unique hardware ID, such as a MAC address;

each node has an address containing a domain prefix, a subnet prefix, and a node ID; the domain prefix is the coordinate of a backbone router of a domain where the node is located, the subnet prefix is the coordinate of an access router of a subnet where the node is located, and the node ID is the hardware ID of the node;

messages within the new generation wireless network are defined by message types, as shown in the following table:

message type value	Message name
		1	Backbone messages
2	Access messages
		3	Node messages
4	Registration message
		5	Request message
6	Response message

The backbone router stores a backbone table, and one backbone table item comprises a coordinate field, an interface ID field and a life cycle; the backbone message comprises a message type and a coordinate value; periodically, backbone router BR1 performs the following operations:

step 101: starting;

step 102: backbone router BR1 sends a backbone message from each upstream interface with a message type value of 1 with the coordinates of backbone router BR 1;

step 103: the neighbor backbone router checks the backbone table after receiving the backbone message from the interface f1, if a backbone table entry exists and the coordinate of the backbone table entry is equal to the coordinate of the backbone message, executing step 104, otherwise executing step 105;

step 104: the neighboring backbone router receiving the backbone message from the interface f1 selects a backbone table entry, the coordinate of which is equal to the coordinate of the backbone message, sets the interface ID of the backbone table entry to f1, sets the life cycle to the maximum value, and executes step 106;

step 105: a neighboring backbone router receiving the backbone message from an interface f1 creates a backbone table entry, the coordinate of the backbone table entry is equal to the coordinate of the backbone message, the interface ID of the backbone table entry is set to f1, and the life cycle is set to the maximum value;

step 106: and (6) ending.

The backbone router establishes a backbone table through the process so as to record the coordinates and the interface ID of the neighbor backbone router, so that the backbone router selects an optimal neighbor backbone router as the next hop to reach the target backbone router according to the coordinates so as to construct an optimal routing path; the backbone router realizes the correct forwarding of the message according to the interface ID of the neighbor backbone router, thereby realizing the correct data communication.

In the method of the invention, a backbone router stores an access list, and one access list item comprises an interface ID, coordinates and a life cycle; the access message comprises a message type and a coordinate; the access router AR1 is linked with the backbone router BR1, and the access router AR1 periodically performs the following operations:

step 201: starting;

step 202: the access router AR1 sends an access message from the upstream interface, wherein the message type value of the access message is 2, and the coordinate is the coordinate of the access router AR 1;

step 203: after receiving the access message from the interface f2, the backbone router BR1 checks the access table, determines whether there is an access table entry, the coordinate of the access table entry is equal to the coordinate of the access message, if yes, step 204 is executed, otherwise step 205 is executed;

step 204: the backbone router BR1 receiving the access message from the interface f2 selects an access table entry, the coordinate of which is equal to the coordinate of the access message, sets the interface ID of the access table entry to f2, sets the lifetime to the maximum value, the maximum value of the lifetime generally ranges from 500ms to 1s, and executes step 206;

step 205: the backbone router BR1 which receives the access message from the interface f2 creates an access table item, the coordinate of the access table item is equal to the coordinate of the access message, the interface ID of the access table item is set to f2, and the life cycle is set to the maximum value;

step 206: and (6) ending.

The access router establishes an access table through the process so as to record the coordinates and the interface ID of the connected access router, so that the backbone router can select an optimal access router as the next hop to reach the destination node according to the coordinates so as to construct an optimal routing path; and the backbone router realizes the correct forwarding of the message according to the interface ID of the access router, thereby realizing the correct data communication.

In the method, each node stores a neighbor table, and one neighbor table item comprises a hardware ID, a coordinate and a life cycle; the node message contains a message type, coordinates and a hardware ID; the node ND1 periodically performs the following operations:

step 301: starting;

step 302: the node ND1 sends a node message whose message type value is 3 and whose coordinates and hardware ID are the coordinates and hardware ID of the node ND1, respectively;

step 303: after receiving the node message, the neighbor node checks the neighbor table, and judges whether a neighbor table entry exists, wherein the hardware ID of the neighbor table entry is equal to the hardware ID of the node message, if so, step 304 is executed, otherwise, step 305 is executed;

step 304: the neighbor node receiving the node message selects a neighbor table entry, the hardware ID of which is equal to the hardware ID of the node message, sets the coordinate of the neighbor table entry as the coordinate of the node message, sets the life cycle as the maximum value, and executes step 306;

step 305: a neighbor node receiving the node message creates a neighbor table entry, the hardware ID of the neighbor table entry is equal to the hardware ID of the node message, the coordinate of the neighbor table entry is set as the coordinate of the node message, and the life cycle is set as the maximum value;

step 306: and (6) ending.

The node establishes a neighbor table through the process so as to acquire the real-time coordinate and the hardware ID of each neighbor node, so that the node can select an optimal neighbor node as a next hop to reach a target access router according to the real-time coordinate of the neighbor node so as to construct an optimal routing path; since the above process ensures the real-time property of each node coordinate through the life cycle, the correctness of the routing path is also ensured.

In the method of the invention, an access router stores a node table, and the node table comprises coordinates, a hardware ID, an address set and a life cycle; the registration message comprises a message type, a source coordinate, a source hardware ID, a destination coordinate and a destination hardware ID;

each node stores an access router table, and each access router table item comprises a hardware ID and a coordinate;

the node and the router can acquire the coordinates of each router and the hardware ID of each access router through the electronic map; aiming at each access router, a node creates an access router table item, wherein the hardware ID and the coordinate of the access router table item are respectively equal to the hardware ID and the coordinate of the access router; all nodes have the same transmission radius R, and the value range of the transmission radius R is 100m-300 m; presetting an electronic map, wherein the electronic map comprises coordinates of each router and a hardware ID of each access router;

among all the access routers, if the node ND1 is closest to the access router AR1, the node ND1 periodically performs the following operations:

step 401: starting;

step 402: the node ND1 selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the coordinate of the access router AR1, the node ND1 sends a registration message, the message type value of the registration message is 4, the source coordinate and the source hardware ID are respectively the coordinate of the node ND1 and the hardware ID, the destination hardware ID is the hardware ID of the neighbor table entry, and the destination coordinate is the coordinate of the access router AR 1;

step 403: judging whether the access router AR1 receives the registration message, if so, executing step 408, otherwise, executing step 404;

step 404: the node receiving the registration message judges whether the hardware ID of the node is equal to the destination hardware ID of the registration message, if so, the step 405 is executed, otherwise, the step 408 is executed;

step 405: the node receiving the registration message judges whether the distance between the coordinate of the node and the target coordinate of the registration message is smaller than or equal to the transmission radius R of the node, if so, the step 406 is executed, otherwise, the step 407 is executed;

step 406: the node receiving the registration message selects an access router table entry, the coordinate of the access router table entry is equal to the destination coordinate of the registration message, the node receiving the registration message updates the destination hardware ID of the registration message to the hardware ID of the access router table entry, forwards the registration message, and executes step 403;

step 407: the node receiving the registration message selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the target coordinate of the registration message, the target hardware ID of the registration message is updated to the hardware ID of the neighbor table entry, the registration message is forwarded, and step 403 is executed;

step 408: the access router AR1 checks the node list after receiving the registration message, if a node list item exists, the hardware ID of the node list item is equal to the source hardware ID of the registration message, the coordinate of the node list item is updated to the source coordinate of the registration message, and the life cycle is set to the maximum value; otherwise, the access router AR1 creates a node table entry, the hardware ID of the node table entry is equal to the source hardware ID of the registration message, the coordinate is the source coordinate of the registration message, the address set is null, and the life cycle is set to the maximum value;

step 409: and (6) ending.

The nodes register to the nearest access router through the process, and the access router can acquire the real-time coordinate and the hardware ID of each node, so that the access router can construct an optimal routing path reaching a destination node according to the real-time coordinate of each node; since the above process ensures the real-time property of each node coordinate through the life cycle, the optimality and correctness of the routing path are also ensured.

In the method, all access routers have the same transmission radius R1, and the value range of the transmission radius R1 is 100m-300 m; the routing path from the access router to the node is represented by an address set, and the address set comprises the hardware ID of the node contained in the path; after the access router AR1 creates the node table, the following operations are performed for each node table entry E1:

step 501: starting;

step 502: the access router AR1 sets an address set variable as1, and the initial value of the address set variable as1 is null; if the distance between the coordinate of the access router AR1 and the coordinate of the node table entry E1 is smaller than or equal to the transmission radius R1 of the access router AR1, executing the step 506, otherwise executing the step 503;

step 503: the access router AR1 selects a node table entry E2, the distance between the coordinate of the node table entry E2 and the coordinate of the access router AR1 is smaller than or equal to the transmission radius R1, the distance between the coordinate of the node table entry E2 and the coordinate of the node table entry E1 is the closest, and the access router AR1 adds the hardware ID of the node table entry E2 into the address set variable as1 and takes the hardware ID as the last element;

step 504: the access router AR1 selects a node table entry E3, and the hardware ID of the node table entry E3 is equal to the last element of the address set variable as 1; if the distance between the coordinates of the node table entry E3 and the coordinates of the node table entry E1 is smaller than or equal to the transmission radius R1, executing the step 506, otherwise executing the step 505;

step 505: the access router AR1 selects a node table entry E4, the distance between the coordinate of the node table entry E4 and the coordinate of the node table entry E3 is smaller than or equal to the transmission radius R1, and the distance between the coordinate of the node table entry E4 and the coordinate of the node table entry E1 is closest, the access router AR1 adds the hardware ID of the node table entry E4 into the address set variable as1 and uses the hardware ID as the last element, and step 504 is executed;

step 506: the access router AR1 adds the hardware ID of the node table entry E1 into the address set variable as1 as the last element, and sets the address set of the node table entry E1 as the value of the variable as 1;

step 507: and (6) ending.

The access router establishes the optimal routing path reaching the node through the process, the routing path is established through the node table entry in the process, and the real-time coordinates of each node are stored in the node table entry, so that the optimal routing path reaching the destination node by the access router is ensured, and the data communication performance is improved.

In the method of the invention, under the condition that the node ND1 is closest to the access router AR1, the node ND2 is closest to the access router AR2, and the access router AR1 and the access router AR2 are connected with the backbone router BR1, the node ND1 realizes the communication with the node ND2 through the following processes;

the request message comprises a message type, a source address, a destination hardware ID and an address set; the response message contains a message type, a source address, a destination hardware ID, an address set and a load;

step 601: starting;

step 602: the node ND1 constructs an address for the node ND2 and the node ND1 respectively, wherein in the address of the node ND1, the domain prefix is 0, the subnet prefix is the coordinate of the access router AR1, and the hardware ID is the hardware ID of the node ND 1; in the address of the node ND2, the node ID is equal to the hardware ID of the node ND2, and both the subnet prefix and the domain prefix are 0; the node ND1 selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the coordinate of the access router AR1, the node ND1 sends a request message, the message type value of the request message is 5, the source address is the address of the node ND1, the destination address is the address of the node ND2, the destination hardware ID is equal to the hardware ID of the neighbor table entry, and the address set is null;

step 603: if the access router AR1 receives the request message, step 608 is executed, otherwise step 604 is executed;

step 604: the node receiving the request message judges whether the hardware ID of the node is equal to the destination hardware ID of the request message, if so, the step 605 is executed, otherwise, the step 608 is executed;

step 605: the node receiving the request message judges whether the distance between the coordinate of the node and the subnet prefix of the source address of the request message is smaller than or equal to the transmission radius R of the node, if so, the step 606 is executed, otherwise, the step 607 is executed;

step 606: the node receiving the request message selects an access router entry, the coordinate of the access router entry is equal to the subnet prefix of the source address of the request message, the node receiving the request message updates the destination hardware ID of the request message to the hardware ID of the access router entry, forwards the request message, and executes step 603;

step 607: the node receiving the request message selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the subnet prefix distance of the source address of the request message, the node receiving the request message updates the destination hardware ID of the request message to the hardware ID of the neighbor table entry, forwards the request message, and executes step 603;

step 608: the access router AR1 receives the request message and forwards the request message from the upstream interface; after receiving the request message, the backbone router BR1 acquires the coordinate of the node ND2 through the positioning service, wherein the coordinate is closest to the access router AR 2; the backbone router BR1 sets the subnet prefix of the destination address of the request message as the coordinate of the access router AR 2; the backbone router BR1 looks up the access list, selects an access list item, the coordinate of the access list item is equal to the subnet prefix of the request message destination address, and forwards the request message from the interface identified by the interface ID of the access list item; after receiving the request message, the access router AR2 selects a node entry, the hardware ID of which is equal to the node ID of the destination address of the request message, sets the address set of the request message as the address set of the node entry, and forwards the request message from the downstream interface;

step 609: any node receiving the request message judges whether the hardware ID of the node is equal to the first element of the address set of the request message, if so, the step 610 is executed, otherwise, the step 612 is executed;

step 610: the node receiving the request message deletes the first element from the request message address set, if the request message address set is empty, if yes, step 612 is executed, otherwise step 611 is executed;

step 611: the node receiving the request message forwards the request message, and executes step 609;

step 612: the node receiving the request message constructs a response message, the message type value of the response message is 6, the source address is equal to the destination address of the request message, the destination address is equal to the source address of the request message, the address set is empty, and the load is response data; the node receiving the request message selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the subnet prefix distance of the response message source address, the target hardware ID of the response message is set as the hardware ID of the neighbor table entry, and the node sends the response message;

step 613: if the access router AR2 receives the response message, go to step 618, otherwise go to step 614;

step 614: the node receiving the response message judges whether the hardware ID of the node is equal to the destination hardware ID of the response message, if so, the step 615 is executed, otherwise, the step 623 is executed;

step 615: the node receiving the response message judges whether the distance between the coordinate of the node and the subnet prefix of the source address of the response message is smaller than or equal to the transmission radius R of the node, if so, the step 616 is executed, otherwise, the step 617 is executed;

step 616: the node receiving the response message selects an access router entry, the coordinate of the access router entry is equal to the subnet prefix of the source address of the response message, the destination hardware ID of the response message is updated to the hardware ID of the access router entry, the response message is forwarded, and step 613 is executed;

step 617: the node receiving the response message selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the subnet prefix distance of the source address of the response message, the destination hardware ID of the response message is updated to the hardware ID of the neighbor table entry, the response message is forwarded, and step 613 is executed;

step 618: after receiving the response message, the access router AR2 forwards the response message from the upstream interface; after receiving the response message, backbone router BR1 selects an access table entry, the coordinate of which is equal to the subnet prefix of the destination address of the response message, and backbone router BR1 forwards the response message from the interface identified by the interface ID of the access table entry; after receiving the response message, the access router AR1 selects a node table entry, the hardware ID of the node table entry is equal to the node ID of the destination address of the response message, the access router AR1 sets the address set of the response message as the address set of the node table entry, and forwards the response message from the downstream interface;

step 619: after the node receives the response message, if the hardware ID of the node is equal to the first element of the address set of the response message, step 620 is executed, otherwise step 622 is executed;

step 620: the node receiving the response message deletes the first element from the address set of the response message, if the address set of the response message is empty, step 622 is executed, otherwise step 621 is executed;

step 621: the node receiving the response message forwards the response message, and step 619 is executed;

step 622: the node ND1 that received the response message saves the data in the response message;

step 623: and (6) ending.

The nodes obtain data from local through the process, and the access router stores the route path reaching each node, so that the data can be obtained without establishing a route in the data communication process, and the data communication delay and cost are greatly reduced.

In the method of the invention, under the condition that the node ND1 is closest to the access router AR1, the access router AR1 is connected with the backbone router BR1, the node ND3 is closest to the access router AR3, and the access router AR3 is connected with the backbone router BR3, the node ND1 realizes the communication with the node ND3 through the following processes:

step 701: starting;

step 702: the node ND1 constructs an address for the node ND3 and the node ND1 respectively, wherein in the address of the node ND1, the domain prefix is 0, the subnet prefix is the coordinate of the access router AR1, and the hardware ID is the hardware ID of the node ND 1; in the address of the node ND3, the node ID is equal to the hardware ID of the node ND3, and both the subnet prefix and the domain prefix are 0; the node ND1 selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the coordinate of the access router AR1, the node ND1 sends a request message, the message type value of the request message is 5, the source address is the address of the node ND1, the destination address is the address of the node ND3, the destination hardware ID is equal to the hardware ID of the neighbor table entry, and the address set is null;

step 703: if the access router AR1 receives the request message, step 708 is performed, otherwise step 704 is performed;

step 704: the node receiving the request message judges whether the hardware ID of the node is equal to the destination hardware ID of the request message, if so, the step 705 is executed, otherwise, the step 708 is executed;

step 705: the node receiving the request message checks whether the distance between the coordinate of the node and the subnet prefix of the source address of the request message is smaller than or equal to the transmission radius R of the node, if so, the step 706 is executed, otherwise, the step 707 is executed;

step 706: the node receiving the request message selects an access router entry, the coordinate of the access router entry is equal to the subnet prefix of the source address of the request message, the node receiving the request message updates the destination hardware ID of the request message to the hardware ID of the access router entry, forwards the request message, and executes step 703;

step 707: the node receiving the request message selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the subnet prefix distance of the source address of the request message, the node receiving the request message updates the destination hardware ID of the request message to the hardware ID of the neighbor table entry, forwards the request message, and executes step 703;

step 708: the access router AR1 receives the request message and forwards the request message from the upstream interface; after receiving the request message, the backbone router BR1 acquires the coordinate of the node ND3 through the positioning service, wherein the coordinate is closest to the access router AR3, and the access router AR3 is closest to the backbone router BR 3; the backbone router BR1 updates the domain prefix of the destination address of the request message into the coordinate of the backbone router BR3, and sets the subnet prefix as the coordinate of the access router AR 3; backbone router BR3 selects a backbone table entry, the coordinate of the backbone table entry is closest to the domain prefix distance of the destination address of the request message, and forwards the request message from the interface identified by the interface ID of the backbone table entry;

step 709: if backbone router BR3 receives the request message, perform step 711, otherwise perform step 710;

step 710: the backbone router receiving the request message selects a backbone table entry, the coordinate of the backbone table entry is closest to the domain prefix distance of the destination address of the request message, the request message is forwarded from the interface identified by the interface ID of the backbone table entry, and step 709 is executed;

step 711: the backbone router BR3 looks up the access list, selects an access list item, the coordinate of the access list item is equal to the subnet prefix of the destination address of the request message, and the backbone router BR3 forwards the request message from the interface identified by the interface ID of the access list item; after receiving the request message, the access router AR3 selects a node table entry, the hardware ID of the node table entry is equal to the node ID of the destination address of the request message, the access router AR3 sets the address set of the request message as the address set of the node table entry, and forwards the request message from the downstream interface;

step 712: any node receiving the request message judges whether its own hardware ID is equal to the first element of the request message address set, if so, step 713 is executed, otherwise, step 729 is executed;

step 713: the node receiving the request message deletes the first element from the request message address set, if the request message address set is empty, execute step 715, otherwise execute step 714;

step 714: the node receiving the request message forwards the request message, and performs step 712;

step 715: the node receiving the request message constructs a response message, the message type value of the response message is 6, the source address is equal to the destination address of the request message, the destination address is equal to the source address of the request message, the address set is empty, and the load is response data; the node receiving the request message selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the subnet prefix distance of the response message source address, the target hardware ID of the response message is set as the hardware ID of the neighbor table entry, and the node sends the response message;

step 716: if the access router AR3 receives the response message, step 721 is performed, otherwise step 717 is performed;

step 717: the node receiving the response message judges whether the hardware ID of the node is equal to the destination hardware ID of the response message, if so, the step 718 is executed, otherwise, the step 729 is executed;

step 718: the node receiving the response message checks whether the distance between the coordinate of the node and the subnet prefix of the source address of the response message is smaller than or equal to the transmission radius R of the node, if so, the step 719 is executed, otherwise, the step 720 is executed;

step 719: the node receiving the response message selects an access router entry, the coordinate of the access router entry is equal to the subnet prefix of the source address of the response message, the node receiving the response message updates the destination hardware ID of the response message to the hardware ID of the access router entry, forwards the response message, and executes step 716;

step 720: the node receiving the response message selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the subnet prefix distance of the source address of the response message, the node receiving the response message updates the destination hardware ID of the response message to the hardware ID of the neighbor table entry, forwards the response message, and executes step 716;

step 721: after receiving the response message, the access router AR3 forwards the response message from the upstream interface; after receiving the response message, backbone router BR3 selects a backbone table entry, the coordinate of which is closest to the domain prefix distance of the destination address of the response message, and backbone router BR3 forwards the response message from the interface identified by the interface ID of the backbone table entry;

step 722: if backbone router BR1 receives the request message, perform step 724, otherwise perform step 723;

step 723: the backbone router receiving the response message selects a backbone table entry, the coordinate of the backbone table entry is closest to the domain prefix distance of the destination address of the response message, the response message is forwarded from the interface identified by the interface ID of the backbone table entry, and step 722 is executed;

step 724: the backbone router BR1 looks up the access table, selects an access table entry, the coordinate of the access table entry is equal to the subnet prefix of the destination address of the response message, and the backbone router BR1 forwards the response message from the interface identified by the interface ID of the access table entry; after receiving the response message, the access router selects a node table entry, the hardware ID of the node table entry is equal to the node ID of the destination address of the response message, the access router sets the address set of the response message as the address set of the node table entry, and forwards the response message from a downstream interface;

step 725: after the node receives the response message, if the hardware ID of the node is equal to the first element of the address set of the response message, execute step 726, otherwise execute step 728;

step 726: the node receiving the response message deletes the first element from the address set of the response message, if the address set of the response message is empty, step 728 is executed, otherwise, step 727 is executed;

step 727: the node receiving the response message forwards the response message, and executes step 725;

step 728: the node receiving the response message stores the data in the response message;

step 729: and (6) ending.

The nodes acquire the remote data through the process, and because the access router stores the route path reaching each node, the data can be acquired without establishing the route in the data communication process, and meanwhile, the backbone router establishes the optimal path reaching the target backbone router through the coordinates of the neighbor routers, so that the data communication delay and cost are greatly reduced.

Has the advantages that: the invention provides an efficient new generation wireless network communication method, and a user can quickly acquire data through the efficient new generation wireless network communication method provided by the invention, so that the delay and cost for acquiring service data are effectively shortened, the service quality is improved, the method can be applied to the fields of road condition monitoring, environment monitoring, health care and the like, and has wide application prospect.

Drawings

The foregoing and/or other advantages of the invention will become further apparent from the following detailed description of the invention when taken in conjunction with the accompanying drawings.

Fig. 1 is a flow diagram of constructing a backbone table according to the present invention.

Fig. 2 is a flow chart of the access table construction process according to the present invention.

Fig. 3 is a flow chart of constructing a neighbor table according to the present invention.

Fig. 4 is a schematic diagram of a registration process according to the present invention.

Fig. 5 is a schematic diagram of a route construction process according to the present invention.

Fig. 6 is a schematic diagram of a data communication process according to the present invention.

Fig. 7 is a schematic diagram illustrating a data communication process between networks according to the present invention.

The specific implementation mode is as follows:

the invention provides an efficient new generation wireless network communication method, and a user can quickly acquire data through the efficient new generation wireless network communication method provided by the invention, so that the delay and cost for acquiring service data are effectively shortened, the service quality is improved, the method can be applied to the fields of road condition monitoring, environment monitoring, health care and the like, and has wide application prospect.

Fig. 1 is a flow diagram of constructing a backbone table according to the present invention. The new generation wireless network comprises a router and a node; the router comprises a backbone router and an access router;

each access router and backbone router has coordinates of network uniqueness;

step 101: starting;

step 106: and (6) ending.

Fig. 2 is a flow chart of the access table construction process according to the present invention. The backbone router stores an access table, and one access table item comprises an interface ID, coordinates and a life cycle; the access message comprises a message type and a coordinate; the access router AR1 is linked with the backbone router BR1, and the access router AR1 periodically performs the following operations:

step 201: starting;

step 204: the backbone router BR1 which receives the access message from the interface f2 selects an access table entry, the coordinate of which is equal to the coordinate of the access message, sets the interface ID of the access table entry to f2, sets the life cycle to the maximum value, the maximum value of the life cycle is set to 500ms-1s, and executes step 206;

step 206: and (6) ending.

Fig. 3 is a flow chart of constructing a neighbor table according to the present invention. Each node stores a neighbor table, and one neighbor table item comprises a hardware ID, a coordinate and a life cycle; the node message contains a message type, coordinates and a hardware ID; the node ND1 periodically performs the following operations:

step 301: starting;

step 306: and (6) ending.

Fig. 4 is a schematic diagram of a registration process according to the present invention. The access router stores a node table, and each node table comprises a coordinate, a hardware ID, an address set and a life cycle; the registration message comprises a message type, a source coordinate, a source hardware ID, a destination coordinate and a destination hardware ID;

step 401: starting;

step 409: and (6) ending.

Fig. 5 is a schematic diagram of a route construction process according to the present invention. All the access routers have the same transmission radius R1, and the value range of the transmission radius R1 is 100m-300 m; the routing path from the access router to the node is represented by an address set, and the address set comprises the hardware ID of the node contained in the path; after the access router AR1 creates the node table, the following operations are performed for each node table entry E1:

step 501: starting;

step 507: and (6) ending.

Fig. 6 is a schematic diagram of a data communication process according to the present invention. Under the conditions that the node ND1 is closest to the access router AR1, the node ND2 is closest to the access router AR2, and the access router AR1 and the access router AR2 are connected with the backbone router BR1, the node ND1 realizes communication with the node ND2 through the following processes;

step 601: starting;

step 623: and (6) ending.

Fig. 7 is a schematic diagram illustrating a data communication process between networks according to the present invention. Under the condition that the node ND1 is closest to the access router AR1, the access router AR1 is connected with the backbone router BR1, the node ND3 is closest to the access router AR3, and the access router AR3 is connected with the backbone router BR3, the node ND1 realizes communication with the node ND3 through the following processes:

step 701: starting;

step 729: and (6) ending.

Example 1

Based on the simulation parameters in table 1, this embodiment simulates an efficient new generation wireless network communication method in the present invention, after the network is started, each backbone router executes step 101-106 to establish a backbone table, so that the backbone router can record the coordinates and interface IDs of neighboring backbone routers through the backbone table, for example, the coordinates are (120,31), the interface is 1, and the life cycle is 500 ms; each access router executes step 201 and step 206 to establish an access table, so that the backbone router can record the coordinates and the interface ID of the connected access router through the access table, for example, the coordinates are (120,31), the interface is 2, and the life cycle is 500 ms; each node executes step 301 and step 306 to establish a neighbor table, so that the node establishes the neighbor table through the above process to obtain the real-time coordinate and the hardware ID of each neighbor node, for example, the coordinate is (120,31), the hardware ID is 0x 00:01:6C:06: a7:3A, and the life cycle is 500 ms. Each node executes

step

401 and 409, and performs registration operation to the nearest access router, so that the access router can establish a node table, for example, the hardware ID in the node table entry is 0x 00:01:6C 06: a7:3A and the coordinates are (120, 31). After the access router establishes the node table, step 501 and step 507 are executed to establish an optimal routing path to the node identified by each node table entry. If the node ND1 is closest to the access router AR1, the node ND2 is closest to the access router AR2, the access router AR1 and the access router AR2 are connected with the same backbone router, and the node ND1 executes the step 601 and the step 623 to realize data communication with the node ND2, firstly, the node ND1 selects an optimal path reaching the access router AR1 by using a neighbor table and forwards a data request message to the access router AR1 through the path, the access router AR1 forwards the data request message to the backbone router through an upstream interface, the backbone router forwards the data request message to the access router AR2 through the access table, and the access router AR2 forwards the data request message to the node ND2 through the established path; the node ND2 selects an optimal path to the access router AR2 by using the neighbor table and forwards the data response message to the access router AR2 through the path, the access router AR2 forwards the data response message to the backbone router through the upstream interface, the backbone router forwards the data response message to the access router AR1 through the access table, and the access router AR1 forwards the data response message to the node ND1 through the established path. If the access router AR1 and the access router AR2 are connected to different backbone routers, then steps 701 and 729 are performed to effect data communication with the node ND 2. If the node ND1 is closest to the access router AR1, the node ND2 is closest to the access router AR2, the access router AR1 and the access router AR2 are connected to the same backbone router, and the node ND1 executes the step 601 and the step 623 to realize data communication with the node ND2, firstly, the node ND1 selects an optimal path to the access router AR1 by using a neighbor table and forwards a data request message to the access router AR1 through the path, the access router AR1 forwards the data request message to the backbone router through an upstream interface, the backbone router forwards the data request message to a router connected to the access router AR2 through the backbone table, the backbone router forwards the data request message to the access router AR2 through the access table, and the access router AR2 forwards the data request message to the node ND2 through the established path; the node ND2 selects an optimal path to the access router AR2 by using the neighbor table and forwards the data response message to the access router AR2 through the optimal path, the access router AR2 forwards the data response message to the backbone router through the upstream interface, the backbone router forwards the data response message to the backbone router connected with the access router AR1 through the backbone table, the backbone router forwards the data response message to the access router AR1 through the access table, and the access router AR1 forwards the data response message to the node ND1 through the established path.

The performance analysis of the data communication method of the wireless network is as follows: when the data transmission amount is large, the network performance is reduced, the data communication delay is improved and reduced, when the data transmission amount is small, the network performance is enhanced, the data communication delay is reduced, and the average delay of data communication is 105 ms.

TABLE 1 simulation parameters

Claims

1. An efficient new generation wireless network communication method is characterized in that the new generation wireless network comprises a router and a node; the router comprises a backbone router and an access router;

each access router and backbone router has coordinates of network uniqueness;

each access router and node has a network-unique hardware ID;

step 101: starting;

step 106: and (6) ending.

2. The method of claim 1, wherein the backbone router maintains an access table, an access table entry comprising an interface ID, coordinates and a lifetime; the access message comprises a message type and a coordinate; the access router AR1 is linked with the backbone router BR1, and the access router AR1 periodically performs the following operations:

step 201: starting;

step 204: the backbone router BR1 receiving the access message from the interface f2 selects an access table entry, the coordinate of which is equal to the coordinate of the access message, sets the interface ID of the access table entry to f2, sets the life cycle to the maximum value, and executes step 206;

step 206: and (6) ending.

3. The method of claim 2, wherein each node stores a neighbor table, a neighbor table entry comprising hardware ID, coordinates and lifecycle; the node message contains a message type, coordinates and a hardware ID; the node ND1 periodically performs the following operations:

step 301: starting;

step 306: and (6) ending.

4. An efficient new generation wireless network communication method as claimed in claim 3, wherein the access router maintains a node table, a node table entry containing coordinates, hardware ID, address set and lifetime; the registration message comprises a message type, a source coordinate, a source hardware ID, a destination coordinate and a destination hardware ID;

the node and the router can acquire the coordinates of each router and the hardware ID of each access router through the electronic map; aiming at each access router, a node creates an access router table item, wherein the hardware ID and the coordinate of the access router table item are respectively equal to the hardware ID and the coordinate of the access router; all nodes have the same transmission radius R;

step 401: starting;

step 409: and (6) ending.

5. The method of claim 4, wherein all access routers have the same radius of transmission R1; the routing path from the access router to the node is represented by an address set, and the address set comprises the hardware ID of the node contained in the path; after the access router AR1 creates the node table, the following operations are performed for each node table entry E1:

step 501: starting;

step 507: and (6) ending.

6. An efficient new generation wireless network communication method as claimed in claim 5, characterized in that under the condition that the node ND1 is nearest to the access router AR1, the node ND2 is nearest to the access router AR2, and the access router AR1 and the access router AR2 are connected to the backbone router BR1, the node ND1 realizes the communication with the node ND2 by the following procedures;

step 601: starting;

step 623: and (6) ending.

7. The method as claimed in claim 6, wherein the node ND1 communicates with the node ND3 by the following procedures under the condition that the node ND1 is closest to the access router AR1, the access router AR1 is connected to the backbone router BR1, the node ND3 is closest to the access router AR3, and the access router AR3 is connected to the backbone router BR 3:

step 701: starting;

step 729: and (6) ending.