CN102984715B - The network-building method of wireless sensor network - Google Patents
The network-building method of wireless sensor network Download PDFInfo
- Publication number
- CN102984715B CN102984715B CN201210533553.4A CN201210533553A CN102984715B CN 102984715 B CN102984715 B CN 102984715B CN 201210533553 A CN201210533553 A CN 201210533553A CN 102984715 B CN102984715 B CN 102984715B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- root
- sensor
- received power
- 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
Abstract
The invention discloses a kind of network-building method of wireless sensor network, comprise the following steps: each sensor node is set up and the connection of adjacent sensors node and received power table respectively by the mode of broadcast probe; According to the connection of root node, each sensor node is restrained to root node, and in convergence process, described node connects to merge successively to received power table and generates corresponding Link Feedback table packet, unifies convergence and is uploaded to root node; Root node, according to described Link Feedback table, is that each described sensor node distributes the backbone at its place and the node transmitting-receiving sequence number of branch link according to networking rule; The described node transmitting-receiving sequence number that each sensor node is assigned to according to it carries out networking.The present invention, utilizes the powerful computing ability of root node, to endpoint node downlink transmitting-receiving sequence number, achieves the planning networking to all nodes of the whole network, significantly reduces the Circnit Layout of node, simplify communication process, achieve the networking of optimization.
Description
Technical field
The present invention relates to wireless sensor network, be specifically related to the network-building method of wireless sensor network.
Background technology
Wireless sensor network (Wireless Sensor Network, be called for short WSN) refer to the wireless network be made up of in the mode of self-organizing and multi-hop the transducer of static or movement in a large number, its objective is that perception collaboratively, collection, process and transmission network cover the monitoring information of perceptive object in geographic area, be widely used in carrying out in the information system of monitor and forecast object and environment
Current wireless sensor network, modally realizes networking based on radio self organizing network technology, this technology, and high and networking is complicated to the Capability Requirement of node, concrete reason is as follows:
(1) the uncertain dynamic change of network topology structure, topology is set up complicated.
In wireless self-organization network, due to cause by residing environmental change affects node failure/lost efficacy/restart/find, because the mutual interference between the change of need of work contingent node start/shutdown/dormancy at any time, course of work interior joint emission of radio frequency signals modular power, wireless channel and other external environmental factors are on the impact of wireless channel, may change at any time based on the network topology structure of wireless channel foundation between node.And above-mentioned factor causes time of change, place, mode, frequency, process and even result, all cannot accurate estimating and forecasting.Therefore, networking is complicated.
(2) bandwidth affects by environmental change, and communication protocol is complicated.
In the wireless network, along with wireless channel between node competition, share and the factor such as signal collision, signal attenuation, noise jamming and channel disturbance that produces, the actual effective bandwidth after node networking can be made to be less than theoretical value.The design of inter-node communication agreement must take into full account the above overhead cost set up link, use channel, therefore brings complexity to a certain degree.
(3) node carries out self-organizing coequally, network without center, high to the Capability Requirement of node.
Except root node (often can occur with the form of gateway), in the node of wireless self-organization network, do not have a tight center of a lattice.All nodes status is in a network equality, node can add at any time or depart from network, its mode of operation can at endpoint node, switch between routing node and aggregation node, and any node breaks down all can not affect the operation of whole network, and the whole network has very strong robustness.Therefore, each node must possess certain Circnit Layout, battery capacity to provide necessary communication, calculating and disposal ability, may become situation compared with large discharge node in network to tackle it.
(4) multi-hop relay is utilized to form network, high to the Capability Requirement of node equally.
Due to transmitting power and the limited coverage area of individual node, when certain node will with its coverage outside node communication time, need to utilize the node be adjacent to carry out relaying, forwarding, even if this node is temporarily with the work pattern of endpoint node, also may because add the communication link that other nodes initiate foundation, and be converted to the pattern of routing node or aggregation node thereupon, this just requires that each node will possess the Circnit Layout corresponding to communication process, battery capacity and communication, calculating and disposal ability, participates in setting up this multi-hop, junction network.
As can be seen here, existing has wireless self-organization network, requires that node has self organizing function, and therefore, higher to the Capability Requirement of node, cost is large and networking is complicated.
Summary of the invention
Technical problem to be solved by this invention solves the problem that the Capability Requirement of wireless sensor network to node is higher and networking is complicated.
In order to solve the problems of the technologies described above, the technical solution adopted in the present invention is to provide a kind of network-building method of wireless sensor network, comprises the following steps:
In steps A 10, wireless sensor network, each sensor node N
oiset up respectively and adjacent sensors node N by the mode of broadcast probe
ojconnection and received power table P
oi, i is any one in 1 ~ N; J is any one in 1 ~ N-1, i ≠ j; N is the quantity of sensor node;
Steps A 20, according to root node N
rootconnection, each sensor node is to root node N
rootconvergence, in convergence process, described node connects to merge successively with received power table and generates m Link Feedback table packet, unifies convergence and is uploaded to root node N
root, m represents and root node N
rootthe number of nodes connected;
Steps A 30, described root node N
rootaccording to described Link Feedback table, be each described sensor node N
oidistribute the backbone at its place and the node transmitting-receiving sequence number of branch link;
Steps A 40, each described sensor node N
oithe described node transmitting-receiving sequence number be assigned to according to it carries out networking.
In the above-mentioned methods, described node connection with the concrete form of received power table packet is:
[node connects and received power list notation code] [N identifies] [barrier code] [N
o1mark] [N receives N
o1power] [barrier code] [N
o2mark] [N receives N
o2power] [barrier code] ... [barrier code] [N
ojmark] [N receives N
ojpower] [barrier code] N [N and N
o1, N
o2..., N
ojconnection relational table] [barrier code] [check code].
In the above-mentioned methods, the process of described convergence is from network edge frontier node, and according to convergence rule, the node gathered by way of each node along communication link connects and received power table, and merging data bag generates described Link Feedback table; The concrete composition form of described Link Feedback table packet is:
[Link Feedback list notation code] [N
e(N
o1) node connect with received power table] [barrier code] [N
o2(N
o1, N
o2..., N
oj) node connect with received power table] [barrier code] ... [barrier code] [check code], N
efor network edge frontier node, N
o1for N
eadjacent node, N
o2for N
o1adjacent node.
In the above-mentioned methods, described convergence rule is:
Receive packet from adjacent sensors node N2 first for time standard reference point with certain sensor node N1, this sensor node N1 abandons the packet from this adjacent sensors node N2 repeating to receive automatically afterwards.
In the above-mentioned methods, steps A 30 comprises the following steps:
Steps A 301, root node receive and gather the Link Feedback packet from each node, extract power and connection relational table that each sensor node receives adjacent sensors node respectively;
Steps A 302, the node that minimum or minimal network depth gauge calculates network optimum according to the whole network total power consumption forward route.
In the above-mentioned methods, the computational methods that described the whole network total power consumption is minimum are as follows:
Root node is according to the received power of extracted all the sensors node and connection relational table, the traversal of carrying out the whole network sensor node calculates, whole permutation and combination is generated according to annexation all available between all the sensors node, and all received powers corresponding to various permutation and combination are added up, the network topology that cumulative sum minimum value is corresponding and receiving-transmitting chain are that the node of network optimum forwards route.
In the above-mentioned methods, the computational methods of the described minimal network degree of depth are as follows:
Root node is according to the connection relational table of extracted all the sensors node, the traversal of carrying out the whole network sensor node is searched, arrange out all path lists of root node to overall network flange distal node, in whole result, finding out network topology corresponding to minimum hop count sum minimum value between root node to all flange distal nodes and receiving-transmitting chain is that the node of network optimum forwards route.
The present invention, for the application of wireless sensor network, the routing function of all nodes of the whole network in traditional radio self organizing network technology is removed and unifies to focus on root node, by the powerful computing ability of root node, to endpoint node downlink transmitting-receiving sequence number, achieve the planning networking to all nodes of the whole network, significantly reduce the Circnit Layout especially signal transmitting power consumption of node, simplify communication process, under the prerequisite not affecting full mesh topology foundation, inter-node communication effect, achieve the networking of optimization.
Accompanying drawing explanation
Fig. 1 is the flow chart that in the present invention, sensor node sets up the connection of its node and received power table;
Fig. 2 is the comparison schematic diagram of multiple transceiver path between two sensor nodes;
Fig. 3 is one and distributes schematic diagram for the Link Feedback of 5 sensor node simplified networks and link transmit-receive sequence number.
Embodiment
Be described in detail the present invention below in conjunction with Figure of description and specific embodiment, all node division in wireless sensor network are root node N in introducing by the following description
rootwith sensor node N
o, wherein root node N
rootrefer to the node possessing public network gateway function in the whole network node, possess route and aggregation feature, sensor node N
othen do not possess routing function, only possess simple forwarding capability, the sensor node be only connected with a sensor node is specifically called flange distal node N
e.
The network-building method of wireless sensor network provided by the invention realizes mainly through following steps:
In steps A 10, wireless sensor network, except root node N
rooteach sensor node N in addition
oipower on after start, by the mode of broadcast probe according to the transmission rate preset and transmitting power to adjacent sensors node N
ojbroadcast sends detection packet, is adjacent sensor node N
ojconnect and receive its feedback packet, the sensor node sending detection packet arranges all feedback packet received, and sets up sensor node N respectively
oiwith adjacent sensors node N
ojconnection and received power table P
oi.
Specifically, each sensor node N respectively
oito its adjacent sensors node N
o1, N
o2..., N
ojsend broadcast probe bag and receiving sensor node N
o1, N
o2..., N
ojfeedback packet, by arranging sensor node N
o1, N
o2..., N
ojfeedback packet generate each sensor node N
oirelative to adjacent sensors node N
o1, N
o2..., N
ojnode connect and be kept at corresponding sensor node N to received power table packet
oiin, as respective sensor node N
oiadjacent sensors node N all with it
o1, N
o2..., N
ojconnection and received power information.I is any one in 1 ~ N; J is any one in 1 ~ N-1, i ≠ j; N is the quantity of sensor node.
Such as: the node of node N connects and the concrete form of received power table packet is:
[node connects and received power list notation code] [N identifies] [barrier code] [N
o1mark] [N receives N
o1power] [barrier code] [N
o2mark] [N receives N
o2power] [barrier code] ... [barrier code] [N
ojmark] [N receives N
ojpower] [barrier code] N [N and N
o1, N
o2..., N
ojconnection relational table] [barrier code] [check code].
A kind of network topology structure of wireless sensor shown in Figure 1, in Fig. 1, sensor node Ni has two adjacent sensors nodes Nx, Ny.
First, Ni sends broadcast probe bag respectively to Nx, Ny; Nx, Ny beam back feedback packet to Ni after receiving the detection packet of Ni; Ni arranges out its node according to Nx, Ny feedback packet received again and connects and received power table.The node of Ni connects with received power table packet as follows:
[node connects and received power list notation code] [Ni identifies] [barrier code] [Nx identifies] [Ni receives the power of Nx] [barrier code] [Ny identifies] [Ni receives the power of Ny] [barrier code] Ni [connection relational table of Ni and Nx, Ny] [barrier code] [check code].
For the flange distal node N in network
e, its node connects and in received power table, the connection relational table of this node and adjacent sensors node only has one, such as, be expressed as Nb [annexation of Nb and Nc].That is, can know whether this sensor node is flange distal node by the connection relational table of node and adjacent sensors node.
Steps A 20, according to root node N
rootconnection, each sensor node is to root node N
rootconvergence, in convergence process, described node connects to merge successively with received power table and generates m Link Feedback table packet, unifies convergence and is uploaded to root node N
root, m represents and root node N
rootthe number of nodes of direct connection, the quantity of Link Feedback table packet is root node N
rootmultiple downstream node quantity, i.e. N
rootthere are how many downstream nodes, how many Link Feedback table packets will be generated.The concrete composition form of Link Feedback table packet is:
[Link Feedback list notation code] [N
e(N
o1) node connect with received power table] [barrier code] [N
o2(N
o1, N
o2..., N
oj) node connect with received power table] [barrier code] ... [barrier code] [check code], N
efor network edge frontier node, N
o1for N
eadjacent node, N
o2for N
o1adjacent node.
Instantiation as shown in Figure 3, flange distal node is Nj, and the concrete composition form of Link Feedback table packet is:
[Link Feedback list notation code] [connection of Nj (Nz) node and received power table] [barrier code] [Nz (Nj, Ni) node is connected and received power table] [barrier code] [Ni (Nz, Nx, Ny) node is connected and received power table] [barrier code] [check code].
Convergence process is from network edge frontier node, and the node gathered along road by way of each sensor node by unduplicated communication link is connected and received power table, constantly adds, merging data bag, and link generation feedback form is unified convergence and is uploaded to root node.
Because between numerous sensor node, the forwarding of Link Feedback table packet may exist multiple available communication linkage path, therefore, receiving-transmitting chain feedback form packet is repeatedly needed to avoid between two sensor nodes.For this reason, rule is set as follows:
Be time standard reference point with the packet that certain sensor node (as Ny) receives first from adjacent sensors node (as Nx), this sensor node Ny abandons the packet from adjacent sensors sensor node Nx repeating to receive automatically afterwards.This rule ensure that between sensor node Ny with adjacent sensors sensor node Nx by the most simply, the most uniquely transceiver path communicates.Like this, not only can avoid because repeating of being formed of the multipath effect (situation of Nx and Ny direct neighbor) by space reflection, refraction in point to point link process between sensor node Ny and adjacent sensors sensor node Nx receives packet, can also avoid receiving packet by way of repeating of being formed with the roundabout forwarding in longer path of other sensor nodes between two sensor nodes Nx, Ny.Such as: the example Nx shown in Fig. 2 sends packet and there is mulitpath, path 1:Nx-Ny to Ny reception, represent without forwarding; Path 2:Nx-No Ny, it is less that representative forwards jumping figure; Path 3:Nx-Np-Nq-Ny, it is more that representative forwards jumping figure, therefore, only selecting paths 1:Nx-Ny.
Steps A 30, root node N
rootaccording to Link Feedback table, be each described sensor node N according to networking rule
oidistribute the backbone at its place and the node transmitting-receiving sequence number of branch link;
Steps A 40, each sensor node N
oithe node transmitting-receiving sequence number be assigned to according to it carries out networking.
Steps A 30 comprises the following steps, and refers to Fig. 3:
Steps A 301, root node receive and gather the Link Feedback packet from each sensor node.For flange distal node Nj, connect with received power table packet at its node, extract " power that Nj receives Nz " and " connection relational table of Nj and Nz " respectively; For the node Ni of non-edge tip, in its " node connects and received power table " packet, extract " power that Ni receives Nx ", " Ni receives the power of Nz " and " Ni receives the power of Ny " and " connection relational table of Ni and Nx, Nz, Ny " respectively.
Steps A 302, according to one of following two kinds of networkings rule, the node that analysis meter calculates network optimum in root node forwards route.
Networking rule one: the whole network total power consumption minimum (sensor node all connect networking after, the transmitting power summation of all the sensors node is minimum).
Root node is according to the received power of extracted all the sensors node and connection relational table, the traversal of carrying out the whole network sensor node calculates, whole permutation and combination is generated according to annexation all available between all the sensors node, and all received powers corresponding to various permutation and combination are added up, in the accumulation calculating result of whole permutation and combination, find out the minimum value of cumulative sum (being also the received power summation of all sensors node), network topology corresponding to it and receiving-transmitting chain, for each sensor node distributes the sequence number of transceiver communication.
Networking rule two: the minimal network degree of depth (root node is connected to all flange distal nodes with minimum hop count).
Root node is according to the connection relational table of extracted all the sensors node, the traversal of carrying out the whole network sensor node is searched, arrange out all path lists of root node to overall network flange distal node, in whole result, find out the minimum value of the minimum hop count sum (being also the number of hops of root node to whole flange distal node) between root node to all flange distal nodes, network topology corresponding to it and receiving-transmitting chain, for each sensor node distributes the sequence number of transceiver communication.Then, root node according to the result of calculation of above-mentioned rule, can generate the link transmit-receive sequence number allocation table data bag for all sensors node, the link transmit-receive sequence number of sensor node is issued to the whole network.
Link transmit-receive sequence number allocation table data packet format is:
[link transmit-receive sequence number allocation table flag code] [Ni mark] [Ni receives and dispatches sequence number] [barrier code] ... [Nj mark] [Nj receives and dispatches sequence number] [barrier code] [check code].
For the situation that network topology is tree network and mesh network, the branch link residing in these complex networks according to all the sensors node, the whole network sensor node can be optimized combination by root node equally, generate in branch's sensor node " the link transmit-receive sequence number allocation table " of multiple dimension, issued respectively by branch's sensor node, thus form each subnet in logic respectively.
The concrete steps of steps A 40 are as follows:
Sensor node Ni in network receives " link transmit-receive sequence number allocation table ", search " Ni mark " and read " Ni receives and dispatches sequence number " thereafter, after formal communication starts, with reference to the transmitting-receiving sequence number that it is assigned to, according to its existing " node connects and received power table ", select and receive uniquely from the node data bag of a upper transmitting-receiving sequence number.
The node Nj of network edge tip receives " link transmit-receive sequence number allocation table ", search " Nj mark " and read " Nj receives and dispatches sequence number " thereafter, after formal communication starts, according to its existing " node connects and received power table ", select and send packet to the node of next transmitting-receiving sequence number unique.
Outside above-mentioned constructing communication network process, free time section before communication process startup each time, root node can also connect according to the node in " the Link Feedback table " after real-time update and receive and dispatch the information such as power, start according to the real needs of network planning and optimization, carry out above-mentioned planning networking, lost efficacy for the instant sensor node occurred, the Network Topology for Real-Time change that the factors such as channel degradation cause, again collect, calculate, plan and be handed down to the new link transmit-receive sequence number of each effective sensor node, to set up new network structure to realize optimal communication efficiency.This process to be sent to its adjacent sensors node by root node restarts packet to start, and the adjacent sensors node of each root node receives and forwards (but not repeating to forward) this restarts packet to its adjacent sensors node.Each receiving node is transmitted to its adjacent sensors node according to this afterwards.Restart packet and can comprise the node configuration information such as " forwarding rate ", " transmitting power ".
This method is applicable to chain-shaped network, tree network, loop network, mesh network four kinds of topological structures, forms one or more signal transmitting and receiving link according to this topological structure at the whole network.
Chain-shaped network:
Form the chain-shaped network that connects all nodes, except root node and endpoint node, other nodes are to be received and dispatched back-to-back.
Tree network:
Form the tree network that some backbone add its branch link, the branch link that each backbone is shunted out by branch node can become separately local links's mesh network.Each branch link can first converge to branch node and enter backbone, and then converges to root node.
Loop network:
Looped network centered by root node, can separate by looped network, regards as the chain-shaped network that a section comprises whole node.Embodiment is afterwards identical with chain-shaped network.
Mesh network:
Mesh network physically, also can pass through this method, forms the network of a chain or tree-shaped (being also multiple chain).Embodiment is afterwards identical with tree network with chain-shaped network.
The present invention is owing to taking above technical scheme, and it has the following advantages:
(1) communicating in wireless sensor network infrequently, can before sensor node formally communicates, the sensor node carrying out the whole network finds and topology detection, the planning organization to whole network is realized by root node, instead of the self-organizing to be realized by the complicated Routing Protocol between sensor node, to improve networking efficiency.
(2), when not having communication service to run between wireless sensor network, also can utilize idle wireless channel, carry out the topology detection of the whole network, with the sensor node that notes abnormalities in advance, and report root node.Be convenient to like this carry out the higher maintenance of real-time to the whole network node, instead of carry out noting abnormalities in process sensor node in the discovery of traditional sensor node and self-organization of network.
(3) by route that sensor node in traditional radio self organizing network technology possesses, move on to root node to realize on aggregation feature is whole, sequence number is received and dispatched by the communication link of root node specified sensor node, sensor node is without the need to possessing routing function, only need possess simple forwarding capability, greatly can reduce the complexity of sensor node, comprise the computational speed of sensor node processes device, ability and memory size, simplify control and process that node receives and dispatches its radiofrequency signal, reduce the design cost of sensor node, simplify the Networking protocol of sensor node, thus reduce the complexity of networking and communication.
The present invention is not limited to above-mentioned preferred forms, and anyone should learn the structural change made under enlightenment of the present invention, and every have identical or close technical scheme with the present invention, all falls within protection scope of the present invention.
Claims (3)
1. the network-building method of wireless sensor network, is characterized in that, comprises the following steps:
In steps A 10, wireless sensor network, each sensor node N
oiset up respectively and adjacent sensors node N by the mode of broadcast probe
ojconnection and received power table P
oi, i is any one in 1 ~ N; J is any one in 1 ~ N-1, i ≠ j; N is the quantity of sensor node;
The node of node N connects:
[node connects and received power list notation code] [N identifies] [barrier code] [N
o1mark] [N receives N
o1power] [barrier code] [N
o2mark] [N receives N
o2power] [barrier code] ... [barrier code] [N
ojmark] [N receives N
ojpower] [barrier code] N [N and N
o1, N
o2..., N
ojconnection relational table] [barrier code] [check code];
Steps A 20, according to root node N
rootconnection, each sensor node is to root node N
rootconvergence, in convergence process, described node connects to merge successively with received power table and generates m Link Feedback table packet, unifies convergence and is uploaded to root node N
root, m represents and root node N
rootthe number of nodes connected;
The process of described convergence is from network edge frontier node, and according to convergence rule, the node gathered by way of each node along communication link connects and received power table, and merging data bag generates described Link Feedback table; The concrete composition form of described Link Feedback table packet is:
[Link Feedback list notation code] [N
e(N
o1) node connect with received power table] [barrier code] [N
o2(N
o1, N
o2..., N
oj) node connect with received power table] [barrier code] ... [barrier code] [check code], N
efor network edge frontier node, N
o1for N
eadjacent node, N
o2for N
o1adjacent node;
Steps A 30, described root node N
rootaccording to described Link Feedback table, be each described sensor node N according to networking rule
oidistribute the backbone at its place and the node transmitting-receiving sequence number of branch link;
Steps A 40, each described sensor node N
oithe described node transmitting-receiving sequence number be assigned to according to it carries out networking;
Steps A 30 comprises the following steps:
Steps A 301, root node receive and gather the Link Feedback packet from each node, extract power and connection relational table that each sensor node receives adjacent sensors node respectively;
Steps A 302, the node that minimum or minimal network depth gauge calculates network optimum according to the whole network total power consumption forward route;
The computational methods that described the whole network total power consumption is minimum are as follows:
Root node is according to the received power of extracted all the sensors node and connection relational table, the traversal of carrying out the whole network sensor node calculates, whole permutation and combination is generated according to annexation all available between all the sensors node, and all received powers corresponding to various permutation and combination are added up, the network topology that cumulative sum minimum value is corresponding and receiving-transmitting chain are that the node of network optimum forwards route.
2. the network-building method of wireless sensor network as claimed in claim 1, it is characterized in that, described convergence rule is:
Receive packet from adjacent sensors node Nx first for time standard reference point with certain sensor node Ny, this sensor node Ny abandons the packet from this adjacent sensors node Nx repeating to receive automatically afterwards.
3. the network-building method of wireless sensor network as claimed in claim 1, it is characterized in that, the computational methods of the described minimal network degree of depth are as follows:
Root node is according to the connection relational table of extracted all the sensors node, the traversal of carrying out the whole network sensor node is searched, arrange out all path lists of root node to overall network flange distal node, in whole result, finding out network topology corresponding to minimum hop count sum minimum value between root node to all flange distal nodes and receiving-transmitting chain is that the node of network optimum forwards route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210533553.4A CN102984715B (en) | 2012-12-11 | 2012-12-11 | The network-building method of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210533553.4A CN102984715B (en) | 2012-12-11 | 2012-12-11 | The network-building method of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102984715A CN102984715A (en) | 2013-03-20 |
| CN102984715B true CN102984715B (en) | 2015-08-19 |
Family
ID=47858357
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210533553.4A Active CN102984715B (en) | 2012-12-11 | 2012-12-11 | The network-building method of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102984715B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104640180A (en) * | 2014-08-29 | 2015-05-20 | 湖南信息职业技术学院 | General random event capture scheduling calculation method in rechargeable wireless sensor network |
| CN105491646A (en) * | 2015-11-20 | 2016-04-13 | 上海斐讯数据通信技术有限公司 | Self-networking method and system for wireless sensor network and wireless sensor network |
| CN105763364B (en) * | 2016-01-21 | 2018-12-07 | 上海岂控信息科技有限公司 | A method of multiple child node large-scale network-estabilishings based on 2.4G chip |
| CN108072150A (en) * | 2016-11-14 | 2018-05-25 | 浙江盾安自控科技有限公司 | A kind of narrowband networking temperature control system and its network-building method |
| CN106507506B (en) * | 2016-12-06 | 2018-06-12 | 无锡悟莘科技有限公司 | A kind of wireless sensor network network-building method |
| CN107018582A (en) * | 2017-04-18 | 2017-08-04 | 深圳市慧联通信技术有限公司 | A kind of meter network-building method and its system |
| CN107026776A (en) * | 2017-04-20 | 2017-08-08 | 深圳拓邦股份有限公司 | A kind of communication path collocation method, apparatus and system |
| CN107770833B (en) * | 2017-10-27 | 2020-10-27 | 上海感悟通信科技有限公司 | Networking method and medium for wireless self-organizing network system |
| CN110430546A (en) * | 2019-07-12 | 2019-11-08 | 重庆电子工程职业学院 | A kind of anti-interference optimization system of wireless sensor network |
| CN113155182A (en) * | 2021-03-04 | 2021-07-23 | 东莞理工学院 | Multifunctional intelligent sensor and building structure performance monitoring system based on same |
| WO2024000482A1 (en) * | 2022-06-30 | 2024-01-04 | 华为技术有限公司 | Network topology construction method and apparatus |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1728725A (en) * | 2004-07-29 | 2006-02-01 | 三星电子株式会社 | Change the adaptive method of redistributing node address according to wireless network capacitance |
| CN101252538A (en) * | 2008-04-03 | 2008-08-27 | 清华大学 | Method of distributed real time detecting wireless self-grouping network topological structure |
| CN101420463A (en) * | 2007-10-25 | 2009-04-29 | 厦门大学 | Wireless sensor network address allocation mechanism |
| CN101895956A (en) * | 2010-08-05 | 2010-11-24 | 中国兵器工业第二〇五研究所 | Data transmission method of multilayer distributed wireless sensor network |
| CN102711209A (en) * | 2012-06-01 | 2012-10-03 | 广州市香港科大霍英东研究院 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
-
2012
- 2012-12-11 CN CN201210533553.4A patent/CN102984715B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1728725A (en) * | 2004-07-29 | 2006-02-01 | 三星电子株式会社 | Change the adaptive method of redistributing node address according to wireless network capacitance |
| CN101420463A (en) * | 2007-10-25 | 2009-04-29 | 厦门大学 | Wireless sensor network address allocation mechanism |
| CN101252538A (en) * | 2008-04-03 | 2008-08-27 | 清华大学 | Method of distributed real time detecting wireless self-grouping network topological structure |
| CN101895956A (en) * | 2010-08-05 | 2010-11-24 | 中国兵器工业第二〇五研究所 | Data transmission method of multilayer distributed wireless sensor network |
| CN102711209A (en) * | 2012-06-01 | 2012-10-03 | 广州市香港科大霍英东研究院 | Dynamic self-organizing hierarchical routing method applied to wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102984715A (en) | 2013-03-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102984715B (en) | The network-building method of wireless sensor network | |
| Youssef et al. | Overlapping multihop clustering for wireless sensor networks | |
| CN102281558B (en) | Wireless sensor networking method applied to data transmission of internet of things | |
| CN103887886B (en) | A kind of power network detection system based on sensor network and method | |
| Durairaj et al. | Two-level clustering and routing algorithms to prolong the lifetime of wind farm-based WSN | |
| CN103999510A (en) | Assisted intelligent routing for minimalistic connected object networks | |
| CN101917752B (en) | Convergent routing method of wireless sensor network based on Pareto optimum paths | |
| CN103826281A (en) | Micropower wireless communication routing algorithm and networking method based on field intensity information | |
| CN103889020A (en) | Wireless sensor network system based on dynamic routing and method thereof | |
| CN103582065A (en) | Efficient ad hoc network routing method for wireless sensor network | |
| Varshney et al. | Leach based hierarchical routing protocol for monitoring of over-ground pipelines using linear wireless sensor networks | |
| Micheletti et al. | CER-CH: combining election and routing amongst cluster heads in heterogeneous WSNs | |
| CN105744587A (en) | Data transmission method and device for linear wireless sensor network | |
| CN103281708A (en) | Wireless sensor node deploying method | |
| Talele et al. | A survey on data routing and aggregation techniques for wireless sensor networks | |
| Hawbani et al. | GLT: Grouping based location tracking for object tracking sensor networks | |
| Zhang et al. | A hybrid approach using mobile element and hierarchical clustering for data collection in WSNs | |
| CN107431910A (en) | For managing the technology for the heterogeneous nodes for being configured to support homogeneous communication agreement | |
| CN102413471B (en) | Networking method of wireless grid sensor based on link stability estimation | |
| KR20120068587A (en) | Power management apparatus for network and power management method for the same | |
| CN101640929A (en) | Anti-interference method of wireless mesh network on the basis of power control | |
| KR101669726B1 (en) | Data Gathering System | |
| CN104159265A (en) | Data transmission method for low-speed wireless Ad Hoc network | |
| Khan et al. | Mobile collector aided energy reduced (MCER) data collection in agricultural wireless sensor networks | |
| Tan et al. | A distributed and dynamic data gathering protocol for sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 430074, No. 88, postal academy road, Hongshan District, Hubei, Wuhan Patentee after: Wuhan post and Telecommunications Science Research Institute Co., Ltd. Address before: 430074, No. 88, postal academy road, Hongshan District, Hubei, Wuhan Patentee before: Wuhan Inst. of Post & Telecom Science |
|
| CP01 | Change in the name or title of a patent holder |