108 results about "Hierarchical routing" patented technology

Methods, apparatuses and systems directed to routing configuration in a hierarchical wireless mesh network. In one implementation, the present invention uses neighbor messages to allow routing nodes to discover one another and configure a hierarchical routing configuration. In one implementation, the present invention provides a neighbor and adjacency protocol that provides for automatic mesh configuration and loop-free mesh topologies.

A “peer-to-peer” hierarchical routing protocol—also referred to as Zone-based Hierarchical Link State Routing protocol (or “ZHLS”)—which incorporates location information into a novel “peer-to-peer” hierarchical routing approach. The network may be divided into non-overlapping zones. Aggregating nodes into zones conceals the detail of the network topology. Initially, each node knows its own position and therefore zone ID through a position determination unit, such as a Global Positioning System (GPS). After the network is established, each node knows the low level (node level) topology about node connectivity within its zone and the high level (zone level) topology about zone connectivity of the whole network. A packet may be forwarded by specifying the hierarchical address—zone ID and node ID—of a destination node in the packet header.

The invention relates to a dynamic self-organizing hierarchical routing method. The method is applied to the tree topology structure of a wireless sensor network, the problems of path failure and data transmission incapability due to node mobility or failure are solved, and the topology structure of the network can be dynamically regulated. The network is established by adopting a multi-branch-tree-based topology structure, and each node maintains a routing table of one level, and records a sub-tree topology structure taking the node as a root. The routing table is effectively updated by inserting a sequence number during node access application, so that the problems of repeated node numbers in the routing table of upper-level nodes are solved. Only when data cannot be transmitted, the routing tables reorganize the topology structures, and timely maintain the topology structures in the network, so that energy overhead, computing overhead and data transmission real-time performance are combined, the reliable transmission of the data is ensured, the overhead is reduced, and the advantages of a routing protocol and a routed protocol are utilized.

A distributed system and method generate “layered routes” that reflect a layered representation of a network, which representation provides deadlock-free routes. The layered representation consists of an ordered set of layers, where each layer is a deadlock-free sub-topology of the network. In determining routes, the links used in each route are constrained to be taken from layers of non-decreasing order as the route extends from source to destination. A device that determines a better or equal cost path to a destination node with respect to its current path to that node sends a route information message to its neighbor devices. The receiver of a route information message may then accept the message and begin using the new path described by the message, or reject the message without using the new path.

A call handover method for an Internet Protocol (IP) communication network using hierarchical routing comprising first and second mobility anchor points (P1, P2) connected to respective first and second access routers (R1, R2) and a home agent (EA) of a mobile first node (T1) communicating with a second node (T2) consists in, when the mobile first node (T1) detects the second access router (R2): i) determining the address prefix of the second access router (R2) in order to communicate it to the mobile first node (T1) in order for the latter to construct additional local and regional care-of addresses, ii) communicating the additional local care-of address to the first anchor point (P1) in order for it to set up a temporary tunnel (TU) to the second access router (R2) in order to forward packets addressed to the mobile first node (T1) to the second access router (R2), iii) connecting the mobile first node (T1) to the second access router (R2) in order to forward to it the packets received via the temporary tunnel (TU), and iv) communicating the additional local and regional care-of addresses of the mobile first node (Ti) to the second anchor point (P2) and to the home agent equipment (EA) in order for them to substitute them for the previous ones.

The invention relates to a networking communication method of an electricity consumption information acquisition system based on WIA-PA technology, belonging to the technical field of electricity consumption information acquisition. The method comprises the following steps that: S1, a gateway device assign corresponding IPv6 address for the whole electricity consumption information acquisition network according to device type of each node; S2, in combination with a networking method of the WIA-PA technology and a communication architecture of the electricity consumption information acquisition network, a backbone network and corresponding sub-networks, supporting IPv6 message transmission, of the electricity information acquisition system are established; S3, the gateway device realizes acquisition of electricity consumption information of users through the established electricity consumption information acquisition network. By the method, the WIA-PA network with IPv6 message transmission capability and the electricity consumption information acquisition system are effectively combined together, IPv6 address property of user nodes in wireless meter reading is realized, meanwhile, by a hierarchical routing search strategy, data acquisition success rate of a wireless network in the electricity consumption acquisition system is improved, problems, such as communication delay, are solved, and application demonstration of domestic industrial wireless WIA-PA standard in the filed of electricity consumption information field is promoted.

The invention discloses a position-based uniform clustering hierarchical routing algorithm for a wireless sensor network, which comprises the following steps of: 1, carrying out regular hexagonal uniform clustering on a detection region, and carrying out layering on regular hexagonal clusters according to distances with a Sink node from a first layer to an mth layer until covering all sensor nodes; 2, in consideration of residual energy and network load factors, establishing a reasonable cluster head electing mechanism; 3, carrying out fusion on data in the clusters and carrying out pre-codingprocessing; 4, establishing a layer-by-layer route; and 5, carrying out data transmission and decryption. The position-based uniform clustering hierarchical routing algorithm disclosed by the invention has the beneficial effects that (1) the position-based uniform clustering hierarchical routing algorithm has high query directivity; (2) the position-based uniform clustering hierarchical routing algorithm is greatly improved in the aspect of prolonging the life cycle; (3) an more efficient, optimal and energy-saving routing link is established to transmit data; and (4) security of the data isensured.

