CN109257114A - A kind of effective routing design method based on evidence theory - Google Patents

A kind of effective routing design method based on evidence theory Download PDF

Info

Publication number
CN109257114A
CN109257114A CN201811156262.1A CN201811156262A CN109257114A CN 109257114 A CN109257114 A CN 109257114A CN 201811156262 A CN201811156262 A CN 201811156262A CN 109257114 A CN109257114 A CN 109257114A
Authority
CN
China
Prior art keywords
node
data packet
neighbor
success
waiting time
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
Application number
CN201811156262.1A
Other languages
Chinese (zh)
Other versions
CN109257114B (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.)
Tianjin University
Original Assignee
Tianjin University
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 Tianjin University filed Critical Tianjin University
Priority to CN201811156262.1A priority Critical patent/CN109257114B/en
Publication of CN109257114A publication Critical patent/CN109257114A/en
Application granted granted Critical
Publication of CN109257114B publication Critical patent/CN109257114B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B13/00—Transmission systems characterised by the medium used for transmission, not provided for in groups H04B3/00 - H04B11/00
    • H04B13/02—Transmission systems in which the medium consists of the earth or a large mass of water thereon, e.g. earth telegraphy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B11/00—Transmission systems employing sonic, ultrasonic or infrasonic waves
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The effective routing design method based on evidence theory that the present invention relates to a kind of, includes the steps that following: source node is according to neighbor node dump energy, and the numerical value of neighbor node establishes corresponding BPA function under three indexs of effective propagation path and transmission success rate；The transmission characteristic of underwater acoustic channel, while the method for introducing exponential smoothing are not only considered in the calculating of node-node transmission success rate, in conjunction with the record of the previous transmission success of node and failure；The corresponding BPA function of selected three indexs is combined using Dempster rule of combination and obtains neighbor node nijDegree of belief；Node is successively added to forward node according to the sequence of node confidence from high to low and concentrated by source node, until the data packet forwarding probability of success is higher than threshold value initially set；If forward node listens to neighbors forwarding data packet of the degree of belief higher than oneself within the waiting time, the data packet cached is lost, otherwise data packet is forwarded after the waiting time.

Description

A kind of effective routing design method based on evidence theory
Technical field
The present invention relates to routing algorithm design methods in water sound sensor network.
Background technique
In recent years, underwater sound sensor network (Underwater Acoustic Sensor Networks, UASNs) As new one of research hotspot.The application of UASNs advances the research to marine environment, to fields such as economy, scientific research, military affairs All it is of great significance.However, communication mode that underwater sensor network use different from traditional terrestrial radio sensor network For sound communication, and Underwater Acoustic Environment noise jamming is big, and source is wide, therefore inter-node communication is very unstable；Underwater sensor simultaneously The finite energy of node, and it is deployed in deep water field, it is not easy replacement and all the design of the routing algorithm of underwater sensor network is mentioned New requirement is gone out.It is urgently solved so how to design a kind of routing algorithm that can be realized reliable communication and energy efficient and become Certainly the problem of.
In existing some node deployment methods, some obtains the location information of global node by sink node, and right Other ordinary nodes carry out optimum path planning, however the energy consumption for obtaining global information is excessively high, and the unstability of Underwater Acoustic Environment Leading to the valid data packet delivery fraction of institute's planning path not can guarantee；Or by known source node and destination node position coordinates, By way of establishing virtual pipe the quantity of limitation forwarding node come when planning routing, but being easy to appear number of nodes rareness without Method guarantees the problem of efficient communication；And it some more existing is often selected using single index based on chance routing algorithm Next-hop node is selected, it is easy to appear the node energy in part path in the case where the wide node density of deployment region range is small Too fast and premature death is consumed, so as to shorten network lifetime.In view of the above-mentioned problems, the present invention proposes one kind based on evidence theory The sensor network effective routing Protocol Design Method of (Dempster-Shafer evidence theory, DST),
Summary of the invention
The present invention proposes a kind of effective routing design method based on evidence theory, passes through effective choosing to next-hop node It selects, improves data packet delivery fraction, extend network lifetime.Technical solution is as follows:
A kind of effective routing design method based on evidence theory, includes the steps that following:
(1) source node n is setiNeighbor node integrate as Δ=(φ, ni1,ni2,ni3,...,nik), wherein k is node niIt is adjacent Occupy the number of node, source node is adjacent under three indexs of effective propagation path and transmission success rate according to neighbor node dump energy The numerical value for occupying node establishes corresponding BPA function m1,m2,m3, it is denoted as m respectively1(nij)、m2(nij) and m3(nij), effective transmission distance From being defined as the projection of vector that source node and next-hop node are formed on the vector that source node and purpose sink node are formed；
(2) transmission characteristic of underwater acoustic channel is not only considered in the calculating of node-node transmission success rate, while it is flat to introduce index Sliding method, in conjunction with the record of the previous transmission success of node and failure, node-node transmission probability of success calculation formula are as follows: p (d, m, N) =α p (d, m)+(1- α) precord(N), wherein α is proportionality coefficient, is set as the size that 0.6, m is data packet here, and d is source section Point between neighbor node at a distance from, p (d, m) be according to underwater acoustic channel characteristic calculate gained communicate the probability of success, precord(N) it is The success rate of n times success communication before node；
(3) the corresponding BPA function of selected three indexs is combined using Dempster rule of combination and obtains neighbours Node nijDegree of belief trust (nij)；
(4) node is successively added to forward node according to the sequence of node confidence from high to low and concentrated by source node, directly It is higher than threshold value P initially set to the data packet forwarding probability of successthreshold, the waiting time of forward node j-th of node of concentration TjCalculation formula are as follows:
Wherein d (fj,fj+1) it is node niDistance in forward node collection f between j-th and j+1 node, VsoundIt is underwater The speed of acoustic propagation, L are candidate forwarding centralized node number；
(5) if forward node listens to neighbors forwarding data packet of the degree of belief higher than oneself within the waiting time, The data packet cached is lost, otherwise data packet is forwarded after the waiting time.
Detailed description of the invention
Fig. 1 is overall flow figure of the invention
Fig. 2 is inventive network scene figure
Fig. 3 is effective propagation path matters figure of the invention
Specific embodiment
The present invention proposes a kind of effective routing Protocol Design Method based on evidence theory: mainly being realized using DST method The evidence fusion of multiple and different indexs, acquires node confidence, selects forward node collection to provide unified reference mark for source node It is quasi-.The quantity for optimizing forwarding centralized node simultaneously, the sequencing of node for data forwarding packet is determined using the height of degree of belief, and The corresponding waiting time is set, data packet delivery fraction is improved.
Key step is as follows:
1. the initial stage, the beacon obtained when node is according to netinit updates neighbor node location information and residue Energy, and monitor channel during then, to obtain the information update of neighbor node.
2. it is using itself as source node at this time, and the selector in neighbor node when a node will forward data packet Partial node constitutes forward node collection.If source node niNeighbor node integrate as Δ=(φ, ni1,ni2,ni3,...,nik), wherein k For node niThe number of neighbor node, at this point, source node goes over the biography of n times according to location information, the neighbor node of neighbor node The characteristic of defeated record and underwater acoustic channel is calculated corresponding data and constitutes BPA function m1,m2,m3。
Wherein m1For the BPA function that residue energy of node is constituted, indicate are as follows:
Wherein eijFor node nijDump energy.
m2For the BPA function that node-node transmission success rate is constituted, indicate are as follows:
WhereinFor node nijTransmission success rate, be calculated by exponential smoothing method.
m3For the BPA function that effective propagation path is constituted, indicate are as follows:
WhereinFor node nijEffective propagation path, calculation formula are as follows:
Neighbours' section is generated 3. BPA function corresponding to three indexs will be selected using Dempster rule of combination and combined The degree of belief of point, the rule of a combination thereof are as follows:Wherein:
4. source node is selected from high to low according to the degree of belief of neighbor node, until the data packet forwarding probability of success is high In value P initially setthreshold, it is set as 0.95 herein, source node sends the calculation formula of the data packet probability of success are as follows:WhereinFor the transmission success rate of j-th of node in forward node collection f.Its In and calculate according to corresponding location information and transfer sequence waiting time of forward node centralized node.In forward node collection f The waiting time T of j-th of nodejCalculation formula are as follows:
Wherein d (fj,fj+1) it is node niDistance in forward node collection f between j-th and j+1 node, VsoundIt is underwater The speed of acoustic propagation, L are candidate forwarding centralized node number.The delivery ratio of data packet will be not only improved in this way, while reducing and turning The quantity of node is sent out, energy saving extends the life span of network.
5. the sequence and positional information calculation respective nodes of the degree of belief that source node is concentrated according to forward node from high to low Waiting time, if the waiting time in forward node listen to degree of belief higher than oneself neighbors forwarding data packet, will The data packet cached is lost, and is otherwise forwarded after the waiting time to data packet.Until data packet forward successfully or All neighbor node retransmission failures forward again again.
6. the end of transmission if next-hop node is destination node, otherwise next-hop node is laid equal stress on source node oneself is set as Multiple step 1 is to step 5 up to being transmitted to mesh node.

