CN111885509A - Single-hop broadcast control beam pointing method - Google Patents

Single-hop broadcast control beam pointing method Download PDF

Info

Publication number
CN111885509A
CN111885509A CN202010609021.9A CN202010609021A CN111885509A CN 111885509 A CN111885509 A CN 111885509A CN 202010609021 A CN202010609021 A CN 202010609021A CN 111885509 A CN111885509 A CN 111885509A
Authority
CN
China
Prior art keywords
broadcast
node
beam pointing
vertex
hop
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
Application number
CN202010609021.9A
Other languages
Chinese (zh)
Other versions
CN111885509B (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.)
CETC 10 Research Institute
Southwest Electronic Technology Institute No 10 Institute of Cetc
Original Assignee
Southwest Electronic Technology Institute No 10 Institute of Cetc
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 Southwest Electronic Technology Institute No 10 Institute of Cetc filed Critical Southwest Electronic Technology Institute No 10 Institute of Cetc
Priority to CN202010609021.9A priority Critical patent/CN111885509B/en
Publication of CN111885509A publication Critical patent/CN111885509A/en
Application granted granted Critical
Publication of CN111885509B publication Critical patent/CN111885509B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0617—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal for beam forming
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/24—Cell structures
    • H04W16/28—Cell structures using beam steering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0289—Congestion control

Abstract

The invention discloses a method for controlling beam pointing by single-hop broadcasting, and aims to provide a method with high broadcasting efficiency and low broadcasting delay. The method is realized by the following technical scheme: in a directional network, a broadcast node obtains geographical position information of the broadcast node and each neighbor node through a GPS (global positioning system), single wave beams are adopted to send data in quick broadcast, all neighbor nodes are informed to set wave beam directions and try to receive, and all other nodes schedule wave beam resources to point to the broadcast node to receive the data; then, the broadcasting node calculates a beam pointing set required by broadcasting transmission by using all the geographical position information, calculates included angles between every two links, creates a logic diagram G, and finds out the maximum complete subgraph in the logic diagram G to calculate a beam fingerTo determine the beam direction P by maximum complete subgraphi(ii) a And in the process of single beam forming transmission, the broadcast messages are transmitted one by one according to the beam direction set until all the beam directions in the beam set are processed.

Description

