CN108770030B

CN108770030B - Data communication method of next generation wireless network

Info

Publication number: CN108770030B
Application number: CN201810432477.5A
Authority: CN
Inventors: 王晓喃; 程宏斌
Original assignee: Changshu Institute of Technology
Current assignee: Changshu Institute of Technology
Priority date: 2018-05-08
Filing date: 2018-05-08
Publication date: 2020-04-28
Anticipated expiration: 2038-05-08
Also published as: CN108770030A

Abstract

The invention provides a data communication method of a next generation wireless network, wherein the network comprises M domains, M is a positive integer larger than 1, and the area covered by each domain is a rectangle; length d of nth field_nWidth of s_nN is more than or equal to 1 and less than or equal to M, and the coverage area is an abscissa interval [ x%_n,x_n+d_n]And the ordinate interval [ y_n,y_n+s_n]A closed area is formed; a domain includes more than two mobile nodes; the mobile node can acquire the service data from the nearest mobile node in a unicast mode through the mobile wireless network data communication method provided by the invention, thereby shortening the delay and cost for acquiring the service data, improving the service quality.

Description

Data communication method of next generation wireless network

Technical Field

The present invention relates to a communication method, and more particularly, to a data communication method for a next generation wireless network.

Background

Wireless networks enable multi-hop wireless communication from node to node. With the continuous development of wireless network technology and the continuous emergence of various new applications, it is urgently required to improve the data communication performance of the wireless network. In recent years, much research effort has been devoted to wireless network data communication methods to enable mobile nodes to quickly acquire network services. With the development of wireless network technology, a wireless network data communication method will become a mode for providing services in the future.

At present, the implementation mode of wireless network data communication is realized through broadcasting, so that both delay and cost are large, and the network service performance is reduced. Therefore, how to reduce the delay and cost of providing services by wireless networks 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 a data communication method for a next generation wireless network, aiming at the defects of the prior art. The invention realizes data communication through the aggregation table and the unicast mode, and the mobile node can share the requested data from the intermediate node through the aggregation table in the unicast mode, thereby reducing the data communication delay.

The technical scheme is as follows: the invention discloses a data communication method of a next generation wireless network, which is characterized in that the network comprises M domains, wherein M is a positive integer larger than 1, and the area covered by each domain is a rectangle; length d of nth field_nWidth of s_nN is more than or equal to 1 and less than or equal to M, and the coverage area is an abscissa interval [ x%_n,x_n+d_n]And the ordinate interval [ y_n,y_n+s_n]A closed area is formed; a domain includes more than two mobile nodes;

a data is uniquely identified by a name; one name consists of three parts, coordinates, version and name ID;

the mobile node acquires data through messages, wherein one message comprises a source MAC address, a destination MAC address, a final MAC address, a name domain, a message type domain and a load; the message types are shown in the following table:

message type	Message value
		Publishing messages	1
Data request message	2
		Data response message	3
Neighbor messages	4
		New version message	5

Each mobile node maintains a routing table, and one routing table item comprises a name domain, a next hop domain, a distance domain and a destination node domain; the name domain uniquely designates one type of data, the next hop domain is the MAC address of the next hop reaching the destination node, the distance domain is the hop number reaching the destination node, and the destination node domain is the MAC address of the destination node;

when the mobile node P1 is located in the domain D1, the data C1 is uniquely identified by the name NA1, in the name NA1, the coordinates are (x1, y1), the version number is v1, and the name ID is NID1, the mobile node P1 performs the following operations to establish a routing table:

step 101: starting;

step 102: the mobile node P1 sends a release message, the source MAC address of the release message is the MAC address of the mobile node P1, the destination MAC address is null, the final MAC address is the MAC address of the mobile node P1, the name is NA1, the message type is 1, the load is a parameter h, and the initial value of the parameter h is 0;

step 103: after receiving the publish message, the mobile node checks whether the coordinates of the mobile node are located in the domain D1, if so, the step 105 is executed, otherwise, the step 104 is executed;

step 104: the mobile node receiving the publish message discards the publish message, and performs step 110;

step 105: the mobile node receiving the release message increments the parameter h in the release message load by 1 and checks a routing table; if a routing table entry exists, the name field value of the routing table entry is equal to the name field value in the release message, the destination node field value is equal to the final MAC address of the release message, and the distance field value is not greater than the value of the parameter h in the release message, then step 110 is executed, otherwise step 106 is executed;

