CN104009913A - Broadcasting method based on distance and energy balance in mobile Ad Hoc network - Google Patents
Broadcasting method based on distance and energy balance in mobile Ad Hoc network Download PDFInfo
- Publication number
- CN104009913A CN104009913A CN201410142510.2A CN201410142510A CN104009913A CN 104009913 A CN104009913 A CN 104009913A CN 201410142510 A CN201410142510 A CN 201410142510A CN 104009913 A CN104009913 A CN 104009913A
- Authority
- CN
- China
- Prior art keywords
- node
- distance
- broadcast packe
- neighbor
- time
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a broadcasting method based on distance and energy balance in a mobile Ad Hoc network. A node obtains information of neighbor nodes according to groupings received from the neighbor nodes, determines the distance between itself and the neighbor nodes, and builds or updates a neighbor information table; forwarding priorities are determined according to the distance between the node and the neighbor nodes and the residual energy of the node, the node carries out time-sharing forwarding according to the forwarding priorities, and channel competition and grouping collision are reduced. A lost packet retransmission mechanism is included in the method, whether broadcasting groupings are sent successfully or not is judged according to the fact whether the same broadcasting grouping forwarded by the neighbor nodes is received or not, and the broadcasting reliability is further improved. The method can well restrain the broadcasting storm, and the broadcasting reliability is improved; meanwhile, the time delay is small, and the requirement of QoS application can be better met; the method can further balance the energy consumption of the nodes in the network better, and the service life of the network is prolonged.
Description
Technical field
The present invention relates to wireless communication technology field, especially relate to one and can effectively suppress broadcast storm, improve the reliability of broadcast, the energy of node in equalizing network, has the broadcasting method based on distance and balancing energy in the mobile Ad Hoc network of higher arrival rate and lower time delay.
Background technology
The feature such as mobile Ad Hoc network all has that self-organization, multi-hop route, wireless transmission limited coverage area, link bandwidth are limited conventionally, network topology dynamic change, energy supply are limited, especially the broadcast characteristic of wireless channel and hidden node problems, the broadcast of mobile Ad Hoc network is compared with the broadcast in cable network with the wireless network that has infrastructure, broadcast storm easily occurs, and the probability that collision occurs is also higher.Particularly, for single-channel mobile Ad Hoc network, because the sending and receiving of data between node is all to carry out on same channel, the probability bumping between broadcast packe increases greatly.As can be seen here, broadcast can be introduced network load greatly, has more seriously affected the performance such as throughput and QoS (Quality of Service) of network, and therefore broadcast becomes one of bottleneck hindering mobile Ad Hoc network Development.
In mobile Ad Hoc network, the simplest broadcast mode is exactly inundation broadcast, much improves one's methods and also puts forward based on flooding method.In inundation broadcast, whenever all nodes receive that a broadcast packe all can continue this broadcast packe to pass to its contiguous node for the first time.Flooding is fairly simple and can obtain the larger network coverage on the whole, but blindly inundation can cause the message of a large amount of repetitions and consume a large amount of Internet resources in the intensive network of mobile node.Summary is got up, and the main problem existing of inundation broadcast is the unreliability of broadcast storm and broadcast, and main manifestations is that information redundancy, channel are fought for and signal collision.
With respect to broadcast storm, less about the research of unreliable broadcast.Unreliable broadcast can make some route not set up, routing iinformation is inconsistent etc.There are the scheme based on inundation, the scheme based on minimum spanning tree and the scheme of mixed type about the research approach of unreliable broadcast.Method based on inundation is fairly simple comparatively speaking, also has relatively high reliability, but it can bring broadcast storm problem.In scheme based on minimum spanning tree, structure minimum spanning tree amount of calculation is larger, is also difficult to distributed implementation.
For example, the people such as Abdalla has proposed a kind of hybrid scheme based on probability and neighbor information: dynamic probability broadcasting method DP (Dynamic Probabilistic broadcasting algorithms).DP scheme, by adjusting replay probability, makes the region large at node density, and broadcast probability is less, and in the sparse region of node density, replay probability is larger, can effectively reduce broadcast message redundancy.But DP method need to periodically send HELLO message carrys out commutative Topology information to node around, and the node that receives HELLO information is except self sending HELLO message to neighbor node, also need this information to receiving to reply, this has just caused the consumption of resources in network and node energy.
China Patent Publication No.: CN101170560A, discloses the Radio Broadcasting Agreements in a kind of self-organizing network.The maintenance, node data bag that comprises the information of 2 hop neighbor nodes processes and three parts of selection of BRG (receive packet and again the node of broadcast data packet) set, be specially: in neighbor node, select unique hop node being connected with two hop nodes as forward node; In a hop node, highest-ranking node in selecting preferentially, the selection of priority is decided by dump energy and the node number of degrees, when residue energy of node is at 50% when above of original energy, the priority=node number of degrees × N, 10≤N≤100, when residue energy of node is at below 50% 10% when above of original energy, the priority=node number of degrees × M, 2≤M≤N, when residue energy of node original energy below 10% time, priority=node number of degrees; Choose forward node by priority selection mode, until the node within the scope of all double bounces is all covered.The method of this invention has extended the life cycle of network by energy between balance node, weak point is to have divided three ranks, still equilibrium energy consumption well for dump energy; In same energy rank, only consider that the number of degrees of node select as forwarding priority, can not suppress well broadcast storm, because although the number of degrees of some node are very high, but neighbor node and the distance of self are all very near, if so its neighbor node again forward the extra coverage that obtains just very little; And the reliability of broadcast is not considered in this invention yet.
Summary of the invention
To the object of the invention is that broadcast storm, reliability are not high in order overcoming, energy consumes unbalanced problem, to provide a kind of and can effectively suppress broadcast storm, improve the broadcasting method based on distance and balancing energy in the mobile Ad Hoc network that the energy of node in broadcast reliability, equalizing network consumes.
To achieve these goals, the present invention is by the following technical solutions:
A broadcasting method based on distance and balancing energy in mobile Ad Hoc network, comprises the steps:
(1-1) set up neighbor information table:
The grouping that any node J in mobile Ad Hoc network receives its arbitrary neighbor node H, node J obtains the address of H from broadcast packe, and calculates the distance between J and H;
If node J receives the grouping from node H for the first time, node J sets up the neighbor information table for the information of memory node H;
Otherwise, distance and life span LTM in the neighbor information table of node J renewal corresponding node H;
Life span LTM is illustrated in situation about further not receiving from any information of node H, the life span of the neighbor information table of corresponding node H; In life cycle LTM, if node J does not receive the grouping from H again, for J, H will be no longer neighbor node, and LTM timing is arrived, and it is removed from neighbor information table; If received any type of grouping from this neighbors in LTM, represent the neighbors of this neighbors or node J, just need to upgrade LTM.
(1-2) send or forward broadcast packe:
(1-2-1), in the time that node J need to send broadcast packe, node J is according to neighbor node number J
numdistribution situation setpoint distance threshold value D with neighbor node
th, and in neighbor node, select neighbours apart from maximum D
max;
As neighbor node number J
numit is 1 o'clock, by D
maxbe made as the distance between this neighbor node and J, and by D
thbe made as 0;
As neighbor node number J
numduring for 2-4, by D
thbe made as the minimum value of distance in each neighbors and between node J, by D
maxbe made as the maximum of distance in each neighbors and between node J;
As neighbor node number J
numbe greater than at 4 o'clock, by D
maxbe made as the maximum of distance in each neighbors and between node J, set D
th, and make D
thmeet with the distance of node J and be greater than D
thneighbor node number>=J
num/ 2;
Node J is by distance threshold value D
thwith neighbours apart from maximum D
maxbe recorded in the packets headers of broadcast packe, and send broadcast packe;
Default response time A in node J
ckt, the A after node J forwards broadcast packe
cktin time, node J does not receive the identical broadcasts grouping from arbitrary neighbor node, and node J makes the judgement that broadcast packe sends failure or bumps, and node J resends this broadcast packe, and response time A is no longer set after being sent for the second time
cktwait for that neighbors forwards identical broadcast packe;
When node J is at A
cktin time, receive the identical broadcasts grouping from arbitrary neighbor node, node J makes the judgement that broadcast packe has successfully sent;
(1-2-2) when any one neighbor node K of node J receives after this broadcast packe, if K did not forward the broadcast packe of node J, the distance B of node K calculating and node J
kJ, and set up the neighbor information table of corresponding neighbors J or upgrade neighbours' distance and the LTM in the neighbor information table of corresponding neighbors J; By D
kJwith the D in the packets headers of broadcast packe
thand D
maxcompare, determine whether node K needs to forward this broadcast packe:
Work as D
kJ<D
thtime, node K does not forward this broadcast packe;
Work as D
kJ=D
maxtime, node K directly forwards this broadcast packe;
Work as D
th<D
kJ<D
maxtime, node K utilizes formula
calculate and forward power PI, wherein, α is the constant of setting in network, the radius of the wireless coverage that R is node, E
kfor the current remaining of node K, E
maxthe maximum energy value that can provide for the battery of arbitrary node; Utilize formula
calculate Forwarding Latency time T i, wherein, tanh () is hyperbolic tangent function operator, and MT is the maximum delay time of setting, PI
maxbe the maximum of PI, n is time constant; Then K is according to Forwarding Latency time T
1carry out time delay, wait for and forward above-mentioned broadcast packe;
Work as D
kJ>D
maxtime, showing not have in the neighbor information table of J the information of K, K will not forward this broadcast packe in this case;
(1-2-3), when node K need to forward broadcast packe, node K utilizes the method identical with node J to determine D
thand D
max, and by D
thand D
maxbe recorded in the broadcast packe head of forwarding, the value in upper hop node address field in broadcast packe head is revised as to this address of node, then node K sends broadcast packe;
(1-3) in network, all nodes alternately perform step (1-1) repeatedly to (1-2), until all node stop are broadcasted this broadcast packe.
In mobile Ad Hoc network, want to realize reliable broadcast, must solve the broadcast storm problem that information redundancy brings simultaneously, and collide the unreliable broadcast issue bringing, the dump energy equilibrium of node is most important for network life simultaneously.(the Distance and Energy-Balance based Reliable Broadcast of the broadcasting method based on distance and balancing energy that the present invention proposes, DEBRB), can suppress broadcast storm, realize reliable broadcast, dynamically adapting network topology change, can consume by equalizing network node energy again simultaneously, improve network life.
The present invention is mutual by cancellation HELLO grouping, utilizes the various groupings that receive to obtain neighbor information, reduces node energy consumption, minimizing channel competition object thereby reach; Select forward node to carry out timesharing forwarding according to the distance of node and dump energy information, can equalizing network in the energy consumption of node, and reduce broadcast message redundancy, reduce the probability of packet collisions; Adopt retransmission mechanism simultaneously, improved the reliability of broadcast packe.
As preferably, described node K waits in the process that time delay forwards, if K receives the identical broadcast packe that arbitrary neighbors N forwards, the distance B of node K calculating K and N again
kN;
If D
kNdistance be greater than r, K continues time delay, wait for forward;
If D
kNdistance be less than r, K cancel time delay, do not forward.
If K receives that the number of times of this broadcast packe is greater than 1 time in the process of waiting for time delay, K cancels forwarding; Wherein, the scope of r is:
As preferably, described broadcast packe response time A
ckt=t
1+ 2t
2+ MT; Wherein, t
1it is the transmitting time of a broadcast packe; T
2for the propagation delay of network.Wherein, t
1=Frame length (b)/transmission rate (b/s); t
2the propagation rate (m/s) of=channel length (m)/electromagnetic wave on channel.
As preferably, the dump energy E of described node K
kutilizing following steps to calculate obtains:
Node K sends a grouping institute consumed energy: E
sc=P
st
p;
Node K receives an energy that divides into groups to consume: E
re=P
rt
p;
It is two kinds of operation institute energy requirement sum: E of sending and receiving that node K forwards a required energy of grouping
ifw=(P
s+ P
r) T
p;
The gross energy that node K has consumed is E
kc=N
kse
sc+ N
kre
re+ N
kfe
ifw
The dump energy E of node K
k=E
max-E
kc
Wherein, P
sfor the transmitting power of transmitter; P
rfor the received power of receiver; T
pfor sending or receive a grouping required time; N
ks, N
kr, N
kfbe respectively the packet count of node K transmission, the packet count of reception, the packet count of forwarding.
As preferably, the span of described α is 0.4 to 0.6.
As preferably, the distance between described node J and neighbors H utilizes following formula to calculate:
wherein, P
tfor transmitting power, P
rfor received power, G
tand G
rbe respectively transmitter antenna gain (dBi) and receiving antenna gain, L is and propagates the irrelevant system loss factor, L>=1, and λ is wavelength.
As preferably, the distance between the address, J that comprises H in node J for storing the neighbor information table of information of neighbors H and H and the life span LTM of corresponding this neighbor information table.
Therefore, the present invention has following beneficial effect:
(1) in the present invention, each node determines whether forwarding according to the situation of self (with distance, the energy of neighbors), and meanwhile, forward node is by the forwarding of staggering the time, can reduce node to the fighting for and the probability of signal collision of channel, improve broadcast reliability.
(2) node in network of the present invention does not adopt HELLO grouping dynamically to upgrade neighbor information according to the grouping receiving, and has reduced the fight for probability of node to channel.
(3) the present invention has adopted the method for balancing energy, and the dump energy of node is determined to forward as one the factor of weighing priority.If a node meets forwarding condition in distance, but its dump energy is lower, by reducing the probability of this node forwarding, select the node that dump energy is higher to forward as far as possible, in equalizing network, the dump energy of each node can improve the life-span of network.
(4) the present invention has quoted packet loss retransmission mechanism, has improved the reliability of broadcast, and utilizes the broadcast packe of neighbors forwarding to carry out the mode of " replying ", does not need extra acknowledgment packet, can additionally not increase the load of network.
Brief description of the drawings
Fig. 1 is a kind of schematic flow sheet of broadcasting method of the present invention;
Fig. 2 is a kind of schematic flow sheet that broadcasting method of the present invention is set up neighbor information table;
Fig. 3 is a kind of schematic flow sheet that the node of broadcasting method of the present invention sends broadcast packe;
Fig. 4 is the broadcast packe reception of broadcasting method of the present invention and a kind of schematic diagram of forwarding process.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention will be further described.
As shown in Figure 1, a kind of reliable broadcast method based on distance and balancing energy in mobile Ad Hoc network, comprises the steps:
Step 100, set up neighbor information table:
The grouping that any node J in mobile Ad Hoc network receives its arbitrary neighbor node H, node J obtains the address of H from broadcast packe, and calculates the distance between J and H;
If node J receives the grouping from node H for the first time, node J sets up the neighbor information table for the information of memory node H;
Otherwise, distance and life span LTM in the neighbor information table of node J renewal corresponding node H;
Life span LTM is illustrated in situation about further not receiving from any information of node H, the life span of the neighbor information table of corresponding node H; In life cycle LTM, if node J does not receive the grouping from H again, for J, H will be no longer neighbor node, and LTM timing is arrived, and it is removed from neighbor information table; If received any type of grouping from this neighbors in LTM, represent the neighbors of this neighbors or node J, just need to upgrade LTM.The size of LTM can arrange different values according to concrete network scenario.
Step 200, sends or forwards broadcast packe:
Step 210, in the time that node J need to send broadcast packe, node J is according to neighbor node number J
numdistribution situation setpoint distance threshold value D with neighbor node
th, and in neighbor node, select neighbours apart from maximum D
max;
As neighbor node number J
numit is 1 o'clock, by D
maxbe made as the distance between this neighbor node and J, and by D
thbe made as 0;
As neighbor node number J
numduring for 2-4, by D
thbe made as the minimum value of distance in each neighbors and between node J, by D
maxbe made as the maximum of distance in each neighbors and between node J;
As neighbor node number J
numbe greater than at 4 o'clock, by D
maxbe made as the maximum of distance in each node and between node J, set D
th, and make D
thmeet with the distance of node J and be greater than D
thneighbor node number>=J
num/ 2;
Node J is by distance threshold value D
thwith neighbours apart from maximum D
maxbe recorded in the packets headers of broadcast packe, and send broadcast packe;
Node J presets response time A
ckt, when node J sends the A after broadcast packe
cktin time, node J does not receive the identical broadcasts grouping from arbitrary neighbor node, and node J makes the judgement that broadcast packe sends failure or bumps; A
ckttiming is arrived, and node J resends this broadcast packe, and response time A is no longer set after being sent for the second time
cktwait for that neighbors forwards identical broadcast packe;
When node J receives the same broadcast packe from arbitrary neighbor node, node J makes the judgement that this broadcast packe has successfully sent;
Step 220, when any one neighbor node K of node J receives after this broadcast packe, if K did not forward the broadcast packe of node J, node K calculates its distance B apart from node J
kJ, and utilize D
kJupgrade the neighbours' distance in the neighbor information table of corresponding neighbors J; By D
kJwith the D in the packets headers of broadcast packe
thand D
maxcompare, determine whether node K needs to forward broadcast packe:
Work as D
kJ<D
thtime, node K does not forward broadcast packe;
Work as D
kJ=D
max, node K directly forwards broadcast packe;
Work as D
th<D
kJ<D
max, node K utilizes formula
calculate and forward power PI, wherein, α is the constant of setting in network, the radius of the wireless coverage that R is node, E
kfor the current remaining of node K, E
maxthe maximum energy value that can provide for the battery of node K; Utilize formula
forwarding Latency time T i, wherein, tanh () is hyperbolic tangent function operator, MT is the maximum delay time of setting, PI
maxbe the maximum of PI, n is time constant; Then K is according to Forwarding Latency time T
1carry out time delay, wait for and forward above-mentioned broadcast packe;
Work as D
kJ>D
max, showing not have in the neighbor information table of J the information of K, K will not forward in this case;
Cause the information that there is no K in the neighbor information table of J, mainly contain following several situation: 1. node K is in resting state, never initiatively sent any clean culture, multicast or broadcast packe; 2. in a life cycle LTM, K does not send or forwards any grouping again, and therefore then J deletes the corresponding record of K from neighbor information table the LTM time; 3. K plays the part of the role of receiving terminal in network, and K is only responsible for reception and can forward any grouping.
Step 230, when node K need to forward broadcast packe, node K utilizes the method identical with node J to determine D
thand D
max, and by D
thand D
maxbe recorded in the broadcast packe head of forwarding, the value in upper hop node address field in broadcast packe head is revised as to this address of node, then node K forwards broadcast packe;
Step 300, in network, all nodes alternately perform step 110 to 200 repeatedly, until all node stop are broadcasted this broadcast packe.
The forwarding power of the broadcast packe in the present embodiment is by receiving node oneself decision, and the each node in network has a neighbor information table, is used for recording the information of neighbor node.Node, according to the signal power (no matter being clean culture, multicast or broadcast) of the grouping from neighbor node receiving, calculates distance own and sending node, obtains own topology information around.In the time that certain node J will send broadcast packe, first check the neighbor information table of oneself, according to the number of neighbor node and distance, select neighbours apart from maximum, and calculate neighbours' distance threshold value, these two values are added in broadcast packe.The neighbor node of J is receiving after this broadcast packe, first calculates the distance between they and J, then with this broadcast packe head in distance threshold value compare.The node that distance is less than threshold value will not forward; If the distance of neighbor node is greater than threshold value, these nodes, as candidate's forward node, are further considered the dump energy of self.According to the dump energy of self and distance, determine and forward priority, calculate forward delay time according to priority, carry out timesharing cooperation forwarding.
The present embodiment is in order to ensure the reliability of broadcast packe transport process, introduced packet loss retransmission mechanism, via node forwards after broadcast message, if again do not receive the identical broadcast message forwarding from neighbors, think that this forwarding is unsuccessful, resend.
In the present embodiment, cancel HELLO grouping mutual, utilize the various groupings that receive to obtain neighbor information, reduce node energy consumption, minimizing channel competition object thereby reach; Select forward node to carry out timesharing forwarding according to the distance of node and dump energy information, can equalizing network in the energy consumption of node, and reduce broadcast message redundancy, reduce the probability of packet collisions; Adopt retransmission mechanism simultaneously, increased the reliability of broadcast packe.
Fig. 2 to Fig. 4 has provided concrete implementation and the reciprocal process of each mobile radio station use present embodiment in network, and foundation, the node of introducing respectively neighbor information table send the flow process of broadcast packe and node reception broadcast packe.
The Establishing process of neighbor information table as shown in Figure 2.In the time that node J receives the grouping from certain node H, first obtain the address of node H and the distance of J and H.J checks whether neighbor information table has the record sheet of node H simultaneously.If there is no record, the information of H is added in neighbor information table, the life cycle LTM of H is set, wait for and within the LTM time, whether again receive the grouping from H.If there is record, the distance that then checks J and H whether with neighbor table in record consistent, if consistent, the life cycle LTM of new node H more immediately, is set to maximum; If inconsistent, upgrade neighbor information and LTM about node H.If receive the grouping from H within the LTM time, the distance that continues to check J and H whether with neighbor table in record consistent; If LTM mono-arrives, also do not receive any grouping of node H, from node J, delete the neighbor information table of corresponding node H.
After neighbor information table is set up, the handling process of sending node as shown in Figure 3, in the time that sending node J wish sends broadcast packe, first can check neighbor information table.If only have a neighbor node, by D
maxbe made as the distance value of this neighbor node, by D
thbe made as 0.If there be 2-4 neighbor node, using distance value minimum in these neighbor nodes as D
th, maximum as D
max.If the number of neighbor node is greater than 4, according to the distribution of neighbor node, calculate threshold value D
th, the distance of the neighbor node of farthest is as D
max.
By D
thand D
maxbe recorded in the corresponding field of broadcast packe, then send broadcast packe, a response time A is set simultaneously
ckt.If at this moment, node J does not receive the identical broadcast packe from neighbor node, and J thinks that this broadcast packe sends unsuccessfully or bumps at receiving node place, and J resends once this broadcast packe, ensures the reliability of broadcast.If node J receives the identical broadcast packe from neighbor node, this broadcast packe is just equivalent to replying of broadcast packe that node J is sent so, J thinks that neighbor node has successfully received the broadcast packe of its transmission, no longer processes the task relevant with this broadcast packe.
The handling process that node forwards as shown in Figure 4, when any one neighbor node K receives after the broadcast packe from node J, according to the signal strength signal intensity receiving, is first calculated distance B between the two
kJ, and upgrade the relative recording of J in neighbor information table.Then by D
kJwith the D in broadcast packe head
thand D
maxcompare.
If D
kJ<D
th, node K does not consider to forward.
If D
kJ=D
max, show that K is far away apart from J, forward the extra area obtaining larger, K will have preferential forwarding power, without time delay, directly forward.
If D
th≤ D
kJ<D
max, K likely forwards: node K will be further according to distance and dump energy, determines and forwards power PI.Determine and forward the stand-by period according to PI, carry out time delay, wait for and forwarding.
If D
kJ>D
max, K shows not have in the neighbor information table of J the information of K, so will not forward in this case.
After above-mentioned judgement, if node K needs to forward, node K utilizes the method identical with node J to determine D
thand D
max, these two value records, in broadcast packe head, and are revised as to this address of node by the value in upper hop node address field in packets headers.Wait in the process of time delay forwarding at node K, if K receives the identical broadcast packe forwarding from node N, the distance B of K calculating K and N again
kN.If D
kNdistance be greater than r, K continues time delay, wait for forward.If D
kNdistance be less than r, again to forward obtained extra area will be very little to K so, K cancels time delay, does not forward.If K is greater than 1 time at the number of times of waiting for this broadcast packe of receiving in the process of time delay, K cancels forwarding.
If at response time A
cktinside receive identical broadcast packe, node K deletes the broadcast packe of having stored; If no, again send this broadcast packe, and no longer send this broadcast packe.
In network, all nodes are alternately carried out the renewal of neighbor information table, transmission and forwarding process repeatedly, until all node stop are broadcasted this broadcast packe.
Just can write out the program code of protocol method of the present invention according to the flow process of present embodiment, after code compilation success, just can be applied in the broadcast of network.For the performance that better embodies protocol method of the present invention improves, protocol method of the present invention is carried out to emulation with network simulation simulation softward.According to analysis of simulation result agreement advantage place in arrival rate, forward node ratio, end-to-end time delay mean value, network lifetime etc.Protocol method of the present invention mainly can be analyzed from four performance index: (1) arrival rate (Reachability): be also referred to as accessibility, be defined as all destination nodes and receive the ratio of the broadcast packe number that broadcast packe number and all destination nodes should receive.The broadcast packe number that wherein all destination nodes should be received is exactly the amassing of number and all destination node numbers of the broadcast packe that sends of source node.(2) forward node ratio (Retransmi tted ratio): be defined as the ratio that participates in forwarding all nodes in the nodes of broadcast packe and network.(3) end-to-end time delay mean value (Average end-to-end delay): be defined as source node and produce broadcast packe and receive the mean value of the time delay between broadcast packe to all destination nodes.(4) network lifetime (Network life time): be defined as from network simulation, exhaust duration to first node energy in network.In order to find out the advantage place of protocol method of the present invention on this four indices, itself and DP agreement are compared.Main observe two kinds of agreements in the time that node is static and the performance in two kinds of situations when node motion.By the data analysis after emulation, the arrival rate of protocol method of the present invention under the static and two kinds of situations of node motion of node is apparently higher than DP protocol method, reduce the probability of broadcast packe collision, improve network efficiency, and the reliability that further guarantee is broadcasted, and DP algorithm is owing to only carrying out the forwarding probability of dynamic knot modification according to neighbours' number of node, do not have the collision problem that consideration may exist at receiving node place, thereby lower than DEBRB algorithm arrival rate; Aspect forward node ratio, this protocol method is along with the increase of network node density, and this protocol method maintains more stable value, and is better than all the time DP method, that is to say that DEBRB has reduced the nodes that participates in broadcast, has suppressed broadcast storm better; Aspect end-to-end time delay mean value, in the time that nodes density increases, the time delay average of two kinds of protocol methods all can increase, but the time delay average of DEBRB algorithm is all the time lower than DP algorithm, this is due in DEBRB algorithm, and the node in network dynamically upgrades neighbor information according to the grouping receiving, and selects forward node to carry out timesharing forwarding, reduce node to the fighting for probability and be grouped in the stand-by period in queue of channel, so time delay is less; In network lifetime performance index, the network lifetime of this protocol method is apparently higher than DP algorithm, there is longer network lifetime, this is because considered balancing energy in DEBRB, do not adopt the HELLO mutual neighbor information of dividing into groups, reduce energy consumption, the balanced energy of nodes.
The present invention obtains node topology information around by the grouping from neighbor information receiving in network, has reduced the probability of broadcast packe collision; Each node determines the forwarding priority of self by distance and dump energy, thereby has reduced hop count, has suppressed preferably broadcast storm; Adopt the method for balancing energy, the dump energy of each node in equalizing network, the life-span of improving network; Adopt packet loss retransmission mechanism, improved the reliability of broadcast.The present invention can be applied in the broadcast technology of mobile Ad Hoc network preferably.
Should be understood that the present embodiment is only not used in and limits the scope of the invention for the present invention is described.In addition should be understood that those skilled in the art can make various changes or modifications the present invention after having read the content of the present invention's instruction, these equivalent form of values fall within the application's appended claims limited range equally.
Claims (7)
1. the broadcasting method based on distance and balancing energy in mobile Ad Hoc network, is characterized in that, comprises the steps:
(1-1) set up neighbor information table:
The grouping that any node J in mobile Ad Hoc network receives its arbitrary neighbor node H, node J obtains the address of H from broadcast packe, and calculates the distance between J and H;
If node J receives the grouping from node H for the first time, node J sets up the neighbor information table for the information of memory node H;
Otherwise, distance and life span LTM in the neighbor information table of node J renewal corresponding node H;
(1-2) send or forward broadcast packe:
(1-2-1), in the time that node J need to send broadcast packe, node J is according to neighbor node number J
numdistribution situation setpoint distance threshold value D with neighbor node
th, and in neighbor node, select neighbours apart from maximum D
max;
As neighbor node number J
numit is 1 o'clock, by D
maxbe made as the distance between this neighbor node and J, and by D
thbe made as 0;
As neighbor node number J
numduring for 2-4, by D
thbe made as the minimum value of distance in each neighbors and between node J, by D
maxbe made as the maximum of distance in each neighbors and between node J;
As neighbor node number J
numbe greater than at 4 o'clock, by D
maxbe made as the maximum of distance in each neighbors and between node J, set D
th, and make D
thmeet with the distance of node J and be greater than D
thneighbor node number>=J
num/ 2;
Node J is by distance threshold value D
thwith neighbours apart from maximum D
maxbe recorded in the packets headers of broadcast packe, and send broadcast packe;
Default response time A in node J
ckt, the A after node J forwards broadcast packe
cktin time, node J does not receive the identical broadcasts grouping from arbitrary neighbor node, and node J makes the judgement that broadcast packe sends failure or bumps, and node J resends this broadcast packe, and response time A is no longer set after being sent for the second time
cktwait for that neighbors forwards identical broadcast packe;
When node J is at A
cktin time, receive the identical broadcasts grouping from arbitrary neighbor node, node J makes the judgement that broadcast packe has successfully sent;
(1-2-2) when any one neighbor node K of node J receives after this broadcast packe, if K did not forward the broadcast packe of node J, the distance B of node K calculating and node J
kJ, and set up the neighbor information table of corresponding neighbors J or upgrade neighbours' distance and the LTM in the neighbor information table of corresponding neighbors J; By D
kJwith the D in the packets headers of broadcast packe
thand D
maxcompare, determine whether node K needs to forward this broadcast packe:
Work as D
kJ<D
thtime, node K does not forward this broadcast packe;
Work as D
kJ=D
maxtime, node K directly forwards this broadcast packe;
Work as D
th<D
kJ<D
maxtime, node K utilizes formula
calculate and forward power PI, wherein, α is the constant of setting in network, the radius of the wireless coverage that R is node, E
kfor the current remaining of node K, E
maxthe maximum energy value that can provide for the battery of arbitrary node; Utilize formula
calculate Forwarding Latency time T i, wherein, tanh () is hyperbolic tangent function operator, and MT is the maximum delay time of setting, PI
maxbe the maximum of PI, n is time constant; Then K is according to Forwarding Latency time T
1carry out time delay, wait for and forward above-mentioned broadcast packe;
Work as D
kJ>D
maxtime, K does not forward this broadcast packe;
(1-2-3), when node K need to forward broadcast packe, node K utilizes the method identical with node J to determine D
thand D
max, and by D
thand D
maxbe recorded in the broadcast packe head of forwarding, the value in upper hop node address field in broadcast packe head is revised as to this address of node, then node K sends broadcast packe;
(1-3) in network, all nodes alternately perform step (1-1) repeatedly to (1-2), until all node stop are broadcasted this broadcast packe.
2. the broadcasting method based on distance and balancing energy in mobile Ad Hoc network according to claim 1, it is characterized in that, described node K waits in the process of time delay forwarding, if K receives the identical broadcast packe that arbitrary neighbors N forwards, the distance B of node K calculating K and N again
kN;
If D
kNdistance be greater than r, K continues time delay, wait for forward;
If D
kNdistance be less than r, K cancel time delay, do not forward.
If K receives that the number of times of this broadcast packe is greater than 1 time in the process of waiting for time delay, K cancels forwarding; Wherein, the scope of r is:
3. the broadcasting method based on distance and balancing energy in mobile Ad Hoc network according to claim 1, is characterized in that described broadcast packe response time A
ckt=t
1+ 2t
2+ MT; Wherein, t
1it is the transmitting time of a broadcast packe; t
2for the propagation delay of network.
4. the broadcasting method based on distance and balancing energy in mobile Ad Hoc network according to claim 1, is characterized in that the dump energy E of described node K
kutilizing following steps to calculate obtains:
Node K sends a grouping institute consumed energy: E
sc=P
st
p;
Node K receives an energy that divides into groups to consume: E
re=P
rt
p;
It is two kinds of operation institute energy requirement sum: E of sending and receiving that node K forwards a required energy of grouping
ifw=(P
s+ P
r) T
p;
The gross energy that node K has consumed is E
kc=N
kse
sc+ N
kre
re+ N
kfe
ifw
The dump energy E of node K
k=E
max-E
kc
Wherein, P
sfor the transmitting power of transmitter; P
rfor the received power of receiver; T
pfor sending or receive a grouping required time; N
ks, N
kr, N
kfbe respectively the packet count of node K transmission, the packet count of reception, the packet count of forwarding.
5. the broadcasting method based on distance and balancing energy in mobile Ad Hoc network according to claim 1, is characterized in that, the span of described α is 0.4 to 0.6.
6. the broadcasting method based on distance and balancing energy in mobile Ad Hoc network according to claim 1, is characterized in that, the distance between described node J and neighbors H utilizes following formula to calculate:
wherein, P
tfor transmitting power, P
rfor received power, G
tand G
rbe respectively transmitter antenna gain (dBi) and receiving antenna gain, L is and propagates the irrelevant system loss factor, L>=1, and λ is wavelength.
7. according to the broadcasting method based on distance and balancing energy in the mobile Ad Hoc network described in claim 1 or 2 or 3 or 4 or 5 or 6, it is characterized in that the distance between the address, J that comprises H in node J for storing the neighbor information table of information of neighbors H and H and the life span LTM of corresponding this neighbor information table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410142510.2A CN104009913B (en) | 2014-04-10 | 2014-04-10 | Broadcasting method based on distance and energy balance in mobile Ad Hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410142510.2A CN104009913B (en) | 2014-04-10 | 2014-04-10 | Broadcasting method based on distance and energy balance in mobile Ad Hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104009913A true CN104009913A (en) | 2014-08-27 |
| CN104009913B CN104009913B (en) | 2017-01-25 |
Family
ID=51370408
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410142510.2A Expired - Fee Related CN104009913B (en) | 2014-04-10 | 2014-04-10 | Broadcasting method based on distance and energy balance in mobile Ad Hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104009913B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105357731A (en) * | 2015-10-14 | 2016-02-24 | 国网辽宁省电力有限公司营口供电公司 | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment |
| CN105872986A (en) * | 2016-04-22 | 2016-08-17 | 浙江工商大学 | Broadcasting method in mobile Ad Hoc network based on node broadcasting success rate and energy balance |
| CN106888436A (en) * | 2017-04-04 | 2017-06-23 | 厦门四信通信科技有限公司 | A kind of method of reliable broadcast in wireless Ad Hoc network |
| CN108737972A (en) * | 2018-04-24 | 2018-11-02 | 浙江工商大学 | Cooperation broadcasting method based on virtual gravitation in mobile Ad Hoc networks |
| CN109951834A (en) * | 2019-04-04 | 2019-06-28 | 苏州博联科技有限公司 | Bluetooth mesh method for routing based on the improved algorithm that floods |
| CN112004184A (en) * | 2020-07-23 | 2020-11-27 | 苏州博联科技有限公司 | Automatic configuration method of Bluetooth mesh friendship function |
| CN112770283A (en) * | 2019-10-21 | 2021-05-07 | 中国石油化工股份有限公司 | Signal transmission method and system for discrete control system |
| CN114024786A (en) * | 2022-01-04 | 2022-02-08 | 杭州趣链科技有限公司 | Message broadcasting method and device, computer equipment and storage medium |
| CN114697877A (en) * | 2020-12-30 | 2022-07-01 | 华为技术有限公司 | Communication method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
| CN103052147A (en) * | 2013-01-06 | 2013-04-17 | 浙江大学 | Energy effectiveness multistage ring-type networking method based on wireless sensor network |
| CN103188758A (en) * | 2013-03-25 | 2013-07-03 | 电子科技大学 | Energy saving method for wireless sensor network |
-
2014
- 2014-04-10 CN CN201410142510.2A patent/CN104009913B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
| CN103052147A (en) * | 2013-01-06 | 2013-04-17 | 浙江大学 | Energy effectiveness multistage ring-type networking method based on wireless sensor network |
| CN103188758A (en) * | 2013-03-25 | 2013-07-03 | 电子科技大学 | Energy saving method for wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| FANGBIN LIU等: "An Energy-efficient and Real-time Anonymous Routing Protocol for Ad hoc Networks", 《JOURNAL OF COMPUTERS》 * |
| 丁莹等: "AODV 局部连接性管理的性能分析及其改进", 《四川大学学报(自然科学版)》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105357731A (en) * | 2015-10-14 | 2016-02-24 | 国网辽宁省电力有限公司营口供电公司 | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment |
| CN105872986A (en) * | 2016-04-22 | 2016-08-17 | 浙江工商大学 | Broadcasting method in mobile Ad Hoc network based on node broadcasting success rate and energy balance |
| CN105872986B (en) * | 2016-04-22 | 2019-02-15 | 浙江工商大学 | Broadcasting method based on node successful broadcast rate and balancing energy in mobile Ad Hoc network |
| CN106888436A (en) * | 2017-04-04 | 2017-06-23 | 厦门四信通信科技有限公司 | A kind of method of reliable broadcast in wireless Ad Hoc network |
| CN108737972A (en) * | 2018-04-24 | 2018-11-02 | 浙江工商大学 | Cooperation broadcasting method based on virtual gravitation in mobile Ad Hoc networks |
| CN109951834A (en) * | 2019-04-04 | 2019-06-28 | 苏州博联科技有限公司 | Bluetooth mesh method for routing based on the improved algorithm that floods |
| CN112770283A (en) * | 2019-10-21 | 2021-05-07 | 中国石油化工股份有限公司 | Signal transmission method and system for discrete control system |
| CN112004184A (en) * | 2020-07-23 | 2020-11-27 | 苏州博联科技有限公司 | Automatic configuration method of Bluetooth mesh friendship function |
| CN114697877A (en) * | 2020-12-30 | 2022-07-01 | 华为技术有限公司 | Communication method and device |
| CN114024786A (en) * | 2022-01-04 | 2022-02-08 | 杭州趣链科技有限公司 | Message broadcasting method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104009913B (en) | 2017-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104009913A (en) | Broadcasting method based on distance and energy balance in mobile Ad Hoc network | |
| JP4526533B2 (en) | Contention transfer with integrated multi-user detection | |
| EP2562940B1 (en) | Method for cooperative data transmission among terminals, and method for clustering cooperative terminals for same | |
| Wang et al. | Network coding aware cooperative MAC protocol for wireless ad hoc networks | |
| US10257718B2 (en) | Method for configuring a network comprising several nodes, a method for transmitting data in said network, and corresponding equipment and computer program | |
| CN107182103B (en) | Cooperative broadcasting method based on neighbor broadcasting coefficient in mobile self-organizing network | |
| CN105704678B (en) | Broadcasting method based on neighbours' successful broadcast rate in mobile ad-hoc network | |
| CN103856399B (en) | Ad Hoc backup route algorithm based on stability | |
| CN103108374B (en) | A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network | |
| Schaefer et al. | Potentials of opportunistic routing in energy-constrained wireless sensor networks | |
| CN102271378A (en) | Routing method based on AODV (Ad hoc On-demand Distance Vector) protocol | |
| CN105872986A (en) | Broadcasting method in mobile Ad Hoc network based on node broadcasting success rate and energy balance | |
| Dahlstrom et al. | Performance analysis of routing protocols in Zigbee non-beacon enabled WSNs | |
| CN112423356B (en) | Unmanned equipment cluster AODV routing method based on energy balance | |
| Nacef et al. | COSMIC: a cooperative MAC protocol for WSN with minimal control messages | |
| US20120163295A1 (en) | Communication apparatus and method | |
| Junior et al. | Dual radio networks: Are two disjoint paths enough? | |
| Durai et al. | Energy efficient random cast DSR protocol with mediation device in MANET | |
| Zhang et al. | Body-to-body network routing algorithm based on link comprehensive stability | |
| Yamao et al. | Cross-layer multi-hopping scheme for efficient and reliable transmission in fading environment | |
| Johnson | A Cross-Layer Design for Reducing Packet Loss Caused by Fading in a Mobile Ad Hoc Network | |
| Yang et al. | A multichannel transmitting and assistant nodes MAC protocol for mobile ad hoc networks | |
| Das et al. | Distributed energy adaptive location-based cooperative mac protocol for prolonging the network lifetime of manet | |
| Ahmed et al. | Energy efficient smart-relay-based cooperative MAC for wireless networks | |
| Yamini et al. | Improved Location-Free Topology control Protocol in 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170125 Termination date: 20200410 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |