Wait and Epidemic routing algorithm
A routing and algorithm technology, applied in digital transmission systems, electrical components, transmission systems, etc., can solve problems such as high routing overhead, increased probability of data packet collision, small transmission delay, etc.
Inactive Publication Date: 2011-09-28
BEIJING TECHNOLOGY AND BUSINESS UNIVERSITY
View PDF1 Cites 4 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0019] 2. Routing overhead
High routing overhead means that nodes forward a large number of data packets, which will flood the network with a large number of data packet copies, increase the probability of data packet collisions, and consume a lot of node energy
[0021] 3. Transmission delay
[0023] In order to pursue high transmission success rate and small transmission delay, the traditional opportunistic network routing algorithm usually forwards a large number of data packets, and a large number of invalid data packet forwarding becomes a prominent problem of node energy consumption.
Traditional routing algorithms do not take energy consumption as an important indicator, so it is difficult to apply to scenarios where energy becomes a scarce resource
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
[0041] The principles and features of the present invention are described below, and the examples given are only used to explain the present invention, and are not intended to limit the scope of the present invention.
[0042] In order to describe the Wait and Epidemic (WE) routing algorithm more clearly, an example implemented on the simulation platform is given below. ONE (the Opportunistic Networking Environment) is a well-recognized simulation platform in the field of opportunistic networks and the most important tool for performance comparison and evaluation of various routing algorithms. This implementation example is based on the real urban environment (Helsinki) scene, with pedestrians walking in the simulated scene with smart Bluetooth devices as nodes, the nodes will randomly generate data packets, and copy and forward the data packets according to the routing algorithm. The specific scene settings are shown in Table 1.
[0043] Table 1 Simulation Scenarios
[0044...
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 an opportunistic network routing algorithm named as Wait and Epidemic. The routing algorithm has the functions of enabling a node in an opportunistic network to forward a data packet highly efficiently and simultaneously reducing the energy consumption of the node as much as possible. The routing algorithm divides a forwarding process of the data packet into a Wait stage and an Epidemic stage. The data packet enters the Wait stage at first, and in the stage, a Direct Delivery routing strategy is adopted; and the data packet not reaching a target node in the Wait stageenters the Epidemic stage in which a finite flooding strategy is adopted. The algorithm has W, K and M parameters, and the number of invalid data packet copies in the network can be effectively reduced by properly setting the parameters so as to realize optimal overhead-approaching overhead and a high delivery ratio which are difficult to realize by the conventional opportunistic network routing algorithms. The routing algorithm is suitable for occasions in which energy becomes a scarce resource, such as the occasions after disasters.
Description
technical field [0001] The invention relates to an opportunistic network routing algorithm. The function of the invention is to enable nodes in the opportunistic network to efficiently forward data packets while consuming as little node energy as possible. Background technique [0002] An opportunistic network is a self-organizing network that can tolerate network communication, delay and split by using the encounter opportunities brought about by node movement without the need for a complete path between the source node and the destination node. Opportunistic networks are different from traditional multi-hop wireless networks in that their nodes are not uniformly deployed, the network scale and the initial positions of nodes are not preset, and the path between source nodes and destination nodes cannot be determined in advance. Opportunistic networks use the "store-carry-forward" mode to transmit information hop by hop to achieve inter-node communication. Its architecture i...
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 IPC IPC(8): H04L12/56H04L12/721
Inventor 孙践知肖媛媛陈红倩陈丹
Owner BEIJING TECHNOLOGY AND BUSINESS UNIVERSITY