Claims (1)

1. a kind of effective routing design method based on evidence theory, includes the steps that following:
(1) source node n is setiNeighbor node integrate as Δ=(φ, ni1,ni2,ni3,...,nik), wherein k is node niNeighbor node Number, source node is according to neighbor node dump energy, neighbor node under three indexs of effective propagation path and transmission success rate Numerical value establish corresponding BPA function m1,m2,m3, it is denoted as m respectively1(nij)、m2(nij) and m3(nij), effective propagation path definition For the projection of source node and the vector of next-hop node formation on the vector that source node and purpose sink node are formed；
(2) transmission characteristic of underwater acoustic channel is not only considered in the calculating of node-node transmission success rate, while introducing exponential smoothing Method, in conjunction with the record of the previous transmission success of node and failure, node-node transmission probability of success calculation formula are as follows: p (d, m, N)=α p (d,m)+(1-α)precord(N), wherein α be proportionality coefficient, be set as here 0.6, m be data packet size, d be source node with Distance between neighbor node, p (d, m) are to calculate gained according to underwater acoustic channel characteristic to communicate the probability of success, precordIt (N) is node The success rate of n times success communication before；
(3) the corresponding BPA function of selected three indexs is combined using Dempster rule of combination and obtains neighbor node nijDegree of belief trust (nij)；
(4) node is successively added to forward node according to the sequence of node confidence from high to low and concentrated by source node, until number It is higher than threshold value P initially set according to the packet forwarding probability of successthreshold, the waiting time T of forward node j-th of node of concentrationjMeter Calculate formula are as follows:
Wherein d (fj,fj+1) it is node niDistance in forward node collection f between j-th and j+1 node, VsoundFor underwateracoustic biography The speed broadcast, L are candidate forwarding centralized node number；
(5) will delay within the waiting time if forward node listens to neighbors forwarding data packet of the degree of belief higher than oneself The data packet kept is lost, and is otherwise forwarded after the waiting time to data packet.
CN201811156262.1A 2018-09-28 2018-09-28 Effective route design method based on evidence theory Active CN109257114B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811156262.1A CN109257114B (en) 2018-09-28 2018-09-28 Effective route design method based on evidence theory

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811156262.1A CN109257114B (en) 2018-09-28 2018-09-28 Effective route design method based on evidence theory

Publications (2)

Publication Number Publication Date
CN109257114A true CN109257114A (en) 2019-01-22
CN109257114B CN109257114B (en) 2021-09-28

Family

ID=65045333

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811156262.1A Active CN109257114B (en) 2018-09-28 2018-09-28 Effective route design method based on evidence theory

Country Status (1)

