CN101583172B

CN101583172B - Fast routing method for wireless mesh network

Info

Publication number: CN101583172B
Application number: CN2009101477074A
Authority: CN
Inventors: 李科奕; 陆进; 侯斌
Original assignee: Raynet Technologies Inc
Current assignee: Wuxi Optimum Technology Co., Ltd.
Priority date: 2009-06-17
Filing date: 2009-06-17
Publication date: 2011-03-23
Anticipated expiration: 2029-06-17
Also published as: CN101583172A

Abstract

The invention discloses a fast routing method for a wireless mesh network and aims at solving the problem that the selected path in the existing method is not the optimal path. In the fast routing method for the wireless mesh network, the wireless mesh network comprises a plurality of nodes, and each node is assigned with one position address which comprises the position, corresponding to a reference point, of the node in a network topology structure; and the position address is used as an MAC address to conduct communication according to a predetermined method. The method is applicable to thewireless mesh network of a grid structure and a tree structure.

Description

The quick routing algorithm that is used for based on wireless mesh network

Technical field

The present invention relates to the means of communication between each node in a kind of wireless network, particularly be used for the fast routing method of based on wireless mesh network.

Background technology

A wireless network comprises many radio communication devices (being referred to as node usually), and data send between these nodes and accept.Two kinds of communication modes are arranged between two nodes usually.In mode 1, source node transmits data with the form of packet, directly is sent to destination node.This mode occurs in and ought be in the distance range that can receive data to each other by two nodes, and we are referred to as the communication modes of point-to-point.In mode 2, source node will could be sent to destination node with data by several intermediate nodes (delivery or via node).This mode occurs in source node and the destination node distance exceeds the scope that signal receives, and has node to can be used as relaying between them.

Topology of networks has been described interconnected structure between the node.The routing resource that transmits data between from the source node to the destination node is to select good path that arrives the destination (if not optimum).In order to find a good path between source node and destination node, the wireless communications path system of selection must utilize topology of networks.Similar metaphor be exactly when we from the three unities in city during to another place, we need find best route to arrive the destination from city map.

Addressing method has two kinds, distributed method and centralized approach.In distributed method, addressing method is realized by each node.Particularly, when a node is ready to transmit packets of information (at the source node place), or transfer packets of information (at the via node place), it must determine (1) if destination node with regard under the nigh situation, is directly delivered to destination node (point-to-point) with packet; Perhaps (2) deliver to destination node with packet by some via nodes under the situation away from destination node.In the latter case, must decision use which via node.Distributed addressing method utilizes the address of node to make above-mentioned decision.

In above distributed addressing method, each node all knows how data are delivered to next node, finally arrives the destination.Because each node is only known near own node, the path of Xing Chenging is not necessarily best like this.

Summary of the invention

For overcoming above-mentioned defective, the object of the present invention is to provide a kind of quick routing algorithm that is used for based on wireless mesh network that optimal path can be provided.

For achieving the above object, the present invention is used for the fast routing method of based on wireless mesh network, comprises in this wireless network that a plurality of nodes, each node are assigned with one and comprise this node location address with respect to reference point locations in network topology structure; Described location address is used as MAC Address and is carried out communication according to preordering method.

Further, described preordering method is: arbitrary node compares target node position address and local node location address in this packets of information, and transmits this packets of information according to comparative result after accepting a packets of information.

Further, described preordering method is specially: node transmits this packets of information according to following step after accepting a packets of information:

(1) whether judges this packets of information at present node, if then transmittance process finishes; If not, then change next step over to;

(2) judge whether this destination node belongs to neighbors,, then this packets of information directly is sent to this neighbors if destination node belongs to neighbors; If destination node does not belong to neighbors, by via node this packets of information is sent to the destination so.

Further, described location address comprises three parts, is respectively: be used for define grid regional area network portion, be used for defined node in this zone with respect to the distance part of reference node distance, be used for distinguishing same position arranged the sequence number part of the node of (be identical with respect to the reference node distance).

Further, judge that the method whether destination node belongs to adjacent node is:

(2.1) calculate destination node apart from the difference between the distance part of part and present node,

Delta=(destination node is apart from part)-(current nodal distance part)

Wherein, delta shows two internodal relative distances;

(2.2) one of definition is hop apart from critical value, if delta＜=hop, we just think that destination node belongs to neighbors; Otherwise destination node does not then belong to neighbors.

Further, should be to determine like this apart from critical value hop: the packets of information that this node sent can reach all nodes in the hop scope.

Further, described via node is the node of communicating by letter recently or is apart from the node in the critical value hop.

Further, the method that each node utilizes this address to transmit information is: central controller decides best road, simultaneously routing information is placed in the packets of information; When a node receives this packets of information, the routing information in its sense information bag and correspondingly transmit this packets of information.

Adopt above-mentioned method, advantage be:

(1) many topology of networks characteristics have been utilized, characteristics as lattice structure and tree structured network: this class network all has with respect to the characteristic of a reference point to some directions " extension ", be that each node all has up adjacent node (nearer from reference point than this node) and descending adjacent node (far away from reference point than this node), with the equidistant but different adjacent node of sequence number.(example of face as follows).

(2) above-mentioned topology of networks characteristics have been utilized, in the step of above selection next node, we can allow each node (source node and relaying economize on electricity), when seeking the optimum transfer path, separately according to adjacent upstream node, the situation of descendant node and neighbors (equidistant but the different adjacent node of sequence number) selects next to transmit object quickly and easily.

(3) utilized above-mentioned topology of networks characteristics, when reading of data, can be with the number of the node of route process

According to passing to central controller, improved data read efficient greatly by a packet.

General mesh network algorithm, owing to do not utilize the characteristic of network, the algorithm complexity when network node is a lot, does not only usually reach optimum, and time-consuming, can not satisfy in good time requirement.Algorithm of the present invention utilizes network configuration, and algorithm is simple, and in real time, extensibility is good, is applicable to the network of tens nodes or thousands of nodes.

Description of drawings

Fig. 1 is the wireless network topology structural representation of lattice structure of the present invention (as shown in Figure 1).

Fig. 2 is the wireless network topology structural representation of tree structure of the present invention (as shown in Figure 2).

Fig. 3 is a flow chart of the present invention.

Embodiment

The invention provides a method of packet being delivered to destination node by optimal path from source node.This invention is fit to the wireless network topology structure of lattice structure (as shown in Figure 1) and tree structure (as shown in Figure 2).

In the based on wireless mesh network of the present invention, also be assigned with one outside the identity recognition number (ID) of each node except it and comprise this node location address with respect to reference point locations in network topology structure; This location address has carried the positional information of node in network in network, is used as MAC Address simultaneously in radio communication.Utilize identity recognition number and this location address to carry out communication between each node according to preordering method.

The location address of each above-mentioned node is to confirm like this: we have a reference point at hypothesis in network, this reference point is used for defining the position of other nodes.Usually reference point is positioned on the position of central controller above-mentioned.The complexity of above-mentioned location address can be according to the difference of network, for comparatively simple wireless network, can only comprise node position with respect to the reference node place in this network, just from the distance of reference point; For complicated slightly network, then can increase the node that a part is used for distinguishing the same position position of reference node place (promptly with respect to), even increase a part again and be used for distinguishing different networks.Below we further illustrate in conjunction with Fig. 1 and Fig. 2.

For convenience, we suppose that this address comprises 3 parts: and a_1, a_2, a_3}, certainly, just as above-mentioned said, addressing system is not limited to 3 parts.Wherein, a_1 is used for the regional area of define grid; A_2 be used for defined node in this zone with respect to the position at reference node place, just from the distance of reference point; A_3 is used for distinguishing the node that identical a_2 position is arranged.

Be used as the wireless network example of a lattice structure among Fig. 1 with building, suppose that a wireless device is installed in each room or unit.The address of wireless device is defined as usually that (a_3), wherein a_1 is the numbering of building or the number of building for a_1, a_2, and a_2 is the floor number with respect to ground floor, and a_3 is the room number on each floor.We suppose that reference point is bedroom (1,1,1), and at each tame address, by the address of given each node of above-mentioned rule (wireless device).

Figure 2 shows that the wireless network of a tree structure.This network topology structure has reflected the structure of many industrial systems.An example is exactly the mine, and wireless device is installed in the tunnel in the mine.Wherein address a_1 does not show in this drawing, because all nodes have same a_1.Each node by (a_2, a_3) represented, wherein a_2 represents the distance of nodal distance reference point (1,1), a_3 shows the branch of tree structure.For example, node (3,5) shows that this nodal distance reference node (1,1) is that 4 (=5-1) individual node, and branch is 3; Node (1,11) distance reference node (1,1) is 10 (=11-1) individual node, and in branch 1.

