CN101808382B - Data communication method of wireless sensor network - Google Patents
Data communication method of wireless sensor network Download PDFInfo
- Publication number
- CN101808382B CN101808382B CN201010013624A CN201010013624A CN101808382B CN 101808382 B CN101808382 B CN 101808382B CN 201010013624 A CN201010013624 A CN 201010013624A CN 201010013624 A CN201010013624 A CN 201010013624A CN 101808382 B CN101808382 B CN 101808382B
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- leader cluster
- data
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a data communication method of a wireless sensor network, which can solve the problems of the traditional cluster routing protocol that the energy consumption of the cluster head is high, and the network bottleneck can be easily formed, thereby making the energy consumption of nodes uneven and shortening the network lifetime. The data communication method comprises the following steps: providing a wireless sensor network topology; designing a method for establishing clusters in a network clustering process; defining gateway nodes used for receiving and transmitting data between adjacent clusters; designing a data transmission routing process, wherein a cluster head node is only responsible for finding a data transmission path, and actual data are transmitted along the found path through the gateway nodes, thereby realizing the separation of path finding and data transmission and reducing the load of the cluster head node; and designing an in-cluster routing method used for transmitting the data to a designated gateway node. The data communication method designed in the invention can effectively reduce the energy consumption, balance the network load, and prolong the lifetime of the network. Therefore, the data communication method is applicable to large-scale wireless sensor networks.
Description
Technical field
The present invention relates to the wireless network communication technique field; Especially a kind of data communications method in wireless sensor network, it is big to be used for solving a tradition bunch Routing Protocol bunch energy consumption, is prone to become network bottleneck; And then it is uneven to cause node energy to consume, the problem that the network survivability phase shortens.
Background technology
Wireless sensor network (Wireless Sensor Networks) be current that receive much attention in the world, relate to that multidisciplinary height intersects, the integrated hot research field, forward position of knowledge height.It combines MEMS, sensor technology, embedded computing technique, modern network and wireless communication technology, distributed information processing etc., can be through the information of all kinds of integrated microsensors cooperation ground monitorings in real time, perception and various environment of collection or monitoring target.Wireless sensor network is widely used in fields such as military and national defense, industrial or agricultural, biologic medical.
Routing Protocol is one of key technology of wireless sensor network, and it mainly comprises the function of two aspects: seek the optimization path between source node and destination node; Packet is correctly transmitted along optimizing the path.For for the sensor network application program of a lot of data fusion, network lifetime, extensibility, load balance, fault-tolerance, fail safe etc. are important requirements.From the angle of network topology structure, the Routing Protocol of WSN can be divided into two types: plane and level type.In the Routing Protocol of plane, node is equal, is difficult for producing bottleneck effect, but lacks management node to communication resource optimum management, self-organizing collaborative work complex algorithm, and slower to the dynamic change reaction of network.And the level Routing Protocol has then greatly reduced the overall energy consumption of network, and has improved network extensibility.In the level Routing Protocol, network is divided into bunch usually.Some sensor nodes constitute one bunch.Each bunch is made up of a leader cluster node and a plurality of bunches of member node.Member node in whole bunch of the leader cluster node management is coordinated the work between the member, is responsible for the collection and the processing of bunch internal information, and bunch between information transmit.The LEACH agreement is exactly a kind of method of layering route in the wireless sensor network.On the basis of LEACH agreement, having developed the multiple wireless sensor network Routing Protocol that is suitable for the different application scene, like HEED, and PEGASIS, TEEN etc.
LEACH (Low Energy Adaptive Clustering Hierarchy) agreement is the representative of layering cluster agreement.It is the low power consumption adaptive sub-clustering topology algorithm of periodically carrying out.Its structure and node organization figure are as shown in Figure 1.Its basic thought is: the mode with circulation is selected leader cluster node at random, with the energy load mean allocation of whole network in each sensor node, thereby reach the purpose that reduces the network energy resource consumption, improves the whole life span of network.
The restructuring procedure that the circulation constantly in running of LEACH algorithm is carried out bunch.Each bunch restructuring procedure is described with the notion of " wheel (round) ".The every wheel can be divided into two stages: bunch establishment stage with the transmission data stabilization sub stage.
Bunch establishment stage be divided into four-stage: the election of leader cluster node, the broadcasting of leader cluster node, bunch foundation, the generation of scheduling mechanism.The selection of leader cluster node decides according to the number of times that needed leader cluster node sum in the network and each node have up to now become bunch head.Concrete grammar is: each sensor node is selected a value between 0-1, if selected value less than certain threshold value T (n), then this node becomes leader cluster node.Wherein, P representes the percentage of a bunch number in the network and total node number in
formula; R representes current election wheel number, and G representes that nearest 1/p wheel is not bunch set of node of a node.Behind the selected leader cluster node, through the whole network of broadcasting announcement.Other nodes in the network according to the signal strength signal intensity decision subordinate that receives information bunch, and notify corresponding leader cluster node, the foundation of accomplishing bunch.At last, leader cluster node adopt the TDMA mode for bunch in each node divide orientation its transmit the timeslice of data.
The stabilization sub stage groundwork of transmission data is: sensor node is jumped communication with the data of gathering through one and is sent to leader cluster node, leader cluster node to bunch in all nodes data of gathering carry out jumping communication through one again after the fusion of information and pass to the base station.This is a kind of reasonable mode of operation that reduces message volume.
Adopt and elect the mode of bunch head to avoid the undue consumed energy of leader cluster node at random, the energy consumption of node has improved network lifetime in the equalizing network; Data aggregate can effectively reduce the traffic, thereby saves energy.
But in the agreement of LEACH agreement and expansion thus, we can find out: leader cluster node is responsible for the discovery in path, whole bunch maintenance, and to the transfer of data of base station.In case leader cluster node lost efficacy, whole bunch will become chaotic.In addition, leader cluster node is had very wide communication range by supposition, and data just can directly jump to through one from leader cluster node and reach the base station like this.But this supposition is not always set up in reality.Because leader cluster node also is common sensor node, and because the propagation problem of information and the restriction of transmission range, the base station also can not cover all sensor nodes.In the LEACH agreement has formed bunch (Intra-cluster) and bunch between the topological structure of (Inter-cluster) single-hop, under this topological structure, each sensor node directly is sent to leader cluster node with data, sends the base station by leader cluster node to through single-hop then.Such method is not suitable for the wireless sensor network of large area.
In sum, the defective of LEACH agreement and Extended Protocol thereof mainly is: leader cluster node bear data processing, transfer of data, bunch considerable tasks such as maintenance, energy consumption is bigger, and is very fast easily dead.In case leader cluster node is withered away, and can't work for whole bunch.To having relatively high expectations of bunch head, cause the energy consumption of node inhomogeneous, shortened the life span of network, be not suitable for large-scale wireless sensor network.
The content of invention
The objective of the invention is: solve that a bunch head is prone to become network bottleneck in the existing routing protocol, causing bunch can't operate as normal, and then it is inhomogeneous to cause node energy to consume, and therefore shortens the problem of network survivability phase.Proposed a kind of new wireless sensor network routing mechanism, the method for building up that has designed in the network cluster process bunch has designed gateway node, has designed the routing procedure of transfer of data, method for routing in having set up bunch.The new data communications method that is proposed can alleviate the burden of leader cluster node, and the energy consumption of each node of balance prolongs life cycle of network, is suitable for massive wireless sensor.
The present invention has designed new wireless sensor network topology structure.Elected establishment at leader cluster node, and after peripherad node sends broadcast, the foundation of carrying out bunch; Network coverage area is divided into overlapped bunch; There are four kinds of nodes in the network: ordinary node, leader cluster node, gateway node in the adjacent cluster overlapping region and base-station node; Ordinary node is responsible for perception events, and when incident takes place, reports to leader cluster node, and carries out transfer of data along the routed path that leader cluster node searches out; Behind the leader cluster node request message that ordinary node sends in receiving bunch, carry out searching of data transfer path; Gateway node is responsible for the relaying of data between the adjacent cluster and is transmitted; Base-station node is a destination node, is used to receive the message of detection incident.The Routing Protocol of network is: bunch internal data transfer, method for routing in adopting bunch routes data to designated gateway node by ordinary node; Network data transmission by, leader cluster node finds the path, via bunch in route arrive to specify gateway node, transmit data to base-station node through gateway node; Above-mentioned routing mechanism realizing route is searched and the separating of transfer of data, and leader cluster node only is responsible for after the path request of receiving sensor node, the task that execution route is sought, and transfer of data is carried out through gateway node.Alleviated the burden of leader cluster node, overall route adopts the multi-hop pattern, and route adopts single-hop or multi-hop pattern in bunch.
The method for building up that the present invention has designed in the network cluster process bunch.Establish in leader cluster node election, and towards periphery after the node broadcasts, fail to elect into the node of bunch head according to rule select under self bunch, concurrent refer to ask add message REQ.What set up bunch is overlapped, and the node the overlapping region in is a gateway node, is responsible for data relaying forwarding between adjacent cluster.Node in the Non-overlapping Domain be bunch in ordinary node.Bunch foundation accomplish after, the quantity of all nodes and function are definite.
The present invention proposes the routing procedure of new transfer of data.When node need transmit data, it sent a request message to leader cluster node.After leader cluster node finds the path, reply this node and arrive next path of jumping bunch and the gateway node that needs process.Node through bunch in route, arrive this gateway node, through gateway node transmission data, and repeat said process, until the data arrives base-station node.
The present invention has designed method for routing in new bunch; After network cluster process was accomplished, the node in each bunch was set up the initialization routing table, after leader cluster node is informed bunch gateway node of the required process of interior nodes; Bunch interior nodes is passed through table of query and routing; Obtain next jump the node of process, and continue according to this, until arriving designated gateway node.
Compare with existing bunch of Routing Protocol, the present invention has the following advantages:
1. the task of bunch head is reduced, and leader cluster node can not become the bottleneck of network like this.The task of bunch head only is to select path rather than transfer of data, and this has just been avoided because multitask causes the undue consumption of energy, and then makes leader cluster node wither away too early, causes the confusion of whole network configuration and function.
2. the energy consumption of node is balanced, and be extended the life cycle of network.Because the task of leader cluster node is alleviated, the data route normally carries out in having guaranteed bunch.And what transmit data between being used for bunch is gateway node, and the gateway node of different Path selection is also inequality.This makes the node energy consumption of whole network tend to balance.
3. leader cluster node is a multi-hop with communicating by letter of base station, and actual transfer of data through gateway node also is a multi-hop.Such routing mechanism characteristics are suitable for large-scale wireless sensor network.
Description of drawings
The network configuration of Fig. 1 LEACH agreement and node organization figure
Routing Protocol network configuration and node organization figure that Fig. 2 the present invention proposes
The message format figure that the interior nodes request of sending in adjacent cluster overlapping region adds in the network cluster bunch method for building up among Fig. 3 the present invention
The message format figure that the interior nodes request of sending in non-adjacent cluster overlapping region adds in Fig. 4 network cluster bunch method for building up of the present invention
The routing table format chart that leader cluster node is set up among Fig. 5 the present invention about gateway node
The routing table format chart that bunch interior nodes was set up after network cluster process was accomplished among Fig. 6 the present invention
Network cluster process bunch establishment stage flow chart among Fig. 7 the present invention
The Routing Protocol routing procedure flow chart of Fig. 8 the present invention design
Fig. 9 the present invention design bunch in the routing procedure flow chart
Embodiment
In conjunction with above-mentioned accompanying drawing, wireless sensor network data communication means of the present invention, concrete enforcement comprises following components:
One, the design of network routing mechanism
As shown in Figure 2, network is divided into a plurality of overlapped bunch ClusterA, Cluster B, Cluster C.Exist ordinary node like A2, A3, B2, C2 in the network; Leader cluster node is like A1, B1, C1; The gateway node of adjacent cluster overlapping region is like G1, G2; And base-station node BS.After the transmission requests that ordinary node sent in leader cluster node received bunch, be responsible for carrying out searching of data transfer path.Ordinary node is carried out the task of detection incident,, incident reports when taking place to leader cluster node, and after leader cluster node searches out suitable routed path, along these path transmission data.Gateway node in the adjacent cluster overlapping region is responsible for the routing forwarding of data between adjacent cluster.Base-station node is a destination node, is used to receive the message of the detection incident of sending.This routing mechanism is separated the searching and the transfer of data in path, has alleviated the burden of bunch head.The route of the overall situation adopts multi-hop mechanism, and the route in bunch adopts single-hop or multi-hop mechanism.
Two, the design of network cluster process bunch method for building up
As shown in Figure 2, elected establishment at leader cluster node, and after the peripherad node transmission broadcast, each ordinary node decides certain bunch of adding according to the signal strength signal intensity of the broadcast that receives.If bunch radius be r, the signal strength threshold that adds certain bunch is t.Three kinds of situation are arranged:
(1) receive the broadcast that a plurality of leader cluster nodes are sent when certain node, and the signal strength values of these message is all greater than t, then this node is positioned at the adjacent cluster overlapping region.This node is as shown in Figure 3 to the message format of the leader cluster node transmission of these adjacent cluster;
(2) receive the broadcast that single leader cluster node is sent when certain node, then this node add that this leader cluster node was positioned at bunch.This node is as shown in Figure 4 to the message format that leader cluster node sends;
(3) receive the broadcast that a plurality of leader cluster nodes are sent when certain node, the signal strength signal intensity of having only a piece of news wherein is greater than t, then this node add that this bunch head is positioned at bunch.This node is as shown in Figure 4 to the message format that leader cluster node sends.
Through the cluster process, what set up bunch is overlapped.Node in the adjacent cluster overlapping region is a gateway node, also claims via node, is used for relay data, arrive next jump the place bunch, the different gateways node is born different data transfer tasks.Bunch foundation accomplish after, the quantity of all nodes and function are definite.
Bunch set up in the process, gateway node receives the broadcast that a plurality of leader cluster nodes are sent, they reply leader cluster node, inform their node serial number, and arrive next jumping bunch numbering.Like this, leader cluster node can make up routing table, with the path of determination data transmission.The routing table form of being set up about gateway node, as shown in Figure 5.Leader cluster node is not participated in actual data transmission procedure, real transfer of data be through bunch in route, arrive next through gateway node again and jump and bunch realize.Leader cluster node only is responsible for carrying out searching of data transfer path.This makes transfer of data and path searching separate, and has alleviated the burden of leader cluster node, helps the balance of energy consumption between the network node.
After network cluster process was accomplished, each node in bunch was through sending packet to neighbor node, the routing table of route in setting up bunch.Each node periodically receives their routing table from neighbor node, and sends the routing table of oneself to neighbor node.Fig. 6 is the routing table format chart that the node in after the network cluster is accomplished bunch is set up.
The flow chart of network cluster process bunch method for building up is as shown in Figure 7.
Three, the design of transfer of data routing procedure
Form bunch at sensor network, and confirmed to carry out the task of incident perception and transfer of data after the gateway node in the adjacent cluster overlapping region.
As shown in Figure 2, the Routing Protocol implementation that is designed may further comprise the steps:
The first step, the ordinary node A2 in certain bunch detects certain incident, and it need be to base-station node BS report events corresponding.
In second step, this ordinary node A2 asks the path that obtains carrying out transfer of data to the message that leader cluster node A1 sends the request of execution.
In the 3rd step, after leader cluster node A1 has obtained this request message, begin to handle.Whether the own routing table about gateway node of its inquiry, inquiry have the gateway node that arrives next jumping bunch.If exist, the numbering G1 of this gateway node, numbering B that next is jumped bunch are sent to the ordinary node A2 of the request of execution; If do not exist, then leader cluster node A1 sends to the ordinary node A2 that execution is asked with the numbering of oneself, with the via node as actual data information.
In the 4th step, ordinary node A2 has received the path that leader cluster node A1 is searched in bunch, if that receive is gateway node G1 and next information B that jumps bunch; Route in then beginning to carry out bunch; Arrive designated gateway node G1, this gateway node sends a request message to next leader cluster node B1 that jumps bunch, and request obtains the path of transfer of data; And repeat the 3rd---four steps, until arriving base-station node BS; If that receive is leader cluster node A2, then leader cluster node A2 bears the task of transfer of data temporarily, in bunch ordinary node A2 through bunch in route; Send the data to leader cluster node A1; Leader cluster node A1 sends to other leader cluster node B1 more successively, and C1 is until sending to base-station node BS.
Concrete routing procedure flow chart is as shown in Figure 8.
Four, bunch the design of route in
After the network cluster was accomplished, each node had all been set up bunch internal routing table of oneself.And the routing table through periodically receiving neighbor node and send routing table to neighbor node, upgrade a bunch internal routing table.Leader cluster node to bunch in after ordinary node returns next and jumps bunch the gateway node with required process, route in ordinary node begins to carry out bunch in bunch, as shown in Figure 2, detailed process is following:
The first step, ordinary node A2 waits for the message that leader cluster node A1 sends in bunch;
In second step, next that ordinary node A2 receives that leader cluster node A1 sends in bunch jumped the gateway node G1 information of bunch B and required process;
In the 3rd step, the routing table of ordinary node A2 inquiry oneself sees if there is the path that arrives this gateway node G1 in this bunch;
In the 4th step, ordinary node A2 finds the path that routes to this gateway node G1: A2-A3-G1 in bunch.If do not find, ordinary node A2 sends message for leader cluster node A1 in bunch, and request regains gateway node, and returns the first step.
In the 5th step, ordinary node A2 carries out transfer of data along the path of finding in bunch.
Above step is carried out always, until transfer of data to designated gateway node BS.Routing procedure finishes in bunch.
The route flow chart is as shown in Figure 9 in concrete bunch.
Symbol description:
The low-yield self adaptation sub-clustering of LEACH:Low Energy Adaptive Clustering Hierarchy level
HEED:A Hybrid, an Energy-Efficient Distributed Clustering Approach clustering method mixing, Energy Efficient, distributed
The gathering of Energy Efficient in the PEGASIS:Power-Efficient Gathering in Sensor Information Systems sensor information system
TEEN:Threshold sensitive Energy Efficient sensor Network protocol threshold value sensor network protocol responsive, Energy Efficient
TDMA:Time Division Multiple Access time division multiple access inserts
Cluster: bunch
The REQ:Request request
Claims (6)
1. the data communications method of a wireless sensor network; It is characterized in that: elected establishment at leader cluster node, and after peripherad node sends broadcast, the foundation of carrying out bunch; Network coverage area is divided into overlapped bunch; There are four kinds of nodes in the network: ordinary node, the gateway node in the adjacent cluster overlapping region, leader cluster node and base-station node; Ordinary node is responsible for perception events, and when incident takes place, reports to leader cluster node, and carries out transfer of data along the routed path that leader cluster node searches out; Gateway node is responsible for the relaying of data between the adjacent cluster and is transmitted; Behind the request message that leader cluster node ordinary node or gateway node in receiving bunch send, carry out searching of data transfer path; Base-station node is a destination node, is used to receive the message of detection incident; Bunch set up in the process, leader cluster node is set up the routing table about gateway node, with the path of transfer of data between determinant; After network cluster process was accomplished, the routing table of route in bunch interior nodes is set up bunch was with the path of transfer of data in the determinant; When needs carried out transfer of data, the Routing Protocol of network was: bunch internal data transfer, method for routing in adopting bunch routes data to the gateway node that leader cluster node finds by ordinary node; Global data transmission is found by leader cluster node and is arrived the gateway node that next is jumped bunch; Ordinary node or gateway node through bunch in route arrive the gateway node that leader cluster node finds; And through these gateway node transmission data; Until arriving base-station node, route adopts single-hop or multi-hop pattern in said bunch, and overall route adopts the multi-hop pattern; Above-mentioned routing mechanism realizing route is searched and the separating of transfer of data, and has alleviated the burden of leader cluster node.
2. according to the data communications method of the said wireless sensor network of claim 1, it is characterized in that: the process of bunch foundation is following in the said network cluster process:
Elected establishment at leader cluster node; And peripherad node sends after the broadcast, and each ordinary node decides according to the signal strength signal intensity of the broadcast that receives and adds certain bunch, and the radius of establishing bunch is r; The signal strength threshold that adds certain bunch is t, and three kinds of situation are arranged:
(1) receives the broadcast that a plurality of leader cluster nodes are sent when certain node; And the signal strength values of receiving message is all greater than t; Then this node is positioned at the adjacent cluster overlapping region for gateway node, the message that gateway node adds to the leader cluster node request of sending of adjacent cluster;
(2) receive the broadcast that single leader cluster node is sent when certain node, then this node add that this leader cluster node was positioned at bunch, the message that this node adds to the leader cluster node request of sending;
(3) receive the broadcast that a plurality of leader cluster nodes are sent when certain node, the signal strength signal intensity of having only a piece of news wherein is greater than t, then this node add that this bunch head is positioned at bunch, the message that this node adds to the leader cluster node request of sending.
3. the data communications method of wireless sensor network according to claim 1 and 2; It is characterized in that; Described leader cluster node is set up the routing table about gateway node, with the path of determination data transmission after receiving gateway node sent request adding message.
4. according to the data communications method of claim 1 or 3 described wireless sensor networks, it is characterized in that described overall routing procedure may further comprise the steps:
(1) ordinary node in certain bunch detects certain incident, and it need report this incident to base-station node;
(2) this ordinary node sends to leader cluster node and carries out the message of asking, the path that request obtains carrying out transfer of data;
(3) after leader cluster node has obtained this request message, begin to handle, the own routing table of its inquiry about gateway node, whether inquiry has the gateway node that arrives next jumping bunch; If exist, the numbering of this gateway node, numbering that next is jumped bunch are sent to the node that sends a request message to leader cluster node; If do not exist, then leader cluster node sends to the node that leader cluster node sends a request message with the numbering of oneself, with the via node as actual data information;
(4) node that sends a request message to leader cluster node has been received the path that leader cluster node is searched; If what receive is gateway node and next information of jumping bunch, route in then beginning to carry out bunch arrives designated gateway node; This gateway node sends a request message to next leader cluster node of jumping bunch; Request obtains the path of transfer of data, and repeats (3)--(4) step, until arriving base-station node; If what receive is leader cluster node, then leader cluster node is born the task of transfer of data temporarily, in bunch ordinary node through bunch in route send the data to leader cluster node, by leader cluster node through multi-hop communication, until sending to base-station node.
5. the data communications method of wireless sensor network according to claim 1; It is characterized in that after network cluster process was accomplished, each node was through sending packet to neighbor node; The routing table of route in setting up bunch; Each node periodically receives their routing table from neighbor node, and sends oneself routing table to neighbor node, the routing table of route in upgrading bunch.
6. according to the data communications method of claim 1 or 5 described wireless sensor networks, it is characterized in that route may further comprise the steps in said bunch:
1) ordinary node is waited for the message that leader cluster node sends bunch;
2) next that ordinary node receives that leader cluster node sends bunch jumped bunch the gateway node information with required process;
3) routing table of ordinary node inquiry oneself in this bunch sees if there is the path that arrives this gateway node;
4) ordinary node finds the path that routes to this gateway node in this bunch, if do not find, ordinary node sends message to leader cluster node in bunch, and request regains gateway node, and returns the first step;
5) ordinary node carries out transfer of data along the path of finding bunch;
Above step is carried out always, and to designated gateway node, routing procedure finishes in bunch until transfer of data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010013624A CN101808382B (en) | 2010-01-20 | 2010-01-20 | Data communication method of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010013624A CN101808382B (en) | 2010-01-20 | 2010-01-20 | Data communication method of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101808382A CN101808382A (en) | 2010-08-18 |
| CN101808382B true CN101808382B (en) | 2012-09-05 |
Family
ID=42609944
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010013624A Expired - Fee Related CN101808382B (en) | 2010-01-20 | 2010-01-20 | Data communication method of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101808382B (en) |
Families Citing this family (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102685839B (en) * | 2011-03-18 | 2014-12-31 | 中国移动通信集团公司 | Method, gateway, terminal and system for communication of Internet of things |
| CN102158983B (en) * | 2011-05-04 | 2013-09-04 | 常熟理工学院 | Method for constructing 6LoWPAN wireless sensor network |
| CN102158888B (en) * | 2011-05-18 | 2013-12-25 | 西安电子科技大学 | Data forwarding method based on random walk backup and node cooperation |
| US20130091212A1 (en) * | 2011-10-08 | 2013-04-11 | Broadcom Corporation | Social network device communication resource allocation |
| CN102347991B (en) * | 2011-11-23 | 2013-09-04 | 常熟理工学院 | Method for constructing vehicular network |
| CN102821409B (en) * | 2012-08-17 | 2014-12-10 | 北京交通大学 | Service quality assurance method for optimizing survival time of wireless sensor node |
| CN103200598A (en) * | 2013-04-25 | 2013-07-10 | 青岛农业大学 | Wireless sensor network clustering method based on particle swarm optimization |
| CN104244266B (en) * | 2014-05-08 | 2017-07-18 | 河北科技大学 | A kind of construction method of network topology structure of wireless sensor |
| CN105764111A (en) * | 2014-12-18 | 2016-07-13 | 镇江坤泉电子科技有限公司 | Wireless-sensing-network autonomous routing method |
| CN106028413B (en) * | 2015-03-20 | 2019-08-27 | 北京信威通信技术股份有限公司 | A kind of cluster routing method based on adjacent stable grade |
| CN105657022B (en) * | 2015-06-15 | 2019-04-05 | 重庆高开清芯科技产业发展有限公司 | The method and embedded node operating system of active push information |
| CN104935657A (en) * | 2015-06-15 | 2015-09-23 | 清华大学深圳研究生院 | Method for actively pushing information and embedded node operating system |
| CN105336138A (en) * | 2015-10-28 | 2016-02-17 | 深圳市科陆电子科技股份有限公司 | Method and system for wireless electricity meter to be automatically registered to concentrator |
| CN105517017B (en) * | 2015-12-10 | 2018-09-04 | 中北大学 | The peripheral boundary of wireless sensor network based on cluster and the empty recognition methods of covering |
| CN106028416B (en) * | 2016-05-03 | 2018-12-25 | 中南大学 | The improvement clustering method of communication pattern double adaptive between a kind of cluster range and cluster |
| CN106254146B (en) * | 2016-09-07 | 2019-09-10 | 上海市信息网络有限公司 | A kind of massive wireless sensor topology discovery method and system |
| CN106900007B (en) * | 2017-01-25 | 2020-01-03 | 扬州大学 | Overlapping clustering-oriented complex task allocation method for wireless sensor network |
| CN109089236B (en) * | 2018-04-20 | 2020-09-29 | 长江师范学院 | Wireless sensor network cluster head selection method for area coverage monitoring |
| CN108650650B (en) * | 2018-04-20 | 2020-08-18 | 长江师范学院 | Wireless sensor network cluster head selection method for area coverage monitoring |
| CN109862537B (en) * | 2019-03-07 | 2020-08-25 | 同济大学 | Accessibility method in Internet of vehicles community |
| CN109862536B (en) * | 2019-03-07 | 2020-06-16 | 同济大学 | Accessibility method among multiple communities of large-scale Internet of vehicles |
| CN109861928B (en) * | 2019-03-26 | 2022-09-27 | 黑龙江大学 | Data acquisition and load balancing method based on clusters |
| CN112583665A (en) * | 2020-12-08 | 2021-03-30 | 广州技象科技有限公司 | Network data multi-path transmission method, device, system and storage medium |
| CN113556286B (en) * | 2021-05-31 | 2022-07-29 | 北京邮电大学 | Communication method and system of peer-to-peer network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006067271A1 (en) * | 2004-12-22 | 2006-06-29 | Mikko Kohvakka | Energy efficient wireless sensor network, node devices for the same and a method for arranging communications in a wireless sensor network |
| CN101286911A (en) * | 2008-03-05 | 2008-10-15 | 中科院嘉兴中心微系统所分中心 | Networking method of wireless sensor network based on combination of cluster and Mesh |
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| US20090046630A1 (en) * | 2007-08-14 | 2009-02-19 | Cheng-Fa Tsai | Data-Transmitting Method for Wireless Sensor Network |
-
2010
- 2010-01-20 CN CN201010013624A patent/CN101808382B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006067271A1 (en) * | 2004-12-22 | 2006-06-29 | Mikko Kohvakka | Energy efficient wireless sensor network, node devices for the same and a method for arranging communications in a wireless sensor network |
| US20090046630A1 (en) * | 2007-08-14 | 2009-02-19 | Cheng-Fa Tsai | Data-Transmitting Method for Wireless Sensor Network |
| CN101286911A (en) * | 2008-03-05 | 2008-10-15 | 中科院嘉兴中心微系统所分中心 | Networking method of wireless sensor network based on combination of cluster and Mesh |
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
Non-Patent Citations (2)
| Title |
|---|
| 沈玉龙，徐启建，裴庆祺，马建峰.基于删格的无线传感器网络路由方法.《通 信 学 报》.2009,第30卷(第11A期),第96-100页. * |
| 王 艳.无线传感器网络的路由协议研究.《阜阳师范学院学报(自然科学版)》.2009,第26卷(第1期),第51-54页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101808382A (en) | 2010-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101808382B (en) | Data communication method of wireless sensor network | |
| Sabor et al. | A comprehensive survey on hierarchical-based routing protocols for mobile wireless sensor networks: Review, taxonomy, and future directions | |
| Singh et al. | A survey on cluster based routing protocols in wireless sensor networks | |
| Liu | Atypical hierarchical routing protocols for wireless sensor networks: A review | |
| Boyinbode et al. | A survey on clustering algorithms for wireless sensor networks | |
| Sabet et al. | An energy efficient multi-level route-aware clustering algorithm for wireless sensor networks: A self-organized approach | |
| Rathi et al. | A review on routing protocols for application in wireless sensor networks | |
| Malathy et al. | An optimal network coding based backpressure routing approach for massive IoT network | |
| CN101883048B (en) | Routing method of multi-dimensional network | |
| Jain et al. | QWRP: Query-driven virtual wheel based routing protocol for wireless sensor networks with mobile sink | |
| CN105871717A (en) | Unmanned aerial vehicle ad hoc network routing method based on link stability | |
| CN101355496A (en) | Multi-hop clustering route protocol initiated by base station | |
| CN112367639B (en) | Unmanned aerial vehicle cluster ad hoc network communication method and system based on Beidou satellite time service | |
| Tabatabaei et al. | Reliable routing algorithm based on clustering and mobile sink in wireless sensor networks | |
| ECE | A survey on energy efficient routing in wireless sensor networks | |
| Bouakkaz et al. | Maximizing WSN life using power efficient grid-chain routing protocol (PEGCP) | |
| CN102427597A (en) | Fusion method for WSN (Wireless Sensor Network) tree type clustering data based on CR (Cognitive Radio) | |
| Mahajan et al. | A novel chain based wireless data sensor network (ECBSN) technique | |
| Chaudhary et al. | A Tutorial of routing protocols in wireless sensor networks | |
| Choukri et al. | An energy efficient clustering algorithm for MANETs | |
| Behera et al. | Routing protocols | |
| Li et al. | Study of power-aware routing protocal in wireless sensor networks | |
| Gautam et al. | Data dissemination in wireless sensor networks: A state-of-the art survey | |
| Wang et al. | IMCR: Influence maximisation-based cluster routing algorithm for SDVN | |
| John et al. | Energy efficiency enhancement methods for mobile wireless sensor networks: A survey |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120905 Termination date: 20190120 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |