59results about How to "Improve routing performance" patented technology

A method of setting a routing path for transmitting a packet from a source node to a destination node in a wireless multi-hop network including plural nodes and plural links for connecting two nodes with each other. The method includes calculating carrier sense interference weights representing carrier sense interference related to the respective links and combining the carrier sense interference weights of the links included in at least one specific path connecting the source node with the destination node. The method further includes calculating hidden node weights representing hidden node problems related to the respective links and accumulating the hidden node weights of the links included in the path. The method further includes calculating a metric value for the specific path by combining the carrier sense interference weights and the hidden node weights, and determining the specific path with the least metric value as the routing path.

A method and system are described for establishing an end-to-end route for data to traverse a wireless network, including calculating a link cost function, calculating a quantized link cost function using the calculated link cost, function, calculating a quantized cost of each of a plurality, of end-to-end routes for data to traverse the wireless network, wherein the plurality of end-to-end routes include routes between a same set of nodes in the wireless network, wherein, the quantized cost of each of the plurality of end-to-end routes for data to traverse the wireless network is performed using the quantized link cost function and selecting one of the plurality of end-to-end routes, for data to traverse the wireless network based on the quantized cost of each of the plurality of end-to-end routes. Also described is a node in a wireless network configured to participate in the establishment of a bi-directional end-to-end route for data to traverse the wireless network.

The invention discloses a routing method in a vehicle wireless communication network. The method disclosed by the invention comprises the following steps: route establishment: carrying out a route request and a route response, establishing a fixed node at the crossing, namely an anchor point and establishing an anchor point route on the anchor point; route transmission: carrying out the route transmission by adopting the adaptive broadcasting based on a chain prediction mechanism and a transmission algorithm based on the chain prediction mechanism; and route maintenance. The invention also discloses the vehicle wireless communication network. In the vehicle wireless communication network disclosed by the invention, a wireless communication module loading a special short-distance communication protocol is installed on each vehicle to jointly form a distributed ad hoc network; each vehicle forms a node; a fixed static wireless node is installed at the crossing; the static wireless node serves as the anchor point through the wireless communication module loading the special short-distance communication protocol and is used for assisting the node communication on the route or collecting the information of the crossing; and the anchor point and the nodes on the road jointly form the vehicle wireless communication network.

Disclosed are a method and a system for setting a routing path in consideration of hidden nodes and carrier sense interference.The method of setting a routing path for transmitting a packet from a source node to a destination node in a wireless multi-hop network consisting of plural nodes and plural links for connecting two nodes with each other, comprises: calculating carrier sense interference weights representing carrier sense interference related to the respective links and combining the carrier sense interference weights of the links included in at least one specific path connecting the source node with the destination node; calculating hidden node weights representing hidden node problems related to the respective links and accumulating the hidden node weights of the links included in the path; and calculating a metric value for the specific path by combining the carrier sense interference weights and the hidden node weights, and determining the specific path with the least metric value as the routing path.Accordingly, in the multi-channel multi-radio wireless mesh network, the path with minimized hidden node problem and carrier sense interference can be selected to improve network performance

A method of routing a packet in a routing device having a main processor that includes a main cache table and an instant cache table is disclosed. The instant cache stores a recent address and a recent interface associated with the most recent packet transmission process made by the routing device. The method includes the steps of receiving a packet that includes its destination address, checking whether the destination address belongs to the routing device, checking whether the destination address is identical to the recent address if the destination address does not belong to the routing device, and transmitting the packet to the recent interface if the destination address is identical to the recent address. As a result, the core information related to the routing path determination is stored not only in the routing table of the protocol layer but also in the main and instant cache tables included in the main processor. Since the selection of the routing path for a given packet depends on the individual characteristic of the packet, the data processing time of the packet is greatly reduced. Consequently, the routing performance of the routing device is greatly enhanced.

