CN112039787B - Broadcast routing method based on overlapping area minimization - Google Patents

Broadcast routing method based on overlapping area minimization Download PDF

Info

Publication number
CN112039787B
CN112039787B CN202010695355.2A CN202010695355A CN112039787B CN 112039787 B CN112039787 B CN 112039787B CN 202010695355 A CN202010695355 A CN 202010695355A CN 112039787 B CN112039787 B CN 112039787B
Authority
CN
China
Prior art keywords
node
nodes
broadcast
received
broadcast message
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
Application number
CN202010695355.2A
Other languages
Chinese (zh)
Other versions
CN112039787A (en
Inventor
司鹏搏
魏京生
张苗
王祎玮
杨睿哲
李萌
张延华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Technology
Original Assignee
Beijing University of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Technology filed Critical Beijing University of Technology
Priority to CN202010695355.2A priority Critical patent/CN112039787B/en
Publication of CN112039787A publication Critical patent/CN112039787A/en
Application granted granted Critical
Publication of CN112039787B publication Critical patent/CN112039787B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL

Abstract

The invention provides a broadcast routing algorithm based on the minimization of an overlapping area, aiming at the defects of large broadcast redundancy and extremely high rebroadcasting rate of the traditional flooding broadcast algorithm. Aiming at the defects of broadcast redundancy and high communication overhead in the traditional flooding broadcast mechanism, the algorithm finally saves a large amount of rebroadcasting from the viewpoint that the overlapping area between the coverage areas of adjacent rebroadcasting nodes is minimized, thereby reducing energy consumption.

Description

Broadcast routing method based on overlapping area minimization
Technical Field
The invention belongs to the field of wireless sensor networks, routing protocols and broadcast routing, and particularly relates to a broadcast routing algorithm designed from the minimum angle of an overlapping area.
Background
The conventional flooding broadcast is a broadcast algorithm commonly used in a wireless sensor network, and the basic idea is that a node receiving information forwards a data packet in a broadcast manner. For example, a source node wishing to send a piece of data to all nodes in a wireless network first sends a copy of the data to each of its neighboring nodes, which in turn send the data to nodes within their respective transmission areas, and so on until a broadcast target is reached or a data set time-to-live (TTL) of 0. In the conventional flooding implementation process, there are problems of broadcast redundancy and energy waste, because each node in the network, whether it has received a data packet before or not, receives the data packet as long as it is in the transmission area of the node to be forwarded, or if the node is in the transmission area of a plurality of nodes to be forwarded, it receives the data packet from the plurality of nodes, which causes problems of broadcast redundancy and energy waste, and the lifetime of the whole network is affected.
And assuming that n is the number of times of triggering new rebroadcasting, namely, n next hop nodes are selected. If the value of n is large, the reliability and coverage rate of broadcasting can be ensured, and broadcasting packets can be relayed by nodes as many as possible, for example, the value of n is maximized in a traditional flooding broadcasting mechanism, but the larger the value of n is, the larger the area of an overlapping area covered by repeated relaying is, and larger relaying redundancy can be generated. Therefore, from the perspective of retransmission redundancy, retransmission of one node should cause as few new retransmissions as possible, i.e. n should be as few as possible, but if n is 1, too low broadcast reach rate may result, and it cannot be guaranteed that the message is broadcast to most nodes in the network. In order to reduce the broadcasting redundancy and comprehensively consider the broadcasting reachable rate and the broadcasting efficiency, n is better to be 2.
Disclosure of Invention
In order to overcome the defects of the traditional flooding broadcast algorithm, the invention provides a broadcast routing algorithm based on the minimization of an overlapping area, and the problems of broadcast redundancy and energy waste are effectively solved.
The invention provides a broadcast routing algorithm based on the minimization of an overlapping area, which comprises the following steps:
a broadcast routing algorithm based on overlap area minimization, the algorithm comprising the steps of:
step 1: in the wireless sensor network, a source node S selects all nodes in a propagation area as next skip broadcast nodes;
step 2: for a node i which needs to be rebroadcast currently, making a broadcast decision and selecting two next-hop rebroadcast nodes according to the optimal rebroadcast position and the state of a neighbor node in a rebroadcast area;
and step 3: recording the number of all nodes for rebroadcasting in the broadcasting process of reaching a broadcasting target, and calculating the rebroadcasting rate;
Figure BDA0002590838980000021
the step 2 specifically comprises the following steps:
step 2.1: for the nodes needing rebroadcasting currentlyi, according to its coordinates (x)i，yi) And coordinates (x) of its previous hop node U (i)U(i)，yU(i)) Calculating two optimal location points I in its neighborhood1(i)，I2(i) Their respective coordinates are (x)1，y1)，(x2，y2) The calculation formula is as follows:
Figure BDA0002590838980000031
l is the distance between node i and the last hop node U (i)
Figure BDA0002590838980000032
Step 2.2: to reduce unnecessary retransmissions, the algorithm limits the range of the retransmission nodes. For a relay node i, calculating all nodes in the neighborhood to two optimal positions (x) respectively1，y1)，(x2，y2) And respectively take two corresponding minimum distances l1,l2Respectively correspond to the points (x)11,y11)，(x21,y21). If the two minimum distances are greater than the threshold/TIf yes, the node closest to the two best positions is abandoned as the next hop broadcast node, and step 2.3 is executed, wherein l is takenT1.5; if the two minimum distances are less than or equal to the threshold lTIf the two nodes have not received the broadcast message or only one of the two nodes has received the broadcast message, selecting the two nodes as a next skip broadcast node, continuing to perform next round of rebroadcast, and if the two nodes have received the broadcast message, giving up selecting the node closest to the two optimal positions as the next skip broadcast node, and further executing the step 2.3;
step 2.3: selecting two nodes (x) with the shortest distance from the two nodes in the neighborhood of the current relay node i12,y12)，(x22,y22) As the next hop broadcasting node, judges thisAnd if both the nodes have not received the broadcast message or only one of the nodes has received the broadcast message, selecting the two nodes as next hop broadcast nodes and continuing the next round of broadcast.
Compared with the traditional flooding route broadcasting algorithm, the method can effectively reduce the area of the overlapping area covered by repeated rebroadcasting, thereby reducing the rebroadcasting rate and reducing the total energy consumption in the broadcasting process.
Drawings
FIG. 1 is a flow chart of an algorithm;
FIG. 2 is a diagram illustrating the influence of the transmission radius of a node on the broadcast reachability in the broadcast routing algorithm based on the minimization of the overlap area according to the present invention;
fig. 3 is a comparison of broadcast routing algorithm based on overlap area minimization and conventional flooding routing broadcast algorithm in broadcast retransmission rate according to the present invention.
Detailed Description
The invention will be further described with reference to the accompanying figures 1-3:
the principle of the broadcast routing algorithm based on the minimization of the overlapping area provided by the invention is as follows: the source node selects all nodes in the transmission area as the next skip broadcast node; then, two optimal position nodes (x) in the transmission area of the node i needing to be retransmitted are calculated1，y1),(x2，y2) Respectively calculating the distances from all nodes in the neighborhood of the node i to the two nodes at the optimal positions, and respectively taking two corresponding minimum distances l1,l2If the two minimum distances are greater than the threshold/TThen forgo selection of the node (x) closest to the two best positions11,y11)，(x21,y21) As the next hop broadcasting node, and selecting two nodes (x) with the shortest distance in the neighborhood of the current relay broadcasting node i12,y12)，(x22,y22) As the next hop broadcasting node, it is still necessary to determine whether the two close-range nodes have already received the broadcast message, as long as one of the nodes has not received the broadcast message,selecting the two close-range nodes as next hop broadcast nodes, otherwise giving up the relay broadcast of the node i; if the two minimum distances are less than or equal to the threshold value, the minimum distance l is judged1,l2Two points (x) corresponding to each other11,y11)，(x21,y21) If the broadcast message is received, two close-range nodes are selected as next hop broadcast nodes as long as one node does not receive the broadcast message, and if the two nodes receive the broadcast message, two nodes (x) with the shortest distance are selected in the neighborhood of the current hop node i12,y12)，(x22,y22) And the node is used as a next skip broadcast node, whether the two close-range nodes already receive the broadcast message is judged, if one of the two close-range nodes does not receive the broadcast message, the two close-range nodes are selected as the next skip broadcast node, and if not, the retransmission of the node i is abandoned.
As shown in fig. 1, is a schematic flow chart of the algorithm, and specifically includes the following steps:
step 1: in the wireless sensor network, a source node S selects all nodes in a propagation area as next skip broadcast nodes;
step 2: for a node i which needs to be rebroadcast currently, making a broadcast decision and selecting two next-hop rebroadcast nodes according to the optimal rebroadcast position and the state of a neighbor node in a rebroadcast area;
the step 2 further comprises the following steps:
step 2.1: for the node i which needs to be retransmitted currently, the coordinate (x) of the node i is determinedi，yi) And coordinates (x) of its previous hop node U (i)U(i)，yU(i)) Calculating two optimal location points I in its neighborhood1(i)，I2(i) Their respective coordinates are (x)1，y1)，(x2，y2) The calculation formula is as follows:
Figure BDA0002590838980000051
l is the distance between node i and the last hop node U (i)
Figure BDA0002590838980000052
Step 2.2: to reduce unnecessary retransmissions, the algorithm limits the range of the retransmission nodes. For a relay node i, calculating all nodes in the neighborhood to two optimal positions (x) respectively1，y1)，(x2，y2) And respectively take two corresponding minimum distances l1,l2Respectively correspond to the points (x)11,y11)，(x21,y21). If the two minimum distances are greater than the threshold/TIf yes, the node closest to the two best positions is abandoned as the next hop broadcast node, and step 2.3 is executed, wherein l is takenT1.5; if the two minimum distances are less than or equal to the threshold lTIf the two nodes have not received the broadcast message or only one of the two nodes has received the broadcast message, selecting the two nodes as a next skip broadcast node, continuing to perform next round of rebroadcast, and if the two nodes have received the broadcast message, giving up selecting the node closest to the two optimal positions as the next skip broadcast node, and further executing the step 2.3;
step 2.3: selecting two nodes (x) with the shortest distance from the two nodes in the neighborhood of the current relay node i12,y12)，(x22,y22) As the next skip broadcast node, judging whether the two nodes have received the broadcast message, if both the two nodes have received the broadcast message, abandoning the retransmission of the current node i, if both the two nodes have not received the broadcast message or only one of the two nodes has received the broadcast message, selecting the two nodes as the next skip broadcast node, and continuing the next round of retransmission;
and step 3: recording the number of all nodes for rebroadcasting in the broadcasting process of reaching a broadcasting target, and calculating the rebroadcasting rate;
Figure BDA0002590838980000061
the invention effectively solves the problem of broadcast redundancy and reduces the retransmission rate in the broadcast process, thereby reducing the total broadcast energy consumption.
The best mode is described as follows:
in order to verify the effectiveness of the algorithm, the difference between the traditional flooding broadcast routing algorithm and the broadcast routing algorithm based on the minimization of the overlapped area, which is provided by the invention, in the index of the retransmission rate is compared. In an experiment, Matlab is used to simulate a rectangular area with the length and width of 10 meters, 100 sensor nodes exist in the area, any one of the nodes is selected as a source node, and the influence of the transmission radius of the node on the broadcast reachability is firstly observed, as shown in fig. 2. Eighty percent or more than eighty percent of nodes in the whole network receive the data packets as a global target, in order to evaluate the performance of the algorithm, the two algorithms are compared by adopting the index of the retransmission rate, the specific experimental result refers to fig. 3, and it can be seen that the broadcast routing algorithm based on the minimization of the overlapping area is superior to the traditional flooding routing algorithm in the index of the retransmission rate.

Claims (1)

1. A broadcast routing method based on overlap area minimization, the method comprising the steps of:
step 1: in the wireless sensor network, a source node S selects all nodes in a propagation area as next skip broadcast nodes;
step 2: for a node i which needs to be rebroadcast currently, making a broadcast decision and selecting two next-hop rebroadcast nodes according to the optimal rebroadcast position and the state of a neighbor node in a rebroadcast area;
and step 3: recording the number of all nodes for rebroadcasting in the broadcasting process of reaching a broadcasting target, and calculating the rebroadcasting rate;
Figure FDA0003343217070000011
the step 2 specifically comprises the following steps:
step 2.1: for the node i which needs to be retransmitted currently, the coordinate (x) of the node i is determinedi，yi) And coordinates (x) of its previous hop node U (i)U(i)，yU(i)) Calculating two optimal location points I in its neighborhood1(i)，I2(i) Their respective coordinates are (x)1，y1)，(x2，y2) The calculation formula is as follows:
Figure FDA0003343217070000012
l is the distance between node i and the last hop node U (i)
Figure FDA0003343217070000013
Step 2.2: for a relay node i, calculating all nodes in the neighborhood to two optimal positions (x) respectively1，y1)，(x2，y2) And respectively take two corresponding minimum distances l1,l2Respectively correspond to the points (x)11,y11)，(x21,y21) (ii) a If the two minimum distances are greater than the threshold/TIf yes, the node closest to the two best positions is abandoned as the next hop broadcast node, and step 2.3 is executed, wherein l is takenT1.5; if the two minimum distances are less than or equal to the threshold lTIf the two nodes have not received the broadcast message or only one of the two nodes has received the broadcast message, selecting the two nodes as a next skip broadcast node, continuing to perform next round of rebroadcast, and if the two nodes have received the broadcast message, giving up selecting the node closest to the two optimal positions as the next skip broadcast node, and further executing the step 2.3;
step 2.3: selecting two nodes with the shortest distance in the neighborhood of the current relay node i (x12,y12)，(x22,y22) And as the next hop broadcast node, judging whether the two nodes have received the broadcast message, if both the two nodes have received the broadcast message, abandoning the relay of the current node i, and if both the two nodes have not received the broadcast message or only one of the two nodes has received the broadcast message, selecting the two nodes as the next hop broadcast node and continuing the next round of relay.
CN202010695355.2A 2020-07-20 2020-07-20 Broadcast routing method based on overlapping area minimization Active CN112039787B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010695355.2A CN112039787B (en) 2020-07-20 2020-07-20 Broadcast routing method based on overlapping area minimization

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010695355.2A CN112039787B (en) 2020-07-20 2020-07-20 Broadcast routing method based on overlapping area minimization

Publications (2)

Publication Number Publication Date
CN112039787A CN112039787A (en) 2020-12-04
CN112039787B true CN112039787B (en) 2022-03-08

Family

ID=73579328

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010695355.2A Active CN112039787B (en) 2020-07-20 2020-07-20 Broadcast routing method based on overlapping area minimization

Country Status (1)

Country Link
CN (1) CN112039787B (en)

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020145978A1 (en) * 2001-04-05 2002-10-10 Batsell Stephen G. Mrp-based hybrid routing for mobile ad hoc networks
GB2421158B (en) * 2003-10-03 2007-07-11 Avici Systems Inc Rapid alternate paths for network destinations
CN101572656A (en) * 2008-04-29 2009-11-04 北京循天行信息技术有限公司 Multicast method for wireless self-organization and sensor network based on target node drive
US9264243B2 (en) * 2013-02-19 2016-02-16 Cisco Technology, Inc. Flooding and multicasting in a loop-free routing topology using routing arcs
CN103561406A (en) * 2013-09-03 2014-02-05 南京林业大学 Wireless sensing routing algorithm with cluster cellular segmentation based on energy balance
US9787497B2 (en) * 2014-03-17 2017-10-10 Electronics And Telecommunications Research Institute Network apparatus and method using link layer routing
CN107645417A (en) * 2017-10-09 2018-01-30 天津理工大学 Towards the adaptive routing method of expressway car networking scene
CN108834100A (en) * 2018-06-15 2018-11-16 九江学院 A kind of efficient broadcast routing method

