CN102781060A - Method for realizing routing in wireless network, forwarding node and wireless network - Google Patents
Method for realizing routing in wireless network, forwarding node and wireless network Download PDFInfo
- Publication number
- CN102781060A CN102781060A CN2011101230825A CN201110123082A CN102781060A CN 102781060 A CN102781060 A CN 102781060A CN 2011101230825 A CN2011101230825 A CN 2011101230825A CN 201110123082 A CN201110123082 A CN 201110123082A CN 102781060 A CN102781060 A CN 102781060A
- Authority
- CN
- China
- Prior art keywords
- node
- energy consumption
- information data
- forward node
- neighbor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention provides a method for realizing routing in a wireless network, a forwarding node and the wireless network. The wireless network comprises a plurality of nodes. The method comprises the following steps of using nodes which information data sent by a first forwarding node with a first transmitting power can reach as neighbor nodes of the first forwarding node in the nodes; selecting a first neighbor node, determining the next second forwarding node to transmit the information data according to the size relationship between the second link energy consumption between the forwarding node and the non-first neighbor node and the first link energy consumption between the forwarding node and the first neighbor bode. The technology is applicable if any changes of the nodes in a wireless network exist, thus, the information data can be flexibly transmitted; and moreover, as the power of the transmitted information data between the selected forwarding nodes is smaller than the first transmitting power, thus, the energy consumption for transmitting information data is saved, and the transmission delay is reduced.
Description
Technical field
The present invention relates to radio network technique, be meant a kind of method, forward node and wireless network of in wireless network, realizing route especially.
Background technology
Wireless sensor network (is called for short wireless network; WSNs; Wireless Sensor Networks) forms with a kind of form of self-organizing as node by a plurality of intelligence sensors with environment sensing, data processing and communication capacity; Communication between intelligence sensor node needs the support of Routing Protocol; The network topology of existing fixed mesh can't satisfy the robustness requirement of using routing mechanism, thereby choose reasonable is based on the Routing Protocol of self adaptation change in topology, and effectively the defeated distance of each jump set of Control Node becomes the problem that the current wireless sensor network need solve.
In such Routing Protocol; Use the movable forward node of Dynamic Selection as next node forwarding information data; Utilize and receive signal strength signal intensity indication (RSSI, Received Signal Strength Indicator) ranging technology location and select to be fit to the forward node of the node of distance as movable route.
The inventor finds that there is following problem in prior art: in order under limited node resource, to save the energy consumption of transmit information data; Reduce propagation delay time; Must Dynamic Programming go out the life cycle that only transmission range prolongs wireless network, to meet the different needs.
Summary of the invention
The technical problem that the present invention will solve provides a kind of method, forward node and wireless network of in wireless network, realizing route; Be used at the dynamic forward node of selecting of wireless network with transmit information data; And selected forward node can be saved the energy consumption of transmission data, reduces propagation delay time.
For solving the problems of the technologies described above; Embodiments of the invention provide a kind of method that in wireless network, realizes route; Said wireless network comprises a plurality of nodes; Method comprises: each node that the information data that first forward node in a plurality of nodes is sent with first transmitting power can arrive is as the neighbor node of said first forward node, and each said neighbor node forms the neighbor node set of said first forward node; In said neighbor node set, select one first neighbor node, the link energy consumption between said first forward node and said first neighbor node is the first link energy consumption; Link energy consumption between each non-first neighbor node in said first forward node and the set of said neighbor node is the second link energy consumption; Can be consuming time when the said first link energy consumption less than each said second link, confirm that said first neighbor node is second forward node; Wherein, said information data is carried out route between different forward node.
In the described method, first forward node of receiving said information data is initial forward node, and the final forward node that arrives of said information data is a destination node; The very first time that each said forward node was received, handled and/or sent said information data, and said initial forward node obtained said information data is routed to said destination node from said initial forward node propagation delay time to second time interval addition of the said information data of the last transmission of distance between the said destination node at interval.
In the described method; The time span that said first forward node receives said information data is that first period of the day from 11 p.m. to 1 a.m prolongs; The time span that said first forward node is handled said information data is that second period of the day from 11 p.m. to 1 a.m prolongs; The time span that said first forward node sends said information data is that the 3rd period of the day from 11 p.m. to 1 a.m prolongs, and the time span of the said information data of transmission unit discharge is that the 4th period of the day from 11 p.m. to 1 a.m prolongs on unit distance; The said very first time obtains through following mode at interval: the quantity of said forward node and said first period of the day from 11 p.m. to 1 a.m prolong to multiply each other and obtain the first time delay product; Other quantity and said second period of the day from 11 p.m. to 1 a.m of forward node that does not comprise said destination node prolongs to multiply each other and obtains the second time delay product; The quantity of said forward node and said the 3rd period of the day from 11 p.m. to 1 a.m prolong to multiply each other and obtain the 3rd time delay product, the said first time delay product, the second time delay sum of products, the second time delay sum of products as the said very first time at interval; Said second time interval obtains through following mode: said initial forward node prolongs to multiply each other to the distance between the said destination node and said the 4th period of the day from 11 p.m. to 1 a.m and obtains the 4th time delay product as said second time interval.
In the described method, first forward node of receiving said information data is initial forward node, and the final forward node that arrives of said information data is a destination node; All types of said nodes are received needed first energy of said information data, and each said forward node is handled and/or is sent the needed second energy addition of said information data and obtains said information data is routed to said destination node from said initial forward node energy consumption.
In the described method; It is the first sub-energy consumption that said first forward node receives the energy that said information data need consume; It is the second sub-energy consumption that said first forward node is handled the energy that said information data need consume, and it is the 3rd sub-energy consumption that said first forward node sends the energy that said information data need consume; Said first energy obtains through following mode: the interstitial content of all types node and the said first sub-energy consumption multiply each other and obtain the first energy consumption product as said first energy in the said wireless network; Said second energy obtains through following mode: other quantity and the said second sub-energy consumption of forward node that does not comprise said destination node multiplies each other and obtains the second energy consumption product, and other quantity and the said the 3rd sub-energy consumption of forward node that does not comprise said destination node multiplies each other and obtain the 3rd energy consumption product; The said second energy consumption sum of products the 3rd energy consumption sum of products is as said second energy.
In the described method, judge that the said first link energy consumption specifically comprises less than each said second link energy consumption: obtain the said first link energy consumption; Obtain the said second link energy consumption; Obtain the 3rd link energy consumption between said first neighbor node and non-first neighbor node; If the said second link energy consumption more than or equal to said first link energy consumption and said the 3rd link energy consumption sum, judges that then said first neighbor node is said second forward node.
A kind of forward node of in wireless network, realizing route; Comprise: the neighbor node identifying unit; Each node that is used for the information data that said forward node sends with first transmitting power can be arrived is as the neighbor node of said forward node, and each said neighbor node forms the neighbor node set of said forward node; Link energy consumption acquiring unit is used for selecting one first neighbor node in said neighbor node set, and the link energy consumption between said forward node and said first neighbor node is the first link energy consumption; Link energy consumption between each non-first neighbor node in said forward node and the set of said neighbor node is the second link energy consumption; The forward node identifying unit, being used for can be consuming time less than each said second link when the said first link energy consumption, confirms that said first neighbor node is second forward node; Wherein, said information data is carried out route between different forward node.
A kind of wireless network; Said wireless network comprises a plurality of forward node and non-forward node; Each forward node comprises: the neighbor node identifying unit; Each node that is used for the information data that said forward node sends with first transmitting power can be arrived is as the neighbor node of said forward node, and each said neighbor node forms neighbor node set; Link energy consumption acquiring unit is used for selecting one first neighbor node in said neighbor node set, and the link energy consumption between said forward node and said first neighbor node is the first link energy consumption; Link energy consumption between each non-first neighbor node in said forward node and the set of said neighbor node is the second link energy consumption; The forward node identifying unit, being used for can be consuming time less than each said second link when the said first link energy consumption, confirms that said first neighbor node is second forward node; Wherein, said information data is carried out route between different forward node.
In the described wireless network; Also comprise: the propagation delay time computing unit; The very first time that is used for each said forward node is received, handles and/or send said information data, and initial forward node obtained said information data is routed to said destination node from said initial forward node propagation delay time to second time interval addition of the said information data of the last transmission of the distance of destination node at interval; Wherein, first forward node of receiving said information data is said initial forward node, and the final forward node that arrives of said information data is said destination node.
In the described wireless network; Also comprise: the energy consumption computing unit; Be used for all types of said nodes are received needed first energy of said information data, and each said forward node is handled and/or is sent the needed second energy addition of said information data and obtains said information data is routed to destination node from initial forward node energy consumption; Wherein, first forward node of receiving said information data is said initial forward node, and the final forward node that arrives of said information data is said destination node.
The beneficial effect of technique scheme of the present invention is following: according to the second link energy consumption between forward node and non-first neighbor node; And the magnitude relationship between the first link energy consumption between the forward node and first neighbor node confirms that next second forward node is with transmit information data; And the node in wireless network all can be suitable for when any variation takes place should technology, transmit information data that therefore can dynamic flexible; And, reduced propagation delay time because the power of transmit information data has been saved the energy consumption of transmit information data all less than first transmitting power between selected forward node.
Description of drawings
Fig. 1 is a transmit information data sketch map between embodiment of the invention wireless sensor network node;
Fig. 2 is a kind of method flow sketch map of in wireless network, realizing route of the embodiment of the invention;
Fig. 3 organizes themselves into the wireless sensor network sketch map for the wireless sensor node of embodiment of the invention random distribution;
Fig. 4 is an embodiment of the invention MFR method transmit information data operation principle sketch map;
Fig. 5 is that embodiment of the invention propagation delay time is with transmission range change curve sketch map;
Fig. 6 is that embodiment of the invention energy consumption is with transmission range change curve sketch map.
Embodiment
For technical problem, technical scheme and advantage that the present invention will be solved is clearer, will combine accompanying drawing and specific embodiment to be described in detail below.
In the embodiment of the invention; In the wireless sensor network as shown in Figure 1 (abbreviation wireless network); First node of receiving said information data is initial forward node, need information data be sent to distance and be M destination node at a distance, and destination node specifically is a base station in the network.In the process of transmit information data; Can select node can reach maximum transmission distance value (RSSI; Received Signal Strength Indication) certain node at minimum place is as the forward node of next jumping; Also can select the forward node of RSSI value certain node in preestablishing scope as next jumping, transmitting the most at last through multi-hop, information data is sent to destination node.
Each node in the wireless sensor network has following attribute with other elements: 1, and the performance parameter of the wave point of all nodes is consistent, has identical maximum transmission power, receiving sensitivity and channel speed; 2, channel gain is invariable during receiving information packet; 3, the Radio Link bi-directional symmetrical; 4, network possesses metastable transmission of wireless signals model; 5, wireless interface card can provide the incoming level value of signal for the MAC layer; 6, the transmitting power of wireless interface card is adjustable continuously.
The embodiment of the invention provides a kind of method that in wireless network, realizes route, and as shown in Figure 2, said wireless network comprises a plurality of nodes, and method comprises:
Link energy consumption between each non-first neighbor node in said first forward node and the set of said neighbor node is the second link energy consumption;
Use the technological means that is provided; According to the second link energy consumption between forward node and non-first neighbor node; And the magnitude relationship between the first link energy consumption between the forward node and first neighbor node confirms that next forward node-second forward node is with transmit information data; And the node in wireless network all can be suitable for when any variation takes place should technology, transmit information data that therefore can dynamic flexible; And, reduced propagation delay time because the power of transmit information data thereby has been saved the energy consumption of transmit information data all less than first transmitting power between selected forward node.
In the wireless network; The forward node that comprises initial forward node and destination node has formed a forward node set; Other non-forward node has formed the ordinary node set as ordinary node; The quantity of forward node is first quantity in the forward node set, and the quantity of ordinary node is second quantity in the ordinary node set.The formed agreement of method that realizes route in the wireless network can be described as transmission range control (MVR Network Based; Most Forward with Variable Rdius) agreement; The MVR agreement comprises: make up with one and jump the corresponding optimization neighbor node set (ONS, Optimized Neighbor Set) of optimization topological network, gather through the optimization neighbours and control route requests message (RREQ; Route REQuest) repeating process is realized the power control strategy that E-Packets.First forward node wherein can be any one forward node in the forward node set.
In a preferred embodiment, each forward node forms forward node set; In said forward node set, first node of receiving said information data is initial forward node in the said wireless network, and the final node that arrives of said information data is a destination node; Information data is forwarded to the propagation delay time T of destination node from said initial forward node
MVRObtain through following mode:
The very first time that each forward node was received, handled and/or sent said information data, and said initial forward node obtained said information data is routed to said destination node from said initial forward node propagation delay time T to second time interval addition of the said information data of the last transmission of distance between the said destination node at interval
MVR
The time span that said first forward node receives said information data is that first period of the day from 11 p.m. to 1 a.m prolongs Treceive,
The time span that said first forward node is handled said information data is that second period of the day from 11 p.m. to 1 a.m prolongs Tdeal,
The time span that said first forward node sends said information data is that the 3rd period of the day from 11 p.m. to 1 a.m prolongs Tsend,
The time span of the said information data of transmission unit discharge is that the 4th period of the day from 11 p.m. to 1 a.m prolongs Ttrans on unit distance;
Therefore, the very first time obtains through following mode at interval:
The quantity of said forward node and said first period of the day from 11 p.m. to 1 a.m prolong to multiply each other and obtain the first time delay product,
Other quantity and said second period of the day from 11 p.m. to 1 a.m of forward node that does not comprise said destination node prolongs to multiply each other and obtains the second time delay product,
The quantity of said forward node and said the 3rd period of the day from 11 p.m. to 1 a.m prolong to multiply each other and obtain the 3rd time delay product,
The said first time delay product, the second time delay sum of products, the second time delay sum of products are as said very first time interval;
Second time interval obtained through following mode:
Said initial forward node prolongs to multiply each other to the distance between the said destination node and said the 4th period of the day from 11 p.m. to 1 a.m and obtains the 4th time delay product as said second time interval.
In an application scenarios, information data is M from the distance that said initial forward node is forwarded to said destination node:
When M can not be divided exactly by r, T
MVR=Q [(M/r+2) * (Treceive+Tsend)+(M/r+1) * Tdeal+M*Ttrans], 0＜r＜Rmax;
When M can be divided exactly by r, T
MVR=Q [(M/r+1) * (Treceive+Tsend)+(M/r) * Tdeal+M*Ttrans], 0＜r＜Rmax;
Wherein, ordinary node receives only information data but forwarding information data not; In the formula; The time delay that forward node received, handles and sent the information data of unit discharge is respectively Treceive; Tdeal and Tsend, said forward node transmit the information data of unit discharge on unit distance time delay is Ttrans, information data from initial forward node be forwarded to destination node the distance of process be M; The interstitial content of all types node is N in the wireless network; R is the transmission range of forward node, and normally forward node information data of sending with first transmitting power can reach, and Q is the total flow of information data.
In a preferred embodiment, first forward node of receiving said information data is initial forward node, and the final forward node that arrives of said information data is a destination node; Information data is forwarded to the energy consumption E of destination node from said initial forward node
MVRObtain through following mode: all types of said nodes are received needed first energy of said information data, and each said forward node is handled and/or sent the needed second energy addition of said information data and obtains said information data is routed to said destination node from said initial forward node energy consumption.Wherein:
It is the first sub-energy consumption Qe that said first forward node receives the energy that said information data need consume
rB,
The energy that the said first forward node processing information data need consume is the second sub-energy consumption Qe
dB,
It is the 3rd sub-energy consumption Qe that said first forward node is launched the energy that said information data need consume
tB.
Therefore, first energy obtains through following mode: the interstitial content of all types node and the said first sub-energy consumption multiply each other and obtain the first energy consumption product as said first energy in the said wireless network;
Second energy obtains through following mode: other quantity and the said second sub-energy consumption of forward node that does not comprise said destination node multiplies each other and obtains the second energy consumption product, and other quantity and the said the 3rd sub-energy consumption of forward node that does not comprise said destination node multiplies each other and obtain the 3rd energy consumption product;
The said second energy consumption sum of products the 3rd energy consumption sum of products is as said second energy.
In an application scenarios; Information data is M from the distance that said initial forward node is forwarded to said destination node; After each forward node sends said information data; Each neighbor node of forward node can receive this information data as ordinary node, and each said ordinary node is handled the energy E that said information data consumes
Normal=Qe
rTherefore B can obtain energy consumption E through following mode
MVR:
When M can not be divided exactly by r, E
MVR=Q (e
t+ e
dr
n) * (M/r+1) B+N*Qe
rB;
When M can be divided exactly by r, E
MVR=Q (M/r) * (e
t+ e
dr
n) B+N*Qe
rB;
In the formula, each said forward node consumed energy E
Routing'=Q (e
t+ e
dr
n+ e
r) B, it is E '=Qe that said destination node receives said information data consumed energy
rB, each said ordinary node consumed energy is E
Normal=Qe
rB; Wherein, e
dFor handling the energy of every bit information data consumes, e
tFor launching the energy that every bit information consumes, e
rFor receiving the energy that every bit information consumes; R is the transmission range of forward node; Normally forward node information data of sending with first transmitting power can reach, and n is the channel energy loss parameter, and B is the bit rate of wireless network; N is the interstitial content of all types node, and Q is the total flow of information data.
The environment of the loss parameter n of channel energy during with transmit information data is relevant, to propagation delay time T
MVRWith energy consumption E
MVRWhen setting n=2 in the process of verifying:
e
t＝50*10-9J/bit；
e
r＝50*10-9J/bit；
e
d＝100*10-12J/bit/m2；
B＝1kbit/s。
In a preferred embodiment, step 103 specifically comprises:
Obtain the said first link energy consumption;
Obtain the said second link energy consumption;
Obtain the 3rd link energy consumption between said first neighbor node and non-first neighbor node; Wherein, non-first neighbor node can be described as second neighbor node;
If the said second link energy consumption more than or equal to said first link energy consumption and said the 3rd link energy consumption sum, judges that then said first neighbor node is said second forward node.
In a preferred embodiment, the first current forward node obtains the pairing neighbor node of this current forward node through following mode:
Send agreement through request transmission/permission and obtain neighbor node;
And/or, obtain neighbor node through the route requests message;
And; If node does not send the control message of MAC layer and does not send the RREQ message of route layer in a predetermined cycle; Then can produce a beacon (Beacon) message or produce greetings (Hello) message and declare the existence of self, receive from the Beacon message of said node or hello packet then this node as a neighbor node as if said forward node at the MAC layer at the route layer.
Use the technological means that each preferred embodiment provides, as shown in Figure 3, in an application scenarios; The wireless sensor node of random distribution has organized themselves into wireless sensor network in zone, and wherein, initial forward node is positioned at initial point; Base station as destination node is positioned on the X axle apart from the M place; (0, a M) random distribution N node in the scope, the maximum transmission distance of node is Rmax.At the route layer information data is realized the route based on topology control, G=(V, E) the undirected network topological diagram of expression wireless network; G '=(V; E ') the undirected network topological diagram of expression power optimization, V is the set of node in undirected network topological diagram and the undirected network topological diagram of power optimization, E is the set of tie link between node in the undirected network topological diagram; E ' is the set of power optimization link between node in the undirected network topological diagram of power optimization, obviously G ' ∈ G.
Current forward node is after obtaining neighbor node path loss correlation information; To set up the corresponding neighbor node set ONS that optimizes through optimizing neighbor algorithm; Comprise: at first before carrying out the optimization neighbor algorithm; Current forward node is gathered NS with neighbor node and is duplicated formation copy NSC (NS-Copy), and execution optimization neighbor algorithm is gathered to obtain optimizing neighbor node on NSC, and after the optimization neighbor algorithm is complete, duplicates a neighbor node again and gather NS.The set of the neighbor node of node i is designated as NS (i), and node j ∈ NS (i) is if node j is the neighbor node of node i, for u ∈ NS arbitrarily
i, and u ≠ j, satisfy P
Ij+ P
Ju≤P
IuSet up, then j ∈ ONS
i, wherein, NS
iBe the neighbor node set of node i with each neighbor node in the hop distance of maximum power-first transmitting power emission information data, ONS
iBe the optimization neighbor node set of node i, node j is the power optimization neighbor node of node i, P
IjBeing the first link energy consumption, is to guarantee the needed minimum emissive power of communicating by letter between node i and node j, P
JuBe the 3rd link energy consumption, P
IuBe the second link energy consumption, ONS is obviously arranged
i∈ NS
iCan know that optimizing neighbor node possesses symmetry, if node j is the power optimization neighbours of node i, then node i also is the power optimization neighbor node of node j, promptly has: if j ∈ ONS
i, i ∈ ONS then
j
Initial forward node collection/reception information data also produces Irish flow size and be the flow of Q, and the route arrival destination node-base station, path through apart from M is without loss of generality, and thinks apart from not producing other any data traffics on the path of M.Information data in that initial forward node sends routes in the process of destination node through multi-hop, should expect propagation delay time T
MVRMore little good more, energy consumption E
MVRMore little good more, whole multi-hop repeating process comprises:
Ordinary node receives only information data but forwarding information data not in the routing procedure; Be the receive time delay that produced of ordinary node processing information data, the propagation delay time that processing delay will not influence whole wireless network; Thereby only choose in the transmission path as the forward node of next jumping and just need consider the time delay that it receives, handles and send information data; The time delay that forward node received, handles and sent the information data of unit discharge respectively is Treceive; Tdeal and Tsend, the time delay of the information data of transmission unit discharge is Ttrans on unit distance.
Catabiotic element comprises sensor element, processor elements and wireless communication unit in the node; Progress along with integrated circuit technology; It is very low that the power consumption of processor and sensor element becomes, and therefore most energy consumptions only consider to consume the energy on wireless communication unit when energy spectrometer on wireless communication unit; Be that N node all is in active state in the assumed wireless network, the energy consumption of forward node mainly occurs in reception, handles and sends in the information data process.The energy of per second consumption was when wireless sensor node sent signal: Et=(e
t+ e
dr
n) B, receive wireless signal and need consume fixing energy E r=e
rB, B are wireless bit rate, generally adopt a fixing parameter, and B is the bit rate of wireless network, e
dFor handling the energy of every bit information data consumes, e
tFor launching the energy that every bit information consumes, e
rFor receiving the energy that every bit information consumes, n is the channel energy loss parameter, and is relevant with the environment of transmission, and usually between 2 to 4, N is the number of all types node, and r is the transmission range of forward node.
Channel energy loss parameter n is relevant with the environment of transmission, to propagation delay time T
MVRWith energy consumption E
MVRWhen setting n=2 in the process of verifying:
e
t＝50*10-9J/bit；
e
r＝50*10-9J/bit；
e
d＝100*10-12J/bit/m2；
B＝1kbit/s。
Irish flow size is being transferred to the process of destination node from initial forward node for the information data of Q; Because 1 bit information transfer of data 100m is equivalent to carry out the energy that 3000 computationses consume apart from the energy of needs, so the energy of node processing information data consumption is very low for the energy of transmit information data consumption.
In the prior art, following strategy: MFR (Most Forward with Fixed Radius), NFP (Nearest withForward Progress) are arranged when in wireless sensor network, selecting next-hop node to continue the forwarding information data as father node.
MFR: as shown in Figure 4, the maximum transmission distance of any node is Rmax, and this maximum transmission distance Rmax also is the radius that node one is jumped; With initial forward node is that initial point, radius are that Rmax makes a circle; Each jumps institute's region covered area is A; The node that in regional A, distributes all is in the jumping scope of initial forward node, then selects the node at node maximum transmission distance Rmax place to transmit as next-hop node.The main purpose of MFR strategy is the jumping figure that reduces as far as possible in the transmission course, and information data is passed to destination node with fast as far as possible speed.
When M can be divided exactly by Rmax, the MFR propagation delay time
T
MFR＝Q[(M/Rmax+1)(Treceive+Tdeal+Tsend)+M?Ttrans+Tsend+Treceive]＝Q[(M/Rmax+2)(Treceive+Tsend)+(M/Rmax+1)Tdeal+M?Ttrans]
When M can not be divided exactly by Rmax, the MFR propagation delay time
T
MFR＝Q[(M/Rmax)(Treceive+Tdeal+Tsend)+M?Ttrans+Tsend+Treceive]＝Q[(M/Rmax+1)(Treceive+Tsend)+(M/Rmax)Tdeal+MTtrans]
Adopting the MFR strategy is the energy consumption E of the information data transmission of Q to destination node A with Irish flow size
MFRComprise:
1, initial forward node produces the information data of Irish flow Q, and it sends energy is E=Q (e
t+ e
dR
Max n) B;
2, information data arrives destination node through M/Rmax (M can be divided exactly by Rmax) or the individual movable forward node of M/Rmax+1 (M can not be divided exactly by Rmax), and each forward node all needs to receive, handle and the forwarding information data consumed energy E
Routing=Q (e
t+ e
dR
Max n+ e
r) B;
3, destination node receives energy E=Qe that information data consumes
rB, other are not in a last redirect as the ordinary node of forward node and send out in the coverage of node in the information data transmission process, receive information data but do not transmit, so each ordinary node consumed energy E
Normal=Qe
rB.
Therefore, M can not be by R
MaxWhen dividing exactly, the MFR energy consumption
E
MFR＝Q(e
t+e
d?R
max n)(M/R
max+1)B+N?Qe
rB
M can be by R
MaxWhen dividing exactly, the MFR energy consumption
E
MFR＝Q(M/R
max)(e
t+e
d?R
max n)B+N?Qe
rB
NFP: the nearest node of chosen distance father node is as next-hop node, the forwarding information data.Because the transmission range between every hop node is shorter; Therefore the main target of this selection strategy is to reduce the energy that every hop node transmission is consumed as far as possible, and the NFP data transmission policies is divided into initial forward node, 3 types of N forward node and destination nodes except that initial forward node with node.
Propagation delay time T
NFP=Q [(N+2) (Treceive+Tsend)+(N+1) Tdeal+M Ttrans]
The energy consumption E that information data transmission to the destination node that employing NFP strategy is Q with Irish flow size consumes
NFP:
Suppose that the distance of N movable forward node from the base station is respectively X
j(j=1,2 ..., N), 0＜X
1＜X
2＜...＜X
N＜M, distance is X between then initial forward node (base station) to the next forward node
1, N forward node two adjacent spacings are X
i-X
i-1 (i=2 ..., N), distance is M-X between N forward node to destination node
NFor satisfying the NFP transmission policy, between two adjacent nodes in the transmission path distance all less than Rmax, i.e. X1＜Rmax, X
i-X
i-1＜Rmax (i=2 ..., N) and M-X
N＜Rmax then jumps through N+1, and the information data of Q flow can be forwarded to destination node.
In like manner in the analysis of MFR strategy energy consumption, initial forward node position is expressed as X
0=0, then
For proving absolutely the technique effect of technological means of the present invention, introduce the propagation delay time and the energy consumption of each transmission method of data computation at present, set:
Treceive＝50ns
Tdeal＝(1/7.3728)＊10
-6s
Tsend＝50ns
Ttrans＝(1/3)＊10
-8s
When n=2, e
t=50*10
-9J/bit, e
r=50*10
-9J/bit, e
d=100*10
-12J/bit/m
2, B=1kbit/s.
Adopt different transmission method transmit information data can produce the different techniques effect, it is following with the result of calculation of energy consumption respectively 3 kinds of transmission methods to be delayed time:
The MFR method:
T
MFR＝6.02345＊10
-4Qs，E
MFR＝0.00755QJ
The NFP method:
T
NFP＝5.20858＊10
-3Qs，E
NFP＝0.037891QJ
The MVR method:
T
MVR＝1.45349＊10
-3Qs，E
MVR＝0.005545QJ
In the time of can finding that average every 100m is distributed with 10 nodes in the network, the time delay of NFP transmission policy and energy consumption are all maximum, so the NFP transmission policy does not satisfy, and the wireless sensor network energy consumption is little, the requirement of time delay weak point; MFR is little than the MVR propagation delay time, but the energy of its consumption is bigger, and when energy consumption requires when higher, the MVR strategy is superior to MFR; When to delay requirement when higher, the MFR strategy is superior to MVR but is not clearly; And also find when what transmit to be 500m and data traffic Q when very little apart from length through experiment, propagation delay time only differs a millisecond order of magnitude.
Through emulation the technique effect of different transmission methods is verified; Adopt the NS22 emulation platform to draw the internodal random distribution sequence of source order; And the computing formula of use MVR transmission policy, respectively propagation delay time and two factors of whole network energy consumption are carried out emulation through the Matlab emulation platform.Experimental result is as shown in Figure 5, and ordinate is propagation delay time T
MVR, unit is 10
-5Second, abscissa is transmission range r, unit is a rice; Can find out that propagation delay time and node number are irrelevant, and when r increased gradually, propagation delay time reduced gradually; When r＞25m, propagation delay time is tending towards equilibrium state and very little.
As shown in Figure 6, ordinate is energy consumption E
MVR, unit is a joule J, abscissa is transmission range r; Unit is a rice, and random distribution 20,70 between initial forward node and destination node; During 120 nodes; Node maximum transmission distance Rmax=100m, 0＜r＜100m regulates the node transmitting power by Friis free space equation and can get among Fig. 6 the energy consumption varies curve that from top to bottom 3 curves are respectively N=120/70/20.For energy consumption E
MVR, when N increased, the energy consumption of whole wireless network increased, energy consumption relative equilibrium when 10＜r＜50m, and can reach energy consumption E
MVRMinimum value, be minimum during whole energy consumption distributes, wherein, when 25＜r＜50m, the energy consumption E of whole wireless network
MVRWith propagation delay time T
MVRSatisfy predetermined threshold.
Therefore for whole wireless sensor network; Need two factors of comprehensive transmission time delay and energy consumption to consider; Thereby optimize the performance of whole wireless network as far as possible, in practical application, utilize MVR Routing Protocol choose reasonable transmission radius, help reducing the energy consumption of whole wireless sensor network; Control the propagation delay time of whole network, optimize whole wireless network.
The embodiment of the invention provides a kind of forward node of in wireless network, realizing route, comprising:
The neighbor node identifying unit, each node that is used for the information data that said forward node sends with first transmitting power can be arrived is as the neighbor node of said forward node, and each said neighbor node forms neighbor node set;
Link energy consumption acquiring unit is used for selecting one first neighbor node in said neighbor node set, and the link energy consumption between said forward node and said first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in said forward node and the set of said neighbor node is the second link energy consumption;
The forward node identifying unit, being used for can be consuming time less than each said second link when the said first link energy consumption, confirms that said first neighbor node is second forward node; Wherein, said information data is carried out route between different forward node.
Use the technological means that is provided; According to the second link energy consumption between forward node and non-first neighbor node; And the magnitude relationship between the first link energy consumption between the forward node and first neighbor node confirms that next second forward node is with transmit information data; And the node in wireless network all can be suitable for when any variation takes place should technology, transmit information data that therefore can dynamic flexible; And, reduced propagation delay time because the power of transmit information data has been saved the energy consumption of transmit information data all less than first transmitting power between selected forward node.
The embodiment of the invention provides a kind of wireless network; Said wireless network comprises a plurality of forward node and non-forward node, and wherein, first forward node of receiving said information data is initial forward node; The final forward node that arrives of said information data is a destination node
Each forward node comprises:
The neighbor node identifying unit, each node that is used for the information data that said forward node sends with first transmitting power can be arrived is as the neighbor node of said forward node, and each said neighbor node forms neighbor node set;
Link energy consumption acquiring unit is used for selecting one first neighbor node in said neighbor node set, and the link energy consumption between said forward node and said first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in said forward node and the set of said neighbor node is the second link energy consumption;
The forward node identifying unit, being used for can be consuming time less than each said second link when the said first link energy consumption, confirms that said first neighbor node is second forward node; Wherein, said information data is carried out route between different forward node.
Also comprise in the wireless network:
The period of the day from 11 p.m. to 1 a.m prolongs timing unit, and the time span that is used for said forward node is received said information data is prolonged as first period of the day from 11 p.m. to 1 a.m,
Said forward node is handled the time span of said information data and is prolonged as second period of the day from 11 p.m. to 1 a.m,
Said forward node sends the time span of said information data and prolongs as the 3rd period of the day from 11 p.m. to 1 a.m,
The time span of the said information data of transmission unit discharge is prolonged as the 4th period of the day from 11 p.m. to 1 a.m on unit distance;
Sub-energy consumption measure unit is used for said forward node is received energy that said information data need consume as the first sub-energy consumption,
Said forward node is handled energy that said information data need consume as the second sub-energy consumption,
Said forward node is launched energy that said information data need consume as the 3rd sub-energy consumption.
The propagation delay time computing unit; The very first time that is used for each said forward node is received, handles and/or send said information data, and initial forward node obtained said information data is routed to said destination node from said initial forward node propagation delay time to second time interval addition of the said information data of the last transmission of the distance of destination node at interval; Wherein, first forward node of receiving said information data is said initial forward node, and the final forward node that arrives of said information data is said destination node.Wherein, the very first time obtains through following mode at interval:
The quantity of said forward node and said first period of the day from 11 p.m. to 1 a.m prolong to multiply each other and obtain the first time delay product,
Other quantity and said second period of the day from 11 p.m. to 1 a.m of forward node that does not comprise said destination node prolongs to multiply each other and obtains the second time delay product,
The quantity of said forward node and said the 3rd period of the day from 11 p.m. to 1 a.m prolong to multiply each other and obtain the 3rd time delay product,
The said first time delay product, the second time delay sum of products, the second time delay sum of products are as said very first time interval;
Second time interval obtained through following mode: said initial forward node prolongs to multiply each other to the distance between the said destination node and said the 4th period of the day from 11 p.m. to 1 a.m and obtains the 4th time delay product as said second time interval.
The energy consumption computing unit; Be used for all types of said nodes are received needed first energy of said information data, and each said forward node is handled and/or is sent the needed second energy addition of said information data and obtains said information data is routed to destination node from initial forward node energy consumption; Wherein, first forward node of receiving said information data is said initial forward node, and the final forward node that arrives of said information data is said destination node.Wherein, first energy obtains through following mode:
The interstitial content of all types node and the said first sub-energy consumption multiply each other and obtain the first energy consumption product as said first energy in the said wireless network;
Said second energy obtains through following mode:
Other quantity and the said second sub-energy consumption of forward node that does not comprise said destination node multiplies each other and obtains the second energy consumption product,
Other quantity and the said the 3rd sub-energy consumption of forward node that does not comprise said destination node multiplies each other and obtains the 3rd energy consumption product;
The said second energy consumption sum of products the 3rd energy consumption sum of products is as said second energy.
Use the technological means that is provided, first node of receiving said information data is initial forward node in the wireless network; Confirm that according to the power link judgment criterion between each neighbor node of current forward node and this forward node one of them neighbor node is as next forward node; Then information data is sent to destination node through a plurality of forward node; In this process, have only the link transmission process between the forward node can produce propagation delay time T
MVR, and the operation produce power of having only forward node processing information data and ordinary node to receive information data consumes E
MVR, like this then can be balanced and the performance of stable wireless sensor network, optimize the whole sensor network, reduced the network energy consumption, reduced propagation delay time, equilibrium the performance of whole wireless sensor network.These two factors of comprehensive transmission time delay and energy consumption are considered; For the whole sensor network system, need comprehensive time delay and two factors of energy consumption to consider, thereby make the performance of whole wireless network approaching as far as possible optimum; In practical application, utilize MVR Routing Protocol choose reasonable transmission radius; Help reducing the energy consumption of whole wireless sensor network, control the propagation delay time of whole network, reach the purpose of optimizing whole wireless network.
The above is a preferred implementation of the present invention; Should be pointed out that for those skilled in the art, under the prerequisite that does not break away from principle according to the invention; Can also make some improvement and retouching, these improvement and retouching also should be regarded as protection scope of the present invention.
Claims (10)
1. a method that in wireless network, realizes route is characterized in that said wireless network comprises a plurality of nodes, and method comprises:
Each node that the information data that first forward node in a plurality of nodes is sent with first transmitting power can arrive is as the neighbor node of said first forward node, and each said neighbor node forms the neighbor node set of said first forward node;
In said neighbor node set, select one first neighbor node, the link energy consumption between said first forward node and said first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in said first forward node and the set of said neighbor node is the second link energy consumption;
Can be consuming time when the said first link energy consumption less than each said second link, confirm that said first neighbor node is second forward node; Wherein, said information data is carried out route between different forward node.
2. method according to claim 1 is characterized in that, first forward node of receiving said information data is initial forward node, and the final forward node that arrives of said information data is a destination node;
The very first time that each said forward node was received, handled and/or sent said information data, and said initial forward node obtained said information data is routed to said destination node from said initial forward node propagation delay time to second time interval addition of the said information data of the last transmission of distance between the said destination node at interval.
3. method according to claim 2 is characterized in that,
The time span that said first forward node receives said information data is that first period of the day from 11 p.m. to 1 a.m prolongs,
The time span that said first forward node is handled said information data is that second period of the day from 11 p.m. to 1 a.m prolongs,
The time span that said first forward node sends said information data is that the 3rd period of the day from 11 p.m. to 1 a.m prolongs,
The time span of the said information data of transmission unit discharge is that the 4th period of the day from 11 p.m. to 1 a.m prolongs on unit distance;
The said very first time obtains through following mode at interval:
The quantity of said forward node and said first period of the day from 11 p.m. to 1 a.m prolong to multiply each other and obtain the first time delay product,
Other quantity and said second period of the day from 11 p.m. to 1 a.m of forward node that does not comprise said destination node prolongs to multiply each other and obtains the second time delay product,
The quantity of said forward node and said the 3rd period of the day from 11 p.m. to 1 a.m prolong to multiply each other and obtain the 3rd time delay product,
The said first time delay product, the second time delay sum of products, the second time delay sum of products are as said very first time interval;
Said second time interval obtains through following mode: said initial forward node prolongs to multiply each other to the distance between the said destination node and said the 4th period of the day from 11 p.m. to 1 a.m and obtains the 4th time delay product as said second time interval.
4. method according to claim 1 is characterized in that, first forward node of receiving said information data is initial forward node, and the final forward node that arrives of said information data is a destination node;
All types of said nodes are received needed first energy of said information data, and each said forward node is handled and/or is sent the needed second energy addition of said information data and obtains said information data is routed to said destination node from said initial forward node energy consumption.
5. method according to claim 4 is characterized in that,
It is the first sub-energy consumption that said first forward node receives the energy that said information data need consume,
It is the second sub-energy consumption that said first forward node is handled the energy that said information data need consume,
It is the 3rd sub-energy consumption that said first forward node sends the energy that said information data need consume;
Said first energy obtains through following mode:
The interstitial content of all types node and the said first sub-energy consumption multiply each other and obtain the first energy consumption product as said first energy in the said wireless network;
Said second energy obtains through following mode:
Other quantity and the said second sub-energy consumption of forward node that does not comprise said destination node multiplies each other and obtains the second energy consumption product,
Other quantity and the said the 3rd sub-energy consumption of forward node that does not comprise said destination node multiplies each other and obtains the 3rd energy consumption product;
The said second energy consumption sum of products the 3rd energy consumption sum of products is as said second energy.
6. method according to claim 1 is characterized in that, judges that the said first link energy consumption specifically comprises less than each said second link energy consumption:
Obtain the said first link energy consumption;
Obtain the said second link energy consumption;
Obtain the 3rd link energy consumption between said first neighbor node and non-first neighbor node;
If the said second link energy consumption more than or equal to said first link energy consumption and said the 3rd link energy consumption sum, judges that then said first neighbor node is said second forward node.
7. a forward node of in wireless network, realizing route is characterized in that, comprising:
The neighbor node identifying unit, each node that is used for the information data that said forward node sends with first transmitting power can be arrived is as the neighbor node of said forward node, and each said neighbor node forms the neighbor node set of said forward node;
Link energy consumption acquiring unit is used for selecting one first neighbor node in said neighbor node set, and the link energy consumption between said forward node and said first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in said forward node and the set of said neighbor node is the second link energy consumption;
The forward node identifying unit, being used for can be consuming time less than each said second link when the said first link energy consumption, confirms that said first neighbor node is second forward node; Wherein, said information data is carried out route between different forward node.
8. a wireless network is characterized in that, said wireless network comprises a plurality of forward node and non-forward node, and each forward node comprises:
The neighbor node identifying unit, each node that is used for the information data that said forward node sends with first transmitting power can be arrived is as the neighbor node of said forward node, and each said neighbor node forms neighbor node set;
Link energy consumption acquiring unit is used for selecting one first neighbor node in said neighbor node set, and the link energy consumption between said forward node and said first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in said forward node and the set of said neighbor node is the second link energy consumption;
The forward node identifying unit, being used for can be consuming time less than each said second link when the said first link energy consumption, confirms that said first neighbor node is second forward node; Wherein, said information data is carried out route between different forward node.
9. wireless network according to claim 8 is characterized in that, also comprises:
The propagation delay time computing unit; The very first time that is used for each said forward node is received, handles and/or send said information data, and initial forward node obtained said information data is routed to said destination node from said initial forward node propagation delay time to second time interval addition of the said information data of the last transmission of the distance of destination node at interval;
Wherein, first forward node of receiving said information data is said initial forward node, and the final forward node that arrives of said information data is said destination node.
10. wireless network according to claim 8 is characterized in that, also comprises:
The energy consumption computing unit; Be used for all types of said nodes are received needed first energy of said information data, and each said forward node is handled and/or is sent the needed second energy addition of said information data and obtains said information data is routed to destination node from initial forward node energy consumption;
Wherein, first forward node of receiving said information data is said initial forward node, and the final forward node that arrives of said information data is said destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110123082.5A CN102781060B (en) | 2011-05-12 | 2011-05-12 | A kind of method, forward node and wireless network realizing route in the wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110123082.5A CN102781060B (en) | 2011-05-12 | 2011-05-12 | A kind of method, forward node and wireless network realizing route in the wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102781060A true CN102781060A (en) | 2012-11-14 |
| CN102781060B CN102781060B (en) | 2016-01-27 |
Family
ID=47125775
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110123082.5A Active CN102781060B (en) | 2011-05-12 | 2011-05-12 | A kind of method, forward node and wireless network realizing route in the wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102781060B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104869606A (en) * | 2015-04-22 | 2015-08-26 | 东软集团股份有限公司 | Message forwarding method and apparatus |
| CN105050151A (en) * | 2015-06-25 | 2015-11-11 | 北京科技大学 | OLSR (Optimized Link State Routing) method based on energy awareness and location prediction |
| WO2016187781A1 (en) * | 2015-05-25 | 2016-12-01 | 华为技术有限公司 | Packet processing method and apparatus |
| CN108811026A (en) * | 2018-07-17 | 2018-11-13 | 北京农业信息技术研究中心 | The candidate forwarding collection structure of farmland complex environment chance transmission and relaying coordination approach |
| CN111343067A (en) * | 2020-03-23 | 2020-06-26 | 珠海格力电器股份有限公司 | Method for establishing relay node of CAN communication network and CAN communication network |
| CN113556795A (en) * | 2021-07-20 | 2021-10-26 | 哈尔滨海能达科技有限公司 | Method for determining first-time forwarding equipment, related device and computer storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101448296A (en) * | 2009-01-04 | 2009-06-03 | 华为技术有限公司 | Distributed network topology control method and node thereof |
| US20100220653A1 (en) * | 2007-11-01 | 2010-09-02 | Hwang So-Young | Multi-path routing method in wireless sensor network |
| CN102036338A (en) * | 2010-12-22 | 2011-04-27 | 中国科学院计算技术研究所 | Sensor network real-time routing method based on data-driven link estimation |
-
2011
- 2011-05-12 CN CN201110123082.5A patent/CN102781060B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100220653A1 (en) * | 2007-11-01 | 2010-09-02 | Hwang So-Young | Multi-path routing method in wireless sensor network |
| CN101448296A (en) * | 2009-01-04 | 2009-06-03 | 华为技术有限公司 | Distributed network topology control method and node thereof |
| CN102036338A (en) * | 2010-12-22 | 2011-04-27 | 中国科学院计算技术研究所 | Sensor network real-time routing method based on data-driven link estimation |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104869606A (en) * | 2015-04-22 | 2015-08-26 | 东软集团股份有限公司 | Message forwarding method and apparatus |
| CN104869606B (en) * | 2015-04-22 | 2019-08-20 | 东软集团股份有限公司 | A kind of message forwarding method and device |
| US10313258B2 (en) | 2015-05-25 | 2019-06-04 | Huawei Technologies Co., Ltd. | Packet processing method and apparatus |
| CN107615718A (en) * | 2015-05-25 | 2018-01-19 | 华为技术有限公司 | Message processing method and device |
| WO2016187781A1 (en) * | 2015-05-25 | 2016-12-01 | 华为技术有限公司 | Packet processing method and apparatus |
| CN107615718B (en) * | 2015-05-25 | 2020-06-16 | 华为技术有限公司 | Message processing method and device |
| CN105050151B (en) * | 2015-06-25 | 2018-08-07 | 北京科技大学 | OLSR method for routing based on Energy-aware and position prediction |
| CN105050151A (en) * | 2015-06-25 | 2015-11-11 | 北京科技大学 | OLSR (Optimized Link State Routing) method based on energy awareness and location prediction |
| CN108811026A (en) * | 2018-07-17 | 2018-11-13 | 北京农业信息技术研究中心 | The candidate forwarding collection structure of farmland complex environment chance transmission and relaying coordination approach |
| CN108811026B (en) * | 2018-07-17 | 2020-06-09 | 北京农业信息技术研究中心 | Farmland complex environment opportunity transmission candidate forwarding set construction and relay coordination method |
| CN111343067A (en) * | 2020-03-23 | 2020-06-26 | 珠海格力电器股份有限公司 | Method for establishing relay node of CAN communication network and CAN communication network |
| CN111343067B (en) * | 2020-03-23 | 2020-12-04 | 珠海格力电器股份有限公司 | Method for establishing relay node of CAN communication network and CAN communication network |
| CN113556795A (en) * | 2021-07-20 | 2021-10-26 | 哈尔滨海能达科技有限公司 | Method for determining first-time forwarding equipment, related device and computer storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102781060B (en) | 2016-01-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kumar et al. | Energy balanced position-based routing for lifetime maximization of wireless sensor networks | |
| Mahajan et al. | An energy balanced QoS based cluster head selection strategy for WSN | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| CN102036338A (en) | Sensor network real-time routing method based on data-driven link estimation | |
| KR101835335B1 (en) | Routing method and apparatus for setting optimum multi-hop hybrid v-mimo transmission path for wireless ad hoc network | |
| Sinwar et al. | Analysis and comparison of ant colony optimization algorithm with DSDV, AODV, and AOMDV based on shortest path in MANET | |
| Tashtoush et al. | Fibonacci sequence based multipath load balancing approach for mobile ad hoc networks | |
| CN102781060B (en) | A kind of method, forward node and wireless network realizing route in the wireless network | |
| CN101600227A (en) | A kind of distributed network route selection method and routing device | |
| Oh et al. | An explicit disjoint multipath algorithm for cost efficiency in wireless sensor networks | |
| Attia et al. | Advanced greedy hybrid bio-inspired routing protocol to improve IoV | |
| Poongkuzhali et al. | An optimized power reactive routing based on AODV protocol for Mobile Ad-hoc network | |
| Reddy et al. | Optimizing QoS-based clustering using a multi-hop with single cluster communication for efficient packet routing | |
| Kuhlani et al. | Heuristic data dissemination for mobile sink networks | |
| Abuashour | An efficient Clustered IoT (CIoT) routing protocol and control overhead minimization in IoT network | |
| Ratnaraj et al. | OEDSR: Optimized energy-delay sub-network routing in wireless sensor network | |
| Aadri et al. | An energy efficient hierarchical routing scheme for wireless sensor networks | |
| Eslaminejad et al. | Classification of Energy-Efficient Routing Protocols for Wireless Sensor Networks. | |
| Padyal et al. | Continuous neighbour discovery approach for improvement of routing performance in WSN | |
| Saidi et al. | Opportunistic routing in wireless sensors networks | |
| Chen | Analysis and research of wsn reliable routing protocol | |
| Ren et al. | Energy saving ad-hoc on-demand distance vector routing for mobile ad-hoc networks | |
| Ting et al. | Status adaptive routing with delayed rebroadcast scheme in AODV-based MANETs | |
| Liu et al. | A Novel Mobile Data Collection Algorithm for Wireless Sensor Networks. | |
| Periyasamy et al. | Angle Based Energy and Power Efficient Node Detection Routing Protocol for MANET |
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 |