CN102984715A - Networking method for wireless sensor network - Google Patents
Networking method for wireless sensor network Download PDFInfo
- Publication number
- CN102984715A CN102984715A CN2012105335534A CN201210533553A CN102984715A CN 102984715 A CN102984715 A CN 102984715A CN 2012105335534 A CN2012105335534 A CN 2012105335534A CN 201210533553 A CN201210533553 A CN 201210533553A CN 102984715 A CN102984715 A CN 102984715A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- root
- sensor
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a networking method for a wireless sensor network, which comprises the following steps that sensor nodes establish connection and reception power tables with adjacent sensor nodes in a broadcast detection way; the sensor nodes converge towards a root node according to a connection situation of the root node; the connection tables and reception power tables of the nodes are combined in sequence to generate corresponding link feedback table data packets in a converging process; the data packets are gathered to be uploaded to the root node; the root node dispatches node transmitting-receiving sequence numbers of main links and branch links where the sensor nodes are located for the sensor nodes according to link feedback tables and networking rules; and networking of the sensor nodes is conducted according to the dispatched node transmitting-receiving sequence numbers. According to the method, link transmitting-receiving sequence numbers are issued to end nodes by taking advantages of the strong calculation processing capacity of the root node, plan networking of all the nodes in a whole network is realized, the circuit configuration of the nodes is greatly reduced, a communication process is simplified, and the networking is optimized.
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 that consisted of in the mode of self-organizing and multi-hop by a large amount of static or mobile transducers, its objective is that collaboratively perception, collection, processing and transmission network cover the monitoring information of perceptive object in the geographic area, in the information system that is widely used in object and environment are monitored and controlled
Present wireless sensor network, the modal radio self organizing network technology that is based on is realized networking, this technology, complicated to Capability Requirement height and the networking of node, concrete reason is as follows:
(1) the uncertain dynamic change of network topology structure, topology is set up complicated.
In the wireless self-organization network, owing to the node failure that affected by environmental change of living in to cause/lost efficacy/restart/find, because of the impact on wireless channel of the at any time variation of node emission of radio frequency signals modular power in contingent node start/shutdown/dormancy, the course of work of need of work, phase mutual interference between wireless channel and other external environmental factors, the network topology structure of setting up based on wireless channel between the node may change at any time.And above-mentioned factor causes time, place, mode, frequency, process and even the result who changes, all accurate estimating and forecasting.Therefore, networking is complicated.
(2) bandwidth is affected by environmental change, and communication protocol is complicated.
In wireless network, along with the competition of wireless channel between node, share and the factors such as signal collision, signal attenuation, noise jamming and channel disturbance that produce, can make actual effective bandwidth behind the node networking less than theoretical value.The design of inter-node communication agreement must take into full account the above expense cost of setting up link, using channel, has therefore brought complexity to a certain degree.
(3) node carries out self-organizing coequally, and is without central site network, high to the Capability Requirement of node.
Except root node (often can occurring with the form of gateway), in the node of wireless self-organization network, do not have a strict center.The status of all nodes in network is equality, node can add or break away from network at any time, its mode of operation is switched between node, routing node and the aggregation node endways, and arbitrary node breaks down 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 so that necessary communication, calculating and disposal ability, the situation that may become larger flow node in the network to tackle it to be provided.
(4) utilize multi-hop relay to form network, the Capability Requirement to node is high equally.
Because transmitting power and the limited coverage area of individual node, when certain node will with its coverage outside node communication the time, need to utilize the node that is adjacent to carry out relaying, forwarding, even if the temporary transient work pattern with endpoint node of this node, also may be because add the communication link that other nodes are initiated foundation, and be converted to the pattern of routing node or aggregation node thereupon, this just require each node will possess with the corresponding Circnit Layout of communication process, battery capacity and communicate by letter, calculating and disposal ability, participate in setting up this multi-hop, junction network.
This shows that existing have a wireless self-organization network, requires node to have self organizing function, 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 is to solve wireless sensor network to the problem that Capability Requirement is higher and networking is complicated of node.
In order to solve the problems of the technologies described above, the technical solution adopted in the present invention provides a kind of network-building method of wireless sensor network, may further comprise the steps:
In steps A 10, the 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 among 1～N; J is any among 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 the convergence process, described node connects with the received power table and merges successively m link feedback form packet of generation, and unified converging is uploaded to root node N
Root, m represents and root node N
RootThe number of nodes that connects;
Steps A 30, described root node N
RootAccording to described link feedback form, be each described sensor node N
OiThe node transmitting-receiving sequence number of distributing trunk link and branch's link at its place;
Steps A 40, each described sensor node N
OiCarry out networking according to its described node transmitting-receiving sequence number that is assigned to.
In said method, described node connects and the concrete form of received power table packet is:
[node connects and received power list notation code] [N sign] [barrier code] [N
O1Sign] [N receives N
O1Power] [barrier code] [N
O2Sign] [N receives N
O2Power] [barrier code] ... [barrier code] [N
OjSign] [N receives N
OjPower] [barrier code] N[N and N
O1, N
O2..., N
OjConnection relational table] [barrier code] [check code].
In said method, the process of described convergence is from the network edge frontier node, and according to convergence rule, the node that gathers by way of each node along communication link connects and the received power table, and the merging data bag generates described link feedback form; The concrete composition form of described link feedback form packet is:
[link feedback form flag code] [N
e(N
O1) node connection and received power table] [barrier code] [N
O2(N
O1, N
O2..., N
Oj) node connection and received power table] [barrier code] ... [barrier code] [check code], N
eBe network edge frontier node, N
O1Be N
eAdjacent node, N
O2Be N
O1Adjacent node.
In said method, described convergence rule is:
Receive first packet from adjacent sensors node N2 as the time standard reference point take certain sensor node N1, this sensor node N1 abandons the packet from this adjacent sensors node N2 that repeats to receive automatically afterwards.
In said method, steps A 30 may further comprise the steps:
Steps A 301, root node receive and gather link feedback data packet from each node, extract respectively power and connection relational table that each sensor node receives the adjacent sensors node;
Steps A 302, the node that minimum or minimal network depth gauge is calculated network optimum according to the whole network total power consumption are transmitted route.
In said method, the computational methods that described the whole network total power consumption is minimum are as follows:
Root node is according to received power and the connection relational table of all the sensors node that extracts, carrying out the traversal of the whole network sensor node calculates, generate whole permutation and combination according to whole available annexations between all the sensors node, and corresponding all received powers of various permutation and combination are added up, the node that the network topology that cumulative sum minimum value is corresponding and receiving-transmitting chain are network optimum is transmitted route.
In said method, the computational methods of the described minimal network degree of depth are as follows:
Root node is according to the connection relational table of all the sensors node that extracts, carrying out the traversal of the whole network sensor node searches, put out root node in order to all path lists of overall network flange distal node, in whole results, find out the node forwarding route that root node is network optimum to network topology corresponding to the minimum hop count sum minimum value between all flange distal nodes and receiving-transmitting chain.
The present invention, application for wireless sensor network, the routing function of all nodes of the whole network in traditional radio self organizing network technology is removed and the unified root node that focuses on, powerful computing ability by root node, endpoint node is issued the link transmit-receive sequence number, realized the planning networking to all nodes of the whole network, the Circnit Layout that has greatly reduced node is signal emission power consumption especially, simplified communication process, under the prerequisite that does not affect full mesh topology foundation, inter-node communication effect, realized the networking of optimizing.
Description of drawings
Fig. 1 is the flow chart that sensor node is set up its node connection and received power table among the present invention;
Fig. 2 is the comparison schematic diagram in multiple transmitting-receiving path between two sensor nodes;
Fig. 3 is that link feedback and a link transmit-receive sequence number as an example of 5 sensor node simplified networks example is distributed schematic diagram.
Embodiment
Below in conjunction with Figure of description and specific embodiment the present invention is made detailed explanation, the following description is root node N with all node division in the wireless sensor network in introducing
RootWith sensor node N
o, root node N wherein
RootRefer to possess in the whole network node the node of public network gateway function, possess route and aggregation feature, sensor node N
oThen do not possess routing function, only possess simple forwarding capability, the sensor node that only links to each other with a sensor node specifically is called flange distal node N
e
The network-building method of wireless sensor network provided by the invention is mainly realized by following steps:
In steps A 10, the wireless sensor network, except root node N
RootEach sensor node N in addition
OiPower on after the start, the mode by broadcast probe according to default transmission rate and transmitting power to adjacent sensors node N
OjDetection packet is sent in broadcasting, is adjacent sensor node N
OjConnect and receive its feedback packet, send the sensor node of detection packet and put the feedback packet that all receive in order, set up respectively sensor node N
OiWith adjacent sensors node N
OjConnection and received power table P
Oi
Specifically, each sensor node difference N
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 arrangement sensor node N
O1, N
O2..., N
OjFeedback packet generate each sensor node N
OiWith respect to adjacent sensors node N
O1, N
O2..., N
OjNode connect with received power table packet and be kept at corresponding sensor node N
OiIn, as respective sensor node N
OiWith its all adjacent sensors node N
O1, N
O2..., N
OjConnection and received power information.I is any among 1～N; J is any among 1～N-1, i ≠ j; N is the quantity of sensor node.
For example: 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 sign] [barrier code] [N
O1Sign] [N receives N
O1Power] [barrier code] [N
O2Sign] [N receives N
O2Power] [barrier code] ... [barrier code] [N
OjSign] [N receives N
OjPower] [barrier code] N[N and N
O1, N
O2..., N
OjConnection relational table] [barrier code] [check code].
See also a kind of network topology structure of wireless sensor shown in Figure 1, among Fig. 1, sensor node Ni has two adjacent sensors node Nx, Ny.
At first, Ni sends the broadcast probe bag to Nx, Ny respectively; Nx, Ny beam back feedback packet to Ni after receiving the detection packet of Ni; Ni puts out its node in order according to the Nx, the Ny feedback packet that receive again and connects and the received power table.The node of Ni connects with received power table packet as follows:
The connection relational table of [node connects and received power list notation code] [Ni sign] [barrier code] [Nx sign] [Ni receives the power of Nx] [barrier code] [Ny sign] [Ni receives the power of Ny] [barrier code] Ni[Ni and Nx, Ny] [barrier code] [check code].
For the flange distal node N in the network
e, the connection relational table of this node and adjacent sensors node only has one in its node connection and the received power table, for example is expressed as the annexation of Nb[Nb and Nc].That is to say, can know whether this sensor node is the 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 the convergence process, described node connects with the received power table and merges successively m link feedback form packet of generation, and unified converging is uploaded to root node N
Root, m represents and root node N
RootDirect-connected number of nodes, the quantity of link feedback form packet is root node N
RootA plurality of downstream node quantity, i.e. N
RootWhat downstream nodes are arranged, will generate what link feedback form packets.The concrete composition form of link feedback form packet is:
[link feedback form flag code] [N
e(N
O1) node connection and received power table] [barrier code] [N
O2(N
O1, N
O2..., N
Oj) node connection and received power table] [barrier code] ... [barrier code] [check code], N
eBe network edge frontier node, N
O1Be N
eAdjacent node, N
O2Be N
O1Adjacent node.
Instantiation as shown in Figure 3, flange distal node are Nj, and the concrete composition form of link feedback form packet is:
[link feedback form flag code] [Nj (Nz) node connects and the received power table] [barrier code] [Nz (Nj, Ni) node is connected and the received power table] [barrier code] [Ni (Nz, Nx, Ny) node is connected and the received power table] [barrier code] [check code].
Convergence process is from the network edge frontier node, and the node that gathers along the road by way of each sensor node by unduplicated communication link connects and the received power table, continuous adding, merging data bag, and the unification of link generation feedback form is converged and is uploaded to root node.
Because may there be multiple available communication linkage path in the forwarding of link feedback form packet between numerous sensor nodes, therefore, need to avoid between two sensor nodes repeatedly receiving-transmitting chain feedback form packet.For this reason, be set as follows rule:
Receive first packet from adjacent sensors node (such as Nx) as the time standard reference point take certain sensor node (such as Ny), this sensor node Ny abandons the packet from adjacent sensors sensor node Nx that repeats to receive automatically afterwards.This rule has guaranteed to communicate by the simplest, the most efficient unique transmitting-receiving path between sensor node Ny and the adjacent sensors sensor node Nx.Like this, not only can avoid because the repetition receive data bag of multipath effect (situation of Nx and the Ny direct neighbor) formation by space reflection, refraction in the point to point link process between sensor node Ny and the adjacent sensors sensor node Nx, can also avoid between two sensor node Nx, Ny the repetition receive data bag that forms with forwarding that longer path was made a circulation by way of other sensor nodes.For example: example Nx shown in Figure 2 sends packet and has mulitpath to the Ny reception, and path 1:Nx-Ny represents without transmitting; Path 2:Nx-No Ny, it is less that jumping figure is transmitted in representative; Path 3:Nx-Np-Nq-Ny, it is more that jumping figure is transmitted in representative, therefore, selecting paths 1:Nx-Ny only.
Steps A 30, root node N
RootAccording to the link feedback form, be each described sensor node N according to the networking rule
OiThe node transmitting-receiving sequence number of distributing trunk link and branch's link at its place;
Steps A 40, each sensor node N
OiCarry out networking according to its node transmitting-receiving sequence number that is assigned to.
Steps A 30 may further comprise the steps, and sees also Fig. 3:
Steps A 301, root node receive and gather link feedback data packet from each sensor node.For flange distal node Nj, in its node connection and received power table packet, extract respectively " power that Nj receives Nz " and " connection relational table of Nj and Nz "; Node Ni for non-flange distal, in its " node connects and the received power table " packet, extract respectively " 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 ".
Steps A 302, according to one of following two kinds of networking rules, the node that analysis meter is calculated network optimum in root node is transmitted route.
Networking rule one: the whole network total power consumption minimum (after sensor node all connected networking, the transmitting power summation of all the sensors node was minimum).
Root node is according to received power and the connection relational table of all the sensors node that extracts, carrying out the traversal of the whole network sensor node calculates, generate whole permutation and combination according to whole available annexations between all the sensors node, and corresponding all received powers of 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 (also being the received power summation of all sensors node), according to its corresponding network topology and receiving-transmitting chain, distribute the sequence number of transceiver communication for each sensor node.
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 all the sensors node that extracts, carrying out the traversal of the whole network sensor node searches, put out root node in order to all path lists of overall network flange distal node, in whole results, find out root node to the minimum value of the minimum hop count sum between all flange distal nodes (also being the number of hops that root node arrives whole flange distal nodes), according to its corresponding network topology and receiving-transmitting chain, distribute the sequence number of transceiver communication for each sensor node.Then, root node can be according to the result of calculation of above-mentioned rule, generates the link transmit-receive sequence number allocation table data bag for all sensors node, and 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 sign] [Ni receives and dispatches sequence number] [barrier code] ... [Nj sign] [Nj receives and dispatches sequence number] [barrier code] [check code].
The situation of tree network and mesh network for network topology, according to all the sensors node residing branch link in these complex networks, root node can be optimized combination with the whole network sensor node equally, in branch's sensor node, generate " the link transmit-receive sequence number allocation table " of a plurality of dimensions, issue respectively by branch's sensor node, thereby form respectively each subnet in logic.
The concrete steps of steps A 40 are as follows:
Sensor node Ni in the network receives " link transmit-receive sequence number allocation table ", search " Ni sign " and read thereafter " Ni receives and dispatches sequence number ", after the formal communication beginning, with reference to its transmitting-receiving sequence number that is assigned to, according to its existing " node connects and the received power table ", select and receive unique node data bag from a upper transmitting-receiving sequence number.
The node Nj of network edge tip receives " link transmit-receive sequence number allocation table ", search " Nj sign " and read thereafter " Nj receives and dispatches sequence number ", after the formal communication beginning, according to its existing " node connects and the received power table ", selection also sends packet to the node of unique next transmitting-receiving sequence number.
Outside above-mentioned constructing communication network process, free time section before communication process starts each time, root node can also be according to information such as the connection of the node in " link feedback form " after the real-time update and transmitting-receiving power, real needs according to network planning and optimization start, carry out above-mentioned planning networking, sensor node for instant generation lost efficacy, the Network Topology for Real-Time that the factors such as channel degradation cause changes, again collect, calculate, planning also is handed down to the new link transmit-receive sequence number of each effective sensor node, realizes optimal communication efficiency to set up new network structure.This process is sent to its adjacent sensors node by root node and is restarted packet and start, and the adjacent sensors node of each root node receives and transmit (but not repeating to transmit), and 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 informations such as " forwarding rate ", " transmitting power ".
This method forms one or more signal transmitting and receiving link according to this topological structure at the whole network applicable to chain-shaped network, tree network, loop network, four kinds of topological structures of mesh network.
Chain-shaped network:
Form a chain-shaped network that connects all nodes, except root node and endpoint node, other nodes are back-to-back transmitting-receiving.
Tree network:
Form the tree network that some trunk links add its branch's link, branch's link of shunting out by branch node on each bar trunk link can become separately local links's mesh network.Each bar branch link can converge to first branch node and enter the trunk link, and then converges to root node.
Loop network:
Looped network can separate looped network centered by root node, regards one section chain-shaped network that comprises whole nodes as.Embodiment afterwards is 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 (also being a plurality of chains).Embodiment afterwards is identical with chain-shaped network and tree network.
The present invention is owing to take above technical scheme, and it has the following advantages:
(1) in communication not frequently in the wireless sensor network, can be before sensor node formally communicates, carrying out the sensor node of the whole network finds and topology detection, by the planning organization of root node realization to whole network, rather than the self-organizing that is realized by the complicated Routing Protocol between the sensor node, to improve networking efficient.
When (2) between wireless sensor network, not having the communication service operation, 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 whole network node is carried out the higher maintenance of real-time, rather than carry out the sensor node that notes abnormalities in the process at traditional sensor node discovery and self-organization of network.
(3) route that sensor node in traditional radio self organizing network technology is possessed, moving on to root node on aggregation feature is whole realizes, communication link transmitting-receiving sequence number by root node specified sensor node, sensor node need not to possess routing function, only need possess simple forwarding capability, can greatly reduce the complexity of sensor node, the computational speed that comprises the sensor node processes device, ability and memory size, simplify node to control and the processing of its radiofrequency signal transmitting-receiving, reduce the design cost of sensor node, simplify the networking agreement of sensor node, thereby reduce networking and the complexity of communicating by letter.
The present invention is not limited to above-mentioned preferred forms, and anyone should learn the structural change of making 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 (7)
1. the network-building method of wireless sensor network is characterized in that, may further comprise the steps:
In steps A 10, the 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 among 1～N; J is any among 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 the convergence process, described node connects with the received power table and merges successively m link feedback form packet of generation, and unified converging is uploaded to root node N
Root, m represents and root node N
RootThe number of nodes that connects;
Steps A 30, described root node N
RootAccording to described link feedback form, be each described sensor node N according to the networking rule
OiThe node transmitting-receiving sequence number of distributing trunk link and branch's link at its place;
Steps A 40, each described sensor node N
OiCarry out networking according to its described node transmitting-receiving sequence number that is assigned to.
2. the network-building method of wireless sensor network as claimed in claim 1 is characterized in that, 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 sign] [barrier code] [N
O1Sign] [N receives N
O1Power] [barrier code] [N
O2Sign] [N receives N
O2Power] [barrier code] ... [barrier code] [N
OjSign] [N receives N
OjPower] [barrier code] N[N and N
O1, N
O2..., N
OjConnection relational table] [barrier code] [check code].
3. the network-building method of wireless sensor network as claimed in claim 2, it is characterized in that, the process of described convergence is from the network edge frontier node, according to convergence rule, the node that gathers by way of each node along communication link connects and the received power table, and the merging data bag generates described link feedback form; The concrete composition form of described link feedback form packet is:
[link feedback form flag code] [N
e(N
O1) node connection and received power table] [barrier code] [N
O2(N
O1, N
O2..., N
Oj) node connection and received power table] [barrier code] ... [barrier code] [check code], N
eBe network edge frontier node, N
O1Be N
eAdjacent node, N
O2Be N
O1Adjacent node.
4. the network-building method of wireless sensor network as claimed in claim 3 is characterized in that, described convergence rule is:
Receive first packet from adjacent sensors node Nx as the time standard reference point take certain sensor node Ny, this sensor node Ny abandons the packet from this adjacent sensors node Nx that repeats to receive automatically afterwards.
5. the network-building method of wireless sensor network as claimed in claim 3 is characterized in that, steps A 30 may further comprise the steps:
Steps A 301, root node receive and gather link feedback data packet from each node, extract respectively power and connection relational table that each sensor node receives the adjacent sensors node;
Steps A 302, the node that minimum or minimal network depth gauge is calculated network optimum according to the whole network total power consumption are transmitted route.
6. the network-building method of wireless sensor network as claimed in claim 5 is characterized in that, the computational methods that described the whole network total power consumption is minimum are as follows:
Root node is according to received power and the connection relational table of all the sensors node that extracts, carrying out the traversal of the whole network sensor node calculates, generate whole permutation and combination according to whole available annexations between all the sensors node, and corresponding all received powers of various permutation and combination are added up, the node that the network topology that cumulative sum minimum value is corresponding and receiving-transmitting chain are network optimum is transmitted route.
7. the network-building method of wireless sensor network as claimed in claim 5 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 all the sensors node that extracts, carrying out the traversal of the whole network sensor node searches, put out root node in order to all path lists of overall network flange distal node, in whole results, find out the node forwarding route that root node is network optimum to network topology corresponding to the minimum hop count sum minimum value between all flange distal nodes and receiving-transmitting chain.
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 true CN102984715A (en) | 2013-03-20 |
| CN102984715B 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) |
Cited By (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 |
| CN105763364A (en) * | 2016-01-21 | 2016-07-13 | 上海岂控信息科技有限公司 | 2.4G chip-based multi-sub node large-scale networking method |
| CN106507506A (en) * | 2016-12-06 | 2017-03-15 | 无锡悟莘科技有限公司 | A kind of radio sensing 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 |
| CN107770833A (en) * | 2017-10-27 | 2018-03-06 | 上海感悟通信科技有限公司 | Radio self-organized network nodes device and its communication means and network-building method and medium |
| CN108072150A (en) * | 2016-11-14 | 2018-05-25 | 浙江盾安自控科技有限公司 | A kind of narrowband networking temperature control system and its network-building method |
| 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 |
Cited By (13)
| 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 |
| CN105763364A (en) * | 2016-01-21 | 2016-07-13 | 上海岂控信息科技有限公司 | 2.4G chip-based multi-sub node large-scale networking method |
| CN108072150A (en) * | 2016-11-14 | 2018-05-25 | 浙江盾安自控科技有限公司 | A kind of narrowband networking temperature control system and its network-building method |
| CN106507506A (en) * | 2016-12-06 | 2017-03-15 | 无锡悟莘科技有限公司 | A kind of radio sensing 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 |
| CN107770833A (en) * | 2017-10-27 | 2018-03-06 | 上海感悟通信科技有限公司 | Radio self-organized network nodes device and its communication means and network-building method and medium |
| CN107770833B (en) * | 2017-10-27 | 2020-10-27 | 上海感悟通信科技有限公司 | Networking method and medium for wireless self-organizing network system |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102984715B (en) | 2015-08-19 |
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 | |
| CN103906164B (en) | Maritime search and rescue wireless sensor network topology and topology control method | |
| CN101392656B (en) | Hydraulic support electrohydraulic control system and ad hoc network method thereof | |
| CN106131919B (en) | A kind of synchronous method of non-stop layer self-organized network topology | |
| Durairaj et al. | Two-level clustering and routing algorithms to prolong the lifetime of wind farm-based WSN | |
| CN104283789B (en) | Route convergent method and system | |
| CN102196458A (en) | Networking method and devices of wireless broadband sensor network | |
| CN103647714A (en) | Social energy-based mobile social delay-tolerant network routing method | |
| CN103826281A (en) | Micropower wireless communication routing algorithm and networking method based on field intensity information | |
| CN103095577B (en) | Context-sensitive Uneven Cluster routing algorithm | |
| CN102647472A (en) | Networking method of wireless sensor network and wireless sensor network system | |
| CN102158983A (en) | Method for constructing 6LoWPAN wireless sensor network | |
| CN103916939A (en) | Wireless chain-type transmission system | |
| Baranidharan et al. | Energy efficient hierarchical unequal clustering in wireless sensor networks | |
| CN104883676A (en) | Cooperative safety communication method in multi-UAV environment | |
| CN103281708A (en) | Wireless sensor node deploying method | |
| Zhang et al. | A hybrid approach using mobile element and hierarchical clustering for data collection in WSNs | |
| CN108134772A (en) | A kind of safety routing method using AODV or DSDV protocol realizations | |
| CN101640929A (en) | Anti-interference method of wireless mesh network on the basis of power control | |
| CN102413471B (en) | Networking method of wireless grid sensor based on link stability estimation | |
| CN102186258B (en) | Communication protocol method of wireless sensor network based on linear long distance | |
| Elhabyan et al. | Weighted tree based routing and clustering protocol for WSN | |
| CN103442382A (en) | Topology control method for reducing inter-link interference | |
| CN103051531A (en) | Statistical-optimization-based ZigBee hierarchical routing networking method |
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 | ||
| 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 |