CN103037466B - 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 PDF

Info

Publication number
CN103037466B
CN103037466B CN201210547059.3A CN201210547059A CN103037466B CN 103037466 B CN103037466 B CN 103037466B CN 201210547059 A CN201210547059 A CN 201210547059A CN 103037466 B CN103037466 B CN 103037466B
Authority
CN
China
Prior art keywords
node
directly under
data
sequence
courier
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
Application number
CN201210547059.3A
Other languages
Chinese (zh)
Other versions
CN103037466A (en
Inventor
李千目
倪辰辰
侯君
戚湧
李宗骍
刘浩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Science and Technology
Original Assignee
LIANYUNGANG RESEARCH INSTITUTE OF NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by LIANYUNGANG RESEARCH INSTITUTE OF NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY filed Critical LIANYUNGANG RESEARCH INSTITUTE OF NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY
Priority to CN201210547059.3A priority Critical patent/CN103037466B/en
Publication of CN103037466A publication Critical patent/CN103037466A/en
Application granted granted Critical
Publication of CN103037466B publication Critical patent/CN103037466B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

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

DTN routing policy under a kind of light-duty Ji Bu field operations trip scene
Technical field
The invention belongs to wireless communication technology field, be specifically related to the DTN routing policy under a kind of light-duty Ji Bu field operations trip scene.
Background technology
DTN (Delay Tolerant Networks) is delay-tolerant network, as planetary networks under some specific network environments, military Ad hoc network, sensor network, vehicle Ad hoc network, often can there is the phenomenon that network disconnects, cause message can not guarantee path end to end in transmitting procedure, so DTN is usually used to realize Wireless Data Transmission that is severe or that be disturbed under environment.
Light-duty Ji Bu field operations trip scene is that a kind of routed path part is known, and there is not end-to-end link, the communication resource is rare, and requires high specific communication scene to communication security.For this scene, before a lot of research does not all obtain desirable solution.Known based in the DTN routing policy of " data mule " and " postal delivery " agent, always inevitably run into a problem: these units bearing inter-node communication task are often by all nodes sharing, and therefore corresponding algorithm will make equilibrium to all internodal communication requirements.
Communication scenes model in light-duty Ji Bu field operations trip scene is as described below: in the region that a slice communication resource is extremely rare (as certain mountain area), a squad carries out special duty, squad personnel are divided into several action group and headquarter, group is similar to arcuation and is dispersed in zones of different in mountain area, and headquarter are positioned at the center of circle of the class circle that group position is formed.Owing to having high requirements to the crypticity of action, long distance mobile device does not carry in each action group, and all action groups be all in each other with the horizon range of headquarter outside, therefore cannot use the specific communication means such as semaphore.Headquarter and action group, there is not end to end network in action group, but the position of each action group is known each other by headquarter.In this scene, cannot contact directly between all action groups, all communication resources all concentrate on headquarter.
In light-duty Ji Bu field operations trip scene, first, infecting routing policy cannot use, because there is strict order of advancing in each action group, is in each other outside direct communication region and also deliberately arranges; Spray and wait for that routing policy requires information source, namely headquarter once send multiple data trnascription, and move at random in region, in this scene, headquarter only have the extremely limited communication resource, and multiple data trnascription probably outwardly exposes headquarter position when carrying out waiting process.Other based on the routing policy of historical information also owing to can not the cause of direct communication cannot be deployed in this scene between the limitation of scene and little group node.
Summary of the invention
Object of the present invention:
In order to headquarter and group's direct communication can be realized, based on the DTN routing policy directly under data courier under a kind of light-duty Ji Bu field operations trip scene avoiding the communication information to be proposed by all nodes sharing in light-duty Ji Bu field operations trip scene.
The technical solution adopted in the present invention:
The present invention proposes a kind of communication unit being applicable to applying in light-duty Ji Bu field operations trip scene, directly under data courier DDF(Dedicated Data Ferry) come information communication and the series connection task of whole squad.
Under this scene, headquarter can be compared to the brain of whole squad and information center, and all information of each group all will feed back to headquarter so that headquarter make further instruction, and the communication between group must via headquarter on behalf of completing.
A DDF should comprise following information:
1. route sequence RQ (Routing Queue)
Route sequence RQ represents the order that DDF carries out movement, is made up 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 being given the information transmission of this node, information can be eliminated from information sequence, therefore, directly under data courier DDF, strictly controlled by data source, other nodes outside data source can not carry out independent transmission request to DDF, data source is that it fills in complete routing table when DDF sends, the routing order that DDF provides in strict accordance with routing table moves, 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 meet: node keeps the geo-stationary to headquarter when taking action directly under data courier; The particular location of node is known by headquarter, controls directly under data courier, and data source imports when sending directly under data courier by headquarter, for filling in complete routing table and the data message of each node directly under data courier;
[2] each node is arrived directly under data courier, after data information transfer, delete the route of this node in the routing table and be transferred to the data message of this node, the routing order provided according to routing table directly under data courier moves, until transmission information sequence is cleared, other nodes outside data source can not carry out independent transmission request to directly under data courier;
[3] finally turn back to source node directly under data courier, wait for new transformation task.
Beneficial effect of the present invention:
DNT routing policy directly under data courier of the present invention, its transmitting procedure belongs to the DTN strategy of known routed path, has efficiency of transmission high, the feature that transmission disturbance is little, is applicable to some scientific researches being applied in communication environment extreme, in military operation.
Accompanying drawing explanation
Fig. 1 is based on the DTN routing policy figure directly under data courier.
Embodiment
Embodiment
Below in conjunction with accompanying drawing, the present invention is described in further detail.
In this scene, between all little group nodes, direct communication can not be carried out, and due to resource-constrained, the communication unit that command centre releases to ensure 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 the geo-stationary to headquarter when DDF takes action.
2. the particular location of node 1 to 8 is known by headquarter, and embodies in seeking in footpath of DDF.
Below, composition graphs 1 illustrates a kind of based on the DTN routing policy directly under data courier:
Step one: node CMD represents headquarter, node DDF represents the exponent data courier that headquarter data sources is released, node 1 to node 8 be distributed in S be the center of circle approximate circular arc on, initial route sequence is 1,3,5,7,8,0, and 0 represents headquarter.Transmission information sequence is m1, m3, m5, m7, m8.
Step 2: DDF arrives node 1 according to routing table, after transmitting data validation, deletes 1, delete m1, continue to move to node 3 from transmission information sequence from routing table to node 1.DDF arrives node 3,5,7,8 successively according to above-mentioned steps.Transfer data to node eight and confirm after, route sequence is: 0.Transmission information sequence is cleared.
Step 3: DDF returns headquarter CMD 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 a light-duty Ji Bu field operations trip scene, its difference is: node communication model comprises more than one directly under data courier with based on the delay-tolerant network DTN routing policy directly under data courier, one comprises route sequence and transmission information sequence directly under data courier, the order of movement is carried out in route sequence representative, be made up of the sequence number of transmission node, first of route sequence and last position are source nodes; Transmission information sequence comprises the information being 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 meet: node keeps the geo-stationary to headquarter when taking action directly under data courier; The particular location of node is known by headquarter, controls directly under data courier, and data source imports when sending directly under data courier by headquarter, for filling in complete routing table and the data message of each node directly under data courier;
[2] each node is arrived directly under data courier, after data information transfer, delete the route of this node in the routing table and be transferred to the data message of this node, the routing order provided according to routing table directly under data courier moves, until transmission information sequence is cleared, other nodes outside data source can not carry out independent transmission request to directly under data courier;
[3] finally turn back to source node directly under data courier, wait for new transformation task.
2., according to the DTN routing policy under the light-duty Ji Bu field operations trip scene described in claim 1, its difference is: source node is positioned at the center of other nodes, and other Node distribution are on the approximate circular arc taking source node as the center of circle.
3. according to the DTN routing policy under the light-duty Ji Bu field operations trip scene described in claim 1, its difference is: be unmanned plane, robot or messenger directly under data courier.
CN201210547059.3A 2012-12-17 2012-12-17 Delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene Expired - Fee Related CN103037466B (en)

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 CN103037466A (en) 2013-04-10
CN103037466B true 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)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
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
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

