144results about How to "Reduce the number of hops" patented technology

A method and apparatus for route aware network link acceleration provides a managed communication channel for accelerated and reliable network communication between a client and other network devices as needed. The communication channel may comprise one or more segments having increased speed, reliability, security, or other improved characteristics as compared to traditional communication links. Network traffic may be routed through one or more of the segments based on various criteria to improve communication of the traffic. In one embodiment, the segments may be arranged in a daisy chain configuration and be provided by one or more chaining nodes.

A peer-to-peer cache architecture stores peer address certificates in different cache segments according to the number of IDs being stored and their relative distance in the peer name space. The cache instantiates regions of decreased range and increased granularity as additional information from close peers is learned. In a large peer cloud where the number of instantiated IDs is not known, each succeeding cache region covers one tenth of the preceding cache region. For peers with multiple IDs registered locally, the segmented cache of the present invention combines overlapping segments of the same granularity to eliminate the duplication of information that would otherwise occur. A cache tree, an instantiated segment tree, and an uninstantiated segment tree are arranged in red-black trees to simplify the search and proper placement and instantiation of information.

The invention describes a method of establishing a wireless multi-hop network (NW), in particular a ZigBee-type network, comprising a plurality of devices (0, 1, 2, . . . , 96) of a device arrangement (D), in which method devices (1, 2, 3, . . . , 96) establish a physical wireless connection to at least another device (0, 1, 11, 16, 17, 29, 30, 39, 48, 52, 53, 55, 64, 71, 73, 79, 88) of the network (NW) in a self-organizing process. In the self-organizing process a seeking device, intending to join the network, listens for beacon signals emitted by candidate parent devices already in the network comprising a network identifier and a device identifier of the emitting devices. Then, in a parent selection process, the seeking device selects a parent device from among the candidate parent devices, according to given selectionrules, based on the network identifiers (EPID), acceptance capabilities of the candidate parent devices, and link quality parameter values relating the device and the candidate parent devices. In this parent selection process application-level connection data (L, BI) of the seeking device and/or the candidate parent devices are applied. At least, the seeking device connects physically, and preferably also logically, via the selected parent device (0, 1, 11, 16, 17, 29, 30, 39, 48, 52, 53, 55, 64, 71, 73, 79, 88) to the network (NW). The invention further describes a device comprising a network inter-face for connecting a wireless multi-hop network (NW) according to this method.

The invention discloses an internet of things (IoT) error sensor node location method based on an improved Q learning algorithm. The method is characterized in that the traditional Q learning method is improved to make calculated Q values adaptively change according to characteristic information such as residual energy of a sensor node, routing and transmission hop count, a routing path is established by means of a maximal Q value, meanwhile, a background server works out a network topological structure, when the node is attached or produces error data, an error range is set by comparison with the Q value of the node of the next period, and when the range is exceeded, the node is judged to be the error node and is located. According to the invention, extra energy of the sensor node does not need to be consumed, and when a wireless sensor network topological structure changes, higher robustness is also achieved; and the method has the advantages of intelligent property, low energy consumption, high adaptive degree and the like, can be used to not only routing, location and energy consumption performance evaluation of the sensor node but also accurate location of unknown error nodes, and has wide application values.

A method for controlling a powertrain of a vehicle with wheels during a traction control event is provided. The method comprises adjusting wheel torque in response to an amplitude of a band-pass filtered driven wheel speed and a direction of acceleration of driven wheels.

A distributed index for discovering distributed data sources and computing resources based on predicates on attributes is provided. Proposed is a non-altruistic scheme for indexing distributed data, in which nodes are provided with incentives to cooperate in the referencing of data and the routing of search requests for indexed data. Indexed data is mapped to a dynamic routing graph, in which nodes earn credits each time they route a search request. Participatory nodes along a search request traversal continually modify local routing decisions in a manner necessary to maximize profit. Thus, routing paths as a whole are able to dynamically adapt to changing query workloads and access patterns. Dynamic adaptation also occurs by automatic load-balancing of recipients of frequently routed searches, known as “hot spots”, for frequently request data, “hot items”, as a result of an incentive to replicate the indexing strategy of a more profitable node.

The invention discloses a data collecting method applied to a multihop wireless sensor network, which belongs to the wireless communication network field and mainly solves the problems that the efficiency is low, the time lapse is big, and the network service life is short in prior network data collection. The data collecting steps include as following: executing clock synchronization to the local network nodes, and updating the local network information of the network nodes; dividing the network work time into a plurality of network interception periods; utilizing the updated localized network information to work out the interception signal channel probability of the nodes; executing interception at each network interception period according to the interception signal channel probability; executing data transmission according to the contest transmission nodes transmitted by the generating data; executing the data receiving according to the frames hearing the busy signal contest receiving node; and transmitting the data to the syntaxis nodes SINK used for collecting the data through multihops. The method has the advantages that the data collection is in time, and the nodes are high in efficiency and good in expansibility, thus being applicable for collecting data information in a large-scale wireless sensor network for monitoring emergency accidents.

The invention discloses a novel neighbor finding method based on a directional antenna. The neighbor finding method comprises the following steps that binary system numbering is carried out on nodes, the antenna scanning direction is numbered, one node determines a receiving and sending mode according to the binary system number of the node, determines the scanning sequence according to the receiving and sending mode and carries out scanning at the neighbor finding stage according to the scanning sequence, and if a pair of receiving and sending nodes successfully come to a handshake protocol, it is shown that the neighbor finding process is successful. The novel neighbor finding method solves the problem of neighbor finding of the non-central networking under the condition of the directional antenna, the advantages of the high interference resistance and high space reused ratio of the directional antenna can be exploited to the full the flexible characteristic of entering and existing the network of the non-central networking are fully utilized, and the method has wide application prospects.

The invention discloses a data collection method based on AUV position prediction in an underwater sensor network. The data collection method comprises the following steps: the AUV cruises in the network according to a pre-determined helical orbit to perform data collection and adjusts the orbit, wherein the helical orbit can be decomposed into circling motion on the horizontal direction and a uniform linear motion on the vertical direction, a node calculates whether itself is within the collection area of the AUV according to its own position and the orbit of the AUV, the node within the collection area waits for the AUV to arrive at vicinity of the node and performs with the AUV, and the node beyond the collection area forwards data to the collection area through multiple hops. The data collection method supports the AUV to cruise in the network to perform data collection, thereby reducing the energy consumption of the node, and the AUV does not need to broadcast a data packet while cruising in the network, thereby reducing the communication cost.

A controller apparatus of this invention includes a topology information managing unit configured to manage topology information showing a topology, a location information acquiring unit configured to acquire location information on a plurality of mobile terminals, a link information acquiring unit configured to acquire link information at the mobile terminals, a determining unit configured to determine a way to change the topology, based on the location information, the link information and the topology information, and a transmitting unit configured to generate instruction information for changing the topology, based on the determined way to change the topology, and to transmit the instruction information to a certain mobile terminal.

The invention discloses an addressing system and method aimed at layering host marking and based on overlaying DHT; structure of each addressing server in the system is identical and is provided with a node accessing and exiting processing module, an information maintenance module, a route searching module, a mapping record information memory module, and an overlaying DHT structure establishing and maintenance module. The addressing method is to set up the overlaying DHT first: non-semantic host identifiers used in the network are hierarchically transformed; area marks indicating the locating area position of each node are added; then each node is divided into different areas, and each area DHT is set up respectively; finally, all the area DHT are overlaid together to constitute a global DHT; when routes are looked for and transmitted, a next hop is chosen in priority in the area DHT based on the overlaying DHT; trans-regional routing times should be reduced to the fully extent to improve routing efficiency; each operation of registration/updating is carried out in two DHT simultaneously to realize equity of load on balance and economy.

A computer chip including a plurality of routers, each of the plurality of the routers connected to the adjacent routers in the directions of an X axis and a Y axis; and a plurality of intellectual properties, each of the plurality of the intellectual properties connected to only one of the plurality of the routers.

The invention discloses a data encryption routing method for a wide-area quantum cryptographic network, which comprises the following steps of grading a wide area network according to the number of contained metropolitan area networks, and selecting a data encryption routing path between an initial node and a destination node in a graded routing manner, therefore, the network delay is reduced, andthe management of routing nodes is facilitated.

The invention discloses a network organization method of systematic searching in a peer-to-peer network video sharing system; each node executes the following steps: (1) the super node list and the neighbor list are initialized; (2) the self-attached super node pattern is decided, and similar super node list is decided from a super node index server; (3) that whether the contact ratio of the index of the nodes of the super node list and the index of the node is smaller is judged; (4) the nodes of small index contact ratio in the super node list is added to the neighbor node list; (5) that whether the interval of the current information sending and the last information sending reaches the exchange cycle is judged; (6) update information and topological maintenance information between the super node and the neighboring node is exchanged; (7) that whether an exit request is received is judged. The method of the invention uses the super node to judge the attached pattern of the node, and adds the node of small index contact ratio in the category to the neighbor node. The method is characterized by quick index speed, stable network topology structure, self-adaptive adjustment based on the interests of the user.