step 106: the mobile node receiving the release message checks a routing table; if a routing table entry exists, the name domain value of the routing table entry is equal to the name domain value in the release message, the destination node domain value is equal to the final MAC address of the release message, and the distance domain value is greater than the value of the parameter h in the release message, executing step 107, otherwise executing step 108;

step 107: the mobile node receiving the release message selects a routing table entry, the name field value of the routing table entry is equal to the name field value in the release message, the destination node field value is equal to the final MAC address of the release message, and the distance field value is greater than the value of the parameter h in the release message, the next hop field value of the routing table entry is updated to the source MAC address in the release message, the distance field value in the routing table entry is updated to the parameter h in the release message, and step 109 is executed;

step 108: the mobile node receiving the release message creates a routing table entry, the name field value of the routing table entry is equal to the name field value in the release message, the destination node field value is equal to the final MAC address of the release message, the next hop field value is equal to the source MAC address in the release message, and the distance field value is equal to the parameter h in the release message;

step 109: the mobile node receiving the release message updates the source MAC address of the release message to its own MAC address, forwards the release message to the neighboring mobile node, and performs step 103;

step 110: and (6) ending.

After the mobile node generates data, the optimal routing table item reaching the mobile node is established through the process, so that other mobile nodes can request and acquire the data through the routing table item.

In the method of the invention, each mobile node maintains an aggregation table, and each aggregation table item comprises a name domain, a previous hop domain, a distance domain and a source node domain;

each mobile node maintains a data table, and each data table item comprises a name field and a data value field;

data C1 is uniquely identified by name NA1, in name NA1, coordinates (x1, y1), coordinates (x1, y1) are located in domain D1, version v1, name ID NID 1; the mobile node M1 is located in the domain D1, the mobile node M1 needs to obtain the data C1, first look up the routing table, if the name field value of any routing table entry in the routing table is not equal to NA1, the mobile node M1 obtains the data C1 by the following procedures:

step 201: starting;

step 202: the mobile node M1 sends a data request message, in the data request message, the source MAC address is the MAC address of the mobile node M1, the destination MAC address is null, the name is NA1, the message type is 2, the final MAC address is null, the load is the MAC address of the mobile node M1 and the parameter h1, and the initial value of the parameter h1 is 1;

step 203: the mobile node receiving the data request message judges whether the mobile node is in the domain D1, if so, executes step 205, otherwise, executes step 204;

step 204: the mobile node receiving the data request message discards the data request message, and performs step 209;

step 205: the mobile node receiving the data request message checks the data table; if there is a data entry whose name field value is equal to the name field value in the data request message, go to step 206, otherwise go to step 207;

step 206: the mobile node receiving the data request message selects a data table entry, the name field value of the data table entry is equal to the name field value in the data request message, the mobile node sends a data response message, the source MAC of the data response message is equal to the MAC address of the mobile node, the destination MAC address is the source MAC address of the data request message, the final MAC address is equal to the MAC address in the data request message payload, the name field value is equal to the name field value in the data request message, the message type is 3, the payload is equal to the data field value in the data table entry, the MAC address of the mobile node and the parameter h2, the initial value of the parameter h2 is 0, execute step 209;

step 207: the mobile node receiving the data request message increments the parameter h1 in the data request message load by 1 to create an aggregation table entry, the name field value of the aggregation table entry is equal to the name field value in the data request message, the previous hop field value is equal to the source MAC address in the data request message, the distance field value is equal to the value of the parameter h1, and the source node field value is equal to the MAC address in the data request message load; if there are more than two aggregation entries with name field values equal to the name of the data request message, go to step 209, otherwise go to step 208;

step 208: the mobile node receiving the data request message updates the source MAC address of the data request message to its own MAC address, sends the data request message, and performs step 203;

step 209: the mobile node receiving the data response message checks whether the MAC address of the mobile node is equal to the destination MAC address in the data response message, if so, the step 211 is executed, otherwise, the step 210 is executed;

step 210: the mobile node receiving the data response message discards the data response message, and performs step 216;

step 211: the mobile node receiving the data response message increments the parameter h2 in the data response message by 1 and checks the routing table; if there is a routing table entry, the name field value of the routing table entry is equal to the name field value in the data response message, the destination node field value is equal to the MAC address in the data response message payload, and the distance field value is not greater than the parameter h2 in the data response message, go to step 213, otherwise go to step 212;