The invention discloses high-performance rubber asphalt pouring sealant and a preparation method thereof. The high-performance rubber asphalt pouring sealant is made from rubber powder, modifier, petroleum asphalt, tackifier, cosolvent, and stabilizer. The preparation method includes: heating the asphalt to 150-160 DEG C, adding the modifier, stirring to obtain liquid, adding the cosolvent and mixing for 30 minutes, heating to 190-200 DEG C, slowly adding the rubber powder, mixing for 30 minutes, adding the tackifier and the stabilizer, and mixing for 15 minutes to produce high-performance rubber asphalt pouring sealant. The rubber powder of waste tires is utilized, and accordingly product performance is improved, product cost is reduced and environmental pollution is reduced; the modifier, the rubber powder and the asphalt are mixed into stable, even mixture through the cosolvent, so that resin groups, rubber powder groups and asphalt groups can form a stable interlinked structure; through the modifier, route performance of the sealant can be improved, for example, softening point is increased and low temperature cracking resistance is improved; new cracks can be prevented effectively.

The present disclosure provides a method, network and apparatus for routing sessions so as to route sessions correctly according to the IDs of the domain-related users when the domain-related users are not registered on the IMS network. The method includes: obtaining a wildcard route ID; determining the corresponding domain user ID according to the wildcard route ID; and routing the session through the route set corresponding to the domain user ID.

The invention discloses a heuristic method for working out a plurality of shortest simple routes in network under multiple constraints. The method uses improved route control rules and predication of lower price limit after extending the routes to destination nodes, and abandon the routes which contain rings, break the constraints and exceed the cost of the k obtained shortest simple route. In the reserved routes, front k shortest simple routes meeting constrain conditions are searched in the breadth-first way and adjustable precision. The method has strong adaptability on network types, scales and change of constrain degrees, and the complexity of the method is approaching to the traditional breadth-first searching method. The heuristic method for working out a plurality of shortest simple routes in network under multiple constraints can shown excellent and stable performances on the aspects like route quantity, quality and capacity for discovering routes by setting the probing depth of middle ring of route and retracting coefficients of controlled decision.

The invention provides a routing method based on a coalition game. The routing method belongs to the technical field of wireless sensor networks, and comprises the steps of: step 1, establishing a coalition game model for all nodes of a wireless sensor network, establishing a coalition feature function based on node performance indexes, defining a fair coalition member income distribution method, and designing a rapid converging coalition forming algorithm so as to form a stable coalition in the network; step 2, proceeding a routing process based on the coalition formed in the network, calculating path coalition cost values fR at a route discovery stage, and selecting a path with the minimum path coalition cost fR for transmitting data from destination node cache by means of a source node; and step 3, completing and perfecting a path energy residual ratio ER monitoring mechanism for carrying out route maintenance on the basis of an AODV routing protocol link failure detection mechanism, so as to prevent a path transmission failure caused by node energy exhaustion. The routing method has the advantages of high adaptability to topology, good stability, minimal routing cost, balanced energy consumption and the like, and effectively improves the routing performance.

The invention provides an urban public transport route selection method. The method solves urban traffic congestion by fully utilizing an computational intelligence advantage, closely associates various interactive units of a urban intelligent transportation system, solves correlative problems as viewed from a system perspective, accurately predicts road condition information, reasonably plans public transport routes according to a traffic condition, enlarges the coverage of public transport, shortens the waiting time of passengers and the running periods of the public transport, and adjusts traffic flow to be in an optimal state. The method comprises establishing a multi-object model and using the average travel time of a passenger and the total length of a route as two measurement indexes; and planning an optimal public transport route by means of a heuristic algorithm in order to achieve wider coverage and better connectivity. The method may dynamically treat a urban public transport route selection problem and is better in adaptability and wider in application range.

A network address assignment method and a routing method for a long thin ZigBee network are provided. The routing method includes the following steps. A network address is assigned to each node of the ZigBee network, wherein each network address includes a cluster ID and a node ID. The cluster ID is used for identifying a plurality of clusters of the ZigBee network. The Node ID is used for identifying a plurality of nodes of each cluster. When a packet is transmitted, check whether the current node holding the packet and the destination node are in the same cluster. If they are in the same cluster, the packet is routed within the cluster according to the node ID of the destination node and a predetermined algorithm. If they are not in the same cluster, the packet is routed among the clusters according to the cluster ID of the destination node.

The invention discloses an intersection routing method in a vehicle self-organized network on the basis of the path segment length. The method solves the problems that communication of a forwarding path cannot be guaranteed, and the route hop count is increased because the situation that the path segment length is smaller than the communication radius of wireless signals is not taken into consideration. The method specifically comprises the steps that first, an intersection node calculates the communication degree between every two adjacent path segments; second, a data packet is forwarded to an intersection node or a neighbor node closest to a target node according to the communication degree between very two adjacent path segments; finally, the process above is repeated till the data packet is forwarded to the target node. According to the intersection routing method in the vehicle self-organized network on the basis of the path segment length, the communication degree between every two adjacent path segments is calculated with different methods according to the path segment length, the intersection node which is communicated and closest to the target node is selected preferentially, the phenomenon that a data packet is forwarded to a path segment which can be easily interrupted can be effectively avoided, network delay is reduced, and the delivery rate of the data packets is increased.

The invention discloses a gradient-based wireless sensor network (WSN) topology maintenance method, and relates to a WSN. The method is characterized by comprising the following steps: path cost is obtained by a reverse path cost calculation method so as to establish gradient; and each node periodically maintains links of a father node and a standby father node based on the gradient. In the case of packet forwarding, one node delivers a packet into the node with the minimum path cost in feasible next-hop. In the invention, the links are maintained by a gradient reduction method according to data aggregation characteristics of the WSN, which can well adapt to the WSN with strong link dynamic property, control protocol overhead and keep high routing performance.

A network address assignment method and a routing method for a long thin ZigBee network are provided. The routing method includes the following steps. A network address is assigned to each node of the ZigBee network, wherein each network address includes a cluster ID and a node ID. The cluster ID is used for identifying a plurality of clusters of the ZigBee network. The Node ID is used for identifying a plurality of nodes of each cluster. When a packet is transmitted, check whether the current node holding the packet and the destination node are in the same cluster. If they are in the same cluster, the packet is routed within the cluster according to the node ID of the destination node and a predetermined algorithm. If they are not in the same cluster, the packet is routed among the clusters according to the cluster ID of the destination node.

Photonic data routing in optical networks is expected overcome the limitations of electronic routers with respect to data rate, latency, and energy consumption. However photonics-based routers suffer from dynamic power consumption, and non-simultaneous usage of multiple wavelength channels when microrings are deployed and are sizable in footprint. Here we show a design for the first hybrid photonic-plasmonic, non-blocking, broadband 5×5 router based on 3-waveguide silicon photonic-plasmonic 2×2 switches. The compactness of the router (footprint <200 μm2) results in a short optical propagation delay (0.4 ps) enabling high data capacity up to 2 Tbps. The router has an average energy consumption ranging from 0.1˜1.0 fJ / bit depending on either DWDM or CDWM operation, enabled by the low electrical capacitance of the switch. The total average routing insertion loss of 2.5 dB is supported via an optical mode hybridization deployed inside the 2×2 switches, which minimizes the coupling losses between the photonic and plasmonic sections of the router. The router's spectral bandwidth resides in the S, C and L bands and exceeds 100 nm supporting WDM applications since no resonance feature are required. Moreover, this hybrid photonic-plasmonic switch design is also suitable for 3 up to a few dozens of routing ports by simply cascading our 2×2 switch with a specific pattern. Taken together this novel optical router combines multiple design features, all required in next generation high data-throughput optical networks and computing systems.

The invention relates to a grid structure-based hierarchical network charging method and system in the WRSNs. The hierarchical network charging method comprises the steps of 1, constructing a hierarchical network; 2, sequentially and respectively charging all sensor nodes in the hierarchical network on the basis of the above hierarchical network. According to the technical scheme of the invention, the routing performance of the network itself is improved through fully utilizing the topological structure of the hierarchical network. Meanwhile, the node energy can be timely replenished, so that the remaining energy at each grid is ensured to be higher than a given threshold all the time. Therefore, the network is ensured to run in an efficient state, and the life cycle of the network is prolonged. In addition, the method and the system have the advantages of simple computation. Therefore, the requirements of large-scale network applications can be met.

