[go: up one dir, main page]

CN111541480B - Low-energy-consumption free space optical network restoration method based on reflection characteristics - Google Patents

Low-energy-consumption free space optical network restoration method based on reflection characteristics Download PDF

Info

Publication number
CN111541480B
CN111541480B CN202010295021.6A CN202010295021A CN111541480B CN 111541480 B CN111541480 B CN 111541480B CN 202010295021 A CN202010295021 A CN 202010295021A CN 111541480 B CN111541480 B CN 111541480B
Authority
CN
China
Prior art keywords
node
coverage
energy
nodes
communication
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.)
Active
Application number
CN202010295021.6A
Other languages
Chinese (zh)
Other versions
CN111541480A (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.)
Yanshan University
Original Assignee
Yanshan 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 Yanshan University filed Critical Yanshan University
Priority to CN202010295021.6A priority Critical patent/CN111541480B/en
Publication of CN111541480A publication Critical patent/CN111541480A/en
Application granted granted Critical
Publication of CN111541480B publication Critical patent/CN111541480B/en
Priority to JP2021068766A priority patent/JP7098195B2/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/03—Arrangements for fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/11—Arrangements specific to free-space transmission, i.e. transmission through air or vacuum
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/29—Repeaters
    • 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

  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Optical Communication System (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Multi Processors (AREA)

Abstract

The invention provides a low-energy-consumption free space optical network repairing method based on reflection characteristics, which comprises the following steps of: when the free space optical network works, monitoring the sub-death state of the node according to the existing Heartpoint mechanism, and acquiring node information; when the node dies completely, determining the node type through node information, dividing a monitoring area into regular grids, establishing a Neyman-Pearson model according to a Neyman-Pearson judgment criterion, and determining the coverage state of the grid points; and calculating the detection probability of dead nodes and surrounding grid points through the model, and searching the optimal position according to different node types to repair the cavity. The invention provides an improved minimum coverage circle repairing method and an energy coverage comprehensive evaluation model, carries out classified repairing on dead nodes, improves network coverage by searching for an optimal repairing position, and introduces nodes with mirrors, thereby reducing energy consumption and prolonging the network life period after repairing.

Description

Low-energy-consumption free space optical network restoration method based on reflection characteristics
Technical Field
The invention relates to the technical field of communication, in particular to a low-energy-consumption free space optical network repairing method based on reflection characteristics.
Background
Nowadays, networks have become a very important part of people's lives, and Free Space Optical Networks (FSONs) have the advantages of high transmission data rate, high security, non-standardized spectrum, and the like. In the FSON, once some nodes die due to a failure, coverage holes are caused, more links are also interrupted, and meanwhile, the accuracy of network monitoring data is reduced, so that the network performance is seriously affected, and energy waste is caused. Therefore, how to detect and repair coverage holes and restore the normal operation of the network is a main problem of FSON.
At present, a free space optical network repairing method does not exist, and the traditional wireless network repairing research mainly finds out the optimal repairing position of a coverage hole in a sensor network through a geometric method. And a normal node is newly added according to the position of the repair point, so that the aim of repairing the coverage hole is fulfilled on the premise of ensuring the node redundancy in the network. But the energy consumption of nodes after repair is not considered in the repair method of the newly added normal nodes, so that the network is easily disabled again due to uneven energy consumption.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides an effective repairing method of dead nodes in a free space optical network, on one hand, an improved minimum covering circle repairing method is adopted, the minimum normal nodes are added to replace the dead nodes, the holes caused by the dead nodes are repaired, the network coverage is improved, and the network communication is restored; on the other hand, a comprehensive coverage energy evaluation model is provided, a node with a mirror is creatively introduced for repairing, the condition that the energy consumption of the node is still uneven after repairing until a newly added normal node rapidly dies again is avoided, and the purposes of accurately repairing the cavity and prolonging the life cycle of the network are achieved.
The invention relates to a low-energy-consumption free space optical network repairing method based on reflection characteristics, which comprises the following steps of: monitoring the sub-death state of a node according to the existing Heartpoint mechanism and acquiring node information when a free space optical network works; secondly, after the sub-death nodes die completely, determining the types of the nodes according to the acquired node information, and dividing the nodes into relay type nodes and non-relay type nodes; determining the coverage states of grid points where dead nodes are located and peripheral grid points, dividing a monitoring area into regular grids, firstly establishing a Neyman-Pearson model according to a Neyman-Pearson judgment criterion, calculating the joint detection probability of the grid points where the dead nodes are located and each peripheral grid point, then setting a threshold value for the detection probability of the grid points, and dividing the coverage states of the grid points into effective coverage, possible coverage and coverage holes according to the comparison relationship between the probability and the threshold value; step four, searching the optimal positions according to the types of dead nodes and the coverage state of peripheral grid points, and respectively repairing the dead nodes; for non-relay type dead nodes, the repair process is as follows: s1, respectively selecting coordinate sets of four edge grid points with the maximum and minimum horizontal coordinates and longitudinal coordinates of n void grid points generated by node death according to the coverage states of the grid points where the death nodes are located and the surrounding grid points obtained in the step three, and sequencing the four grid points in a clockwise direction; s2, connecting the four grid points to form a quadrangle, and making an inscribed circle of the quadrangle; s3, calculating the center of an inscribed circle, wherein the center of the inscribed circle is the best position for repair; s4, placing the common node at the optimal position for optical network repair; for a dead node of a relay type, the repairing process is as follows: p1, according to the coverage states of the grid points where the death nodes are located and the surrounding grid points obtained in the third step, according to different weight proportions, the sum of the areas of the coverage holes and the possible coverage before repair and the sum of the areas of the coverage holes and the possible coverage after repair are obtained through addition calculation, and the coverage ratio is obtained through comparison of the two areas; p2, considering an energy model of a mirror node after the mirror is introduced for repair through a free space light energy model; p3, selecting the node pair whose maximum probability can be reflected by the dead node location; p4, establishing a comprehensive coverage energy evaluation model through a coverage ratio and an energy model of a mirror node introduced with mirror restoration; p5, finding the optimal repair position of the node with the mirror through a comprehensive evaluation model under the constraint of establishment of reflection and recovery of the communication area of the communication node through the mirror node; p6, placing the mirrored repair node in the optimal position, repairing communication through a pair of node pairs that the mirrored repair node communicates with; p7, other nodes forwarding the message through the dead relay node, selects the normal communication nodes nearest to the node to resume communication.
Preferably, the node information in the step one includes a node position, a node communication mode and position information of a node pair that needs to communicate through the node, and the node pair is composed of a source node and a destination node.
Preferably, in the second step, the relay-type node undertakes a forwarding task in communication, and the non-relay-type node does not undertake a forwarding task in communication.
Preferably, the process of selecting node pairs in step P3 is that there may be multiple pairs of node pairs that need to resume communication through mirror nodes according to dead node information, different node pairs and dead nodes form different trilaterals, and the node pair closest to the equilateral triangle is selected as the node pair with the maximum probability of being able to reflect through the dead node position.
Preferably, the specific steps of the P7 step that other nodes forwarding messages through the dead relay node select the normal communicable node closest to the other nodes to resume communication are as follows: p61, the communication node needing to be recovered sends a message, which contains the position information of the communication node; p62, other nodes in the communication range receive the message, and send the position information to the communication node needing to be recovered according to the position information of the communication node needing to be recovered; and P63, the communication node needing to be recovered selects the node with the minimum distance to complete the recovery communication by judging the received information.
Preferably, the coverage ratio in step P1 is established as follows:
Figure GDA0002903385300000031
Figure GDA0002903385300000032
f＝P1/P (6)
wherein S is0To cover the void area before repair, S1Adding the areas according to different weight proportions to obtain a void value P for possible coverage areas; s10For covering after repairArea of cavity, S11Adding the areas according to different weight proportions to obtain a void value P for possible coverage area1And f is a coverage ratio.
Preferably, after introducing mirror repair in step P2, the energy model of the mirror nodes is established as follows;
obtaining the energy consumption E of three nodes according to the free space optical communication energy model as follows:
Figure GDA0002903385300000041
wherein E isTFor source node energy consumption, EMFor mirror nodal energy consumption, EREnergy consumption of destination node, m1Representing the number of bits of the data packets transmitted by the source node, epsilon representing the energy coefficient of the free-space optical wave,
Figure GDA0002903385300000042
is the angle of divergence, l is the communication distance, ETX_PERepresenting the energy consumed by the optoelectronic component transmitting the unit bit data, m2Indicating the number of bits of data packets transmitted by the mirror nodes, ERXIndicating the energy consumed to receive a unit bit of data.
Preferably, the comprehensive evaluation model W of the covering energy in the step P4 is:
Figure GDA0002903385300000043
wherein f is a coverage ratio; and E is node energy consumption.
The invention has the following effects:
on the premise of providing an improved minimum coverage circle repairing method and a coverage energy comprehensive evaluation model, the method adopts the improved method and the evaluation model to carry out classified repairing on dead nodes, adopts the improved minimum coverage circle repairing method to repair cavities generated by non-relay nodes, and improves network coverage by searching for an optimal repairing position; compared with the common node, the node with the mirror can not only normally transmit and receive messages, but also transmit the messages through mirror reflection. And repairing the cavity generated by the relay node through a coverage energy comprehensive evaluation model, and prolonging the service life of the repaired network.
Drawings
FIG. 1 is a schematic diagram of a non-relay node repair method for a low-energy-consumption free space optical network based on reflection characteristics according to the present invention;
fig. 2 is a schematic diagram of a relay-type node repair of the present invention; and
fig. 3 is a flow chart of the present invention.
In the figure:
1-maximum edge grid point of vertical coordinate; 2-transverse coordinate minimum edge grid point; 3-longitudinal coordinate minimum margin grid point; 4-maximum edge grid point of lateral coordinate; 5-quadrangle; 6-inscribed circle; 7-optimal repair position of non-relay node; 8-polygon; 9-circle center position: 12-perpendicular bisector; 13-a communicable sector area; 14-location area where mirror nodes can be placed; 15-optimal repair position with mirror node.
Detailed Description
The present invention will be described with reference to the accompanying drawings for describing the technical content, achieved objects and effects of the present invention in detail.
As shown in fig. 1-3, the low-energy-consumption free-space optical network repairing method based on reflection characteristics is implemented by the following steps:
firstly, monitoring the sub-death state of a node according to the existing Heartpoint mechanism and acquiring node information when the free space optical network works. The node information includes node position information, a node communication method, and position information of a node pair that needs to communicate through the node. The node pair refers to a source node and a next hop destination node which need to transmit information through the sub-death node.
And secondly, after the sub-dead nodes die completely, judging the types of the dead nodes according to the communication mode in the acquired node information, wherein the nodes bearing the forwarding tasks are relay nodes, and the nodes not bearing the forwarding tasks are non-relay nodes.
Thirdly, dividing the monitoring area into regular grids, establishing a Neyman-Pearson model according to a Neyman-Pearson judgment criterion, and dividing the coverage state of the grid points into three categories (effective coverage, possible coverage and coverage holes), and the following steps:
when the node dies, the monitoring area is divided into N multiplied by N unit grids, so that (N +1) multiplied by (N +1) unit grid points can be obtained, the grid where the dead node is located and the grids around the dead node are monitored, and a Neyman-Pearson model is established according to a Neyman-Pearson judgment criterion. Obtaining the probability P that the probability target j of the detection of the grid points around the dead node is detected by iijComprises the following steps:
Figure GDA0002903385300000061
in the formula (I), the compound is shown in the specification,
Figure GDA0002903385300000062
a cumulative distribution function that is a standard normal distribution; alpha is the false alarm rate; beta is
Figure GDA0002903385300000063
Sigma is the standard deviation of Gaussian noise; s is the energy of the detection target node, and gamma is a path loss coefficient; rijIs the distance between node i and target j.
When there are k nodes in the region, the joint detection probability of the target j being detected is:
Figure GDA0002903385300000064
calculating the joint detection probability of the death node and each grid point at the periphery according to the formula (2), stopping calculation until the coverage state of the grid points is effective coverage, considering the characteristic of increasing space-time holes in network repair, and setting two threshold values P for the detection probability of each grid pointS1、PS2The coverage state of the kth mesh point may be defined as:
Figure GDA0002903385300000065
if the calculated detection probability is less than PS1Then the grid point is considered as a coverage hole point, and is greater than or equal to PS1Less than PS2Then the grid point is considered to be possibly covered, and is greater than or equal to PS2Then the mesh point is considered to be effectively covered, so that the coverage state of the mesh point is classified into three categories, namely effective coverage, possible coverage and coverage hole.
And fourthly, searching the optimal positions according to the types of the dead nodes and the coverage state of the peripheral grid points, and respectively carrying out classified repair on the dead nodes.
Fifthly, firstly, repairing the non-relay node, and searching the optimal repairing position for repairing by adopting an improved minimum coverage circle repairing method, wherein the steps are as follows:
when the non-relay node dies, according to the coverage states of the grid point where the dead node is located and the surrounding grid points obtained in the third step, obtaining an area formed by the grid points with the coverage states of coverage holes, respectively taking coordinate sets of a longitudinal coordinate maximum edge grid point 1, a transverse coordinate minimum edge grid point 2, a longitudinal coordinate minimum edge grid point 3 and a transverse coordinate maximum edge grid point 4 of n holes generated by each dead node, and sequencing the four edge grid points in a clockwise direction and recording the four edge grid points as U0＝{(x1,y1),(x2,y2),(x3,y3),(x4,y4) Will U0Four edge points are connected to form a quadrangle 5, and an inscribed circle 6 of the quadrangle is made to obtain the center (x) of the inscribed circle of the quadrangleh,yh) And the circle center coordinate is the optimal repair position 7 of the non-relay node, and in order to ensure the maximum coverage, the common node is used as a repair node and placed on the circle center coordinate for optical network repair.
And sixthly, repairing the relay node, wherein the steps are as follows:
q1, calculating a coverage ratio according to the coverage state definition;
obtaining the coverage states of the dead nodes and all grid points around the dead nodes according to the formula (3), and calculating the coverage hole area S before repairing0And possibly covered (possibly empty) areas S1Adding the areas according to different weight proportions to obtain a void value P; calculating the area of the coverage hole after repair as S10And a possible coverage (possible void) area of S11Adding the areas according to different weight proportions to obtain a void value P1The formula is established as follows:
Figure GDA0002903385300000071
Figure GDA0002903385300000072
f＝P1/P (6)
wherein S is0To cover the void area before repair, S1Adding the areas according to different weight proportions to obtain a void value P for possible coverage areas; s10To cover the cavity area after repair, S11Adding the areas according to different weight proportions to obtain a void value P for possible coverage area1And f is a coverage ratio.
Q2, through the free space light energy model, consider the energy model of introducing mirror restoration back, mirror node, concrete step is:
after the nodes die, the communication between a source node and a destination node is interrupted through the communication between the dead nodes, a mirror node is added, the communication between the source node and the destination node is recovered through reflection, the source node only needs to send messages to the mirror node, then the mirror node communicates with the destination node through reflection, the mirror node sends messages sensed by the mirror node to the destination node, the destination node needs to receive data sent by the mirror node and the source node, the communication distances from the source node T to the mirror node M and from the mirror node M to the destination node R are the same, and three-node energy consumption E is obtained according to a free space optical communication energy model:
Figure GDA0002903385300000081
wherein E isTFor source node energy consumption, EMFor mirror nodal energy consumption, EREnergy consumption of destination node, m1Representing the number of bits of the data packets transmitted by the source node, epsilon representing the energy coefficient of the free-space optical wave,
Figure GDA0002903385300000082
is the angle of divergence, l is the communication distance, ETX_PERepresenting the energy consumed by the optoelectronic component transmitting the unit bit data, m2Indicating the number of bits of data packets transmitted by the mirror nodes, ERXIndicating the energy consumed to receive a unit bit of data.
Q3, obtaining all node pairs needing to communicate through death relay nodes according to the node information obtained through monitoring, forming different trilaterals by different node pairs and death nodes when mirror nodes are added for repair, selecting the node pair with the maximum probability capable of reflecting through the death node position, namely the node pair closest to an equilateral triangle, and taking the node pair as the node pair for recovering communication through the mirror nodes.
Q4, establishing a comprehensive evaluation model of covering energy through a covering ratio and an energy model after introducing mirror restoration, then finding a restoration position with a mirror node through the comprehensive evaluation model under the restriction of establishing reflection and restoring a communication area of the communication node through the mirror node, wherein the specific restoration steps are as follows:
according to the information obtained from the node sub-death state, coordinates of two nodes transmitting information with the death node are respectively T (a, b) and R (c, d), and the position (x, y) of the mirror node M meets the reflection condition, then the coordinate relationship of the mirror node M position and the two nodes communicating is as follows:
y＝-(c-a)/(d-b)x+(d2-b2)+(c2-a2)/2(d-b) (8)
if U ═ c-a)/d-b, N ═ d2-b2)+(c2-a2) And/2 (d-b) according to the polygon 8 formed by the cavity around the node when the relay node diesThe position where the non-relay node mode is best covered is the circle center position 9, and the coordinate is (x)h,yh) And the distance r from the mirror node is as follows:
Figure GDA0002903385300000083
from the formula (9), r2And x satisfies a quadratic equation of unity, with the function curve opening upwards at xcoveragebest＝-(UN-xh-Uyh)/(1+U2) Is symmetrical, so x is xcoveragebestWhen r is minimum, r gradually increases as x increases or decreases. While the covered hollow area S10And possibly void area S11The distance r between the center of the covering circle and the center of the mirror is increased and decreased accordingly. I.e. the closer x is to xcoveragebestThe smaller r is, the smaller the covered cavity area S10And possibly void area S11The larger, and therefore the larger, the coverage ratio f.
According to the formula (8), the communication distance l between the mirror node and the node pair needing the mirror node to recover communication is known as follows:
Figure GDA0002903385300000091
as shown in the formula (10), l2X satisfies a quadratic equation of unity, the function curve opens upward, xenergybest＝-(UN-Ub-a)/(1+U2) Time symmetry, x ═ xenergybestWhen the node cannot reflect through the mirror node, so x cannot get- (UN-Ub-a)/(1+ U)2) The closer x is to xenergybestThe smaller l. And the energy consumption E of the node increases with the increase of the transmission distance l, namely the closer x is to xenergybestThe smaller the node energy consumption E.
For a dead relay node, according to the formulas (9) and (10), it can be known that the mirror node position simultaneously affects the coverage ratio f and the node energy consumption E, and the extremization standard is carried out on E and f to (0, 1). The larger the coverage is and the smaller the energy is, the better the mirror node position is, so the comprehensive evaluation model W for coverage energy is established as follows:
Figure GDA0002903385300000092
due to the directionality of free space optical communication, the mirror-equipped repair node not only needs to satisfy the formula (8), that is, on the perpendicular bisector 12 of the line segment formed by the source node T (a, b) and the destination node R (c, d), but also needs to have the source node T in the communicable area with the source node T in the random direction θ and the communicable distance lmaxIf the node M with the mirror meets the requirement that l (T, M) is less than or equal to lmaxAnd with mirror nodes
Figure GDA0002903385300000093
A communicable sector area 13 of the source node T is obtained, a position area 14 where a mirror node can be placed is obtained from the equation (8) and the obtained communicable sector area 13, and in the position area where a mirror node can be placed, a position where W is the maximum, that is, an optimum repair position 15 with a mirror node is found.
Q5, because of the limitation of the communication area of the optical sensor and the number of the sending equipment and the receiving equipment, the node pair which needs to recover communication through the mirror node may have a plurality of pairs, but generally does not exceed three pairs, when the mirror node is added for repair, different node pairs and dead nodes form a trilateral, the node pair which is closest to an equilateral triangle is selected to recover communication through the mirror node, and other nodes which forward messages through the dead relay node look for the normal node which is closest to the dead relay node in the communication area of the dead relay node to be used as the next hop of the dead relay node, so that normal communication is recovered. The method comprises the following steps:
setting other nodes for forwarding messages through dead relay nodes as s, sending messages by the nodes, wherein the messages comprise position information of the nodes, sending the position information of the nodes back to the nodes according to the position information of the nodes when the surrounding nodes are in the communication range of the nodes and receive the messages of the nodes, and adding the position of the nodes in the information packet to the next hop route when the nodes only receive the information packet sent by one node; when a plurality of information packets are received, the distance between the node s and each communicable node is calculated by acquiring the position coordinates of the communicable nodes, the node with the minimum distance is selected, and the node position is added to the next hop route.
The above-mentioned embodiments are merely illustrative of the preferred embodiments of the present invention, and do not limit the scope of the present invention, and various modifications and improvements made to the technical solution of the present invention by those skilled in the art without departing from the spirit of the present invention shall fall within the protection scope defined by the claims of the present invention.