In a radio communication system that includes multiple service areas, each service area is associated with a predetermined number or amount of radio communication resources. Each radio communication resource can be used for a prescribed period of time corresponding to one or more time units. An operator or other entity identifies a set of service areas to be tested at an increased effective load. A desired test level (e.g., increased traffic load) is determined, and a corresponding number of radio resource time units is determined to achieve the desired test level conditions. Use of radio communication resources in the determined one or more time units is blocked for a test period. Performance by each service area during the test period is determined.

The present invention discloses host computer and retransmission unit synchronous switching method, wherein two or more retransmission unit composing retransmission unit set and generating host equipment and spare equipment, each retransmission unit in retransmission unit set respectively connected with host computer and providing service to host computer through host equipment. Said method also includes A, each retransmission unit in retransmission unit respectively notifying oneself current host standby state to host computer; B, host computer according to each retransmission unit notified host standby state to determine host equipment in retransmission unit set, and switching host equipment connected port as host port, through host port re-establishing connection with host equipment. The present invention reduces retransmission message jump number, system time delay, band width, system resources, and interconnection cost through direct connection between host computer and host equipment.

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 provides a multi-path routing method based on a resource leveling strategy and applicable to an industrial wireless sensor network, and relates to the industrial wireless sensor network. According to the routing method, the concept of cross-layer design is adopted, comprehensive evaluation is carried out on data receiving and transmitting energy loss of a physical layer and forward queue memory loss of a network layer, and a route priority judgment strategy based on resource leveling factors is disclosed. Meanwhile, with the combination of a breadth-first search algorithm, multiple redundant routes between a data source node and destination nodes are calculated, the requirement for leveling node resources of the industrial wireless sensor network is met, and reliability of communication between the source node and the destination nodes is also improved. An ISA100.11a network is taken as an example, when a system manager in the ISA100.11a network carries out routing path calculation, a preferential path and multiple alternative paths are calculated on the basis of the topology of the current network and resource consumption situations of the sensor nodes, and routing information is distributed and stored in the nodes of the paths, and routing configuration is finished. As is proved, the method is feasible and can reach predicted effects.

The invention aims at providing a method for safely accessing a femtocell into a network, wherein the method is applied in the network comprising a femtocell gateway and an evolutionary packet systemEPS and comprises the following steps: accessing the femtocell into the network, carrying out access authentication on the femtocell by the femtocell gateway, generating femtocell secret key information in the authentication process and transmitting the femtocell secret key information into an MME; generating a user-interface security alliance between the femtocell and a service gateway accordingto the femtocell secret key information by the MME, and transmitting the user-interface security alliance into the femtocell and the service gateway; and accessing the femtocell into the service gateway by utilizing the user-interface security alliance. The invention also provides a system for safely accessing the femtocell into the network. By adopting the method, the femtocell is ensured to access into the network safely, and meanwhile, the hop count of the user interface is reduced.

The invention discloses a software defined network security situation assessment method. The advantages of SDN (software defined network) control and direct and quick information collection are combined, an open SDN security situation assessment framework is provided on account of three kinds of attacks of an SDN forwarding surface, the security framework closely fits a framework of an SDN controller, an anomaly detection module extracts characteristic indexes according to the SDN and various attack characteristics, an SVM (support vector machine) classification algorithm is selected for identification, and attack pre-judgment is given. A security situation assessment module performs quantitative assessment on network security situations according to information collected by the anomaly detection module, and attack sensitivity and noise resistance of an assessment system are regulated through setting of a threshold value. Different weights are allocated to different attacks based on an AHP (analytic hierarchy process) so as to fit out a comprehensive security situation of the network. The method is flexible and simple, attach behaviors can be detected accurately, the quantitative assessment of the security situations of the network is given, and monitoring and assessment of the security status of the SDN forwarding surface are realized with lower cost.

The invention provides a route selection method of minimum hop count based on interference sensing in a wireless D2D network. The method comprises the steps that (1) the emitting power of a D2D node is limited; (2) the highest transmission speed of each hop is computed, and a route optimization model of minimization route hop count is established; and (3) according to an MR-DA algorithm, a route from a source node to a target node is established hop by hop. Under the premise that cellular user communication quality and D2D transmission speed are guaranteed, the route with low hop count is established. By inspecting the highest transmission speed of a candidate node and the target node and the position relation of the candidate node, a current node and the target node, geographical location information and interference control are considered comprehensively, so that the generated router is close to the target node and far away from the base station at the same time, interference on cellular communication is lowered, and the transmission capacity of each hop is increased. Theoretical analysis and simulation results show that the method has the advantages that complexity is low, average hop count is low, and disconnecting probability is low.