CN102421161B - Priority-based routing algorithm of opportunity network under Epidemic mechanism - Google Patents
Priority-based routing algorithm of opportunity network under Epidemic mechanism Download PDFInfo
- Publication number
- CN102421161B CN102421161B CN201210000367.4A CN201210000367A CN102421161B CN 102421161 B CN102421161 B CN 102421161B CN 201210000367 A CN201210000367 A CN 201210000367A CN 102421161 B CN102421161 B CN 102421161B
- Authority
- CN
- China
- Prior art keywords
- priority
- node
- packet
- network
- routing algorithm
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a routing algorithm of an opportunity network and is used for forwarding data packets which are generated by part of nodes in the opportunity network with a high priority on the premise of no serious influence on the overall performance of the network. In the routing algorithm, by setting the priority of the nodes and time factors, the occurrence rate of copies of the data packets of low-priority nodes in the network can be effectively reduced, and the performance of the priority nodes is greatly improved. By appropriately selecting the time factors, the overall performance of the network is improved to a certain extent during great improvement of the performance of high-priority nodes. When the time factors are larger, compromise means can be provided for some application scenes of the opportunity network, even though the performance of the high-priority nodes is improved at the cost of no consideration of the overall performance of the network.
Description
Technical field
The present invention relates to opportunistic network routing algorithm, effect is that some packet in opportunistic network is preferentially forwarded.
Background technology
Opportunistic network is that one does not need to there is fullpath between a source node and a destination node, the chance of meeting utilizing node motion to bring 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 by unified plan, and network size and node initial position pre-set, and the path between source node and destination node can not determine whether exist in advance.Opportunistic network realizes inter-node communication with " storing-carry-forwarding " pattern hop-by-hop transmission information, and its architecture is different from multi-hop wireless network, and it inserts the new protocol layer that is called as bundle layer between application layer and transport layer.
The insoluble problems of conventional wireless network technology such as network division, time delay can be processed due to opportunistic network, can meet the network service needs under mal-condition, it is mainly used in, and to lack the communications infrastructure, network environment severe and tackle the occasion of urgent accident.
In many application scenarioss of opportunistic network, have any different and treat the needs of different node.As in disaster scene, the smart machine that rescue personnel and general public carry forms opportunistic network jointly, and the packet that now rescue personnel's node sends should obtain prioritised transmission.For another example, under the scene of some openings, have some aspiration nodes and join in opportunistic network.In the open opportunistic network having aspiration node to participate in, preferentially should ensure the transmission of the intrinsic node data bag of network.
Above-mentioned scene requirement opportunistic network interior joint has priority, and the packet that part of nodes and these nodes produce preferentially can use Internet resources.
The metric evaluating opportunistic network routing algorithm performance index mainly contains:
1. transmission success rate
Transmission success rate (Delivery Ratio) is within the regular hour, successfully arrive the ratio that destination node packet sum and the need that send of source node transmit packet sum, this index features the ability of the correct forwarding data bag of routing algorithm to destination node, is most important index.
2. routing cost
Routing cost (Overhead) refers to the sum of node for data forwarding bag within a certain period of time, and the ratio of the packet sum usually forwarded with all nodes by all number-of-packet successfully arriving destination node is evaluated.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 collides, also can consume node energy in large quantities.
3. transmission delay
Transmission delay (Delivery Delay) is that packet arrives the time needed for destination node from source node, usually adopts average transfer delay to evaluate.Transmission delay little meaning routing algorithm transmittability is strong, efficiency of transmission is high, also means will take less Internet resources in transmitting procedure.
Summary of the invention
The present invention relates to a kind of new opportunistic network routing algorithm, this algorithm introduces priority mechanism on Epidemic routing algorithm basis, and this mechanism not producing network in general performance under the prerequisite had a strong impact on, preferentially can forward high priority packets.
According to Epidemic routing algorithm forwarding data bag in opportunistic network, but priority conditions will be met when packet forwards.Being described below of relative priorities:
1. the node in opportunistic network has transmission and receives priority;
2. node can adopt one of following 4 kinds of modes to obtain initial priority:
(1) according to certain rule, the priority of oneself is determined by statement;
(2) by calculating priority to the factor such as node motion speed, interface quantity, transmission rate, transmission range, forwarding wish, available cache memory size, successfully forwarding probability;
(3) priority is specified by keeper;
(4) default priority is adopted.
3. the transmission priority of node increase in time and increasing, once node has packet to be successfully sent, this node sends priority and returns to initial priority;
4. packet obtains initial priority from originating source node, and when packet stores in nodal cache district, its priority increases in time and increases, and when packet is successfully sent, the priority of packet reverts to initial priority;
5. the packet when the transmission priority of source node and the reception priority sum of destination node are greater than threshold values in transmission source node;
6. send packet when source node will send the priority of packet and target node accepts priority sum is greater than threshold values.
The extensibility of Epidemic algorithm is poor, and when the packet transmitted in network size expansion, network increases, network performance can significantly decline.In the opportunistic network of opening, after having aspiration node to add, network size expands thereupon, and in network, the transmission of intrinsic node data bag can be affected.And adopt the Epidemic algorithm based on priority that intrinsic node in opportunistic network can be made to have higher priority, ensure the prioritised transmission of intrinsic node data bag.In other words, if only for intrinsic node, the Epidemic algorithm based on priority can ensure that opportunistic network has better extensibility.
When network size expands, the main cause causing Epidemic algorithm performance to decline makes owing to excessively flooding to be full of a large amount of packet copies in network, and a large amount of Internet resources are consumed.Epidemic algorithm based on priority inhibits the transmission of low priority node data bag, decreases the quantity of packet copy in network, can improve the overall performance of network while ensureing priority node data packet transmission to a certain extent.
Accompanying drawing explanation
Fig. 1 transmission success rate compares
Fig. 2 transmission delay compares
Fig. 3 routing cost compares
Embodiment
Be described principle of the present invention and feature below, example, only for explaining the present invention, is not intended to limit scope of the present invention.
The present invention uses the routing algorithm involved by the enforcement of ONE (the Opportunistic Networking Environment) emulation platform.Invention emulates carry smart bluetooth equipment pedestrian's walking in real City scenarios, analyze the performance of routing algorithm with this.Concrete scene setting is as shown in table 1.
Table 1 simulating scenes is arranged
Exemplifying embodiment 1
In the present embodiment, node is divided into prior node and ordinary node, is provided with 2 kinds of priority, specifically as shown in table 2.
Table 2 priority is arranged
In table 1 scene, for 40 prior node, 40 ordinary nodes, by choosing the performance of different time factorial analysis based on priority Epidemic routing algorithm.
In the algorithm, active node sends priority P
s, the preferential P of target node accepts
r, packet priority P
p, time factor f
t, stand-by period t
wwith threshold values v
tetc. multiple variable factor, relation as shown in Equation 1.From formula 1, be mutually related between above-mentioned variable factor, can by time factor be used for analyze different priorities, threshold values impact on network performance be set.
P
s+ P
r+ f
t× t
w> v
tor P
s+ P
p+ f
t× t
w> v
tformula 1
Based on Epidemic routing algorithm mechanism, when meeting formula 1 condition, send packet, result as shown in Figure 1 to Figure 3.
Fig. 1 to Fig. 3 describes the impact of different time factor pair network performance, the ratio of prior node, ordinary node, overall state and corresponding baseline is respectively described in figure, wherein overall state describes situation when comprising all nodes, and baseline is corresponding corresponding without priority result respectively.
As seen from Figure 1, the introducing of priority significantly can improve the performance of prior node, select appropriate time factor while not affecting overall performance, greatly can improve the performance of prior node, trace it to its cause is because priority mechanism inhibits ordinary node excessively to flood behavior, but when time factor value is excessive, the performance of ordinary node also above can be affected largely.
As seen from Figure 2, the transmission delay index of prior node can significantly be improved, and the overall transmission delay of less hour of time factor has increased slightly, though transmission delay can significantly be improved but corresponding transmission success rate is poor when time factor is larger.
As seen from Figure 3, under priority mechanism, the network overhead of prior node, ordinary node and overall state and time factor are substantially linear, when time factor increases owing to inhibit the transmission network expense of ordinary node packet to decline thereupon.
The above-mentioned analysis to embodiment shows, in algorithm involved in the present invention, by effectively can reduce the existence of low priority node data bag copy in network to the setting of node priority and time factor, significantly improves the performance of priority node.Appropriate factor access time while increasing substantially priority node performance, can improve the overall performance of network to a certain extent.When time factor is larger, although increasing substantially of priority node performance will to sacrifice network in general performance for cost, this is also for some application scenarios provides compromise means.
Claims (2)
1. the opportunistic network routing algorithm based on priority policy, it is characterized in that, comprise the principle of this routing algorithm, parameter and the course of work, this routing algorithm is applicable to the opportunistic network that packets need preferentially forwards demand, according to Epidemic routing algorithm forwarding data bag in opportunistic network, but packet will meet priority conditions when forwarding, node in opportunistic network has transmission and receives priority, the transmission priority of node increase in time and increasing, once node has packet to be successfully sent, this node sends priority and returns to initial priority, packet is sent when the transmission priority of source node and the reception priority sum of destination node are greater than threshold values, packet obtains initial priority from originating source node, when packet stores in nodal cache district, its priority increases in time and increases, when packet is successfully sent, the priority of packet reverts to initial priority, packet is sent when the reception priority sum of priority and destination node that source node will send packet is greater than threshold values.
2. routing algorithm according to claim 1, is characterized in that, opportunistic network interior joint can adopt one of following 4 kinds of modes to obtain initial priority, respectively: according to certain rule, is determined the priority of oneself by statement; By calculating priority to node motion speed, interface quantity, transmission rate, transmission range, forwarding wish, available cache memory size, successfully forwarding probability factor; Priority is specified by keeper; Adopt default priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210000367.4A CN102421161B (en) | 2012-01-04 | 2012-01-04 | Priority-based routing algorithm of opportunity network under Epidemic mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210000367.4A CN102421161B (en) | 2012-01-04 | 2012-01-04 | Priority-based routing algorithm of opportunity network under Epidemic mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102421161A CN102421161A (en) | 2012-04-18 |
| CN102421161B true CN102421161B (en) | 2015-04-22 |
Family
ID=45945332
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210000367.4A Expired - Fee Related CN102421161B (en) | 2012-01-04 | 2012-01-04 | Priority-based routing algorithm of opportunity network under Epidemic mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102421161B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103458441B (en) * | 2013-09-10 | 2016-07-06 | 上海交通大学 | Based on the routing optimization method of efficiency in wireless network |
| CN104994004A (en) * | 2015-07-03 | 2015-10-21 | 厦门大学 | Priority and multi-granularity based content sharing method under opportunity network environment |
| CN105407048B (en) * | 2015-10-30 | 2018-10-26 | 哈尔滨工程大学 | A kind of delay-tolerant network nodal cache management method towards epidemic and probabilistic mixed logic dynamics |
| CN108616465B (en) * | 2018-03-22 | 2020-10-30 | 天津大学 | Routing method of mobile self-organizing network supporting carrying store-and-forward mechanism |
| CN111478859B (en) * | 2020-04-03 | 2022-10-18 | 北京大学深圳研究生院 | Message transmission method, node and storage medium in DTN (delay tolerant network) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102148762A (en) * | 2011-04-28 | 2011-08-10 | 合肥工业大学 | Hybrid scheduling method for control area network (CAN)-FlexRay gateway |
| CN102209029A (en) * | 2011-05-19 | 2011-10-05 | 北京工商大学 | Grouping strategy based opportunistic network routing algorithm |
-
2012
- 2012-01-04 CN CN201210000367.4A patent/CN102421161B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102148762A (en) * | 2011-04-28 | 2011-08-10 | 合肥工业大学 | Hybrid scheduling method for control area network (CAN)-FlexRay gateway |
| CN102209029A (en) * | 2011-05-19 | 2011-10-05 | 北京工商大学 | Grouping strategy based opportunistic network routing algorithm |
Non-Patent Citations (2)
| Title |
|---|
| Epidemic机制下基于优先级的机会网络路由算法;孙践知等;《计算机工程与应用(2012,48(20))》;20121220;全文 * |
| Yunfeng Lin et al.Performance Modeling of Network Coding in Epidemic Routing.《MobiOpp "07 Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking》.2007,第67-74页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102421161A (en) | 2012-04-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103117957B (en) | The buffer memory management method of Effect-based operation number of copies and comprehensive effectiveness in opportunistic network | |
| CN102421161B (en) | Priority-based routing algorithm of opportunity network under Epidemic mechanism | |
| CN102263697A (en) | Method and device for sharing aggregated link traffic | |
| CN113630893B (en) | 5G and TSN joint scheduling method based on wireless channel information | |
| Ye et al. | A cross‐layer TCP for providing fairness in wireless mesh networks | |
| CN101965031B (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
| CN108667746B (en) | Method for realizing service priority in deep space delay tolerant network | |
| Du et al. | A VDTN scheme with enhanced buffer management | |
| CN102209029B (en) | Grouping strategy based opportunistic network routing algorithm | |
| Mast et al. | A cross-layer solution for contention control to enhance TCP performance in wireless Ad-Hoc networks | |
| CN104486040A (en) | Efficient coding-aware routing method based on cache management | |
| Jiao et al. | DTN routing with back-pressure based replica distribution | |
| Srivastava et al. | Controlled multimedia wireless link sharing via enhanced class-based queueing with channel-state-dependent packet scheduling | |
| CN102497325B (en) | DTN routing method based on reliable information distribution | |
| Gawas et al. | Cross layer multi QoS metric routing for multimedia traffic in 802.11 E over MANETs | |
| CN108881049A (en) | A kind of congestion control policy based on Epidemic routing | |
| CN102523614B (en) | Based on the Epidemic routing algorithm of Delivered-Drop mechanism | |
| CN102201989B (en) | Wait and epidemic routing algorithm | |
| Zhong et al. | Research and Implementation of AOMDV Multipath Routing Protocol | |
| CN102970223B (en) | There is the Epidemic method for routing of avoidance mechanism | |
| Ashfaq et al. | Optimizing Message Delivery in Opportunistic Networks with Replication-Based Forwarding | |
| CN102724731B (en) | Epidemic routing algorithm with adaptive capacity | |
| Chiplunkar | Picco: protocol independent congestion control method using mobile relays for ad-hoc networks | |
| Prasad et al. | Emergency Message Prioritization and Scheduling in Vehicular Ad hoc Networks | |
| Liu et al. | Research on the buffer management algorithm in DTN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150422 Termination date: 20200104 |