step 212: the mobile node receiving the data response message checks the routing table; if a routing table entry exists, the name field value of the routing table entry is equal to the name field value in the data response message, the destination node field value is equal to the MAC address in the data response message load, and the distance field value is greater than the parameter h2 in the data response message, the mobile node updates the next hop field value of the routing table entry to the source MAC address of the data response message, and updates the distance field value of the routing table entry to the value of the parameter h2 in the data response message; otherwise, the mobile node creates a routing table entry, the name field value of the routing table entry is equal to the name field value in the data response message, the destination node field value is equal to the MAC address in the data response message load, the distance field value is equal to the parameter h2 in the data response message, and the next hop field value is the source MAC address of the data response message;

step 213: if the MAC address of the mobile node receiving the data response message is equal to the final MAC address in the data response message, performing step 215, otherwise performing step 214;

step 214: the mobile node receiving the data response message checks the aggregation table, selects all aggregation table entries with the name domain value equal to the name domain value of the data response message, and performs the following operations for each selected aggregation table entry: the mobile node creates a routing table entry, the name domain value of the routing table entry is equal to the name domain value of the aggregation table entry, the next hop domain value is equal to the previous hop domain value of the aggregation table entry, the distance domain value is equal to the distance domain value of the aggregation table entry, and the destination node domain value is equal to the source node domain value of the aggregation table entry; the mobile node updates the destination MAC address of the data response message to the previous hop threshold of the aggregation table entry, finally updates the MAC address threshold to the source node threshold of the aggregation table entry, updates the source MAC address threshold to the MAC address of the mobile node, sends the data response message, deletes the aggregation table entry, and performs step 209;

step 215: the mobile node receiving the data response message stores the data in the data response message;

step 216: and (6) ending.

Under the condition that the name field value of any routing table entry in the routing table is not equal to NA1, the mobile node can still acquire the requested data through the above process, the mobile node realizes data communication through the aggregation table and the data table, and the mobile node can acquire the requested data from the mobile node closest to the local domain in a unicast mode through the data table, so that the data communication delay is reduced; in addition, the mobile node can share data from the intermediate nodes in the local domain through the aggregation table, so that the data communication delay is further reduced.

In the method of the present invention, in the condition that the data C1 is uniquely identified by the name NA1, in the name NA1, the coordinates are (x1, y1), the coordinates (x1, y1) are located in the domain D1, the version is v1, and the name ID is NID1, the mobile node M1 is located in the domain D1, the mobile node M1 needs to obtain the data C1, first, look up the routing table, if at least one routing table entry whose name domain value is equal to the name NA1 exists, the mobile node M1 obtains the data C1 through the following procedures:

step 301: starting;

step 302: the mobile node M1 selects a routing table entry, the name field value of the routing table entry is equal to NA1, and sends a data request message, in the data request message, the source MAC address is the MAC address of the mobile node M1, the destination MAC address is the next hop field value of the routing table entry, the final MAC address is equal to the destination node field value of the routing table entry, the name is NA1, the message type is 2, the load is the MAC address of the mobile node M1 and the parameter h1, and the initial value of the parameter h1 is 1;

step 303: the mobile node receiving the data request message judges whether its own MAC address is equal to the destination MAC address in the data request message, if so, performs step 305, otherwise, performs step 304;

step 304: the mobile node that received the data request message discards the data request message, and performs step 309;

step 305: the mobile node receiving the data request message checks the data table; if there is a data entry whose name field value is equal to the name field value in the data request message, go to step 306, otherwise go to step 307;

step 306: the mobile node receiving the data request message selects a data table entry, the name field value of the data table entry is equal to the name field value in the data request message, the mobile node sends a data response message, the source MAC of the data response message is equal to the MAC address of the mobile node, the destination MAC address is the source MAC address of the data request message, the final MAC address is equal to the MAC address in the data request message payload, the name field value is equal to the name field value in the data request message, the message type is 3, the payload is equal to the data field value in the data table entry, the MAC address of the mobile node and the parameter h2, the initial value of the parameter h2 is 0, execute step 309;

step 307: the mobile node receiving the data request message increments the parameter h1 in the data request message load by 1 to create an aggregation table entry, the name field value of the aggregation table entry is equal to the name field value in the data request message, the previous hop field value is equal to the source MAC address in the data request message, the distance field value is equal to the value of the parameter h1, and the source node field value is equal to the MAC address in the data request message load; if there are more than two aggregation entries with name field values equal to the name of the data request message, go to step 309, otherwise go to step 308;

step 308: the mobile node receiving the data request message selects a routing table entry, the name field value of the routing table entry is equal to the name of the data request message and the destination node field value is equal to the final MAC address of the data request message, the destination MAC address of the data request message is updated to the next hop of the routing table entry, the source MAC address of the data request message is updated to the MAC address of the mobile node, the data request message is sent, and step 303 is executed;

step 309: the mobile node receiving the data response message checks whether the MAC address of the mobile node is equal to the destination MAC address in the data response message, if so, the step 311 is executed, otherwise, the step 310 is executed;

step 310: the mobile node receiving the data response message discards the data response message, and performs step 316;

step 311: the mobile node receiving the data response message increments the parameter h2 in the data response message by 1, and checks the routing table; if there is a routing table entry whose name field value is equal to the name field value in the data response message, destination node field value is equal to the MAC address in the data response message payload, and distance field value is not greater than the parameter h2 in the data response message, go to step 313, otherwise go to step 312;

step 312: the mobile node receiving the data response message checks the routing table; if a routing table entry exists, the name field value of the routing table entry is equal to the name field value in the data response message, the destination node field value is equal to the MAC address in the data response message load, and the distance field value is greater than the parameter h2 in the data response message, the mobile node updates the next hop field value of the routing table entry to the source MAC address of the data response message, and updates the distance field value of the routing table entry to the value of the parameter h2 in the data response message; otherwise, the mobile node creates a routing table entry, the name field value of the routing table entry is equal to the name field value in the data response message, the destination node field value is equal to the MAC address in the data response message load, the distance field value is equal to the parameter h2 in the data response message, and the next hop field value is the source MAC address of the data response message;

step 313: judging whether the MAC address of the mobile node receiving the data response message is equal to the final MAC address in the data response message, if so, executing a step 315, otherwise, executing a step 314;

step 314: the mobile node receiving the data response message checks the aggregation table, selects all aggregation table entries with the name domain value equal to the name domain value of the data response message, and performs the following operations for each selected aggregation table entry: the mobile node creates a routing table entry, the name domain value of the routing table entry is equal to the name domain value of the aggregation table entry, the next hop domain value is equal to the previous hop domain value of the aggregation table entry, the distance domain value is equal to the distance domain value of the aggregation table entry, and the destination node domain value is equal to the source node domain value of the aggregation table entry; the mobile node updates the destination MAC address of the data response message to the previous hop domain value of the aggregation table entry, finally updates the MAC address domain value to the source node domain value of the aggregation table entry, updates the source MAC address domain value to the MAC address of the mobile node, sends the data response message, deletes the aggregation table entry, and performs step 309;

step 315: the mobile node receiving the data response message stores the data in the data response message;

step 316: and (6) ending.

Under the condition that the name field value of one routing table entry in the routing table is equal to NA1, the mobile node realizes data communication through the routing table, the aggregation table and the data table, and the mobile node can acquire requested data from the mobile node closest to the local domain in a unicast mode through the routing table and the data table, so that data communication delay is reduced; the mobile node can share data from the intermediate nodes in the local domain through the aggregation table, so that the data communication delay is further reduced.

In the method of the invention, each mobile node maintains a neighbor table, and each neighbor table comprises a coordinate domain, an MAC address domain and a life cycle domain; a mobile node periodically performs the following operations:

step 401: starting;

step 402: the mobile node periodically issues neighbor messages, the source MAC address of the neighbor messages is the MAC address of the mobile node, the destination MAC address and the final MAC address are null, the name field value is null, and the load is the coordinate of the mobile node;

step 403: after receiving the neighbor message, the neighbor mobile node checks a neighbor table; if a neighbor table entry exists, the MAC address domain value of the neighbor table entry is equal to the source MAC address of the neighbor message, the coordinate domain value of the neighbor table entry is updated to be the coordinate value in the neighbor message load, and the life cycle of the neighbor table entry is set to be the maximum value; otherwise, the neighbor mobile node creates a neighbor table entry, the MAC address domain value of the neighbor table entry is equal to the source MAC address of the neighbor message, the coordinate domain value is a coordinate value in the neighbor message load, and the life cycle is set to the maximum value, for example, 100 ms;

step 404: and (6) ending.

If the life cycle decay in one neighbor table entry is 0, the neighbor table entry is deleted.

The mobile node can dynamically maintain the information of the neighbor mobile node in real time through the neighbor table so as to carry out correct communication.

In the method of the present invention, under the condition that data C1 is uniquely identified by name NA1, in name NA1, coordinates are (x1, y1), coordinates (x1, y1) are located in domain D1, version is v1, name ID is NID1, domain D2 is a neighbor domain of domain D1, and mobile node M2 is located in domain D2, mobile node M2 acquires data C1 by the following procedures:

step 501: starting;

step 502: the mobile node M2 checks the neighbor table, selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the coordinate in the name NA1, the mobile node M2 sends a data request message, in the data request message, the source MAC address is the MAC address of the mobile node M2, the destination MAC address is the MAC address of the selected neighbor table entry, the name is NA1, the message type is 2, the final MAC address is empty, and the load is the MAC address of the mobile node M2;

step 503: the mobile node receiving the data request message judges whether the MAC address of the mobile node is equal to the destination MAC address in the data request message, if so, the step 505 is executed, otherwise, the step 504 is executed;

step 504: the mobile node receiving the data request message discards the data request message, and performs step 511;

step 505: the mobile node receiving the data request message judges whether the mobile node is located in the domain D2, if so, executes step 506, otherwise, executes step 507;

step 506: the mobile node receiving the data request message creates an aggregation table entry, the name field value of the aggregation table entry is equal to the name field value in the data request message, the previous hop field value is equal to the source MAC address in the data request message, the distance is equal to 0, and the source node field value is equal to the MAC address in the data request message load; the mobile node selects a neighbor table entry, the coordinate of the neighbor table entry is closest to the coordinate in the name field value of the data request message, the destination MAC address in the data request message is updated to the coordinate value of the neighbor table entry, the source MAC address is updated to the MAC address of the mobile node, the data request message is sent, and step 503 is executed;

step 507: the mobile node receiving the data request message checks the data table; if there is a data entry whose name field value is equal to the name field value in the data request message, go to step 508, otherwise go to step 509;

step 508: a mobile node receiving a data request message selects a data table entry, the name field value of the data table entry is equal to the name field value in the data request message, sends a data response message, the source MAC of the data response message is equal to the MAC address of the mobile node, the destination MAC address is the source MAC address of the data request message, the final MAC address is equal to the MAC address in the data request message load, the name field value is equal to the name field value in the data request message, the message type is 3, the load is equal to the data field value of the data table entry in the data table entry, the MAC address of the mobile node and a parameter h3, and the initial value of the parameter h3 is 0, and then step 511 is executed;

step 509: the mobile node receiving the data request message creates an aggregation table entry, the name field value of the aggregation table entry is equal to the name field value in the data request message, the previous hop field value is equal to the source MAC address in the data request message, the distance field value is equal to 0, and the source node field value is equal to the MAC address in the data request message load; if there are more than two aggregation entries with name field values equal to the name of the data request message, go to step 511, otherwise go to step 510;

step 510: the mobile node receiving the data request message selects a routing table entry, the name field value of the routing table entry is equal to the name of the data request message and the destination node field value is equal to the final MAC address of the data request message, the destination MAC address of the data request message is updated to the next hop of the routing table entry, the source MAC address of the data request message is updated to the MAC address of the mobile node, the data request message is sent, and step 503 is executed;

step 511: the mobile node receiving the data response message checks whether the own MAC address is equal to the destination MAC address in the data response message, if so, executes step 513, otherwise, executes step 512;

step 512: the mobile node that received the data response message discards the data response message, and performs step 519;

step 513: determining whether the mobile node receiving the data response message is located in the domain D1, if so, performing step 514, otherwise, performing step 516;

step 514: the mobile node receiving the data response message increments the parameter h3 in the data response message by 1, and checks the routing table; if there is a routing table entry, the name field value of the routing table entry is equal to the name field value in the data response message, the destination node field value is equal to the MAC address in the data response message payload, and the distance field value is not greater than the parameter h3 in the data response message, go to step 516, otherwise go to step 515;

step 515: the mobile node receiving the data response message checks the routing table; if a routing table entry exists, the name field value of the routing table entry is equal to the name field value in the data response message, the destination node field value is equal to the MAC address in the data response message load, and the distance field value is greater than the parameter h3 in the data response message, the mobile node updates the next hop field value of the routing table entry to the source MAC address of the data response message, and updates the distance field value of the routing table entry to the value of the parameter h3 in the data response message; otherwise, the mobile node creates a routing table entry, the name field value of the routing table entry is equal to the name field value in the data response message, the destination node field value is equal to the MAC address in the data response message load, the distance field value is equal to the parameter h3 in the data response message, and the next hop field value is the source MAC address of the data response message;

step 516: judging whether the MAC address of the mobile node receiving the data response message is equal to the final MAC address in the data response message, executing step 518, otherwise executing step 517;

517: the mobile node receiving the data response message checks the aggregation table, selects all aggregation table entries with the name domain value equal to the name domain value of the data response message, and performs the following operations for each selected aggregation table entry: the mobile node updates the destination MAC address of the data response message to the previous hop domain value of the aggregation table entry, finally updates the MAC address domain value to the source node domain value of the aggregation table entry, updates the source MAC address domain value to the MAC address of the mobile node, sends the data response message, deletes the aggregation table entry, and performs step 511;

step 518: the mobile node receiving the data response message stores the data in the data response message;

step 519: and (6) ending.

The mobile node can acquire remote data of different domains through the routing table, the aggregation table and the data table, the mobile node can acquire requested data from the mobile node closest to other domains in a unicast mode through the routing table, the mobile node can acquire data from the mobile node closest to the local domain or other domains in a unicast mode through the data table, and the mobile node can share data from intermediate nodes in the local domain or other domains through the aggregation table, so that data communication delay is reduced.

In the method of the present invention, when a mobile node P1 is located in a domain D1, a data C1 is uniquely identified by a name NA1, in the name NA1, coordinates are (x1, y1), a version number is v1, a name ID is NID1, after a mobile node P1 issues the data C1, the data C1 is updated, the updated data is the data C2, a data C2 is uniquely identified by the name NA2, in the name NA2, coordinates are (x1, y1), the version number is v2, the name ID is NID1, and the mobile node P1 performs the following operations to update a routing table:

step 601: starting;

step 602: the mobile node P1 sends a new version message, the source MAC address of the new version message is the MAC address of the mobile node P1, the destination MAC address is null, the final MAC address is the MAC address of the mobile node P1, the name is NA2, the message type is 5, the load is the name NA1 and the parameter h, and the initial value of the parameter h is 0;

step 603: after receiving the new version message, the mobile node checks whether the coordinates of the mobile node are located in the domain D1, if so, the step 605 is executed, otherwise, the step 604 is executed;

step 604: the mobile node that received the new version message discards the new version message, and performs step 611;

step 605: the mobile node receiving the new version message increments the parameter h in the new version message load by 1 and checks a data table, and if one data table item exists and the name of the data table item is equal to the name in the new version message load, the data table item is deleted; the mobile node checks the routing table, if a routing table item exists, the name domain value of the routing table item is equal to the name domain value in the new version message, and the routing table item is deleted;

step 606: the mobile node receiving the new version message checks the routing table, if a routing table entry exists, the name domain value of the routing table entry is equal to the name domain value in the new version message, the destination node domain value is equal to the final MAC address in the new version message, and the distance domain value is not greater than the value of the parameter h in the new version message, then step 611 is executed, otherwise step 607 is executed;

step 607: the mobile node receiving the new version message checks the routing table; if a routing table entry exists, the name domain value of the routing table entry is equal to the name domain value in the new version message load, the destination node domain value is equal to the final MAC address of the new version message, and the distance domain value is greater than the value of the parameter h in the new version message, executing step 608, otherwise executing step 609;

step 608: the mobile node receiving the new version message selects a routing table entry, the name domain value of the routing table entry is equal to the name domain value in the new version message, the destination node domain value is equal to the final MAC address of the new version message, and the distance domain value is greater than the value of the parameter h in the new version message, the next hop domain value of the routing table entry is updated to the source MAC address in the new version message, the distance domain value in the routing table entry is updated to the parameter h in the new version message, and step 610 is executed;

step 609: the mobile node receiving the new version message creates a routing table entry, the name field value of the routing table entry is equal to the name field value in the new version message load, the destination node field value is equal to the final MAC address of the new version message, the next hop field value is equal to the source MAC address in the new version message, and the distance field value is equal to the parameter h in the new version message;

step 610: the mobile node receiving the new version message updates the source MAC address of the new version message to its own MAC address, forwards the new version message to the neighboring mobile node, and performs step 603;

step 611: and (6) ending.

The mobile node can rapidly update the routing table through the process, thereby updating the data version and establishing a routing path reaching the mobile node, and ensuring that the mobile node can rapidly and correctly acquire the required data.

Has the advantages that: the invention provides a data communication method of a next generation wireless network, a mobile node can acquire service data from a nearest mobile node in a unicast mode through the data communication method of the next generation wireless network, the delay and the cost of acquiring the service data are shortened, the service quality is improved, and the data communication method can be applied to the fields of road condition monitoring, vehicle management 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 schematic flow chart of establishing a routing table according to the present invention.

Fig. 2 is a schematic diagram of intra-domain data communication flow according to the present invention.

Fig. 3 is a schematic diagram of a data acquisition process according to the present invention.

Fig. 4 is a schematic flow chart of establishing a neighbor table according to the present invention.

Fig. 5 is a schematic diagram of an inter-domain data communication flow according to the present invention.

Fig. 6 is a flow chart of the update routing table according to the present invention.

The specific implementation mode is as follows:

the invention provides a data communication method of a next generation wireless network, a mobile node can acquire service data from a nearest mobile node in a unicast mode through the data communication method of the next generation wireless network, the delay and the cost of acquiring the service data are shortened, the service quality is improved, and the data communication method can be applied to the fields of road condition monitoring, vehicle management and the like, and has wide application prospect.

Fig. 1 is a schematic flow chart of establishing a routing table according to the present invention. The network comprises M domains, wherein M is a positive integer greater than 1, and the area covered by each domain is rectangular; length d of nth field_nWidth of s_nN is not less than 1 and not more than M, whichThe coverage area is an abscissa interval [ x ]_n,x_n+d_n]And the ordinate interval [ y_n,y_n+s_n]A closed area is formed; a domain includes more than two mobile nodes;

step 101: starting;

step 110: and (6) ending.

Fig. 2 is a schematic diagram of intra-domain data communication flow according to the present invention. Each mobile node maintains an aggregation table, and each aggregation table item comprises a name domain, a previous hop domain, a distance domain and a source node domain;

step 201: starting;

step 216: and (6) ending.

Fig. 3 is a schematic diagram of a data acquisition process according to the present invention. When the data C1 is uniquely identified by a name NA1, in the name NA1, the coordinates are (x1, y1), the coordinates (x1, y1) are located in the domain D1, the version is v1, and the name ID is NID1, the mobile node M1 is located in the domain D1, the mobile node M1 needs to obtain the data C1, first, look up the routing table, and if at least one routing table entry exists whose name domain value is equal to NA1, the mobile node M1 obtains the data C1 by the following procedures:

step 301: starting;

step 316: and (6) ending.

Fig. 4 is a schematic flow chart of establishing a neighbor table according to the present invention. Each mobile node maintains a neighbor table, and each neighbor table item comprises a coordinate domain, an MAC address domain and a life cycle domain; a mobile node periodically performs the following operations:

step 401: starting;

step 403: after receiving the neighbor message, the neighbor mobile node checks a neighbor table; if a neighbor table entry exists, the MAC address domain value of the neighbor table entry is equal to the source MAC address of the neighbor message, the coordinate domain value of the neighbor table entry is updated to be the coordinate value in the neighbor message load, and the life cycle of the neighbor table entry is set to be the maximum value; otherwise, the neighbor mobile node creates a neighbor table entry, the MAC address domain value of the neighbor table entry is equal to the source MAC address of the neighbor message, the coordinate domain value is the coordinate value in the neighbor message load, and the life cycle is set to be the maximum value;

step 404: finishing;

Fig. 5 is a schematic diagram of an inter-domain data communication flow according to the present invention. Under the condition that data C1 is uniquely identified by name NA1, in name NA1, the coordinates are (x1, y1), the coordinates (x1, y1) are located in domain D1, the version is v1, the name ID is NID1, domain D2 is a neighbor domain of domain D1, and mobile node M2 is located in domain D2, mobile node M2 acquires data C1 by:

