30results about How to "Improve the success rate of forwarding" patented technology

The invention relates to a method for realizing vehicle-mounted mobile self-organized network routing, which is characterized by comprising the following steps that: (1) a static node is arranged at each intersection; (2) when forwarding a data packet, a source node can forward the data packet to the static node relatively close to a target static node at one end of a road section where the source node is positioned; (3) when forwarding the data packet, the static node firstly judges whether the static node closer to the target static node is in a neighbouring list or not, if so, the static node directly forwards the data packet to the corresponding static node, otherwise, the static node selects a neighbouring road section according to a road section selection algorithm, and then appoints another static node on the selected road section as the static node of a road section receiving terminal, wherein the neighbouring road section is not the road section which just receives the data packet; and the road section direction of the neighbouring road section is close to the target static node; and (4) when receiving the same data packet transmitted from the same source node from different road sections, a routing static node selects an optimal route which is high in the success rate for receiving the data packet and relatively short in delay time, and forbids the receiving routes which are not optimal at the same time.

The embodiment of the invention provides a method and a device for forwarding multicast messages. The method is applied to a stacking system including a plurality of forwarding units. Each forwarding unit implements the following steps: receiving a first multicast message through any entrance interface, and judging whether local exit interfaces include exit interfaces of the first multicast message according to the open mode of a VLAN corresponding to the entrance interface and a locally-preset multicast table entry; forwarding the first multicast message through corresponding exit interfaces if the local exit interfaces include exit interfaces of the first multicast message, and carrying a VLAN identifier in the first multicast message to form a second multicast message and forwarding the second multicast message through each local stacking port; and carrying a VLAN identifier in the first multicast message to form a second multicast message and forwarding the second multicast message through each local stacking port to instruct the current forwarding unit receiving the second multicast message to perform a series of forwarding processes if the local exit interfaces do not include exit interfaces of the first multicast message. Forwarding of a single message among the stacking ports of the stacking system is realized, and bandwidth consumption of the stacking ports is reduced.

The invention discloses a detection method for wrong GR status access, which comprises the processes that: the indication whether a router is rebooted is set in a neighborhood building datagram; when the router detects that the neighborhood with a neighboring router is interrupted and the router is not rebooted, the router gets to the GR status and makes a mark on the LSP of a neighboring router saved in the router, and receives the neighborhood building datagram sent by the neighboring router; when the router detects that the datagram does not carry the indication that the neighboring router is rebooted, then the router exits the GR status and deletes the mark on the LSP. The invention simultaneously also discloses a router, which comprises a neighborhood detecting module, a reboot detecting module, a relationship datagram receiving and processing module and a GR module. The invention can detect that the GR status is wrongly got to in time, thus reducing the unnecessary signaling and data interaction, lowering the occupation of the CPU resources, and resulting in that the newly generated routing can be allocated to the LSP in time so as to enhance the success rate of the data forwarding.

The invention provides a data routing method and a sensor node. The method comprises the following steps: establishing a plurality of routes to a sink node; receiving a negative feedback command sent from at least one next-hop node on the plurality of routes, wherein the negative feedback command comprises the value of the parameter level of the at least one next-hop node; calculating the forwarding probability of a plurality of next-hop nodes on the plurality of routes according to the values of the parameter levels of the plurality of next-hop nodes on the plurality of routes, wherein the values of the parameter levels of the plurality of next-hop nodes comprise the value of the parameter level of the at least one next-hop node and the stored values of the parameter levels of the other next-hop nodes in the plurality of routes; and selecting the next-hop node according to the calculated forwarding probability of the plurality of next-hop nodes on the plurality of routes, and sendingthe data to the selected next-hop node. The sensor node provided by the invention comprises an establishing module, an interface module, a calculating module and a routing module. The invention can ensure the data transmission.

The invention belongs to the field of delay tolerant network (DTN), and specifically relates to a delay tolerant network node cache management method facing epidemic and probabilistic hybrid routing. The method comprises the following steps: whether a node in a network needs to send a message is judged firstly; if the node in the network needs to send the message, a step (2) is executed; if the node in the network does not need to send the message, a step (8) is executed; neighbor nodes of the node needing to send the message is traversed; and, if the number L of the neighbor nodes is equal to 1, a step (4) is executed, otherwise, a step (5) and the like are executed. Characteristics of an epidemic routing method and a probabilistic routing method are integrated, and the number of duplicates of the same message is effectively controlled; and, compared with the probabilistic routing method, the delay tolerant network node cache management method enables a delay of the message arriving at a target node to be reduced.

The invention relates to a topology construction and internet access method for an aviation ad-hoc network. In the method, a flight process is divided into five stages including a dormancy stage, a waiting stage, a take-off stage, a cruising stage and a landing stage; a corresponding topology construction and data transmission strategy is provided for a flight node in a specific flight stage, wherein a waiting node is used as a connection point between an ad-hoc network in the air and a ground network, passively accepts network access requests of other nodes, and is mainly responsible for data relay; on one hand, a take-off node rapidly establishes a link information table; on the other hand, the take-off node accepts a request of the waiting node, carries data of the ground network, and rapidly diffuses data of the ground network in the ad-hoc network in the air; a cruising node regularly updates the link information table, and selects the optimal and backup link to perform data exchange in the air according to a link distance and the link duration; and a landing node rapidly forwards the data of the network in the air to the waiting node, and finally forwards the data into the ground network. By means of the topology construction and internet access method for the aviation ad-hoc network disclosed by the invention, fully connected topology can be rapidly formed; and communication between the aviation ad-hoc network and the ground network is realized.

The invention relates to a wireless delay-tolerant network routing method based on a multi-layer network, and belongs to the field of computer network technologies. The method is based on the following rule comprising a one-copy routing strategy, and a TTL field of each message which identifies the life time of the message, wherein the field is continuously reduced along with time, and when the field is reduced to zero, the message is discarded. The method comprises the following steps of firstly establishing a multi-layer social graph according to social contact information such as historical meeting records, historical communication records, friend lists of online social contact platforms and interest set data; then extracting a social contact attribute according to the multi-layer social graph; then computing a corresponding social contact index according to social contact attribute; and at last determining that whether to forward a data packet according to the social contact index. Compared with the prior art, the method effectively improves the success rate for forwarding the DTN network message, and is applicable to the network environment which has a certain tolerance to transmission delay but is high in requirement on the success rate for forwarding the message.

The invention is applicable to the field of network technology improvement, and provides a multimode identification network addressing method based on coordinate mapping, which comprises the followingsteps: S1, mapping a multimode identification network with no scale to a three-dimensional hyperbolic space by endowing each node in a network with a three-dimensional spherical coordinate; s2, the sender of the message attaches the node coordinates of the destination of the sender to each segment of message; and S3, when the routing node forwards the message, the hyperbolic distance between thedestination and each adjacent node is calculated, and the smallest hyperbolic distance is selected as a forwarding object. The algorithm depends on less global information, is simple in calculation, and is easy to finish locally, so that the adaptability to a large-scale network is improved.

The invention discloses a community routing algorithm based on node interest. A social network is combined with a DTN, and social attributes of nodes are embedded into the DTN. In the algorithm, a community is partitioned according to interests of the nodes, namely, the nodes with the same interests are grouped into the same communities. In a message forwarding strategy, the communities are taken as bases. If nodes carrying messages and a target node have the same interest intersection, a source node forwards a message to a node with high social intensity in an intersection community, and the message is forwarded to the target node through the node with the high social intensity. If the source node and the target node do not have any interest intersection, the source node forwards the message to a node with high community sensing intensity, and the message is forwarded to a community in which the target node is positioned through the node, forwarded to the node with the high social intensity in the community, and forwarded to the target node finally. Compared with a conventional DTN routing algorithm, the algorithm has the advantages that when Epidemic is compared with Prophet, the forwarding success rate of messages is effectively increased, and the load and the average hop count are reduced.

The invention belongs to the communication technology field and especially relates to an opportunity network data distribution method based on a centrality degree and an opportunity network system. The opportunity network data distribution method based on the centrality degree comprises the following steps of stepS1) calculating a centrality degree of a node and a data transmission probability; stepS2) generating new data and a forwarding token of the data by a source node, for the node whose the forwarding token number is not 1, according to the data transmission probability and a future meeting probability of the node and a destination node, carrying out half division processing till that the forwarding token is 1 or the data is successfully forwarded to the destination node. By using the opportunity network data distribution method based on the centrality degree, under the condition that a transcript is not added, a data forwarding success rate is increased and data forwarding time delay is reduced.

The invention discloses a dynamic game-based partial discharge monitoring wireless sensor network communication method, which comprises the following steps of: S1, constructing a forwarding node alliance in a dynamic planning manner, searching neighbor nodes by taking a radius as a basis, and screening forwarding nodes by taking residual energy as a basis; S2, the delineated neighbor nodes play a game, and a forwarding queue is constructed according to the maximum membership degree principle; S3, the source node and the queue head node establish a communication link for message forwarding, and meanwhile, the second node and the third node serve as standby next-hop nodes; and S4, the nodes in the alliance not in the standby range are firstly released, and the standby nodes are released after the message is successfully forwarded. The residual energy parameter is introduced during multi-path message forwarding, so that the success rate of message forwarding is improved; the two parameters of the spatial distance and the residual energy are integrated to construct a forwarding queue, so that the message forwarding rate can be improved; and a method of orderly releasing the forwarding tasks after the forwarding tasks are completed by the dynamic game alliance is adopted, so that the node multiplexing efficiency is improved.

The invention provides a method for realizing an opportunistic routing protocol of an underwater acoustic sensor network based on a cluster topology. The opportunistic routing protocol is combined with the cluster topology, and the forwarding node determines the flow direction of the data packet according to the position of the adjacent cluster and the density of the node, so as to improve the data packet flow direction. One-hop transmission success rate and effectively avoid the communication empty area. At the same time, the cluster topology is used to sparse the network, thereby significantly reducing the routing control overhead, overcoming the drawbacks of the traditional stateful opportunistic routing control overhead, and improving the network energy utilization. The intra-cluster node-assisted mechanism is used to establish inter-cluster forwarding. After the master node fails to forward, other nodes in the cluster compete for forwarding, which improves the success rate of inter-cluster forwarding and reduces packet retransmission. The node considers the remaining energy of the node when evaluating its own priority, so the network energy consumption can be distributed to each node, solving the hotspot problem and effectively prolonging the network life.