Single-hop broadcast control beam pointing method
Technical Field
The invention relates to a method for fast single-hop broadcast control beam pointing suitable for a directional network.
Background
The antenna has different radiation or receiving capability to different directions in space, which is the directivity of the antenna. Communication antennas used in wireless networks are generally classified into two types, an omni-directional antenna and a directional antenna, according to their different directivities. An omni-directional antenna refers to a non-directional, uniform radiation over the full range of the pattern. The directional antenna fingers have directivity and radiate within a certain angle range on a directional diagram. Compared with an omnidirectional antenna, the directional antenna has the advantages of high gain, long transmission distance, high speed, good anti-interference performance and the like, and is more and more widely applied to a wireless communication network.
A directional network is a wireless network in which all network nodes communicate with each other using directional antennas. A typical directional network shown in fig. 5, for example, the network includes A, B, C, D, E, F six nodes, each node is configured with a directional antenna capable of forming a communication beam with a specific width to any direction, and the beam width is as shown in fig. 6. The nodes are randomly and uniformly distributed on the field, the nodes with the directional antennas not aligned with each other cannot participate in information transmission, and stable and reliable directional communication can be realized only when two communication parties are within the communication beam coverage range of the other party.
Broadcast transmission is the most common type of transmission, and is divided into full-network broadcast and single-hop broadcast. The whole network broadcasting refers to that when a broadcasting node sends a message, the message needs to be transmitted to other nodes of all networks; according to different network topologies, the relay node may need to forward for multiple times, so that the whole network broadcasting may be realized. The single-hop broadcast means that when a broadcast node sends a message, the message needs to be transmitted to other nodes of all networks in a single-hop coverage range, and the single-hop broadcast can be completed without any relay of the nodes. A schematic diagram of a full-network broadcast and a single-hop broadcast is shown in fig. 7.
Single hop broadcasting is generally the basic mechanism for emergency alert message dissemination and is widely used in distributed wireless local area networks such as the internet of vehicles. The single-hop broadcasting is a basic method for distributing vehicle safety information, and a single-hop information broadcasting mechanism in a vehicle-mounted environment is a key for ensuring the safety of personnel in vehicle running. The periodic beacon message broadcast can help the vehicle nodes to mutually sense so that the vehicle nodes can cooperate with each other. In addition, the emergent emergency message and the safe single-hop broadcast can help the fault vehicle to effectively remind surrounding neighbor nodes, so that more serious secondary accidents are avoided. However, the single-hop broadcast of the internet of vehicles has a serious reliability problem, and it is difficult to ensure that the neighbor nodes can successfully receive the MAC frame broadcast by the broadcast node. Firstly, all neighbor nodes receiving a broadcast frame in a traditional broadcast mechanism cannot return an ACK (acknowledgement) frame, so that the broadcast node cannot retransmit lost frames for many times; secondly, as the RTS/CTS mechanism for alleviating the hidden terminal problem is not suitable for broadcasting, the broadcasting node cannot reserve a wireless channel, and the broadcasting frame is likely to be interfered by the hidden node; finally, because the frame can not be retransmitted for many times, the traditional minimum contention window can not be dynamically and exponentially and adaptively increased, so that the random value of the contention window is small, and the collision probability under the channel congestion environment is high.
The omnidirectional network adopts the omnidirectional antenna, the radiation is non-directional, the broadcast node only needs to be sent once, and the surrounding neighbor nodes can be completely received, because of the openness of the omnidirectional antenna, the broadcast of the node is easy to cause mutual conflict, and the difficulty of the single-hop broadcast of the omnidirectional network is how to improve the reliability of the broadcast. In a common method, a broadcast node performs statistical analysis on a data frame received in real time, selects a suitable node from neighboring nodes as a virtual destination node, and then performs unicast transmission with the virtual destination node by the broadcast node, while other neighboring nodes still regard the unicast frame as conventional broadcast frame reception. The mechanism enables broadcast transmission to utilize various repair and self-adaptive mechanisms such as RTS/CTS, ACK, retransmission, contention window adjustment and the like in unicast, and effectively improves the reliability of single-hop broadcast. Due to the radiation directivity of the directional antenna, each transmission of the broadcasting node can be received only by the neighbor nodes in the coverage area of the radiation direction of the antenna, and the neighbor nodes out of the coverage area can receive the transmission again only by adjusting the beam direction. Therefore, the single-hop broadcasting method of the omni-directional network is completely unsuitable for the directional network, and the single-hop broadcasting of the directional network becomes very complicated compared to the omni-directional network. The core of the single-hop broadcasting of the directional network lies in the control of beam pointing, and how to control the radiation direction of the directional antenna of the broadcasting node, so that the information of the broadcasting node can be timely, efficiently and reliably transmitted to all surrounding neighbor nodes, which is a difficult problem in the single-hop broadcasting of the directional network.
The existing main technical scheme is as follows: a neighbor node traversal mode and a multi-beam parallel transmission mode. The neighbor nodes transmit time-sharing transmission in a traversing mode aiming at each neighbor node, namely, all the neighbors in a one-hop range are arranged, and a single beam resource is sequentially called to send the same broadcast message to each neighbor node until all the neighbor nodes receive the broadcast message. The method is simple to implement, can be operated by a single beam, and has good network expansibility, and the defects that each neighbor needs to be sequentially transmitted once, the broadcasting efficiency is low, the broadcasting time delay is large, and the broadcasting can be finished by N x t seconds for N neighbor nodes on the assumption that the single transmission time is t seconds, which cannot be tolerated by the broadcast messages with high timeliness requirements. The traversing mode of the neighbor nodes has high requirement on network topology, is only suitable for directional networking scenes with sparse nodes and uniform distribution, and for the directional networking scenes with more nodes and nonuniform distribution, a plurality of network nodes are gathered in a certain direction.
The multi-beam parallel transmission mode adopts a plurality of directional beams, one directional beam is formed for each neighbor, all the beams are simultaneously directed to all the neighbor nodes, the broadcast node transmits the same broadcast message in parallel once through all the beams, and all the neighbor nodes receive the same broadcast message. The method is very fast to realize single-hop broadcasting, but the forwarding mechanism needs to consume very many antenna or beam resources, the cost of software and hardware is very high, and in the process of parallel transmission, the power resources of the broadcasting nodes are often required to be equally divided by a plurality of beams, the power allocated to a single beam is greatly reduced, mutual interference usually exists among the beams, and the receiving signal-to-noise ratio of the neighbor nodes is obviously reduced, so that the reliability of the single-hop broadcasting is greatly reduced. Because the resources of the antenna or the wave beam are very limited, the method is only suitable for a small network with few nodes, and for a dense directional network, when the number of the neighbor nodes is large, the wave beam resources required by the N directional wave beam resources cannot bear the requirement of the N neighbor nodes. In addition, because of the limitation of hardware, the beam resource of the node is limited, and the network expansibility in the mode is poor, and the network topology adaptability is not provided.
In summary, the existing technical solutions rely on either software and hardware resource stacking or a prolonged time to perform single-hop broadcasting of the directional network, which have respective limitations and cannot meet the requirement of fast and reliable broadcasting in a large dense directional network.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides the method for controlling the beam pointing by the quick single-hop broadcast, which has high broadcast efficiency and low broadcast delay, can provide more reliable single-hop broadcast communication performance and is suitable for a directional network.
The above object of the present invention can be achieved by the following measures, wherein the method for pointing a single-hop broadcast control beam has the following technical characteristics: in a directional network, a broadcast node obtains geographical position information of the broadcast node and each neighbor node through a GPS (global positioning system), single wave beams are adopted to send data in quick broadcast, all neighbor nodes are informed to set wave beam directions and try to receive, and all other nodes schedule wave beam resources to point to the broadcast node to receive the data; then, the broadcasting node calculates a beam pointing set required by broadcasting transmission by using all the geographical position information, calculates included angles between every two links, creates a logic graph G, finds out the maximum complete subgraph in the logic graph G to calculate the beam pointing direction, and determines the beam pointing direction P by using the maximum complete subgraphi(ii) a And in the process of single beam forming transmission, the broadcast messages are transmitted one by one according to the beam direction set until all the beam directions in the beam set are processed.
Compared with the prior art, the fast broadcast control method applicable to the directional network has the following beneficial effects.
The method has the lowest software and hardware resource requirements, and the single-hop broadcast is reliable. In a directional network, a broadcast node acquires own geographical position information through means of GPS (global positioning system) interaction with neighbors and the like, collects the geographical position information of all the neighbor nodes, adopts a single beam to transmit in quick broadcast, and only transmits data in a certain single beam direction at the same time; the single-hop broadcast mechanism which transmits data only in a certain single-beam direction at the same time and the single-hop broadcast beam control mechanism based on node clustering are adopted in the fast broadcast, and compared with the parallel transmission mode of multiple beams and multiple antennas, the single-hop broadcast mechanism has the lowest software and hardware resource requirements, obviously reduces the resources such as beams, antenna channels, power and the like, greatly increases the expandability of the network, is well suitable for the dense large-scale network, can improve the receiving signal-to-noise ratio by utilizing all the power resources of the broadcast nodes by adopting single-beam transmission, does not have the mutual interference of multi-beam concurrency, and greatly improves the reliability of single-hop broadcast;
the broadcasting efficiency is high, and the broadcasting time delay is low. The invention collects the geographical position information of all the neighbor nodes by the means of GPS and neighbor interaction, the broadcasting node informs all the neighbor nodes to set beam pointing to try to receive according to the geographical position information of the broadcasting node and the neighbor nodes obtained by the broadcasting node, calculates the beam pointing set required by broadcasting transmission, calculates the included angle between every two links taking the broadcasting node as the center, creates a logic graph G according to the link included angle, finds out the maximum complete subgraph in the logic graph G, calculates the beam pointing based on the node clustering method of the complete subgraph, and determines the beam pointing P of the time by using the maximum complete subgraphiThe method has higher broadcasting efficiency and lower broadcasting time delay; the broadcasting node covers as many neighbor nodes as possible in the process of single wave beam forming transmission, and the wave beam pointing P is excludediCovering all neighbor nodes, deleting links corresponding to the nodes at the vertexes corresponding to the logic graph G, updating the logic graph G, not sending the adjacent nodes in a single wave beam forming mode, but utilizing a node clustering method based on a complete subgraph to calculate the wave beam direction, and sending the wave beam direction in a single wave beam forming modeIn the method, as many neighbor nodes as possible are covered, and multiple transmissions of neighbor nodes gathered in a cluster are avoided, so that the broadcast transmission times are greatly reduced, the broadcast efficiency is improved, and the broadcast delay is effectively reduced. Generally, the broadcast sending times of the invention are only about 1/3 in the neighbor node traversal mode, namely, the broadcast efficiency is improved by about 3 times.
The topology adaptability is strong. The broadcasting node firstly obtains the geographical position information of the broadcasting node through a GPS and obtains the geographical position information of each neighbor node through neighbor interaction. Secondly, the broadcast node informs all the neighbor nodes to set beam pointing, makes their communication beams all point to the broadcast node and tries to receive. Then, the broadcast node calculates the beam pointing set required for broadcast transmission by using all the geographical location information. Deleting the link corresponding to the node at the vertex corresponding to the logic graph G, updating the logic graph G, repeating the operation until the logic graph G is empty, and outputting all the beam pointing sets { P } by the broadcasting node when the logic graph G is emptyiAnd finally, the broadcast nodes send the broadcast messages one by one according to the beam direction set and the beam direction set. And carrying out beam forming one by one, and switching to the next beam for forming and sending the broadcast message after the beam is sent completely until all the beam pointing in the beam set is processed completely. The broadcast transmission can adapt to any network topology, the network nodes can be distributed at will, whether the network is a sparse network or a dense network, and whether the network is a node uniformly distributed network or a non-uniformly distributed network, the beam pointing control method can be adopted, and the high-efficiency single-hop broadcast communication capability is provided comprehensively.
Drawings
FIG. 1 is a general flow diagram of single hop broadcast control beam pointing of the present invention;
FIG. 2 is a schematic diagram of coordinate definition of beam pointing calculations;
FIG. 3 is a flow chart of the beam pointing process for a broadcasting node to calculate the broadcasting transmission requirement according to the present invention;
FIG. 4 is a flow chart of a process for a broadcasting node to transmit broadcast messages one by one according to a beam pointing set according to the present invention;
FIG. 5 is a schematic diagram of a typical directional network configuration;
FIG. 6 is a schematic diagram of a communication beam formed by the node in FIG. 5 by using a directional antenna;
fig. 7 is a schematic diagram of the single-hop broadcast and the full-network broadcast of fig. 5.
Detailed Description
See fig. 1. According to the invention, the method for pointing the single-hop broadcast control beam has the following technical characteristics: in the directional network, a broadcast node obtains geographical position information of the broadcast node and each neighbor node through a GPS (global positioning system), single beam is adopted to send data in the quick broadcast, all neighbor nodes are informed to set beam directions and try to receive, and all other nodes schedule beam resources to point to the broadcast node to receive the data; then, the broadcasting node calculates a beam pointing set required by broadcasting transmission by using all the geographical position information, calculates included angles between every two links, creates a logic graph G, finds out the maximum complete subgraph in the logic graph G to calculate the beam pointing direction, and determines the beam pointing direction P by using the maximum complete subgraphi(ii) a And in the process of single beam forming transmission, the broadcast messages are transmitted one by one according to the beam direction set until all the beam directions in the beam set are processed.
The method comprises the steps that a broadcast node covers as many neighbor nodes as possible in a single wave beam forming sending process, all neighbor nodes covered by a wave beam direction P are excluded, links corresponding to the nodes are deleted at a vertex corresponding to a logic graph G, the logic graph G is updated, the operation is repeated until the logic graph G is empty, when the logic graph G is empty, all wave beam direction sets { P } are output, wave beam forming is carried out one by one according to the wave beam direction sets, broadcast messages are sent, after the wave beam sending is finished, the wave beam is switched to the next wave beam to carry out wave beam forming and send the broadcast messages until all wave beam directions in the wave beam sets are processed.
See fig. 2. A right-handed XYZ coordinate system with the broadcasting node position as a coordinate origin (0,0,0) and a horizontal plane where the origin is located as an xy plane, wherein coordinates representing each neighbor node in the XYZ coordinate system are expressed as (x)point,ypoint,zpoint) And representing the beam pointing vector, and establishing a three-dimensional rectangular coordinate system for calculating the beam pointing vector.
See fig. 3. The figure shows a beam pointing processing flow required by the broadcast node to calculate broadcast transmission; the method for calculating the beam direction required by the broadcast transmission by the broadcast node comprises the following steps:
step 201, the node calculates included angles between every two links which take the broadcast node as the home terminal and the neighbor node as the opposite terminal according to the geographical position of the broadcast node and the geographical positions of all the neighbor nodes, and then the node transfers to step 202 to create a logic graph G initialization loop control variable i as 1;
step 202, the broadcasting node creates a logic graph G according to the following method, initializes a loop control variable to 1, and then proceeds to step 203 to obtain a vertex set S of a maximum complete subgraph of the logic graph Gi；
The broadcast node models all one-hop neighbor nodes as vertexes in G, then traverses all links taking the broadcast node as a home terminal and the one-hop neighbor nodes as opposite terminals, if the included angle of a certain two links is smaller than the beam width gamma, connects two vertexes corresponding to the opposite terminals of the two links in the logic graph G to form an edge, and obtains the logic graph G after traversing is finished;
step 203, the broadcasting node obtains a vertex set S of the maximum complete subgraph of the logic graph G by using the maximum complete subgraph solving algorithm in the graph theoryiAnd extracting the vertex set as SiRecording initial vertex set S'i＝SiThen go to step 204 to determine the vertex set SiCorresponding beam pointing vector Pi；
Step 204, the broadcasting node determines the vertex set S according to the following methodiCorresponding beam pointing vector PiThen go to step 205 to delete vertex set SiIs not beam-steered by vector PiThe vertex covered; first, the broadcast node calculates a set SiThe distance d between the neighbor nodes corresponding to all the vertexes and the broadcast node is set as the maximum value dmaxThe structure takes the broadcast node as the center of sphere, dmaxSphere S of radiusphThen, for vertex set SiThe adjacent node j corresponding to each vertex in the system calculates the ray from the broadcast node to the adjacent node j and the sphere SphCoordinates (x) of the intersection of (A)j，yj，zj) Let us order
Figure BDA0002560208850000061
Figure BDA0002560208850000062
Finally, the vertex set S obtained by the broadcast nodeiCorresponding beam pointing vector Pi＝(xpoint,ypoint,zpoint) Wherein, in the step (A),
Figure BDA0002560208850000063
step 205, the broadcasting node checks the vertex set SiIf the connection line between the broadcast node and the adjacent node corresponding to the vertex and the beam point are pointed to PiThe included angle between the two is more than gamma/2, the vertex can not be pointed to the vector P by the beamiCovering, directly from the vertex set SiMiddle eliminating, then step 206 is carried out to judge the vertex set SiWhether it is empty;
in step 206, if the broadcasting node determines the vertex set SiIf the vertex is empty, the step 207 is executed to obtain the initial vertex set S 'before being culled'iRegenerating vertex set SiOtherwise, go to step 208 to delete vertex set S in logic diagram GiThe vertex and associated edge in (1);
step 207, the broadcast node acquires an initial vertex set S 'before being removed according to the following method'iAs new vertices, set Si: order set XL＝{(x,y,z)∈S'i|x≤xpointIs set XR＝{(x,y,z)∈S'i|x＞xpointIf set XLIs not less than the set XRNumber of elements of (1), then Si＝XLElse Si＝XRThen go back to step 204 againNewly determining vertex set SiCorresponding beam pointing vector Pi(ii) a Wherein XL and XR each represent 1 set, L and R have no special meaning and serve merely as subscripts to distinguish the two sets;
in step 208, the broadcasting node deletes the set S in the logic diagram GiThe vertex and all the associated edges in the graph form a new logic diagram G, and then step 209 is carried out to judge whether the vertex set of the logic diagram G is empty;
if the output is null, the process proceeds to step 209 where the process proceeds to step 211 where the set P of all beam directions is output as { P ═ P }1,…，Pi,., otherwise, go to step 210 to update the loop control variable i ═ i + 1.
In step 210, the broadcast node updates the loop control variable i ═ i +1, and then returns to step 203 to obtain the vertex set S of the maximum complete subgraph of the logic graph Gi；
Step 211, the broadcasting node outputs the set P ═ P of all beam directions1,…，Pi，...}。
See fig. 4. The figure shows the processing flow of the broadcast node sending broadcast messages one by one according to the beam pointing set.
Step 301, the broadcasting node removes a point P from the beam pointing set PiThen, go to step 302 to set the beam pointing direction of the directional antenna to Pi；
Step 302, the broadcasting node sets the beam direction of the directional antenna to be PiThen, the process proceeds to step 303 to send the broadcast message.
Step 303, the broadcasting node adopts the directional antenna at PiSending a broadcast message in the direction, and after the sending is finished, turning to step 304 to judge whether the beam pointing set P is empty;
in step 304, the broadcast node determines whether the beam pointing set P is empty, if so, the process ends directly, otherwise, the process returns to step 301 to remove one pointing from the beam pointing set P until the process ends.
The foregoing is directed to the preferred embodiment of the present invention and it is noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. It will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the spirit and substance of the invention, and these modifications and improvements are also considered to be within the scope of the invention.

Claims (10)

1. A single-hop broadcast control beam pointing method has the following technical characteristics: in a directional network, when a broadcast node needs to send a broadcast message, the broadcast node obtains geographical position information of the broadcast node and each neighbor node through a GPS (global positioning system), and in the quick broadcast, single beam is adopted to send data to inform all neighbor nodes of setting beam directions and trying to receive, and all other nodes schedule beam resources and direct the broadcast nodes to receive the data; the broadcasting node calculates a beam pointing set required by broadcasting transmission by using all the geographical position information, calculates included angles between every two links of all the nodes taking the broadcasting node as the center, creates a logic graph G according to the link included angles, finds out the maximum complete subgraph in the logic graph G to calculate the beam pointing, and determines the beam pointing P at this time by using the maximum complete subgraphi(ii) a And in the process of single beam forming transmission, the broadcast messages are transmitted one by one according to the beam direction set until all the beam directions in the beam set are processed.
2. The single-hop broadcast control beam pointing method of claim 1, wherein: the broadcasting node covers as many neighbor nodes as possible in the process of single wave beam forming transmission, and the wave beam pointing P is excludediAnd covering all the neighbor nodes, deleting the links corresponding to the nodes at the vertexes corresponding to the logic graph G, updating the logic graph G, and repeating the operation until the logic graph G is empty.
3. The single-hop broadcast control beam pointing method of claim 2, wherein: when the logic diagram G is empty, the broadcast node outputs all the beam direction sets { P }iAnd carries on wave beam shaping and sends broadcast message one by one according to the wave beam direction set, when the sending on the wave beam is finished,and switching to the next beam for forming and sending the broadcast message until all the beam directions in the beam set are processed.
4. The single-hop broadcast control beam pointing method of claim 1, wherein: a right-handed XYZ coordinate system which takes the position of the broadcast node as a coordinate origin (0,0,0) and takes a horizontal plane where the origin is positioned as an xy plane, and uses (x) in the XYZ coordinate systemn,yn,zn) Coordinates representing each neighbor node, by (x)point,ypoint,zpoint) And representing the beam pointing vector, and establishing a three-dimensional rectangular coordinate system for calculating the beam pointing vector.
5. The single-hop broadcast control beam pointing method of claim 1, wherein: the node calculates included angles between every two links which take the broadcast node as a home terminal and take one-hop neighbor nodes as opposite terminals according to the geographic position of the broadcast node and the geographic positions of all the neighbor nodes, and then the node transfers to the establishment of a logic graph G to initialize a cyclic control variable i as 1.
6. The single-hop broadcast control beam pointing method of claim 5, wherein: the broadcast node initializes a loop control variable i to 1 in creating the logic diagram G, and then obtains a vertex set S of the maximum complete subgraph of the logic diagram GiModeling all one-hop neighbor nodes as vertexes in a logic graph G, traversing all links with a broadcast node as a home terminal and one-hop neighbor nodes as opposite terminals, connecting two vertexes corresponding to opposite end nodes of the two links in the logic graph G to form an edge if an included angle between the two links is smaller than the beam width gamma, and obtaining the logic graph G after traversing is finished; obtaining a vertex set S of the maximum complete subgraph of the logic graph G by utilizing a maximum complete subgraph solving algorithm in graph theoryiAnd extracting the vertex set as SiRecording initial vertex set S'i＝SiThen determining a set of vertices SiCorresponding beam pointing vector PiDetermining a set SiCorresponding beam pointing vectorPiThereafter, the vertex set S is deletediIs not beam-steered by vector PiThe vertex of the overlay.
7. The single-hop broadcast control beam pointing method of claim 6, wherein: broadcast node computation vertex set SiThe distance d between the neighbor nodes corresponding to all the vertexes and the broadcast node is set as the maximum value dmaxThe structure takes the broadcast node as the center of sphere, dmaxSphere S of radiusphThen, for vertex set SiThe adjacent node j corresponding to each vertex in the system calculates the ray from the broadcast node to the adjacent node j and the sphere SphCoordinates (x) of the intersection of (A)j，yj，zj) Let us order
Figure FDA0002560208840000021
Obtaining a set of vertices SiCorresponding beam pointing vector Pi＝(xpoint,ypoint,zpoint) Wherein
Figure FDA0002560208840000022
8. The single-hop broadcast control beam pointing method of claim 7, wherein: broadcast node checks vertex set SiIf the connection line between the broadcast node and the adjacent node corresponding to the vertex and the beam pointing vector P are positioned at each vertex in the broadcast nodeiThe included angle between the two is more than gamma/2, the vertex can not be pointed to the vector P by the beamiCovering, directly from the vertex set SiRemoving, and judging vertex set SiIf the broadcast node is empty, the broadcast node determines the vertex set SiIf the vertex set is null, the initial vertex set S 'before being eliminated is obtained'iRegenerating vertex set SiOtherwise delete vertex set S in logical graph GiThe vertex and associated edge in (1).
9. As claimed in claimThe single-hop broadcast control beam pointing method is characterized in that: the broadcast node acquires an initial vertex set S 'before culling'iAs a new set of vertices Si: order set XL＝{(x,y,z)∈S'i|x≤xpointIs set XR＝{(x,y,z)∈S'i|x＞xpointIf set XLIs not less than the set XRNumber of elements of (1), then Si＝XLElse Si＝XRThen re-determining the vertex set SiCorresponding beam pointing vector Pi。
The single-hop broadcast control beam pointing method of claim 8, wherein: broadcast node deletes set S in logical graph GiForming a new logic diagram G by the vertices and all associated edges in the graph, then determining whether the vertex set of the logic diagram G is empty, and if so, outputting all beam pointing sets P ═ P1,…，Pi,., otherwise, updating the loop control variable i ═ i +1, and obtaining a vertex set S of the maximum complete subgraph of the logic graph GiOutputting all beam pointing set P ═ P1,…，Pi，...}。
10. The single-hop broadcast control beam pointing method of claim 1, wherein: the broadcasting node removes a point P from the beam pointing set P in one-by-one transmission of the broadcast messages according to the beam pointing setiSetting the beam directivity of the directional antenna to PiAnd beam pointing P of directional antennaiThen using a directional antenna at PiAnd sending the broadcast message in the direction, switching to judging whether the beam pointing set P is empty after the sending is finished, if so, directly finishing, and otherwise, removing one pointing from the beam pointing set P until finishing.
CN202010609021.9A 2020-06-29 2020-06-29 Single-hop broadcast control beam pointing method Active CN111885509B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010609021.9A CN111885509B (en) 2020-06-29 2020-06-29 Single-hop broadcast control beam pointing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010609021.9A CN111885509B (en) 2020-06-29 2020-06-29 Single-hop broadcast control beam pointing method

Publications (2)

Publication Number Publication Date
CN111885509A true CN111885509A (en) 2020-11-03
CN111885509B CN111885509B (en) 2021-10-15

Family

ID=73157727

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010609021.9A Active CN111885509B (en) 2020-06-29 2020-06-29 Single-hop broadcast control beam pointing method

Country Status (1)

Country Link
CN (1) CN111885509B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115103374A (en) * 2022-06-21 2022-09-23 北京邮电大学 Beam tracking method and device
CN116208922A (en) * 2023-01-19 2023-06-02 中国电子科技集团公司第十研究所 Wireless communication network broadcasting method, device, equipment and medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101064558A (en) * 2006-04-26 2007-10-31 大唐移动通信设备有限公司 Method for realizing broadcasting multicast in wireless communication system
CN101783694A (en) * 2009-01-21 2010-07-21 鼎桥通信技术有限公司 Method for optimizing broadcasting beam
CN103828255A (en) * 2011-09-19 2014-05-28 三星电子株式会社 Apparatus and method for operating multiple beamforming transceiver in wireless communication system
US20170251332A1 (en) * 2016-02-28 2017-08-31 Qualcomm Incorporated Unicast and broadcast protocol for wireless local area network ranging and direction finding
CN109348537A (en) * 2018-10-28 2019-02-15 西南电子技术研究所（中国电子科技集团公司第十研究所） Multi-beam self-organizing network channel access control method
CN109982403A (en) * 2018-11-06 2019-07-05 北京邮电大学 A kind of multi-node collaboration packet transmission plan based on multihop network

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101064558A (en) * 2006-04-26 2007-10-31 大唐移动通信设备有限公司 Method for realizing broadcasting multicast in wireless communication system
CN101783694A (en) * 2009-01-21 2010-07-21 鼎桥通信技术有限公司 Method for optimizing broadcasting beam
CN103828255A (en) * 2011-09-19 2014-05-28 三星电子株式会社 Apparatus and method for operating multiple beamforming transceiver in wireless communication system
US20170251332A1 (en) * 2016-02-28 2017-08-31 Qualcomm Incorporated Unicast and broadcast protocol for wireless local area network ranging and direction finding
CN109348537A (en) * 2018-10-28 2019-02-15 西南电子技术研究所（中国电子科技集团公司第十研究所） Multi-beam self-organizing network channel access control method
CN109982403A (en) * 2018-11-06 2019-07-05 北京邮电大学 A kind of multi-node collaboration packet transmission plan based on multihop network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
L. DE NARDIS,: "Combination of DOA and beamforming in position-based routing for underlay cognitive wireless networks", 《2012 7TH INTERNATIONAL ICST CONFERENCE ON COGNITIVE RADIO ORIENTED WIRELESS NETWORKS AND COMMUNICATIONS》 *
王昭: "适用于宽带网络波形的基于定价策略的时隙选择", 《电讯技术》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115103374A (en) * 2022-06-21 2022-09-23 北京邮电大学 Beam tracking method and device
CN115103374B (en) * 2022-06-21 2024-01-26 北京邮电大学 Beam tracking method and device
CN116208922A (en) * 2023-01-19 2023-06-02 中国电子科技集团公司第十研究所 Wireless communication network broadcasting method, device, equipment and medium
CN116208922B (en) * 2023-01-19 2024-04-02 中国电子科技集团公司第十研究所 Wireless communication network broadcasting method, device, equipment and medium

Also Published As

Publication number Publication date
CN111885509B (en) 2021-10-15

Similar Documents

Publication Publication Date Title
CN109348537B (en) Multi-beam self-organizing network channel access control method
Temel et al. LODMAC: Location oriented directional MAC protocol for FANETs
CN112737842B (en) Task safety unloading method based on minimized time delay in air-ground integrated Internet of vehicles
CN107979872B (en) Multi-frequency time division multiple access system and method based on directional antenna
CN111885509B (en) Single-hop broadcast control beam pointing method
CN105188149A (en) Method for implementing aeronautical Ad hoc network STDMA (Self Organizing Time Division Multiple Access) protocol based on directional antenna
Takata et al. A dual access mode MAC protocol for ad hoc networks using smart antennas
CN110267229B (en) Car networking safety communication method based on cooperative beam forming
CN105959995B (en) The TDMA neighbors scan method received surely is sent out in Ad Hoc network entirely
Dang et al. Multi-channel MAC protocol with Directional Antennas in wireless ad hoc networks
Laarhuis MaritimeManet: Mobile ad-hoc networking at sea
CN109639473B (en) Full-to-full communication method for double-sided array radar ad hoc network
CN107484128B (en) Communication method and device based on RTS/CTS protocol, computer equipment and storage medium
CN114025342B (en) Wireless network neighbor discovery method and device
Li et al. Multipath routing in ad hoc networks using directional antennas
Regis et al. Unmanned aerial vehicles positioning scheme for first-responders in a dynamic area of interest
Nagashima et al. Evaluations of a directional MAC protocol for ad hoc networks
Pyun et al. Group-based channel access scheme for a V2I communication system using smart antenna
Cordeiro et al. A directional antenna medium access control protocol for wireless ad hoc networks
Lai et al. MARS: a multiple access scheme with sender driven and reception first for smart antenna in ad hoc networks
Subramaniam et al. An analyzing of cross layer design for implementing adaptive antenna technique in mobile ad-hoc networks
Alam et al. Efficient Mac Protocol For Wireless Sensor Nodes To Lessen Hidden And Deaf Node Problem
Kim MC-GiV2V: Multichannel Allocation in mmWave-Based Vehicular Ad Hoc Networks
Landmark et al. Improving simplified multicast forwarding using an elevated relay node
Saha et al. RBP: Reliable Broadcasting Protocol in Large Scale Mobile Ad Hoc Networks

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