Claims (8)

1.一种基于反射特性的低能耗自由空间光网络修复方法，其特征在于，其包括以下步骤：1. a low energy consumption free space optical network repair method based on reflection characteristics, is characterized in that, it comprises the following steps: 步骤一，在自由空间光网络工作时，根据现有Heartbeat机制监测节点亚死亡状态，获取节点信息；Step 1, when the free space optical network is working, monitor the sub-death state of the node according to the existing Heartbeat mechanism, and obtain the node information; 步骤二，当亚死亡节点彻底死亡后，根据获取的节点信息确定节点的类型，将节点区分为中继型节点和非中继型节点；In step 2, when the sub-dead node completely dies, the type of the node is determined according to the obtained node information, and the node is divided into a relay node and a non-relay node; 步骤三，确定死亡节点所在网格点及周边网格点覆盖状态，Step 3: Determine the coverage state of the grid point where the dead node is located and the surrounding grid points, 将监测区域划分成规则的网格，首先根据Neyman-Pearson判决准则，建立Neyman-Pearson模型,计算死亡节点所在网格点及周边每个网格点的联合探测概率，再为网格点探测概率设定阈值，根据该概率与阈值的比较关系将网格点覆盖状态分为有效覆盖、可能覆盖及覆盖空洞；The monitoring area is divided into regular grids. First, according to the Neyman-Pearson judgment criterion, a Neyman-Pearson model is established, and the joint detection probability of the grid point where the dead node is located and each surrounding grid point is calculated, and then the detection probability of the grid point is calculated. Set a threshold, and divide the coverage status of grid points into effective coverage, possible coverage and coverage holes according to the comparison between the probability and the threshold; 步骤四，根据死亡节点类型及周边网格点覆盖状态，寻找最佳位置分别对死亡节点进行修复；Step 4, according to the type of dead node and the coverage state of surrounding grid points, find the best position to repair the dead node respectively; 对于非中继型的死亡节点，修复过程为：For non-relay dead nodes, the repair process is as follows: S1、根据步骤三得到的死亡节点所在网格点及周围网格点的覆盖状态，分别选取因节点死亡产生的n个空洞网格点的横向坐标、纵向坐标的最大、最小四个边缘网格点的坐标集，并将这四个网格点按顺时针方向排序；S1. According to the coverage state of the grid point where the dead node is located and the surrounding grid points obtained in step 3, select the horizontal coordinates, the maximum and the minimum four edge grids of the n hollow grid points generated by the death of the node respectively. The coordinate set of the points, and the four grid points are sorted clockwise; S2、将四个网格点连接形成四边形，并做出四边形的内切圆；S2. Connect the four grid points to form a quadrilateral, and make the inscribed circle of the quadrilateral; S3、求得内切圆圆心，所得内切圆圆心即为修复的最佳位置；S3. Obtain the center of the inscribed circle, and the center of the obtained inscribed circle is the best position for repair; S4、将普通节点放置在最佳位置上进行光网络修复；S4. Put the common node in the best position to repair the optical network; 对于中继型的死亡节点，修复过程为：For relay-type dead nodes, the repair process is as follows: P1、根据步骤三得到的死亡节点所在网格点及周围网格点的覆盖状态，按不同权重比例，相加计算得到修复前覆盖空洞和可能覆盖的面积之和及修复后覆盖空洞和可能覆盖的面积之和，将二者相比得到覆盖比值；P1. According to the coverage status of the grid point where the dead node is located and the surrounding grid points obtained in step 3, according to different weight ratios, add up and calculate to obtain the sum of the covered voids and possible coverage areas before repair and the covered voids and possible coverage after repair. The sum of the area of the two is compared to obtain the coverage ratio; P2、通过自由空间光能量模型，考虑引入镜子修复后，镜子节点的能量模型；P2. Through the free space light energy model, consider the energy model of the mirror node after the mirror is repaired; P3、选择最大概率可以通过死亡节点位置反射的节点对；P3. Select the node pair whose maximum probability can be reflected by the position of the dead node; P4、通过覆盖比值和引入镜子修复后的镜子节点的能量模型建立覆盖能量综合评价模型；P4. Establish a comprehensive evaluation model of coverage energy by introducing the coverage ratio and the energy model of the mirror node after mirror repair; P5、在反射成立和通过镜子节点恢复通信节点的通信区域的约束下，通过综合评价模型找到带镜子节点的最佳修复位置；P5. Under the constraint that the reflection is established and the communication area of the communication node is restored through the mirror node, the best repair position with the mirror node is found through the comprehensive evaluation model; P6、将带镜子修复节点放置在最佳位置，修复通过带镜子修复节点通信的一对节点对的通信；P6. Place the repaired node with mirror in the best position, and repair the communication of a pair of nodes communicated through the repaired node with mirror; P7、其他通过死亡中继节点转发消息的节点选择离它最近的可通信正常节点恢复通信。P7. Other nodes that forward messages through the dead relay node select the nearest communicable normal node to resume communication. 2.根据权利要求1所述的基于反射特性的低能耗自由空间光网络修复方法，其特征在于，步骤一中所述节点信息包括节点位置、节点通信方式及需要通过该节点通信的节点对的位置信息，所述节点对由源节点和目的节点组成。2. The method for repairing a low-energy free-space optical network based on reflection characteristics according to claim 1, wherein the node information in step 1 includes a node location, a node communication method, and a pair of nodes that need to communicate through the node. Location information, the node pair consists of a source node and a destination node. 3.根据权利要求1所述的基于反射特性的低能耗自由空间光网络修复方法，其特征在于，步骤二中所述中继型节点 在通信中承担转发任务，所述非中继型节点在通信中不承担转发任务。3. The method for repairing a free space optical network with low energy consumption based on reflection characteristics according to claim 1, wherein in step 2, the relay node undertakes the forwarding task in the communication, and the non-relay node is in the Communication does not undertake forwarding tasks. 4.根据权利要求1所述的基于反射特性的低能耗自由空间光网络修复方法，其特征在于，P3步骤中选取节点对的过程为，根据死亡节点信息需要通过镜子节点恢复通信的节点对可能存在多对，不同节点对和死亡节点构成不同的三边形，选择最接近等边三角形的节点对，做为最大概率可以通过死亡节点位置反射的节点对。4. the low energy consumption free space optical network repair method based on reflection characteristic according to claim 1, is characterized in that, the process of choosing node pair in P3 step is, the node pair that needs to restore communication by mirror node according to dead node information is possible. There are multiple pairs, different node pairs and dead nodes form different triangles, and the node pair closest to the equilateral triangle is selected as the node pair with the greatest probability that can be reflected by the position of the dead node. 5.根据权利要求1所述的基于反射特性的低能耗自由空间光网络修复方法，其特征在于，P7步骤中其他通过死亡中继节点转发消息的节点选择离它最近的可通信正常节点恢复通信的具体步骤为：5. The method for repairing a low-energy free space optical network based on reflection characteristics according to claim 1, characterized in that, in step P7, other nodes that forward messages through dead relay nodes select the nearest communicable normal node to resume communication The specific steps are: P61、需恢复通信节点发送消息，其中包含它的位置信息；P61. The message sent by the communication node needs to be restored, which contains its location information; P62、通信范围内的其它节点接收到消息，根据需恢复通信节点的位置信息，发送回自己的位置信息至需恢复通信节点；P62. Other nodes within the communication range receive the message, restore the position information of the communication node as needed, and send back their own position information to the communication node that needs to be restored; P63、需恢复通信节点通过对接收到的信息进行判别，选择距离最小的节点完成恢复通信。P63. The node that needs to restore the communication selects the node with the smallest distance to complete the restoration of communication by judging the received information. 6.根据权利要求1所述的基于反射特性的低能耗自由空间光网络修复方法，其特征在于，P1步骤中覆盖比值的建立公式如下：6. The low-energy free space optical network repair method based on reflection characteristic according to claim 1, is characterized in that, the establishment formula of coverage ratio value in P1 step is as follows:
Figure FDA0002903385290000031
Figure FDA0002903385290000031
Figure FDA0002903385290000032
Figure FDA0002903385290000032
 f＝P1/P (6)f=P 1 /P (6) 其中，S0为修复前覆盖空洞面积，S1为可能覆盖面积，将面积按不同权重比例相加，得到空洞值为P；S10为修复后覆盖空洞面积，S11为可能覆盖面积，将面积按不同权重比例相加，得到空洞值为P1，f为覆盖比值。Among them, S 0 is the covered void area before repair, S 1 is the possible coverage area, and the areas are added according to different weight ratios to obtain the void value P; S 10 is the covered void area after repair, S 11 is the possible coverage area, and the The areas are added according to different weight ratios, and the void value is P 1 , and f is the coverage ratio. 7.根据权利要求1所述的基于反射特性的低能耗自由空间光网络修复方法，其特征在于，P2步骤中引入镜子修复后，镜子节点的能量模型建立如下：7. the low-energy free space optical network repair method based on reflection characteristic according to claim 1, is characterized in that, after introducing mirror repair in P2 step, the energy model of mirror node is established as follows: 根据自由空间光通信能量模型得出三个节点能耗E为：According to the free space optical communication energy model, the energy consumption E of the three nodes is obtained as:
Figure FDA0002903385290000033
Figure FDA0002903385290000033
 其中，ET为源节点能耗，EM为镜子节点能耗，ER为目的节点能耗，m1表示源节点传送数据包的比特数，ε表示自由空间光波的能量系数，
Figure FDA0002903385290000034
为发散角，l为通信距离，ETX_PE表示传输单位比特数据光电子元器件消耗的能量，m2表示镜子节点传送数据包的比特数，ERX表示接收单位比特数据所需要消耗的能量。Among them, ET is the energy consumption of the source node, EM is the energy consumption of the mirror node, ER is the energy consumption of the destination node, m 1 is the number of bits of the data packet transmitted by the source node, ε is the energy coefficient of the free space light wave,
Figure FDA0002903385290000034
is the divergence angle, l is the communication distance, E TX_PE represents the energy consumed by optoelectronic components for transmitting unit bit data, m 2 represents the number of bits of data packets transmitted by the mirror node, and E RX represents the energy required to receive unit bit data. 8.根据权利要求1所述的基于反射特性的低能耗自由空间光网络修复方法，其特征在于，P4步骤中覆盖能量综合评价模型W为：8. the low energy consumption free space optical network repair method based on reflection characteristic according to claim 1, is characterized in that, in P4 step, covering energy comprehensive evaluation model W is:
Figure FDA0002903385290000041
Figure FDA0002903385290000041
 其中，f为覆盖比值；E为节点能耗。Among them, f is the coverage ratio; E is the node energy consumption.
CN202010295021.6A 2020-04-15 2020-04-15 Low-energy-consumption free space optical network restoration method based on reflection characteristics Active CN111541480B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202010295021.6A CN111541480B (en) 2020-04-15 2020-04-15 Low-energy-consumption free space optical network restoration method based on reflection characteristics
JP2021068766A JP7098195B2 (en) 2020-04-15 2021-04-15 How to repair a low energy consumption free space optical network based on reflection characteristics

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010295021.6A CN111541480B (en) 2020-04-15 2020-04-15 Low-energy-consumption free space optical network restoration method based on reflection characteristics

Publications (2)

Publication Number Publication Date
CN111541480A CN111541480A (en) 2020-08-14
CN111541480B true CN111541480B (en) 2021-03-19

Family

ID=71974925

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010295021.6A Active CN111541480B (en) 2020-04-15 2020-04-15 Low-energy-consumption free space optical network restoration method based on reflection characteristics

Country Status (2)

Country Link
JP (1) JP7098195B2 (en)
CN (1) CN111541480B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113950119B (en) * 2021-10-15 2024-03-26 北京通广龙电子科技有限公司 Relay node selection method and device, storage medium and electronic equipment
CN116319221B (en) * 2023-03-21 2025-05-09 珠海中慧微电子有限公司 A method for reducing peak-to-average ratio of OFDM signals based on minimum coverage circle

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101801012A (en) * 2010-01-29 2010-08-11 东南大学 Self-adapting positioning method for mobile nodes of hybrid sensor network
CN103856951A (en) * 2014-01-15 2014-06-11 浙江工业大学 Coverage hole eliminating method based on multi-sensor probability perceptual model
EP3048531A1 (en) * 2015-01-16 2016-07-27 Storagecraft Technology Corporation Virtualizing multiple networked machines using a predetermined network recovery policy
CN107197495A (en) * 2017-01-17 2017-09-22 燕山大学 A kind of Secure Routing Algorithm for Wireless Sensor Networks based on multiple attribute decision making (MADM)
CN108551408A (en) * 2018-07-11 2018-09-18 智强通达科技（北京）有限公司 A kind of ring redundancy network
CN109451519A (en) * 2018-11-13 2019-03-08 井冈山大学 Based on WSN protocol network safety protecting method and system, computer program
CN109640333A (en) * 2018-12-13 2019-04-16 沈阳理工大学 Underwater wireless sensor network covering loophole based on assemblage classification repairs algorithm

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2783190B2 (en) * 1995-06-14 1998-08-06 日本電気株式会社 Infrared communication system
JP2004159032A (en) 2002-11-06 2004-06-03 Communication Research Laboratory Spatial optical communication system
TWI675559B (en) 2014-01-10 2019-10-21 美商八河資本有限公司 Diverged-beam communications apparatus and method

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101801012A (en) * 2010-01-29 2010-08-11 东南大学 Self-adapting positioning method for mobile nodes of hybrid sensor network
CN103856951A (en) * 2014-01-15 2014-06-11 浙江工业大学 Coverage hole eliminating method based on multi-sensor probability perceptual model
EP3048531A1 (en) * 2015-01-16 2016-07-27 Storagecraft Technology Corporation Virtualizing multiple networked machines using a predetermined network recovery policy
CN107197495A (en) * 2017-01-17 2017-09-22 燕山大学 A kind of Secure Routing Algorithm for Wireless Sensor Networks based on multiple attribute decision making (MADM)
CN108551408A (en) * 2018-07-11 2018-09-18 智强通达科技（北京）有限公司 A kind of ring redundancy network
CN109451519A (en) * 2018-11-13 2019-03-08 井冈山大学 Based on WSN protocol network safety protecting method and system, computer program
CN109640333A (en) * 2018-12-13 2019-04-16 沈阳理工大学 Underwater wireless sensor network covering loophole based on assemblage classification repairs algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Emerging Challenges: Mobile Networking for"Smart Dust";JosephM.Kahn,etal.;《JOURNAL OF COMMUNICATIONS AND NETWORKS》;20000930;第188-196页 *
基于能量因素的无线传感器网络关键节点判定算法;刘彬等;《电子与信息学报》;20140715;第1728-1734页 *

Also Published As

Publication number Publication date
JP2021185657A (en) 2021-12-09
JP7098195B2 (en) 2022-07-11
CN111541480A (en) 2020-08-14

Similar Documents

Publication Publication Date Title
US6973039B2 (en) Mechanism for performing energy-based routing in wireless networks
CN111541480B (en) Low-energy-consumption free space optical network restoration method based on reflection characteristics
Liang et al. Relay node placement in wireless sensor networks: From theory to practice
CN113411213B (en) Topology control method and collaborative monitoring method of ad hoc network based on Internet of Things
CN110493797A (en) Wireless sensor network topology control algolithm based on sub-clustering optimization
Hekmat et al. Study of connectivity in wireless ad-hoc networks with an improved radio model
CN114222347B (en) A low-power secure routing control method based on gray correlation and distance analysis
WO2020093904A1 (en) Wireless sensor network fault-tolerant topology evolution method
CN109996310A (en) A kind of cluster head selection method and device
Kar et al. Energy-efficient connectivity re-establishment in WSN in the presence of dumb nodes
Fedorenko et al. Criteria for the deployment of a heterogeneous linear WSN: Operability vs energy efficiency
CN110149233A (en) The method and system of key node is assessed using synoptic diagram and node influence value
CN115087064B (en) A cross-domain high-availability routing method and system for measurement and control communication access network
CN112911585A (en) Method for enhancing survivability of wireless sensor network
CN110932969A (en) A smart grid advanced measurement system AMI network anti-jamming attack routing algorithm
Zhang et al. TEAM: A layered-cooperation topology evolution algorithm for multi-sink Internet of Things
El-Hajj et al. A fuzzy-based hierarchical energy efficient routing protocol for large scale mobile ad hoc networks (feer)
CN104202766B (en) Method and system for selecting detection nodes in wireless sensor network
CN114268921B (en) A method for transmitting burst data in a multi-mobile sink sensor network
Gola et al. Void Node Avoidance in Underwater Acoustic Sensor Network Using Black Widow Optimization Algorithm.
Hu et al. Improved reliability of free-space optical mesh networks through topology design
CN101557629B (en) An Efficient Routing Method Applied to Underground Wireless Network
CN118646473B (en) Node backup method for lunar surface man-machine combined detection network
CN114363850B (en) Method for enhancing survivability based on compactness center of wireless sensor network
CN106385692B (en) An Immune Overlay Method for Immune Multipath Decoupling Fault-Tolerant Transmission

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