Citations (1)

* Cited by examiner, † Cited by third party
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

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010136023A1 (en) * 2009-05-25 2010-12-02 Lysatiq Gmbh Method for optimizing a packet-oriented data transmission and computer program product

Patent Citations (1)

* Cited by examiner, † Cited by third party
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

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
《基于最近社交圈的社交时延容忍网络路由策略》;李千目;《计算机研究与发展》;20120615;第49卷(第6期);第1-11页 *
Khaled A. Harras.《Inter-regional messenger scheduling in delay tolerant mobile networks》.《World of Wireless, Mobile and Multimedia Networks》.2006,第1-11页. *

Also Published As

Publication number Publication date
CN103037466A (en) 2013-04-10

Similar Documents

Publication Publication Date Title
Liu et al. A scalable and quick-response software defined vehicular network assisted by mobile edge computing
Khan et al. A hybrid communication scheme for efficient and low-cost deployment of future flying ad-hoc network (FANET)
Zhang et al. Fast deployment of UAV networks for optimal wireless coverage
Li et al. Delay-tolerant data traffic to software-defined vehicular networks with mobile edge computing in smart city
Din et al. 5G-enabled Hierarchical architecture for software-defined intelligent transportation system
Zhou et al. Bidirectional mission offloading for agile space-air-ground integrated networks
Yaqoob et al. Congestion avoidance through fog computing in internet of vehicles
Hagenauer et al. Vehicular micro clouds as virtual edge servers for efficient data collection
Ding et al. Intelligent data transportation in smart cities: A spectrum-aware approach
ES2850360T3 (en) Multicast handover for mobile communications
CN103685023A (en) Broadband satellite communication system and method based on satellite-borne IP switching
Vashist et al. Location-aware network of drones for consumer applications: Supporting efficient management between multiple drones
CN103037466B (en) Delay tolerant network (DTN) routing strategy under light-weight infantry combat brigade scene
Lu et al. A cost-efficient elastic UAV relay network construction method with guaranteed QoS
CN103731935A (en) Space network communication method based on WIFI
Zhang et al. UAV-aided data dissemination protocol with dynamic trajectory scheduling in VANETs
Ghildiyal et al. An imperative role of 6G communication with perspective of industry 4.0: Challenges and research directions
Kakkasageri et al. Intelligent information dissemination in vehicular ad hoc networks
Srivastava et al. Internet of Low-Altitude UAVs (IoLoUA): a methodical modeling on integration of Internet of “Things” with “UAV” possibilities and tests
Boccadoro et al. A dual-stack communication system for the internet of drones
Bouzid et al. 5G network slicing with unmanned aerial vehicles: Taxonomy, survey, and future directions
Tsuru et al. Towards practical store-carry-forward networking: Examples and issues
Ibrahim et al. Radio access network techniques beyond 5G network: A brief overview
Almasoud et al. Energy efficient data forwarding in disconnected networks using cooperative UAVs
Naseer et al. A sustainable marriage of telcos and transp in the era of big data: Are we ready?

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