CN103607748A - Maximum lifetime routing method based on node lifetimes - Google Patents
Maximum lifetime routing method based on node lifetimes Download PDFInfo
- Publication number
- CN103607748A CN103607748A CN201310597409.1A CN201310597409A CN103607748A CN 103607748 A CN103607748 A CN 103607748A CN 201310597409 A CN201310597409 A CN 201310597409A CN 103607748 A CN103607748 A CN 103607748A
- Authority
- CN
- China
- Prior art keywords
- node
- life cycle
- energy
- maximum
- grouping
- 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
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
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a maximum lifetime routing method based on node lifetimes. The maximum lifetime routing method includes the steps that a whole network is expressed by means of weighted graphs G (V and E), wherein a node pair (s and d) belonging to V is respectively a source node to be communicated and a destination node, pi (v) is a father node of a routing middle node v of the node pair (s and d), and the lifetime of a node u is used as the weight of e (u and v) of a middle node u side and a middle node v side; a target node set D is selected, and nodes in node sets from V to D are added into the node set D until the node d is selected, wherein each node selected and added into the target node set D every time should meet the requirement that the lifetime of the node is maximum in all the nodes capable of being connected to the target node set D. According to the maximum lifetime routing method, maximum lifetime routing is formed through direct reference to the node lifetimes, so data transmission amount between the nodes can be further promoted and network lifetime is prolonged; an energy control technology is introduced, so the energy efficiency is improved on the basis that resource load is not increased obviously.
Description
Technical field
The present invention relates to the route control protocol of wireless ad hoc network, particularly relate to a kind of maximum life cycle of method for routing based on node life cycle.
Background technology
At present the research of Ad hoc network is mainly concentrated on basic Routing Protocol, many draft agreements that MANET seminar proposes, such as unicast routing protocol DSR, AODV, ZRP and multicast route protocol AMRIS, AMRoute etc., and in wireless multicast most of Routing Protocol based on tree-shaped, but a little less than the structure of multicast tree is highly brittle, and it must be adjusted when connecting change, furthermore, multicast tree always needs an overall route minor structure as Link State or distance vector.The frequent change of routing vector or Link State produces the frequent variations of topological structure, finally produces a large amount of expenses and channel loading.
Due to the broadcast characteristic of wireless network, make the multicast in MANET have unique advantage, break multicast in cable network and be based upon the law on clean culture basis, can more effectively solve independently Multicast Routing Problem.Common multicast protocol has MAODV, AMRIS, AMRoute, ODMRP, CAMP etc.Maximize and save energy, improve energy efficiency is exactly that wireless autonomous network (Ad hoc) is endeavoured the key issue solving all the time.Characteristic based on Ad hoc network power supply battery, at present in the research field relevant with Ad hoc, also produced some and improved the Routing Protocol that route life cycle is target, they are mainly for the time of route searching, to fall low-energy-consumption by minimization node, and this low main cause place that is also node energy service efficiency.Typical routing algorithm based on energy efficiency has MBCR and the MMBCR algorithm being based upon on minimum energy content of battery summation basis; LPR algorithm based on the prediction lifetime; And consider electronic model impact in a real world applications, then design Routing Protocol algorithm etc.These algorithms all take improve energy content of battery efficiency, prolongation network lifetime is target.
For the algorithm based on energy efficiency, when MBCR and MMBCR algorithm are carried out, always, in all possible Route Selection, attempt avoiding those nodes that has the minimum energy content of battery, thereby may cause the just use problem of each node energy content of battery.And for LPR, each node can be used according to nearest several times the access times of dump energy are carried out to Evaluation and Prediction, result shows that this mode is better than that algorithm that carries out routing decision according to dump energy.In addition, also have the remaining power energy of relying on to carry out the best route of Dynamic Selection as assessment foundation; Each step of this route all chooses to improve by best route the data traffic that this algorithm supports.
As everyone knows, in wireless network, transfer of data is the work of energy charge maximum.At this moment algorithm idea wishes that by minimizing, transmitting energy extends network lifetime exactly.Yet above-mentioned Routing Protocol generally all sends and transmits data with ceiling capacity, cause data to send cost of energy very high.If change random little energy into, transmit data, may occur again that data are lost midway and the situation that causes retransmitting, thereby consume more energy.
Summary of the invention
The deficiency existing for overcoming above-mentioned prior art, the present invention's object is to provide a kind of maximum life cycle of method for routing based on node life cycle, form maximum route life cycle its life cycle by direct reference node, internodal data conveying capacity is further promoted, extended network lifetime; In choosing the process of route next jump node, consider residue energy of node and possible lifetime, introduce energy control technology, thereby improved greatly energy efficiency on the basis that is not significantly increased resource load, extend the life cycle of whole network.
For reaching above-mentioned and other object, the present invention proposes a kind of maximum life cycle of method for routing based on node life cycle, comprises the steps:
Step 1, by whole network utilisation weighted graph G (V, E) represent, wherein, node is respectively source node and destination node to be communicated by letter to (s, d) ∈ V, π (v) is that node is to (s, d) father node of route intermediate node v, usings life cycle of node u as the weights of intermediate node u, v limit e (u, v);
Step 2, chooses destination node collection D, chooses node in set of node V-D and adds set of node D, until node d is selected, wherein, choose the node that joins destination node collection D at every turn and all should meet, should meet its life cycle in all nodes that can be connected to D for maximum.
Further, in step 2, destination node collection D initially only comprises source node s.
Further, adopt following expression the life cycle of node u:
T(u)=Ru/p(u,v)
Wherein, T (u) is the life cycle of node u, the dump energy that Ru is node; And p (u, v) be node (u, v) between communication by the unit energy expending.
Further, after step 2, also comprise that utilizing dynamic power allocation algorithm is the step that the route chosen is calculated best transmission energy consumption.
Further, calculating the best step that transmits energy consumption comprises the steps:
If (u, v) transmitted to a grouping at node, computing node u need retransmit the desired value E (x) of the number of times of this grouping;
The desired value E (x) that need retransmit the number of times of this grouping according to node u obtains re-transmission total energy consumption, optimizes transmission grouping energy consumption and makes its minimum to obtain the optimal communication energy p (u, v) of link (u, v).
Further, node u need retransmit the desired value E (x) of the number of times of this grouping and is:
Wherein, ε
u,v(p) be packet loss rate, k is grouping retransmission time, and Pr (k) is for completing the probability of packet retransmissions present for k time.
Further, described re-transmission total energy consumption is: p (u, v)/(1-ε
u,v(p)), wherein p (u, v) is the optimal communication energy of link (u, v).
Further, described optimal communication energy p (u, v) is positioned at P
threshold* PL and P
maxbetween, P wherein
maxfor the ceiling capacity of node u Broadcasting Control grouping, P
thresholdfor the signal receive threshold of node u, PL is the path loss energy on link (u, v).
Further, the path loss energy PL=P on described link (u, v)
max/ P
rev, wherein, P
revfor node u receives the signal strength signal intensity from node v.
Further, described network is Ad hoc network.
Compared with prior art, a kind of maximum life cycle of method for routing based on node life cycle of the present invention life cycle by direct reference node forms maximum life cycle of route, and internodal data conveying capacity is further promoted, and has extended network lifetime; Simultaneously in choosing the process of route next jump node, consider residue energy of node and possible lifetime, introduce energy control technology, thereby improved greatly energy efficiency on the basis that is not significantly increased resource load, extend the life cycle of whole network.
Accompanying drawing explanation
Fig. 1 be the present invention a kind of based on node life cycle maximum life cycle method for routing flow chart of steps;
Fig. 2 is for the route of choosing is calculated the best flow chart of steps that transmits energy consumption in preferred embodiment of the present invention.
Embodiment
Below, by specific instantiation accompanying drawings embodiments of the present invention, those skilled in the art can understand other advantage of the present invention and effect easily by content disclosed in the present specification.The present invention also can be implemented or be applied by other different instantiation, and the every details in this specification also can be based on different viewpoints and application, carries out various modifications and change not deviating under spirit of the present invention.
Before introducing the present invention, first the noun using in the present invention and symbol are done to a regulation and definition.
One, relevant regulations and hypothesis
A. any node in network, can transmit data by different energy, and maximum represents with Pmax.
B.p (u, v) represents the energy charge that node u communicates by letter with node v, and its size can dynamically change.
C. whole Ad hoc network represents with figure G (V, E).Wherein, V represents the set of node in network, and E represents limit collection, the communication link between can direct-link node in can network.
D. the initial completely energy of node u is Fu; Certain dump energy is constantly Ru.
In order to simplify problem complexity, suppose: node is when communicating, and data send and born all energy charges, and the energy consumption of DRP data reception process is ignored.
Two, definition life cycle
The Routing Protocol of existing majority based on very big life cycle all usingd the cost metric of residue energy of node as self.And the present invention directly builds on cost taken by themselves the life cycle of node.Suppose that node u communicates by letter with v, can represent as follows the life cycle of node u:
T(u)=Ru/p(u,v) (1)
Here, the dump energy that Ru is node; And p (u, v) be node (u, v) between communication by the unit energy expending.
In wireless network, once certain node lost efficacy because of depleted of energy, the route that node is relevant therewith all will lose efficacy.Thereby life cycle of a route is actual is decided by the minimum node of node energy in this route.Suppose exist certain source s to the route L=of object d (s, v0, v1 ... vk, d), be expressed as follows the life cycle of route L:
The object of maximization network lifetime is for as far as possible many transmission packets.Longer when network lifetime, its traffic is just larger.Therefore, network lifetime in fact can be by under the prerequisite of finite energy, and the maximum data packet count of its transmission represents.
Fig. 1 be the present invention a kind of based on node life cycle maximum life cycle method for routing flow chart of steps.As shown in Figure 1, a kind of maximum life cycle of method for routing based on node life cycle of the present invention, is applied to Ad hoc network, comprises the steps:
Step 102, chooses destination node collection D, and destination node collection D initially only comprises source node s, chooses node in set of node V-D and adds set of node D, until node d is selected.Choose the node that joins D at every turn and all should meet, its weights (being life cycle) should meet in all nodes that can be connected to D, and it is maximum.
In preferred embodiment of the present invention, the present invention's maximum life cycle of the method for routing based on node life cycle is described below with Pseudocode Language:
Theorem: establishing L is that in figure G, node, to a route drawing by the present invention between (s, d), is present in right any other possibility route L ' of this node in figure G, has T (L) >=T (L') to set up.
Proof: by reduction to absurdity, suppose separately to deposit a node to the route L ' between (s, d) in figure G, T (L) < T (L') is set up.Might as well establish T (L)=w (u, v), have:
Set up.Node u must be minimum life cycle of the node in route L.
If exist route L=(s ..., u, v ..., d) and L '=(s, v
0, v
1... v
n, d).V wherein
ithe node in route L ', and, from node v
istart, route L ' is different from route L, thereby has L=(s, v
0, v
1... v
i-1, u, v ..., d) set up.According to definition life cycle, there is T (L')≤w (v
i-1, v
i) set up.Thereby, according to supposing T (L) < T (L') early stage, can obtain: w (v
i-1, v
i) > w (u, v).Thereby by the present invention, node u adds after set of node D, exist
according to the present invention, after node u, that add set of node D should be node v
i.In addition, because path (v
i+1, v
i+2..., v
n, each weights d) are all greater than w (u, v), node v
i+1, v
i+2..., v
nall should before node v, add in set of node D, thereby the route obtaining by the present invention should be L ' rather than L, with hypothesis test, conclusion must be demonstrate,proved.
Existing most Routing Protocol, during transmission data, node is ceiling capacity transmission to the greatest extent always, thereby causes energy consumption larger.And if random the changing with low energy consumption transmission data of node may cause again the data that need large energy consumption to transmit to be lost midway.Thereby, for different pieces of information, transmit energy consumption demand, with suitable energy, transmit all extremely important to the life cycle of every communication link.The present invention is in the route discovery stage, just by the transmission energy consumption that is every link calculation the best of final route simultaneously.Therefore, preferably, the present invention, after step 102, also comprises that utilizing dynamic power allocation algorithm is the step that the route chosen is calculated best transmission energy consumption.
Fig. 2 is for the route of choosing is calculated the best flow chart of steps that transmits energy consumption in preferred embodiment of the present invention.Specifically, for choosing maximum route life cycle, according to definition of T life cycle (u)=Ru/p (u, v), dump energy Ru can measure and broadcast and obtain, and needs to utilize dynamic power allocation algorithm (DPA) to obtaining the best (u, v) between, communication is by the unit energy p (u expending, v), as shown in Figure 2, its step is as follows:
If the energy consumption that (u, v) is transmitted to a grouping at node is p (u, v).Might as well establish, its packet loss rate is ε
u,v(p).It is ε that the number of times that node u sends required this grouping of re-transmission of node v in success to this grouping should be obeyed parameter
u,v(p) distribute for how much.Have:
Pr(k)＝(1-ε
u,v(p))(ε
u,v(p))
k-1 (4)
K: grouping retransmission time
The expectation E (x) that node u need retransmit the number of times x of certain grouping is expressed as follows:
According to desired value E(x), re-transmission total energy consumption is: p (u, v)/(1-ε
u,v(p)), optimizing transmission grouping energy consumption makes this value minimum.
Particularly, choose certain node with ceiling capacity P
maxbroadcast " control packet ", now supposes that node u receives that the signal strength signal intensity from node v is P
rev, signal to noise ratio is SINR
revcontrol packet.The signal receive threshold of node u is P
threshold.If the path loss energy on link (u, v) is PL.Optimal communication energy p (u, v) is positioned at P
threshold* PL and P
maxbetween.Path energy consumption can be passed through P
revwith P
maxcalculate.Detailed process is as follows:
The Routing Protocol of existing majority based on very big life cycle all usingd residue energy of node as self cost metric, and the present invention directly builds on cost taken by themselves the life cycle of node.In wireless network, once certain node lost efficacy because of depleted of energy, the route that node is relevant therewith all will lose efficacy.Thereby life cycle of a route is actual is decided by the minimum node of node energy in this route.According to this principle, the present invention, when selecting routing node, can consider the current dump energy of node and predict the node life cycle on the basis of this dump energy, then selects and can make the node of route maximization life cycle as next-hop node.Thereby route has obtained extension life cycle, network lifetime also can effectively extend.
While carrying out data transmission, most existing Routing Protocols are all to send and transmit data with the existing energy of maximum, cause data to send cost of energy very high, and the situation of inefficiency.Meanwhile, if change random little energy into, transmit data, may occur sending again energy shortage, data are lost and the situation that causes retransmitting midway, thereby consume more energy.Therefore, best mode, dynamically provides required least energy according to the transmitting range of data reality exactly, thereby reaches the object of the energy consumption of the every secondary data transmission of effective reduction.The present invention sends energy by Energy distribution algorithm to node dynamic assignment data before sending data, thereby has improved energy service efficiency, has extended node life span.
In sum, a kind of maximum life cycle of method for routing based on node life cycle of the present invention life cycle by direct reference node forms maximum life cycle of route, and internodal data conveying capacity is further promoted, and has extended network lifetime; Simultaneously in choosing the process of route next jump node, consider residue energy of node and possible lifetime, introduce energy control technology, thereby improved greatly energy efficiency on the basis that is not significantly increased resource load, extend the life cycle of whole network.
Compared with prior art, tool of the present invention has the following advantages:
(1) maximization route lifetime: from route initial condition to cause route to occur fracture during this period of time because node energy consumption is excessive.The present invention can guarantee sufficiently long route lifetime.
Can be by considering the life cycle of the dump energy of route next jump node and the node old maximization life cycle route self on this energy foundation in routing procedure.So improve data conveying capacity, make to cut apart phenomenon in net and postpone, thereby the life-span of whole network extended.Experiment also can prove: adopts when of the present invention, the life-span of network is longer than employing MBCR or LPR algorithm.
(2) energy consumption: dynamically adjust the required energy of transmission beginning packet.Can pass through energy control technology, the node of transmission packet can be adjusted and transmit the required energy of data according to the distance of receiving node, thereby reaches the object of effectively falling low-energy-consumption.
Most existing Routing Protocols are all to send and transmit data with ceiling capacity, cause data to send cost of energy very high.Meanwhile, if change random little energy into, transmit data, may occur again that data are lost midway and the situation that causes retransmitting, thereby consume more energy.Therefore, best mode, dynamically provides required least energy according to the transmitting range of data reality exactly, thereby reaches the object of the energy consumption of the every secondary data transmission of effective reduction.
Above-described embodiment is illustrative principle of the present invention and effect thereof only, but not for limiting the present invention.Any those skilled in the art all can, under spirit of the present invention and category, modify and change above-described embodiment.Therefore, the scope of the present invention, should be as listed in claims.
Claims (10)
1. maximum life cycle of the method for routing based on node life cycle, comprises the steps:
Step 1, by whole network utilisation weighted graph G (V, E) represent, wherein, node is respectively source node and destination node to be communicated by letter to (s, d) ∈ V, π (v) is that node is to (s, d) father node of route intermediate node v, usings life cycle of node u as the weights of intermediate node u, v limit e (u, v);
Step 2, chooses destination node collection D, chooses node in set of node V-D and adds set of node D, until node d is selected, wherein, choose the node that joins destination node collection D at every turn and all should meet, should meet its life cycle in all nodes that can be connected to D for maximum.
2. a kind of maximum life cycle of method for routing based on node life cycle as claimed in claim 1, is characterized in that: in step 2, destination node collection D initially only comprises source node s.
3. a kind of maximum life cycle of method for routing based on node life cycle as claimed in claim 2, is characterized in that, adopts following expression the life cycle of node u:
T(u)=Ru/p(u,v)
Wherein, T (u) is the life cycle of node u, the dump energy that Ru is node; And p (u, v) be node (u, v) between communication by the unit energy expending.
4. a kind of maximum life cycle of method for routing based on node life cycle as claimed in claim 2, is characterized in that: after step 2, also comprise that utilizing dynamic power allocation algorithm is the step that the route chosen is calculated best transmission energy consumption.
5. a kind of maximum life cycle of method for routing based on node life cycle as claimed in claim 4, is characterized in that, calculates the best step that transmits energy consumption and comprises the steps:
If (u, v) transmitted to a grouping at node, computing node u need retransmit the desired value E (x) of the number of times of this grouping;
The desired value E (x) that need retransmit the number of times of this grouping according to node u obtains re-transmission total energy consumption, optimizes transmission grouping energy consumption and makes its minimum to obtain the optimal communication energy p (u, v) of link (u, v).
6. a kind of maximum life cycle of method for routing based on node life cycle as claimed in claim 5, is characterized in that, the desired value E (x) that node u need retransmit the number of times of this grouping is:
Wherein, ε
u,v(p) be packet loss rate, k is grouping retransmission time, and Pr (k) is for completing the probability of packet retransmissions present for k time.
7. a kind of maximum life cycle of method for routing based on node life cycle as claimed in claim 6, is characterized in that, described re-transmission total energy consumption is: p (u, v)/(1-ε
u,v(p)), wherein p (u, v) is the optimal communication energy of link (u, v).
8. a kind of maximum life cycle of method for routing based on node life cycle as claimed in claim 7, is characterized in that: described optimal communication energy p (u, v) is positioned at P
threshold* PL and P
maxbetween, P wherein
maxfor the ceiling capacity of node u Broadcasting Control grouping, P
thresholdfor the signal receive threshold of node u, PL is the path loss energy on link (u, v).
9. a kind of maximum life cycle of method for routing based on node life cycle as claimed in claim 8, is characterized in that: the path loss energy PL=P on described link (u, v)
max/ P
rev, wherein, P
revfor node u receives the signal strength signal intensity from node v.
10. a kind of maximum life cycle of method for routing based on node life cycle as claimed in claim 1, is characterized in that: described network is Ad hoc network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310597409.1A CN103607748A (en) | 2013-11-22 | 2013-11-22 | Maximum lifetime routing method based on node lifetimes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310597409.1A CN103607748A (en) | 2013-11-22 | 2013-11-22 | Maximum lifetime routing method based on node lifetimes |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103607748A true CN103607748A (en) | 2014-02-26 |
Family
ID=50125941
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310597409.1A Pending CN103607748A (en) | 2013-11-22 | 2013-11-22 | Maximum lifetime routing method based on node lifetimes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103607748A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110213805A (en) * | 2019-05-20 | 2019-09-06 | 惠州学院 | Wireless ad hoc network routing decision processing method and system |
| CN112637804A (en) * | 2020-11-19 | 2021-04-09 | 中国人民解放军国防科技大学 | Dynamic layered networking protocol for obstacle avoidance wireless sensor network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101742554A (en) * | 2010-01-15 | 2010-06-16 | 南京邮电大学 | Congestion control method of multi-path transmission mechanism of wireless multimedia sensor network |
| CN101854695A (en) * | 2010-06-12 | 2010-10-06 | 苏州联科盛世科技有限公司 | Method for determining routing of wireless sensor network based on energy and delay ant colony optimization |
-
2013
- 2013-11-22 CN CN201310597409.1A patent/CN103607748A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101742554A (en) * | 2010-01-15 | 2010-06-16 | 南京邮电大学 | Congestion control method of multi-path transmission mechanism of wireless multimedia sensor network |
| CN101854695A (en) * | 2010-06-12 | 2010-10-06 | 苏州联科盛世科技有限公司 | Method for determining routing of wireless sensor network based on energy and delay ant colony optimization |
Non-Patent Citations (1)
| Title |
|---|
| 熊鹏: "无线自组网中新的基于极大生存期的路由算法", 《上海电机学院学报》, no. 6, 31 December 2012 (2012-12-31) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110213805A (en) * | 2019-05-20 | 2019-09-06 | 惠州学院 | Wireless ad hoc network routing decision processing method and system |
| CN112637804A (en) * | 2020-11-19 | 2021-04-09 | 中国人民解放军国防科技大学 | Dynamic layered networking protocol for obstacle avoidance wireless sensor network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104093180B (en) | Wireless sensing network route method based on multi-gateway data transmisison | |
| Hassan et al. | Improved routing metrics for energy constrained interconnected devices in low-power and lossy networks | |
| JP2019502282A (en) | Method for adaptively and jointly managing routing policies and retransmission policies of nodes in an underwater network, and means for implementing the same | |
| CN103476086B (en) | Dynamic multi-path AODV method for routing based on the prediction of node congestion degree | |
| CN103200643B (en) | Based on the distributed fault-tolerance topology control method of dump energy perception | |
| CN105848238B (en) | Wireless sensor network IPv6 method for routing based on multi-parameter | |
| CN107580293A (en) | A kind of aggregation node method for relocating based on fictitious force | |
| CN110932969A (en) | Advanced metering system AMI network anti-interference attack routing algorithm for smart grid | |
| CN103929778A (en) | Data grading transmission method | |
| Pantoni et al. | A gradient based routing scheme for street lighting wireless sensor networks | |
| CN103607748A (en) | Maximum lifetime routing method based on node lifetimes | |
| CN104320825A (en) | Ad hoc network route selection method based on repeated game | |
| Alwan et al. | Reliable fault-tolerant multipath routing protocol for wireless sensor networks | |
| CN110213805B (en) | Wireless ad hoc network routing decision processing method and system | |
| Choi et al. | A new energy-aware source routing protocol for maximization of network lifetime in MANET | |
| Erdol et al. | A novel energy aware routing function for internet of things networks | |
| Sharma et al. | Performance evaluation of MANETs with Variation in transmission power using ad-hoc on-demand multipath distance vector routing protocol | |
| Kusumamba et al. | A reliable cross layer routing scheme (CL-RS) for wireless sensor networks to prolong network lifetime | |
| CN103532667A (en) | Reliable wireless sensor network data transmission method based on Chinese remainder theorem | |
| Echoukairi et al. | A New Objective Function for RPL Based on Combined Metrics in Mobile IoT. | |
| Pešović et al. | Effect of hidden nodes in IEEE 802.15. 4/ZigBee wireless sensor networks | |
| Rahman et al. | 4-N intelligent MANET routing algorithm | |
| CN103002536A (en) | Energy efficient wireless multi-hop network routing mechanism based on random walks | |
| CN102932869B (en) | Distance and delay based method for effectively transmitting energy in mobile relay system | |
| CN104717752A (en) | Transmission scheduling time slot allocation method based on data aggregation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140226 |