CN103533595A - Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks - Google Patents

Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks Download PDF

Info

Publication number
CN103533595A
CN103533595A CN201310521380.9A CN201310521380A CN103533595A CN 103533595 A CN103533595 A CN 103533595A CN 201310521380 A CN201310521380 A CN 201310521380A CN 103533595 A CN103533595 A CN 103533595A
Authority
CN
China
Prior art keywords
node
algorithm
leader cluster
bunch
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201310521380.9A
Other languages
Chinese (zh)
Inventor
林志贵
陈珍星
刘英平
孟德军
张彩霞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tianjin Polytechnic University
Original Assignee
Tianjin Polytechnic University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tianjin Polytechnic University filed Critical Tianjin Polytechnic University
Priority to CN201310521380.9A priority Critical patent/CN103533595A/en
Publication of CN103533595A publication Critical patent/CN103533595A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a GEEMHCR which is a location-aware routing algorithm for the wireless sensor networks. The algorithm is provided based on full consideration of residual energy of each node, cluster head elected times, node survival amount, overall network energy consumption and data volume received by a base station, and comprises steps as follows: cluster division; cluster head selection; routing establishment; and routing maintenance. The multi-hop clustering routing algorithm has the advantages that GEEMHCR overcomes defects that cluster head position distribution in the networks is not uniform, differences of node amount in each cluster are larger, cluster head election does not take residual node energy into consideration, cluster head nodes are directly communicated with aggregation nodes and the like; improvement is achieved in the aspects of energy efficiency, overall network energy consumption, uniform energy distribution and network life cycle; and the algorithm is mainly used in the routing control field of the wireless sensor networks.

Description

The multi-Hop Routing Algorithm of radio sensing network
Technical field
What the present invention relates to is the known a kind of Clustering Routing of node location information in radio sensing network.Belong to radio sensing network routing algorithm technical field.
Background technology
Routing algorithm is one of key technology in wireless sensor network (WSN).Routing algorithm in WSN has the feature of general network routing algorithm institute specified data transmission path, also has and in data path system of selection, embodies the feature of saving energy.Therefore, general network routing algorithm directly grafting in WSN network, need to, in conjunction with WSN own characteristic, study corresponding routing algorithm.Routing algorithm is directly connected to robustness and the life cycle of WSN network.
At present, the Research of Routing Algorithm in WSN network is mainly launched and two aspects of node motion fixing from node, the fixing Research of Routing Algorithm of node is relatively many.From node structure angle, the fixing routing algorithm of node can be divided into Clustering Routing and the routing algorithm based on tree structure.Clustering Routing is to select a part of node as leader cluster node, and the data of ordinary node are sent to leader cluster node according to different sub-clustering rules, and leader cluster node is given aggregation node after treatment, and typical algorithm is LEACH.There is bunch randomness of head selection, bunch reconstruct of repetition need consume a large amount of network energies, determine the deficiencies such as constraints difficulty, transfer of data loss and transfer of data time delay in Clustering Routing.From the whether known angle of node location, the fixing routing algorithm of node is divided into again location aware routing algorithm and Location-Unknown routing algorithm.Location aware routing algorithm is according to the positional information of node, to carry out the consumption of computing node spacing and estimated energy, thereby builds suitable transmission path, and typical algorithm is GAF algorithm.There is collision problem between packet in location aware route, and the planar structure that adopts while existing numerous nodes to find at one time down hop via node, be unfavorable for the deficiencies such as management of network.
Summary of the invention
The present invention, mainly for above-mentioned defect, considers the size of wireless network monitored area and the number of nodes, proposes the multi-Hop Routing Algorithm (GEEMHCR) of radio sensing network.First GEEMHCR algorithm is divided into network several square area, then carries out the selection of bunch head; In a bunch selection course, consider the dump energy of each node; In data transmission procedure, leader cluster node adopts mode and the base station of multi-hop to communicate.GEEMHCR algorithm is implemented to be comprised of initial phase and stabilization sub stage.What initial phase mainly completed sub-clustering, bunch head chooses and sets up route work; Stabilization sub stage is mainly the maintenance of carrying out route.As shown in Figure 1, specific algorithm is as follows for GEEMHCR algorithm flow:
1. division bunch: the division that first initial phase carries out bunch as shown in Figure 2.First in monitored area, set up rectangular coordinate system, then sub-clustering is carried out in monitored area.From radio model, the energy that sensor node sends k bit data consumes E send(k, d) is as shown in formula (1):
E send(k，d)=E s_elec(k)+E amp(k，d)=kE elec+kε ampd 4 (1)
Wherein, E elecbe the energy that transtation mission circuit and receiving circuit are processed 1bit data consumes, d is signal transmission distance, and k is the data b it that will send, ε ampthe multiplication factor that signal amplifies, ε amp=ε f s=0.0013pJ/bit/m 4.
The energy that sensor node receives k bit data consumes E receive(k) as shown in formula (2):
E receive(k)=E r_elec(k)=kE ekec (2)
In the monitored area of L * L, by formula (1), formula (2) and actual monitoring environment, derive and draw optimum sub-clustering number m optcomputational methods as shown in formula (3).
m opt = 4 n 6 π 4 ϵ fs ϵ amp L L d toBS - - - ( 3 )
Wherein, m optthe optimum number that represents sub-clustering in sensor network, n represents the number of nodes, L represents the length of side of monitored area, d toBSrepresent that nodes all in monitored area is to the average distance of base station.
2. choosing of bunch head: GEEMHCR algorithm node state is divided into intercept, movable and three states of sleeping.Transformational relation between them as shown in Figure 3.After sub-clustering completes, all the sensors node is all in the state of intercepting; Each bunch of interior nodes starts election contest bunch head, if campaigned for successfully, node enters active state; If node is campaigned for unsuccessfully, enter sleep state.Node in active state, if leader cluster node is taken turns and finished the laggard state that enters to intercept in one of stable operation stage, a bunch head that again participates in next round is chosen; If become the node of active state in own timeslice in dormant node, after finishing, timeslice again forwards so sleep state to; In dormant node, in own timeslice, enter into active state and a bunch head and communicate, in one of stable operation stage, take turns and finish laggardly to enter to the state of intercepting, a bunch head that participates in next round is chosen.Bunch head is chosen flow process as shown in Figure 4, mainly contains following components:
(1) start each node all in the state of intercepting, they go out a threshold value according to calculation of parameter such as the energy state of node and network states, as shown in formula (4).And produce a random number between 0 to 1, if the random number producing is less than this threshold value, this node can be elected as a bunch head, and to bunch interior nodes broadcast, becomes the message of bunch head;
T ( n ) = p 1 - [ r mod ( 1 / p ) ] [ E n _ curr E n _ init ( 1 - E n _ curr E n _ init ) 1 ( t + 1 ) ] , n ∈ G - - - ( 4 )
Wherein, p is the percentage that leader cluster node accounts for total nodes.R is the completed number of taking turns, and G is the set of all nodes in a sub-clustering, and mod is modulo operator, E n_curr,the current energy that represents node, E n_initthe primary power that represents node, t represents that node is former serves as the number of times of bunch head in taking turns.
(2) node receives in same cluster after other node becomes the message of bunch head, if the random number that it produces is less than its threshold value, its threshold value is compared with broadcast node threshold value, according to comparative result, divide three kinds of situations to process: if the threshold value of broadcast node is large, it joins message to one of broadcast node transmission; If the threshold value of broadcast node is little, it becomes the message of bunch head to bunch interior nodes broadcast; If the two equates, forwards step (1) to;
(3) node receives in same cluster after other node becomes the message of bunch head, if the random number that its produces is more than or equal to its threshold value, to broadcast node, sends a message adding;
(4) if node receives a plurality of messages that become bunch head at same amount of time, selecting the broadcast node that threshold value is large is leader cluster node, and sends a message adding to it, if the threshold value of the node receiving is equal, forwards step (1) to;
(5) if the node in same bunch does not all receive that node broadcasts becomes the message of bunch head in timeslice, forward step (1) to, otherwise continue to carry out;
(6) leader cluster node receive bunch in after the message that adds of all nodes, determine CDMA coding that this bunch adopt and according to the number of bunch interior nodes, for bunch in all member node distribute a time-scale, member node communicates according to time-scale and a bunch head, At All Other Times in sleep state, thereby save energy.
3. the foundation of route: in GEEMHCR algorithm, the data between bunch head and base station transmit the mode that adopts multi-hop, as shown in Figure 5.Can reduce the consumption of integral energy in network like this, also make whole nodes energy consumption distribute simultaneously more even, the life cycle that has extended network.GEEMHCR algorithm adopts the multi-hop routing method of shortest path to build leader cluster node to the multihop path of base station, that is: from base station, start to adopt the state information of the restricted mode broadcast node flooding, leader cluster node is received the state information of broadcast oneself after state information, so repeatedly carry out, until arrive whole network, thereby set up the minimal path that each leader cluster node arrives base station.In this algorithm, guarantee that each leader cluster node only communicates with the nearest neighbours' leader cluster node of distance oneself, and the multihop path of process is the shortest.
4. the maintenance of routing table: stabilization sub stage main task is to carry out the maintenance of route.When leader cluster node changes, the maintenance of routing table is divided into following step:
Step1: leader cluster node originally sends to new leader cluster node by its routing table;
Step2: new leader cluster node is to its its state information of neighbours' leader cluster node broadcast;
Step3: after neighbours' leader cluster node receives the state information of leader cluster node, search in the routing table of oneself according to the numbering of in state information bunch, carry out following operation according to Search Results:
If 1. had and its node in same cluster, delete corresponding record in routing table, and the state information that receives node is saved in routing table;
If 2. do not had and its state information at the node of same cluster, relatively receive the size of the jumping figure jumping figure current with it of node, if receive the current jumping figure that the jumping figure of node is less than this node, so the state information of this node is saved in routing table, otherwise abandons the state information that receives node.
Accompanying drawing explanation
Fig. 1 GEEMHCR algorithm flow chart
Fig. 2 GEEMHCR sub-clustering schematic diagram
Fig. 3 node state transition diagram
Fig. 4 bunch of head chosen flow chart
Fig. 5 GEEMHCR multi-hop routing algorithm schematic diagram
The comparison in Fig. 6 network node life-span
The comparison of the whole energy consumption of Fig. 7 network
Fig. 8 base station receives the comparison of data volume
Embodiment
Adopt NS-2 network simulation instrument (version 2 .28), this algorithm is implemented, idiographic flow is as follows:
(1) two kinds of monitored area 100m * 100m and 200m * 200m are set, monitored area is uniformly distributed 100 nodes, and the coordinate of base station is (0,50).
(2) according to formula (3), calculate respectively sub-clustering number and bunch area size, other relevant parameter is as shown in table 1.
Table 1 simulated environment parameter arranges
Figure BSA0000096825430000041
(3) comparison of network lifecycle: Fig. 6 has shown under two kinds of network sizes, tri-kinds of routing algorithms of LEACH, GAF and GEEMHCR over time, and the variation of the interstitial content of surviving in network.In 100m * 100m network, from Fig. 6 (a), can find out, dead, all variations such as death and average rate of death that node starts to occur, are specifically shown in Table 2.The time that dead node appears in GEEMHCR algorithm is as can be seen from Table 2 than the LEACH algorithm 120s that lagged behind; And its life cycle has extended approximately 51% than LEACH, than GAF, extended 21%.GEEMHCR algorithm is few compared with LEACH and the power consumption of GAF algorithm, and the time-to-live of node is long, has extended the life cycle of network.
Three kinds of algorithm nodes of table 2 change performance comparison
In 200m * 200m network, from Fig. 6 (b), can find out, LEACH and GAF algorithm have node death at the very start, and its life cycle is respectively 190s and 310s, and this illustrates that the two is not suitable for large-scale monitoring network.Yet GEEMHCR algorithm occurs that the time of dead node is 300s, the end time is 520s.Therefore, GEEMHCR algorithm can effectively extend the life cycle of network.
(4) comparison of network overall power consumption: the overall power consumption of three kinds of routing algorithms as shown in Figure 7.In 100m * 100m network, from Fig. 7 (a), can find out, the energy consumption speed of LEACH is the fastest, and GAF takes second place, and the energy consumption varies of GEEMHCR is slower.And the emulation end time of LEACH, GAF and GEEMHCR algorithm is respectively 450s, 560s and 700s.Hence one can see that, and the energy-saving effect of GEEMHCR algorithm is better than LEACH and GAF algorithm.Comparison diagram 7 (a) and 7 (b) can find out, three kinds of algorithms are along with the increase of network size, and correspondingly energy consumption also increases.LEACH algorithm rate of energy dissipation has increased approximately 0.5 times; The energy consumption rate variation of GEEMHCR algorithm is little, although the life cycle of network has shifted to an earlier date 180s, with respect to LEACH and GAF algorithm, its life cycle has obtained effective prolongation.Therefore, GEEMHCR algorithm has more power savings advantages in large scale network.
(5) base station receives the comparison of data volume: under these two kinds of network sizes, the packet number that three kinds of routing algorithms send to base station over time as shown in Figure 8.In 100m * 100m network, from Fig. 8 (a), can find out, synchronization, the packet that LEACH algorithm sends to base station is minimum, and to base station, stops sending the earliest packet.Before 400s, the packet that GAF and GEEMHCR algorithm send to base station is basic identical; After 400s, along with the death of great deal of nodes in GAF algorithm, its packet sending to base station will be less than GEEMHCR algorithm.Hence one can see that, and the packet that GEEMHCR algorithm can better receiving node sends, obtains more information.In 200m * 200m network, from Fig. 8 (b), can find out, before 200s, the magnitude relationship of the number of the packet that three kinds of algorithms send to base station is GEEMHCR > GAF > LEACH; During 200s, the node of LEACH algorithm is almost all dead, no longer to base station, sends data, and the total data bag sending to base station is about 17000; During to 320s, GAF algorithm also no longer sends data, and the total data bag sending to base station is about 38000; The life cycle of GEEMHCR algorithm is 520s, and base station receives approximately 73000 packets.Therefore, the effective information that GEEMHCR algorithm sends to base station is larger, and the information of obtaining monitoring of environmental is also larger.

