CN106788729A - Topology suitable for wireless light sensor network is formed and method for routing - Google Patents

Topology suitable for wireless light sensor network is formed and method for routing Download PDF

Info

Publication number
CN106788729A
CN106788729A CN201710049030.5A CN201710049030A CN106788729A CN 106788729 A CN106788729 A CN 106788729A CN 201710049030 A CN201710049030 A CN 201710049030A CN 106788729 A CN106788729 A CN 106788729A
Authority
CN
China
Prior art keywords
node
leader cluster
energy
cluster node
ordinary
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
CN201710049030.5A
Other languages
Chinese (zh)
Other versions
CN106788729B (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.)
Xidian University
Original Assignee
Xidian 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 Xidian University filed Critical Xidian University
Priority to CN201710049030.5A priority Critical patent/CN106788729B/en
Publication of CN106788729A publication Critical patent/CN106788729A/en
Application granted granted Critical
Publication of CN106788729B publication Critical patent/CN106788729B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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
    • 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
    • H04B10/114—Indoor or close-range type systems
    • H04B10/116—Visible light communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • 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)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention proposes a kind of topology suitable for wireless light sensor network and is formed and method for routing, and for solving, energy loss present in prior art is unbalanced and the short technical problem of network lifetime, realizes that step is：The random number generated according to node elects leader cluster node；By leader cluster node and base station, the information exchange between ordinary node sets up clustering architecture；Leader cluster node converges the data of ordinary node, and is transmitted to base station in the form of single-hop or multi-hop；Leader cluster node monitors the dump energy under its each time slot, is that election of cluster head builds alternate node set next time；Realize wireless light sensor network topology routing characteristic.The present invention optimizes election of cluster head alternate node set based on energy model, balance network energy loss, and introduce many jump mechanism routing mechanisms, overcome node and base station distance limitation problem, network lifetime is improved, can be used for the wireless light communication sensor network being had higher requirements to energy balance and life span.

Description

Topology suitable for wireless light sensor network is formed and method for routing
Technical field
The invention belongs to communication technical field, it is related to a kind of topology of communication network to be formed and method for routing, and in particular to A kind of topology of optic communication wireless sensor network based on energy model is formed and method for routing, can be used for energy balance and The wireless light communication sensor network that life span has higher requirements.
Background technology
FSO (FSO, Free-Space Optical Communication) has bandwidth high, without frequency Rate license, electromagnetism interference, confidentiality advantage high, with low cost.Wireless light sensor network (FSOSN, Free-Space Optical Communication Senior Network) it is to be made up of multiple FSO nodes, met by FSO links many The demand of business transmission.FSOSN not only inherits the advantage of FSO, and combines conventional wireless network (such as Mesh and Ad-Hoc Network) self-organization and the characteristics of independence networking.Meanwhile, FSOSN also have relatively low initial outlay, it is quick for installation, flexibly and The advantages such as scalability.FSOSN can form reliable, data transfer high with traditional wired, the interconnection of wireless and fiber optic network The network architecture of speed, these networks can be applied at collection cloud computing and data and ship, airborne vehicle, satellite and continental rise between In the high speed information system that reason is integrated.At present, the research of FSOSN networkings is also immature, and disclosed corresponding report is equal both at home and abroad It is fewer.It is higher to the requirement of sending and receiving end alignment due to FSOSN requirement line-of-sight transmissions, therefore the networking between FSOSN network nodes It is somewhat limited.Meanwhile, different from conventional wireless network, FSOSN link powers are limited and influenceed by atmospheric channel, Receiving terminal can reduce signal power, therefore communication distance has certain limitation, and then influence the extension of network size and network Property.In terms of military use, each network node is very important, the failure of certain node for director under battlefield surroundings The drastically decline of network connectivty may be caused；At civilian aspect, such as fire balloon, the meagrely-populated ring without sufficient supply of electric power Under border, each node should consider communication quality, and node energy loss is considered again, and the existence of network node is extended to greatest extent Time.Therefore, during the networking technology in traditional Mesh, Ad-hoc can not indiscriminately imitate FSOSN.Reasonable effective network topology knot Structure and good routing algorithm can to greatest extent make up the defect that FSOSN individual event link properties bring, while to communication system The existence of the performance and whole network of uniting also has significant impact.
For the requirement of FSOSN horizon communications, current solution mainly has following three class：(1) it is using receiving and dispatching FSO more System, expands the communication coverage of each node, improves the connected ratio of network node, in physical layer reduction FSO one way links Influence to networking quality；(2) FSO is combined with RF, is constituted the network of mixing, by hierarchical control, small scale network is used RF, network trunk uses FSO；(3) from route and network topology angle analysis, there are following two resolving ideas at present：One is to adopt With the Routing Protocol for being capable of employing wireless sensor network；Two is the specific hierachical network topology structure of setting, the function of node Determine before network foundation, by distinguishing ordinary node and leader cluster node, implementation level communication, on this basis, using specific Routing algorithm find neighbor node and base station, set up link, such as Asaduzzaman et al. is in " Energy efficient cooperative LEACH protocol for wireless sensor networks”(Jounal of Communications and Networks, Vol.12, No.4, Aug.2010.) on the Leach improved protocols mentioned.The association , based on single-hop form, when leader cluster node is nearer away from base station distance, network lifetime is higher for the routing selecting mode of view. But if in the presence of some leader cluster nodes position with respect to base station farther out when, these leader cluster nodes in communication process will produce it is very big Energy loss, causing the life span of leader cluster node reduces；If the distance of nodal distance base station exceedes system communication distance The upper limit, the agreement will no longer be suitable for such case, therefore these nodes will be isolated, it is impossible to is set up with base station and communicated.
The content of the invention
One kind it is an object of the invention to overcome above-mentioned the deficiencies in the prior art, proposition is applied to wireless light sensor net The topology of network is formed and method for routing, and for solving, energy loss present in prior art is unbalanced and network lifetime is short Technical problem.
To achieve the above object, the technical scheme that the present invention takes comprises the following steps：
(1) each node in wireless light sensor network finds algorithm using neighbours, finds the neighbor node of itself, and The neighbor node that will be found is stored into neighbours' routing table；
(2) election threshold value T (n) of wireless light sensor network cluster head node is calculated：
Wherein, p is the desired percentage of leader cluster node, and r is the current wheel number for performing, and G is alternate node set；
(3) each node in wireless light sensor network generates the random number between 0 to 1 at random, and will be than cluster head section The small corresponding node of random number of point election threshold value T (n) is used as leader cluster node；
(4) each leader cluster node is by the message comprising self information, according to neighbours' routing table to its different neighbor node Broadcast, wherein message package numbering ID and position P containing leader cluster nodei(Xi,Yi), the set CH of other leader cluster node numberings IDi、 The set CHD of distance between leader cluster node and other leader cluster nodesi, leader cluster node dump energy E1And leader cluster node and base station The distance between CHBi；
(5) when the neighbor node of leader cluster node is leader cluster node, the leader cluster node that neighbor node will be received in message is compiled Number ID is added to the set CH of the neighbor nodeiIn, and it is calculated the distance between with the leader cluster node received in message, then will Distance value is added to the set CHD of the neighbor nodeiIn；
(6) when the neighbor node of leader cluster node is ordinary node, whether there is in neighbor node inspection routing table and receive The minimum hop count of leader cluster node in message, if so, the minimum hop count is set to alternative path parameter, otherwise, then by disappearing for receiving Breath is added to shortest path parameter, and stores in the routing table of the ordinary node；
(7) ordinary node sends request message to the leader cluster node nearest apart from itself, and is added in leader cluster node, real The foundation of existing wireless light sensor network clustering architecture；
(8) leader cluster node in each clustering architecture using one jump or multi-hop in the form of, by the message comprising self information It is sent to base station；
(9) Message Record of each leader cluster node that base station will receive is in the routing table of base station, and is selected from the routing table Go out the distance between each leader cluster node and base station CHBiMinimum value, and the corresponding leader cluster node of minimum value that will be selected as its The next-hop cluster head node of transmission information；
(10) the next-hop cluster head node of base station select its distance between with other leader cluster nodes CHBiMinimum value, and Next-hop cluster head node of the corresponding leader cluster node of minimum value that will be selected as its transmission information；
(11) according to step (10), all leader cluster nodes are traveled through successively, reached until all leader cluster nodes can get The optimal path of base station；
(12) all ordinary nodes in the clustering architecture of wireless light sensor network in each cluster, according to its leader cluster node point The tdma slot of group, transmits data to corresponding leader cluster node；
(13) optimal path that each leader cluster node is obtained according to step (11), by the data is activation of ordinary node to base Stand；
(14) according to the energy theorem E of radio energy model inference leader cluster node1：
Wherein E1Represent the dump energy of leader cluster node, E0Represent The primary power of leader cluster node, n represents the number of clustering architecture inside ordinary node, ETX_PE(mi) represent i-th ordinary node in The energy that opto-electronic device is consumed, miRepresent that i-th ordinary node sends out the bit number of data, ε represents free space energy Coefficient,Represent ordinary node laser scanning angle, diRepresent distance of i-th ordinary node away from leader cluster node, ERRepresent common Node receives the energy consumed per bit data；
(15) the threshold value E of wireless light sensor network cluster head node energy is setth, each leader cluster node is according to deriving Energy theorem E1, self rest energy under its each time slot is stored into own node, work as E1Threshold value E of the value less than energyth When, the leader cluster node is rejected from alternate node set G, realize the topology characteristic of wireless light sensor network.
The present invention compared with prior art, with advantages below：
Firstth, the present invention goes out leader cluster node dump energy formula E according to radio energy model inference1, it is public using energy Formula E1Optimize election of cluster head alternate node set, it is to avoid dump energy is less than the leader cluster node of energy threshold in cluster head next time It is elected to leader cluster node in election again, compared with prior art, effectively balances the energy of FSOSN leader cluster nodes, extends Network lifetime.
Secondth, the present invention is by having found neighbor node, generation clustering architecture, using multiples such as multi-hop mode transmission node data Step, forms a kind of topology method suitable for wireless light sensor network, compared with prior art, effectively solves section The point problem limited with the communication distance of base station, further increases the life span of whole network.
Brief description of the drawings
Fig. 1 realizes FB(flow block) for of the invention；
Fig. 2 is the topology controlment figure of the embodiment of the present invention；
Fig. 3 is the death nodes number and wheel number relation simulation comparison figure of the present invention and prior art；
Fig. 4 is the dump energy summation and wheel number relation simulation comparison figure of the present invention and prior art leader cluster node.
Specific embodiment
With reference to the accompanying drawings and examples, the present invention is described in further detail：
Reference picture 1, the present invention comprises the following steps：
Step 1：Each node in wireless light sensor network safeguards neighbours' routing table, and is found using neighbours Algorithm, the neighbor node of its own is found by generating laser, and the numbering ID of the neighbor node that will be found is stored into its neighbour In occupying routing table；
Step 2：Calculate election threshold value T (n) of wireless light sensor network cluster head node：
Wherein, p is the desired percentage of leader cluster node, and r is the current wheel number for performing, and G is alternative node set；
Step 3：Each node in wireless light sensor network generates the random number between 0 to 1 at random, and will compare cluster head Node elects the small corresponding node of random number of threshold value T (n) as leader cluster node.
The generation of leader cluster node has certain randomness, and its election process is periodically carried out, it is ensured that leader cluster node is not Disconnected rotation, eliminates those dump energies E1Less than leader cluster node energy threshold EthNode, balance network Energy distribution, extend net Network life span.
Step 4：Each leader cluster node saves the message comprising self information according to neighbours' routing table to its different neighbour Point broadcast, wherein numbering ID and position P of the message package containing leader cluster nodei(Xi,Yi), the set of other leader cluster node numberings ID CHi, between leader cluster node and other leader cluster nodes distance set CHDi, leader cluster node dump energy E1And leader cluster node with The distance between base station CHBi；
Step 5：When the neighbor node of leader cluster node is leader cluster node, neighbor node will receive the leader cluster node in message Numbering ID is added to the set CH of the neighbor nodeiIn, and it is calculated the distance between with the leader cluster node received in message, then Distance value is added to the set CHD of the neighbor nodeiIn；
Step 6：When the neighbor node of leader cluster node is ordinary node, neighbor node whether there is receipts in checking routing table The minimum hop count of leader cluster node in message, if so, the minimum hop count is set into alternative path parameter, otherwise, then will receive Message is added to shortest path parameter, and stores in the routing table of the ordinary node；
Step 7：Ordinary node sends request message to the leader cluster node nearest apart from itself, and is added to leader cluster node In.
Because the leader cluster node for accessing is the leader cluster node nearest apart from ordinary node, therefore energy can be saved and subtracted Cluster head and the data volume needed for ordinary node are connected less, while ordinary node can be by choosing shortest path, in other clusters Ordinary node sets up connection；
Step 8：Leader cluster node in each clustering architecture using one jump or multi-hop in the form of, by disappearing comprising self information Breath is sent to base station.
In the prior art, when node and base station are apart from each other, it is possible to cause node to isolate, it is impossible to set up logical with base station Letter.There is a problem of of many jump mechanisms solves above-mentioned isolated node first, improves the Rong Kuohang of network, secondly when node with When optimal path is interrupted before base station, it is allowed to adapt dynamically to link failure, other alternative roads can be in the routing table enabled Footpath, improves the robustness of network.
Step 9：The Message Record of each leader cluster node that base station will receive in the routing table of base station, and from the routing table Select the distance between each leader cluster node and base station CHBiMinimum value, and the corresponding leader cluster node of minimum value that will be selected as The next-hop cluster head node of its transmission information；
Step 10：The next-hop cluster head node of base station select its distance between with other leader cluster nodes CHBiMinimum Value, and the corresponding leader cluster node of minimum value that will be selected is used as the next-hop cluster head node of its transmission information；
Step 11：According to step step 10, all leader cluster nodes are traveled through successively, until all leader cluster nodes can be obtained Reach the optimal path of base station；
Step 12：All ordinary nodes in the clustering architecture of wireless light sensor network in each cluster, according to its cluster head section The tdma slot that point is assigned, transmits data to corresponding leader cluster node.
Wireless light sensor network uses generating laser due to each node, and the launch angle of generating laser is very It is small, therefore there is limitation in an access degree for clustering architecture, in order to solve the above problems, in the clustering architecture of wireless light sensor network Leader cluster node in netinit, can be its cluster in all ordinary nodes distribution tdma slot.In data transfer phase The tdma slot that ordinary node in each clustering architecture was distributed before, transmits data to corresponding leader cluster node, cluster Head node is merged to the data for receiving, and after data transfer phase continues a period of time, starts to perform new round cluster knot Process is configured to, is moved in circles.Multi-user's transmitting-receiving that this scheme can be solved effectively in same transceiver coverage is asked Topic, when accessing user is excessive, leader cluster node only needs to the proper communication that distribution correspondence time slot ensures that all users；
Step 13：The optimal path that each leader cluster node is obtained according to step 11, by the data is activation of ordinary node to base Stand；
Step 14：According to the energy theorem E of radio energy model inference leader cluster node1：
Wherein E1Represent the dump energy of leader cluster node, E0Represent The primary power of leader cluster node, n represents the number of clustering architecture inside ordinary node, ETX_PE(mi) represent i-th ordinary node in The energy that opto-electronic device is consumed, miRepresent that i-th ordinary node sends out the bit number of data, ε represents free space energy Coefficient,Represent ordinary node laser scanning angle, diRepresent distance of i-th ordinary node away from leader cluster node, ERRepresent common Node receives the energy consumed per bit data；
The dump energy E of the leader cluster node described in step 141Formulation process is as follows：
Step 14a：Using radio energy model E=kdn, wherein k represents radio energy model constants, as n=2 Calculate the energy loss E that leader cluster node launches dataPX：
Wherein, m represents transmission bit number, and ε represents free space energy coefficient, that is, transmits the energy being lost per bit data Amount,Laser scanning angle is represented, d represents transmission range；
Step 14b：Leader cluster node statistics receives the total number of bits m of ordinary node transmission, and calculates its corresponding receiver Energy loss ERX：
ERX=mER
Wherein, ERRepresent the energy for receiving and being lost per bit data；
Step 14c：Launch the energy loss E of data according to leader cluster nodePXThe energy loss of receiver corresponding with its ERX, calculate the rate of Energy Loss E of leader cluster nodeTX：
Wherein,Gross energy needed for representing sensor node transmission data, ETX_PEM () represents includes compiling The energy of the opto-electronic device loss such as propagation of code, modulation, filtering, and signal；
Step 14d：Ordinary node number n inside leader cluster node statistics clustering architecture, and calculate the residue of the leader cluster node ENERGY E1：
Wherein, E0Represent the primary power of leader cluster node.
Step 15：The threshold value E of wireless light sensor network cluster head node energy is setth, each leader cluster node is according to derivation The energy theorem E for going out1, self rest energy under its each time slot is stored into own node, work as E1Threshold value of the value less than energy EthWhen, the leader cluster node is never elected to rejecting in cluster head set G, realize the topology characteristic of wireless light sensor network.
Using leader cluster node dump energy E1With linear light sensor network energy threshold value EthBetween optimized relation next time The alternate node set G of election of cluster head, so as to the leader cluster node for avoiding those dump energies low continues to work as in elect next time Leader cluster node is selected, to realize balancing the purpose of network Energy distribution, effectively extends network lifetime.
Reference picture 2, the topological structure of the wireless light sensor network of structure, wireless light sensor network is divided into 3 clusters Structure, dark node represents leader cluster node in each clustering architecture, and grayed-out nodes represent ordinary node.In FSOSN in clustering architecture C2 Source node S 1, established with the destination node D in clustering architecture C3 by leader cluster node H2 and H3 and communicated；It is another in clustering architecture C2 One source node S 2 is then set up with base station by leader cluster node H2 and H1 and communicated；If base station has the message to need to be sent to network section Point, then base station first with corresponding leader cluster node set up communicate, corresponding destination node is relayed to by leader cluster node.
Below in conjunction with emulation experiment, technique effect of the invention is described in further detail：
1. simulated conditions and content：
Wireless light sensor network node sum 50, leader cluster node expects that percentage p is 0.2, and node is randomly dispersed in 1000 × 1000 region, node primary power is 0.5J, data packet length 4000bit, opto-electronic device consumed energy ETX_PE It is 4pJ/bit, receives energy loss 60pJ/bit, energy coefficient ε is 4pJ/bit/m2, laser scanning angleIt is 2 π/3.Emulation Content includes death nodes number and the relation and leader cluster node dump energy summation of wheel number and the relation of wheel number, and its result is such as Shown in Fig. 3 and Fig. 4.
2. analysis of simulation result：
Reference picture 3, since 40 take turns, the node death nodes number of OEEMRP algorithms is less than Leach innovatory algorithms, and As wheel number increases, this trend gradually increases.
Reference picture 3, the leader cluster node dump energy of OEEMRP algorithms apparently higher than Leach innovatory algorithms, and with wheel Number increases, and this trend gradually increases.
From Fig. 3 and Fig. 4, the relative Leach innovatory algorithms of the present invention, can effectively balanced leader cluster node energy point Cloth, extends the life span of network.

Claims (2)

1. a kind of topology method of the wireless light sensor network based on energy model, it is characterised in that including following step Suddenly：
(1) each node in wireless light sensor network finds algorithm using neighbours, finds the neighbor node of itself, and will look for To neighbor node be stored into neighbours' routing table；
(2) election threshold value T (n) of wireless light sensor network cluster head node is calculated：
T ( n ) = p 1 - p × ( r mod 1 p ) i f n ∈ G 0 o t h e r w i s e
Wherein, p is the desired percentage of leader cluster node, and r is the current wheel number for performing, and G is alternate node set；
(3) each node in wireless light sensor network generates the random number between 0 to 1 at random, and will be selected than leader cluster node The small corresponding node of random number of threshold value T (n) is lifted as leader cluster node；
(4) each leader cluster node broadcasts the message comprising self information according to neighbours' routing table to its different neighbor node, Wherein numbering ID and position P of the message package containing leader cluster nodei(Xi,Yi), the set CH of other leader cluster node numberings IDi, cluster head section The set CHD of distance between point and other leader cluster nodesi, leader cluster node dump energy E1And between leader cluster node and base station Apart from CHBi；
(5) when the neighbor node of leader cluster node is leader cluster node, neighbor node will receive the leader cluster node numbering ID in message It is added to the set CH of the neighbor nodeiIn, and it is calculated the distance between with the leader cluster node received in message, then by distance Value is added to the set CHD of the neighbor nodeiIn；
(6) when the neighbor node of leader cluster node is ordinary node, whether there is in neighbor node inspection routing table and receive message The minimum hop count of middle leader cluster node, if so, the minimum hop count is set into alternative path parameter, otherwise, then the message that will be received adds Shortest path parameter is added as, and is stored in the routing table of the ordinary node；
(7) ordinary node sends request message to the leader cluster node nearest apart from itself, and is added in leader cluster node, realizes nothing The foundation of linear light sensor network clustering architecture；
(8) leader cluster node in each clustering architecture is sent the message comprising self information in the form of a jump or multi-hop To base station；
(9) Message Record of each leader cluster node that base station will receive is in the routing table of base station, and is selected from the routing table each The distance between leader cluster node and base station CHBiMinimum value, and the corresponding leader cluster node of minimum value that will be selected as its transmit The next-hop cluster head node of information；
(10) the next-hop cluster head node of base station select its distance between with other leader cluster nodes CHBiMinimum value, and will choosing The corresponding leader cluster node of minimum value for going out as its transmission information next-hop cluster head node；
(11) according to step (10), all leader cluster nodes are traveled through successively, until all leader cluster nodes can be got up to base station Optimal path；
(12) all ordinary nodes in the clustering architecture of wireless light sensor network in each cluster, assign according to its leader cluster node Tdma slot, transmits data to corresponding leader cluster node；
(13) optimal path that each leader cluster node is obtained according to step (11), by the data is activation of ordinary node to base station；
(14) according to the energy theorem E of radio energy model inference leader cluster node1： Wherein E1Represent the dump energy of leader cluster node, E0The primary power of leader cluster node is represented, n represents clustering architecture inside ordinary node Number, ETX_PE(mi) represent the energy that is consumed of opto-electronic device, m in i-th ordinary nodeiRepresent i-th ordinary node The bit number of sent out data, ε represents free space energy coefficient,Represent ordinary node laser scanning angle, diRepresent i-th Distance of the ordinary node away from leader cluster node, ERRepresent that ordinary node receives the energy consumed per bit data；
(15) the threshold value E of wireless light sensor network cluster head node energy is setth, each leader cluster node is according to the energy derived Formula E1, self rest energy under its each time slot is stored into own node, work as E1Threshold value E of the value less than energythWhen, will The leader cluster node is rejected from alternate node set G, realizes the topology characteristic of wireless light sensor network.
2. the topology of the wireless light sensor network based on energy model according to claim 1 is formed and method for routing, It is characterized in that：The energy theorem E of the derivation leader cluster node described in step (14)1, realize that step is：
(14a) is using radio energy model E=kdn, wherein k represents radio energy model constants, cluster head calculated as n=2 Node launches the energy loss E of dataPX：
Wherein, m represents transmission bit number, and ε represents free space energy coefficient, that is, transmits the energy being lost per bit data, Laser scanning angle is represented, d represents transmission range；
(14b) leader cluster node statistics receives the total number of bits m of ordinary node transmission, and calculates the energy damage of its corresponding receiver Consumption ERX：
ERX=mER
Wherein, ERRepresent the energy for receiving and being lost per bit data；
(14c) launches the energy loss E of data according to leader cluster nodePXThe energy loss E of receiver corresponding with itsRX, calculate cluster The rate of Energy Loss E of head nodeTX：
Wherein,Gross energy needed for representing sensor node transmission data, ETX_PEM () represents includes photoelectron device The loss of energy of part coding, modulation, filtering and the propagation of signal；
Ordinary node number n inside (14d) leader cluster node statistics clustering architecture, and calculate the dump energy E of the leader cluster node1：
Wherein, E0Represent the primary power of leader cluster node.
CN201710049030.5A 2017-01-23 2017-01-23 Topology suitable for wireless light sensor network is formed and method for routing Active CN106788729B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710049030.5A CN106788729B (en) 2017-01-23 2017-01-23 Topology suitable for wireless light sensor network is formed and method for routing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710049030.5A CN106788729B (en) 2017-01-23 2017-01-23 Topology suitable for wireless light sensor network is formed and method for routing

Publications (2)

Publication Number Publication Date
CN106788729A true CN106788729A (en) 2017-05-31
CN106788729B CN106788729B (en) 2019-04-23

Family

ID=58941424

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710049030.5A Active CN106788729B (en) 2017-01-23 2017-01-23 Topology suitable for wireless light sensor network is formed and method for routing

Country Status (1)

Country Link
CN (1) CN106788729B (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107770833A (en) * 2017-10-27 2018-03-06 上海感悟通信科技有限公司 Radio self-organized network nodes device and its communication means and network-building method and medium
CN108449776A (en) * 2018-02-27 2018-08-24 深圳市海司恩科技有限公司 Network path planing method, node device and computer storage media
CN108495257A (en) * 2018-03-16 2018-09-04 西安电子科技大学 Mobile node switching method based on dynamic decision thresholding in wireless OCDMA
CN109302424A (en) * 2018-11-27 2019-02-01 中国人民解放军战略支援部队信息工程大学 Sensor network cluster head monitors that node secret selects agreement
CN109661013A (en) * 2019-02-28 2019-04-19 中国联合网络通信集团有限公司 A kind of method for message transmission and system
CN111356203A (en) * 2020-03-10 2020-06-30 西安电子科技大学 Three-dimensional wireless optical sensor network routing method based on clustering
CN111356039A (en) * 2020-03-09 2020-06-30 西安电子科技大学 Topology forming method for wireless optical communication network
CN111526555A (en) * 2020-05-25 2020-08-11 南京邮电大学 Multi-hop routing path selection method based on genetic algorithm
CN112105072A (en) * 2020-10-21 2020-12-18 国网思极紫光(青岛)微电子科技有限公司 Internet of things communication system and construction method thereof
CN112218309A (en) * 2019-07-11 2021-01-12 阿里巴巴集团控股有限公司 Method and device for controlling self-organizing network and determining network management node
CN114025404A (en) * 2021-11-08 2022-02-08 中国核动力研究设计院 Wireless sensor network routing protocol method, wireless sensor and storage medium
CN115051758A (en) * 2022-06-08 2022-09-13 大连理工大学 Reliable data transmission method for underwater wireless optical sensor network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102448139A (en) * 2011-12-28 2012-05-09 南昌大学 Hierarchical routing method for wireless sensor network
US20150172391A1 (en) * 2013-12-16 2015-06-18 Nokia Corporation Method, apparatus, and computer program product for network discovery
CN105376806A (en) * 2015-12-08 2016-03-02 上海应用技术学院 Cluster-based routing method based on maximum energy path selection in multipath

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102448139A (en) * 2011-12-28 2012-05-09 南昌大学 Hierarchical routing method for wireless sensor network
US20150172391A1 (en) * 2013-12-16 2015-06-18 Nokia Corporation Method, apparatus, and computer program product for network discovery
CN105376806A (en) * 2015-12-08 2016-03-02 上海应用技术学院 Cluster-based routing method based on maximum energy path selection in multipath

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107770833A (en) * 2017-10-27 2018-03-06 上海感悟通信科技有限公司 Radio self-organized network nodes device and its communication means and network-building method and medium
CN107770833B (en) * 2017-10-27 2020-10-27 上海感悟通信科技有限公司 Networking method and medium for wireless self-organizing network system
CN108449776A (en) * 2018-02-27 2018-08-24 深圳市海司恩科技有限公司 Network path planing method, node device and computer storage media
CN108449776B (en) * 2018-02-27 2023-09-05 深圳市亚特联科技有限公司 Network path planning method, node equipment and computer storage medium
CN108495257A (en) * 2018-03-16 2018-09-04 西安电子科技大学 Mobile node switching method based on dynamic decision thresholding in wireless OCDMA
CN108495257B (en) * 2018-03-16 2020-04-07 西安电子科技大学 Mobile node switching method based on dynamic decision threshold in wireless optical network
CN109302424B (en) * 2018-11-27 2021-05-25 中国人民解放军战略支援部队信息工程大学 Sensor network cluster head monitoring node secret selection protocol
CN109302424A (en) * 2018-11-27 2019-02-01 中国人民解放军战略支援部队信息工程大学 Sensor network cluster head monitors that node secret selects agreement
CN109661013A (en) * 2019-02-28 2019-04-19 中国联合网络通信集团有限公司 A kind of method for message transmission and system
CN112218309A (en) * 2019-07-11 2021-01-12 阿里巴巴集团控股有限公司 Method and device for controlling self-organizing network and determining network management node
CN111356039A (en) * 2020-03-09 2020-06-30 西安电子科技大学 Topology forming method for wireless optical communication network
CN111356039B (en) * 2020-03-09 2021-07-27 西安电子科技大学 Topology forming method for wireless optical communication network
CN111356203B (en) * 2020-03-10 2022-04-19 西安电子科技大学 Three-dimensional wireless optical sensor network routing method based on clustering
CN111356203A (en) * 2020-03-10 2020-06-30 西安电子科技大学 Three-dimensional wireless optical sensor network routing method based on clustering
CN111526555A (en) * 2020-05-25 2020-08-11 南京邮电大学 Multi-hop routing path selection method based on genetic algorithm
CN111526555B (en) * 2020-05-25 2022-07-26 南京邮电大学 Multi-hop routing path selection method based on genetic algorithm
CN112105072A (en) * 2020-10-21 2020-12-18 国网思极紫光(青岛)微电子科技有限公司 Internet of things communication system and construction method thereof
CN112105072B (en) * 2020-10-21 2023-02-24 国网思极紫光(青岛)微电子科技有限公司 Internet of things communication system and construction method thereof
CN114025404A (en) * 2021-11-08 2022-02-08 中国核动力研究设计院 Wireless sensor network routing protocol method, wireless sensor and storage medium
CN114025404B (en) * 2021-11-08 2024-01-23 中国核动力研究设计院 Wireless sensor network routing protocol method, wireless sensor and storage medium
CN115051758A (en) * 2022-06-08 2022-09-13 大连理工大学 Reliable data transmission method for underwater wireless optical sensor network
CN115051758B (en) * 2022-06-08 2023-12-22 大连理工大学 Reliable data transmission method for underwater wireless optical sensor network

Also Published As

Publication number Publication date
CN106788729B (en) 2019-04-23

Similar Documents

Publication Publication Date Title
CN106788729A (en) Topology suitable for wireless light sensor network is formed and method for routing
Shaikh et al. Routing in multi-hop cellular device-to-device (D2D) networks: A survey
Villasenor-Gonzalez et al. HOLSR: a hierarchical proactive routing mechanism for mobile ad hoc networks
Kaufman et al. Cellular networks with an overlaid device to device network
Sheng et al. Cooperative wireless networks: from radio to network protocol designs
Mansourkiaie et al. Cooperative routing in wireless networks: A comprehensive survey
Liang et al. Cooperative communications with relay selection for wireless networks: design issues and applications
CN102857988B (en) Realization method of routing in accordance with requirements in cognitive wireless Ad Hoc network
CN101690026A (en) Multi-criteria optimization for relaying in multi-hop wireless ad hoc and sensor networks
CN103118412A (en) Trust-based on-demand multipath vector routing algorithm of Ad Hoc network
He et al. On link scheduling in dual-hop 60-GHz mmwave networks
Aryafar et al. Distance-1 constrained channel assignment in single radio wireless mesh networks
Sankar et al. Energy and load aware routing protocol for internet of things
Wang et al. Sub-channel allocation for device-to-device underlaying full-duplex mmWave small cells using coalition formation games
Melki et al. Radio resource management scheme and outage analysis for network-assisted multi-hop D2D communications
Cao et al. Interference-aware multi-user relay selection scheme in cooperative relay networks
He et al. A decomposition principle for link and relay selection in dual-hop 60 GHz networks
Pal et al. JRCA: A joint routing and channel assignment scheme for wireless mesh networks
Basak et al. Spectrum-aware outage minimizing cooperative routing in cognitive radio sensor networks
CN101448296B (en) Distributed network topology control method and node thereof
Guo et al. Secure minimum-energy multicast tree based on trust mechanism for cognitive radio networks
Arivudainambi et al. Heuristic approach for broadcast scheduling, problem in wireless mesh networks
Gkatzikis et al. Low complexity algorithms for relay selection and power control in interference-limited environments
Qadir et al. Localized minimum-latency broadcasting in multi-radio multi-rate wireless mesh networks
Gopi et al. Energy optimized path unaware layered routing protocol for underwater sensor networks

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