CN104244233A - High efficiency data transmission path setup method based on trust - Google Patents

High efficiency data transmission path setup method based on trust Download PDF

Info

Publication number
CN104244233A
CN104244233A CN201310225103.3A CN201310225103A CN104244233A CN 104244233 A CN104244233 A CN 104244233A CN 201310225103 A CN201310225103 A CN 201310225103A CN 104244233 A CN104244233 A CN 104244233A
Authority
CN
China
Prior art keywords
node
path
data
relay station
belief
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.)
Pending
Application number
CN201310225103.3A
Other languages
Chinese (zh)
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.)
Hebei University of Science and Technology
Original Assignee
Hebei 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 Hebei University of Science and Technology filed Critical Hebei University of Science and Technology
Priority to CN201310225103.3A priority Critical patent/CN104244233A/en
Publication of CN104244233A publication Critical patent/CN104244233A/en
Pending legal-status Critical Current

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/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

A high efficiency data transmission path setup method based on trust comprises the following steps: sending each ID number carried by a sensor terminal node, relay station nodes and a base station node and calculated position information to a central control node in advance; calculating trust degrees of each relay station node according to interaction condition of two adjacent relay station nodes in the data received by a node list information unit; calculating a path distance between nodes according to transmission rate and related time of a radio frequency signal between the adjacent relay station nodes; gradually calculating and determining selected paths between the sensor terminal node and the base station node for data transmission according to an integrated evaluation index Pim until a best path between the two points is selected. The method can select a path with minimum value on a safety base, so a safe and reliable data transmission path can be ensured in a wireless sensor network environment, and the transmission data consumed energy can be minimized, thus prolonging a whole network life period.

Description

Based on the efficient data transfer path establishment method of trusting
Technical field
The present invention relates to computer network security field, particularly in wireless sensor network environment, select a method of carrying out route efficiently and safely, utilize the self-organizing of sensor node feature into the net itself in the method, set up a kind of path that data security can be transferred to efficiently destination.Can be applicable to battlefield monitoring, environment and ecology monitoring, remote medical monitor and Industry Control etc.
Background technology
The develop rapidly of network has brought great convenience, information in Internet of Things increases sharply, and how to ensure that the information security transmitted between node is quick as the wireless sensor network of underlying infrastructure, preserve the energy of node, extend network lifecycle, a bottleneck problem of bitter networking development beyond doubt.
At present, many researchers respectively for the shortest path between wireless sensor network node 2 and be studied for the degree of belief between node, and achieve corresponding technological achievement.The shortest path of research point-to-point transmission transmission data is minimizes from distance, adopts Freud's algorithm or ground Jie Sitela algorithm, obtains beeline between 2 or a bit to the beeline of other each point.For trust aspect, no matter the degree of belief research method between 2 or the research aspect of trust model and trust management, there is the research method of comparative maturity, safer mainly for the trust mode how set up between node, to set up when calculating degree of belief improvement of how Consideration etc.Setting up in routing procedure, also having the method considering shortest path and trust factor, be generally from prevention certain attack angle such as Worm-hole attack be starting point, research prerequisite be directly assumed to be shortest path.No matter above two kinds of researchs, be the shortest path between 2 or trust factor, all with optimal path, data can not be sent to destination safely.
Therefore, ensure that sensor node is under the condition of finite energy, is delivered to the other side data safely, the method how selecting optimal path becomes a technical problem being badly in need of solving.
Summary of the invention
For the deficiency that prior art exists, the object of the present invention is to provide a kind of method for building up of data transfer path, under carrying out transmitting data cases between node in wireless sensor network, make the information carrying out between node operating be safe, and the path selected is relative efficiency.
For achieving the above object, technical scheme of the present invention is: based on the efficient data transfer path establishment method of trusting, node in wireless sensor network is made up of sensor terminal node, relay station node, base-station node, center control nodes and terminal use, the functional unit of described center control nodes has node listing information unit, data processing unit and data storage cell, and transmission path method for building up comprises the following steps:
1) in advance respective No. ID and the positional information that calculates entrained by sensor terminal node, relay station node and base-station node is sent to the node listing information unit in center control nodes, described sensor terminal node is used for image data, and the positional information of each node is obtained by the algorithm of relative positioning method and relative positioning;
2) data processing unit in center control nodes, according to node listing information unit reception to data in interaction scenario between two adjacent relay tiny nodes, calculate the degree of belief of each relay station node, and be stored in the data storage cell in center control nodes;
3) data processing unit in center control nodes, according to node listing information unit reception to data in the transmission rate of radio frequency signal and transmission time and processing time between two adjacent relay tiny nodes, calculate the path between relay station adjacent node, and be stored in the data storage cell in center control nodes;
4) data processing unit in center control nodes, by degree of belief and two internodal paths of neighboring relay stations of relay station node on calculating path one by one, according to comprehensive evaluation index P imsuccessively calculate and judge that sensor terminal node transmits path selected by data, until select the optimal path of point-to-point transmission to base-station node.
Preferably, utilize the initial trust value of each relay station node, determine the degree of belief of each relay station node according to the signal intelligence between two adjacent relay tiny nodes, the degree of belief of each relay station node is by formula calculate, wherein, T imrepresent the trust value from the angle of m node node i, g imrepresent the number of success that communicates of node i and node m, b imrepresent the communication failure number of times of node i and node m.
Preferably, the path between described two relay station adjacent nodes, its computing formula is: wherein, d ijrepresent the distance between node i and node j, v represents the transmission rate of the radio frequency signal of node, t i1represent that first time measures interior joint i to node j from sending data to the transmission time receiving and reply response, t j1represent that first time measures interior joint j from receiving data that node i sends to the processing time sending a reply node i response, t j2represent second time measuring process interior joint j to node i from sending data to the transmission time receiving response, t i2represent that second time measuring process interior joint i is from receiving data that node j sends to the processing time sending a reply response.
Preferably, comprehensive evaluation index P imcomputing formula be: wherein, P imfor the comprehensive evaluation index on m paths selected after adding i-th node, the path d of m paths selected after adding i-th node improportion shared in the calculation, be add i-th node after degree of belief average on selected m paths proportion shared in the calculation, described degree of belief average by formula calculate, wherein, T ithe degree of belief of node i on delegated path, n imrepresent the number of node on m paths after adding node i, represent the degree of belief average on m paths after adding node i.
Compared with prior art, the technique effect of technical solution of the present invention is: data transmission path establishing method of the present invention is as considering factor using the length in the trusting degree of path entirety and path, the path only having degree of belief high is just likely as alternative path, and ensureing path selection minimum value on safe basis, like this, both can ensure there is a safe and reliable data transfer path in wireless sensor network environment, minimizing of transmitted data consumes energy can also be ensured, the prolongation of whole network lifecycle can be ensured, this is for the very limited wireless sensor network of node energy, very favourable beyond doubt.
Be described in further detail the present invention below with reference to drawings and Examples, this embodiment is only for explaining the present invention.Protection scope of the present invention is not construed as limiting.
Accompanying drawing explanation
Fig. 1 is the theory diagram of data transmission path establishing method of the present invention;
Fig. 2 is the overall procedure schematic diagram of data transmission path establishing method of the present invention;
Fig. 3 is information transmission and the Path selection topological diagram of the present invention one exemplary embodiment, in figure, and the direction that dotted line unidirectional arrow delegated path is selected, solid two-way arrow representative information direction of transfer.
Embodiment
The present invention is intended in wireless sensor network environment, select one not only efficient but also carry out the method for route safely, Fig. 1 illustrates the principle of data transmission path establishing method of the present invention.Node in wireless sensor network is made up of sensor terminal node, relay station node, base-station node, center control nodes and terminal use.On the one hand, the data processing unit in center control nodes, according to the communication number of success in data between two adjacent relay tiny nodes and communication failure number of times, calculates the degree of belief T of each relay station node im.On the other hand, the data processing unit in center control nodes, according to the transmission rate of radio frequency signal between two adjacent relay tiny nodes and transmission time and processing time, calculates the path d between relay station adjacent node ij.Then, comprehensive evaluation index P is utilized imsuccessively calculate and judge that sensor terminal node is to path selected by base-station node transmission data, until select the optimal path of point-to-point transmission, thus realizes, under the limited condition of sensor network energy, safely data being sent to the other side.
The overall procedure of data transmission path establishing method of the present invention as shown in Figure 2.1) after system starts, first respective No. ID and the positional information that calculates entrained by sensor terminal node, relay station node and base-station node is sent to the node listing information unit in center control nodes, the positional information of each node is obtained by conventional relative positioning method and relative localization algorithm; Sensor terminal node, before image data, sends a time service synchronizing signal to the sensor node of each terminal by center control nodes, starts image data to enable each transducer simultaneously.2) neighbor node is searched for: search for whole neighbor node one by one, and according to calculate the degree of belief T of relay station node on path successively one by one imand basis calculate two internodal path d of neighboring relay stations ij.3) the degree of belief T of the relay station node searched for and calculate imwith two internodal path d of neighboring relay stations ijinformation is input to the data processing unit of center control nodes respectively, such as, by first node, search for its whole neighbor node, and as first step detection, these neighbor nodes is joined center control nodes.4) calculate and judge comprehensive evaluation index P, according to draw.For first node, first,
Calculate the path d of this first node apart from each neighbor node 1j; Then, according to calculate the degree of belief average on every paths set path Length Weight with the weight of the degree of belief average of node on path , calculate the comprehensive evaluation index P on each paths respectively im.5) from above-mentioned result of calculation, the large P of comprehensive evaluation index is selected imthe path d of corresponding neighbor node 2m, this neighbor node is as Section Point; The Section Point added and routing information are input to center control nodes data storage cell store.6) previous node is to the next node transmission data of next-door neighbour, and in order to being transferred to down hop relay station node, such as, first node is sent to the data gathered in Section Point microprocessor and stores; In above-mentioned steps 5) basis on, continue to find down hop relay station node, such as, find the relay station node of the down hop transfer of data of Section Point, Section Point searches for whole neighbor node, calculates and deterministic process repetition above-mentioned steps 2), select the 3rd, the four to the n-th neighbor node; Calculate the P corresponding to path between each neighbor node respectively imvalue; Repeat above-mentioned steps 2) to selecting the n-th neighbor node, obtain the path d of final data transmission.7) judge whether the new neighbor node selected is base station: if the n-th neighbor node did not collect base station, then get back to step 2), re-start above-mentioned flow process, if the n-th neighbor node collected base station, then carry out next step.8) the n-th neighbor node sends the data stored in the microprocessor of base station to along selected path and stores.9) base-station node is transferred to terminal use storing data in the microprocessor.Flow process terminates.
About path weight w dwith the weight of the degree of belief average of node on path setting, in practice, in principle, if more focus on path when selecting route, such as, in wireless sensor network, in order to extend network lifecycle, saving node energy, reducing the distance of transfer of data, and in the data fusion operation carried out, then w dshared proportion is larger; And if some transmission data itself have in the application of privacy or confidentiality, all to improve accordingly the security level in node itself and path itself, the weight w shared by degree of belief at this moment tlarger.
exemplary embodiment
See Fig. 3, with four node S 1, S 2, S 3, S 4for example, the direction that in figure, dotted line unidirectional arrow delegated path is selected, solid two-way arrow representative information direction of transfer.
Data transmission path establishing method:
1) each node S 1, S 2, S 3, S 4degree of belief be respectively 0.7,0.6,0.8,0.9;
Length between adjacent node is respectively S 1s 2=3, S 1s 3=9, S 2s 3=1, S 2s 4=5, S 3s 4=2; These information are deposited into the data processing unit of center control nodes.
2) first, by node S 1image data, S 1search neighbor node S 2, S 3, S 2, S 3as first time, the neighbor node of detection joins center control nodes.
3) S is judged 1which neighbor node is data passed to, first calculating path length:
S 1-S 2: 3 are designated as d 11=3
S 1-S 3: 9 are designated as d 12=9
4) then calculation procedure 3) in every paths on degree of belief average:
S 1-S 2： 0.7 + 0.6 2 = 0.65 Be designated as T ‾ 11 = 0.65
S 1-S 3： 0.7 + 0.8 2 = 0.75 Be designated as T ‾ 12 = 0.75
5) in the middle of two paths final selected be which bar, overall target computing formula be used calculate, suppose that the weight of the degree of belief average of node on path weight and path is equivalent 0.5, i.e. w d=w t=0.5, the overall target calculating two paths is like this:
S 1-S 2： 0.5 3 + 0.5 × 0.65 = 0.492 Be designated as P 11=0.492
S 1-S 3： 0.5 9 + 0.5 × 0.75 = 0.431 Be designated as P 12=0.431
6) P that comprehensive weights are large is selected 11path corresponding to=0.492: S 1-S 2.
7) the relay station node S added 2be input to center control nodes data processing unit with routing information to store, simultaneously node S 1the data gathered are sent to node S 2store in microprocessor, in order to being transferred to down hop relay station.
8) at S 1-S 2on basis, find S 2the relay station of down hop transfer of data.S 2node searching neighbor node is S 3, S 4.Computational process repeats step 3) to step 5).
9) P that two paths are corresponding is calculated imbe worth as follows:
S 1-S 2-S 3：d 21=4? ?P 21=0.475
S 1-S 2-S 4：d 22=8? ?P 22=0.429
10) at S 1-S 2the P that comprehensive weights are large is selected on the basis in path 21path corresponding to=0.475: S 1-S 2-S 3.
11) the relay station node S added 3be input to center control nodes data processing unit with routing information to store, simultaneously node S 2the data gathered are sent to node S 3store in microprocessor, in order to being transferred to down hop relay station.
12) S 3node continues search down hop neighbor node S 4for base station, at path S 1-S 2-S 3calculating path S on basis 1-S 2-S 3-S 4length is 6.
13) S 4node searching, to base station, then stores the data gathered are sent in the microprocessor of base station.
14) base-station node is storing transfer of data in the microprocessor in terminal use's hand.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (5)

1. based on the efficient data transfer path establishment method of trusting, node in wireless sensor network is made up of sensor terminal node, relay station node, base-station node, center control nodes and terminal use, the functional unit of described center control nodes has node listing information unit, data processing unit and data storage cell, and transmission path method for building up comprises the following steps:
1) in advance respective No. ID and the positional information that calculates entrained by sensor terminal node, relay station node and base-station node is sent to the node listing information unit in center control nodes, described sensor terminal node is used for image data, and the positional information of each node is obtained by relative positioning method and relative localization algorithm;
2) data processing unit in center control nodes, according to node listing information unit reception to data in interaction scenario between two adjacent relay tiny nodes, calculate the degree of belief of each relay station node, and be stored in the data storage cell in center control nodes;
3) data processing unit in center control nodes, according to node listing information unit reception to data in the transmission rate of radio frequency signal and transmission time and processing time between two adjacent relay tiny nodes, calculate the path between relay station adjacent node, and be stored in the data storage cell in center control nodes;
4) data processing unit in center control nodes, by degree of belief and two internodal paths of neighboring relay stations of relay station node on calculating path one by one, according to comprehensive evaluation index P imsuccessively calculate and judge that sensor terminal node transmits path selected by data, until select the optimal path of point-to-point transmission to base-station node.
2. data transmission path establishing method according to claim 1, it is characterized in that, described step 2), utilize the initial trust value of each relay station node, determine the degree of belief of each relay station node according to the signal intelligence between two adjacent relay tiny nodes, the degree of belief of each relay station node is by formula calculate, wherein, T imrepresent the trust value from the angle of m node node i, g imrepresent the number of success that communicates of node i and node m, b imrepresent the communication failure number of times of node i and node m.
3. data transmission path establishing method according to claim 2, is characterized in that, described step 3), and the path between relay station adjacent node, by formula calculate, wherein, d ijrepresent the distance between node i and node j, v represents the transmission rate of the radio frequency signal of node, t i1represent that first time measures interior joint i to node j from sending data to the transmission time receiving and reply response, t j1represent that first time measures interior joint j from receiving data that node i sends to the processing time sending a reply node i response, t j2represent second time measuring process interior joint j to node i from sending data to the transmission time receiving response, t i2represent that second time measuring process interior joint i is from receiving data that node j sends to the processing time sending a reply response.
4. data transmission path establishing method according to claim 3, is characterized in that, described step 4), described comprehensive evaluation index P imcomputing formula be: wherein, P imfor the comprehensive evaluation index on m paths selected after adding i-th node, the path d of m paths selected after adding i-th node improportion shared in the calculation, be add i-th node after degree of belief average on selected m paths proportion shared in the calculation, described degree of belief average by formula calculate, wherein, T ithe degree of belief of node i on delegated path, n imrepresent the number of node on m paths after adding node i, represent the degree of belief average on m paths after adding node i.
5. data transmission path establishing method according to claim 4, is characterized in that, in described step 4), described according to comprehensive evaluation index P imsuccessively calculate and judge the optimal path of point-to-point transmission, its concrete steps are as follows:
(1) first, the degree of belief T of each relay station node imwith the path d of adjacent relay tiny node ijbe stored into respectively in the data processing unit of center control nodes;
(2) start image data, by first node, search for its whole neighbor node, and as first step detection, these neighbor nodes are joined center control nodes;
(3) judge which neighbor node this first node should be transferred to data: first, calculate the path d of this first node apart from each neighbor node 1j;
(4) the degree of belief average on the every paths then, in calculation procedure (3)
(5) last, by comprehensive evaluation index P imcalculating and judgement, select final data transmission path, its calculate and judge process as follows:
(5.1) set path Length Weight with the weight of the degree of belief average of node on path , calculate the comprehensive evaluation index P on each paths respectively im;
(5.2) P that comprehensive evaluation index is large is selected imthe path d of corresponding neighbor node 2m, this neighbor node is as Section Point;
(5.3) Section Point added and routing information are input to center control nodes data storage cell to store, first node is sent to the data gathered in Section Point microprocessor and stores, in order to being transferred to down hop relay station node simultaneously;
(5.4) on the basis of step (5.2), find the relay station node of the down hop transfer of data of Section Point, Section Point searches for whole neighbor node, calculate and deterministic process repetition step (3) to step (5), select the 3rd, the four to the n-th neighbor node;
(5.5) P between each neighbor node corresponding to path is calculated respectively imvalue;
(5.6) repeat step (5.2) to (5.4), obtain the path d of final data transmission;
(5.7) when the n-th neighbor node collected base station, the n-th neighbor node is sent to the data stored in the microprocessor of base station and stores.
(5.8) base-station node store in the microprocessor transfer of data in terminal use's hand;
(5.9) terminate.
CN201310225103.3A 2013-06-07 2013-06-07 High efficiency data transmission path setup method based on trust Pending CN104244233A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310225103.3A CN104244233A (en) 2013-06-07 2013-06-07 High efficiency data transmission path setup method based on trust

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310225103.3A CN104244233A (en) 2013-06-07 2013-06-07 High efficiency data transmission path setup method based on trust