Claims (3)

1. the multi-Hop Routing Algorithm of a radio sensing network (GEEMHCR), is characterized in that: adopt LEACH algorithm framework, the positional information of aggregators, by initialization with stablize two stages and implement; The defect of the aspects such as the dump energy that this algorithm has overcome that the position distribution of bunch head in network is inhomogeneous, interstitial content differs large, election of cluster head is not considered node in each bunch and leader cluster node and aggregation node direct communication, and increase in the life cycle long side of the integral body power consumption of energy efficiency, network and Energy distribution equilibrium, network.
2. the multi-Hop Routing Algorithm of radio sensing network according to claim 1, it is characterized in that: what initial phase mainly completed sub-clustering, bunch head chooses and set up route work, in a bunch selection course, take into full account the dump energy of each node and the number of times of elected bunch head, avoid energy to consume unbalanced problem.Concrete steps are as follows:
Bunch (1) division: first set up rectangular coordinate system in monitored area, network is divided into several square area, carry out sub-clustering according to surveyed area size, interstitial content and position.
(2) choosing of bunch head: after sub-clustering completes, all the sensors node is all in the state of intercepting; Each bunch of interior nodes starts election contest bunch head, if campaigned for successfully, node enters active state; If node is campaigned for unsuccessfully, enter sleep state; Node in active state, if leader cluster node is taken turns and finished the laggard state that enters to intercept in one of stable operation stage, a bunch head that again participates in next round is chosen; If become the node of active state in own timeslice in dormant node, after finishing, timeslice again forwards so sleep state to; In dormant node, in own timeslice, enter into active state and a bunch head and communicate, in one of stable operation stage, take turns and finish laggardly to enter to the state of intercepting, a bunch head that participates in next round is chosen.
(3) foundation of route: adopt the multi-hop routing method of shortest path to build leader cluster node to the multihop path of base station, that is: from base station, start to adopt the state information of the restricted mode broadcast node flooding, leader cluster node is received the state information of broadcast oneself after state information, so repeatedly carry out, until arrive whole network, thereby set up the minimal path that each leader cluster node arrives base station; In this algorithm, guarantee that each leader cluster node only communicates with the nearest neighbours' leader cluster node of distance oneself, and the multihop path of process is the shortest.
3. the multi-Hop Routing Algorithm of radio sensing network according to claim 1, is characterized in that: in the stabilization sub stage, the route maintenance algorithm when leader cluster node changes, is specifically divided into following step:
Step1: leader cluster node originally sends to new leader cluster node by its routing table;
Step2: new leader cluster node is to its its state information of neighbours' leader cluster node broadcast;
Step3: after neighbours' leader cluster node receives the state information of leader cluster node, search in the routing table of oneself according to the numbering of in state information bunch, carry out following operation according to Search Results:
(1), if had and its node in same cluster, delete corresponding record in routing table, and the state information that receives node is saved in routing table;
(2) if do not had and its state information at the node of same cluster, relatively receive the size of the jumping figure jumping figure current with it of node, if receive the current jumping figure that the jumping figure of node is less than this node, so the state information of this node is saved in routing table, otherwise abandons the state information that receives node.
CN201310521380.9A 2013-10-28 2013-10-28 Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks Pending CN103533595A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310521380.9A CN103533595A (en) 2013-10-28 2013-10-28 Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310521380.9A CN103533595A (en) 2013-10-28 2013-10-28 Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks

Publications (1)

Publication Number Publication Date
CN103533595A true CN103533595A (en) 2014-01-22

Family

ID=49935180

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310521380.9A Pending CN103533595A (en) 2013-10-28 2013-10-28 Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks

Country Status (1)

Country Link
CN (1) CN103533595A (en)

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104320796A (en) * 2014-10-28 2015-01-28 河海大学常州校区 Wireless sensor network data transmission method based on LEACH protocol
CN104994020A (en) * 2015-05-06 2015-10-21 天津理工大学 Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model
CN105228212A (en) * 2015-09-17 2016-01-06 哈尔滨工程大学 The underwater sensor network method for routing that a kind of many mobile sink node location are auxiliary
CN105430598A (en) * 2015-11-04 2016-03-23 刘运成 Layered data transmission method and device of wireless sensor network
CN105681197A (en) * 2016-01-04 2016-06-15 哈尔滨工业大学深圳研究生院 Data fusion routing method of wireless sensor network
CN106375964A (en) * 2016-08-31 2017-02-01 北京千安哲信息技术有限公司 Nodes and cluster-head node selection method in body area network
CN106658642A (en) * 2016-12-29 2017-05-10 长春理工大学 Energy heterogeneous wireless sensor network clustering method and system
CN106851596A (en) * 2017-01-10 2017-06-13 扬州大学 A kind of dynamic ad hoc network method of agricultural environment wireless sense network
CN107018575A (en) * 2017-05-27 2017-08-04 河南科技大学 The expansible of wireless sensor network preengages SR BMA agreements
CN107086962A (en) * 2017-04-01 2017-08-22 天津理工大学 It is a kind of towards vehicle networking by multi-hop reaction equation clustering method
CN107172170A (en) * 2017-05-27 2017-09-15 梧州市兴能农业科技有限公司 Agricultural product accumulating control system based on wireless sensor network
CN108156087A (en) * 2018-01-22 2018-06-12 南京邮电大学 A kind of sub-clustering, assignment of traffic, coding negotiation and data forwarding method and device
CN108306821A (en) * 2018-02-10 2018-07-20 长安大学 Super High structures monitor low power consumption optimization method
CN108521661A (en) * 2018-04-15 2018-09-11 佛山市虚拟现实大数据产业研究院有限公司 A kind of wireless sensor network routing method based on block chain technology
CN108764767A (en) * 2018-04-03 2018-11-06 保正（上海）供应链管理股份有限公司 A kind of automatic cargo allocation system
CN108770036A (en) * 2018-06-20 2018-11-06 中国联合网络通信集团有限公司 Communication means and wireless sensor network Routing Protocol between cluster head
CN108834095A (en) * 2018-07-03 2018-11-16 深圳大图科创技术开发有限公司 Maritime meteorology information Perception system
CN109061084A (en) * 2018-07-02 2018-12-21 深圳智达机械技术有限公司 Marine environment real-time intelligent monitors system
CN109922511A (en) * 2019-04-29 2019-06-21 中国联合网络通信集团有限公司 Cluster-head node selection method, node clustering method and cluster-head node selection device
CN110460966A (en) * 2019-09-23 2019-11-15 东莞理工学院 A kind of energy consumption reduction method of wireless multi-hop network
CN116489741A (en) * 2023-06-19 2023-07-25 南昌大学 Cross-layer energy saving method and system for wireless sensor network
CN117956540A (en) * 2024-03-27 2024-04-30 广州市赛科自动化控制设备有限公司 Indoor environment monitoring method, device, equipment and storage medium

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103298054A (en) * 2013-06-04 2013-09-11 四川大学 Wireless sensor network cluster routing protocol based on node depth

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103298054A (en) * 2013-06-04 2013-09-11 四川大学 Wireless sensor network cluster routing protocol based on node depth

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
张彩霞: "基于WSN的水环境监测信息融合算法研究", 《天津工业大学 2012（学位年度）》 *

