CN102201989A - Wait and epidemic routing algorithm - Google Patents
Wait and epidemic routing algorithm Download PDFInfo
- Publication number
- CN102201989A CN102201989A CN2011101303987A CN201110130398A CN102201989A CN 102201989 A CN102201989 A CN 102201989A CN 2011101303987 A CN2011101303987 A CN 2011101303987A CN 201110130398 A CN201110130398 A CN 201110130398A CN 102201989 A CN102201989 A CN 102201989A
- Authority
- CN
- China
- Prior art keywords
- routing algorithm
- data packet
- epidemic
- wait
- node
- 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.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 claims abstract description 43
- 238000000034 method Methods 0.000 claims abstract description 6
- 238000012545 processing Methods 0.000 claims description 4
- 230000010076 replication Effects 0.000 claims 1
- 239000007921 spray Substances 0.000 description 16
- 238000006424 Flood reaction Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 7
- 238000005265 energy consumption Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000009365 direct transmission Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明涉及名为Wait and Epidemic的机会网络路由算法,作用是使机会网络中节点高效转发数据包,同时尽可能少地消耗节点能量。本路由算法将数据包的转发过程分为Wait和Epidemic两个阶段。数据包首先进入Wait阶段,该阶段采用Direct Delivery路由策略;在Wait阶段未到达目标节点的数据包进入Epidemic阶段,该阶段采用有限度泛洪策略。本算法具有W,K,M参数,恰当地设置参数可有效地减少网络中无效数据包副本的存在,以接近最优的路由开销取得很高的传输成功率,这是传统机会网络路由算法难以达到的。本路由算法适合能量成为稀缺资源的场景,如灾难发生后场景。The invention relates to an opportunistic network routing algorithm called Wait and Epidemic, which is used to enable nodes in the opportunistic network to efficiently forward data packets while consuming as little node energy as possible. This routing algorithm divides the forwarding process of data packets into two stages: Wait and Epidemic. The data packet first enters the Wait stage, which adopts the Direct Delivery routing strategy; the data packet that does not reach the target node in the Wait stage enters the Epidemic stage, and this stage adopts the limited flooding strategy. This algorithm has W, K, and M parameters. Properly setting parameters can effectively reduce the existence of invalid data packet copies in the network, and achieve a high transmission success rate with close to optimal routing overhead, which is difficult for traditional opportunistic network routing algorithms. achieved. This routing algorithm is suitable for scenarios where energy becomes a scarce resource, such as after a disaster.
Description
Claims (10)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011101303987A CN102201989B (en) | 2011-05-19 | 2011-05-19 | Wait and epidemic routing algorithm |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011101303987A CN102201989B (en) | 2011-05-19 | 2011-05-19 | Wait and epidemic routing algorithm |
Publications (2)
Publication Number | Publication Date |
---|---|
CN102201989A true CN102201989A (en) | 2011-09-28 |
CN102201989B CN102201989B (en) | 2013-08-28 |
Family
ID=44662390
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN2011101303987A Expired - Fee Related CN102201989B (en) | 2011-05-19 | 2011-05-19 | Wait and epidemic routing algorithm |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN102201989B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102523614A (en) * | 2012-01-04 | 2012-06-27 | 北京工商大学 | Epidemic routing algorithm based on Delivered-Drop mechanism |
CN110943927A (en) * | 2019-12-06 | 2020-03-31 | 湖南大学 | Named data network transmission control method, device and device based on delay management |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102045809A (en) * | 2009-10-16 | 2011-05-04 | 南京理工大学 | Routing method of opportunistic network based on wireless radio frequencies |
-
2011
- 2011-05-19 CN CN2011101303987A patent/CN102201989B/en not_active Expired - Fee Related
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102045809A (en) * | 2009-10-16 | 2011-05-04 | 南京理工大学 | Routing method of opportunistic network based on wireless radio frequencies |
Non-Patent Citations (6)
Title |
---|
《Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking》 20050826 Thrasyvoulos Spyropoulos等 "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks" , * |
《微计算机信息》 20101231 钱景辉 "机会网络中机会路由和转发机制研究" 第26卷, 第12-3期 * |
《计算机工程与应用》 20111231 孙践知等 "Wait and Spray:一种改进的机会网络路由算法" 第47卷, 第31期 * |
THRASYVOULOS SPYROPOULOS等: ""Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks"", 《PROCEEDINGS OF THE 2005 ACM SIGCOMM WORKSHOP ON DELAY-TOLERANT NETWORKING》 * |
孙践知等: ""Wait and Spray:一种改进的机会网络路由算法"", 《计算机工程与应用》 * |
钱景辉: ""机会网络中机会路由和转发机制研究"", 《微计算机信息》 * |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102523614A (en) * | 2012-01-04 | 2012-06-27 | 北京工商大学 | Epidemic routing algorithm based on Delivered-Drop mechanism |
CN102523614B (en) * | 2012-01-04 | 2016-03-30 | 北京工商大学 | Based on the Epidemic routing algorithm of Delivered-Drop mechanism |
CN110943927A (en) * | 2019-12-06 | 2020-03-31 | 湖南大学 | Named data network transmission control method, device and device based on delay management |
CN110943927B (en) * | 2019-12-06 | 2021-07-02 | 湖南大学 | Named data network transmission control method, device and device based on delay management |
Also Published As
Publication number | Publication date |
---|---|
CN102201989B (en) | 2013-08-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Ray et al. | Always acyclic distributed path computation | |
CN103117957B (en) | The buffer memory management method of Effect-based operation number of copies and comprehensive effectiveness in opportunistic network | |
CN102209029B (en) | Grouping strategy based opportunistic network routing algorithm | |
CN101729230A (en) | Multiplexing route method for delay tolerant network | |
CN106254254A (en) | A kind of network-on-chip communication means based on Mesh topological structure | |
Walikar et al. | Energy aware multicast routing in mobile ad-hoc networks using NS-2 | |
CN101965031A (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
Mundur et al. | Delay tolerant network routing: Beyond epidemic routing | |
CN101674220B (en) | Forwarding history-based asynchronous rooting algorithm | |
CN105188084B (en) | A kind of wireless sensor network routing optimization method based on congestion control | |
CN112235845B (en) | Geographic routing protocol method applied to underwater acoustic sensor network | |
CN102421161B (en) | Priority-based routing algorithm of opportunity network under Epidemic 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 | |
Ochiai et al. | Mobility entropy and message routing in community-structured delay tolerant networks | |
CN102201989A (en) | Wait and epidemic routing algorithm | |
CN114286382A (en) | Capacity-breaking reconfigurable routing strategy based on prior knowledge base | |
CN107105388B (en) | A Cross-Layer Vehicle Network Routing Method Based on Link Transmission Capability | |
CN103338490B (en) | A kind of method of network data route and network node | |
Wang et al. | Research on routing protocols and simulation analysis for opportunistic networks | |
Huang et al. | TALONet: A power-efficient grid-based congestion avoidance scheme using multi-detouring technique in wireless sensor networks | |
CN104202260B (en) | A kind of back pressure link scheduling method based on geographical position | |
CN102523614A (en) | Epidemic routing algorithm based on Delivered-Drop mechanism | |
CN105407047B (en) | Opportunistic network data distributing method based on centrad and opportunistic network system | |
Lin et al. | RRM-B: Reliable retransmission mechanism for wireless sensor networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C53 | Correction of patent of invention or patent application | ||
CB03 | Change of inventor or designer information |
Inventor after: Sun Jianzhi Inventor after: Xiao Yuanyuan Inventor after: Xu Yanqun Inventor after: Chen Hongqian Inventor after: Chen Dan Inventor before: Sun Jianzhi Inventor before: Xiao Yuanyuan Inventor before: Chen Hongqian Inventor before: Chen Dan |
|
COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: SUN JIANZHI XIAO YUANYUAN CHEN HONGQIAN CHEN DAN TO: SUN JIANZHI XIAO YUANYUAN XU YANQUN CHEN HONGQIAN CHEN DAN |
|
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: 20130828 Termination date: 20160519 |