The invention provides a simulated annealing-based WSN hierarchical routing method. The method is based on a hierarchical network topology. The hierarchical structure is maintained by cluster nodes, cluster head nodes and sink nodes in a network. The method comprises the steps of firstly, dividing levels of the WSN, constructing the hierarchical structure of nodes, and then conducting data transmission. In the constructing phase of the hierarchical structure of nodes, cluster head nodes are elected and backed up according to energy. In the data transmission phase, a combination of a negotiation mechanism, a multi-hop energy multi-path routing mechanism and a simulated annealing algorithm is used, cluster nodes use the negotiation mechanism to transmit data to cluster head nodes, after data fusion is conducted by cluster head nodes, the data are transmitted to sink nodes, the multi-hop energy multi-path routing mechanism is used between cluster head nodes and sink nodes, the simulated annealing algorithm is used for seeking out an optimal path, and the data are transmitted from cluster head nodes to sink nodes along the optimal path.

The invention discloses a hierarchical routing algorithm based on a distributed type wireless aggregation network. The algorithm comprises the following steps of clustering of a wireless information interactive network, wherein the clustering is characterized by comprising the steps of utilizing nodes in the network to build a plurality of clusters by a cluster strategy, enabling each cluster to contain multiple common nodes and a cluster main node, and carrying out cluster management and cluster interior information interaction under the control of the cluster main nodes; building of the distributed type wireless aggregation network, wherein the building is characterized by comprising the steps of on the basis of the clusters of the wireless information interaction network, utilizing a series of aggregation nodes to build a distributed type hierarchical wireless aggregation network, reducing the data throughput pressure of the cluster main nodes, providing support for the inter-cluster information interaction of the distributed type information interaction network, and managing and optimizing the whole network; and designing of a hierarchical routing algorithm based on the distributed type wireless aggregation network, wherein the designing is characterized by comprising the steps of providing a lightweight routing protocol based on the cluster strategy and the distributed type wireless aggregation network, obtaining a node route list in the whole network range in the process of adding nodes into the network by the protocol under the conditions of smaller channel bandwidth and controlled cost, carrying out route management on the network, and addressing and routing all nodes in the network.

The invention proposes a hierarchical routing method of a wireless sensor network based on a flora foraging optimization algorithm by combining a bacterial foraging optimization algorithm with a hierarchical routing algorithm. The method comprises the following steps: firstly, clustering nodes by an adaptive clustering method; then selecting a node as a source node and a sink node as a target node; carrying out path search by loop iteration of the bacterial foraging optimization algorithm, and fully considering the factors such as path transmission energy consumption and node residual energy in a search process; and finally selecting an optimal path to finish information transmission between the source node and the target node. According to the hierarchical routing method of the wireless sensor network based on the flora foraging optimization algorithm, the factors such as path transmission energy consumption and node residual energy are fully considered, and the life cycle of the wireless sensor network can be effectively prolonged.

The invention provides a reliable energy-saving hierarchical routing implementation method used for a wireless body area network or an energy-limited small wireless sensor network, and relates to the field of communication. The reliable energy-saving hierarchical routing implementation method used for the wireless body area network or the energy-limited small wireless sensor network aims to solve the problems that in the prior art, the energy is low in effective utilization and uneven in energy consumption on all-part of the network, and the network is short in life cycle. According to the method, the cycle is initialized so that sensor nodes in the network can obtain corresponding adjacent node information of the sensor nodes, and the Sink node obtains the whole network information and estimates the network condition; the nodes participating in competing for the cluster heads in the competition cycle compete and become the cluster heads by the adoption of a delay window mechanism, and the nodes becoming the cluster heads meet the requirements of the channel, position, energy and the like; the other nodes select appropriate cluster heads to guarantee that each node has the cluster head corresponding to the node in the cluster forming cycle, and no overlapping exists in the clusters; the cluster routing builds reliable routing transmission through an asteroid topological structure.

The invention provides a mine environment wireless sensor network clustering routing protocol based on K-means (CRPK-means). The method comprises the following steps: acquiring sensor node geographiclocation information under long-distance banded region, forming multiple uniform clusters by using a K mean value clustering algorithm, and then electing the node closest to the centroid as the initial cluster head; and then adopting a dynamic cluster head rotation method, and finally transmitting the data by dynamically selecting a mixed transmission way of single-hop and multi-hop according to the distance between the cluster head and a base station and the distance between the cluster head and the cluster head at an integrated data transmission stage, wherein the turn is not used as the unit to perform re-clustering once the clustering is established, and only the cluster head dynamic change based on residual energy and geographical location is performed at each turn. Compared with thetraditional low energy adaptive clustering hierarchy routing protocol (LEACH), the method can balance the network load more effectively, the life cycle of the whole network is prolonged, and the method is superior to the traditional LEACH protocol method under the same condition.

This invention discloses a topological convergence method used in hierarchical route optical network including: when a node detects a link fault, it will send a link state announcement(LSA) to an agent node of the control domain to refresh the state, the router initiating the refreshment issues said LSA to other adjacent routers by flooding, which delete the LSA from the link state database and the agent node refreshes the topology database of the local control domain to abstract the topology in new control domains. When a router receives the LSA, it will refresh its topology database and flood said LSA to other data interfaces and routers operate the route algorithm to compute the route lists again.

The invention discloses a hierarchical routing algorithm based on a rechargeable multi-base-station wireless heterogeneous sensor network, which comprises the following steps of: deploying and optimizing the positions of base stations in a multi-base-station deploying stage; in the cluster establishment stage, adopting a dynamic clustering mode and selecting luster heads and automatically adjusting clustering by calculating thresholds according to information such as node residual energy and the distance between the node residual energy and a base station; in an inter-cluster route discovery stage, searching for an inter-cluster multi-hop route; in the inter-cluster routing selection stage, selecting an optimal routing path according to factors such as the minimum node residual energy of the path, the hop count from the node to the base station and the total energy consumption of the path; in a data acquisition and transmission stage, enabling a cluster head to transmit data to the base station through an optimal routing path, after a plurality of periods, enabling the whole network to rebuild clusters, carrying out inter-cluster routing discovery and inter-cluster routing selection and cyclically carrying out the steps in this way until the energy of the whole sensor network is exhausted. According to the invention, the network energy consumption can be better balanced, the network life cycle is prolonged, and the hot zone problem is effectively solved.

The invention discloses a routing selection method based on a hierarchical IP network coordinate system, relates to the field of computer network performance optimization, and aims to provide a way to improve the traditional IP network coordinate system, which can only predict time delay and is difficult to provide more network performance information. Cause the routing selection method that data packet route forwarding efficiency is low; This method comprises the following steps, and node first constructs global coordinate and local coordinate; And when sharing coordinate information, through the TTL (time to live) field in the IP datagram Obtain routing hop information to understand the path to the remote node; finally, the global coordinates and local coordinates cooperate with each other, that is, the global coordinates predict the directionality and relative position of the nodes, and determine the direction of data forwarding, while the local coordinates combine routing hops Number, accurately predict the delay between nodes, and finally predict one or several paths with the least delay cost, and the data packets will be forwarded along this path, so as to improve network utilization.

The invention relates to a power communication hierarchical routing path determining method comprising the following steps: clustering low- and high-orbit satellites in a power communication network topology; when the source satellite node and the destination satellite node of a packet are in the same cluster, determining a final packet forwarding path from the source satellite node generating the packet to the destination satellite node receiving the packet for the intra-cluster packet based on an ant colony algorithm; and when the source satellite node and the destination satellite node of a packet are not in the same cluster, taking a path for transmitting the packet from the source satellite node to a high-orbit satellite, a packet forwarding path for an inter-cluster packet in the high-orbit satellite to reach a relay destination satellite node from a relay source satellite node and a path for transmitting the high-orbit satellite to the destination satellite node as the final packet forwarding path from the source satellite node generating the packet to the destination satellite node receiving the packet for the inter-cluster packet. The method can be used to jointly optimize the communication performance of the system, and is advantageous in communication.

The invention relates to the technical field of wireless communication, and provides a hierarchical routing-based cross-heterogeneous network seamless connecting method. The connecting method comprises the following steps: adding or deleting a proxy subnet; performing broadcasting announcement on the proxy subnet; querying the proxy subnet; performing proxy subnet response; managing the proxy subnet; performing local routing and packet forwarding. According to the hierarchical routing-based cross-heterogeneous network seamless connecting method, the communication between a mobile self-organizing network and a fixed network is realized through a link layer routing-based mobile self-organizing network and a network layer routing-based fixed network connecting method, so that the coverage rate of the fixed network is improved.

The invention discloses a context-dependent non-uniform clustering routing algorithm. According to the context-dependent non-uniform clustering routing algorithm, the defect that clustering and route are isolated from each other by a traditional hierarchical routing model is overcome, information at a clustering stage is applied to a routing formation stage, set-up time of a network is largely shortened, and energy consumption of the network is reduced. Based on a clustering algorithm of a vote mechanism, the context-dependent non-uniform clustering routing algorithm optimizes energy consumption of an area, a time-sharing reversed flooding algorithm is used, and energy consumed by route discovery is largely saved. The context-dependent non-uniform clustering routing algorithm can be effectively applied to large-scale area monitoring, energy load balancing of the context-dependent non-uniform clustering routing algorithm is confirmed, node behavior is stable, and network lifetime is much longer.