Cited By (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104320796A (en) * 2014-10-28 2015-01-28 河海大学常州校区 Wireless sensor network data transmission method based on LEACH protocol
CN104994020A (en) * 2015-05-06 2015-10-21 天津理工大学 Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model
CN105228212B (en) * 2015-09-17 2018-12-07 哈尔滨工程大学 A kind of underwater sensor network method for routing of more mobile sink node positioning auxiliaries
CN105228212A (en) * 2015-09-17 2016-01-06 哈尔滨工程大学 The underwater sensor network method for routing that a kind of many mobile sink node location are auxiliary
CN105430598A (en) * 2015-11-04 2016-03-23 刘运成 Layered data transmission method and device of wireless sensor network
CN105430598B (en) * 2015-11-04 2019-01-18 刘运成 The data hierarchy transmission method and device of wireless sensor network
CN105681197A (en) * 2016-01-04 2016-06-15 哈尔滨工业大学深圳研究生院 Data fusion routing method of wireless sensor network
CN106375964A (en) * 2016-08-31 2017-02-01 北京千安哲信息技术有限公司 Nodes and cluster-head node selection method in body area network
CN106375964B (en) * 2016-08-31 2019-05-07 北京千安哲信息技术有限公司 A kind of selection method of node and leader cluster node in body area network
CN106658642A (en) * 2016-12-29 2017-05-10 长春理工大学 Energy heterogeneous wireless sensor network clustering method and system
CN106658642B (en) * 2016-12-29 2020-07-24 长春理工大学 Energy heterogeneous wireless sensor network clustering method and system
CN106851596A (en) * 2017-01-10 2017-06-13 扬州大学 A kind of dynamic ad hoc network method of agricultural environment wireless sense network
CN107086962A (en) * 2017-04-01 2017-08-22 天津理工大学 It is a kind of towards vehicle networking by multi-hop reaction equation clustering method
CN107018575A (en) * 2017-05-27 2017-08-04 河南科技大学 The expansible of wireless sensor network preengages SR BMA agreements
CN107172170A (en) * 2017-05-27 2017-09-15 梧州市兴能农业科技有限公司 Agricultural product accumulating control system based on wireless sensor network
CN108156087A (en) * 2018-01-22 2018-06-12 南京邮电大学 A kind of sub-clustering, assignment of traffic, coding negotiation and data forwarding method and device
CN108306821B (en) * 2018-02-10 2019-01-29 长安大学 Super High structures monitor low power consumption optimization method
CN108306821A (en) * 2018-02-10 2018-07-20 长安大学 Super High structures monitor low power consumption optimization method
CN108764767A (en) * 2018-04-03 2018-11-06 保正（上海）供应链管理股份有限公司 A kind of automatic cargo allocation system
CN108521661A (en) * 2018-04-15 2018-09-11 佛山市虚拟现实大数据产业研究院有限公司 A kind of wireless sensor network routing method based on block chain technology
CN108770036A (en) * 2018-06-20 2018-11-06 中国联合网络通信集团有限公司 Communication means and wireless sensor network Routing Protocol between cluster head
CN108770036B (en) * 2018-06-20 2020-10-02 中国联合网络通信集团有限公司 Inter-cluster-head communication method and wireless sensor network routing device
CN109061084A (en) * 2018-07-02 2018-12-21 深圳智达机械技术有限公司 Marine environment real-time intelligent monitors system
CN108834095A (en) * 2018-07-03 2018-11-16 深圳大图科创技术开发有限公司 Maritime meteorology information Perception system
CN109922511A (en) * 2019-04-29 2019-06-21 中国联合网络通信集团有限公司 Cluster-head node selection method, node clustering method and cluster-head node selection device
CN110460966A (en) * 2019-09-23 2019-11-15 东莞理工学院 A kind of energy consumption reduction method of wireless multi-hop network
CN116489741A (en) * 2023-06-19 2023-07-25 南昌大学 Cross-layer energy saving method and system for wireless sensor network
CN116489741B (en) * 2023-06-19 2023-09-01 南昌大学 Cross-layer energy saving method and system for wireless sensor network
CN117956540A (en) * 2024-03-27 2024-04-30 广州市赛科自动化控制设备有限公司 Indoor environment monitoring method, device, equipment and storage medium

Similar Documents

Publication Publication Date Title
CN103533595A (en) Multi-hop clustering routing algorithm (GEEMHCR) for wireless sensor networks
CN101895956B (en) Data transmission method of multilayer distributed wireless sensor network
Yuan et al. An energy-efficient mobile sink routing algorithm for wireless sensor networks
Zheng et al. Optimal block design for asynchronous wake-up schedules and its applications in multihop wireless networks
CN102625427B (en) Wireless sensor network data acquisition method based on asynchronous awakening scheduling
CN104320796A (en) Wireless sensor network data transmission method based on LEACH protocol
CN103281769A (en) Energy consumption balancing method of isomerism wireless sensor network unequal clustering
CN104411000A (en) Method for selecting cluster head of hierarchical routing protocol in wireless sensor network
Wang et al. Secure big data communication for energy efficient intra-cluster in WSNs
Nema et al. Energy efficient adaptive routing algorithm in MANET with sleep mode
CN105072658B (en) A kind of network data acquisition control system and wireless route method
CN105050077B (en) A kind of sub-clustering chain type wireless sensing network data transmission method
Chauhan et al. Energy efficient sleep scheduled clustering & spanning tree based data aggregation in wireless sensor network
Lande et al. Energy efficient routing protocol for wireless sensor networks
CN103619045A (en) Route establishing method and system of low-consumption lossy network
Ghneimat et al. Adaptive, cluster based, sensor network routing protocol
Zhao et al. Flooding and directed diffusion routing algorithm in wireless sensor networks
Suresh et al. Improving network lifetime and reducing energy consumption in wireless sensor networks
Jun et al. A modified LEACH algorithm in wireless sensor network based on NS2
CN103002536A (en) Energy efficient wireless multi-hop network routing mechanism based on random walks
Tong et al. Modified AODV routing protocol in underwater acoustic networks
Chaitra et al. Energy efficient mac and routing protocols–a survey
Hung et al. A PROPOSAL FOR IMPROVE THE LIFE-TIME OF WIRELESS SENSOR NETWORK
CN103686925A (en) Multi-hopping clustering fusion router of wireless sensing monitoring network for water environment
Shipu et al. Research on wsn routing algorithm for vegetable greenhouse

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20140122