CN107690168B - Extensible networking method for wireless sensor network - Google Patents
Extensible networking method for wireless sensor network Download PDFInfo
- Publication number
- CN107690168B CN107690168B CN201610646972.7A CN201610646972A CN107690168B CN 107690168 B CN107690168 B CN 107690168B CN 201610646972 A CN201610646972 A CN 201610646972A CN 107690168 B CN107690168 B CN 107690168B
- Authority
- CN
- China
- Prior art keywords
- cluster
- cluster head
- node
- network
- chj
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- 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)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention aims to reduce the energy consumption of network reconstruction and provides an extensible networking method of a wireless sensor network. Firstly, taking the residual energy of nodes in the network as an election standard of a candidate cluster head; and secondly, taking factors such as residual energy of the candidate nodes, the number of neighbor nodes of the candidate cluster head, the value degree from each node to the candidate cluster head and the like as the election standard of the cluster head. Then, when the average energy in the cluster is larger than a certain threshold, re-clustering is not needed in the whole network range, and only a new cluster head needs to be selected in the cluster. And finally, when a new node joins the network, introducing a network access permission value to judge which cluster the node should join. In addition, the new network access node uses the reserved time slot to transmit data without waiting for the end of each cluster cycle and without dividing the time slot again by the cluster head.
Description
Technical Field
The invention belongs to the technical field of wireless sensor networks, and relates to an extensible networking method of a wireless sensor network.
Background
The Wireless Sensor Networks (WSNs) integrate Sensor technology, Wireless communication technology and database processing technology, are composed of nodes with sensing, computing and communication capabilities, and are a novel Wireless network with data as a center. The main function is to collect the information of the monitoring area where the sensor node is located, and to transmit the information to the base station after certain processing, so as to realize the monitoring of the physical world. Wireless sensor networks have been widely used in various fields such as industry, agriculture, military, environmental monitoring, medical monitoring, etc.
In the WSNs, the node energy is limited, and the node energy exhaustion affects the performance of the whole network. The energy consumption of the nodes is mainly focused on two aspects of data acquisition and data transmission, and the energy consumption of the data transmission is far greater than that of the data acquisition. Therefore, the reduction of network energy consumption by establishing good routes becomes a research focus and a hot spot of the WSNs.
Routing protocols can be divided into flat routing protocols and clustered routing protocols depending on the topology of the network. In the plane routing protocol, because a central management node is not arranged in a network, optimization of network resources cannot be realized, the number of hops for data to pass from a source node to a destination node is large, data delay is long, and the plane routing protocol is not suitable for a large-scale network, and the development trend of WSNs is larger and larger, so the plane routing protocol cannot adapt to the development trend of the current WSNs.
In the clustering routing protocol, after acquiring data, a common node sends the data to a cluster head of the common node, and the cluster head processes the data and forwards the data to a target node. The routing protocol has strong expandability, can reduce the transmission quantity of data through data fusion in the data transmission process, is convenient for topology management, and can be applied to large-scale networks.
Disclosure of Invention
The invention aims to reduce the energy consumption problem caused by network reconstruction and provides an extensible networking method of a wireless sensor network. Firstly, in the election process of the candidate cluster head, the residual energy of the nodes in the network is considered, and the probability that the low-energy nodes become the candidate cluster head is reduced; secondly, in the election process of the cluster head, the factors of the residual energy of the candidate nodes, the number of neighbor nodes of the candidate cluster head, the value degree from each node to the candidate cluster head and the like are considered, so that the selected cluster head is ensured to have higher energy, the cluster head is also ensured to be distributed in a region with more concentrated nodes, the transmission distance of data is reduced, the energy consumption is reduced, and the life cycle of the network is favorably prolonged. In addition, when the average energy in the cluster is larger than a certain threshold value, the cluster does not need to be clustered again in the whole network range, and only a new cluster head needs to be selected in the cluster. And finally, when a new node joins the network, introducing a network access permission value, selecting a cluster to which the node is to join by considering the position distribution of the node, the energy of the cluster head node and the load value of the corresponding cluster, and allocating the TDMA time slot for the node by using the reserved time slot.
According to the technical scheme provided by the invention, the networking method of the extensible wireless sensor network comprises the following steps: network clustering, cluster head election in a cluster and network expansion.
In the network clustering stage of the method, the setting of the threshold value of the candidate cluster head takes the residual energy of the node into consideration, thereby greatly reducing the probability of selecting the low-energy node as the candidate and avoiding the hot spot problem caused by excessive energy consumption of the node when the cluster head is selected for many times; in the process of selecting the cluster heads, the nodes select the three cluster heads with the minimum forwarding cost as the candidate cluster heads according to the sum of squares of paths through which the data are forwarded to the base station through the cluster heads, so that the problem of overlarge energy consumption caused by long distance of the data when the cluster heads are distributed more than usual can be solved. The node selects the candidate cluster head with large residual energy and more neighbor nodes from the three candidate cluster heads as the final cluster head of the node, so that the cluster head is ensured to have higher energy, and the cluster head is also ensured to be distributed in a relatively concentrated area of the node.
In the first selection stage of the cluster in the method, not only the residual energy of the nodes in the cluster is considered, but also the communication cost between the member nodes in the cluster and the cluster head is considered, so that the energy of the nodes in the cluster can be balanced, the low-energy nodes are prevented from being selected as the cluster head, the communication cost in the cluster is reduced, the energy is saved, and the life cycle of the network is effectively prolonged.
In the network expansion stage of the method, the network access permission values of the nodes are introduced, the selected cluster head node has better robustness to a new network access node by considering the energy and the distance of the cluster to be added, and the load distribution of the network is more uniform by considering the load value of the cluster. Meanwhile, a data sharing mechanism is introduced, the interaction amount of data in the network is reduced, and the calculated amount of the cluster head nodes is reduced because only the cluster head node closest to the newly accessed network node and the network access permission value of the cluster head node in one hop of the cluster head node are calculated, so that the requirement on energy saving in the existing network is better met. And the process can occur at any node of the network communication without waiting for a re-establishment to the cluster. And the new network access node uses the reserved time slot for data transmission without waiting for the cycle end of each round of clusters.
Detailed Description
The invention aims to reduce the energy consumption problem caused by network reconstruction and provides an extensible networking method of a wireless sensor network. Firstly, in the election process of the candidate cluster head, the residual energy of the nodes in the network is considered, and the probability that the low-energy nodes become the candidate cluster head is reduced; secondly, in the election process of the cluster head, the factors of the residual energy of the candidate nodes, the number of neighbor nodes of the candidate cluster head, the value degree from each node to the candidate cluster head and the like are considered, so that the selected cluster head is ensured to have higher energy, the cluster head is also ensured to be distributed in a region with more concentrated nodes, the transmission distance of data is reduced, the energy consumption is reduced, and the life cycle of the network is favorably prolonged. In addition, when the average energy in the cluster is larger than a certain threshold value, the cluster does not need to be clustered again in the whole network range, and only a new cluster head needs to be selected in the cluster. And finally, when a new node joins the network, introducing a network access permission value, and selecting a cluster to which the node is to join by considering the position distribution of the node, the energy of the cluster head node and the load value of the corresponding cluster.
According to the technical scheme provided by the invention, the networking method of the extensible wireless sensor network comprises the following steps: network clustering, cluster head election in a cluster and network expansion.
A) Network clustering
1) Election of candidate cluster heads
Each node in the network randomly generates a random number from 0 to 1, the random number is compared with a threshold value of the node, if the random number is smaller than the threshold value, the node is selected as a candidate cluster head, the number of the nodes selected as the candidate cluster head is made to be m, and the threshold value T (i) adopts a formula (1).
Wherein, p is the probability of the node being selected as the cluster head, r represents the number of rounds of the current node Ni which is not selected as the cluster head continuously, the probability of the node being selected as the cluster head is larger as r is larger, and r is 0 and represents that the cluster head is just selected by the node last round. EiFor node Ni current remaining energy, E0Is the initial energy of the node. The larger the residual energy of the node is, the larger the value of T (n) is, and the larger the probability of being selected as a cluster head is.
2) Cluster head election and member node joining
Candidate cluster headAfter the election is completed, the node according to the residual energy E of the candidate cluster headCH_Can(j)The number Nei of neighbor nodes of the candidate cluster headCH_Can(j)The average value Nei of the number of neighbor nodes of all candidate cluster heads in the networkaverRatio of the nodes to the candidate cluster head, and value degree d of each node to the candidate cluster headNi_chj_BS 2To select a cluster head.
Wherein, NeiaverThe value of (A) is represented by the formula (2), dNi_chj_BS 2The value of (A) is represented by a formula (3);
dNi_chj_BS 2＝dNi_chj 2+dChj_BS 2 (3)
in the formula (3), dNi_chj 2Is the square of the distance from node Ni to cluster head chj, dChj_BS 2The square of the distance of the cluster head chj to the base station BS. D, since the data collected by the node Ni is forwarded to the BS by the cluster head nodeNi_cnj_BS 2The smaller the value, the smaller the total energy consumed by forwarding data by the cluster head chj.
Node Ni selects dNi_chj_BS 2The three nodes with the minimum Value are used as the candidate cluster heads of the nodes, and then Value is selected according to the formula (4)chjThe cluster head with the largest value is taken as the final cluster head, wherein EchaverIs the average value of the energy of the candidate cluster heads in the network. And the node Ni is directly added into the cluster where the cluster head is positioned.
When all the common nodes complete the election of the cluster head, the candidate cluster head which fails in election is elected and added according to the formulas (3) and (4) as the common nodes.
After the node determines the cluster head according to the formula (4), the node directly joins in the cluster where the cluster head is located, the cluster head does not need to broadcast the information which becomes the cluster head in the whole network range, and the cluster head can save more energy for collecting and forwarding data.
After the cluster is established, the cluster head adopts a TDMA mode to allocate cluster time slots for each member node, and the member nodes only send data to the cluster head in the specified time slots. And the cluster head performs data fusion on the data in the cluster and directly sends the data to the base station. The number of TDMA time slots of each cluster is larger than the number of member nodes, namely, a plurality of time slots are reserved for newly added nodes to use, and in addition, the number of reserved time slots can be determined by statistical analysis of the number of the newly added nodes obtained through simulation experiments. The mode of reserving the TDMA time slot greatly increases the expandability of the network, and when a new node joins the network, the node does not need to wait for the end of the cluster period and does not need to perform networking again. In addition, the cluster head node does not need to divide the TDMA time slot again, so that the efficiency of the network is improved, and the robustness of the network is improved.
B) First-choice of cluster-in-cluster crane
When the residual energy of all cluster heads in the network is larger than the threshold value EaIn the process, the cluster head election is not needed in the whole network range, and only new cluster heads need to be selected in each cluster. In the data transmission process in a cluster, cluster member nodes continuously send the residual energy information of the cluster member nodes to a cluster head, the cluster head calculates whether the residual energy of the cluster member nodes is larger than the average energy of the cluster member nodes, if the residual energy of the current cluster head is larger than the average residual energy of the cluster member nodes, the cluster member nodes continue to serve as the cluster head until the energy of the current cluster head is smaller than the average energy in the cluster, a new cluster head is selected by the current cluster head according to the residual energy of the cluster member nodes and the communication cost in the cluster, a new cluster head message is broadcasted to the member nodes in the cluster, and the member nodes modify the cluster head message of the cluster member nodes and continue to collect and send data.
According to the first-order radio model, the energy consumed by data transmission is in direct proportion to the square of the transmission distance of the data, so that the problem of minimum communication cost in a cluster is converted into the minimum of the sum of the distances from member nodes in the cluster to a cluster head node. D is shown in equation (5)ij 2J cluster member node representing i clusterMean of the sum of squares of distances to other nodes in the cluster, MiRepresenting the number of member nodes of the ith cluster.
First-choice cost of cluster-in clusterijThe smallest node as the cluster head, costijAs shown in equation (6):
wherein alpha and beta are constants between 0 and 1, R is the maximum communication radius of the node, EijIs the residual energy of the jth cluster member node of the ith cluster, Ei_averAnd averaging the residual energy of the nodes in the ith cluster.
C) Network expansion
When a new node is added into the network, the new node sends request information to surrounding cluster heads, and the cluster heads send own position information, residual energy, intra-cluster load and the like to the new node after receiving the request information. After receiving the information of each cluster head, the new node calculates the own network access permission value PchjTo determine its own attribution and join PchjAnd the cluster with the largest value is located. PchjIs calculated as shown in equation (7):
wherein E ischjThe more the remaining energy, the higher the probability that the cluster head is joined by the new node. L ischj
The load of the cluster head chj, namely the number of cluster members, n/m represents the average load of each cluster in the network, and the larger the current load of the cluster head is, the heavier the task is, the more energy is consumed, so that the probability of being selected as the cluster head by a new node is reduced. dchjIndicates the distance, d, from the new node to the cluster head chjchjThe more or lessThe less energy will be consumed by the new node to send data to the cluster head.
And after the new node selects the cluster head, sending a node joining message to the cluster head, and formally joining the cluster head. And after the cluster head receives the new node joining message, allocating a corresponding TDMA time slot for the new node, wherein the time slot is a reserved time slot, thereby completing the network access of the new node.
In the network clustering stage of the method, the setting of the threshold value of the candidate cluster head takes the residual energy of the node into consideration, thereby greatly reducing the probability of selecting the low-energy node as the candidate and avoiding the hot spot problem caused by excessive energy consumption of the node when the cluster head is selected for many times; in the process of selecting the cluster heads, the nodes select the three cluster heads with the minimum forwarding cost as the candidate cluster heads according to the sum of squares of paths through which the data are forwarded to the base station through the cluster heads, so that the problem of overlarge energy consumption caused by long distance of the data when the cluster heads are distributed more than usual can be solved. The node selects the candidate cluster head with large residual energy and more neighbor nodes from the three candidate cluster heads as the final cluster head of the node, so that the cluster head is ensured to have higher energy, and the cluster head is also ensured to be distributed in a relatively concentrated area of the node.
In the first selection stage of the cluster in the method, not only the residual energy of the nodes in the cluster is considered, but also the communication cost between the member nodes in the cluster and the cluster head is considered, so that the energy of the nodes in the cluster can be balanced, the low-energy nodes are prevented from being selected as the cluster head, the communication cost in the cluster is reduced, the energy is saved, and the life cycle of the network is effectively prolonged.
In the network expansion stage of the method, the network access permission values of the nodes are introduced, the selected cluster head node has better robustness to a new network access node by considering the energy and the distance of the cluster to be added, and the load distribution of the network is more uniform by considering the load value of the cluster. Meanwhile, a data sharing mechanism is introduced, the interaction amount of data in the network is reduced, and the calculated amount of the cluster head nodes is reduced because only the cluster head node closest to the newly accessed network node and the network access permission value of the cluster head node in one hop of the cluster head node are calculated, so that the requirement on energy saving in the existing network is better met. And the process can occur at any node of the network communication without waiting for a re-establishment to the cluster. And the new network access node uses the reserved time slot to transmit data without waiting for the end of each cluster cycle and without dividing the time slot again by the cluster head. The flexibility and the expandability of the network are enhanced. Meanwhile, energy consumption caused by network reconstruction when a new node accesses the network is reduced.
Finally, it should be noted that: although the present invention has been described in detail with reference to the foregoing embodiments, it should be understood by those skilled in the art that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (1)
1. An extensible networking method of a wireless sensor network is characterized in that: the method comprises the following steps: network clustering, cluster head election in a cluster and network expansion:
A) network clustering:
1) election of candidate cluster heads
Each node in the network randomly generates a random number of 0 to 1, compares the random number with a threshold value T (i) of the node, if the random number is less than the threshold value, the node is selected as a candidate cluster head, and the number of the nodes selected as the candidate cluster head is m, wherein
Wherein, p is the probability of the node being selected as the cluster head, r represents the number of rounds of the current node Ni which is not selected as the cluster head continuously, the probability of the node being selected as the cluster head is larger when r is larger, and r is 0, and represents that the cluster head is just selected by the node upper round; eiFor node Ni current remaining energy, E0Is the initial energy of the node; the larger the residual energy of the node is, the larger the value of T (n) is, and the electedThe greater the probability of being a cluster head;
2) cluster head election and member node joining
After the election of the candidate cluster head is completed, the node carries out selection according to the residual energy E of the candidate cluster headCH_Can(j)The number Nei of neighbor nodes of the candidate cluster headCH_Can(j)The average value Nei of the number of neighbor nodes of all candidate cluster heads in the networkaverRatio of the nodes to the candidate cluster head, and value degree d of each node to the candidate cluster headNi_chj_BS 2To select a cluster head; wherein the content of the first and second substances,
dNi_chj_BS 2＝dNi_chj 2+dChj_BS 2
wherein d isNi_chj 2Is the square of the distance from node Ni to cluster head chj, dChj_BS 2The square of the distance from the cluster head chj to the base station BS; d, since the data collected by the node Ni is forwarded to the BS by the cluster head nodeNi_chj_aS 2The smaller the value is, the smaller the total energy consumed by forwarding data by the cluster head chj is;
node Ni selects dNi_chj_BS 2The three nodes with the minimum Value are taken as the candidate cluster heads of the nodes, and then Value is selectedchjTaking the cluster head with the largest value as a final cluster head, and directly adding the node Ni into the cluster where the cluster head is located;
after the node determines the cluster head, the node directly joins the cluster where the cluster head is located, and the cluster head does not need to broadcast a message which becomes the cluster head in the whole network range, so that the cluster head can save more energy for collecting and forwarding data;
after the cluster is established, the cluster head adopts a TDMA mode to allocate a cluster time slot for each member node, and the member nodes only send data to the cluster head in the specified time slot; the cluster head performs data fusion on the data in the cluster and directly sends the data to the base station; the number of TDMA time slots of each cluster is greater than the number of member nodes, namely, a plurality of time slots are reserved for newly added nodes to use, and in addition, the number of reserved time slots can be determined by statistical analysis of the number of the newly added nodes obtained through simulation experiments; the mode of reserving the TDMA time slot greatly increases the expandability of the network, and when a new node joins the network, the cluster does not need to wait for the end of the cluster period and does not need to be networked again; in addition, the cluster head node does not need to divide the TDMA time slot again, so that the efficiency of the network is improved, and the robustness of the network is improved;
B) first-choice of cluster-in-cluster crane
When the residual energy of all cluster heads in the network is larger than the threshold value EaIn the process, cluster head election is not required to be carried out in the whole network range, and only new cluster heads are selected from each cluster; in the data transmission process in a cluster, a cluster member node continuously sends the residual energy information of the cluster member node to a cluster head, the cluster head calculates whether the residual energy of the cluster member node is larger than the average energy of the nodes in the cluster, if the residual energy of the current cluster head is larger than the average residual energy of the nodes in the cluster, the cluster member node continues to act as the cluster head until the energy of the current cluster head is smaller than the average energy in the cluster, the current cluster head selects a new cluster head according to the residual energy of the nodes in the cluster and the communication cost in the cluster, broadcasts a new cluster head message to the member nodes in the cluster, and the member nodes modify the cluster head message of the cluster member node and continue to acquire and send data;
C) network expansion
When a new node is added into the network, the new node sends request information to surrounding cluster heads, and the cluster heads send own position information, residual energy, intra-cluster load and the like to the new node after receiving the request information; after receiving the information of each cluster head, the new node calculates the own network access permission value PchjTo determine its own attribution and join PchjThe cluster with the largest value of the cluster head is located, wherein,
wherein E ischjThe cluster head with more residual energy is added with a new node with higher probability; l ischjThe load of the cluster head chj is the number of cluster members, n/m represents the average load of each cluster in the network, dchjIndicates the distance, d, from the new node to the cluster head chjchjThe smaller the energy consumption is, the less the new node transmits the data to the cluster head; after a new node selects a cluster head, sending a node joining message to the cluster head, and formally joining the cluster head in the cluster; and after the cluster head receives the new node joining message, the cluster head uses the reserved time slot to allocate the corresponding TDMA time slot for the new node, thereby completing the network access of the new node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610646972.7A CN107690168B (en) | 2016-08-04 | 2016-08-04 | Extensible networking method for wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610646972.7A CN107690168B (en) | 2016-08-04 | 2016-08-04 | Extensible networking method for wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107690168A CN107690168A (en) | 2018-02-13 |
| CN107690168B true CN107690168B (en) | 2021-03-12 |
Family
ID=61152127
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610646972.7A Active CN107690168B (en) | 2016-08-04 | 2016-08-04 | Extensible networking method for wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107690168B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109152103B (en) * | 2018-11-05 | 2021-02-05 | 哈尔滨理工大学 | Method and device for networking wireless sensor network |
| CN110121200B (en) * | 2019-05-09 | 2020-08-11 | 江南大学 | Energy-efficient networking method in heterogeneous sensor network |
| CN110198526B (en) * | 2019-05-30 | 2020-06-02 | 北京市众诚恒祥能源投资管理有限公司 | Combustor fault diagnosis system based on thing networking |
| CN112887947B (en) * | 2021-01-14 | 2021-12-03 | 南通大学 | Bluetooth Mesh clustering networking method for double-layer block chain |
| CN113626489B (en) * | 2021-08-10 | 2022-03-01 | 深圳市玄羽科技有限公司 | Method, system and computer medium for searching sensor data |
| CN116193535A (en) * | 2023-04-04 | 2023-05-30 | 南京邮电大学 | High-density wireless sensor network clustering method based on random channel |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20100073826A (en) * | 2008-12-23 | 2010-07-01 | 주식회사 케이티 | Method for clustering in large heterogeneous sensor networks |
| CN102158927A (en) * | 2011-05-20 | 2011-08-17 | 北京邮电大学 | Efficient inhomogeneous clustering routing method of wireless sensor network |
| CN104010336A (en) * | 2014-06-12 | 2014-08-27 | 河海大学常州校区 | Two-stage isomerism clustering underwater wireless sensor network and routing method thereof |
| CN104320796A (en) * | 2014-10-28 | 2015-01-28 | 河海大学常州校区 | Wireless sensor network data transmission method based on LEACH protocol |
| CN104936230A (en) * | 2015-06-15 | 2015-09-23 | 华侨大学 | Wireless sensor network energy balance route optimization method based on cluster head expectation |
-
2016
- 2016-08-04 CN CN201610646972.7A patent/CN107690168B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20100073826A (en) * | 2008-12-23 | 2010-07-01 | 주식회사 케이티 | Method for clustering in large heterogeneous sensor networks |
| CN102158927A (en) * | 2011-05-20 | 2011-08-17 | 北京邮电大学 | Efficient inhomogeneous clustering routing method of wireless sensor network |
| CN104010336A (en) * | 2014-06-12 | 2014-08-27 | 河海大学常州校区 | Two-stage isomerism clustering underwater wireless sensor network and routing method thereof |
| CN104320796A (en) * | 2014-10-28 | 2015-01-28 | 河海大学常州校区 | Wireless sensor network data transmission method based on LEACH protocol |
| CN104936230A (en) * | 2015-06-15 | 2015-09-23 | 华侨大学 | Wireless sensor network energy balance route optimization method based on cluster head expectation |
Non-Patent Citations (1)
| Title |
|---|
| 无线传感器网络路由协议研究;王莹莹；王亭;《互联网+应用》;20160220;54 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107690168A (en) | 2018-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107690168B (en) | Extensible networking method for wireless sensor network | |
| CN107690167B (en) | Extensible wireless sensor network clustering method | |
| Ruiz et al. | Survey on broadcast algorithms for mobile ad hoc networks | |
| Kumar et al. | A review of routing protocols in wireless sensor network | |
| CN103415018B (en) | Communication resource allocation method of wireless sensor network | |
| Kalaivanan et al. | Reliable location aware and Cluster-Tap Root based data collection protocol for large scale wireless sensor networks | |
| CN108541038B (en) | Routing method and system of wireless sensor network | |
| WO2018098750A1 (en) | Message transmission method in distributed network and node | |
| Tabatabaei et al. | Reliable routing algorithm based on clustering and mobile sink in wireless sensor networks | |
| Ramanan et al. | Data gathering algorithms for wireless sensor networks: a survey | |
| Mishra et al. | Survey on recent clustering algorithms in wireless sensor networks | |
| Erciyes et al. | Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks | |
| TWI473522B (en) | Method and system for hierarchical clustering of wireless sensor networks | |
| Khurana et al. | Wireless sensor network routing protocols: A survey | |
| Banerjee et al. | On state maintenance in cluster-based mobile ad-hoc networks | |
| WO2018098748A1 (en) | Communication method in distributed network, node, and system | |
| Soni et al. | An investigation on energy efficient routing protocol for wireless sensor network | |
| Wang et al. | A energy balanced routing scheme in wireless sensor networks based on non-uniform layered clustering | |
| WO2018098752A1 (en) | Message broadcast method for distributed network and node | |
| WO2018098749A1 (en) | Message broadcasting method in distributed network and node | |
| Patil et al. | Analysis of data aggregation techniques in wireless sensor networks | |
| CN107820256B (en) | Data transmission method based on D2D regional distribution technology | |
| US10374881B2 (en) | Method of network subscription in a wireless network | |
| Devasena et al. | A study of power and energy efficient clustering protocols in wireless sensor networks | |
| Jerbi et al. | A routing protocol orphan-leach to join orphan nodes in wireless sensor network |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230904 Address after: Room 1605, 16th Floor, Building 4, No. 19 Jingyuan Road, Shijingshan District, Beijing, 100043 Patentee after: Zhongke Zhixin (Beijing) Technology Co.,Ltd. Address before: 215000 604, building 5, No. 1301, Ganjiang West Road, Jinchang District, Suzhou City, Jiangsu Province Patentee before: Wang Yingying Patentee before: Wang Huixin |