Also Published As

Publication number Publication date
CN112039787A (en) 2020-12-04

Similar Documents

Publication Publication Date Title
Stojmenovic et al. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks
US8064377B2 (en) Method for enhancement of multicasting forwarding protocol in a wireless network
Tonguz et al. Broadcasting in VANET
Chen et al. Channel-aware routing in MANETs with route handoff
EP1698117B1 (en) Method and system for efficient routing in ad hoc networks
KR100586233B1 (en) An optimal direction-based flooding method for mobile ad-hoc networks
Sengul et al. Bypass routing: An on-demand local recovery protocol for ad hoc networks
Ruiz et al. Brave: Beacon-less routing algorithm for vehicular environments
US20080125069A1 (en) Radio Device
CN113490251B (en) Mobile ad hoc network route construction method based on flooding constraint and multi-metric function
CN109600312B (en) BATMAN-Adv protocol optimization design method for intelligent terminal ad hoc network
JP4683488B2 (en) Relay radio station selection method, radio station, and program for source radio station in ad hoc network
Bai et al. Salvaging route reply for on-demand routing protocols in mobile ad-hoc networks
CN112039787B (en) Broadcast routing method based on overlapping area minimization
Paruchuri et al. Optimized flooding protocol for ad hoc networks
Anannya et al. Extended neighborhood knowledge based dominant pruning (exdp)
KR101762696B1 (en) Route Maintenance Protocol Using Destination-initiated Flooding in Mobile Ad Hoc Networks
Lou et al. Localized broadcasting in mobile ad hoc networks using neighbor designation
Luo et al. Real-time successful broadcasting ratio and distance based broadcast for vehicular ad hoc networks
Bano et al. Probabilistic broadcasting Protocol in ad hoc network and its advancement: a Review
Rogers et al. Towards reliable network wide broadcast in mobile ad hoc networks
Yackoski et al. Cross-layer inference-based fast link error recovery for MANETs
Yamamoto et al. Distributed retransmission method using neighbor terminals for ad hoc networks
Kaosar et al. Performance improvement of dynamic source routing protocol considering the mobility effect of nodes in cache management
AU2021104118A4 (en) A novel route maintenance and re-route discovery method based on aodv routing protocol

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant