CN106788729B - 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 PDFInfo
- Publication number
- CN106788729B CN106788729B CN201710049030.5A CN201710049030A CN106788729B CN 106788729 B CN106788729 B CN 106788729B CN 201710049030 A CN201710049030 A CN 201710049030A CN 106788729 B CN106788729 B CN 106788729B
- Authority
- CN
- China
- Prior art keywords
- node
- leader cluster
- energy
- cluster node
- leader
- 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
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 invention proposes a kind of topology formation suitable for wireless light sensor network and method for routing, energy loss existing in the prior art is unbalanced and the short technical problem of network lifetime for solving, and realizes step are as follows: elect leader cluster node according to the random number that node generates；By leader cluster node and base station, information exchange between ordinary node establishes 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, constructs alternate node set for election of cluster head next time；Realize wireless light sensor network topology routing characteristic.The present invention is based on energy models to optimize election of cluster head alternate node set, balance network energy loss, and introduce multi-hop mechanism routing mechanism, overcome node and base station distance limitation problem, network lifetime is improved, can be used for the wireless light communication sensor network having higher requirements to energy balance and life span.
Description
Technical field
The invention belongs to fields of communication technology, and the topology for being related to a kind of communication network is formed and method for routing, and in particular to
A kind of topology of the 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 technique
Free space optical communication (FSO, Free-Space Optical Communication) has bandwidth high, without frequency
Rate license, electromagnetism interference, confidentiality is high, advantage low in cost.Wireless light sensor network (FSOSN, Free-Space
Optical Communication Senior Network) it is to be made of multiple FSO nodes, met by FSO link more
The demand of business transmission.FSOSN not only inherits the advantage of FSO, but also combines conventional wireless network (such as Mesh and Ad-Hoc
Network) self-organization and the characteristics of independence networking.Meanwhile FSOSN also has lower initial outlay, it is quick for installation, flexibly and
The advantages such as scalability.FSOSN can be interconnected with traditional wired, wireless and fiber optic network, form reliable, high data transmission
The network architecture of rate, these networks can be applied at collection cloud computing and data between ship, aircraft, satellite and continental rise
It manages in the high speed information system being integrated.Currently, the research of FSOSN networking is also immature, disclosed corresponding report is equal both at home and abroad
It is fewer.It is more demanding to sending and receiving end alignment since FSOSN requires line-of-sight transmission, therefore the networking between FSOSN network node
It is somewhat limited.Meanwhile being different from conventional wireless network, FSOSN link power is limited and is influenced by atmospheric channel,
Receiving end can reduce signal power, therefore communication distance has certain limitation, and then influences the extension of network size and network
Property.In terms of military use, each network node is very important director under battlefield surroundings, the failure of some node
It may cause the sharply decline of network connectivty；At civilian aspect, such as fire balloon, the meagrely-populated ring without sufficient power supply
Under border, each node should consider communication quality, consider node energy loss again, extend the existence of network node to greatest extent
Time.Therefore, the networking technology in traditional Mesh, Ad-hoc cannot be indiscriminately imitated in FSOSN.Rationally effective network topology knot
Structure and good routing algorithm can make up FSOSN individual event link property bring defect to greatest extent, while to communication system
The existence of system performance and whole network also has significant impact.
For the requirement of FSOSN horizon communication, solution mainly has following three classes at present: (1) more being received and dispatched using FSO and be
System, expands the communication coverage of each node, improves the connected ratio of network node, reduces FSO one way link in physical layer
Influence to networking quality；(2) by FSO in conjunction with RF, the network of mixing is formed, by hierarchical control, small scale network is used
RF, network trunk use FSO；(3) from routing and network topology angle analysis, there is following two resolving ideas at present: first is that adopting
With the Routing Protocol that can apply wireless sensor network；Second is that setting specific hierachical network topology structure, the function of node
It is determined before network is established, by distinguishing ordinary node and leader cluster node, implementation level communication, on this basis, use is specific
Routing algorithm discovery neighbor node and base station, establish link, such as Asaduzzaman et al. 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 protocol mentioned.The association
The routing selecting mode of view is based on single-hop form, and when leader cluster node is closer away from base station distance, network lifetime is higher.
But if there are the positions of some leader cluster nodes farther out with respect to base station, these leader cluster nodes will generate very big in communication process
Energy loss, cause the life span of leader cluster node to reduce；If the distance of nodal distance base station is more than system communication distance
The upper limit, which will no longer be suitable for such case, therefore these nodes will be isolated, and can not establish and communicate with base station.
Summary of the invention
It is an object of the invention to overcome above-mentioned the deficiencies in the prior art, one kind of proposition is suitable for wireless light sensor net
The topology of network is formed and method for routing, and for solving, energy loss existing in the prior art is unbalanced and network lifetime is short
The technical issues of.
To achieve the above object, the technical solution that the present invention takes includes 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 found is stored into neighbours' routing table；
(2) the 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 currently performed wheel number, 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 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 includes the number ID and position P of leader cluster nodei(Xi,Yi), the set CH of other leader cluster node number 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, neighbor node compiles the leader cluster node received in message
Number ID is added to the set CH of the neighbor nodeiIn, and calculate it and the distance between the leader cluster node that receives 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, neighbor node is checked to whether there is in routing table and be received
Otherwise the minimum hop count of leader cluster node in message, then disappears if so, the minimum hop count is set as alternative path parameter by what is received
Breath is added to shortest path parameter, and stores into 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 is using a jump or the form of multi-hop, by the message comprising self information
It is sent to base station；
(9) base station selects the Message Record of each leader cluster node received into base station routing table, and from the routing table
The distance between each leader cluster node and base station CHB outiMinimum value, and using the corresponding leader cluster node of the minimum value selected as it
Transmit the next-hop cluster head node of information；
(10) the next-hop cluster head node of base station selects the distance between itself and other leader cluster nodes CHBiMinimum value, and
The next-hop cluster head node of information is transmitted using the corresponding leader cluster node of the minimum value selected as it；
(11) according to step (10), all leader cluster nodes are successively traversed, until all leader cluster nodes can obtain arrival
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) data of ordinary node are sent to base by the optimal path that each leader cluster node is obtained according to step (11)
It stands；
(14) leader cluster node transmitting data are gone out according to radio energy model and receiver energy loss model inference
Energy loss EPXThe energy loss E of receiver corresponding with itsRXAnd total energy needed for cluster head sensor node transmission data
Measure ETX:
ERX=mER
Wherein, m indicates to send bit number, and ε indicates free space energy coefficient, that is, transmits the energy that every bit data is lost
Amount,Indicate laser scanning angle, d indicates transmission range, ERIt indicates to receive the energy that every bit data is lost, ETX_PE(m)
Indicate to include opto-electronic device coding, modulate, the loss of energy of filtering and the propagation of signal.
It can thus be concluded that the energy theorem E of leader cluster node1:Wherein E1
Indicate the dump energy of leader cluster node, E0Indicate the primary power of leader cluster node, n indicates of ordinary node inside clustering architecture
Number, ETX_PE(mi) indicate energy consumed by opto-electronic device, m in i-th of ordinary nodeiIndicate that i-th of ordinary node is sent out
The bit number of data, diIndicate distance of i-th of ordinary node away from leader cluster node；
(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, E is worked as1Value is lower than the threshold value E of energyth
When, which is rejected from alternate node set G, realizes the topology characteristic of wireless light sensor network.
Compared with prior art, the present invention having the advantage that
The first, the present invention goes out leader cluster node dump energy formula E according to radio energy model inference1, utilize energy public affairs
Formula E1Election of cluster head alternate node set is optimized, dump energy is avoided to be less than the leader cluster node of energy threshold in cluster head next time
It is elected to leader cluster node in election again effectively to balance the energy of FSOSN leader cluster node compared with prior art, extend
Network lifetime.
The second, the present invention is by having found neighbor node, generating clustering architecture, multiple using multi-hop mode transmission node data etc.
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 improves the life span of whole network.
Detailed description of the invention
Fig. 1 is implementation process block diagram 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 relationship simulation comparison figure of the present invention and the prior art；
Fig. 4 is the dump energy summation and wheel number relationship 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:
Referring to Fig.1, the present invention includes the following steps:
Step 1: each node in wireless light sensor network safeguards neighbours' routing table, and is found using neighbours
Algorithm is found the neighbor node of its own by laser emitter, and the number ID of the neighbor node found is stored into its neighbour
It occupies in routing table；
Step 2: calculate the 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 currently performed wheel number, 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
The corresponding node of random number that node elects threshold value T (n) small is as leader cluster node.
The generation of leader cluster node has certain randomness, and election process periodically carries out, and guarantees leader cluster node not
Disconnected rotation, eliminates those dump energies E1Lower than leader cluster node energy threshold EthNode, balance network Energy distribution, extend net
Network life span.
Step 4: each leader cluster node is saved by the message comprising self information, according to neighbours' routing table to its different neighbour
Point broadcast, wherein message includes the number ID and position P of leader cluster nodei(Xi,Yi), the set of other leader cluster node number 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, leader cluster node that neighbor node will receive in message
Number ID is added to the set CH of the neighbor nodeiIn, and calculate it and the distance between the leader cluster node that receives 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 is checked in routing table with the presence or absence of receipts
Otherwise the minimum hop count of leader cluster node into message, then will receive if so, the minimum hop count is set as alternative path parameter
Message is added to shortest path parameter, and stores into 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.
Since the leader cluster node of access is the leader cluster node nearest apart from ordinary node, energy can be saved and subtracted
Connection cluster head and data volume needed for ordinary node less, while ordinary node can be by choosing in shortest path, with other clusters
Ordinary node establishes connection；
Step 8: the leader cluster node in each clustering architecture is using a jump or the form of multi-hop, 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 isolated, can not be established with base station logical
Letter.Multi-hop mechanism has solving above-mentioned isolated node first, improves the Rong Kuohang of network, secondly when node with
When optimal path interrupts before base station, allow to adapt dynamically to link failure, other alternative roads can be enabled in the routing table
Diameter improves the robustness of network.
Step 9: base station by the Message Record of each leader cluster node received into base station routing table, and from the routing table
Select the distance between each leader cluster node and base station CHBiMinimum value, and using the corresponding leader cluster node of the minimum value selected as
Its next-hop cluster head node for transmitting information；
Step 10: the next-hop cluster head node of base station selects the distance between itself and other leader cluster nodes CHBiMinimum
Value, and using the corresponding leader cluster node of the minimum value selected as the next-hop cluster head node of its transmission information；
Step 11: according to step step 10, all leader cluster nodes are successively traversed, until all leader cluster nodes can obtain
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 is since each node uses laser emitter, and the launch angle of laser emitter is very
It is small, therefore there is limitation in the access degree of a clustering architecture, to solve the above-mentioned problems, in the clustering architecture of wireless light sensor network
Leader cluster node in netinit, TDMA slot can be distributed for all ordinary nodes in its cluster.In data transfer phase
The TDMA slot that ordinary node in each clustering architecture is distributed according to before, transmits data to corresponding leader cluster node, cluster
Head node merges the data received, after data transfer phase continues a period of time, starts to execute new round cluster knot
It is configured to process, is moved in circles.This scheme can be effectively solved the transmitting-receiving of the multi-user in same transceiver coverage area and ask
Topic, when accessing user is excessive, leader cluster node only needs to distribute the normal communication that corresponding time slot ensures that all users；
Step 13: the data of ordinary node are sent to base by the optimal path that each leader cluster node is obtained according to step 11
It stands；
Step 14: according to the energy theorem E of radio energy model inference leader cluster node1:
Wherein E1Indicate the dump energy of leader cluster node, E0It indicates
The primary power of leader cluster node, n indicate the number of ordinary node inside clustering architecture, ETX_PE(mi) indicate in i-th of ordinary node
Energy consumed by opto-electronic device, miIndicate that the bit number of the sent out data of i-th of ordinary node, ε indicate free space energy
Coefficient,Indicate ordinary node laser scanning angle, diIndicate distance of i-th of ordinary node away from leader cluster node, ERIndicate common
Node receives energy consumed by every bit data；
The dump energy E of leader cluster node described in step 141Formulation process is as follows:
Step 14a: radio energy model E=kd is utilizedn, wherein k indicates radio energy model constants, as n=2
Calculate the energy loss E of leader cluster node transmitting dataPX:
Wherein, m indicates to send bit number, and ε indicates free space energy coefficient, that is, transmits the energy that every bit data is lost
Amount,Indicate laser scanning angle, d indicates 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, ERIt indicates to receive the energy that every bit data is lost；
Step 14c: emit 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 indicating sensor node transmission data, ETX_PE(m) indicate to include compiling
Code, modulation, the energy of the opto-electronic devices loss such as filtering and the propagation of signal；
Step 14d: leader cluster node counts the ordinary node number n inside clustering architecture, and calculates the residue of the leader cluster node
ENERGY E1:
Wherein, E0Indicate the primary power of leader cluster node.
Step 15: the threshold value E of setting wireless light sensor network cluster head node energyth, each leader cluster node is according to derivation
Energy theorem E out1, self rest energy under its each time slot is stored into own node, E is worked as1Value is lower than the threshold value of energy
EthWhen, it will be rejected in the never elected cluster head set G of the leader cluster node, realize the topology characteristic of wireless light sensor network.
Utilize 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 that the leader cluster node for avoiding those dump energies low continues to work as in election next time
Leader cluster node is selected, to realize the purpose of balance network Energy distribution, effectively extends network lifetime.
Referring to Fig. 2, the topological structure of the wireless light sensor network of building, 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 and communicated with the destination node D in clustering architecture C3 by leader cluster node H2 and H3；It is another in clustering architecture C2
One source node S 2 is then established with base station by leader cluster node H2 and H1 and is communicated；If base station has message to need to be sent to network section
Point, then base station is established with corresponding leader cluster node communicate first, is relayed to corresponding destination node by leader cluster node.
Below in conjunction with emulation experiment, technical effect of the invention is described in further detail:
1. simulated conditions and content:
Wireless light sensor network node sum 50, leader cluster node it is expected that percentage p is 0.2, and node is randomly dispersed in
1000 × 1000 region, node primary power are 0.5J, data packet length 4000bit, opto-electronic device consumption ENERGY ETX_PE
For 4pJ/bit, energy loss 60pJ/bit is received, energy coefficient ε is 4pJ/bit/m2, laser scanning angleFor 2 π/3.Emulation
Content includes the relationship of death nodes number and wheel number and the relationship of leader cluster node dump energy summation and wheel number, and result is such as
Shown in Fig. 3 and Fig. 4.
2. analysis of simulation result:
Referring to Fig. 3, since 40 wheels, the node death nodes number of OEEMRP algorithm is lower than Leach innovatory algorithm, and
As wheel number increases, this trend is gradually increased.
Referring to Fig. 3, the leader cluster node dump energy of OEEMRP algorithm is apparently higher than Leach innovatory algorithm, and with wheel
Number increases, and this trend is gradually increased.
As can be seen from figs. 3 and 4 the present invention is with respect to Leach innovatory algorithm, 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, which is characterized in that including walking as follows
It is rapid:
(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) the 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 currently performed wheel number, 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 select than leader cluster node
Threshold value T (n) small corresponding node of random number 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 message includes the number ID and position P of leader cluster nodei(Xi,Yi), the set CH of other leader cluster node number 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
Distance CHBi；
(5) when the neighbor node of leader cluster node is leader cluster node, leader cluster node number ID that neighbor node will receive in message
It is added to the set CH of the neighbor nodeiIn, and calculate it and the distance between the leader cluster node that receives 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, neighbor node, which checks to whether there is in routing table, receives message
Otherwise the minimum hop count of middle leader cluster node, then adds the message received if so, the minimum hop count is set as alternative path parameter
Shortest path parameter is added as, and is stored into 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 using a jump or the form of multi-hop
To base station；
(9) base station selects the Message Record of each leader cluster node received respectively into base station routing table, and from the routing table
The distance between leader cluster node and base station CHBiMinimum value, and using the corresponding leader cluster node of the minimum value selected as its transmission
The next-hop cluster head node of information；
(10) the next-hop cluster head node of base station selects the distance between itself and other leader cluster nodes CHBiMinimum value, and will choosing
The corresponding leader cluster node of minimum value out transmits the next-hop cluster head node of information as it；
(11) according to step (10), all leader cluster nodes are successively traversed, reach base station until all leader cluster nodes can obtain
Optimal path；
(12) all ordinary nodes in the clustering architecture of wireless light sensor network in each cluster are assigned according to its leader cluster node
TDMA slot transmits data to corresponding leader cluster node；
(13) data of ordinary node are sent to base station by the optimal path that each leader cluster node is obtained according to step (11)；
(14) go out the energy of leader cluster node transmitting data according to radio energy model and receiver energy loss model inference
E is lostPXThe energy loss E of receiver corresponding with itsRXAnd gross energy E needed for cluster head sensor node transmission dataTX:
ERX=mER
Wherein, m indicates to send bit number, and ε indicates free space energy coefficient, that is, transmits the energy that every bit data is lost,
Indicate laser scanning angle, d indicates transmission range, ERIt indicates to receive the energy that every bit data is lost, ETX_PE(m) packet is indicated
Include the loss of energy of opto-electronic device coding, modulation, filtering and the propagation of signal；
It can thus be concluded that the energy theorem E of leader cluster node1:Wherein E1It indicates
The dump energy of leader cluster node, E0Indicating the primary power of leader cluster node, n indicates the number of ordinary node inside clustering architecture,
ETX_PE(mi) indicate energy consumed by opto-electronic device, m in i-th of ordinary nodeiIndicate the sent out data of i-th of ordinary node
Bit number, diIndicate distance of i-th of ordinary node away from leader cluster node；
(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, E is worked as1Value is lower than the threshold value E of energythWhen, it will
The leader cluster node is rejected from alternate node set G, realizes the topology characteristic of wireless light sensor network.
2. the topology method of the wireless light sensor network according to claim 1 based on energy model, feature
It is: derives the energy theorem E of leader cluster node described in step (14)1, realize step are as follows:
(14a) utilizes radio energy model E=kdn, wherein k indicates radio energy model constants, calculates cluster head as n=2
The energy loss E of node transmitting dataPX:
Wherein, m indicates to send bit number, and ε indicates free space energy coefficient, that is, transmits the energy that every bit data is lost,
Indicate laser scanning angle, d indicates 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
Consume ERX:
ERX=mER
Wherein, ERIt indicates to receive the energy that every bit data is lost；
(14c) emits 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 indicating sensor node transmission data, ETX_PE(m) indicate to include photoelectron device
Part coding is modulated, the loss of energy of filtering and the propagation of signal；
(14d) leader cluster node counts the ordinary node number n inside clustering architecture, and calculates the dump energy E of the leader cluster node1:
Wherein, E0Indicate the primary power of leader cluster node.
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 CN106788729A (en) | 2017-05-31 |
| CN106788729B true 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) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107770833B (en) * | 2017-10-27 | 2020-10-27 | 上海感悟通信科技有限公司 | Networking method and medium for wireless self-organizing network system |
| CN108449776B (en) * | 2018-02-27 | 2023-09-05 | 深圳市亚特联科技有限公司 | Network path planning method, node equipment and computer storage medium |
| 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 |
| 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 |
| 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 |
| CN111526555B (en) * | 2020-05-25 | 2022-07-26 | 南京邮电大学 | Multi-hop routing path selection method based on genetic algorithm |
| CN112105072B (en) * | 2020-10-21 | 2023-02-24 | 国网思极紫光(青岛)微电子科技有限公司 | Internet of things communication system and construction method thereof |
| CN114025404B (en) * | 2021-11-08 | 2024-01-23 | 中国核动力研究设计院 | Wireless sensor network routing protocol method, wireless sensor and storage medium |
| CN115051758B (en) * | 2022-06-08 | 2023-12-22 | 大连理工大学 | Reliable data transmission method for underwater wireless optical sensor network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102448139A (en) * | 2011-12-28 | 2012-05-09 | 南昌大学 | Hierarchical routing method for wireless sensor network |
| CN105376806A (en) * | 2015-12-08 | 2016-03-02 | 上海应用技术学院 | Cluster-based routing method based on maximum energy path selection in multipath |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9380119B2 (en) * | 2013-12-16 | 2016-06-28 | Nokia Technologies Oy | Method, apparatus, and computer program product for network discovery |
-
2017
- 2017-01-23 CN CN201710049030.5A patent/CN106788729B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102448139A (en) * | 2011-12-28 | 2012-05-09 | 南昌大学 | Hierarchical routing method for wireless sensor network |
| CN105376806A (en) * | 2015-12-08 | 2016-03-02 | 上海应用技术学院 | Cluster-based routing method based on maximum energy path selection in multipath |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106788729A (en) | 2017-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106788729B (en) | Topology suitable for wireless light sensor network is formed and method for routing | |
| Mansourkiaie et al. | Cooperative routing in wireless networks: A comprehensive survey | |
| CN103118412B (en) | Trust-based on-demand multipath vector routing algorithm of Ad Hoc network | |
| Coutinho et al. | A novel opportunistic power controlled routing protocol for internet of underwater things | |
| Liang et al. | Cooperative communications with relay selection for wireless networks: design issues and applications | |
| Mao et al. | S4: Small state and small stretch compact routing protocol for large static wireless networks | |
| Zhang et al. | An efficient hop count routing protocol for wireless ad hoc networks | |
| Boushaba et al. | Source-based routing in wireless mesh networks | |
| He et al. | On link scheduling in dual-hop 60-GHz mmwave networks | |
| CN107567068B (en) | Method for constructing ultra-dense small base station self-adaptive FSO (frequency selective offset) backhaul network | |
| Jagannath et al. | Vl-route: A cross-layer routing protocol for visible light ad hoc network | |
| Celik et al. | SectOR: Sector-based opportunistic routing protocol for underwater optical wireless networks | |
| He et al. | A decomposition principle for link and relay selection in dual-hop 60 GHz networks | |
| Mehta et al. | Energy efficient cross-layer design in MANETs | |
| CN101448296B (en) | Distributed network topology control method and node thereof | |
| Chen et al. | Coordination game theory-based adaptive topology control for hybrid VLC/RF VANET | |
| Yang et al. | Network modulation: A new dimension to enhance wireless network performance | |
| Jung et al. | On the optimal lifetime of cooperative routing for multi-hop wireless sensor networks | |
| CN106131887B (en) | Distribution topology control method based on serial interference elimination | |
| Koutsonikolas et al. | An interference-aware fair scheduling for multicast in wireless mesh networks | |
| Najafi et al. | An Efficient Cluster-based Routing Protocol for Improvement Delay in Mobile Ad-hoc Networks | |
| Long et al. | TDMA-based efficient cooperative relaying selection scheme in multi-hop wireless networks | |
| Zhang | An Algorithm of Wireless Sensor Network Based on Free Space Optical Communication. | |
| Xiao et al. | A novel energy entropy based on cluster head selection algorithm for wireless sensor networks | |
| Ilow et al. | Energy efficient broadcasting in WSNs with cocasting and power control |
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 |