Method for routing of the present invention can adopt distributed algorithm, also can adopt the algorithm of centralization addressing, below we carry out division at these two kinds of algorithms.

Distributed algorithm

For distributed algorithm, each node compares destination information and local information in this packets of information after accepting a packets of information, and how decision transmits this packets of information.

Specifically: node transmits this packets of information (as shown in Figure 3) according to following step after accepting a packets of information:

Above-mentioned neighbors is to judge like this:

We calculate the difference between the a_2 value of destination node and present node:

Delta=(destination node address a_2)-(current total address a_2)

Because showing this nodal distance reference point, the a_2 of node address how far has, so delta shows two internodal relative distances.

We define a critical value is hop.If delta＜=hop, we just think that destination node is near this present node.Otherwise destination node is outside the transmission range of this present node.This critical value hop determines like this: the packets of information that this node sent can reach all nodes in the hop scope.

For example: the destination node address is (1,5,2), and current node address is (1,3,1), critical value hop=1.After destination of node (1,3,1) acceptance was the packets of information of (1,5,2), it found delta=5-3=2＞1.So destination node is not in this neighborhood, thereby via node must be used.

Again for example: if the destination node address is (1,4,3), current total address is (1,3,1), critical value hop=1, and destination node is in this neighborhood so.

Above-mentioned via node can use following method to select:

Method 1: fixed relay method

We distribute the address in such a way certain node:

(a_3), it is corresponding with it always to have a relay node address (a_1, a_2+hop, a_3 ') for a_1, a_2, notices that a_3 and a_3 ' may be different for a given node address.(when a_3) needing a via node, we select node address is that the node of (a_1, a_2+hop, a_3 ') is as via node for a_1, a_2 when this current node.(a_1, a_2 a_3) compare, and via node (a_1, a_2+hop, a_3 ') is more near destination node for via node and current node.Destination node may be in the neighborhood of via node, and also possibility is distant.This via node need find another one more to approach the via node of destination in the later case.Finally, destination node will be in the neighborhood of a via node, the while relay process ends.

For example, the grid network among consideration Fig. 1.Node (1,1,1) enabled node (1,2,1) is as its via node, and node (1,2,1) enabled node (1,3,1) is as its via node, so according to pushing.

Method 2 (relaying recently)

A common node can be remembered above it the node within the critical value hop, sends after a packets of information gives the latter at it.When selecting relaying, it can select the node in any one its critical value hop remembeing.

For example, the grid network among consideration Fig. 1.This be an each household other all be mounted the building of radio node.Choosing node (1,2,1) is example, and node (1,2,1) node knows that the node on it is (1,3,1), (1,3,2), (1,3,3) and (1,3,4).Suppose that node (1,2,1) receives the packets of information of a specified node for (1,4,2), at this moment node (1,2,1) can be from node (1,3,1), selects a via node in (1,3,2), (1,3,3) and (1,3,4).For example, node (1,2,1) selects node (1,3,2) as its via node.

Usually, we will use a via node of communicating by letter recently, because the idle possibility of this node is lower.For example, if node (1,2,1) and node (1,3,3) communicated by letter recently, then node (1,3,3) with selected as via node.

Below we instruct in conjunction with the real work of each node in network the present invention are further described.

We have at first defined those and have come from us and be referred to as to read the control command of central control node of end (reader) and the response instruction of other nodes that we are called user side.We utilize these control commands and response instruction that different application is discussed below.

1.1 command format

We use term " user side " and " node " in this article alternately, " destination " and " destination object ", and " level " and " basal plane ".

(1.1.1READER reading end) issuing command

Instruction	The Type sub-instructions	Function
			TO_CLIENT		Send the client information needed, distributed route selection method.
NET_CONF
				NET_CONF_INIT	Before or after client (node) download, configuration client mac address, distributed route selection method.
	NET_CONF_QUERY	Read client mac address, distributed route selection method.
			TO_CLEINT_FAST
		Send and set the client information needed, use and concentrate routing mode (concentrating method for routing).Client can load (sending together) data at same response data packet (FROM_CLIENT_FAST as follows) when responding in all clients on " routed path ".
				NET_CONF_INIT	Before or after client (node) download, the configuration client mac address uses and concentrates routing mode (concentrating method for routing).
	NET_CONF_QUERY	Read client mac address, use and concentrate routing mode (concentrating method for routing).

1.1.2 user side response instruction

Instruction	Sub-instructions	Function
			FROM_CLIENT
	CLIENT_DATA	Response TO_CLIENT instruction, the family end data of seing a visitor out.
				NET_CONF_SUCCESS	Response NET_CONF instruction or TO_CLIENT_FAST instruction (sub_type NET_CONF_INIT and NET_CONG_QUERY); Send client mac address and client routing iinformation, use distributed route selection method
	FORWARD_ERROR	If client is not read customer command owing to some reasons transmit, the packet of a sub_type turns back to the order end.The order end knows that like this that node is " disconnection has connected "
			FROM_CLIENT_FAST		Respond the TO_CLIENT_FAST instruction; Be transmitted in several node data information on the routed path of appointment.

1.2 netinit and inquiry

Each node has a node label ID (for example, " abcdef ") usually when it is manufactured when coming out.After it is mounted, must a designated MAC Address and the control information of configuration some other.We are called netinit to this process.After the designated MAC Address of node, this MAC Address can be changed or be inquired.

READER uses NET_CONF and instructs and finish initialization or inquiry to a node.After the initialization of this node and inquiry were finished, a response message bag FROM_CLIENT had been with subtype NET_CONF_SUCCESS to be returned.

If because some reason, when a packets of information can not be sent to a client, a FROM_CLIENT response had been with subtype FORWARD_ERROR to be returned.

Before " formal " MAC Address was designated, READER must use one " interim " (or substituting) MAC Address and reach a node.We can use a broadcasting MAC Address (0,0,0) or a MAC Address that produces at random forms following hash function.

3-byte?mac_addr＝hash_func(6-bytes?client?ID).

That hash function is transformed into different Input Address usually is different, the shorter outputs of byte number (possibility that 2 different 6-byte ID are transformed into same 3-byte MAC address is very little).Reader uses identical hash function with client and produces identical MAC Address.Note that the MAC Address at random that hash function produces produces in factory, after a new MAC Address is given to a node first, this at random MAC Address just cannot have been re-used.

Use this method, our initialization in the following manner or inquire a node:

(1) point-to-point: as a reader during near destination node, it is the MAC Address at random that produces of applying broadcasting MAC Address or the hash function MAC Address of coming initialization or inquiry node directly.Use this method, the last relay layer of NET_CONF instruction must be set at and be lower than destination node one deck, is used for representing that reader approaches destination node.For example, if destination node is at 7 layers, then the last relay layer of NET_CONF instruction must be set at 6.How following Example 1 and 2 explanations use the point-to-point netinit that carries out.

(2) use via node and carry out distributed addressing

When a reader kept off in destination node, for example reader was in the outside in building, and destination node is in the layer 6 building.Reader can use via node (for example, the node of ground floor to the layer 5) as relaying and then reach destination node between destination node and the reader.Carry out relaying in order to use intermediate node, reader should carry out initialization near node, uses these nodes then as the remote node of relaying deinitialization.Netinit and inquiry by via node can be finished by disperseing path or concentrated path.Example 3,4,5 and 6 have illustrated netinit and the inquiry that disperses the path.Table 7 and example 5 have illustrated the netinit and the inquiry in concentrated path.

1.2.1Reader the reaction of command N ET_CONF and client instruction

The NET_CONF packets of information

Field	Byte number	Note
			Type
	1	NET_CONF
			Client id
	6
			Sequence_num	1
MAC address (unit, level, sub_level)	3	The MAC Address of destination client
			Last relay level	1	The situation of node front node is told in this territory.
Aternative MAC address	3	Temporary transient MAC Address, the MAC Address of for example broadcasting or dispatch from the factory
			Sub type
	1	NET_CONF_INIT NET_CONG_QUERY
			Data
	2	Not used

The FROM_CLIENT packets of information is as the response of NET_CONF instruction

Field	Byte number	Note
			type
	1	FROM_CLIENT
			client?id	6
sequence_num	1
			MAC?address(unit，level， sub_level)	3	The MAC Address of destination client
not?used	1
			sub?type	1	NET_CONF_SUCCESS FORWARD_ERROR
data?length	1	Current is 17
			data	4+12+1＝17	Local routing table information and customer information

Example

These examples have illustrated how a reader carries out node initializing by the method for point-to-point method or relaying.When using trunking method, near the node of reader must first initialization, initialization node far away successively then.Such order is necessary, because initialization node far away need be apart from the nearer node of reader as relaying.

Example 1: point to point network initialization

Analysis chart 1 supposes that we want to distribute MAC Address (1,1,1) is the 101 room nodes of " abcdef " to ID.Reader produces and sends following packets of information:

Field	Value
		type	NET_CONF
client?id	“abcdef”
		sequence_num	1
MAC?address(unit，level， sub_level)	(1，1，1)
		last?relay?level	0

alternative?MAC?address	(0，0，0)
		sub_type	NET_CONF_INIT
data	2bytes

Here MAC Address (1,1,1) will be imparted into 101 room nodes.Substituting address (0,0,0) is broadcast address.Last relay layer is set to 0, and it is one deck below 101 room nodes.The Reader radio-frequency module can see that destination node layer (=1) is higher than last via node (=0) one deck (meaning that destination node is very near), uses alternative address and can reach 101 room nodes.

When 101 room nodes are received this broadcast message, can see that this client id is identical with its client id, thereby give MAC Address to it with MAC Address (1,1,1).Respond with following FROM_CLIENT packets of information afterwards.

Field	Value
		type	FROM_CLIENT
client?id	“abcdef”
		sequence_num	1
MAC?address(unit， level，sub_level)	(1，1，1)
		not?used	1
sub?type	NET_CONF_SUCCESS
		data?length	17
data	Information?on?the?local routing?table?and?some client?information

The data division of this packets of information has comprised the local path table that is applied to the distributed addressing of this node and other local control information.These data help reader to do macro-control.

Example 2: the point to point network initialization of upper level node

We suppose that we want to use point-to-point method and go to distribute a MAC Address to give a node specifically, and this node is in the higher place of the ratio in building, and for example, we distribute MAC Address (1,7,10) is the 710 room nodes of " 123000 " to ID.For reaching this purpose, reader must approach this node.Reader produces and sends following packets of information:

Field	Value
		type	NET_CONF
client?id	“123000”
		sequence_num	1
MAC?address(unit，level， sub_level)	(1，7，10)
		last?relay?level	6
alternative?MAC?address	(0，0，0)
		sub_type	NET_CONF_INIT
data	2bytes

Here MAC Address (1,7,10) will be assigned to 710 room nodes.Substituting address (0,0,0) is a broadcast address.Please note that last relay layer is set to 6, be lower than destination layer 7 one decks.When the reader radio-frequency module found that destination layer is higher than last relay layer one deck, its was used and substitutes the address and reach 710 room nodes.

When 710 room nodes were received this broadcast message, we saw that client id is identical with its client, simultaneously MAC Address (1,7,10) were distributed to its MAC Address.Afterwards, react with following FROM_CLIENT packets of information.

Field	Value
		type	FROM_CLIENT
client?id	“123000”
		sequence_num	1
MAC?address(unit， level，sub_level)	(1，7，10)
		not?used	1
sub?type	NET_CONF_SUCCESS

data?length	17
		data	Information?on?the?local
	routing?table?and?some client?information

Two other example will illustrate that how using relaying replaces point-to-point method to carry out initialization.

Example 3: use via node and carry out netinit

After room 101 is initialised, suppose that we want MAC Address (1,2,2) is distributed to room 202 nodes, its ID is " 123456 ", utilizes room 101 nodes to make relay station.READER produces and sends following packets of information

Field	?Value
		type	?NET_CONF
client?id	?“123456”
		sequence_num	?1
MAC?address(unit，level， sub_level)	?(1，2，2)
		last?relay?level	?0
alternative?MAC?address	?(0，0，0)
		sub_type	?NET_CONF_INIT
data	?2bytes

Here substituting MAC Address (0,0,0) is a broadcast address.The reader radio-frequency module will at first be delivered to this packets of information 101 room nodes, because the reader radio-frequency module always can be remembered last client of its packet that sends.101 room nodes will be used alternative MAC Address and reach 202 room nodes.Last relay layer is set to 0, and it is positioned at the following one deck of first via node (1,1,1).

When 202 room nodes are received this broadcast message, see that client id is identical with its client, MAC Address (1,2,2) is distributed to its MAC Address.Afterwards, 202 room nodes react with following FROM_CLIENT packets of information, and this packets of information will be returned reader by 101 room nodes.

Field

Value

type	FROM_CLIENT
		client?id	“123456”
sequence_num	1
		MAC?address(unit， level，sub_level)	(1，2，2)
not?used	1
		sub?type	NET_CONF_SUCCESS
data?length	17
		data	Information?on?the?local routing?table?and?some client?information

Example 4: carry out netinit with via node

After room 101 and room 202 nodes are initialised, suppose that we want MAC Address (1,3,1) distributes to room 301 nodes, its ID is " 001234 ", utilizes room 101 nodes and room 202 nodes as relay station, and READER produces and send following packets of information;

Field	Value
		type	NET_CONF
client?id	“001234”
		sequence_num	1
MAC?address(unit，level， sub_level)	(1，3，1)
		last?relay?level	0
alternative?MAC?address	(0，0，0)
		sub_type	NET_CONF_INIT

data

2bytes

Here MAC Address (1,3,1) will be assigned to room 301 nodes.Substituting MAC Address (0,0,0) is broadcast address.The READER radio-frequency module is issued room 101 nodes with packets of information.Then room 101 nodal informations will send to room 202 (it thinks that the destination hugs at the 3rd layer, so it sends to room 202 nodes as relaying with packets of information).Room 101 nodes have remembered that from the operation of front room 202 nodes are its next relay stations (seeing example 3).Room 202 node utilizations substitute MAC Address and arrive room 301 nodes.Last relay layer is set to 0, and it is than the 1st relaying floor height one deck.

In case room 301 nodes are received this broadcast message, it sees that this client id is the same with its client id, and MAC Address (1,3,1) is distributed to the MAR address.It is responded with following FROM_CLIENT packets of information then, and this packets of information will return to READER by room 202 and room 101 nodes.

Field	Value
		type	FROM_CLIENT
client?id	“001234”
		sequence_num	1
MAC?address(unit， level，sub_level)	(1，3，1)
		not?used	1
sub?type	NET_CONF_SUCCESS
		data?length	17
data	Information?on?the?local routing?table?and?some client?information

Example 5: change the network MAC address with via node

Example 1,2,3 and 4 have set forth and how to have used point-to-point or trunking scheme is come the initialization node.This example is set forth the MAC Address that how to change a node.Suppose that we want (1,3,11) are changed into by (1,3,1) in the node M AC address in rooms 301, as relaying, READER produces and sends following packets of information with 101 room nodes and 202 room nodes;

Field	Value
		type	NET_CONF

client?id	“001234”
		sequence_num	1
MAC?address(unit，level， sub_level)	(1，3，11)
		last?relay?level	0
alternative?MAC?address	(0，0，0)
		sub_type	NET_CONF_INIT
data	2bytes

Here MAC Address (1,3,11) is new MAC Address.We come this node of addressing with broadcast address (0,0,0), because the existing MAC Address (1,3,1) of this node, we also can use (1,3,1) MAC Address as an alternative, and send following packets of information

Field	Value
		Type	NET_CONF
client?id	“001234”
		sequence_num	1
MAC?address(unit，level， sub_level)	(1，3，11)
		last?relay?level	0
alternative?MAC?address	(1，3，1)
		sub_type	NET_CONF_INIT
Data
		2

Example 6: use the via node accesses network

Up to the present, we have illustrated the MAC Address of initialization and change node.In some cases, we need know the local message of a node.This can with NET_CONF instruction and, sub type NET_CONF_QUERY instructs and finishes, and supposes that we wonder the information of room 301 nodes, we send following packets of information:

Field	Value
		type	NET_CONF
client?id	“001234”
		sequence_num	1
MAC?address(unit，level， sub_level)	(1，3，1)
		last?relay?level	0
alternative?MAC?address	(0，0，0)
		sub_type	NET_CONF_QUERY
data	2bytes

The packets of information of returning is the same with the packets of information that NET_CONF_INIT responds:

Field	Value
		type	FROM_CLIENT
client?id	“001234”
		sequence_num	1
MAC?address(unit， level，sub_level)	(1，3，1)
		not?used	1
sub?type	NET_CONF_SUCCESS
		data?length	17

data	Information?on?the?local routing?table?and?some client?information

The data division of return information bag comprises the local information-local addressing form of node and other control information.

1.3. use the data read of distributed addressing

In a wireless network, after all meshed network initialization, READER can be by sending a TO_CLIENT instruction and wait-for-response, arbitrary node sense data from network.

Reading of a node data can be achieved by following method:

(3) point-to-point: when reader when the destination node, it can read the data of destination node directly by using MAC Address and destination node communicate.Make in this way, the last relay layer field of TO_CLIENT instruction must be set to a layer under the destination node layer.For example, if destination node is positioned at the 7th layer, the last relay layer of TO_CLIENT instruction must be set to 6.How following example 1 and example 2 explanations realize point-to-point data read.

(4) use via node to carry out distributed addressing: when reader is not when being close to destination node.For example, READER is outside mansion, and destination node is at the 6th layer.This READER can use intermediate node to arrive destination node as relaying at (as node between the 1st to the 5th layer) between this destination node and the READER.In order to use intermediate node to carry out relaying, this READER should begin data read near node, uses these nodes to carry out reading of node far away slightly as relaying then.

The data read that has via node can realize by distributing addressing or centralization addressing.The data read of distributing addressing such as following example 3 and example 4 explanations.The data read of centralization addressing describes among the routine 1-4 at the 7th chapter, and this method is a quick comparatively speaking and high-efficiency method.

1.3.1reader the reaction of instruction TO_CLIENT and client program

The TO_CLIENT instruction

Field	#of?Bytes	Note
			type	1	TO_CLIENT
client?id	6
			sequence_num	1
MAC?address(unit，level， sub_level)	3	The MAC Address of destination client
			last?relay?level	1	The situation of node front node is told in this territory
additional?info	n	Not?used

The FROM_CLIENT packets of information

Field	?#of?Bytes	?Note
			type	?1	?FROM_CLIENT
client?id	?6
			sequence_num	?1
MAC?address(unit，level， sub_level)	?3	The MAC Address of destination client
			not?used	?1
sub_type	?1	?CLIENT_DATA
			data?length	?1
data	?n

Example

Example 1: point-to-point data read

Consider Fig. 1, suppose that we want to read the node in room 101, their MAC Address is that (1,1,1) and client identity authentication are " abcdef ", uses point-to-point method.This packets of information below reader produces and transmits:

Field	Value
		type	TO_CLIENT
client?id	“abcdef”
		sequence_num	1
MAC?address(unit，level， sub_level)	(1，1，1)
		last?relay?level	0

Last relay layer is 0 to be the one deck below destination layer in the attention command.The radio-frequency module of reader arrives chamber 101 nodes by using MAC Address.

In case chamber 101 nodes receive this then order, client identity proof and its client prove that when consistent, it will be made a response with following FROM_CLIENT packets of information.

Field	Value
		type	FROM_CLIENT
client?id	“abcdef”
		sequence_num	1
MAC?address(unit， level，sub_level)	(1，1，1)
		not?used	1
sub?type	CLIENT_DATA
		data?length	n
data	n?bytes

The data field of the packets of information that returns comprises requested data, for example, and the tolerance of electric current.

Example 2: point-to-point data read

Consider Fig. 1, suppose that we want to read the node in room 301, their MAC Address is that (1,3,1) and client identity authentication are " 001234 ", uses point-to-point method.Guarantee that reader is near destination node.This packets of information below reader produces and transmits:

Field	Value
		type	TO_CLIENT
client?id	“001234”
		sequence_num	1
MAC?address(unit，level， sub_level)	(1，3，1)
		last?relay?level	2

Last relay layer is 2 to be the one decks below destination layer in the attention command.The radio-frequency module of reader arrives chamber 301 nodes by using MAC Address.

In case chamber 301 nodes receive this then message, client identity proof and its client prove that when consistent, it will be made a response with following FROM_CLIENT packets of information.

Field	Value
		type	FROM_CLIENT
client?id	“001234”
		sequence_num	1
MAC?address(unit， level，sub_level)	(1，3，1)
		not?used	1
sub?type	CLIENT_DATA
		data?length	n
data	n?bytes

Initialization chamber 301 nodes use point-to-point method, owing to be at the 3rd layer, if reader too far may have problems from it.Below two example discussion use the via node sense datas.

Example 3: use the via node sense data

Behind the node that runs through chamber 101, suppose that we want to read the node in room 203, their MAC Address is that (1,2,3) and client identity authentication are " 123456 ", the node that uses chamber 101 is as relaying.This packets of information below reader produces and transmits:

Field	Value
		type	NET_CONF
client?id	“123456”
		sequence_num	1
MAC?address(unit，level， sub_level)	(1，2，3)
		last?relay?level	0

data?length

0

The READER radio-frequency module will be delivered to this packets of information the node place of chamber 101, and the READER radio-frequency module always can be remembered last client of the packets of information that it transmits.Chamber 101 nodes will use this MAC Address to arrive 203 node places, chamber.Noticing that last relay layer is set to 0, is the one deck under first via node (1,1,1).

In case chamber 203 nodes receive this then message, client identity proof and its client prove that when consistent, it will be made a response with following FROM_CLIENT packets of information.This packets of information will be returned reader by 101 node places, chamber.

Field	Value
		type	FROM_CLIENT
client?id	“123456”
		sequence_num	1
MAC?address(unit， level，sub_level)	(1，2，3)
		sub?type	CLIENT_DATA
data?length	n
		data	n?bytes

Example 4: use the via node sense data

Behind the node that runs through chamber 101 and chamber 203, suppose that we want to read the node in room 301, its client identity authentication is " 001234 ", the node of use chamber 101 and the node of chamber 203 are as relaying.This packets of information below reader produces and transmits:

Field	Value
		type	NET_CONF
client?id	“001234”
		sequence_num	1
MAC?address(unit，level，	(1，3，1)

sub_level)
		last?relay?level	0
data?length	0

The READER radio-frequency module will be delivered to this packets of information the node place of chamber 101, the node of chamber 101 will transmit packets of information to the chamber 203 nodes because the destination is at three layers, so its must transmit this packets of information earlier to a via node.As the result of previous EO, chamber 101 nodes remember that chamber 203 nodes are as next relaying place (referring to example 3).Chamber 203 nodes will use MAC Address (1,3,1) to arrive 301 node places, chamber.

In case chamber 301 nodes receive this then message, client identity proof and its client prove that when consistent, it will be made a response with following FROM_CLIENT packets of information.This packets of information will be returned reader by 203 node places, chamber and 101 node places, chamber.

Obviously, those skilled in the art can carry out various changes and not break away from spiritual scope of the present invention method of the present invention.If therefore these changes belong in claims of the present invention and the equivalent technologies scope thereof, then the present invention also is intended to contain these changes.

Claims

1. a fast routing method that is used for based on wireless mesh network comprises a plurality of nodes in this wireless network, it is characterized in that: each node is assigned with one and comprises this node location address with respect to reference point locations in network topology structure; Described location address is used as MAC Address and is carried out communication according to preordering method;

Described preordering method is specially: node transmits this packets of information according to following step after receiving a packets of information:

2. the fast routing method that is used for based on wireless mesh network as claimed in claim 1, it is characterized in that: described location address comprises three parts, is respectively: be used for define grid regional area network portion, be used for defined node in this zone with respect to the distance part of reference node distance, be used for distinguishing same position arranged the sequence number part of the node of (be identical with respect to the reference node distance).

3. the fast routing method that is used for based on wireless mesh network as claimed in claim 2 is characterized in that: judge that the method whether destination node belongs to adjacent node is:

(21) calculate destination node apart from the difference between the distance part of part and present node,

Delta=(destination node is apart from part)-(current nodal distance part)

Wherein, delta shows two internodal relative distances;

(22) one of definition is hop apart from critical value, if delta＜=hop, we just think that destination node belongs to neighbors; Otherwise destination node does not then belong to neighbors;

Wherein, should be to determine like this apart from critical value hop: the packets of information that this node sent can directly be communicated to all nodes in the hop scope.

4. the fast routing method that is used for based on wireless mesh network as claimed in claim 1 is characterized in that: the node of described via node for communicating by letter with it recently.

5. the fast routing method that is used for based on wireless mesh network as claimed in claim 1 is characterized in that: described via node is apart from the node in the critical value hop.

6. the fast routing method that is used for based on wireless mesh network as claimed in claim 1 is characterized in that: described network topology structure comprises lattice structure and tree structure.