CN103037466A - Delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene - Google Patents
Delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene Download PDFInfo
- Publication number
- CN103037466A CN103037466A CN2012105470593A CN201210547059A CN103037466A CN 103037466 A CN103037466 A CN 103037466A CN 2012105470593 A CN2012105470593 A CN 2012105470593A CN 201210547059 A CN201210547059 A CN 201210547059A CN 103037466 A CN103037466 A CN 103037466A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- directly under
- sequence
- transmission
- 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
Abstract
The invention belongs to the technical field of wireless communication and discloses a delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene and based on a messenger directly under data. The messenger directly under the data comprises a routing sequence and a transmission information sequence, the routing sequence represents a moving sequence and is composed of serial numbers of transmission nodes, and a first number and a last number of the routing sequence are only a source node. The transmission sequence represents information which a transmitted by digital distribution frame (DDF) to each node, when the DDF reaches one target node and after the DDF finishes transmitting the information which a given by a data source to the node, the information is removed from the information sequence, the data source controls the messenger directly under the data, the other nodes can not request the DDF to conduct independent transmission, the DDF moves according to the routing sequence provided by a list, and finally the DDF returns to the data source. The DNT routing strategy of the messenger directly under the data has the advantages of being high in transmission efficiency and little in transmission interference.
Description
Technical field
The invention belongs to wireless communication technology field, be specifically related to the DTN routing policy under a kind of light-duty machine step field operations trip scene.
Background technology
DTN (Delay Tolerant Networks) is delay-tolerant network, at some specific net environments such as interspace network, military Ad hoc network, sensor network, vehicle Ad hoc network, the phenomenon that network disconnects can often occur, cause message in transmission course, can not guarantee end to end path, so DTN is usually used to realize abominable or is disturbed Wireless Data Transmission under the environment.
It is that a kind of routed path part is known that light-duty machine goes on foot field operations trip scene, does not have end-to-end link, and the communication resource is rare, and communication security is required high specific communication scene.For this scene, before a lot of research does not all obtain desirable solution.In the known DTN routing policy based on " data mule " and " postal delivery " agent, always run into inevitably a problem: these units that bear the inter-node communication task are often by all nodes sharing, and therefore corresponding algorithm will be made equilibrium to all internodal communication requirements.
The communication scenes model that light-duty machine goes on foot in the field operations trip scene is as described below: in the extremely rare zone of a slice communication resource (such as certain mountain area), a squad is carrying out special duty, the personnel of squad are divided into several action group and headquarter, the approximate arcuation of group is dispersed in the zones of different in the mountain area, and headquarter are positioned at the round center of circle of class that the group position consists of.Because the crypticity to action has high requirements, long distance moving equipment does not carry in each action group, and all action groups all are in each other outside the horizon range with headquarter, therefore can't use the specific communication means such as semaphore.There are not end to end network each other in headquarter and action group, action group, but the position of each action group is known by headquarter.In this scene, can't contact directly between all action groups, all communication resources all concentrate on headquarter.
In light-duty machine step field operations trip scene, at first, infect routing policy and can't use, because there is the strict order of advancing in each action group, is in each other outside the direct communication zone and also deliberately arranges; Spray and wait for that routing policy requires information source, be that headquarter once send a plurality of data trnascriptions, and in the zone, move at random, in this scene, headquarter only have the extremely limited communication resource, and a plurality of data trnascription probably exposes the headquarter position to the external world when carrying out waiting process.Other based on the routing policy of historical information also since cause that can not direct communication between the limitation of scene and little group node can't be deployed in this scene.
Summary of the invention
Purpose of the present invention:
In order to realize headquarter and group's direct communication in scene is travelled in light-duty machine step field operations, a kind of light-duty machine of avoiding the communication information to be proposed by all nodes sharing goes on foot under the field operations trip scene based on the DTN routing policy directly under the data courier.
The technical solution adopted in the present invention:
The present invention proposes a kind of communication unit of using in the light-duty machine step field operations trip scene of being fit to, directly under data courier DDF(Dedicated Data Ferry) finish information communication and the series connection task of whole squad.
Under this scene, headquarter can be compared to brain and the information center of whole squad, and all information of each group all will feed back to headquarter so that headquarter make further indication, and the communication between the group must be via headquarter on behalf of finishing.
A DDF should comprise following information:
1. route sequence RQ (Routing Queue)
Route sequence RQ represents the order that DDF moves, and is comprised of the sequence number of transmission node, and first of route sequence and last position can only be source nodes.
2. transmission information sequence PIQ(Post Info Queue)
Transmission information sequence PIQ represents the information that DDF is transferred to each node, when DDF arrives a destination node, after data source is complete to the communication of this node, information can be eliminated from information sequence, therefore, directly under data courier DDF, strictly controlled by data source, other nodes outside the data source can not carry out independent transmission request to DDF, data source is filled in complete routing table for it when DDF sends, DDF sequentially moves in strict accordance with the route that routing table provides, and finally turns back to data source.
Carry out according to following steps directly under data courier routing policy:
[1] initialization: headquarter are source node, comprise data source, more than one be communication node directly under transmission node and action group, these nodes satisfy: node keeps relatively static to headquarter when taking action directly under the data courier; The particular location of node is known by headquarter, and control is directly under the data courier, and headquarter import data source when sending directly under the data courier, for fill in complete routing table and the data message of each node directly under the data courier;
[2] arrive each node directly under the data courier, after data information transfer, the route of this node of deletion and the data message that is transferred to this node in routing table, sequentially move according to the route that routing table provides directly under the data courier, until the transmission information sequence is cleared, other nodes outside the data source can not be to carrying out independent transmission request directly under the data courier;
[3] finally turn back to source node directly under the data courier, wait for new transformation task.
Beneficial effect of the present invention:
DNT routing policy directly under the data courier of the present invention, its transmission course belong to the DTN strategy of known routed path, have efficiency of transmission high, and little characteristics are disturbed in transmission, are fit to be applied in some extremely abominable scientific researches of communication environment, in the military operation.
Description of drawings
Fig. 1 is based on the DTN routing policy figure directly under the data courier.
Embodiment
Embodiment
Below in conjunction with accompanying drawing the present invention is described in further detail.
In this scene, can not carry out direct communication between all little group nodes, and because resource-constrained, the communication unit that command centre emits will guarantee farthest return data source.As shown in Figure 1, we are headquarter, directly under transmission node and each action group abstract be communication node, these nodes are satisfied:
1. node 1 to 8 keeps relatively static to headquarter when DDF takes action.
2. the particular location of node 1 to 8 is known by headquarter, and embodies seeking in the footpath of DDF.
Below, illustrate a kind of based on the DTN routing policy directly under the data courier in conjunction with Fig. 1:
Step 1: node CMD represents headquarter, and node DDF represents the exponent data courier that headquarter's data source is emitted, and node 1 to node 8 is distributed on the approximate circular arc take S as the center of circle, and initial route sequence is 1,3,5,7,8,0,0 to represent headquarter.The transmission information sequence is m1, m3, m5, m7, m8.
Step 2: DDF arrives node 1 according to routing table, to node 1 the transmission of data confirm complete after, from routing table, delete 1, from the transmission information sequence, delete m1, continue to move to node 3.DDF arrives node 3,5,7,8 successively according to above-mentioned steps.Transfer data to node eight and confirm complete after, route sequence is: 0.The transmission information sequence is cleared.
Step 3: DDF returns the CMD of headquarter from node 8.Wait for new transformation task.
In real scene, DDF can be unmanned plane, robot, or even messenger.
Claims (3)
1. the DTN routing policy under the light-duty machine step field operations trip scene, its difference is: the node communication model comprises more than one directly under the data courier with based on the DTN routing policy directly under the data courier, one comprises route sequence and transmission information sequence directly under the data courier, the order that the route sequence representative is moved, sequence number by transmission node forms, and first of route sequence is source node with last position; The transmission information sequence comprises the information that is transferred to each node; Carry out according to following steps directly under data courier routing policy:
[1] initialization: headquarter are source node, comprise data source, more than one be communication node directly under transmission node and action group, these nodes satisfy: node keeps relatively static to headquarter when taking action directly under the data courier; The particular location of node is known by headquarter, and control is directly under the data courier, and headquarter import data source when sending directly under the data courier, for fill in complete routing table and the data message of each node directly under the data courier;
[2] arrive each node directly under the data courier, after data information transfer, the route of this node of deletion and the data message that is transferred to this node in routing table, sequentially move according to the route that routing table provides directly under the data courier, until the transmission information sequence is cleared, other nodes outside the data source can not be to carrying out independent transmission request directly under the data courier;
[3] finally turn back to source node directly under the data courier, wait for new transformation task.
2. the DTN routing policy under the light-duty machine step according to claim 1 field operations trip scene, its difference is: source node is positioned at the center of other nodes, and other nodes are distributed on the approximate circular arc take source node as the center of circle.
3. light-duty machine according to claim 1 goes on foot the DTN routing policy under the field operations trip scene, and its difference is: directly under data courier unmanned plane, robot or messenger.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210547059.3A CN103037466B (en) | 2012-12-17 | 2012-12-17 | Delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210547059.3A CN103037466B (en) | 2012-12-17 | 2012-12-17 | Delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103037466A true CN103037466A (en) | 2013-04-10 |
| CN103037466B CN103037466B (en) | 2015-01-21 |
Family
ID=48023831
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210547059.3A Expired - Fee Related CN103037466B (en) | 2012-12-17 | 2012-12-17 | Delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103037466B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104158741A (en) * | 2014-09-09 | 2014-11-19 | 中国电子科技集团公司第五十四研究所 | Stratospheric active routing design method based on delay/disruption tolerant network |
| CN106506062A (en) * | 2016-11-29 | 2017-03-15 | 中山大学 | The distributed high-speed communication system of cluster unmanned plane and communication means |
| CN106792979A (en) * | 2016-12-07 | 2017-05-31 | 国网宁夏电力公司吴忠供电公司 | It is a kind of to set up the method that radio relay communication route communication link |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101286931A (en) * | 2008-05-27 | 2008-10-15 | 华中科技大学 | Optical network automatic discovery method and optical link constructing method based thereon |
| WO2010136023A1 (en) * | 2009-05-25 | 2010-12-02 | Lysatiq Gmbh | Method for optimizing a packet-oriented data transmission and computer program product |
-
2012
- 2012-12-17 CN CN201210547059.3A patent/CN103037466B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101286931A (en) * | 2008-05-27 | 2008-10-15 | 华中科技大学 | Optical network automatic discovery method and optical link constructing method based thereon |
| WO2010136023A1 (en) * | 2009-05-25 | 2010-12-02 | Lysatiq Gmbh | Method for optimizing a packet-oriented data transmission and computer program product |
Non-Patent Citations (2)
| Title |
|---|
| KHALED A. HARRAS: "《World of Wireless, Mobile and Multimedia Networks》", 31 December 2006 * |
| 李千目: "《基于最近社交圈的社交时延容忍网络路由策略》", 《计算机研究与发展》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104158741A (en) * | 2014-09-09 | 2014-11-19 | 中国电子科技集团公司第五十四研究所 | Stratospheric active routing design method based on delay/disruption tolerant network |
| CN106506062A (en) * | 2016-11-29 | 2017-03-15 | 中山大学 | The distributed high-speed communication system of cluster unmanned plane and communication means |
| CN106506062B (en) * | 2016-11-29 | 2020-01-21 | 中山大学 | Distributed rapid communication system and communication method for cluster unmanned aerial vehicle |
| CN106792979A (en) * | 2016-12-07 | 2017-05-31 | 国网宁夏电力公司吴忠供电公司 | It is a kind of to set up the method that radio relay communication route communication link |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103037466B (en) | 2015-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | A scalable and quick-response software defined vehicular network assisted by mobile edge computing | |
| Li et al. | Delay-tolerant data traffic to software-defined vehicular networks with mobile edge computing in smart city | |
| Dong et al. | UAVs as an intelligent service: Boosting edge intelligence for air-ground integrated networks | |
| Khan et al. | A hybrid communication scheme for efficient and low-cost deployment of future flying ad-hoc network (FANET) | |
| ES2595229T3 (en) | System and method to allow fast and uninterrupted transfer for air to ground communications | |
| Dao et al. | Adaptive resource balancing for serviceability maximization in fog radio access networks | |
| Hagenauer et al. | Vehicular micro clouds as virtual edge servers for efficient data collection | |
| Majumdar et al. | An efficient routing algorithm based on ant colony optimisation for VANETs | |
| Singh et al. | Flying adhoc networks concept and challenges | |
| CN110493791A (en) | Empty Incorporate network architecture and design method based near space platform | |
| CN106774429B (en) | A kind of data transmission method and system | |
| CN106774382A (en) | A kind of multiple no-manned plane real-time situation information sharing system | |
| CN105979558A (en) | Cloud based unmanned aerial vehicle cluster communication system | |
| Qu et al. | Empowering edge intelligence by air-ground integrated federated learning | |
| Yang et al. | Aiding a disaster spot via multi-UAV-based IoT networks: Energy and mission completion time-aware trajectory optimization | |
| CN103634232B (en) | Vehicle message method for routing based on delay-tolerant network technology | |
| JP2017212759A (en) | Packet transfer device, control device, communication system, communication method, and program | |
| Lu et al. | A cost-efficient elastic UAV relay network construction method with guaranteed QoS | |
| CN103037466A (en) | Delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene | |
| Hashish et al. | Efficient wireless sensor network rings overlay for crowd management in Arafat area of Makkah | |
| CN108024200B (en) | Self-adaptive method and system for intermittently connected unmanned aerial vehicle self-organizing network | |
| Boccadoro et al. | A dual-stack communication system for the internet of drones | |
| Farooq et al. | AMVR: A multicast routing protocol for autonomous military vehicles communication in VANET | |
| Tang et al. | Machine learning for space–air–ground integrated network assisted vehicular network: A novel network architecture for vehicles | |
| Varsha et al. | Development of QoS optimized routing using Artificial bee colony and TABU-GA with a mobile base station in Wireless Sensor Network |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: NANJIANG UNIV. OF SCIENCE + ENGINEERING Free format text: FORMER OWNER: LIANYUNGANG RESEARCH INSTITUE OF NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY Effective date: 20150403 |
|
| CB03 | Change of inventor or designer information |
Inventor after: Li Qianmu Inventor after: Huang Dayi Inventor after: Wang Zhirong Inventor before: Li Qianmu Inventor before: Ni Chenchen Inventor before: Hou Jun Inventor before: Qi Yong Inventor before: Li Zongxing Inventor before: Liu Hao |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 222000 LIANYUNGANG, JIANGSU PROVINCE TO: 210094 NANJING, JIANGSU PROVINCE Free format text: CORRECT: INVENTOR; FROM: LI QIANMU NI CHENCHEN HOU JUN QI YONG LI ZONG LIU HAO TO: LI QIANMU HUANG DAYI WANG ZHIRONG |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20150403 Address after: 210094 Xiaolingwei, Jiangsu, No. 200, Patentee after: Nanjing University of Science and Technology Address before: 222000 No. 2 Chenguang Road, Sinpo District, Jiangsu, Lianyungang Patentee before: Lianyungang Research Institute of Nanjing University of Science and Technology |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150121 Termination date: 20151217 |
|
| EXPY | Termination of patent right or utility model |