CN102781060B - A kind of method, forward node and wireless network realizing route in the wireless network - Google Patents
A kind of method, forward node and wireless network realizing route in the wireless network Download PDFInfo
- Publication number
- CN102781060B CN102781060B CN201110123082.5A CN201110123082A CN102781060B CN 102781060 B CN102781060 B CN 102781060B CN 201110123082 A CN201110123082 A CN 201110123082A CN 102781060 B CN102781060 B CN 102781060B
- Authority
- CN
- China
- Prior art keywords
- node
- information data
- forward node
- energy consumption
- 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.)
- Active
Links
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 provides a kind of method realizing route in the wireless network, forward node and wireless network, wireless network comprises multiple node, method comprises: each node that can be arrived using the information data that the first transmitting power sends by the first forward node in multiple node is as the neighbor node of the first forward node, select first neighbor node, 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 forward node and the first neighbor node determines that next second forward node is with transmit information data, and node in the wireless network all can be suitable for this technology when there is any change, therefore, it is possible to the transmit information data of dynamic flexible, and because the power of transmit information data is all less than the first transmitting power between selected forward node, saves the energy ezpenditure of transmit information data, decrease propagation delay time.
Description
Technical field
The present invention relates to radio network technique, refer to a kind of method, forward node and the wireless network that realize route in the wireless network especially.
Background technology
Wireless sensor network (is called for short wireless network, WSNs, WirelessSensorNetworks) be made up of with a kind of form of self-organizing as node multiple intelligent sensor with environment sensing, data processing and communication capacity, communication between intelligent sensor node needs the support of Routing Protocol, the network topology of existing fixed mesh cannot meet the robustness requirement of application routing mechanism, thus the Routing Protocol that changes based on adaptive topology of choose reasonable, effective Controlling vertex each jump transmission range and become the problem that current wireless sensor network needs to solve.
In such Routing Protocol, use the movable forward node of Dynamic Selection as next node forwarding information data, utilize received signal strength indicator (RSSI, ReceivedSignalStrengthIndicator) ranging technology to locate and select to be applicable to the node of distance as the forward node of movable route.
Inventor finds prior art, and there are the following problems: in order to save the energy ezpenditure of transmit information data under limited node resource, reduce propagation delay time, Dynamic Programming must go out most suitable transmission range to extend the life cycle of wireless network, to meet the different needs.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of method, forward node and the wireless network that realize route in the wireless network, for selecting forward node with transmit information data in the wireless network dynamically, and selected forward node can save the energy ezpenditure of transmission data, reduce propagation delay time.
For solving the problems of the technologies described above, embodiments of the invention provide a kind of method realizing route in the wireless network, described wireless network comprises multiple node, method comprises: each node that can be arrived using the information data that the first transmitting power sends by the first forward node in multiple node is as the neighbor node of described first forward node, and neighbor node described in each forms the neighbor node set of described first forward node; In described neighbor node set, select first neighbor node, the link energy consumption between described first forward node and described first neighbor node is the first link energy consumption; Link energy consumption between each non-first neighbor node in described first forward node and described neighbor node set is the second link energy consumption; When described first link energy consumption to be less than described in each the second link can be consuming time, determine that described first neighbor node is the second forward node; Wherein, described information data carries out route between different forward node.
In described method, first forward node receiving described information data is initial forward node, node for the purpose of the forward node that described information data finally arrives; Forward node described in each is received, processes and/or send the very first time interval of described information data, and second time interval of distance between described initial forward node to described destination node being transmitted described information data is added and obtains described information data is routed to described destination node propagation delay time from described initial forward node.
In described method, the time span that described first forward node receives described information data is that first period of the day from 11 p.m. to 1 a.m prolongs, described in described first forward node process, the time span of information data is that second period of the day from 11 p.m. to 1 a.m prolongs, the time span that described first forward node sends described information data is that the 3rd period of the day from 11 p.m. to 1 a.m prolongs, and the time span that unit distance is transmitted the described information data of unit discharge is that the 4th period of the day from 11 p.m. to 1 a.m prolongs; Described very first time interval obtains in the following way: quantity and described first period of the day from 11 p.m. to 1 a.m of described forward node prolong to be multiplied and obtain the first time delay product, the quantity not comprising other forward node of described destination node is prolonged to be multiplied with described second period of the day from 11 p.m. to 1 a.m and is obtained the second time delay product, the quantity of described forward node is prolonged to be multiplied with described 3rd period of the day from 11 p.m. to 1 a.m and is obtained the 3rd time delay product, and described first time delay product, second time delay sum of products the 3rd time delay sum of products are as described very first time interval; Described second time interval obtains in the following way: the distance between described initial forward node to described destination node and described 4th period of the day from 11 p.m. to 1 a.m prolong to be multiplied and obtain the 4th time delay product as described second time interval.
In described method, first forward node receiving described information data is initial forward node, node for the purpose of the forward node that described information data finally arrives; All types of described node is received the first energy required for described information data, and forward node process described in each and/or send required for described information data second energy be added obtain described information data is routed to described destination node energy ezpenditure from described initial forward node.
In described method, described first forward node receives described information data needs the energy consumed to be the first sub-energy consumption, information data described in described first forward node process needs the energy consumed to be the second sub-energy consumption, and described first forward node sends described information data needs the energy consumed to be the 3rd sub-energy consumption; Described first energy obtains in the following way: in described wireless network, the interstitial content of all types node is multiplied with described first sub-energy consumption and obtains the first energy consumption product as described first energy; Described second energy obtains in the following way: the quantity not comprising other forward node of described destination node is multiplied with described second sub-energy consumption and obtains the second energy consumption product, and the quantity not comprising other forward node of described destination node is multiplied with described 3rd sub-energy consumption and obtains the 3rd energy consumption product; Described second energy consumption sum of products the 3rd energy consumption sum of products is as described second energy.
In described method, judge that described first link energy consumption is less than the second link energy consumption described in each and specifically comprises: obtain described first link energy consumption; Obtain described second link energy consumption; Obtain the 3rd link energy consumption between described first neighbor node and non-first neighbor node; If described second link energy consumption is more than or equal to described first link energy consumption and described 3rd link energy consumption sum, then judge that described first neighbor node is described second forward node.
A kind of forward node realizing route in the wireless network, comprise: neighbor node identifying unit, for each node that can be arrived using the information data that the first transmitting power sends by described forward node neighbor node as described forward node, neighbor node described in each forms the neighbor node set of described forward node; Link energy consumption acquiring unit, for selecting first neighbor node in described neighbor node set, the link energy consumption between described forward node and described first neighbor node is the first link energy consumption; Link energy consumption between each non-first neighbor node in described forward node and described neighbor node set is the second link energy consumption; Forward node identifying unit, can be consuming time for being less than the second link described in each when described first link energy consumption, determines that described first neighbor node is the second forward node; Wherein, described information data carries out route between different forward node.
A kind of wireless network, described wireless network comprises multiple forward node and non-forwarding nodes, each forward node comprises: neighbor node identifying unit, for each node that can be arrived using the information data that the first transmitting power sends by described forward node neighbor node as described forward node, neighbor node described in each forms a neighbor node set; Link energy consumption acquiring unit, for selecting first neighbor node in described neighbor node set, the link energy consumption between described forward node and described first neighbor node is the first link energy consumption; Link energy consumption between each non-first neighbor node in described forward node and described neighbor node set is the second link energy consumption; Forward node identifying unit, can be consuming time for being less than the second link described in each when described first link energy consumption, determines that described first neighbor node is the second forward node; Wherein, described information data carries out route between different forward node.
In described wireless network, also comprise: propagation delay time computing unit, for receiving forward node described in each, process and/or send the very first time interval of described information data, and second time interval addition initial forward node to the distance of destination node transmitting described information data obtains described information data is routed to described destination node propagation delay time from described initial forward node; Wherein, first forward node receiving described information data is described initial forward node, and the forward node that described information data finally arrives is described destination node.
In described wireless network, also comprise: energy ezpenditure computing unit, for all types of described node being received the first energy of described information data, and forward node process described in each and/or send required for described information data second energy be added obtain described information data is routed to destination node energy ezpenditure from initial forward node; Wherein, first forward node receiving described information data is described initial forward node, and the forward node that described information data finally arrives is described destination node.
The beneficial effect of technique scheme of the present invention is as follows: 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 forward node and the first neighbor node determines that next second forward node is with transmit information data, and node in the wireless network all can be suitable for this technology, therefore, it is possible to the transmit information data of dynamic flexible when there is any change; And because the power of transmit information data is all less than the first transmitting power between selected forward node, saves the energy ezpenditure of transmit information data, decrease propagation delay time.
Accompanying drawing explanation
Fig. 1 is transmit information data schematic diagram between embodiment of the present invention wireless sensor network node;
Fig. 2 is a kind of method flow schematic diagram realizing route in the wireless network of the embodiment of the present invention;
Fig. 3 is that the wireless sensor node of embodiment of the present invention random distribution organizes themselves into wireless sensor network schematic diagram;
Fig. 4 is embodiment of the present invention MFR method transmit information data operation principle schematic diagram;
Fig. 5 is that embodiment of the present invention propagation delay time is with transmission range change curve schematic diagram;
Fig. 6 is that embodiment of the present invention energy ezpenditure is with transmission range change curve schematic diagram.
Embodiment
For making the technical problem to be solved in the present invention, technical scheme and advantage clearly, be described in detail below in conjunction with the accompanying drawings and the specific embodiments.
In the embodiment of the present invention, in wireless sensor network (abbreviation wireless network) as shown in Figure 1, first node receiving described information data is initial forward node, need information data to be sent to distance for M destination node at a distance, the base station of destination node specifically in network.In the process of transmit information data, node can be selected can to reach maximum transmission distance value (RSSI, ReceivedSignalStrengthIndication) certain node at minimum place is as the forward node of down hop, also RSSI value can be selected at the forward node of certain node preset in scope as down hop, forward information data the most at last through multi-hop and be sent to destination node.
Each node in wireless sensor network and other elements have following attribute: 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 reception information packet; 3, wireless 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 MAC layer; 6, the transmitting power continuously adjustabe of wireless interface card.
The embodiment of the present invention provides a kind of method realizing route in the wireless network, and as shown in Figure 2, described wireless network comprises multiple node, and method comprises:
Step 101, each node that can be arrived using the information data that the first transmitting power sends by the first forward node in multiple node is as the neighbor node of described first forward node, and neighbor node described in each forms the neighbor node set of described first forward node;
Step 102, in described neighbor node set, select first neighbor node, the link energy consumption between described first forward node and described first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in described first forward node and described neighbor node set is the second link energy consumption;
Step 103, when described first link energy consumption to be less than described in each the second link can be consuming time, determine that described first neighbor node is the second forward node; Wherein, described information data carries out route between different forward node.
The technological means provided 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 forward node and the first neighbor node determines that next forward node-the second forward node is with transmit information data, and node in the wireless network all can be suitable for this technology, therefore, it is possible to the transmit information data of dynamic flexible when there is any change; And because the power of transmit information data is all less than the first transmitting power between selected forward node, thus saves the energy ezpenditure of transmit information data, decrease propagation delay time.
In wireless network, the forward node comprising initial forward node and destination node defines a forward node set, other non-forwarding nodes defines ordinary node set as ordinary node, the quantity of forward node set repeating node is the first quantity, and in ordinary node set, the quantity of ordinary node is the second quantity.The agreement that the method realizing route in wireless network is formed can be described as transmission range Network Based and controls (MVR, MostForwardwithVariableRdius) agreement, MVR agreement comprises: structure and is jumped and optimized optimization neighbor node set (ONS corresponding to topological network, OptimizedNeighborSet), Dominating paths is carried out by request message (RREQ by optimized neighbor set, RouteREQuest) repeating process, realizes the power control strategy E-Packeted.The first forward node wherein can be any one forward node in forward node set.
In a preferred embodiment, each forward node forms a forward node set; In described forward node set, in described wireless network, first node receiving described information data is initial forward node, node for the purpose of the node that described information data finally arrives; Information data is forwarded to the propagation delay time T of destination node from described initial forward node
mVRobtain in the following way:
Each forward node is received, processes and/or send the very first time interval of described information data, and second time interval of distance between described initial forward node to described destination node being transmitted described information data is added and obtains described information data is routed to described destination node propagation delay time T from described initial forward node
mVR.
The time span that described first forward node receives described information data is that first period of the day from 11 p.m. to 1 a.m prolongs Treceive,
Described in described first forward node process, the time span of information data is that second period of the day from 11 p.m. to 1 a.m prolongs Tdeal,
The time span that described first forward node sends described information data is that the 3rd period of the day from 11 p.m. to 1 a.m prolongs Tsend,
The time span that unit distance is transmitted the described information data of unit discharge is that the 4th period of the day from 11 p.m. to 1 a.m prolongs Ttrans;
Therefore, interval obtains in the following way the very first time:
Quantity and described first period of the day from 11 p.m. to 1 a.m of described forward node prolong to be multiplied and obtain the first time delay product,
The quantity not comprising other forward node of described destination node is prolonged to be multiplied with described second period of the day from 11 p.m. to 1 a.m and is obtained the second time delay product,
The quantity of described forward node is prolonged to be multiplied with described 3rd period of the day from 11 p.m. to 1 a.m and is obtained the 3rd time delay product,
Described first time delay product, second time delay sum of products the 3rd time delay sum of products are as described very first time interval;
Second time interval obtained in the following way:
Distance between described initial forward node to described destination node and described 4th period of the day from 11 p.m. to 1 a.m prolong to be multiplied and obtain the 4th time delay product as described second time interval.
In an application scenarios, the distance that information data is forwarded to described destination node from described initial forward node is M:
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 not forwarding information data; In formula, the time delay of the information data that forward node receives, process and send unit discharge is respectively Treceive, Tdeal and Tsend, the time delay that described forward node transmits the information data of unit discharge in unit distance is Ttrans, information data from initial forward node be forwarded to destination node the distance of process be M, in wireless network, the interstitial content of all types node is N, r is the transmission range of forward node, normally the information data that sends with the first transmitting power of forward node can reach, and Q is the total flow of information data.
In a preferred embodiment, first forward node receiving described information data is initial forward node, node for the purpose of the forward node that described information data finally arrives; Information data is forwarded to the energy ezpenditure E of destination node from described initial forward node
mVRin the following way obtain: all types of described node is received the first energy required for described information data, and forward node process described in each and/or send required for described information data second energy be added obtain described information data is routed to described destination node energy ezpenditure from described initial forward node.Wherein:
Described first forward node receives described information data needs the energy consumed to be the first sub-energy consumption Qe
rb,
Described first forward node processing information data needs the energy consumed to be the second sub-energy consumption Qe
db,
Described first forward node launches described information data needs the energy consumed to be the 3rd sub-energy consumption Qe
tb.
Therefore, the first energy obtains in the following way: in described wireless network, the interstitial content of all types node is multiplied with described first sub-energy consumption and obtains the first energy consumption product as described first energy;
Second energy obtains in the following way: the quantity not comprising other forward node of described destination node is multiplied with described second sub-energy consumption and obtains the second energy consumption product, and the quantity not comprising other forward node of described destination node is multiplied with described 3rd sub-energy consumption and obtains the 3rd energy consumption product;
Described second energy consumption sum of products the 3rd energy consumption sum of products is as described second energy.
In an application scenarios, the distance that information data is forwarded to described destination node from described initial forward node is M, after each forward node sends described information data, each neighbor node of forward node can receive this information data as ordinary node, the ENERGY E that information data described in each described ordinary node process consumes
normal=Qe
rb, therefore can obtain energy ezpenditure E in the following way
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 formula, forward node consumed energy E described in each
routing'=Q (e
t+ e
dr
n+ e
r) B, it is E '=Qe that described destination node receives described information data consumed energy
rb, ordinary node consumed energy described in each is E
normal=Qe
rb; Wherein, e
dfor processing 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 the information data that sends with the first transmitting power of forward node can reach, n is channel energy loss parameter, 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 loss parameter n of channel energy is relevant with environment during transmit information data, to propagation delay time T
mVRwith energy ezpenditure E
mVRwhen carrying out setting n=2 in the process verified:
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 described first link energy consumption;
Obtain described second link energy consumption;
Obtain the 3rd link energy consumption between described first neighbor node and non-first neighbor node; Wherein, non-first neighbor node can be described as the second neighbor node;
If described second link energy consumption is more than or equal to described first link energy consumption and described 3rd link energy consumption sum, then judge that described first neighbor node is described second forward node.
In a preferred embodiment, the first current forward node obtains this neighbor node corresponding to current forward node in the following way:
Neighbor node is obtained by request to send/allowed to send agreement;
And/or, obtain neighbor node by route requests message;
And, if node does not send the control message of MAC layer and does not send the RREQ message of routing layer in predetermined cycle, then can produce beacon (Beacon) message in MAC layer or produce greeting (Hello) message to declare the existence of self in routing layer, if described forward node receives Beacon message from described node or hello packet, using this node as a neighbor node.
Apply the technological means that each preferred embodiment provides, as shown in Figure 3, in an application scenarios, in a region, the wireless sensor node of random distribution has organized themselves into wireless sensor network, and wherein, initial forward node is positioned at initial point, base station as destination node is positioned at distance M place in X-axis, the N number of node of random distribution in (0, M) scope, the maximum transmission distance of node is Rmax.In routing layer, information data is realized to the route controlled based on topology, G=(V, E) the Undirected networks topological diagram of wireless network is represented, G '=(V, E ') represent power optimization Undirected networks topological diagram, V is the set of Undirected networks topological diagram and power optimization Undirected networks topological diagram interior joint, and E is the set of tie link between Undirected networks topological diagram interior joint, E ' is the set of power optimization link between power optimization Undirected networks topological diagram interior joint, obvious G ' ∈ G.
Current forward node is after acquisition neighbor node path loss correlation information, corresponding optimization neighbor node set ONS will be set up by optimizing neighbor algorithm, comprise: first before neighbor algorithm is optimized in execution, neighbor node set NS carries out copying formation copy NSC (NS-Copy) by current forward node, NSC performs and optimizes neighbor algorithm to obtain the set of optimization neighbor node, and copy a neighbor node set NS again after optimization neighbor algorithm is complete.The neighbor node set of node i is designated as NS (i), node j ∈ NS (i), if node j is the neighbor node of node i, for arbitrary u ∈ NS
i, and u ≠ j, meet P
ij+ P
ju≤ P
iuset up, then j ∈ ONS
i, wherein, NS
ithat node i launches the neighbor node set of each neighbor node in a hop distance of information data with maximum power-the first transmitting power, 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 ensure node i and the required minimum emissive power that communicates between node j, P
jube the 3rd link energy consumption, P
iube the second link energy consumption, obviously have ONS
i∈ NS
i.Can know that optimizing neighbor node possesses symmetry, if node j is the power optimization neighbours of node i, then node i is also the power optimization neighbor node of node j, namely has: if j ∈ is ONS
i, then i ∈ ONS
j.
Initial forward node collection/reception information data also produces the flow that Irish uninterrupted is Q, and the path route through distance M arrives destination node-base station, without loss of generality, think distance M path on do not produce other any data traffics.The information data sent at initial forward node in the process of destination node, should expect propagation delay time T through multihop routing
mVRthe smaller the better, energy ezpenditure E
mVRthe smaller the better, whole multi-hop repeating process comprises:
In routing procedure, ordinary node receives only information data but not forwarding information data, namely ordinary node processing information data produces receive time delay, processing delay will not affect the propagation delay time of whole wireless network, thus it receives, process and send the time delay of information data only to choose the forward node as down hop just need consider in transmission path, the time delay of the information data that forward node receives, process and send unit discharge respectively is Treceive, Tdeal and Tsend, the time delay that unit distance is transmitted the information data of unit discharge is Ttrans.
In node, catabiotic element comprises sensor element, processor elements and wireless communication unit, along with the progress of integrated circuit technology, the power consumption of processor and sensor element becomes very low, overwhelming majority energy ezpenditure is in wireless communication unit, therefore only consider when energy spectrometer to consume the energy in wireless communication unit, namely in assumed wireless network, N number of node is all in active state, and the energy ezpenditure of forward node mainly occurs in reception, process and sends in information data process.During wireless sensor node transmission signal, the energy of consumption per second is: Et=(e
t+ e
dr
n) B, receive wireless signal and need consume fixing ENERGY E r=e
rb, B are wireless bit rate, the parameter that general employing one is fixing, and B is the bit rate of wireless network, e
dfor processing 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 channel energy loss parameter, 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 ezpenditure E
mVRwhen carrying out setting n=2 in the process verified:
e
t＝50*10-9J/bit；
e
r＝50*10-9J/bit；
e
d＝100*10-12J/bit/m2；
B＝1kbit/s。
Transfer to the process of destination node in the information data by Irish uninterrupted being Q from initial forward node, due to the energy that the energy equivalence of 1 bit information transfer of data 100m distance needs consumes in execution 3000 computationses, the energy of therefore node processing information data consumption is very low for the energy of transmit information data consumption.
In prior art, following strategy is had: MFR (MostForwardwithFixedRadius), NFP (NearestwithForwardProgress) when selecting next-hop node to continue forwarding information data as father node in wireless sensor network.
MFR: as shown in Figure 4, the maximum transmission distance of any node is Rmax, and this maximum transmission distance Rmax is also the radius that node one is jumped; With initial forward node be initial point, radius for Rmax do one circle, each jumps the region area covered is A, the node distributed in the A of region is all within the scope of a jumping of initial forward node, then select the node at node maximum transmission distance Rmax place to forward as next-hop node.The main purpose of MFR strategy is the jumping figure reduced as far as possible in transmitting procedure, and information data is passed to destination node with speed fast as far as possible.
When M can be divided exactly by Rmax, MFR propagation delay time
T
MFR＝Q[(M/Rmax+1)(Treceive+Tdeal+Tsend)+MTtrans+Tsend+Treceive]＝Q[(M/Rmax+2)(Treceive+Tsend)+(M/Rmax+1)Tdeal+MTtrans]
When M can not be divided exactly by Rmax, MFR propagation delay time
T
MFR＝Q[(M/Rmax)(Treceive+Tdeal+Tsend)+MTtrans+Tsend+Treceive]＝Q[(M/Rmax+1)(Treceive+Tsend)+(M/Rmax)Tdeal+MTtrans]
Irish uninterrupted is the energy ezpenditure E of information data transmission to destination node A of Q by employing MFR strategy
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 the individual movable forward node of M/Rmax (M can be divided exactly by Rmax) or M/Rmax+1 (M can not be divided exactly by Rmax), each forward node all needs to receive, process and 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, in information data transmission process, other are not in the coverage of upper hop forward node as the ordinary node of forward node, receive information data but do not forward, therefore each ordinary node consumed energy E
normal=Qe
rb.
Therefore, M can not by R
maxwhen dividing exactly, MFR energy ezpenditure
E
MFR＝Q(e
t+e
dR
max n)(M/R
max+1)B+NQe
rB
M can by R
maxwhen dividing exactly, MFR energy ezpenditure
E
MFR＝Q(M/R
max)(e
t+e
dR
max n)B+NQe
rB
NFP: the nearest node of chosen distance father node as next-hop node, forwarding information data.Because the transmission range between every hop node is shorter, therefore the main target of this selection strategy reduces every hop node as far as possible to transmit the energy consumed, and node is divided into initial forward node, N number of forward node except initial forward node and destination node 3 class by NFP data transmission policies.
Propagation delay time T
nFP=Q [(N+2) (Treceive+Tsend)+(N+1) Tdeal+MTtrans]
Irish uninterrupted is the energy ezpenditure E that information data transmission to the destination node of Q consumes by employing NFP strategy
nFP:
Suppose that N number of movable forward node is respectively X from the distance of base station
j(j=1,2 ..., N), 0<X
1<X
2< ... <X
n<M, then initial forward node (base station) is X to the spacing of next forward node
1, the adjacent spacing of N number of forward node two is X
i-X
i-1 (i=2 ..., N), N number of forward node to destination node spacing is M-X
n.For meeting NFP transmission policy, two adjacent node spacings in transmission path are all less than Rmax, i.e. X1<Rmax, X
i-X
i-1<Rmax (i=2 ..., N) and M-X
n<Rmax, then jump through N+1, the information data of Q flow can be forwarded to destination node.
In like manner in the analysis of MFR strategy energy ezpenditure, initial forward node positional representation is X
0=0, then
For absolutely proving the technique effect of technical measure, now introduce propagation delay time and energy ezpenditure that data calculate each transmission method, setting:
Treceive＝50ns
Tdeal＝(1/7.3728)*10
-6s
Tsend＝50ns
Ttrans＝(1/3)*10
-8s
As 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 different technique effects, the result of calculation of carrying out time delay and energy ezpenditure to 3 kinds of transmission methods is respectively as follows:
MFR method:
T
MFR＝6.02345*10
-4Qs，E
MFR＝0.00755QJ
NFP method:
T
NFP＝5.20858*10
-3Qs，E
NFP＝0.037891QJ
MVR method:
T
MVR＝1.45349*10
-3Qs，E
MVR＝0.005545QJ
When can find that in network, average every 100m is distributed with 10 nodes, the time delay of NFP transmission policy and energy consumption are all maximum, and therefore NFP transmission policy does not meet the requirement that wireless sensor network energy consumption is little, time delay is short; MFR is little compared with MVR propagation delay time, but its energy consumed is comparatively large, and when energy ezpenditure requires higher, MVR strategy is better than MFR; When higher to delay requirement, MFR strategy is better than MVR but is not clearly; And also find that propagation delay time only differs a millisecond order of magnitude when the distance length transmitted is 500m and data traffic Q is very little by experiment.
By emulation, the technique effect of different transmission methods is verified, NS22 emulation platform is adopted to draw the internodal random distribution sequence of source order, and use the computing formula of MVR transmission policy, respectively propagation delay time and whole network energy consumption two factors are emulated by Matlab emulation platform.As shown in Figure 5, ordinate is propagation delay time T to experimental result
mVR, unit is 10
-5second, abscissa is transmission range r, and unit is rice; Can find out, propagation delay time and node number irrelevant, and when r increases gradually, propagation delay time reduces gradually; As r>25m, propagation delay time is tending towards equilibrium state and very little.
As shown in Figure 6, ordinate is energy ezpenditure E
mVRunit is a joule J, abscissa is transmission range r, unit is rice, random distribution 20 between initial forward node and destination node, 70, during 120 nodes, node maximum transmission distance Rmax=100m, 0<r<100m, be respectively the energy ezpenditure change curve of N=120/70/20 by Friis free space equation adjustment node transmitting power 3 curves that can to obtain in Fig. 6 from top to bottom.For energy ezpenditure E
mVR, when N increases, the energy ezpenditure of whole wireless network increases, the energy ezpenditure relative equilibrium as 10<r<50m, and can reach energy ezpenditure E
mVRminimum value, be whole energy ezpenditure distribution in minimum, wherein, as 25<r<50m, the energy ezpenditure E of whole wireless network
mVRwith propagation delay time T
mVRmeet predetermined threshold.
Therefore for whole wireless sensor network, comprehensive transmission time delay and energy ezpenditure two factors are needed to consider, thus optimize the performance of whole wireless network as far as possible, MVR Routing Protocol choose reasonable is utilized to transmit radius in actual applications, be conducive to the energy ezpenditure reducing whole wireless sensor network, control the propagation delay time of whole network, optimize whole wireless network.
The embodiment of the present invention provides a kind of forward node realizing route in the wireless network, comprising:
Neighbor node identifying unit, for each node that can be arrived using the information data that the first transmitting power sends by described forward node neighbor node as described forward node, neighbor node described in each forms a neighbor node set;
Link energy consumption acquiring unit, for selecting first neighbor node in described neighbor node set, the link energy consumption between described forward node and described first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in described forward node and described neighbor node set is the second link energy consumption;
Forward node identifying unit, can be consuming time for being less than the second link described in each when described first link energy consumption, determines that described first neighbor node is the second forward node; Wherein, described information data carries out route between different forward node.
The technological means provided 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 forward node and the first neighbor node determines that next second forward node is with transmit information data, and node in the wireless network all can be suitable for this technology, therefore, it is possible to the transmit information data of dynamic flexible when there is any change; And because the power of transmit information data is all less than the first transmitting power between selected forward node, saves the energy ezpenditure of transmit information data, decrease propagation delay time.
The embodiment of the present invention provides a kind of wireless network, described wireless network comprises multiple forward node and non-forwarding nodes, and wherein, first forward node receiving described information data is initial forward node, node for the purpose of the forward node that described information data finally arrives
Each forward node comprises:
Neighbor node identifying unit, for each node that can be arrived using the information data that the first transmitting power sends by described forward node neighbor node as described forward node, neighbor node described in each forms a neighbor node set;
Link energy consumption acquiring unit, for selecting first neighbor node in described neighbor node set, the link energy consumption between described forward node and described first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in described forward node and described neighbor node set is the second link energy consumption;
Forward node identifying unit, can be consuming time for being less than the second link described in each when described first link energy consumption, determines that described first neighbor node is the second forward node; Wherein, described information data carries out route between different forward node.
Also comprise in wireless network:
The period of the day from 11 p.m. to 1 a.m prolongs timing unit, prolongs as first period of the day from 11 p.m. to 1 a.m for the time span described forward node being received described information data,
Described in described forward node process, the time span of information data is prolonged as second period of the day from 11 p.m. to 1 a.m,
The time span that described forward node sends described information data is prolonged as the 3rd period of the day from 11 p.m. to 1 a.m,
The time span that unit distance is transmitted the described information data of unit discharge is prolonged as the 4th period of the day from 11 p.m. to 1 a.m;
Sub-energy consumption measure unit, needs the energy consumed as the first sub-energy consumption for described forward node being received described information data,
Information data described in described forward node process needs the energy consumed as the second sub-energy consumption,
Described forward node launches described information data needs the energy consumed as the 3rd sub-energy consumption.
Propagation delay time computing unit, for receiving forward node described in each, process and/or send the very first time interval of described information data, and second time interval addition initial forward node to the distance of destination node transmitting described information data obtains described information data is routed to described destination node propagation delay time from described initial forward node; Wherein, first forward node receiving described information data is described initial forward node, and the forward node that described information data finally arrives is described destination node.Wherein, interval obtains in the following way the very first time:
Quantity and described first period of the day from 11 p.m. to 1 a.m of described forward node prolong to be multiplied and obtain the first time delay product,
The quantity not comprising other forward node of described destination node is prolonged to be multiplied with described second period of the day from 11 p.m. to 1 a.m and is obtained the second time delay product,
The quantity of described forward node is prolonged to be multiplied with described 3rd period of the day from 11 p.m. to 1 a.m and is obtained the 3rd time delay product,
Described first time delay product, second time delay sum of products the 3rd time delay sum of products are as described very first time interval;
Second time interval obtained in the following way: the distance between described initial forward node to described destination node and described 4th period of the day from 11 p.m. to 1 a.m prolong to be multiplied and obtain the 4th time delay product as described second time interval.
Energy ezpenditure computing unit, for all types of described node being received the first energy of described information data, and forward node process described in each and/or send required for described information data second energy be added obtain described information data is routed to destination node energy ezpenditure from initial forward node; Wherein, first forward node receiving described information data is described initial forward node, and the forward node that described information data finally arrives is described destination node.Wherein, the first energy obtains in the following way:
In described wireless network, the interstitial content of all types node is multiplied with described first sub-energy consumption and obtains the first energy consumption product as described first energy;
Described second energy obtains in the following way:
The quantity not comprising other forward node of described destination node is multiplied with described second sub-energy consumption and obtains the second energy consumption product,
The quantity not comprising other forward node of described destination node is multiplied with described 3rd sub-energy consumption and obtains the 3rd energy consumption product;
Described second energy consumption sum of products the 3rd energy consumption sum of products is as described second energy.
Apply the technological means provided, in wireless network, first node receiving described information data is initial forward node; Determine that one of them neighbor node is as next forward node according to the power link judgment criterion between current forward node and each neighbor node of this forward node, then information data is sent to destination node by multiple forward node, in this process, the link transmission process between forward node is only had to produce propagation delay time T
mVR, and the operation produce power only having forward node processing information data and ordinary node to receive information data consumes E
mVR, so then can the performance of balanced and stable wireless sensor network, optimize whole sensor network, reduce network energy consumption, reduce propagation delay time, the equilibrium performance of whole wireless sensor network.Comprehensive transmission time delay and these two factors of energy ezpenditure are considered, for whole sensor network system, comprehensive time delay and energy consumption two factors are needed to consider, thus make the performance of whole wireless network as far as possible close to optimum, MVR Routing Protocol choose reasonable is utilized to transmit radius in actual applications, be conducive to the energy ezpenditure reducing whole wireless sensor network, control the propagation delay time of whole network, reach the object optimizing whole wireless network.
The above is the preferred embodiment of the present invention; it should be pointed out that for those skilled in the art, under the prerequisite not departing from principle of the present invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (10)
1. realize a method for route in the wireless network, it is characterized in that, described wireless network comprises multiple node, and method comprises:
Each node that can be arrived using the information data that the first transmitting power sends by the first forward node in multiple node is as the neighbor node of described first forward node, and neighbor node described in each forms the neighbor node set of described first forward node;
In described neighbor node set, select first neighbor node, the link energy consumption between described first forward node and described first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in described first forward node and described neighbor node set is the second link energy consumption;
When described first link energy consumption to be less than described in each the second link can be consuming time, determine that described first neighbor node is the second forward node; Wherein, described information data carries out route between different forward node.
2. method according to claim 1, is characterized in that, first forward node receiving described information data is initial forward node, node for the purpose of the forward node that described information data finally arrives;
Forward node described in each is received, processes and/or send the very first time interval of described information data, and second time interval of distance between described initial forward node to described destination node being transmitted described information data is added and obtains described information data is routed to described destination node propagation delay time from described initial forward node.
3. method according to claim 2, is characterized in that,
The time span that described first forward node receives described information data is that first period of the day from 11 p.m. to 1 a.m prolongs,
Described in described first forward node process, the time span of information data is that second period of the day from 11 p.m. to 1 a.m prolongs,
The time span that described first forward node sends described information data is that the 3rd period of the day from 11 p.m. to 1 a.m prolongs,
The time span that unit distance is transmitted the described information data of unit discharge is that the 4th period of the day from 11 p.m. to 1 a.m prolongs;
Described very first time interval obtains in the following way:
Quantity and described first period of the day from 11 p.m. to 1 a.m of described forward node prolong to be multiplied and obtain the first time delay product,
The quantity not comprising other forward node of described destination node is prolonged to be multiplied with described second period of the day from 11 p.m. to 1 a.m and is obtained the second time delay product,
The quantity of described forward node is prolonged to be multiplied with described 3rd period of the day from 11 p.m. to 1 a.m and is obtained the 3rd time delay product,
Described first time delay product, second time delay sum of products the 3rd time delay sum of products are as described very first time interval;
Described second time interval obtains in the following way: the distance between described initial forward node to described destination node and described 4th period of the day from 11 p.m. to 1 a.m prolong to be multiplied and obtain the 4th time delay product as described second time interval.
4. method according to claim 1, is characterized in that, first forward node receiving described information data is initial forward node, node for the purpose of the forward node that described information data finally arrives;
All types of described node is received the first energy required for described information data, and forward node process described in each and/or send required for described information data second energy be added obtain described information data is routed to described destination node energy ezpenditure from described initial forward node.
5. method according to claim 4, is characterized in that,
Described first forward node receives described information data needs the energy consumed to be the first sub-energy consumption,
Information data described in described first forward node process needs the energy consumed to be the second sub-energy consumption,
Described first forward node sends described information data needs the energy consumed to be the 3rd sub-energy consumption;
Described first energy obtains in the following way:
In described wireless network, the interstitial content of all types node is multiplied with described first sub-energy consumption and obtains the first energy consumption product as described first energy;
Described second energy obtains in the following way:
The quantity not comprising other forward node of described destination node is multiplied with described second sub-energy consumption and obtains the second energy consumption product,
The quantity not comprising other forward node of described destination node is multiplied with described 3rd sub-energy consumption and obtains the 3rd energy consumption product;
Described second energy consumption sum of products the 3rd energy consumption sum of products is as described second energy.
6. method according to claim 1, is characterized in that, judges that described first link energy consumption is less than the second link energy consumption described in each and specifically comprises:
Obtain described first link energy consumption;
Obtain described second link energy consumption;
Obtain the 3rd link energy consumption between described first neighbor node and non-first neighbor node;
If described second link energy consumption is more than or equal to described first link energy consumption and described 3rd link energy consumption sum, then judge that described first neighbor node is described second forward node.
7. realize a forward node for route in the wireless network, it is characterized in that, comprising:
Neighbor node identifying unit, for each node that can be arrived using the information data that the first transmitting power sends by described forward node neighbor node as described forward node, neighbor node described in each forms the neighbor node set of described forward node;
Link energy consumption acquiring unit, for selecting first neighbor node in described neighbor node set, the link energy consumption between described forward node and described first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in described forward node and described neighbor node set is the second link energy consumption;
Forward node identifying unit, can be consuming time for being less than the second link described in each when described first link energy consumption, determines that described first neighbor node is the second forward node; Wherein, described information data carries out route between different forward node.
8. a wireless network, is characterized in that, described wireless network comprises multiple forward node and non-forwarding nodes, and each forward node comprises:
Neighbor node identifying unit, for each node that can be arrived using the information data that the first transmitting power sends by described forward node neighbor node as described forward node, neighbor node described in each forms a neighbor node set;
Link energy consumption acquiring unit, for selecting first neighbor node in described neighbor node set, the link energy consumption between described forward node and described first neighbor node is the first link energy consumption;
Link energy consumption between each non-first neighbor node in described forward node and described neighbor node set is the second link energy consumption;
Forward node identifying unit, can be consuming time for being less than the second link described in each when described first link energy consumption, determines that described first neighbor node is the second forward node; Wherein, described information data carries out route between different forward node.
9. wireless network according to claim 8, is characterized in that, also comprises:
Propagation delay time computing unit, for receiving forward node described in each, process and/or send the very first time interval of described information data, and second time interval addition initial forward node to the distance of destination node transmitting described information data obtains described information data is routed to described destination node propagation delay time from described initial forward node;
Wherein, first forward node receiving described information data is described initial forward node, and the forward node that described information data finally arrives is described destination node.
10. wireless network according to claim 8, is characterized in that, also comprises:
Energy ezpenditure computing unit, for all types of described node being received the first energy of described information data, and forward node process described in each and/or send required for described information data second energy be added obtain described information data is routed to destination node energy ezpenditure from initial forward node;
Wherein, first forward node receiving described information data is described initial forward node, and the forward node that described information data finally arrives is described 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 CN102781060A (en) | 2012-11-14 |
| CN102781060B true 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) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104869606B (en) * | 2015-04-22 | 2019-08-20 | 东软集团股份有限公司 | A kind of message forwarding method and device |
| EP3255841B1 (en) * | 2015-05-25 | 2019-09-11 | Huawei Technologies Co., Ltd. | Packet processing method and apparatus |
| CN105050151B (en) * | 2015-06-25 | 2018-08-07 | 北京科技大学 | OLSR method for routing based on Energy-aware and position prediction |
| CN108811026B (en) * | 2018-07-17 | 2020-06-09 | 北京农业信息技术研究中心 | Farmland complex environment opportunity transmission candidate forwarding set construction and relay coordination method |
| CN111343067B (en) * | 2020-03-23 | 2020-12-04 | 珠海格力电器股份有限公司 | Method for establishing relay node of CAN communication network and CAN communication network |
| CN113556795B (en) * | 2021-07-20 | 2023-03-24 | 哈尔滨海能达科技有限公司 | Method for determining first-time forwarding equipment, related device and computer storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100912820B1 (en) * | 2007-11-01 | 2009-08-18 | 한국전자통신연구원 | Multi-path Routing method in Wireless Sensor Networks |
-
2011
- 2011-05-12 CN CN201110123082.5A patent/CN102781060B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102781060A (en) | 2012-11-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kumar et al. | Energy balanced position-based routing for lifetime maximization of wireless sensor networks | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| CN102781060B (en) | A kind of method, forward node and wireless network realizing route in the wireless network | |
| CN102036338A (en) | Sensor network real-time routing method based on data-driven link estimation | |
| Alani et al. | A new energy consumption technique for mobile ad hoc networks | |
| Tashtoush et al. | Fibonacci sequence based multipath load balancing approach for mobile ad hoc networks | |
| Kumar | Performance evaluation of energy consumption in MANET | |
| Cakici et al. | A novel cross-layer routing protocol for increasing packet transfer reliability in mobile sensor networks | |
| Ahmad et al. | Efficient AODV routing based on traffic load and mobility of node in MANET | |
| Yazdinejad et al. | Increasing the performance of reactive routing protocol using the load balancing and congestion control mechanism in manet | |
| Poongkuzhali et al. | An optimized power reactive routing based on AODV protocol for Mobile Ad-hoc network | |
| Kuhlani et al. | Heuristic data dissemination for mobile sink networks | |
| 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 | |
| Zhang et al. | Performance evaluation of leveled probabilistic broadcasting in MANETs and wireless sensor networks | |
| Kundaliya et al. | CL-TPC: A cross layer transmission power control protocol for routing in WSN | |
| Chen | Analysis and research of wsn reliable routing protocol | |
| Karakaya | Deadline-aware energy-efficient query scheduling in wireless sensor networks with mobile sink | |
| Liu et al. | Scheme for on-demand route protocol in Ad-hoc networks | |
| Ting et al. | Status adaptive routing with delayed rebroadcast scheme in AODV-based MANETs | |
| Ren et al. | Energy saving ad-hoc on-demand distance vector routing for mobile ad-hoc networks | |
| Kardoust et al. | Introducing a method for improving the performance of routing algorithms in unmanned aeronautical ad-hoc networks | |
| Bosunia et al. | A robust and reliable routing protocol for energy-constrained mobile ad hoc networks | |
| Dubey et al. | Energy aware routing technique for improving network: An analysis and performance |
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 |