CN102970223B - There is the Epidemic method for routing of avoidance mechanism - Google Patents
There is the Epidemic method for routing of avoidance mechanism Download PDFInfo
- Publication number
- CN102970223B CN102970223B CN201210239802.9A CN201210239802A CN102970223B CN 102970223 B CN102970223 B CN 102970223B CN 201210239802 A CN201210239802 A CN 201210239802A CN 102970223 B CN102970223 B CN 102970223B
- Authority
- CN
- China
- Prior art keywords
- algorithm
- routing
- node
- packet
- epidemic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of opportunistic network routing algorithm, effect is to have improved Epidemic routing algorithm, makes the efficient forwarding data bag of node in opportunistic network, while consumption of network resources as few as possible. Epidemic routing algorithm in some scene, can obtain very high transmission success rate and very low transmission delay, but the adaptability of algorithm is poor, in other scenes, algorithm performance can sharply decline. The present invention proposes avoidance mechanism, and improve Epidemic routing algorithm with this mechanism. Avoidance mechanism can reduce the quantity of packet copy in network effectively, suppresses crowding-out effect, improves the performance of routing algorithm, and then improves the extensibility of Epidemic routing algorithm.
Description
Technical field
The present invention relates to opportunistic network routing algorithm, effect is to make the efficient forwarding data bag of node in opportunistic network, reduces as far as possible network resource consumption simultaneously.
Background technology
Opportunistic network is that one need to not exist fullpath between source node and destination node, utilize the chance of meeting that node motion is brought realize network service, time delay and the tolerable self-organizing network of division. Opportunistic network is different from traditional multi-hop wireless network, and its node is not unified deployment, and network size and node initial position set in advance, and the path between source node and destination node can not determine whether exist in advance. Opportunistic network is realized inter-node communication with " store-carry-forward " pattern hop-by-hop transmission information, and its architecture is different from multi-hop wireless network, and it inserts a new protocol layer that is called as bundle layer between application layer and transport layer.
Can process the insoluble problems of conventional wireless network technology such as network division, time delay due to opportunistic network, can meet the network service needs under mal-condition, it is mainly used in the occasion that lacks the communications infrastructure, network environment badly and tackle urgent accident.
1. contrast routing algorithm
For contrasting with routing algorithm of the present invention, 2 kinds of typical routing algorithms are chosen as comparator algorithm. Epidemic algorithm is the Typical Representative based on the tactful routing algorithm that floods, and much all can be considered it is to be derived by this algorithm based on the tactful routing algorithm that floods. SprayandWait algorithm is to flood according to certain strategy, is based on the limited strategy that floods, and the main performance index of this algorithm all has significant advantage under most scenes.
(1) Epidemic algorithm
The basic thought of Epidemic algorithm is in the time that 2 nodes meet, to exchange the packet that the other side does not have, and after enough exchanges, each non-isolated node will be received all packets in theory, thereby realizes the transmission of packet.
In Epidemic algorithm, each data are surrounded by a mark that the overall situation is unique, preserve a summary vector and be used for recording the packet carrying in node in each node. In the time that 2 nodes meet, first both sides exchange summary vector, know that the other side carries after packet situation, and both sides only transmit the packet that the other side does not have.
Epidemic algorithm is the one algorithm that floods in essence, and the success rate of this algorithm energy maximum data bag transmission, minimizes transmission delay, but also can make to have a large amount of packet copies in network theoretically, consumes a large amount of Internet resources.
Epidemic algorithm has 3 targets, is respectively maximum transmission success rate, minimum transmission delay and minimum network resource consumption. Realizing above-mentioned target needs specific scene, under most scenes, causes the performance of routing algorithm significantly to decline owing to excessively flooding.
(2) SprayAndWait algorithm
SprayandWait algorithm is divided into 2 stages. First be the Spray stage, the coated neighbor node that is diffused into of partial data in source node; Then enter into the Wait stage, if the Spray stage is not found destination node, the node that comprises packet is sent to destination node in DirectDelivery mode by packet, only in the time running into destination node, sends packet. This algorithm transmission quantity is less than Epidemic algorithm significantly, and transmission success rate is high, and transmission delay is less, and algorithm applicability is strong.
2. metric
The metric of evaluating opportunistic network routing algorithm performance indications mainly contains:
(1) transmission success rate
Transmission success rate (DeliveryRatio) is the ratio that successfully arrives the need transmission packet sum that destination node packet is total and source node sends within the regular hour, this index has been portrayed the ability of the correct forwarding data bag of routing algorithm to destination node, is most important index.
(2) transmission delay
Transmission delay (DeliveryDelay) is that packet arrives the required time of destination node from source node, conventionally adopts average transfer delay evaluation. The little meaning routing algorithm of transmission delay transmittability is strong, efficiency of transmission is high, also means in transmitting procedure and will take less Internet resources.
(3) routing cost
Routing cost (Overhead) refers to the sum of node for data forwarding bag within a certain period of time, conventionally with all recently evaluations that successfully arrive the number-of-packet of destination node and the packet sum that all nodes forward. Routing cost is high, means node forwarding data bag in large quantities, can make to be full of a large amount of packet copies in network, increases the probability that packet bumps, and also can consume in large quantities node energy.
3.Epidemic algorithm performance is analyzed
Taking table 1 scene as basis, respectively to packet add up to 50 and every node generate 10 packets 2 kinds of situations and carry out emulation, obtain result shown in Fig. 1, Fig. 2.
In Fig. 1, Fig. 2, with SprayAndWait algorithm in contrast, this algorithm can obtain and approach optimum transmission success rate and routing cost under most scenes, and no matter the scale of network can keep good performance, has good extensibility.
Can be obtained as drawn a conclusion by Fig. 1, Fig. 2:
(1) very high transmission success rate and the low-down transmission delay of Epidemic algorithm under some specific scenes are greatly better than contrast algorithm in these two indexs;
(2) in data packet number one timing, the increase of nodes quantity can improve the performance of routing algorithm;
(3), under some scene, the factor that exists some and network application environment to be closely related can cause the performance of Epidemic algorithm significantly to decline.
Fig. 3, taking table 1 scene as basis, has described in the total certain situation of node the relation between data packet number and transmission success rate. When packet increases as shown in Figure 3, transmission success rate declines thereupon. The reason that produces this phenomenon is referred to as crowding-out effect by the present invention, in the time needing to transmit packet sum in network and exceed the storable packet total amount of node, can there is nodal cache saturated phenomenon, when now node receives new data packets, have to abandon old packet according to certain rule, the existence of this effect causes Epidemic algorithm performance significantly to decline.
Summary of the invention
The present invention relates to a kind of new opportunistic network routing algorithm, this algorithm has been introduced avoidance mechanism on Epidemic routing algorithm basis, and in the time that node buffering area is filled, the node meeting with it, is kept out of the way no longer to its forwarding data bag according to certain rule. Algorithm of the present invention can suppress crowding-out effect effectively, obtains higher transmission success rate and lower network resource consumption.
The concrete scheme of algorithm of the present invention be on the original manufacturing basis of Epidemic algorithm increase below (1)-(4) mechanism, the present invention is referred to as avoidance mechanism, and the Epidemic algorithm with avoidance mechanism is called to BackoffEpidemic algorithm.
The specific descriptions of mechanism are as follows:
(1) field of node maintenance, this field is used for depositing threshold values t;
(2) threshold values t is random generation, and obedience is uniformly distributed, and its value scope is that (0, x), x is parameter, determines according to network condition;
(3), after a certain nodal cache is full of, in time t, this node rejection destination node is not the packet of this node, within the threshold values moment, makes the packet of other nodes keep out of the way;
(4) when back off time exceedes after threshold values t, no matter nodal cache state all receives packet, now still may extrude event. Receive after packet, it is 0 that back off time is reset.
Brief description of the drawings
The comparison of Fig. 1 transmission success rate
The comparison of Fig. 2 transmission delay
Fig. 3 data packet number affects transmission success rate
Under the different scenes of Fig. 4, improve the transmission success rate of algorithm
Under the different scenes of Fig. 5, improve the transmission delay of algorithm
Under the different scenes of Fig. 6, improve the routing cost of algorithm
Detailed description of the invention
Below principle of the present invention and feature are described, example, only for explaining the present invention, is not intended to limit scope of the present invention.
Use ONE (theOpportunisticNetworkingEnvironment) emulation platform to implement the routing algorithm the present invention relates to. In emulation below, simulate the pedestrian's walking that carries intelligent bluetooth equipment in the scene of real city, and implemented, analyzed the performance of routing algorithm with this. Concrete scene setting is as shown in table 1.
The setting of table 1 simulating scenes
In this emulation experiment, getting parameter x value is 100 seconds; Taking table 1 scene as basis, every node generates 10 packets, generates in the mode of constant duration, taking 5 nodes as example, has 50 packets in network, and simulation time is 12 hours, within every 864 seconds, generates a packet, and result as shown in Figures 4 to 6.
In this emulation, number of nodes and packet synchronously increase, and number of nodes increases can improve transmission success rate, and data packet number exceedes the generation that can cause crowding-out effect after threshold values, and Fig. 4 to Fig. 6 is the results of two kinds of effect stacks.
As seen from Figure 4, in the time that number of nodes is less, taking 10 nodes as example, although buffer memory ratio is less than 1, but because being generates a packet for every 432 seconds, and packet is diffused into other nodes also needs certain hour, can there is not crowding-out effect in the early stage of emulation, the algorithm advantage after now improving is also not obvious.
When node and data packet number are when more, during as 160 nodes, buffer memory ratio reaches 0.018, now can there is significant crowding-out effect, the effect that improves avoidance mechanism in algorithm is remarkable, and BackoffEpidemic algorithm is significantly increased compared with Epidemic algorithm transmission success rate, reaches 79.5%.
From above, about avoidance mechanism narration, it has a negative impact to meeting transmission delay, but Fig. 5 experimental result shows, this impact is little.
BackoffEpidemic algorithm, in the time that node is more, has certain influence to the routing cost of algorithm as seen from Figure 6, and as when 160 node, BackoffEpidemic algorithm is decreased significantly compared with the routing cost of Epidemic algorithm, reaches 36.7%.
From the present embodiment, the Epidemic algorithm with avoidance mechanism that the present invention proposes, can reduce the quantity of packet in network effectively, suppresses crowding-out effect, improves the performance of routing algorithm, has expanded the scope of application of Epidemic routing algorithm.
Claims (2)
1. an opportunistic network routing method, it is characterized in that, comprise principle, parameter and the course of work of this method for routing, this method for routing is that the one of Epidemic method for routing is improved, this method for routing is to have introduced avoidance mechanism on the basis of Epidemic method for routing, and this avoidance mechanism comprises:
Field of node maintenance, this field is used for depositing threshold value t;
After a certain nodal cache is full of, in time t, this node rejection destination node is not the packet of this node, within the threshold value moment, makes the packet of other nodes keep out of the way;
When back off time exceedes after threshold value t, no matter nodal cache state all receives packet, and when node receives after packet, it is 0 that its back off time is reset.
2. opportunistic network routing method according to claim 1, is characterized in that, threshold value t is random generation, and obedience is uniformly distributed, and its value scope is that (0, x), x is parameter, determines according to network condition.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210239802.9A CN102970223B (en) | 2012-07-12 | 2012-07-12 | There is the Epidemic method for routing of avoidance mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210239802.9A CN102970223B (en) | 2012-07-12 | 2012-07-12 | There is the Epidemic method for routing of avoidance mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102970223A CN102970223A (en) | 2013-03-13 |
| CN102970223B true CN102970223B (en) | 2016-05-18 |
Family
ID=47800110
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210239802.9A Expired - Fee Related CN102970223B (en) | 2012-07-12 | 2012-07-12 | There is the Epidemic method for routing of avoidance mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102970223B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103997693B (en) * | 2014-06-11 | 2017-06-16 | 北京邮电大学 | The motivational techniques of quality optimization are delivered in opportunistic network towards video |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| CN102523614A (en) * | 2012-01-04 | 2012-06-27 | 北京工商大学 | Epidemic routing algorithm based on Delivered-Drop mechanism |
-
2012
- 2012-07-12 CN CN201210239802.9A patent/CN102970223B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| CN102523614A (en) * | 2012-01-04 | 2012-06-27 | 北京工商大学 | Epidemic routing algorithm based on Delivered-Drop mechanism |
Non-Patent Citations (1)
| Title |
|---|
| Performance Modeling of Network Coding in Epidemic Routing;Yunfeng Lin等;《MobiOpp "07 Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking》;20070611;67-74 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102970223A (en) | 2013-03-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Reliable bursty convergecast in wireless sensor networks | |
| CN103716208B (en) | Support network management, system, interchanger and the network of elephant stream | |
| CN101784067B (en) | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network | |
| Sobin | An efficient buffer management policy for DTN | |
| CN113573272B (en) | Design method of RTS (request to send) competition access control protocol for multi-hop underwater acoustic wireless sensor | |
| Jain et al. | Development of energy efficient modified LEACH protocol for IoT applications | |
| CN101674220B (en) | Forwarding history-based asynchronous rooting algorithm | |
| CN103124292B (en) | Data dispatching method in a kind of P2P stream media system and device thereof | |
| CN102421161B (en) | Priority-based routing algorithm of opportunity network under Epidemic mechanism | |
| CN102209029B (en) | Grouping strategy based opportunistic network routing algorithm | |
| CN112235845A (en) | Geographic routing protocol method applied to underwater acoustic sensor network | |
| CN102970223B (en) | There is the Epidemic method for routing of avoidance mechanism | |
| CN103532865B (en) | Based on the jamming control method of society's perception in a kind of Delay Tolerant Network | |
| CN104394074B (en) | It is a kind of to hold the message forwarding method based on efficiency in net late | |
| CN102523614B (en) | Based on the Epidemic routing algorithm of Delivered-Drop mechanism | |
| CN102497325B (en) | DTN routing method based on reliable information distribution | |
| CN102724731B (en) | Epidemic routing algorithm with adaptive capacity | |
| CN103312619B (en) | A kind of deletion simultaneously and the jamming control method of Transfer Message | |
| CN102201989B (en) | Wait and epidemic routing algorithm | |
| CN104539398A (en) | MAC (multiple access control) protocol communication method for underwater sensor network with asynchronous duty ratio and network coding | |
| Zhong et al. | Research and Implementation of AOMDV Multipath Routing Protocol | |
| Mahajan et al. | The Modified Gaussian Function based RED (MGF-RED) Algorithm for Congestion Avoidance in Mobile Ad Hoc Networks | |
| Liu et al. | Research on the buffer management algorithm in DTN | |
| CN101552935A (en) | Path establishing mechanism based on centralized path calculation | |
| Tan et al. | Review of Computer Engineering Studies |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Sun Jianzhi Inventor after: Tan Li Inventor after: Cao Qian Inventor after: Xiao Yuanyuan Inventor after: Zhang Yingxin Inventor before: Sun Jianzhi Inventor before: Tan Li Inventor before: Xiao Yuanyuan Inventor before: Zhang Yingxin |
|
| COR | Change of bibliographic data | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160518 Termination date: 20160712 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |