CN103338495B - Two-way energy balance wireless sensing network route method based on LEPS - Google Patents
Two-way energy balance wireless sensing network route method based on LEPS Download PDFInfo
- Publication number
- CN103338495B CN103338495B CN201310279245.8A CN201310279245A CN103338495B CN 103338495 B CN103338495 B CN 103338495B CN 201310279245 A CN201310279245 A CN 201310279245A CN 103338495 B CN103338495 B CN 103338495B
- Authority
- CN
- China
- Prior art keywords
- node
- link
- route
- dump energy
- routing
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a two-way energy balance wireless sensing network route method based on LEPS (Link Estimation and Parent Selection), which adds a downlink route based on an LEPS route protocol, supports query and control of aggregation nodes to other nodes, improves a routing basis of the LEPS route protocol, introduces residual energy based on hop count and data link quality, and improves load balance of a network. The method adds the downlink route, so that the control of the aggregation nodes to the common nodes is achieved, and an application scope of the route protocol is expanded; the downlink route is achieved based on an uplink route, and is simple to achieve; extra control information is less; resources can be saved effectively; and the hop count, the link quality and the residual energy of the nodes are combined together, and considered as the basis of selection of father nodes, so that the load balance of the nodes in the same gradient is achieved, premature failure of the individual node due to an overweight load is avoided, and the life cycle of the whole network is prolonged.
Description
Technical field:
The present invention relates to wireless sensor network technology field, be specifically related to the balanced wireless sensor network routing method of a kind of bidirectional energy based on LEPS agreement.
Background technology:
Wireless sensor network is a kind of system that the technology such as detection, radio communication and computer network are combined, and can carry out long-range perception and monitoring to the physical features in certain area.Because the multiple-task such as born detection, processing and communicate by letter, wireless sensor network is faced with the pressure of the larger resource such as energy and bandwidth.Sensor node volume in wireless sensor network, calculating and storage capacity are limited, conventionally rely on battery that energy is provided, transmit power limited, generally need multi-hop to forward and realize data transmission, sensor node position may change because of moving, energy also can reduce in time gradually until node power down is not worked, common each sensor node has terminal and two kinds of functions of router concurrently, need to move various user oriented application programs, with corresponding Routing Protocol, and complete the transmission work of packet according to routing policy, therefore require node to adopt suitable Routing Protocol.
LEPS(Link Estimation and Parent Selection) agreement is a kind of plane radio several routing protocols for wireless sensors networks that is suitable for data acquisition application.LEPS Routing Protocol is set up one take aggregation node as root node based on minimum hop count and link-quality, the tree topology network that ordinary node is branches and leaves.LEPS Routing Protocol transmission delay is less, and reliability is higher, and realizes simply, takies resource few, has still only stipulated the up route of transfer of data due to him, and cannot be applied to aggregation node need to have to data source nodes the network of demand for control.In addition, due in LEPS Routing Protocol, select father node according to being jumping figure and link-quality, do not consider the capacity factor of node, so can cause the unbalanced of load, especially be the network fixing for node location, this unbalanced will become more apparent, the node that part is served as father node easily exhausts energy prematurely.
Summary of the invention:
The deficiency existing for LEPS Routing Protocol, the balanced wireless sensor network routing method of a kind of two-way measurement based on LEPS Routing Protocol has been proposed, the method increases downstream routing on the basis of LEPS Routing Protocol, support inquiry and the control of aggregation node to other node, in addition, the method according to improving, has been introduced dump energy to the routing of LEPS Routing Protocol on the basis of jumping figure and data link quality, has improved the load balancing of network.
Concrete technical scheme of the present invention is as follows:
Based on LEPS Routing Protocol, the present invention realizes two-way choice and the balancing energy of route by the following technical solutions.Wherein LEPS agreement is that link is estimated to select Routing Protocol with father node
First,, in the process of up Route establishment, the routing state information of node broadcasts comprises this nodal point separation aggregation node jumping figure, link-quality and dump energy information.First node selects candidate parent node according to minimum hop count principle, multiple if candidate parent node has, according to determining father node by link-quality and the common transmission desired value determining of dump energy.
Then, after up Route establishment, node sends a downstream routing message bag after upgrading father node at every turn immediately, downstream routing message bag is sent to aggregation node along the path of up Route establishment, and on the way record the node address of process, aggregation node is set up downstream routing table by source node after receiving downstream routing message.
Finally, after the up route and downstream routing foundation of network, in order to realize topological maintenance and renewal, still broadcast state information periodically of network access node, by the current link-quality of broadcast state information notification neighbor node and dump energy, all like this nodes can be known in real time current neighbor node topology information and arrive the link-quality between these neighbor nodes.Grasping on the basis of these information, all these nodes all can periodically be selected father node, select father node according to being also by the common transmission desired value determining of link-quality and dump energy, so just can and upgrade network topology in the time of some node failure or link change on the spot, guarantee the self-healing ability with height of network.
The balanced wireless sense network route of bidirectional energy method based on LEPS, specifically comprises the following steps:
1, network establishment stage:
Step 101: after node powers on, carry out netinit.Node is set routing table parameter according to the identity of oneself.Aggregation node is set to 0 by the jumping figure of oneself, and jumping figure is set to maximum (255) by other its nodes;
Step 102: after initialization completes, node periodic broadcast state information.State information comprises node serial number, jumping figure, link-quality and dump energy; The neighbor node of node is just deposited into information in the routing table of oneself after receiving state information.
Step 103: the neighbor node of aggregation node is after the broadcast of receiving aggregation node, select the father node of aggregation node as oneself, and the jumping figure of oneself is set to 1, form the node of the first gradient, and next broadcast cycle is broadcasted new state information, other node is received after the state information of the first gradient node, the jumping figure that first oneself is set is 2, form the node of the second gradient, and broadcast new state information in next broadcast cycle, this process repeats down, until all nodes have all upgraded the jumping figure that oneself arrives aggregation node.Node to father node take jumping figure, link-quality and dump energy as foundation.First node selects candidate parent node according to the principle of jumping figure minimum, in the time having multiple candidate parent node, node utilizes link-quality and the dump energy in state information to calculate transmission desired value, then from candidate parent node, selects father node according to the principle of transmission desired value maximum.The computational methods of wherein transmitting desired value are as follows:
The first step: calculate link estimated value
Internodal two-way link communication quality is that the success rate by communicating by letter between statistics neighbor node is weighed.The basic thought that link is estimated is to receive that from certain neighbor node grouping accounts for this neighbor node and send to the proportion of the number of packet of this node in statistics certain hour.LEPS link estimates to comprise two parts: send cost and estimate and receive cost to estimate, the computing formula of link estimated value is as follows:
Est=SendEst×RcvEst
Wherein, SendEst and RcvEst are respectively and send success rate and successful receiving rate.In order to reduce link flapping, further adopt the exponential weighting displacement method of average (EWMA) to calculate final link estimated value.Computing formula is:
EstFinal＝EstOld×α+EstNew×(1-α)
Wherein, EstOld was the link estimated value in a upper cycle, and occupation ratio is α, and EstNew is that this cycle link is estimated, occupation ratio is (1-α).
Second step: detect dump energy
The detection of dump energy needs the electric weight detection module of physical layer to provide support, and electric weight detection module calculates dump energy by the ADC supply voltage of sampling, and computing formula is as follows:
Wherein, the precision that n is ADC, V
reffor reference voltage, N is the value in ADC output register.
The 3rd step: link estimated value and dump energy normalization
Due to link estimated value and dump energy dimension disunity, directly both values of use are transmitted and are expected that assessment will be very difficult, therefore, for reasonably distribute links quality and the dump energy influence degree to transmission desired value, first link estimated value and dump energy are normalized, i.e. normalization link estimated value (NormEst) and normalization dump energy (NormEng).Computing formula is as follows:
Wherein, the maximum that MaxEst is link-quality, RatEng is power supply rated voltage.
The 4th step: determine transmission desired value
In order to consider link-quality and dump energy in the time selecting father node, reach that can guarantee again can be with regard to the object of balanced same gradient interior nodes load compared with low packet loss ratio, transmission desired value (EXT) is represented by the weighted average of link estimated value and dump energy, wherein the former occupation ratio is β, the latter's occupation ratio is (1-β), that is:
EXT＝βNormEst+(1-β)NormEng
Step 104: node, after having selected father node, generates a downstream routing bag, and downstream routing bag comprises a path field, and the length of path field equals the depth of network.Path field is initialized as 0.
Step 105: downstream routing bag is sent to father node by node, father node is received after downstream routing bag, inserts the node serial number of oneself in the path field of route bag, is then transmitted to the father node of father node.
Step 106: repeating step 305, until downstream routing bag is forwarded to aggregation node, now, in downstream routing bag, record the path of node to aggregation node, aggregation node is deposited into the information in downstream routing bag in the routing table of oneself, has created the downstream routing of node.
2, data transfer phae
After a node networks, just the transmission of data can be carried out.In the time having data to send back aggregation node, node just sends the data to its father node.Father node sends to these data the father node of father node again, until send it back aggregation node.In the time that aggregation node need to send control command to some ordinary nodes of having networked, it just adds the path of this node in order bag, and then order is just wrapped along the node on path and is forwarded to step by step destination node.
3, topology maintenance and more new stage:
Node broadcast information periodically still after networking.Notify the current link-quality of neighbor node and dump energy by routing iinformation.All like this nodes can be known the transmission desired value between current neighbor node topology information and these neighbor nodes in real time.Grasping on the basis of these information, all ordinary nodes are periodically selected new father node according to the transmission desired value of latest computed.So just can in the time that some node failure or link change, upgrade in time network topology, guarantee the self-healing ability of network height.
Beneficial effect of the present invention:
Compared with LEPS Routing Protocol, the present invention has following beneficial effect:
1, increase downstream routing, realized the control of aggregation node to ordinary node, expanded the range of application of Routing Protocol.
2, the realization of downstream routing, based on up route, realizes simply, and extra control information is few, can effectively economize on resources.
3, jumping figure, link-quality and residue energy of node are combined and be considered as the foundation that father node is selected simultaneously, realized the load balancing of same gradient node, avoid indivedual nodes because of the overweight premature failure of load, the life cycle that has extended whole network.
Accompanying drawing explanation
1, the structure chart of the balanced wireless sense network route of the bidirectional energy based on LEPS.
2, the balanced wireless sense network route of the bidirectional energy based on LEPS workflow diagram.
3, the balanced wireless sense network route of the bidirectional energy based on LEPS father node is selected flow chart.
4, the balanced wireless sense network route of the bidirectional energy based on LEPS downstream routing Establishing process figure.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is done further and illustrated.
As shown in Figure 1, the workflow of the bidirectional energy route equalization method based on LEPS agreement disclosed in this invention is: after node powers on, first judge it oneself is aggregation node or ordinary node.If first aggregation node will carry out corresponding initialization, then start periodic broadcast routing state information, keep, to the intercepting of channel, receiving the routing iinformation from ordinary node simultaneously, safeguard downstream routing table.If ordinary node, first node carries out corresponding initialization, then go on the air routing state information intercept channel, within a routing update cycle, node receives the route bag of other node and judges, if what receive is up route bag, extract routing iinformation, maintaining routing list, if downstream routing bag, in route bag, insert routing information, then forward.In the time that a routing update cycle arrives, re-start father node according to jumping figure, link-quality and dump energy and select, after father node upgrades, send downstream routing information to aggregation node immediately.
As shown in Figure 2, described network establishment stage specifically comprises the following steps:
Step 101: after node powers on, first carry out initialization, in this process, node is set route bag parameter according to the identity of oneself.Root node jumping figure is made as 0, and the jumping figure of ordinary node is all made as maximum (255).
Step 102: after initialization completes, node starts periodic broadcast routing state information, state information comprises jumping figure, link-quality node and neighbor node between and the dump energy of node of this node to aggregation node.Wherein link-quality calculates by a link evaluator, and dump energy information needs to use the electric weight detection module of physical layer.
Step 103: the neighbor node of aggregation node is received after the routing state information of aggregation node, and aggregation node is made as to father node, and the jumping figure of oneself is made as to 1, is the first gradient node.The first gradient node is broadcasted the state information of oneself subsequently, and its neighbor node receives that the jumping figure that a hop node state information arranges oneself is 2, and a hop node is made as to candidate parent node, becomes the second gradient node.In the time having multiple candidate parent node, from candidate parent node, determine a father node according to the size of transmission desired value.The second gradient node adds after network, continues to broadcast own routing state information to neighbor node.The like, until all nodes all enter network, so just set up take aggregation node as root, the tree network take other nodes as branches and leaves, the node in network is by being divided into different gradients to the jumping figure of root node.
As shown in Figure 3, described transmission desired value is used following methods to determine:
The first step: calculate link estimated value
Internodal two-way link communication quality is that the success rate by communicating by letter between statistics neighbor node is weighed.The basic thought that link is estimated is to receive that from certain neighbor node grouping accounts for this neighbor node and send to the proportion of the number of packet of this node in statistics certain hour.Link of the present invention is estimated to continue to use the method in LEPS agreement, comprises two parts: send cost and estimate and receive cost to estimate.And represent the two-way communication cost of link by these two values.Between any two node A and B, the estimation of link-quality comprises following concrete steps:
First, computing node A receives the success rate of the grouping of grouping B transmission within a period of time.Formula is as follows:
RcvEst
A/B＝RcvCount
A/SendCount
B
Wherein, RcvCount
afor a period of time, interior nodes A receives the grouping number of Node B, SendCount
bfor Node B sends to the packet count of node A.Equally, Node B also can calculate recipient node A transmission grouping success rate and in its periodic status broadcast, comprise the own successful receiving rate that arrives all neighbor nodes, the transmission success rate of its neighbor node A using the successful receiving rate of Node B as oneself, formula is:
SendEst
A/B＝RcvEst
B/A
Node obtains sending after success rate calculating with neighbours' successful receiving rate and from the state information of neighbor node, can determine and the two-way link estimated value of this neighbor node, and computing formula is as follows:
Est=SendEst×RcvEst
Wherein, SendEst and RcvEst represent respectively to send success rate and successful receiving rate.In order to reduce link flapping, further adopt exponential weighting displacement method of average EWMA to calculate final link estimated value.
EstFinal＝EstOld×α+EstNew×(1-α)
Wherein, α is the occupation ratio of the link estimated value of a upper computation of Period, and the link that 1-α is this computation of Period is estimated occupation ratio.
Second step: detect dump energy
The detection of dump energy needs the electric weight detection module of physical layer to provide support, and electric weight detection module calculates dump energy by the ADC supply voltage of sampling, and computing formula is:
Wherein, n represents the precision of ADC, V
refrepresent reference voltage, N represents the value in ADC output register.
The 3rd step: link estimated value and dump energy normalization
Due to link estimated value and dump energy dimension disunity, directly both values of use are transmitted and are expected that assessment will be very difficult, therefore, for reasonably distribute links quality and the dump energy influence degree to transmission desired value, first link estimated value and dump energy are normalized, i.e. normalization link estimated value (NormEst) and normalization dump energy (NormEng).Computing formula is as follows:
Wherein, MaxEst represents that the maximum of link-quality is that RatEng represents power supply rated voltage.
The 4th step: determine transmission desired value
In order to consider link-quality and dump energy in the time selecting father node, reach that can guarantee again can be with regard to the object of balanced same gradient interior nodes load compared with low packet loss ratio, transmit desired value (EXT) and represented by the weighted average of link estimated value and dump energy, computing formula is as follows:
EXT＝βNormEst+(1-β)NormEng
Wherein, the occupation ratio that β is link-quality, (1-β) is the occupation ratio of dump energy.
Step 104: node, after having selected father node, generates a downstream routing bag, and downstream routing bag comprises a path field, and the length of path field equals the depth of network.Path field is initialized as 0.
Step 105: downstream routing bag is sent to father node by node, father node is received after downstream routing bag, inserts the node serial number of oneself in the path field of route bag, is then transmitted to the father node of father node.
Step 106: repeating step 305, until downstream routing bag is forwarded to aggregation node, now, in downstream routing bag, record the path of node to aggregation node, aggregation node is deposited into the information in downstream routing bag in the routing table of oneself, has created the downstream routing of node.
2, data retransmission
After a node networks, just the transmission of data can be carried out.In the time having data need to send back control node, node just sends the data to its father node.Father node sends to these data the father node of father node again, controls node until send it back.Therefore basic LEPS route is a kind of Routing Protocol that is applicable to information gathering application.
3, topology is safeguarded and is upgraded: node broadcast information periodically still after networking.Notify the current link-quality of neighbor node and dump energy by routing iinformation.All like this nodes can be known the transmission desired value between current neighbor node topology information and these neighbor nodes in real time.Grasping on the basis of these information, all nodes all can be periodically according to and neighbor node between transmission desired value reselect father node.So just can in the time that some node failure or link change, upgrade in time network topology, guarantee the self-healing ability of network height.
Claims (2)
1. the balanced wireless sense network route of the bidirectional energy based on a LEPS agreement method, wherein LEPS agreement is that link is estimated to select Routing Protocol with father node, it is characterized in that: comprise the following steps:
The first step, set up up route:
Step 101: after node powers on, carry out netinit;
Step 102: after initialization completes, node periodic broadcast state information; State information comprises node serial number, jumping figure, link-quality and dump energy;
Step 103: node is selected father node take jumping figure, link-quality and dump energy as foundation; System of selection is first to select candidate parent node according to the principle of jumping figure minimum, in the time having multiple candidate parent node; Utilize link-quality and dump energy in state information to calculate transmission desired value, then from candidate parent node, select father node according to the principle of transmission desired value maximum;
Second step, set up downstream routing:
Step 104: node, after having selected father node, generates a downstream routing bag, and downstream routing bag comprises a path field, and the length of path field equals the depth of network; Path field is initialized as 0;
Step 105: downstream routing bag is sent to father node by node, father node is received after downstream routing bag, inserts the node serial number of oneself in the path field of route bag, is then transmitted to the father node of this father node;
Step 106: repeating step 105, until downstream routing bag is forwarded to aggregation node, now, in downstream routing bag, record the path of node to aggregation node, aggregation node is deposited into the information in downstream routing bag in the routing table of oneself, has created the downstream routing of node;
The 3rd step, the forwarding of data:
Step 107: the path hop-by-hop that the data that node produces generate according to up route is uploaded to aggregation node;
Step 108: the order that aggregation node produces is assigned to destination node according to the downlink path hop-by-hop in routing table;
Wherein, in step 103, transmit definite method of desired value as follows:
The first step: calculate link estimated value
Two-way link estimated value between node is determined by following formula:
Est=SendEst×RcvEst
Wherein, SendEst and RcvEst represent respectively to send success rate and successful receiving rate, adopt exponential weighting displacement method of average EWMA to calculate final link estimated value, and computing formula is as follows:
EstFinal＝EstOld×α+EstNew×(1-α)
Wherein, EstOld is the link estimated value of a upper computation of Period, and occupation ratio is α; EstNew is that this cycle link is estimated, occupying ratio is 1-α;
Second step: detect dump energy
The computing formula of dump energy is as follows:
Wherein, the precision that n is ADC, V
reffor reference voltage, N is the value in ADC output register;
The 3rd step: link estimated value and dump energy normalization
First the two is normalized, i.e. normalization link estimated value NormEst and normalization dump energy NormEng, computing formula is as follows:
Wherein, the maximum that MaxEst is link-quality, RatEng is power supply rated voltage;
The 4th step: determine transmission desired value
Transmission desired value is the weighted average of link estimated value and dump energy, and computing formula is as follows:
EXT＝βNormEst+(1-β)NormEng
Wherein, the occupation ratio of link estimated value is β, and the occupation ratio of dump energy is (1-β).
2. the balanced wireless sense network route of bidirectional energy based on LEPS agreement according to claim 1 method, is characterized in that: the method also comprises,
Topology maintenance and more new stage:
Node broadcast information periodically still after networking; And notify the current link-quality of neighbor node and dump energy by routing iinformation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310279245.8A CN103338495B (en) | 2013-07-04 | 2013-07-04 | Two-way energy balance wireless sensing network route method based on LEPS |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310279245.8A CN103338495B (en) | 2013-07-04 | 2013-07-04 | Two-way energy balance wireless sensing network route method based on LEPS |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103338495A CN103338495A (en) | 2013-10-02 |
| CN103338495B true CN103338495B (en) | 2014-05-14 |
Family
ID=49246576
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310279245.8A Expired - Fee Related CN103338495B (en) | 2013-07-04 | 2013-07-04 | Two-way energy balance wireless sensing network route method based on LEPS |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103338495B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106162781A (en) * | 2015-03-31 | 2016-11-23 | 富士通株式会社 | The changing method of routing node, device and wireless sensor network |
| CN104853365B (en) * | 2015-05-11 | 2019-01-22 | 浙江理工大学 | It is a kind of based on damage link state prediction wireless sense network topological construction method |
| JP2018165956A (en) * | 2017-03-28 | 2018-10-25 | 富士通株式会社 | Information processing device, information processing system, and information processing program |
| CN106973015A (en) * | 2017-05-19 | 2017-07-21 | 华北电力大学（保定） | A kind of middle voltage distribution networks power line carrier communication routing algorithm |
| CN112040528B (en) * | 2020-09-10 | 2022-11-15 | 无锡职业技术学院 | Method for selecting control node of wireless ad hoc network center |
| CN114390632A (en) * | 2021-12-14 | 2022-04-22 | 南京熊猫电子股份有限公司 | Wireless mobile ad hoc network dynamic routing method based on combination of access layer and network layer |
| CN117580125B (en) * | 2023-11-16 | 2024-06-14 | 中山大学 | Underwater sensor network routing protocol system based on weighted link quality |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101217490A (en) * | 2008-01-09 | 2008-07-09 | 西南科技大学 | A Bluetooth wireless transducer network organizing and routing method |
| CN101562861A (en) * | 2009-05-15 | 2009-10-21 | 重庆邮电大学 | Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network |
| CN102404817A (en) * | 2011-10-25 | 2012-04-04 | 中国科学院计算技术研究所 | Networking method and system for wireless sensor network based on multiple sink nodes |
| CN102647472A (en) * | 2012-04-11 | 2012-08-22 | 浙江大学 | Networking method of wireless sensor network and wireless sensor network system |
| CN102802231A (en) * | 2012-08-14 | 2012-11-28 | 中国电子科技集团公司第五十四研究所 | Efficient energy aware routing method applicable to sensor network electromagnetic spectrum monitoring system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN201217490Y (en) * | 2008-05-14 | 2009-04-08 | 力帆实业(集团)股份有限公司 | Apparatus for collecting high pressure gas in vent pipe and for gear change operation |
-
2013
- 2013-07-04 CN CN201310279245.8A patent/CN103338495B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101217490A (en) * | 2008-01-09 | 2008-07-09 | 西南科技大学 | A Bluetooth wireless transducer network organizing and routing method |
| CN101562861A (en) * | 2009-05-15 | 2009-10-21 | 重庆邮电大学 | Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network |
| CN102404817A (en) * | 2011-10-25 | 2012-04-04 | 中国科学院计算技术研究所 | Networking method and system for wireless sensor network based on multiple sink nodes |
| CN102647472A (en) * | 2012-04-11 | 2012-08-22 | 浙江大学 | Networking method of wireless sensor network and wireless sensor network system |
| CN102802231A (en) * | 2012-08-14 | 2012-11-28 | 中国电子科技集团公司第五十四研究所 | Efficient energy aware routing method applicable to sensor network electromagnetic spectrum monitoring system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103338495A (en) | 2013-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103338495B (en) | Two-way energy balance wireless sensing network route method based on LEPS | |
| Ghaleb et al. | A survey of limitations and enhancements of the ipv6 routing protocol for low-power and lossy networks: A focus on core operations | |
| CN102340838B (en) | Medium access control method for prolonging network lifetime in wireless body area network | |
| Watteyne et al. | Implementation of gradient routing in wireless sensor networks | |
| US7133373B2 (en) | Wireless network with improved sharing of high power consumption tasks | |
| CN106714263B (en) | Wireless sensor network AODV routing protocol implementation system and method | |
| KR101658736B1 (en) | Wsn clustering mehtod using of cluster tree structure with low energy loss | |
| EP3573372B1 (en) | A role selection method for wireless communication systems | |
| CN103249108A (en) | Wireless sensor network balanced energy consumption route method based on non-uniform clustering | |
| CN108966239A (en) | A method of relay node is disposed based on Energy volution degree | |
| CN101790196A (en) | Correlation method of distributed access point in wireless Mesh network | |
| US11395112B2 (en) | Wireless sensor system, wireless terminal device, communication control method and communication control program | |
| CN103200643A (en) | Distributed fault-tolerant topology control method based on dump energy sensing | |
| Bagula et al. | Ubiquitous sensor network management: The least interference beaconing model | |
| Jaiswal et al. | An optimal QoS-aware multipath routing protocol for IoT based wireless sensor networks | |
| Mu | An improved AODV routing for the zigbee heterogeneous networks in 5G environment | |
| AU2021269425B2 (en) | Low power cellular base station | |
| CN112311827A (en) | Intelligent ammeter management system and method | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| Bakhsh | Energy-efficient distributed relay selection in wireless sensor network for Internet of Things | |
| CN102883398A (en) | Low-delay balanced energy consumption routing method for wireless sensing network | |
| Padyal et al. | Continuous neighbour discovery approach for improvement of routing performance in WSN | |
| Tan et al. | A distributed and dynamic data gathering protocol for sensor networks | |
| Rahman et al. | 4-N intelligent MANET routing algorithm | |
| Das et al. | Quality of Service Improvement in Neighborhood Area Networking for AMI With ZigBee-Based Tunable Clustered Scale-Free Topology and RPL Routing |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20131002 Assignee: Science and Technology Co., Ltd. is swum in Jiangsu at once Assignor: Nanjing University of Information Science and Technology Contract record no.: 2015320000189 Denomination of invention: Two-way energy balance wireless sensing network route method based on LEPS Granted publication date: 20140514 License type: Exclusive License Record date: 20150414 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140514 Termination date: 20170704 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |