CN105072661A - Clustering multi-hop routing protocol of wireless sensor network - Google Patents
Clustering multi-hop routing protocol of wireless sensor network Download PDFInfo
- Publication number
- CN105072661A CN105072661A CN201510417181.2A CN201510417181A CN105072661A CN 105072661 A CN105072661 A CN 105072661A CN 201510417181 A CN201510417181 A CN 201510417181A CN 105072661 A CN105072661 A CN 105072661A
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- energy
- cost
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention provides a clustering multi-hop routing protocol of a wireless sensor network. In network initialization, each node forms a cluster according to position information, A sink node acquires all clusters in the network. Data transmission is initialized by the sink node. Furthermore routing from the sink node to a target cluster between cluster heads which are dynamically selected is formed in real time. The cluster head of the target cluster acquires local data local data (such as real-time data of a certain cell in the cluster) and transmits the local data to the sink node. In the establishing process of the routing, the intermediate node of the routing utilizes estimated cost for deciding a next-hop node. The estimated cost comprises a distance between a normalized intermediate node and the residual energy of the node. The clustering multi-hop routing protocol is mainly used for the field of wireless sensing network routing control.
Description
Technical field
What the present invention relates to is for a kind of clustering and multi-hop routing algorithm in radio sensing network.Belong to radio sensing network non-blocking properity technical field.
Background technology
Wireless sensor network one of study hotspot becoming cordless communication network at present.And the transmission of data be unable to do without Routing Protocol in network. the task of Routing Protocol is between sensor node and aggregation node, set up route, thus reliably transmits data.Due to the network that sensor network is resource-constrained, therefore the design of Routing Protocol can not be too complicated, can not preserve too many information, can not exchange too many message between node on node, etc.For effectively completing above-mentioned task, existing a lot of Routing Protocol mostly make use of following characteristics:
(1) because sensor network interior joint is numerous, cannot set up a mark that can uniquely distinguish in a network for each node, therefore sensor node presses data attribute addressing, and unconventional IP-based addressing;
(2) wireless sensor network needs to transmit data from multiple source node to sink nodes;
(3) have bulk redundancy information in primary monitoring data, Routing Protocol is merging data often, reduces redundancy, and then reduces energy ezpenditure and launch power consumption;
(4) transmittability of sensor node, energy, disposal ability and internal memory are all very limited, and network has again the features such as number of nodes is numerous, dynamic strong, perception data amount is large simultaneously, so need to manage Internet resources well.
Wireless Sensor Network Routing Protocol and the maximum difference of legacy network Routing Protocol are exactly the application relativity of height, therefore, best Routing Protocol is not had to only have most suitable agreement, designer should select, design suitable Routing Protocol according to different application scenarios, following is a list the designing requirement of agreement under different application occasion:
(1) for the feature that energy height is limited, efficiency utilization energy is almost the first strategy of design;
(2) features such as, communication power consumption large for packet header expense, node has cooperative relationship, data have correlation, node energy is limited, adopt the technology such as data aggregate, filtration;
(3) for features such as traffic characteristic, communication power consumptions, traffic load balancing technology is adopted;
(4) for the feature of node movement less, its mobility is not safeguarded;
(5) for network relative closure, do not provide the features such as calculating, only in aggregation node and other network interconnections;
(6) for the feature that network node seldom addresses, adopt based on data or location-based communication mechanism;
(7) for the feature that node easily lost efficacy, multipath mechanism is adopted.
In actual applications, be often difficult to take into account above-mentioned all design objects, therefore for the application of concrete wireless sensor network, the balance of each side should be carried out to global design for concrete requirement, maximize to realize network utility.
Summary of the invention
Goal of the invention: the radio sensing network formed for the homogeneity high-density static wireless sensor node distributed in large-scale fixed-site, the present invention proposes a kind of clustering and multi-hop Routing Protocol based on virtual grid.
Technical scheme: to achieve these goals, the present invention uses following technical scheme:
A kind of Wireless sensor network clustering multihop routing agreement, specific as follows:
(1) according to the physical location information of sensor node and the radius of clean-up of wireless transceiver, be divided into by sensor node among corresponding equal-sized square virtual grid, each virtual grid is one bunch;
(2) sensor node is according to the geographical location information of oneself, judge belonging to oneself bunch, the node among same grid can obtaining information mutually, forms neighbor table;
(3) in every cluster, have two kinds of roles: bunch head and terminal equipment, each homogeneity node can both switch between these two kinds of roles according to certain mechanism.Will elect a leader cluster node in each bunch, for receiving the data of other nodes, the final destination of the data of all leader cluster node collections is aggregation node.
(4) in network operation process, the time of a leader cluster node Limited work, after time-out, a bunch head is dynamically re-elected, to reach the object of prolong network lifetime as far as possible.
(5) aggregation node can initiate querying command, sets up routing table between bunch according to the dump energy of minimal path cost and bunch head between leader cluster node.
(6) after the sensor node in network collects the relevant data of application, oppositely aggregation node is routed to along the minimal cost path set up, and the routing cost using piggyback new mechanism current, real time modifying routing table.
Further, in described (1), the length of side of each virtual grid of hypothesis is r, and the nodal distance in adjacent mesh can not exceed node-node transmission distance R, existing:
R
2+ (2r)
2≤ R
2or
Node in each virtual grid forms one bunch in network, each bunch has unique bunch numbering, due to node its physical location information known, therefore after the size of setting virtual grid, each node can according to the physical location of self calculate its place bunch numbering, a bunch numbering is made up of two bytes, first character joint be bunch X-axis numbering iX, the Y-axis numbering iY that second byte is bunch, iX and iY is obtained by following formula:
Wherein x is the x-axis coordinate of node in detection range, and y is as the y-axis coordinate of node in monitoring range.
Further, each sensor node has three kinds of states: find (discovery), movable (active) and sleep (sleeping).The node being in active state is leader cluster node.In netinit state, all nodes are all in Discovery Status, and each node is by sending the information such as position, ID of message announcement oneself, and through this stage, node can learn other nodal informations in same grid.Then, the timer of oneself is set to the random value T in certain interval by each node
d.Once timer expiry, node sends message declaration, and it enters active state, becomes leader cluster node.If node received the statement from other nodes in same grid before timer expiry, then enter resting state.
Rational discovery time T is calculated with residue energy of node model in described (3)
d:
Wherein, leader cluster node setting timer T
a, represent the time that it is in active state, at T
abefore time-out, a bunch head does not stop issuing statement, enters active state, T to prevent the node being in Discovery Status in this region
aafter time-out, a bunch head comes back to Discovery Status; Be in dormant node and also set timer T
s, treat T
safter time-out, also enter Discovery Status, enter new election of cluster head;
T
d, T
a, T
schoose and have important relationship with whole Network morals.Wherein T
ddirect which node that affects will become a bunch head, T
dthe possibility that less node becomes bunch head is larger.Thus, in the election process of bunch head, should, by rational selection mechanism, make can have larger T as a bunch worked node
d, thus reduce it and again become the possibility that bunch head enters active state.
E in formula
r(T
1) be T
1moment residue energy of node, by T
1moment node i adds up the n received
1individual packet, the n of transmission
2the initial energy E of individual packet and node
initdetermine:
E in formula
t(B) for node sends data capacity model:
E
t(B)＝(e
t+e
dr
n)B
E
r(B) for node receives data capacity model:
E
r(B)＝e
rB
Wherein e
tbe the energy that the every bit information of transmission consumes, unit is J/b, e
dthe rate of Energy Loss in wireless transmission process, e
tand e
dvalue by node transmitter characteristic determine, parameter n be channel path lose index, depend on RF environment, n value be generally 2 or 4, r be transmission range, B is wireless signal bit;
The leader cluster node activity time
Wherein r is that every node of expecting serves as a bunch great wheel number, and enlt is the node life cycle according to energy budget;
The node sleep time is set as T
s=T
a.
Further, in described (5) in the process of routing table foundation, by exchanging neighbor node energy harvesting path cost, on each leader cluster node, set up the reverse minimum cost route from data source to aggregation node hop-by-hop;
Initial time, all nodes consumed energy are 0, the path cost of aggregation node is 0, aggregation node first its nearest leader cluster node i of chosen distance is the first hop node, querying command is transferred to node i, node i is after acquisition querying command, if find that query aim belongs to its neighbours bunch, then direct forwarding inquiries order is to these neighbours bunch; Otherwise, node i obtains the consumed energy of normalized all adjacent cluster head nodes by energy update mechanism, and calculate the distance of its all neighbours' leader cluster node apart from target bunch geometric center, the neighbours bunch j of Least-cost is calculated according to path cost function, querying command is transmitted to it, node i safeguards a path cost table, records by its known cost h (N to bunch R
i, R), h (N
i, R) and initial value is 0; After node i selects the neighbours bunch head j of Least-cost, by h (N
i, R) and be set to h (N
j, R) and+c (Ni, Nj), wherein c (N
ir) be that obtained by cost function equally, leader cluster node j performs aforesaid operations successively by packet from i node-node transmission to the path cost of j node, querying command is now completed by the Route establishment of aggregation node to destination node till being sent to bunch head at destination node place bunch;
Path cost estimation formulas:
c(N
i,R)＝αd(N
i,R)+(1-α)e(N)
Wherein, c (N
i, R) and be node N
ito the estimated path cost of destination node place bunch R; D (N
i, R) and be node N
ito the distance of bunch geometric center of destination node place bunch R; E (N) is node N
ithe energy consumed; α is the adjustable weight parameter of (0,1).
Further, forward when objective sensor node receives aggregation node the querying command of coming in described (6), and after collecting desired data, node is along the next-hop node in routing table, required data hop-by-hop is sent to aggregation node, in the transmitting procedure of data, in data message, " be slightly with " every hop node to the actual energy consumption figures of destination node; For each node of transfer of data process, first the energy cost in slightly information is recorded, then the energy cost in information is added that it sends the energy ezpenditure of this information to next node, original in alternate message " being slightly with " value carrys out forwarding data, recipient records new path cost, and carry out necessary routing update, during recipient's forwarding inquiries order next time, the cost of estimation is substituted with the actual cost to event area be just now recorded to, when upper once route is formed, choose the path optimizing of target bunch with the actual cost after adjustment.
Beneficial effect: use Routing Protocol of the present invention, the life cycle of the radio sensing network that the homogeneity high-density static wireless sensor node distributed in large-scale fixed-site can be made to form extends, and makes the energy of different node be tending towards average.
Accompanying drawing explanation
Fig. 1 is election of cluster head flow chart of the present invention;
Fig. 2 is that network of the present invention sets up schematic diagram.
Embodiment
Below in conjunction with accompanying drawing and concrete example, the present invention is described in detail.
Network model hypothesis n the sensor node that the present invention is based on is evenly distributed in the two-dimension square shape region R of a L × L at random, and supposes that this sensor network has following character:
1) sensor network is high-density static network, namely no longer moves after node deployment;
2) wireless sensor network disposition is in two dimensional surface, does not have barrier;
3) sensor node structure is identical, has same maximum transmission distance;
4) aggregation node is deployed in a fixed position, and aggregation node is unique, is positioned at observation area peripheral edge, does not have energy constraint, and computing capability and storage capacity are relatively strong;
5) powered battery, node energy can not supplement;
6) node physical location can be known in advance.
Stress and strain model
First in monitored area, rectangular coordinate system is set up, optimum sub-clustering number is calculated according to radio model, network is divided into the cell of corresponding number, and be numbered for cell, each cell is one bunch, according to the geographical location information of oneself, node judges which bunch oneself belongs to.Different bunch A ~ F has been split with dotted line in Fig. 1.
Election of cluster head
IEEE802.15.4 protocol basis describes election of cluster head process, and main primitive involved in election of cluster head process is as follows:
1、NLME-CLUSTER-MEMBER-DISCOVERY.request
This primitive is sent to network layer by application layer, makes the outside broadcast packet of node containing the beacon frame of bunch information about firms, comprises bunch numbering and a node short address in frame, receive this command frame bunch in these information of other nodes records, abandon this frame after a bunch exterior node receives.
2、NLME-CLUSTER-MEMBER-DISCOVERY.indication
This primitive is sent to application layer by network layer, and the beacon frame of information about firms in node receives and to comprise bunch, then to network layer report, these information are added a bunch neighbor list by network layer.
3、NLME-CLUSTER-HEAD-ANNOUNCE.request
Sent to network layer by application layer, to bunch in other nodes issue the statement that it has entered active state, other nodes receive this statement laggard enter sleep state.
4、NLME-CLUSTER-HEAD-ANNOUNCE.indication
Sent to application layer by network layer, the statement that the node having become bunch head in node receives bunch sends, informing network layer also enters sleep state.
As shown in Figure 1, the course of work of election of cluster head is as follows:
1, network startup, node carried out scan channel, initialization network under IEEE802.15.4 standard card cage, add network and after obtaining a series of activities such as address, the tufted state to be formed such as to enter.
2, node sends NLME-CLUSTER-MEMBER-DISCOVERY.request order primitive, outwards after broadcast self information several times, monitors a period of time, obtains bunch neighbor table, for data acquisition and transmission are prepared.
3, node sets finds timer T
d, and open receiver monitoring, if do not receive NLME-CLUSTER-HEAD-ANNOUNCE.indication primitive command after timer expiry, then send NLME-CLUSTER-HEAD-ANNOUNCE.request primitive command, and become a bunch head.Otherwise, bunch head operating time T in record NLME-CLUSTER-HEAD-ANNOUNCE.request primitive command
d, be set as its length of one's sleep of T
s, and close receiver.
4, the node sets work timing device T of bunch head is become
a, and as bunch head work response time, get back to after timer expiry (3).
5, sleeping nodes treats T
safter time-out, come back to (3), start new election of cluster head.
Route establishment
In Fig. 2, light gray node is leader cluster node, and non-adjacent bunch within wireless transceiver Direct Communication scope.S is aggregation node, and d is destination node, and s is to d querying node data.α=0.5, the weight of balance geographical position and energy ezpenditure.Route establishment process is as follows:
1, a s distance bunch A geometric center normalized cumulant is
a distance bunch B normalized cumulant is 2, and a distance bunch C normalized cumulant is
suppose that the energy ezpenditure of initial time 3 leader cluster nodes is 0, aggregation node is respectively to the path cost of three bunches
1,
therefore to a bunch B forwarding inquiries order.
2, the leader cluster node 2 of bunch B receives order, calculates adjacent cluster A, bunch head of C, E is respectively to the distance of target bunch H geometric center
6.Consumed energy is respectively 0.13,0.19 and 0.14, and the path cost to target bunch H is respectively 15.508,2.216 and 9.07, therefore to a bunch C forwarding inquiries order.
3, the leader cluster node 3 of bunch C receives order, and calculate adjacent cluster B, D, G to the path cost of target bunch H, wherein leader cluster node 6 path cost of bunch G is minimum, therefore to a bunch G forwarding inquiries order.
4, the leader cluster node 6 of bunch G receives querying command, finds that destination node place bunch H is its neighbours bunch, and therefore without the need to calculating, directly to H bunch of forward command, backbone network Route establishment completes.
Transfer of data
Data of description transmitting procedure on IEEE802.15.4 protocol basis, main primitive involved in transfer of data is as follows:
1、NLDE-DATA.request
This primitive is sent to network layer by application layer, when application layer data entity needs the application layer transferring data to equity, produces NLDE-DATA.request primitive.Network layer will select next receiving node actual according to routing table, if do not arrive the route of destination node, then produce route.
2、NLDE-DATA.indication
NLDE-DATA.indication indicates a packet to deliver to local application layer data entity from network layer.
For the route in Fig. 2, the course of work of transfer of data is as follows:
1, node d transmits data to the node of next in routing table 6, and is slightly with self consumed energy, while node 6 receives data, upgrades the Actual path cost h (N that self arrives bunch H
6, H).
2, node 6 is by the data received, the Actual path cost h (N self arriving bunch H
6, H) and self consumed energy be sent to next-hop node 3 in routing table, while node 3 receives data, by self Actual path cost h (N to bunch H
3, H) and be updated to h (N
6, H) and+h (N
6, N
3)
3, node 3 continues down hop node transmission data, until aggregation node receives the data that destination node d gathers, in the process, each intermediate node of jumping all have updated the path cost of bunch H, when inquiring by aggregation node the cost being in bunch H interior joint next time, replacing the path cost estimated in path cost function by using Actual path cost, making path more excellent.
Claims (5)
1. a Wireless sensor network clustering multihop routing agreement, is characterized in that, specific as follows:
(1) according to the physical location information of sensor node and the radius of clean-up of wireless transceiver, be divided into by sensor node among corresponding equal-sized square virtual grid, each virtual grid is one bunch;
(2) sensor node is according to the geographical location information of oneself, judge belonging to oneself bunch, the node among same grid can obtaining information mutually, forms neighbor table;
(3) in every cluster, two kinds of roles are had: bunch head and terminal equipment, each homogeneity node can both switch between these two kinds of roles according to certain mechanism, a leader cluster node will be elected in each bunch, for receiving the data of other nodes, the final destination of the data of all leader cluster node collections is aggregation node;
(4) in network operation process, the time of a leader cluster node Limited work, after time-out, a bunch head is dynamically re-elected, to reach the object of prolong network lifetime as far as possible;
(5) aggregation node can initiate querying command, sets up routing table between bunch according to the dump energy of minimal path cost and bunch head between leader cluster node;
(6) after the sensor node in network collects the relevant data of application, oppositely aggregation node is routed to along the minimal cost path set up, and the routing cost using piggyback new mechanism current, real time modifying routing table.
2. Wireless sensor network clustering multihop routing agreement according to claim 1, is characterized in that: in described (1), the length of side of each virtual grid of hypothesis is r, and the nodal distance in adjacent mesh can not exceed node-node transmission distance R, existing:
R
2+ (2r)
2≤ R
2or
Node in each virtual grid forms one bunch in network, each bunch has unique bunch numbering, due to node its physical location information known, therefore after the size of setting virtual grid, each node can according to the physical location of self calculate its place bunch numbering, a bunch numbering is made up of two bytes, first character joint be bunch X-axis numbering iX, the Y-axis numbering iY that second byte is bunch, iX and iY is obtained by following formula:
Wherein x is the x-axis coordinate of node in detection range, and y is as the y-axis coordinate of node in monitoring range.
3. Wireless sensor network clustering multihop routing agreement according to claim 1, is characterized in that: calculate rational discovery time T with residue energy of node model in described (3)
d:
Wherein, leader cluster node setting timer T
a, represent the time that it is in active state, at T
abefore time-out, a bunch head does not stop issuing statement, enters active state, T to prevent the node being in Discovery Status in this region
aafter time-out, a bunch head comes back to Discovery Status; Be in dormant node and also set timer T
s, treat T
safter time-out, also enter Discovery Status, enter new election of cluster head;
E in formula
r(T
1) be T
1moment residue energy of node, by T
1moment node i adds up the n received
1individual packet, the n of transmission
2the initial energy E of individual packet and node
initdetermine:
E in formula
t(B) for node sends data capacity model:
E
t(B)＝(e
t+e
dr
n)B
E
r(B) for node receives data capacity model:
E
r(B)＝e
rB
Wherein e
tbe the energy that the every bit information of transmission consumes, unit is J/b, e
dthe rate of Energy Loss in wireless transmission process, e
tand e
dvalue by node transmitter characteristic determine, parameter n be channel path lose index, depend on RF environment, n value be generally 2 or 4, r be transmission range, B is wireless signal bit;
The leader cluster node activity time
Wherein r is that every node of expecting serves as a bunch great wheel number, and enlt is the node life cycle according to energy budget;
The node sleep time is set as T
s=T
a.
4. Wireless sensor network clustering multihop routing agreement according to claim 1, it is characterized in that: in described (5) in the process of routing table foundation, by exchanging neighbor node energy harvesting path cost, on each leader cluster node, set up the reverse minimum cost route from data source to aggregation node hop-by-hop;
Initial time, all nodes consumed energy are 0, the path cost of aggregation node is 0, aggregation node first its nearest leader cluster node i of chosen distance is the first hop node, querying command is transferred to node i, node i is after acquisition querying command, if find that query aim belongs to its neighbours bunch, then direct forwarding inquiries order is to these neighbours bunch; Otherwise, node i obtains the consumed energy of normalized all adjacent cluster head nodes by energy update mechanism, and calculate the distance of its all neighbours' leader cluster node apart from target bunch geometric center, the neighbours bunch j of Least-cost is calculated according to path cost function, querying command is transmitted to it, node i safeguards a path cost table, records by its known cost h (N to bunch R
i, R), h (N
i, R) and initial value is 0; After node i selects the neighbours bunch head j of Least-cost, by h (N
i, R) and be set to h (N
j, R) and+c (Ni, Nj), wherein c (N
ir) be that obtained by cost function equally, leader cluster node j performs aforesaid operations successively by packet from i node-node transmission to the path cost of j node, querying command is now completed by the Route establishment of aggregation node to destination node till being sent to bunch head at destination node place bunch;
Path cost estimation formulas:
c(N
i,R)＝αd(N
i,R)+(1-α)e(N)
Wherein, c (N
i, R) and be node N
ito the estimated path cost of destination node place bunch R; D (N
i, R) and be node N
ito the distance of bunch geometric center of destination node place bunch R; E (N) is node N
ithe energy consumed; α is the adjustable weight parameter of (0,1).
5. Wireless sensor network clustering multihop routing agreement according to claim 1, it is characterized in that: in described (6), forward when objective sensor node receives aggregation node the querying command of coming, and after collecting desired data, node is along the next-hop node in routing table, required data hop-by-hop is sent to aggregation node, in the transmitting procedure of data, in data message, " be slightly with " every hop node to the actual energy consumption figures of destination node; For each node of transfer of data process, first the energy cost in slightly information is recorded, then the energy cost in information is added that it sends the energy ezpenditure of this information to next node, original in alternate message " being slightly with " value carrys out forwarding data, recipient records new path cost, and carry out necessary routing update, during recipient's forwarding inquiries order next time, the cost of estimation is substituted with the actual cost to event area be just now recorded to, when upper once route is formed, choose the path optimizing of target bunch with the actual cost after adjustment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510417181.2A CN105072661A (en) | 2015-07-15 | 2015-07-15 | Clustering multi-hop routing protocol of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510417181.2A CN105072661A (en) | 2015-07-15 | 2015-07-15 | Clustering multi-hop routing protocol of wireless sensor network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105072661A true CN105072661A (en) | 2015-11-18 |
Family
ID=54501907
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510417181.2A Pending CN105072661A (en) | 2015-07-15 | 2015-07-15 | Clustering multi-hop routing protocol of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105072661A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105898822A (en) * | 2016-05-24 | 2016-08-24 | 扬州大学 | Information passing method of wireless sensor network |
| CN106656795A (en) * | 2016-09-27 | 2017-05-10 | 河海大学 | Wireless sensor and actor networks clustering routing method |
| CN108037670A (en) * | 2017-12-07 | 2018-05-15 | 何旭连 | A kind of smart home based on cloud computing |
| CN108601095A (en) * | 2018-05-08 | 2018-09-28 | 常熟理工学院 | A kind of implementation method of multimedia sensing network |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
| CN109211333A (en) * | 2018-11-08 | 2019-01-15 | 广州益牛科技有限公司 | High tower class building structure damage monitoring system |
| CN109285328A (en) * | 2018-09-27 | 2019-01-29 | 广州文搏科技有限公司 | Duty room Remote Intelligent Management System for Storage |
| CN109661030A (en) * | 2018-12-07 | 2019-04-19 | 南京工业大学 | Unknown object location algorithm in wireless sensor network based on dynamic grid |
| CN110062432A (en) * | 2019-04-26 | 2019-07-26 | 长春师范大学 | A kind of Wireless sensor network clustering routing algorithm based on least energy consumption |
| CN110198549A (en) * | 2019-06-10 | 2019-09-03 | 安徽理工大学 | Event driving type wireless sensor network cluster routing method and system |
| CN111887185A (en) * | 2020-08-10 | 2020-11-06 | 广州诺海信息科技有限公司 | Deep open sea intelligent breeding platform |
| CN111935675A (en) * | 2020-09-25 | 2020-11-13 | 北京盛安同力科技开发有限公司 | Collaborative data chain system and method suitable for subsonic platform |
| CN112073529A (en) * | 2020-09-15 | 2020-12-11 | 常熟理工学院 | Method for realizing intelligent medical system based on edge calculation |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873663A (en) * | 2010-05-26 | 2010-10-27 | 北京科技大学 | Multi-path routing algorithm based on energy sensing reliability |
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| CN103096411A (en) * | 2013-01-05 | 2013-05-08 | 山东师范大学 | Internet of things communication method based on reverse power restriction route protocol |
-
2015
- 2015-07-15 CN CN201510417181.2A patent/CN105072661A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873663A (en) * | 2010-05-26 | 2010-10-27 | 北京科技大学 | Multi-path routing algorithm based on energy sensing reliability |
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| CN103096411A (en) * | 2013-01-05 | 2013-05-08 | 山东师范大学 | Internet of things communication method based on reverse power restriction route protocol |
Non-Patent Citations (4)
| Title |
|---|
| YAN YU, RAMESH GOVINDAN, DEBORAH ESTRIN: ""Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks"", 《MARINE POLLUTION BULLETIN》 * |
| 杨梦宁: ""无线传感器网络中改进的HEED分簇算法"", 《重庆大学学报》 * |
| 童孟军，郑立静: ""基于能量均衡和负载平衡的WSN的分簇改进算法"", 《科技通报》 * |
| 赵学鹏，邹传云: ""无线传感器网络GAF算法的性能分析与仿真"", 《计算机仿真》 * |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105898822A (en) * | 2016-05-24 | 2016-08-24 | 扬州大学 | Information passing method of wireless sensor network |
| CN106656795B (en) * | 2016-09-27 | 2019-10-18 | 河海大学 | A kind of wireless sensor and actor network clustering route selection method |
| CN106656795A (en) * | 2016-09-27 | 2017-05-10 | 河海大学 | Wireless sensor and actor networks clustering routing method |
| CN108037670A (en) * | 2017-12-07 | 2018-05-15 | 何旭连 | A kind of smart home based on cloud computing |
| CN108601095A (en) * | 2018-05-08 | 2018-09-28 | 常熟理工学院 | A kind of implementation method of multimedia sensing network |
| CN108601095B (en) * | 2018-05-08 | 2020-07-07 | 常熟理工学院 | Method for realizing multimedia sensor network |
| CN108770036A (en) * | 2018-06-20 | 2018-11-06 | 中国联合网络通信集团有限公司 | Communication means and wireless sensor network Routing Protocol between cluster head |
| CN108770036B (en) * | 2018-06-20 | 2020-10-02 | 中国联合网络通信集团有限公司 | Inter-cluster-head communication method and wireless sensor network routing device |
| CN109285328A (en) * | 2018-09-27 | 2019-01-29 | 广州文搏科技有限公司 | Duty room Remote Intelligent Management System for Storage |
| CN109211333A (en) * | 2018-11-08 | 2019-01-15 | 广州益牛科技有限公司 | High tower class building structure damage monitoring system |
| CN109661030A (en) * | 2018-12-07 | 2019-04-19 | 南京工业大学 | Unknown object location algorithm in wireless sensor network based on dynamic grid |
| CN110062432A (en) * | 2019-04-26 | 2019-07-26 | 长春师范大学 | A kind of Wireless sensor network clustering routing algorithm based on least energy consumption |
| CN110062432B (en) * | 2019-04-26 | 2021-11-23 | 长春师范大学 | Wireless sensor network clustering routing method based on minimum energy consumption |
| CN110198549A (en) * | 2019-06-10 | 2019-09-03 | 安徽理工大学 | Event driving type wireless sensor network cluster routing method and system |
| CN110198549B (en) * | 2019-06-10 | 2022-06-24 | 安徽理工大学 | Event-driven type wireless sensor network clustering routing method and system |
| CN111887185A (en) * | 2020-08-10 | 2020-11-06 | 广州诺海信息科技有限公司 | Deep open sea intelligent breeding platform |
| CN111887185B (en) * | 2020-08-10 | 2021-12-24 | 广州诺海信息科技有限公司 | Deep open sea intelligent breeding platform |
| CN112073529A (en) * | 2020-09-15 | 2020-12-11 | 常熟理工学院 | Method for realizing intelligent medical system based on edge calculation |
| CN112073529B (en) * | 2020-09-15 | 2021-09-21 | 常熟理工学院 | Method for realizing intelligent medical system based on edge calculation |
| CN111935675A (en) * | 2020-09-25 | 2020-11-13 | 北京盛安同力科技开发有限公司 | Collaborative data chain system and method suitable for subsonic platform |
| CN111935675B (en) * | 2020-09-25 | 2021-01-15 | 北京盛安同力科技开发有限公司 | Collaborative data chain system and method suitable for subsonic platform |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105072661A (en) | Clustering multi-hop routing protocol of wireless sensor network | |
| Patil et al. | A survey on routing protocols in wireless sensor networks | |
| CN103619049B (en) | Energy-saving routing method for wireless sensor network | |
| Quang et al. | Adaptive routing protocol with energy efficiency and event clustering for wireless sensor networks | |
| Ferng et al. | Energy-efficient routing protocol for wireless sensor networks with static clustering and dynamic structure | |
| CN102647472A (en) | Networking method of wireless sensor network and wireless sensor network system | |
| CN103298032A (en) | Node energy consumption balancing method for wireless sensor network | |
| Du et al. | Energy efficient chessboard clustering and routing in heterogeneous sensor networks | |
| Kumar et al. | Energy efficient clustering and cluster head rotation scheme for wireless sensor networks | |
| Galluccio et al. | A MAC/Routing cross-layer approach to geographic forwarding in wireless sensor networks | |
| CN101577668A (en) | Wireless sensor network opportunistic routing protocol based on grid clustering | |
| ECE | A survey on energy efficient routing in wireless sensor networks | |
| Liu et al. | An improved energy efficient unequal clustering algorithm of wireless sensor network | |
| CN101572662A (en) | Energy-saving packet forwarding method based on position information in wireless sensor network | |
| CN102983948B (en) | A kind of radio sensing network self-adaption cluster transmission method and device thereof | |
| Lehsaini et al. | An efficient cluster-based self-organisation algorithm for wireless sensor networks | |
| Lehsaini et al. | CES: Cluster-based energy-efficient scheme for mobile wireless sensor networks | |
| Lakshmi et al. | A survey on energy efficient routing protocol for IoT based precision agriculture | |
| Sinha et al. | Energy efficient routing mechanism in wireless sensor network | |
| Liu et al. | Grid routing: an energy-efficient routing protocol for WSNs with single mobile sink | |
| KR100915555B1 (en) | Query-based ZigBee Mesh Routing Protocol | |
| Mir et al. | A quadtree-based hierarchical data dissemination for mobile sensor networks | |
| Faheem et al. | SN-MPR: A multi-point relay based routing protocol for wireless sensor networks | |
| CN101471864A (en) | Data forwarding method based on receiver route in wireless self-organizing network | |
| Soni et al. | An investigation on energy efficient routing protocol for wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20151118 |
|
| RJ01 | Rejection of invention patent application after publication |