Center calculation wireless sensor network 2-node disjoint multipath routing algorithm
A wireless sensor and path technology, applied in wireless communication, network topology, electrical components, etc., can solve the problems of multiple energy consumption, unavoidable ultra-long paths, and inability to optimize paths, and achieve the effect of avoiding data redundancy
Active Publication Date: 2014-11-12
山东普赛通信科技股份有限公司
View PDF3 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
The algorithm can satisfy the disjoint constraints of two paths, but the length of the path established by the algorithm is relatively long, and the existence of ultra-long paths cannot be avoided. At the same time, the broadcast of control information in the algorithm will lead to more energy consumption
Similarly, it is also possible to identify different colors for the direct neighbors of the sink node first, and then broadcast the color identification to find the nodes where the color identification meets, so as to establish a k-disjoint path from the source node to the sink node. The time complexity of the algorithm is only O(L) (L is the number of edges in the network), but this algorithm still cannot effectively optimize the path
In addition, someone proposed a disjoint path routing algorithm based on geographical location information. These two algorithms are also distributed algorithms. Get the optimal disjoint multipath from source node to target node
There are two main challenges faced by the DMPR algorithm: one is the optimal selection of disjoint paths, and the other is the transmission of data packets on disjoint paths.
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0072] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.
[0073] The working principle of the present invention is as follows:
[0074] 1. Collection of neighbor information
[0075] 1.1 rreq packet format
[0076]
[0077] Type Packet type, the value is RREQ_MSG
[0078] RREQ_ID rreq packet id, the value is the node number of the source node that generated rreq
[0079] Flag The group number of the neighbor information. Due to the limitation of the network bandwidth, the neighbor information is sent in three groups. The value of this attribute can be INFO_FIRST, INFO_SECOND, INFO_THIRD.
[0080] Bit Path information bit value, after the path is established, rreq is sent according to the Bit value according to the established optimal path
[0081] Hopcnt The number of hops from the source node to the node that is processing the rreq packet.
[0082] Origineaddr The node number of the node sending rreq,...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention relates to a center calculation wireless sensor network 2-node disjoint multipath routing algorithm which adopts a central-dispatching type adaptive route maintenance mechanism to enhance the flexibility of the path maintenance. During the data routing, a data package only needs to carry a path bit sequence, and meanwhile, no control cost is required. According to the disjoint multipath routing algorithm, the hop count and the quality of the link are taken as metrics, the approximately optimal 2-node disjoint path from source node to the sink node is calculated by utilizing the whole network information, and then the micro-routing table containing main nodes, auxiliary nodes and the path bit sequence is generated and then transmitted to the nodes.
Description
technical field [0001] The invention relates to a 2-disjoint path routing algorithm for a central computing wireless sensor network. Background technique [0002] In wireless sensor networks, compared with single-path routing mechanisms, multi-path routing mechanisms have obvious advantages in improving network reliability, balancing loads, and fault-tolerant recovery. However, in multi-path routing, multiple paths from the source node to the destination node may contain common nodes (links), and the failure of the common node (link) will cause the failure of multiple paths passing through it. In order to avoid the appearance of common nodes (links), researchers propose a disjoint multipath mechanism. [0003] Preetha Thulasiraman et al. proposed a distributed 2-disjoint routing algorithm. This algorithm first builds two color trees, red tree and green tree, in the network. The way of path growth is to start from the sink node with depth-first search. way to establish two ...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & AuthorityPatents(China)
IPC IPC(8): H04W40/02H04W84/18
Inventor于磊磊于玉杰陈冬岩
Owner山东普赛通信科技股份有限公司