45 results about "Current neighbor" patented technology

The invention discloses a method for realizing graceful restart of a link state routing protocol, comprising the following steps: after graceful restart (GR) is completed, a switching router determines current self link state information of GR according to link state data base (LSDB) transmitted by a neighbor supporting GR function and obtains all current neighbor information of the GR; the neighbors comprise neighbors supporting GR function and neighbors not supporting GR function; in preset waiting time, the switching router judges the neighbourhoods of all neighbors are successfully established, refreshes self link state information and informs the network; the invention also provides a device for realizing graceful restart of a link state routing protocol; with the device and method of the invention adopted, routing oscillation can be resolved in the application environment where the switching router is in coexistence with a part of neighboring routers not supporting GR function.

The invention relates to a self-adaption data distributing method based on node density distribution in a vehicle-mounted ad hoc network. The method comprises the following steps: when nodes in the vehicle-mounted ad hoc network come across and a message is needed to be sent, judging the nodes are located in a hotspot area or non-hotspot area according to present positions of the nodes; if being in the hotspot area, selecting a node with a maximum node degree from present adjacent nodes to forward the message; if being in the non-hotspot area, adopting an infective routing protocol data distributing system to generate a message copy and directly forwarding the message; using a distribution type density sensing algorithm to quickly acquire space distribution information of the network nodes and hotspot area; using a hop limit function based on graph theory and complex network theory to estimate an average distance for forwarding the message to the hotspot area; and performing dynamic hop limit on the message by using priori knowledge of node space distribution, thereby realizing dynamic adjustment of a message forwarding mode, acquiring high performance close to the infective routing and obviously reducing quantity of redundancy message copy.

In response to a determination that a received pilot signal identification is not present in a current neighbor list of a mobile station, a network controller identifies one of a plurality of sectors associated with the missing pilot signal identification that is a most likely handoff candidate. In one embodiment, the most likely handoff candidate is determined as the sector that is closest to the mobile station. When the most likely candidate is identified, a handoff may be initiated between the mobile station and the identified sector. The handoff may be accomplished by activating a traffic channel for the mobile station in the identified sector.

The invention relates to a processing method and a processing device of neighbor entries. The processing method comprises the following steps of: counting the quantity of neighbor entries in a current neighbor table; when the quantity of the neighbor entries is increased, judging whether the quantity is larger than a preset neighbor entry threshold, and if so, shortening the hold time of newly-applied entries and the existing entries; when the quantity of the neighbor entries is reduced, judging whether the quantity is smaller than a preset neighbor entry threshold, and if so, prolonging the hold time of the newly-applied entries; and when the existence time of some neighbor entry in the current neighbor table is time-out, sending a detection signal to a first node corresponding to the time-out neighbor entry; and if the response of the first node on the detection signal is received within the preset time threshold, prolonging the hold time of the neighbor entry corresponding to the first node, and or else, cancelling the neighbor entry corresponding to the first node. The processing method and device disclosed by the invention have the capabilities of automatically adjusting the hold time of the neighbor entries, canceling the invalid neighbor entries, reducing the pressure to system resources and improving the utilization rate of resources.

The invention discloses an intra-domain dynamic multipath generating method based on a generating tree. The method comprises the following steps: adding root nodes into a created priority queue according to a priority structure; judging whether the priority queue is empty or not, if not, selecting a first queue element of the priority queue, and deleting the first queue element; accessing all neighbor nodes of the first queue element, judging whether each node is accessed or not, if not, updating node information, adding updated information into the priority queue, otherwise, calculating a next hop from the root nodes to the first queue element and a next hop from the root nodes to a current neighbor node according to a set rule; after all neighbor nodes are accessed, returning to the step for judging whether the priority queue is empty or not. When a chain state changes, a generated shortest path tree is adjusted dynamically, and a next hop is updated without recalculation. According to the method, a plurality of loop-free paths are calculated from the root nodes to all destination nodes; meanwhile, the complexity of an algorithm is lowered.

The present invention provides a neighbor optimization method and device. The method comprises the steps of: obtaining information of each neighbor cell of a first cell according to pre-obtained measurement report original (MRO) measurement report, a measurement report event (MRE) measurement report and pre-configured neighbor information; obtaining one correlation index of the first cell and eachneighbor cell according to the MRO and the MRE; obtaining one distance between the first cell and each neighbor cell according to the pre-configured neighbor information and information of each neighbor cell; and performing neighbor cell optimization of the first cell according to one correlation index of the first cell and each neighbor cell and the distances. The neighbor optimization method and device performs combination analysis of the neighbor based on the MRO and the MRE to accurately and effectively assess a current neighbor condition so as to guide the optimization of the neighbor, is advanced in technology, high in exploitativeness, accurate in neighbor checking and comprehensive in checking content.

The invention discloses an implementation method of home WIFI roaming, which adopts an AP1 set as a main AP, and expansion APs, i.e., an AP2, an AP3 and an AP4. Firstly, a STA sends a request to the AP2 and requests to acquire a neighbor list in a current environment, which is replied to the STA by the AP2 after a current neighbor list; then the STA acquires connection parameters of each AP; thenthe AP2, the AP3 and the AP4 send WIFI signal parameters for the same AP to the main AP; then after acquiring an optimal roaming target AP of the STA according to a specific method, the main AP sendsthe target AP to the AP2 with which the STA is currently connected; then the AP2 notifies the STA to roam to the AP3 by a 802.11v protocol; and after receiving a message of the AP2, the STA actively roams to the AP3 so as to complete roaming. In the invention, a WIFI roaming mode sufficiently utilizes interaction in the new 802.11k protocol, which is related to neighbor info, and information interaction between the STA and each to-be-roamed AP is increased; and by a BSS Transition function in the 802.11k protocol, the roaming target AP is notified to the STA, so that the WIFI roaming is more accurate, and the problems of data temporary interruption, poor WIFI signal after roaming and the like of the conventional WIFI roaming are avoided.

The invention relates to a routing method of a DTN (Delay Tolerant Network) based on a social network task distribution model, belonging to the technical field of DTN wireless networks. The method comprises the following steps of step 1, determining objects in the network, namely social resources of nodes and homes: auxiliary nodes arranged by a frequent access region of the nodes) and social reputation values of the nodes; step 2, enabling the home with a to-be-forwarded information task to negotiate according to a principle of proximity, select an optimal neighbor home as a cooperator of the information task from the neighbor home and restrict the number of the cooperators; step 3, after the home determines the appropriate cooperative home, selecting an optimal routing node from the current neighbor according to the requirements of the information task on the social resources; step 4, during a process that a relay node forwards the information tasks, adopting different distribution ways according to the types of the information tasks and carrying out rewards and punishments according to the completion condition of the information tasks by the nodes; and step 5, after the information tasks are distributed, waiting for an information task carrier home to complete the requirements of the information tasks. According to the method, the reliability for distribution of the different information tasks can be improved, the delivery rate of the information is improved, and the network overhead is reduced.

The invention provides a node in P2P stream media and a method for optimizing a neighbor node table of the node. The method comprises recoding historical online status information of a first node, historical online status information of all correlative nodes, and network delay information and transmission bandwidth information between all the nodes and the first node by using the first node; obtaining all information recorded in the last step when the first node is online and calculating comprehensive availability values between the first node and all the correlative nodes in order to obtain a comprehensive availability value sequence; selecting large-value [gamma] nodes from the sequence as optimum neighbor nodes of the first nodes; replacing current neighbor nodes in the neighbor node table of the first node with the optimum neighbor nodes, wherein the first node is any node in a P2P network, the correlative nodes are a plurality of historical neighbor nodes with relatively high comprehensive availability during the time quantum between the time when the first node is online at the first time and current time, and current neighbor nodes stored in the neighbor node table at the current online time of the first node.

The invention provides a method and a device for preventing traffic from interrupting. According to the method and the device, a timer T1 and a function of keeping neighbor connection continuous are configured on routing equipment, when the configuration of an intermediate system to intermediate system routing protocol (IS-IS) of the routing equipment is changed, the connection between the routing equipment and current neighbors can be continuously maintained in a T1 time, and the update of link-state packets (LSPs) of the routing equipment and the current neighbors can also be ensured in the T1 time, and the traffic is continually to be forwarded for preventing the traffic from interrupting by utilizing the routing equipment and routers of the current neighbors.

The method includes: The preset receiving rate of message is dynamically adjusted and the current receiving rate is calcualted according to the current volume of neighbour retransmission list when OSPE protocol receives refreshing message. The refreshing message is discarded if the current receiving rate of message is quicker than the preset receiving rate for raising greatly stability of OSPE protocol at the condition of multineighbour and big route.

The invention discloses a network side device, a terminal and a neighbor cell measurement method thereof. The method comprises the following steps: judging whether a DRX time interval distributed by current network side equipment is enough to perform current neighbor cell measurement or not; when the DRX time interval is not enough to perform current adjacent cell measurement, sending a message for representing a request for reconfiguration of discontinuous reception configuration parameters to the network side equipment, so that the network side equipment judges whether to reconfigure the discontinuous reception configuration parameters or not according to the current communication service quality requirement; and after a message representing that the network side device evaluates the request for reconfiguring the discontinuous reception configuration parameters is received, obtaining an extended DRX time interval when the updated discontinuous reception configuration parameter message is received. With the adoption of the scheme, the quality of the communication service and low power consumption can be maintained while the adjacent cell measurement duration of the 5G terminal isprolonged.

The invention discloses a method for acquiring neighbor cell information in a wireless network. The method comprises the following steps that: a wireless network access point informs a wireless network terminal of the wireless access system types of the current neighbor cell; the wireless network terminal selects the target system from the wireless access system types according to own current service requirement and informs the wireless network access point of the target system; and the wireless network access point inquires all the neighbor cell information in the target system from a core network according to the target system selected by the wireless network terminal and sends the inquired neighbor cell information to the wireless network terminal. The invention also discloses a system for acquiring the neighbor cell information in the wireless network. The method and the system have the following beneficial effect: the requirement of the wireless network terminal for freely selecting the access methods can be met.

The invention discloses an intra-domain multipath generating method based on a spanning tree. The method comprises the steps of adding nodes into an established priority queue according to a priority structure; judging whether the priority queue is empty, and if not, selecting and deleting a queue header element of the priority queue; having access to all neighbor nodes of the queue header element, judging whether access to the nodes are had, if not, then updating node information and adding updated information to the priority queue, otherwise, calculating the next single hop from a root node to the queue header element and the next hop from the root node to the current neighbor node; if having access to all the neighbor nodes, returning to the step of judging whether the priority queue is empty. According to the intra-domain multipath generating method based on the spanning tree, a plurality of paths without circles can be calculated for the operation algorithm from a certain node to a target node, and it is only necessary to maintain one multipath tree for the nodes of the operation algorithm, so that complexity is reduced.

The embodiment of the invention discloses an SRVCC switching failure punishment processing method and device. The method comprises the following steps: if a switching failure punishment switch is in an on state and the number of preparation failures of switching all cells of a base station to an external neighbor cell within a switching failure statistical duration is greater than a switching failure number threshold, setting the state of a current neighbor cell to be a state in which the current neighbor cell is not allowed to be switched; and after the current neighbor cell is set to be a state in which the current neighbor cell is not allowed to be switched for the switching failure punishment duration, taking the current neighbor cell as the candidate cell of the SRVCC switching again.By setting the SRVCC switching failure punishment switch, the switching failure statistical duration, a switching failure frequency threshold value and a switching failure punishment duration, when the number of preparation failures is larger than the threshold value of the number of switching failures, the cell is set to be a cell not allowed to be switched, the cell is recovered to be the candidate cell after the punishment duration of the switching failures ends, SRVCC switching to a problematic cell can be stopped in time, switching to the problematic cell cannot be forbidden, the switching success rate can be effectively improved, and meanwhile the KPI of the network is improved.

Techniques are described herein for processing video data. For instance, a current block of a picture of the video data can be obtained, and it can be determined that the current block includes more than one virtual pipeline data unit (VPDU). Current neighbor samples for the current block, reference neighbor samples for the current block, and additional neighbor samples for the current block can be obtained for illumination compensation. One or more illumination compensation parameters can be determined for the current block using the current neighbor samples, the reference neighbor samples, and the additional neighbor samples. The additional neighbor samples are used for determining the one or more illumination compensation parameters based on the current block covering more than one VPDU. Illumination compensation can be performed for the current block using the one or more illumination compensation parameters.

A payment method and device are provided. The payment method includes: a server receives a passwordless payment request transmitted from a terminal, and receives a current neighboring apparatus identifier search-detected and reported by the terminal; the server performs, according to the current neighboring apparatus identifier, and a corresponding relationship of a preconfigured terminal and a neighboring apparatus identifier, risk evaluation on the terminal, to obtain an overall risk evaluation score; and the server determines, according to the overall risk evaluation score, a passwordless payment strategy corresponding to the passwordless payment request. The server performs the risk evaluation on the current surrounding environment of the terminal to obtain the overall risk evaluation score, and then determine, according to the overall risk evaluation score, security of the current surrounding environment of the terminal, and determine the corresponding passwordless payment strategy corresponding to the passwordless request.

The invention discloses an uplink interference coordinating method applied to irregular networking. The method comprises the steps of A, setting the pilot power ratio (PPR) threshold value (PPR[th]) and reference signal receiving power (RSRP) threshold value (RSRP[th]) of each cell; B, taking the m neighbor cell as the current neighbor cell for a user in a service cell; C, determining the type of the user according to the RSRP of the service cell, the RSRP of the current neighbor cell and the corresponding threshold values; D, if the user is an edge user, allocating the resources on the edge frequency band to the user, and if the user is a center user, allocating resources to the user according to the type of the center user, wherein the resources on the whole frequency band can be used by the user. The technical scheme can be applied to hybrid networking according to which a network contains both an omnidirectional antenna and a directional antenna.

The invention discloses a D2D communication relay node selection method in an electric power communication system, and the method comprises the steps that a current terminal constructs a neighbor terminal list which comprises a plurality of neighbor terminals of the current terminal; The current terminal performs priority ranking on a plurality of neighbor terminals in the neighbor terminal list according to a predetermined strategy; When the current terminal receives the overload warning message of the current neighbor terminal, the priority of the current neighbor terminal is reduced in theneighbor terminal list according to the overload warning message, and the current neighbor terminal only sends the overload warning message to the neighbor terminal of the current neighbor terminal when the service load exceeds a load threshold; And when the current terminal needs to perform D2D communication, the neighbor terminal with the highest priority in the neighbor terminal list is selected as a relay node, and a D2D communication link is established with the relay node to perform D2D communication. The communication efficiency can be improved.

The invention relates to a good neighbor set construction method for assisting mobile node position anomaly detection, which can obtain the specific area of a node through area division according to the position data of the mobile node in each time slice, and further discover the current neighbor relation of the node. On the basis, a current good neighbor set of the node can be constructed according to a plurality of neighbor relations of the node under a continuous time slice with a certain length, meanwhile, the neighbor number mean value of the node is counted, and finally, whether the position information of the mobile node in the current time slice is abnormal or not is judged according to the good neighbor set and the neighbor number mean value. The method can be applied to traffic monitoring of common roads, tunnels and bridges in smart cities.

The embodiment of the invention provides an inter-system neighbor cell selection method and device, computer equipment and a storage medium. In the technical scheme provided by the embodiment of the invention, the method comprises the steps: acquiring an inter-system switching selection table of a current cell, wherein the inter-system switching selection table comprises switching information of a plurality of adjacent cells, and the switching information comprises a switching selection threshold; determining the neighbor cell corresponding to the first switching information in the inter-system switching selection table as the current neighbor cell; if it is judged that the received level value of the current neighbor cell is greater than or equal to the switching selection threshold, determining the current neighbor cell as the switching neighbor cell, and selecting the switching neighbor cell by using the switching historical information in the inter-system switching selection table, thereby eliminating the situation of accidental switching failure or accidental switching success, realizing accurate positioning of the neighbor cell, efficiently and accurately selecting optimal switching neighbor cell, improving the switching real-time performance, enhancing the service continuity and flexibility, and saving the switching cost.