The invention discloses a route conversation method, network and equipment, for solving the problem performing correct conversation routing according to user identification related to domain name when the domain name related user registering without IMS network. The method in the invention comprises: A, when user database receives a position query request, distributing calling conversation control unit according to the route matching information; B, acquiring route collection of this session according to the route matching information; C, the calling session control unit routing this session by the route collection. The invention can correctly route the session of the domain name related user when the user the domain name related user registering without IMS network.

Photonic data routing in optical networks is expected overcome the limitations of electronic routers with respect to data rate, latency, and energy consumption. However photonics-based routers suffer from dynamic power consumption, and non-simultaneous usage of multiple wavelength channels when microrings are deployed and are sizable in footprint. Here we show a design for the first hybrid photonic-plasmonic, non-blocking, broadband 5×5 router based on 3-waveguide silicon photonic-plasmonic 2×2 switches. The compactness of the router (footprint <200 μm2) results in a short optical propagation delay (0.4 ps) enabling high data capacity up to 2 Tbps. The router has an average energy consumption ranging from 0.1˜1.0 fJ / bit depending on either DWDM or CDWM operation, enabled by the low electrical capacitance of the switch. The total average routing insertion loss of 2.5 dB is supported via an optical mode hybridization deployed inside the 2×2 switches, which minimizes the coupling losses between the photonic and plasmonic sections of the router. The router's spectral bandwidth resides in the S, C and L bands and exceeds 100 nm supporting WDM applications since no resonance feature are required. Moreover, this hybrid photonic-plasmonic switch design is also suitable for 3 up to a few dozens of routing ports by simply cascading our 2×2 switch with a specific pattern. Taken together this novel optical router combines multiple design features, all required in next generation high data-throughput optical networks and computing systems.

A method for improving transportation routing offers better performance and greater control over current methods based on injecting domain specific metrics. What is new is the method starts with optimizing small sub-routes from a comprehensive list of all geographic locations that can be routed. This is similar to geometry node contraction but in this case it contracts sub-routes. Every location pair combination is routed and only the best results are saved. These sub-routes are then queried and combined when a user or system provides a set of locations to be routed. What is also new is that this method uses data configurations specific to a type of transportation to enable the optimization to control performance, data size, and routing flexibility.

A structure of a circuit board for improving the performance of routing traces is described as eliminating the resonant effects from the inner layers in a circuit board. For eliminating the stray capacitor effect between the planes in the circuit board, the present invention uses a method for etching an area of a power plane and the area is corresponding to a routing plane. Consequently, the routing trace can make good electric potential reference of a ground plane. Due to the reduction of the stray capacitor, the structure for improving the performance of routing traces of the invention can avoid the resonance effect and parasitic resonance in the circuit board as produced in a high-frequency situation in order to promote the quality of the circuit board.

The invention relates to a unicast routing method based on adaptive attractor selection in a mobile self-organizing network. A candidate node is probabilistically selected as a next-hop node according to activeness of a node itself and related information of candidate nodes in the last routing process, the activeness is calculated when routing of this time ends and the activeness of all constituting nodes on the routing path of this time is returned and updated, thereby improving the routing effect of a next time. The unicast routing method based on adaptive attractor selection in the mobile self-organizing network not only can adapt to a static or dynamic network topological structure very effectively, but can also balance a relation between delay and transmission cost, thereby improving the overall working effect of the network.

The embodiment of the invention discloses an information transmission method, a communication device and a communication system. The method comprises the following steps of: acquiring a data packet which contains attribute information of a traffic engineering link from local in a multi-layer network; searching a control channel which allows the data packet to flood from a predetermined filtering rule according to a layer type of the traffic engineering link corresponding to the attribute information of the traffic engineering link in the data packet, wherein the filtering rule comprises the corresponding relationship between the layer type of a control channel and the layer type of the traffic engineering link; and transmitting the data packet to a connected neighboring node from the control channel which allows the data packet to flood. The embodiment of the invention also provides the corresponding communication device and the corresponding communication system. The technical scheme of the embodiment of the invention can improve network routing performance in an information transmission process.

The invention discloses a method, a network and equipment for routing session, which is used to solve the problem that when a user relative to domain name does not register on an IMS network, correct session routing can not be achieved according to identity of the user relative to the domain name currently. The method of the invention comprises that: A. when a user database receives a research request in terms of position of a non-registered user, a call session control unit is distributed according to route-matched information; B. a route cluster of the session is acquired according to the route-matched information; C. the call session control unit routes the session according to the route cluster. The invention can still correctly route the session of the domain name-related user when the domain name-related user does not register on the IMS network.

A semiconductor chip has: a plurality of hard macros which operates based on a reference clock; and a clock pad through which the reference clock is supplied from the outside to one of the plurality of hard macros. The reference clock supplied to the one hard macro is relayed to other hard macros of the plurality of hard macros in order.

The invention provides an opportunistic network environment-oriented multi-object routing decision making system, which comprises an environment setting module (1), an ant-colony-based dynamic topological path searching module (2), a linear-distribution-method-based path evaluation module (3) and a route selection module (4). The decision making system can satisfy different needs of a decision maker or upper-layer application in routing objects and receive the preference information of the decision maker or the upper-layer application over the routing objects as routing guiding rules, adopts the combination of an improved ant colony algorithm and a linear distribution method as a main algorithm, performs the three main activities of responsibility definition, scheme planning and scheme evaluation, and can realize multi-object optimization to improve overall routing performance and better satisfy routing needs.

The invention provides a forwarding-probability-based routing algorithm. With the routing algorithm, blindness of message copy quota distribution and passivity of message copy forwarding can be eliminated and message delivery can be completed by low copying and forwarding frequencies. Therefore, the routing algorithm has the high message transmission success rate; the transmission delay is low when the node buffering is high; and the routing performance is excellent.

The invention discloses a method and device for heuristically learning a routing protocol in a wireless sensor network, and the method comprises the steps: carrying out the determination through a method for calculating a target Q value through a pre-constructed routing algorithm inspired by a distributed neural network corresponding to a first sensor node during the selection of a next-hop sensor node; according to the method, a two-layer learning structure is constructed, and discrete sensor nodes at the bottom layer interact with neighbor sensor nodes to carry out reinforcement learning; a distributed neural network is constructed at a high layer to enlighten underlying learning, so that a neural network fitting model is dynamically constructed in the autonomous learning process of each sensor node, the learning process of each sensor node is enlighted from a global perspective, the learning efficiency and learning precision of node learning are improved, and the learning efficiency of the sensor node is improved. The decision of each sensor node timely follows the change of a network topology structure, and the data packet transmission rate, the node survival ratio and the node energy standard deviation are improved.

The invention relates to a routing method and system of a wireless sensor network of an intelligent distribution network. The routing method of the wireless sensor network of the intelligent distribution network comprises the following steps: identifying a current forwarding node, a forward neighbor node and an aggregation node in the wireless sensor network of the intelligent distribution network, and establishing a position electrostatic force of the forward neighbor node on the current forwarding node according to the geographical location information of the current forwarding node, the forward neighbor node and the aggregation node; constructing a load electrostatic force of the forward neighbor node on a data packet of the current forwarding node according to the queue occupation rate of the forward neighbor node and the queue change rate; and constructing an inter-node static resultant force according to the position electrostatic force and the load electrostatic force, adjusting the static resultant force according to the delay sensitivity of the power distribution and utilization service, and selecting a next hop node for the power distribution and utilization service of the current forwarding node according to the static resultant force for routing forwarding. The routing forwarding effect of the power distribution and utilization service data between the wireless sensor networks of the intelligent distribution network is improved.