step 501: starting;

step 519: and (6) ending.

Fig. 6 is a flow chart of the update routing table according to the present invention. When the mobile node P1 is located in the domain D1, the data C1 is uniquely identified by the name NA1, in the name NA1, the coordinates are (x1, y1), the version number is v1, the name ID is NID1, after the mobile node P1 issues the data C1, the data C1 is updated, the updated data is the data C2, the data C2 is uniquely identified by the name NA2, in the name NA2, the coordinates are (x1, y1), the version number is v2, the name ID is NID1, and the mobile node P1 performs the following operations to update the routing table:

step 601: starting;

step 611: and (6) ending.

Example 1

Based on the simulation parameters in table 1, the present embodiment simulates a data communication method of a next-generation wireless network in the present invention, and the performance analysis is as follows: when the moving speed is increased, the network performance is reduced, the data acquisition delay is increased, when the moving speed is reduced, the network performance is enhanced, the data acquisition delay is reduced, and the average delay of data acquisition is 0.97 s.

TABLE 1 simulation parameters

The present invention provides a concept of a data communication method of a next generation wireless network, and a plurality of methods and approaches for implementing the technical solution are provided, the above description is only a preferred embodiment of the present invention, it should be noted that, for those skilled in the art, a plurality of improvements and modifications may be made without departing from the principle of the present invention, and these improvements and modifications should also be regarded as the protection scope of the present invention. The components not specified in this embodiment can be implemented by the prior art.

Claims

1. A data communication method of a next generation wireless network is characterized in that the network comprises M domains, M is a positive integer larger than 1, and the area covered by each domain is a rectangle; length d of nth field_nWidth of s_nN is more than or equal to 1 and less than or equal to M, and the coverage area is an abscissa interval [ x%_n,x_n+d_n]And the ordinate interval [ y_n,y_n+s_n]A closed area is formed; a domain includes more than two mobile nodes;

the mobile node acquires data through messages, wherein one message comprises a source MAC address, a destination MAC address, a final MAC address, a name domain, a message type domain and a load; the message types are respectively release message, data request message, data response message, neighbor message and new version message, and the corresponding message values are respectively 1, 2, 3, 4 and 5;

step 101: starting;

step 110: and (6) ending.

2. The method of claim 1, wherein each mobile node maintains an aggregation table, each aggregation table entry comprising a name field, a previous hop field, a distance field, and a source node field;

step 201: starting;

step 216: and (6) ending.

3. The data communication method of the next generation wireless network as claimed in claim 1, wherein, under the condition that the data C1 is uniquely identified by the name NA1, in the name NA1, the coordinates are (x1, y1), the coordinates (x1, y1) are in the domain D1, the version is v1, and the name ID is NID1, the mobile node M1 is in the domain D1, the mobile node M1 needs to obtain the data C1, first look at the routing table, if there is at least one routing table entry whose name domain value is equal to NA1, the mobile node M1 obtains the data C1 by:

step 301: starting;

step 316: and (6) ending.

4. The data communication method of the next generation wireless network according to claim 1, wherein each mobile node maintains a neighbor table, each neighbor table entry comprising a coordinate field, a MAC address field, and a lifetime field; a mobile node periodically performs the following operations:

step 401: starting;

step 404: finishing;

5. The data communication method of the next-generation wireless network according to claim 1, wherein in a condition that the data C1 is uniquely identified by a name NA1, in the name NA1, coordinates (x1, y1), coordinates (x1, y1) are located in a domain D1, version v1, name ID NID1, domain D2 is a neighbor domain of domain D1, and the mobile node M2 is located in domain D2, the mobile node M2 acquires the data C1 by:

step 501: starting;

step 519: and (6) ending.

6. The data communication method of the next generation wireless network as claimed in claim 1, wherein when the mobile node P1 is located in the domain D1, the data C1 is uniquely identified by the name NA1, in the name NA1, the coordinates are (x1, y1), the version number is v1, the name ID is NID1, and after the mobile node P1 issues the data C1, the data C1 is updated, the updated data is the data C2, the data C2 is uniquely identified by the name NA2, in the name NA2, the coordinates are (x1, y1), the version number is v2, the name ID is NID1, and the mobile node P1 performs the following operations of updating the routing table:

step 601: starting;

step 611: and (6) ending.