Country Link
CN (1) CN109257114B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130094398A1 (en) * 2011-09-10 2013-04-18 Arnab Das Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing
CN104010338A (en) * 2014-05-13 2014-08-27 南京邮电大学 Improved AODV routing method based on terminal energy sensing
CN104936230A (en) * 2015-06-15 2015-09-23 华侨大学 Wireless sensor network energy balance route optimization method based on cluster head expectation
US20160043942A1 (en) * 2014-08-07 2016-02-11 Gainspan Corporation Layer-3 mesh connectivity of wireless local networks
CN106231645A (en) * 2016-09-22 2016-12-14 国家电网公司 The wireless sensor network data transmission method of distribution line status monitoring
CN108112050A (en) * 2018-01-18 2018-06-01 山东大学 Energy balance and deep-controlled Routing Protocol based on underwater wireless sensing network

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130094398A1 (en) * 2011-09-10 2013-04-18 Arnab Das Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing
CN104010338A (en) * 2014-05-13 2014-08-27 南京邮电大学 Improved AODV routing method based on terminal energy sensing
US20160043942A1 (en) * 2014-08-07 2016-02-11 Gainspan Corporation Layer-3 mesh connectivity of wireless local networks
CN104936230A (en) * 2015-06-15 2015-09-23 华侨大学 Wireless sensor network energy balance route optimization method based on cluster head expectation
CN106231645A (en) * 2016-09-22 2016-12-14 国家电网公司 The wireless sensor network data transmission method of distribution line status monitoring
CN108112050A (en) * 2018-01-18 2018-06-01 山东大学 Energy balance and deep-controlled Routing Protocol based on underwater wireless sensing network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
张振京等: ""基于节点运动预测的社会性DTN高效路由"", 《计算机学报》 *
郝建国等: ""基于证据理论的自组织网不可联系性度量模型"", 《清华大学学报（自然科学版）》 *

Also Published As

Publication number Publication date
CN109257114B (en) 2021-09-28

Similar Documents

Publication Publication Date Title
Jain et al. Geographical routing using partial information for wireless ad hoc networks
Yan et al. DBR: Depth-based routing for underwater sensor networks
Zhang et al. A link-state based adaptive feedback routing for underwater acoustic sensor networks
Rahman et al. Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network
Ayaz et al. Hop-by-hop dynamic addressing based (H2-DAB) routing protocol for underwater wireless sensor networks
Mazinani et al. A vector-based routing protocol in underwater wireless sensor networks
Nayyar et al. Comprehensive analysis of routing protocols surrounding underwater sensor networks (UWSNs)
Chen et al. ACOA-AFSA fusion dynamic coded cooperation routing for different scale multi-hop underwater acoustic sensor networks
WO2011140877A1 (en) Routing forwarding method, routing node and wireless communication network
CN111278078B (en) Method for realizing self-adaptive routing protocol of mobile sparse underwater acoustic sensor network
CN106060886B (en) A kind of water sound sensor network Routing Protocol construction method based on asymmetric link
Khalid et al. Comparison of localization free routing protocols in underwater wireless sensor networks
Gul et al. Light-weight depth-based routing for underwater wireless sensor network
CN104469874B (en) A kind of message forwarding method of the opportunistic network based on probability centrad
CN106850436A (en) Mine hybrid wireless mesh network routing protocols based on virtual potential energy field
CN108632785B (en) Ant colony self-adaptive Internet of vehicles routing method based on link quality
JP2006050461A (en) Method of configuring multi-hop radio system and radio node device
CN111641990B (en) Underwater acoustic sensor network transmission method with high data packet delivery rate and energy efficiency
Ma et al. An efficient and low-signaling opportunistic routing for underwater acoustic sensor networks
CN110247850B (en) Ship networking protocol implementation method based on dynamic routing table
KR20090059822A (en) Device for routing in wireless sensor network and method thereof
Li et al. An Environment‐Friendly Multipath Routing Protocol for Underwater Acoustic Sensor Network
CN109257114A (en) A kind of effective routing design method based on evidence theory
WO2015077940A1 (en) Sink node routing method and node device
Ismail et al. A novel routing protocol for underwater wireless sensor networks based on shifted energy efficiency and priority

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant