Network address assigning and allocating method and routing method for long-thin wireless network

A network address allocating method for a long-thin wireless network, comprising:

• a. planning a long-thin wireless network, wherein a plurality of nodes in the long-thin wireless network are classified into a plurality of clusters, all the nodes ranging from a first node after each bridge node to the next bridge node in the long-thin wireless network are classified as the same cluster, the first node after each bridge node is classified as a cluster head node of the cluster, and the other nodes are classified as network nodes in the cluster;
• b. assigning a network address to each of the nodes, wherein the network address comprises a cluster ID and a node ID, the cluster ID is used for identifying the clusters, and the node ID is used for identifying the nodes in each of the clusters;
• and
• c. sending a query packet by any one of the nodes to the neighbouring nodes of the node, and collecting an address request packet sent back by each of the neighbouring nodes so as to allocating the network addresses to the neighbouring nodes,
• wherein if the node sending the query packet in step c. is a bridge node, cluster ID is sequentially assigned to the cluster head nodes connected to the node, the node ID of each of the cluster head nodes is assigned as 0, and node ID is sequentially assigned to the other nodes.

A routing method for a long-thin wireless network, comprising:

• a. planning a long-thin wireless network, wherein a plurality of nodes in the long-thin wireless network is classified into a plurality of clusters, and all the nodes ranging from a first node after each bridge node to the next bridge node in the long-thin wireless network are classified as the same cluster;
• b. allocating a network address to each of the nodes, wherein the network address comprises a cluster ID and a node ID, the cluster ID is used for identifying the clusters, and the node ID is used for identifying the nodes in each of the clusters;
• c. checking whether the cluster ID of a destination node of a packet is the same as the cluster ID of any one of the nodes by using the node;
• d. routing the packet in the cluster according to the node ID of the destination node if the cluster ID of the destination node is the same as the cluster ID of the node;
• and
• e. routing the packet between the clusters according to the cluster ID of the destination node if the cluster ID of the destination node is different from the cluster ID of the node,
• wherein step d. comprises:
• comparing the node ID of the destination node and the node ID of the node having the packet;
• selecting the neighbouring node having greater node ID from the same cluster as the next hop node if the node ID of the destination node is greater than the node ID of the node having the packet;
• and
• selecting the neighbouring node having smaller node ID from the same cluster as the next hop node if the cluster ID of the destination node is smaller than the node ID of the node having the packet.