Publications (1)

Publication Number Publication Date
CN104244233A true CN104244233A (en) 2014-12-24

Family

ID=52231412

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310225103.3A Pending CN104244233A (en) 2013-06-07 2013-06-07 High efficiency data transmission path setup method based on trust

Country Status (1)

Country Link
CN (1) CN104244233A (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104951533A (en) * 2015-06-18 2015-09-30 北京乐动卓越科技有限公司 Information name card querying method and system
CN106888430A (en) * 2017-04-17 2017-06-23 华侨大学 A kind of believable sensing cloud Data Collection appraisal procedure
CN107889183A (en) * 2017-10-27 2018-04-06 深圳友讯达科技股份有限公司 Data transmission method and device
CN108681295A (en) * 2018-05-29 2018-10-19 深圳智达机械技术有限公司 Wind-power engine room Intelligent fire-fighting automatic measuring and controlling system
CN108805528A (en) * 2018-05-29 2018-11-13 深圳凯达通光电科技有限公司 Electric power construction field informationization intelligent monitoring system
CN109587153A (en) * 2018-12-14 2019-04-05 中国人民解放军国防科技大学 General ecological safety monitoring data acquisition method and device based on data flow customization
CN113068157A (en) * 2021-02-02 2021-07-02 浙江嘉蓝海洋电子有限公司 Point-to-point communication method with high transmission stability between coasts
CN113301501A (en) * 2021-07-26 2021-08-24 广州乐盈信息科技股份有限公司 Method for expanding 5G network communication capability

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009057884A1 (en) * 2007-11-01 2009-05-07 Electronics And Telecommunications Research Institute Multi-path routing method in wireless sensor network
CN102006284A (en) * 2010-11-02 2011-04-06 南京邮电大学 Credibility based QoS (Quality of Service) route selection method
CN102035726A (en) * 2010-11-11 2011-04-27 北京航空航天大学 Wormhole attack defense method based on multipath routing and trust mechanism in Ad hoc network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009057884A1 (en) * 2007-11-01 2009-05-07 Electronics And Telecommunications Research Institute Multi-path routing method in wireless sensor network
CN102006284A (en) * 2010-11-02 2011-04-06 南京邮电大学 Credibility based QoS (Quality of Service) route selection method
CN102035726A (en) * 2010-11-11 2011-04-27 北京航空航天大学 Wormhole attack defense method based on multipath routing and trust mechanism in Ad hoc network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
付翔燕: "无线传感器网络选择性传递攻击的检测和防御机制", 《计算机应用》 *
荆琦: "无线传感器网络中的信任管理", 《软件学报》 *

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104951533A (en) * 2015-06-18 2015-09-30 北京乐动卓越科技有限公司 Information name card querying method and system
CN106888430A (en) * 2017-04-17 2017-06-23 华侨大学 A kind of believable sensing cloud Data Collection appraisal procedure
CN106888430B (en) * 2017-04-17 2019-12-17 华侨大学 Credible sensing cloud data collection and evaluation method
CN107889183A (en) * 2017-10-27 2018-04-06 深圳友讯达科技股份有限公司 Data transmission method and device
CN107889183B (en) * 2017-10-27 2021-05-14 深圳友讯达科技股份有限公司 Data transmission method and device
CN108681295A (en) * 2018-05-29 2018-10-19 深圳智达机械技术有限公司 Wind-power engine room Intelligent fire-fighting automatic measuring and controlling system
CN108805528A (en) * 2018-05-29 2018-11-13 深圳凯达通光电科技有限公司 Electric power construction field informationization intelligent monitoring system
CN109587153A (en) * 2018-12-14 2019-04-05 中国人民解放军国防科技大学 General ecological safety monitoring data acquisition method and device based on data flow customization
CN109587153B (en) * 2018-12-14 2021-01-15 中国人民解放军国防科技大学 General ecological safety monitoring data acquisition method and device based on data flow customization
CN113068157A (en) * 2021-02-02 2021-07-02 浙江嘉蓝海洋电子有限公司 Point-to-point communication method with high transmission stability between coasts
CN113301501A (en) * 2021-07-26 2021-08-24 广州乐盈信息科技股份有限公司 Method for expanding 5G network communication capability
CN113301501B (en) * 2021-07-26 2021-10-19 广州乐盈信息科技股份有限公司 Method for expanding 5G network communication capability

Similar Documents

Publication Publication Date Title
CN104244233A (en) High efficiency data transmission path setup method based on trust
CN109547351B (en) Routing method based on Q learning and trust model in Ad Hoc network
Okazaki et al. Ant-based dynamic hop optimization protocol: A routing algorithm for mobile wireless sensor networks
CN104507135A (en) Underwater sensor network routing method of plurality of mobile convergent nodes
CN104869604A (en) RPL-based layer type route establishment method of wireless sensor network
Dagdeviren et al. An energy-efficient distributed cut vertex detection algorithm for wireless sensor networks
CN105634964B (en) A kind of mobile ad-hoc network and its multicast route method
Awan et al. Quality of service-based node relocation technique for mobile sensor networks
Haripriya et al. A Framework for detecting malicious nodes in mobile Adhoc Network
Datta Modified Ant-AODV-VANET routing protocol for vehicular adhoc network
CN104159265A (en) Data transmission method for low-speed wireless Ad Hoc network
Rekha et al. SRHM: Sustainable routing for heterogeneous Adhoc environment in iot-based mobile communication
CN103491596B (en) A kind of micro power radio communication method
Jeyaprakash et al. A New Trusted Routing Protocol for Vehicular Ad Hoc Networks Using Trusted Metrics.
CN108832995A (en) Unmanned plane based on Dynamic Programming cooperates with method for message transmission
CN109040954A (en) A kind of shaft tower condition monitoring system and its method for routing based on wireless sensor network
Jebaseelan et al. ArcRectZone: A Lightweight Curved Rectangle Vector Based Secure Routing for Mobile Ad-Hoc Sensor Network.
CN114189887A (en) Method for optimizing mobile ad hoc network routing based on improved sparrow search algorithm
Colmenar et al. Data delivery and gathering in IoT applications: An overview
Rahman et al. An efficient position based power aware routing algorithm in mobile ad-hoc networks
Quesada et al. A constraint programming approach to the additional relay placement problem in wireless sensor networks
Aher Trust calculation for improving reliability of routing and data aggregation in WSN
CN104185240A (en) Collaboration multipoint industrial control collecting data transmission method
CN105792348A (en) Node positioning method between nodes in wireless sensor network
Senouci et al. Detecting boundary nodes in wsn

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20141224

RJ01 Rejection of invention patent application after publication