WO2017066912A1 - Procédé de communication, serveur, unité de bord de route et noeud - Google Patents

Procédé de communication, serveur, unité de bord de route et noeud Download PDF

Info

Publication number
WO2017066912A1
WO2017066912A1 PCT/CN2015/092213 CN2015092213W WO2017066912A1 WO 2017066912 A1 WO2017066912 A1 WO 2017066912A1 CN 2015092213 W CN2015092213 W CN 2015092213W WO 2017066912 A1 WO2017066912 A1 WO 2017066912A1
Authority
WO
WIPO (PCT)
Prior art keywords
rsu
segment
segmentation
channels
network
Prior art date
Application number
PCT/CN2015/092213
Other languages
English (en)
Inventor
Yi Shi
Chong Han
Mehrdad DIANATI
Xin Xiong
Original Assignee
Huawei Technologies Co., Ltd.
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 Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to CN201580067155.XA priority Critical patent/CN107005880B/zh
Priority to PCT/CN2015/092213 priority patent/WO2017066912A1/fr
Publication of WO2017066912A1 publication Critical patent/WO2017066912A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]

Definitions

  • the present invention generally relates to the field of communications technologies, and more particularly to a method for communication, a server, a roadside unit and a node.
  • VANETs Vehicular Ad hoc Networks
  • DSRC Dedicated Short Range Communication
  • V2V vehicle-to-vehicle
  • V2I vehicle-to-infrastructure
  • Large-scale and dense vehicular networks in terms of large geographical size of the network and the large number of nodes are expected to be formed in both highway and urban VANETs, due to high number of cars and complex road architecture.
  • the Medium Access Control (MAC) sub-layer of a widely used DSRC system relies on random access channel sharing techniques such as Carrier Sensing Medium Access/Collision Avoidance (CSMA/CA) , extended with Enhanced Distributed Channel Access (EDCA) service differentiation and multi-channel functions.
  • CSMA/CA Carrier Sensing Medium Access/Collision Avoidance
  • EDCA Enhanced Distributed Channel Access
  • WAVE Wireless Access in Vehicular Environment
  • ETSI European Telecommunications Standards Institute
  • ITS Intelligent Transport Systems
  • IEEE Institute of Electrical and Electronics Engineers 802.11p MAC sub-layer with IEEE 1609.4 multi-channel function.
  • CCH service channels
  • CCH control channel
  • An embodiment of the present invention provides a method for communication, a server, a roadside unit and a node which can improve the utilization of radio resource.
  • the present application provides a method for communication.
  • An RRM server receives network state information sent by at least one RSU.
  • the network state information sent from each of the at least one RSU indicates density of nodes in the coverage of the RSU.
  • the RRM server performs segmentation of an area in a communication network according to the network state information to form at least one segment for the at least one RSU respectively.
  • the RRM server allocates channels for the at least one segment.
  • the RRM server sends network segmentation information and channel allocation information to each of the at least one RSU.
  • the network segmentation information indicates a segment for the RSU and the channel allocation information indicates channels allocated for the segment so that RSU communicates with a node which enter the segment through the channels allocated for the segment.
  • the RRM server performs network segmentation and channel allocation for segments according to the network state information reported by the RSU, and notifies the RSU of the network segmentation information and channel allocation information, so that the RSU can communicate with a node which enters the segment through the channels allocated for the segment, reducing collision probabilities and QoS degradation and thus improve the utilization of radio resource.
  • the density of nodes includes numbers of nodes within different distances away from the RSU.
  • the RRM server before performing segmentation of the area in the communication network, the RRM server further determines that the area is congested according to the numbers of nodes within different distances away from the RSU.
  • the segmentation and channel allocation may be performed based on whether the area is congested, so as to reduce collision probabilities and achieving dynamic channel allocation according to different network conditions.
  • the method further includes: the RRM server determines that the area becomes uncongested, and sends segmentation revocation information to each of the at least one RSU.
  • the segmentation revocation information indicates revoking the segmentation and channel allocation so that the RSU communicates with a node which enters coverage of the RSU through legacy channels. Since the segmentation may be revoked when the area became uncongested, the solution of the present application may be compatible with the conventional channel allocation solution.
  • the RRM server divides the area into multiple squares each of which has an RSU in its centre, and the length of sides L S of a square for RSU (a) is given by:
  • (x a , y a ) is the longitude and latitude of RSU (a)
  • N i is the number of nodes within different ranges of the RSU (a)
  • N desired (a) is a desired node density of the squire for RSU (a) . Due to the above L and D max , neighbouring segments may use non-overlapping channels to avoid interference from nodes in the neighbouring segments.
  • the present application provides a method for transmitting data.
  • An RSU sends network state information to a Radio Resource Management RRM server.
  • the network state information indicates density of nodes in coverage of the RSU.
  • the RSU receives network segmentation information and channel allocation information sent by a server.
  • the network segmentation information indicates a segment for the RSU, the channel allocation information indicates channels allocated for the segment, and the segment is one of at least one segment formed by the RRM server performing a segmentation of an area in a communication network for at least one RSU respectively.
  • the RSU sends network segmentation information and the channel allocation information to nodes which are in coverage of the RSU.
  • the RSU communicates with nodes which are in the segment through the channels allocated for the segment.
  • the RRM server performs network segmentation and channel allocation for segments according to the network state information reported by the RSU, and notifies the RSU of the network segmentation information and channel allocation information, so that the RSU can communicate with a node which enters the segment through the channels allocated for the segment, reducing collision probabilities and QoS degradation and thus improve the utilization of radio resource.
  • the method further includes: the RSU obtains network state information according to report by the nodes in the coverage of the RSU.
  • the density of nodes includes numbers of nodes within different distances away from the RSU
  • the method further includes: the RSU determines that the coverage of the RSU is congested according to the numbers of nodes within different distances away from the RSU.
  • the method further includes: the RSU receives segmentation revocation information from the RRM serve, and communicate with a node which enters coverage of the RSU by switching to the legacy channels.
  • the segmentation revocation information indicates revoking the segmentation and channel allocation.
  • the RSU periodically reports the network state information to NCC, or reports the network state information to NCC when at least one of pre-defined conditions is met.
  • the present application provides a method for transmitting data.
  • a node receives network segmentation information and the channel allocation information from a Roadside Unit RSU, determines that the node is in the segment according to the network segmentation information, and communicates with the RSU through the channels allocated for the segment.
  • the network segmentation information indicates a segment for the RSU
  • the channel allocation information indicates channels allocated for the segment
  • the segment is one of at least one segment formed by the RRM server performing a segmentation of an area in a communication network for at least one RSU respectively.
  • the method further includes: the node receives segmentation revocation information from the RSU, and communicates with the RSU through legacy channels.
  • the segmentation revocation information indicates revoking the segmentation and channel allocation.
  • the present application provides a server.
  • the server includes units for performing the method of the first aspect.
  • the present application provides an RSU.
  • the RSU includes units for performing the method of the second aspect.
  • the present application provides a node.
  • the Node includes units for performing the method of the third aspect.
  • the node is a vehicle which includes an OBU.
  • the allocating channels for the at least one segment includes: allocating channels for the at least one segment from one PCCH, two LCCHs and four LSCHs, wherein the PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • the PCCH may is shared between neighbouring segments so as to be compatible with the conventional solution.
  • nodes are allowed to use one LCCH and two LSCHs.
  • Adjacent segments may use non-overlapping channels to avoid interference from nodes in the neighbouring segments. Since each segment is allocated with an LCCH for transmitting control message, collision probabilities and QoS degradation are reduced and thus the utilization of radio resource is improved.
  • the LCCHs may be used for data transmission if both LCCH for the segment are occupied so as to support more nodes in the segment.
  • FIG. 1 depicts an architecture diagram of a communication system in accordance with an embodiment of the present invention
  • FIG. 2 depicts a schematic diagram of functional entities of the communication system 100 in accordance with an embodiment of the present invention
  • FIG. 3 depicts a schematic flowchart of a method for communication in accordance with an embodiment of the present invention
  • FIG. 4 depicts a schematic flowchart of a method for communication in accordance with another embodiment of the present invention.
  • FIG. 5 depicts a schematic flowchart of a method for communication in accordance with another embodiment of the present invention.
  • FIG. 6 depicts a schematic flowchart of a process for communication in accordance with another embodiment of the present invention.
  • FIG. 7 depicts a format of a packet sent from the RSU to the RRM server in accordance with an embodiment of the present invention.
  • FIG. 8 depicts a format of a packet sent from the RRM server to the RSU in accordance with an embodiment of the present invention.
  • FIG. 9 depicts a format of a packet sent from the RSU to nodes in accordance with an embodiment of the present invention.
  • FIG. 10 depicts a table indicating a example of number of the nodes different distances away from the RSU in accordance with an embodiment of the present invention.
  • FIG. 11 depicts a schematic flowchart of a process for communication in accordance with another embodiment of the present invention.
  • FIG. 12 depicts a format of another packet sent from the RRM server to the RSU in accordance with an embodiment of the present invention.
  • FIG. 13 depicts a schemtaic diagram of segmentation of a network in accordance with an embodiment of the present invention.
  • FIG. 14 is a schemtaic network model in accordance with an embodiment of the present invention.
  • FIG. 15 is a simplified block diagram of a server according to an embodiment of the present invention.
  • FIG. 16 is a simplified block diagram of an RSU according to an embodiment of the present invention.
  • FIG. 17 is a simplified block diagram of a node according to another embodiment of the present invention.
  • FIG. 18 is a simplified block diagram of the computing device.
  • DNSM-MAC Dynamic Network Segmentation based Multichannel MAC Protocol
  • FIG. 1 depicts an architecture diagram of a communication system 100 in accordance with an embodiment of the present invention.
  • the communication system 100 may be a VANET, including a network control centre (NCC) 110, a plurality of Roadside Units (RSUs) 120 and a plurality of nodes (e.g., vehicles) 130. It is to be understood that the naming of these network nodes in the communication system 100 is for the identification purpose only, and it should not be interpreted as a limitation.
  • NCC network control centre
  • RSUs Roadside Units
  • nodes e.g., vehicles
  • the NCC 110 includes an RRM server 111 which plays a key role in the implementation of embodiment of the present invention and further implements other functions; however, for the purpose of convenience of description, only the RRM server 111 will be described in detail.
  • the RRM server 111 is used for performing segmentation of an area in the network and performing channel allocation for segments.
  • the RSUs 120 are connected to the NCC 110 via wired or wireless links, for example, Long Term Evolution (LTE) or Internet 140.
  • LTE Long Term Evolution
  • the RSUs 120 are usually located on the roadside with approximate distance between them. The distance between two RSUs 120 may be equal to the effective communication range of the underlying DSRC technology (e.g., 500 m for IEEE 802.11p) .
  • the RSUs 120 are used for collecting network state information from nodes 130 in their coverage, and forwarding packets between the nodes 130 and the NCC 110.
  • FIG. 2 depicts a schematic diagram of functional entities of the communication system 100 in accordance with an embodiment of the present invention.
  • functional blocks of these entities as shown in FIG. 2 include a NCC 110, a RSU 120, and an OBU 131 in nodes 130.
  • An RRM server 111 resides in the NCC 110, which hosts the functionality of channel allocation. The network segmentation functionality is distributed among the RSUs 120 and the RRM server 111.
  • Each node 130 is equipped with a DSRC network interface to communicate with each other and the RSUs.
  • the DSRC interface may include a DNSM-MAC layer, a 802.11p PHY layer and other layers.
  • the RRM server and the RSU may communicate with each other via an Internet interface.
  • Embodiments of the present invention provide an effective and dynamic technique for allocation of channels in a multichannel VANET, in which the available channels are dynamically allocated to different segments of the network that are dynamically defined in the vicinity of the RSUs depending on the network load (or density of nodes) on assistance of RSU and an RRM server.
  • FIG. 3 depicts a schematic flowchart of a method for communication in accordance with an embodiment of the present invention. The method of FIG. 3 is implemented by the RRM in FIG. 1.
  • An RRM server receives network state information sent by at least one RSU, wherein the network state information sent from each of the at least one RSU indicates density of nodes in the coverage of the RSU.
  • An RRM server performs segmentation of an area in a communication network according to the network state information to form at least one segment for at least one RSU respectively.
  • the area may refer to a section of a highway or an urban area.
  • each RSU may only correspond to one segment, and each RSU may be located in the centre of the segment. Segments for different RSUs may have different sizes or same size.
  • the RRM server allocates channels for the at least one segment.
  • the RRM server may allocate a plurality of channels for each segment, for example, the channels allocated for each segment may include a public CCH, a local CCH and two local SCHs.
  • the public CCH may be shared by the neighbouring segments, and the neighbouring segments may have different local CCHs and local SCHs.
  • the RRM server sends network segmentation information and channel allocation information to each of the at least one RSU, wherein the network segmentation information indicates a segment for the RSU and the channel allocation information indicates channels allocated for the segment so that RSU communicates with a node which enters the segment through the channels allocated for the segment.
  • the RRM server performs network segmentation and channel allocation channel for segments according to the network state information reported by the RSU, and notifies the RSU of the network segmentation information and channel allocation information, so that the RSU can communicate with a node which enters the segment through the channels allocated for the segment, reducing collision probabilities and QoS degradation and thus improve the utilization of radio resource.
  • the node when a node which is equipped with an On-board Unit (OBU) is in a communication range or coverage range of an RSU, the node shall communicate with the RSU.
  • the RSU may determine network state information according to information reported by nodes in the coverage of the RSU, and sends the network state information to the RRM server. For example, in a normal state, during a CCH interval, the RSU and the nodes monitor a CCH for exchanging a safety message and other control packets, and during a SCH interval, the RSU and the nodes transmit potential non-safety application data on a SCH.
  • OBU On-board Unit
  • the RRM server may perform network segmentation according to network state information to provide a plurality of segments which centre at the RSU, respectively, and allocates channels for each segment.
  • the RRM server sends network segmentation information which indicates a segment for the RSU and channel allocation information which indicates channels allocated for the segment to the RSU, and the RSU broadcasts the network segmentation information and channel allocation information to the nodes.
  • the nodes then communicate with the RSU through the channels allocated for the segment.
  • the density of nodes comprises numbers of nodes within different distances away from the RSU, and before 320, the method further comprises: the RRM server determines that the area is congested according to the numbers of nodes within different distances away from the RSU.
  • the coverage range of the RSU is considered as a congested area.
  • multiple thresholds may be set for determining a congested area. The purpose of introducing multiple thresholds is to allow some super popular areas to have more nodes than other areas. For instance, the node density in the town centre is much higher than that of the sub-rural areas. Different thresholds are set for coverage ranges so as to avoid some super popular area being split into super small segments, which may not be able to be supported by enough RSUs and leads to too many issues such as channel allocation, interference among adjacent segments and lack of knowledge of CAMs from neighboring vehicles.
  • the segmentation and channel allocation may be performed based on whether the area is congested, so as to reduce collision probabilities and achieving dynamic channel allocation according to different network conditions.
  • the method of FIG. 3 further comprising: the RRM server determines that the area becomes uncongested, and sends segmentation revocation information to each of the at least one RSU, wherein the segmentation revocation information indicates revoking the segmentation and channel allocation so that the RSU communicates with the node which enters coverage of the RSU through legacy channels. Since the segmentation may be revoked when the area became uncongested, the solution of the present application may be compatible with the conventional channel allocation solution.
  • the coverage range of the RSU is considered as an uncongested area.
  • the segmentation is unnecessary and thus the segmentation is revoked.
  • the RSU and the vehicles are switched to the legacy channels for listening control messages and data, which provides a flexible channel allocation scheme.
  • the RRM server divides the area into multiple squares each of which has an RSU in its centre, and the length of sides L of a square for RSU (a) is given by:
  • N i is the number of nodes within different ranges of the RSU (a)
  • N desired (a) is a desired node density of the square for RSU (a) .
  • N, a, b, c and i are positive integers.
  • neighbouring segments may use non-overlapping channels to avoid interference from nodes in the neighbouring segments.
  • the RRM server allocates channels for the at least one segment from one Public Control Channel PCCH, two Local Control Channels LCCHs and four Local Service Channels LSCHs, wherein the PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • seven channels are allocated for RSUs in the communication network.
  • two neighbouring RSUs must share one CCH, which may not be able to provide sufficient bandwidth in these scenarios, leading to potential high collision rate and QoS degradation.
  • two LCCHs may be allocated for two neighbouring RSUs, respectively, thus further reducing collision probabilities and QoS degradation and achieving dynamic channel allocation.
  • FIG. 4 depicts a schematic flowchart of a method for communication in accordance with another embodiment of the present invention. The method of FIG. 3 is implemented by the RSUs in FIG. 1.
  • a Roadside Unit sends network state information to a Radio Resource Management RRM server, wherein the network state information indicates density of nodes in coverage of the RSU.
  • the RSU receives network segmentation information and channel allocation information sent by an RRM server, wherein the network segmentation information indicates a segment for the RSU, the channel allocation information indicates channels allocated for the segment, and the segment is one of at least one segment formed by the RRM server performing a segmentation of an area in a communication network for at least one RSU respectively.
  • the RSU sends network segmentation information and the channel allocation information to nodes which are in coverage of the RSU.
  • the RSU may broadcast the segmentation information and the channel allocation information to the nodes.
  • the RSU communicates with nodes which are in the segment through the channels allocated for the segment.
  • the RRM server performs network segmentation and channel allocation channel for segments according to the network state information reported by the RSU, and notifies the RSU of the network segmentation information and channel allocation information, so that the RSU can communicate with a node which enters the segment through the channels allocated for the segment, thus reducing collision probabilities and QoS degradation and thus improve the utilization of radio resource.
  • the method of FIG. 4 further comprises: the RSU obtains network state information.
  • the density of nodes comprises numbers of nodes within different distances away from the RSU
  • the method of FIG. 4 further comprises: determining, by the RSU, that the coverage of the RSU is congested according to the numbers of nodes within different distances away from the RSU.
  • the method of FIG. 4 further comprises: the RSU receives segmentation revocation information from the RRM server, and communicates with the node which enters coverage of the RSU by switching to the legacy channels, wherein the segmentation revocation information indicates revoking the segmentation and channel allocation.
  • the RSU periodically reports the network state information to NCC.
  • the RSU reports the network state information to NCC when at least one of pre-defined conditions is met.
  • one Public Control Channel PCCH, two Local Control Channels LCCHs and four Local Service Channels LSCHs are allocated for the at least one segment, one PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • FIG. 5 depicts a schematic flowchart of a method for communication in accordance with another embodiment of the present invention. The method of FIG. 3 is implemented by the nodes in FIG. 1.
  • a node receives network segmentation information and the channel allocation information from a Roadside Unit RSU, wherein the network segmentation information indicates a segment for the RSU, the channel allocation information indicates channels allocated for the segment, and the segment is one of at least one segment formed by the RRM server performing a segmentation of an area in a communication network for at least one RSU respectively.
  • the node determines that the node is in the segment according to the network segmentation information.
  • the node communicates with the RSU through the channels allocated for the segment.
  • the RRM server performs network segmentation and channel allocation channel for segments according to the network state information reported by the RSU, and notifies the RSU of the network segmentation information and channel allocation information, so that the RSU can communicate with node which enters the segment through the channels allocated for the segment, thus reducing collision probabilities and QoS degradation and thus improve the utilization of radio resource.
  • the method of FIG. 5 further comprises: , by the node receives segmentation revocation information from the RSU, and communicates with the RSU through legacy channels, wherein the segmentation revocation information indicates revoking the segmentation and channel allocation.
  • one Public Control Channel PCCH, two Local Control Channels LCCHs and four Local Service Channels LSCHs are allocated for the at least one segment, one PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • the node is a vehicle which includes an On-board Unit OBU.
  • FIG. 6 depicts a schematic flowchart of a process for communication in accordance with another embodiment of the present invention.
  • An RSU collects node ID and position information from nodes in the coverage range of the RSU through a packet.
  • a new node e.g., a vehicle
  • a coverage range or communication range
  • the RSU every time it sends a packet (e.g., ACK, RTS, CTS, DATA)
  • the RSU obtains a node ID of the node, and makes an entry for the node in a table.
  • the node broadcasts a Cooperative Awareness Message (CAM) or a Decentralized Environmental Notification Message (DENM) or sends a packet through multicast/unicast
  • CAM Cooperative Awareness Message
  • DENM Decentralized Environmental Notification Message
  • the RSU collects position information and movement information, and updates the entry in the table for the node.
  • LDM Local Dynamic Map
  • the RSU determines the network state information according to collected position information of the nodes.
  • the RSU may determine the number of the nodes within the communication range and different distances away from the RSU according to the position information of the nodes.
  • FIG. 10 is a table indicating number of the nodes different distances away from the RSU in accordance with an embodiment of the present invention.
  • the number of neighbouring nodes of the RSU is 50
  • the number of neighbouring nodes of the RSU is 80
  • the number of neighbouring nodes of the RSU is 80
  • the number of neighbouring vehicles of the RSU is 200, and so on.
  • the RSU sends a report to an RRM Server in an NCC.
  • the RSU may send a report to the RRM sever in the NCC in order to help find the suitable coverage of network segments.
  • the report contains the network state information.
  • FIG. 7 depicts a format of a packet sent from the RSU to the RRM server in accordance with an embodiment of the present invention.
  • Sender ID field 710 indicates an ID of an RSU, and the length of the field 710 may be 32 bits.
  • the Destination ID field 720 indicates an ID of an RRM, and the length of the field 720 may be 32 bits. Since the embodiments of the present invention are implemented in an MAC sub-layer, an MAC address can be used as the ID of a network node.
  • the Packet Type field 730 indicates the type of the packet, for example, the Packet type indicates that the packet is a RSU report packet, and the length of the field 730 may be 4 bits.
  • the Length field 740 indicates the size of the packet, and the length of the field 740 may be 16 bits.
  • Range No. field 750 indicates Range index 1 of the RSU, and the length of the field 750 may be 8bits.
  • the No. of Veh. field 760 indicates the total number of active vehicles within distance D1 corresponding to Range index 1, and the length of the field 760 may be 16bits.
  • Range No. field 770 indicates Range index n of the RSU, and the length of the field 770 may be 8bits.
  • the No. of Veh. field 770 indicates the total number of active vehicles within distance Dn corresponding to Range index 1, and the length of the field 780 may be 16bits.
  • Range index field 2 to n-1 and corresponding No. of Veh. field D 2 to D n-1 are omitted in FIG. 7 for the sake of simplicity, where n indicates the number of coverage ranges of the RSU, and n is a positive integer.
  • RSU could send reports to the NCC either periodically or only when some trigger conditions (for sending a networks state information update) are met.
  • Some trigger conditions for sending a networks state information update
  • One example in the latter case is to define a set of predefined thresholds for a network congestion level can be configured for the individual RSUs. An RSU can only alert the RRM server if the numbers of vehicles in the corresponding range of the RSU is greater than the predefined threshold.
  • each RSU in communication network may collect position information and movement information from vehicles in the coverage range of the RSU, and send a report carrying network state information to the RRM Server.
  • the RRM server detects congested areas of the network.
  • the RRM server may identify whether there is congestion in an area according to the number of active nodes (node density) in the communication range of RSUs in this area. Congestion is identified if node density in a certain area is greater than a threshold N desired (which can be adjusted or preset) .
  • congestion can be identified for different ranges of each RSU.
  • the thresholds for different communication ranges can be pre-defined in the RRM server.
  • the RRM server performs network segmentation if the RRM sever determines there is a congested area in the communication network.
  • the RRM can divide the congested area into a plurality of segments, for example, a plurality of squares each of which centres one RSU.
  • the segment may have other shapes, for example, circle, hexagon or the like.
  • the network segmentation of a congested is described as follows by taking a square segment as an example.
  • the RRM server first calculates the length of sides L s of a square (segment) which centres at the RSU.
  • the length of sides of the square can also be adaptive to at least one of the existence of nearby RSUs, the latency limits of ITS use cases, and the node density.
  • the network segmentation is described as follows by taking the existence of nearby RSUs and the node density network as an example.
  • the RRM server divides the area into multiple squares that each square has an RSU in its centre.
  • the length of sides L is given by:
  • the RRM server calculates the length of side taking the reported node density around each RSU into account.
  • the RRM server derives the maximum distance D max when the node density within a certain area satisfied the desired node density by:
  • N i is the number of nodes within the certain area (0 ⁇ D i m away from the RSU (a) ) , and i may be integer, and N desired (a) is a desired node density of the squire for RSU (a) .
  • RRM server chooses the minimum value between D max and L as the decision of length of side L S for each segment.
  • the RRM server performs channel allocation for the network segments.
  • the RRM server may allocate channel for network segments.
  • a Public Control Channel PCCH
  • PCCH Public Control Channel
  • One of the seven channels is designated as a Public Control Channel (PCCH) , which is shared between neighboring segments.
  • LCCHs Local Control Channels
  • LSCHs Local Service Channels
  • vehicles initially work with the multichannel MAC.
  • the Public Control Channel (PCCH) is occupied for broadcasting segmentation information by RSUs in a segmented network in case new vehicles (which enter the network after the segmentation) miss the information.
  • nodes are allowed to use one LCCH and two LSCHs.
  • Neighbouring segments may use non-overlapping channels to avoid interference from nodes in the neighbouring segments. For instance, in the example scenario shown in FIG. 13, it is assumed that an area in road 1310 may be divided into segments 1311, 1312 and 1313, and another area in road 1320 may be divided into segments 1321, 1322, 1323. In addition, LCCH 1, LSCH1 and LSCH 2 may be allocated for segment 1321; and LCCH 2, LSCH 3, and LSCH 4 are allocated for segment 1322. Then, nodes in segment 1323 may reuse the same channels as segment 1321 without any interference with the nodes in segment 1323, since the nodes in segment 1323 are far away enough.
  • An LCCH is used as a local CCH for a segment, on which emergency messages, channel negotiations and segmentation cancelation transmit; while an LSCH is used as a local SCH for data transmissions for the segment. Since only two service channels may be used for data transmission in each segment, it is possible that there is no channel available for multiple pairs of nodes. Thus, LCCHs may be allowed to be used for data transmission after a successful channel negotiation if both service channels for the segment are occupied at the moment.
  • the channel access mechanism inside each segment is similar to an Asynchronous MultiChannel MAC (AMCMAC) scheme.
  • AMCMAC Asynchronous MultiChannel MAC
  • the RRM server sends network segmentation information and channel allocation information to the RSUs.
  • the RRM server After the network segmentation and channel allocation, the RRM server sends a packet carrying the network segmentation information and the channel allocation information to each RSU.
  • the network segmentation information includes the length of sides of the segment for the RSU, and the channel allocation information includes a list of channels allocated for the segment.
  • FIG. 8 depicts format of a packet sent from the RRM server to the RSU in accordance with an embodiment of the present invention.
  • Sender ID field 810 indicates an ID of the RRM server, and the length of the field 810 may be 32 bits.
  • the Destination ID field 820 indicates an ID of an RSU, and the length of the field 820 may be 32 bits. Since the embodiments of the present invention are implemented in an MAC sub-layer, an MAC address can be used as the ID of a network node.
  • the Packet Type field 830 indicates the type of the packet, and the length of the field 830 may be 4 bits.
  • the LS field 840 indicates the length of sides of the segment for the RSU, and the length of the field 840 may be 12 bits.
  • Channels field 850 indicates a list of channels allocated for the segment, and the length of the field 850 may be (8bits) *total number of channels allocated for the segment.
  • RSUs notifies nodes of the network segmentation information and the channel allocation information.
  • the RSU Having received the network segmentation information and the channel allocation information from the NCC, the RSU will then broadcast the network segmentation information and the channel allocation information to the vehicles within its coverage through the PCCH.
  • the network segmentation information and the channel allocation information may be carried in a packet.
  • FIG. 9 depicts a format of a packet sent from the RSU to nodes in accordance with an embodiment of the present invention.
  • Sender ID field 910 indicates an ID of the RSU, and the length of the field 910 may be 32 bits.
  • the Destination ID field 920 contains an ID of a vehicle, and the length of the field 920 may be 32 bits.
  • the Packet Type field 930 indicates the type of the packet, and the length of the field 930 may be 4 bits.
  • the Centre of seg. field 940 indicates longitude and latitude of the centre of the segment, and the length of the field 940 may be 64 bits (32bits for longitude, 32bits for latitude) .
  • the LS field 950 indicates the length of sides of the segment for the RSU, and the length of the field 950 may be 12 bits.
  • Channels field 960 indicates a list of channels allocated for the segment, and the length of the field 960 may be (8bits) *total number of channels allocated for the segment.
  • the nodes after receiving the network segmentation information and the channel allocation information from the RSU, the nodes switch to LCCHs to listen for control messages.
  • vehicles listen for control messages on a legacy CCH and listen for service data in a legacy SCH.
  • the vehicles shall receive the network segmentation information and the corresponding channel allocation information broadcasted by the RSU on the PCCH. Having received the segmentation information and the corresponding channel allocation information, vehicles shall switch to the corresponding dedicated LCCHs immediately to listen for control messages. Further, when vehicles receive updated network segmentation information and channel allocation information again, the vehicles shall update their own Segment ID (SID) according to the updated network segmentation information and channel allocation information, and switch to the corresponding dedicated LCCHs immediately to listen for control messages.
  • SID Segment ID
  • FIG. 11 depicts a schematic flowchart of a process for communication in accordance with another embodiment of the present invention.
  • the RRM server has performed network segmentation and channel allocation for a congested area, and if the congested area becomes uncongested, the network segmentation and channel allocation shall be revoked.
  • the RRM server determines that the congested area becomes uncongested.
  • the RRM server may identify whether the congested area become uncongested according to the number of active nodes (node density) in the communication range of RSUs in this area. For example, it is identified that congested area becomes uncongested if node density in a certain area is less than a threshold N desired (which can be adjusted or preset) .
  • a threshold N desired which can be adjusted or preset
  • the thresholds for different communication ranges can be pre-defined in the RRM server.
  • the RRM server sends a segmentation revocation packet to the RSUs.
  • the RRM server in NCC decides that the network becomes uncongested and the previous segmentation is thus unnecessary. Consequently, NCC will send the segmentation revocation packet to the RSUs to revoke previous segmentations and channel allocations.
  • FIG. 12 depicts a format of a packet sent from the RRM server to the RSU.
  • Sender ID field 1210 contains an ID of the RRM server, and the length of the field 1210 may be 32 bits.
  • the Destination ID field 1220 contains an ID of an RSU, and the length of the field 1220 may be 32 bits.
  • the Packet Type field 1230 contains the type of the packet, for indicating that the packet is a network segmentation revocation message, and the length of the field 1230 may be 4 bits.
  • the Revocation flag field 1240 contains the length of sides of the segment for the RSU for indicating that the segmentation is revoked, and the length of the field 1240 may be 4 bits.
  • RSUs sends the segmentation revocation packet to nodes in its coverage.
  • the RSU Upon receiving the segmentation revocation packet from the NCC, the RSU will then broadcast the same packet to the vehicles within its coverage.
  • the nodes switch back to a legacy CCH to listen for control messages.
  • the vehicles upon receiving this packet, the vehicles will then switch back to listen to a legacy CCH and perform medium access based on a multichannel MAC protocol.
  • FIG. 14 illustrates a schematic diagram of a network model according to an embodiment of the present invention.
  • a network with multiple hops within a large reference area is considered.
  • the well-known simulation tool, NS-2 is used for evaluating the performance of the embodiment of the present invention in terms of throughput, packet delivery rate, and transmission collision rate in the example scenario
  • the considered area is a 500m by 1500m region with Manhattan Grid pattern traffic, where nodes travel along the grids (i.e., representing lanes) .
  • RSUs are assumed available in the system model. For urban areas, RSUs are commonly available in busy/congested areas (e.g., traffic lights) . For highway scenarios, along the popular highways, RSUs are usually placed to assist ITS and help collect and disseminate information for various applications. Segmentation mechanism is based on the geographical locations. Each segment employs one RSU as the local coordinator to help forward packets to far-away hops, to disseminate emergency messages, and to offer information to ITS service subscribers as a service provider. It is assumed that RSUs have another network interface (e.g., Ethernet/LTE) besides the DSRC access.
  • Ethernet/LTE Ethernet/LTE
  • the single-hop scenario covers a 500 m by 500 m area; and the multiple-hop scenario consists of three single-hop areas.
  • RSUs are assumed placed every 500 m along the area border. Vehicles are randomly distributed in the grids as shown in FIG. 14. The average speed for the nodes is 27 mi/h, which approaches the speed limit for urban traffic scenarios. The density of nodes in each sub-network equals to each other.
  • a result of the aggregate throughput against the total number of nodes in the large-scale reference area illustrates that the DNSM-MAC scheme outperform the other multichannel MAC schemes from small-scale to large-scale networks, except in very sparse networks.
  • the middle area is chosen as the reference area, since nodes in this area naturally receive interference coming from nodes outside the area from both sides.
  • a result of the normalized throughput of the nodes in the middle area against the total number of nodes in the reference area illustrates that the DNSM-MAC scheme achieves higher normalized throughput than the other three benchmarking multichannel schemes in all the dense and sparse networks.
  • the DNSM-MAC scheme reaches 357%more of the normalized throughput of AMCP and AMCMAC in the network with 90 nodes.
  • Another result is obtained by comparing the packet delivery rates and collision rates on service channels among different multichannel MAC schemes in the large-scale vehicular environment.
  • This result illustrates that the DNSM-MAC scheme and the AMCMAC scheme outperform the other two multichannel MAC schemes, in terms of both packet delivery rate and the collision rate on service channels.
  • the DNSM-MAC scheme and the AMCMAC show higher and more stable packet delivery rates on service channels than the AMCP scheme and the IEEE 1609.4 standard.
  • the proposed scheme achieves lower collision rates comparing to AMCP scheme and maintains a similar level of collisions as the standard IEEE 1609.4 does.
  • Another result of penetration rates against time in millisecond shows that the switching delay between different MAC modes (i.e., AMCMAC scheme and DNSM-MAC scheme) is less than 1 ms, and all the nodes can be informed about the segmentation of the reference network within 2 seconds.
  • FIG. 15 is a simplified block diagram of a server according to an embodiment of the present invention.
  • the server 1500 includes a receiving unit 1510, a segmentation unit 1520, an allocating unit 1530 and a sending unit 1540.
  • the receiving unit 1510 is configured to receive network state information sent by at least one RSU, wherein the network state information sent from each of the at least one RSU indicates density of nodes in the coverage of the RSU.
  • the segmentation unit 1520 is configured to perform segmentation of an area in a communication network according to the network state information to form at least one segment for the at least one RSU respectively.
  • the allocating unit 1530 is configured to allocate channels for the at least one segment.
  • the sending unit 1540 is configured to send network segmentation information and channel allocation information to each of the at least one RSU, wherein the network segmentation information indicates a segment for the RSU and the channel allocation information indicates channels allocated for the segment so that RSU communicates with a node which enters the segment through the channels allocated for the segment.
  • the density of nodes comprises numbers of nodes within different distances away from the RSU
  • the server further comprises a determining unit 1550, configured to determine that the area is congested according to the numbers of nodes within different distances away from the RSU.
  • the determining unit 1550 is further configured to determine that the area becomes uncongested, the sending unit 1540 is further configured to send segmentation revocation information to each of the at least one RSU, wherein the segmentation revocation information indicates revoking the segmentation and channel allocation so that the RSU communicates with the node which enters coverage of the RSU through legacy channels.
  • the segmentation is configured to divide the area into multiple squares each of which has an RSU in its centre, and the length of sides L S of a square for RSU (a) is given by:
  • (x a , y a ) is the longitude and latitude of RSU (a)
  • N i is the number of nodes within different ranges of the RSU (a)
  • N desired (a) is a desired node density of the squire for RSU (a) .
  • the allocating unit 1530 allocates channels for the at least one segment from one Public Control Channel PCCH, two Local Control Channels LCCHs and four Local Service Channels LSCHs, wherein the PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • the server may perform each process of the method as shown in FIG. 4, and thus will not be described redundantly herein.
  • FIG. 16 is a simplified block diagram of an RSU 1600 according to an embodiment of the present invention.
  • the server 1600 includes a sending unit 1610, a receiving unit 1620, and a communicating unit 1630.
  • the sending unit 1610 is configured to send network state information to a Radio Resource Management RRM server, wherein the network state information indicates density of nodes in coverage of the RSU.
  • the receiving unit 1620 is configured to receive network segmentation information and channel allocation information sent by a server, wherein the network segmentation information indicates a segment for the RSU, the channel allocation information indicates channels allocated for the segment, and the segment is one of at least one segment formed by the RRM server performing a segmentation of an area in a communication network for at least one RSU respectively, wherein the sending unit 1610 is further configured to send network segmentation information and the channel allocation information to nodes which are in coverage of the RSU.
  • the communicating unit 1630 is configured to communicate with nodes which are in the segment through the channels allocated for the segment.
  • the RSU 1600 further includes an obtaining unit 1640.
  • the obtaining unit 1640 is configured to obtain network state information according to report by the nodes in the coverage of the RSU.
  • the density of nodes comprises numbers of nodes within different distances away from the RSU
  • the RSU further comprises: a determining unit 1650.
  • the determining unit 1650 is configured to determine that the coverage of the RSU is congested according to the numbers of nodes within different distances away from the RSU.
  • the receiving unit 1620 is further configured to receive segmentation revocation information from the RRM server, wherein the segmentation revocation information indicates revoking the segmentation and channel allocation
  • the communicating unit 1630 is further configured to communicate with the nodes which enters coverage of the RSU by switching to the legacy channels.
  • the sending unit 1610 is configured to: periodically reporting, by the RSU, the network state information to NCC; or reporting, by the RSU, the network state information to NCC when at least one of pre-defined conditions is met.
  • one Public Control Channel PCCH, two Local Control Channels LCCHs and four Local Service Channels LSCHs are allocated for the at least one segment, one PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • the RSU may perform each process of the method as shown in FIG. 4, and thus will not be described redundantly herein.
  • FIG. 17 is a simplified block diagram of a node 1700 according to another embodiment of the present invention.
  • the node 1700 includes a receiving unit 1710, a determining unit 1720, and a communicating unit 1730.
  • the receiving unit 1710 is configured to receive network segmentation information and the channel allocation information from an RSU, wherein the network segmentation information indicates a segment for the RSU, the channel allocation information indicates channels allocated for the segment, and the segment is one of at least one segment formed by the RRM server performing a segmentation of an area in a communication network for at least one RSU respectively.
  • the determining unit 1720 is configured to determine that the node is in the segment according to the network segmentation information.
  • the communicating unit 1730 is configured to communicate with the RSU through the channels allocated for the segment.
  • the receiving unit 1710 is further configured to receive segmentation revocation information from the RSU, wherein the segmentation revocation information indicates revoking the segmentation and channel allocation, and the communicating unit 1730 is configured to communicate with the RSU through legacy channels.
  • one PCCH, two LCCHs and four LSCHs are allocated for the at least one segment, one PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • the node is a vehicle which includes an OBU.
  • the node may perform each process of the method as shown in FIG. 5, and thus will not be described redundantly herein.
  • the server 1500, the RSU 1600 and the node 1700 are present here in forms of functional units.
  • the term “unit” may refer to an Application Specific Integrated Circuit (ASIC) , an electronic circuit, a processor (shared, dedicated or group) and memory that execute one or more software or firmware programs, a combinational logic circuit, and/or other suitable components that provide the described functionality.
  • ASIC Application Specific Integrated Circuit
  • the server 1500, the RSU 1600 and the node 1700 may take the form of the host computer 1700 of FIG. 18.
  • the determining unit, the allocation unit, the segmentation unit, obtaining unit and communicating unit, etc. can be realized by the processor, the memory unit and communication interface of the host computer, specifically by the processor executing modules in the memory unit.
  • FIG 18 is a simplified block diagram of the computing device 1800.
  • the computing device includes a processor 1810, which is coupled with one or more data storage means.
  • the data storage means may include a storage medium 1850 and a memory unit 1820.
  • the storage medium 1850 may be read-only, like a read-only memory (ROM) , or readable/writeable, like a hard disk or a flash memory.
  • the memory unit 1820 may be a random access memory (RAM) .
  • the memory unit 1820 may be either physically integrated with or within the processor or constructed in a stand-alone unit or units.
  • the processor 1810 provides sequencing and processing facilities for executing instructions, performing interruption actions, providing timing functions and may other functions.
  • the processor 1810 includes one or multiple central processing units (CPUs) .
  • the computing device 1800 includes more than one processor.
  • processor refers to one or more devices, circuits and/or processing cores configured to process data, such as computer program instructions.
  • Program codes to be executed by the processor 1810 may be stored in the memory unit 1820 or storage medium 1850.
  • program codes stored in the storage medium 1850 may be copied into the memory unit for the processor 1810 to execute.
  • the computing device 1800 further includes a communication interface 1860 for communication with another device or system directly or via an external network.
  • the computing device 1800 further includes an output device 1830 and an input device 1840.
  • the output device 1830 is coupled with the processor 1810, and capable of displaying information in one or more ways.
  • the input device 1840 is also coupled with the processor 1810, capable of receiving an input from a user of the computing device 1800 in one or more ways.
  • the above elements of the computing device 1800 may be coupled with each other by a bus.
  • the computing device 1800 can be a general-purpose computing device or an application-specific computing device.
  • the above-described computing device may be a desktop computer, a laptop computer, a network server, a personal digital assistant (PDA) , a mobile phone, a tablet computer, a wireless terminal device, a telecommunication device, an embedded system or any other devices having similar structure as show in FIG. 18.
  • PDA personal digital assistant
  • the present application is certainly not limited by any particular types of the computing device.
  • the present application provides a server.
  • the functions of the server may be implemented by the computing device described in FIG. 18.
  • the server includes: a memory unit storing computer executable program codes; a communication interface; and a processor, coupled with the memory unit and the communication interface, wherein the program codes includes instructions which, when executed by processor, cause the processor to: receive network state information sent by at least one Roadside Unit RSU, perform segmentation of an area in a communication network according to the network state information to form at least one segment for the at least one RSU respectively, allocate channels for the at least one segment, and send network segmentation information and channel allocation information to each of the at least one RSU.
  • the network state information sent from each of the at least one RSU indicates density of nodes in the coverage of the RSU.
  • the network segmentation information indicates a segment for the RSU and the channel allocation information indicates channels allocated for the segment so that RSU communicates with a node which enters the segment through the channels allocated for the segment.
  • the density of nodes comprises numbers of nodes within different distances away from the RSU
  • the program codes further includes instructions which, when executed by the processor, cause the processor to determine that the area is congested according to the numbers of nodes within different distances away from the RSU before performing segmentation of an area in a communication network.
  • the program codes further includes instructions which, when executed by the processor, cause the processor to determine that the area becomes uncongested, and send segmentation revocation information to each of the at least one RSU.
  • the segmentation revocation information indicates revoking the segmentation and channel allocation so that the RSU communicates with the a node which enters coverage of the RSU through legacy channels.
  • the instructions when executed by the processor, cause the processor to divide the area into multiple squares each of which has an RSU in its centre in the process of segmentation, and the length of sides L S of a square for RSU (a) is given by:
  • (x a , y a ) is the longitude and latitude of RSU (a)
  • N i is the number of nodes within different ranges of the RSU (a)
  • N desired (a) is a desired node density of the squire for RSU (a) .
  • the instructions when executed by the processor, cause the processor to allocate channels for the at least one segment from one Public Control Channel PCCH, two Local Control Channels LCCHs and four Local Service Channels LSCHs in the process of channel allocation, wherein the PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • the server may perform each process of the method as shown in FIG. 3, and thus will not be described redundantly herein.
  • the present application provides a RSU.
  • the functions of the RSU may be implemented by the computing device described in FIG. 18.
  • the server includes: a memory unit storing computer executable program codes; a communication interface; and a processor, coupled with the memory unit and the communication interface, wherein the program codes includes instructions which, when executed by processor, cause the processor to: send network state information to a Radio Resource Management RRM server, receive network segmentation information and channel allocation information sent by a server, send network segmentation information and the channel allocation information to nodes which are in coverage of the RSU, and communicate with nodes which are in the segment through the channels allocated for the segment.
  • the network state information indicates density of nodes in coverage of the RSU.
  • the network segmentation information indicates a segment for the RSU
  • the channel allocation information indicates channels allocated for the segment
  • the segment is one of at least one segment formed by the RRM server performing a segmentation of an area in a communication network for at least one RSU respectively.
  • the program codes further includes instructions which, when executed by the processor, cause the processor to obtain network state information according to report by the nodes in the coverage of the RSU.
  • the density of nodes comprises numbers of nodes within different distances away from the RSU
  • the program codes further includes instructions which, when executed by the processor, cause the processor to determine that the coverage of the RSU is congested according to the numbers of nodes within different distances away from the RSU before sending network state information to a Radio Resource Management RRM server.
  • the program codes further includes instructions which, when executed by the processor, cause the processor to receive segmentation revocation information from the RRM server, and communicate with a node which enters coverage of the RSU by switching to the legacy channels.
  • the segmentation revocation information indicates revoking the segmentation and channel allocation
  • the instructions when executed by the processor, cause the processor to periodically report the network state information to NCC, or report the network state information to NCC when at least one of pre-defined conditions is met.
  • one Public Control Channel PCCH, two Local Control Channels LCCHs and four Local Service Channels LSCHs are allocated for the at least one segment, one PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • the RSU may perform each process of the method as shown in FIG. 4, and thus will not be described redundantly herein.
  • the present application provides a node.
  • the functions of the node may be implemented by the computing device described in FIG. 18.
  • the node includes: a memory unit storing computer executable program codes; a communication interface; and a processor, coupled with the memory unit and the communication interface, wherein the program codes includes instructions which, when executed by processor, cause the processor to: receive network segmentation information and the channel allocation information from a Roadside Unit RSU, and determine that the node is in the segment according to the network segmentation information; communicate with the RSU through the channels allocated for the segment.
  • the network segmentation information indicates a segment for the RSU, the channel allocation information indicates channels allocated for the segment, and the segment is one of at least one segment formed by the RRM server performing a segmentation of an area in a communication network for at least one RSU respectively;
  • the program codes further includes instructions which, when executed by the processor, cause the processor to receive segmentation revocation information from the RSU, and communicate with the RSU through legacy channels.
  • the segmentation revocation information indicates revoking the segmentation and channel allocation
  • one Public Control Channel PCCH, two Local Control Channels LCCHs and four Local Service Channels LSCHs are allocated for the at least one segment, one PCCH, one LCCH and two LSCHs are allocated for the segment, and the PCCH, the other LCCH and the other two LSCHs are allocated for another segment adjacent to the segment.
  • the node is a vehicle which includes an On-board Unit OBU.
  • the node may perform each process of the method as shown in FIG. 5, and thus will not be described redundantly herein.
  • the RRM server performs network segmentation and channel allocation channel for segments according to the network state information reported by the RSU, and notifies the RSU of the network segmentation information and channel allocation information, so that the RSU can communicate with a node which enters the segment through the channels allocated for the segment, reducing collision probabilities and QoS degradation and thus improve the utilization of radio resource.
  • the disclosed system, device, and method may be implemented in another manner.
  • the described device embodiment is merely exemplary.
  • the unit division is merely logical function division and there may be other division in actual implementation.
  • a plurality of units or components may be combined or integrated into another system, or some features may be ignored or not performed.
  • the displayed or discussed mutual couplings, direct couplings, or communications connections may be implemented through some interfaces, and the indirect couplings or communications connections between the devices or units may be implemented in electronic, mechanical, or another form.
  • the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one position, or may also be distributed on a plurality of network units. Some or all of the units may be selected to achieve the objective of the solution of the embodiment according to an actual need.
  • functional units in the embodiments of the present invention may be integrated into one processing unit, or each of the units may also exist alone physically, or two or more units may also be integrated into one unit.
  • the integrated units may be implemented in a form of hardware, or may also be implemented in a form of a software functional unit.
  • the integrated units When the integrated units are implemented in a form of a software functional unit and sold or used as an independent product, the integrated units may be stored in a computer-readable storage medium. Based on such an understanding, the technical solutions of the present invention essentially, a part contributing to the prior art, or all or a part of the technical solutions may be presented in a form of a software product.
  • the computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which may be a personal computer, a server, a network device, or the like) to perform all or a part of the steps of the methods described in the embodiments of the present invention.
  • the foregoing storage medium includes: any medium that can store program codes, such as a USB flash disk, a removable hard disk, a read-only memory (ROM, Read-Only Memory) , a random access memory (RAM, Random Access Memory) , a magnetic disk, or an optical disk.
  • program codes such as a USB flash disk, a removable hard disk, a read-only memory (ROM, Read-Only Memory) , a random access memory (RAM, Random Access Memory) , a magnetic disk, or an optical disk.

Landscapes

  • Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un procédé de communication, un serveur RRM, une unité RSU et un noeud. Le procédé comprend : l'exécution, par un serveur de Gestion de Ressources Radio RRM, d'une segmentation d'une zone d'un réseau de communication afin de former respectivement au moins un segment pour au moins une Unité de Bord de Route RSU; l'allocation, par le serveur RRM, de canaux de l'au moins un segment; l'envoi, par le serveur RRM, d'informations de segmentation de réseau et d'informations d'allocation de canal à chacune desdites RSU, les informations de segmentation de réseau indiquant un segment pour la RSU et les informations d'allocation de canal indiquant des canaux alloués au segment de manière à ce que la RSU communique avec un noeud pénétrant dans le segment par l'intermédiaire des canaux alloués au segment.
PCT/CN2015/092213 2015-10-19 2015-10-19 Procédé de communication, serveur, unité de bord de route et noeud WO2017066912A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201580067155.XA CN107005880B (zh) 2015-10-19 2015-10-19 通信方法、服务器、路侧单元和节点
PCT/CN2015/092213 WO2017066912A1 (fr) 2015-10-19 2015-10-19 Procédé de communication, serveur, unité de bord de route et noeud

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/092213 WO2017066912A1 (fr) 2015-10-19 2015-10-19 Procédé de communication, serveur, unité de bord de route et noeud

Publications (1)

Publication Number Publication Date
WO2017066912A1 true WO2017066912A1 (fr) 2017-04-27

Family

ID=58556519

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/092213 WO2017066912A1 (fr) 2015-10-19 2015-10-19 Procédé de communication, serveur, unité de bord de route et noeud

Country Status (2)

Country Link
CN (1) CN107005880B (fr)
WO (1) WO2017066912A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109041013A (zh) * 2018-09-28 2018-12-18 河南科技大学 基于认知无线电技术的车联网mac协议及其实现方法
CN114026890A (zh) * 2019-06-26 2022-02-08 松下知识产权经营株式会社 路侧设备和通信拥塞控制方法
US11588236B2 (en) 2020-06-17 2023-02-21 Ford Global Technologies, Llc Vehicle-to-infrastructure communication control including node deficiency determination
US11622286B2 (en) 2020-06-17 2023-04-04 Ford Global Technologies, Llc Vehicle-to-infrastructure communication control

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107396453B (zh) * 2017-08-30 2019-12-10 福建师范大学 一种基于sd-tdma的vanet信道接入方法
US10917891B2 (en) * 2018-06-01 2021-02-09 Lg Electronics Inc. Adaptive multi-channel V2X communication
CN108924790B (zh) * 2018-06-27 2021-10-22 深圳市元征科技股份有限公司 一种控制通道配置方法及相关装置
CN109121098B (zh) 2018-08-24 2021-05-25 京东方科技集团股份有限公司 一种分配信道的方法及系统
CN111818547B (zh) * 2019-04-10 2022-06-24 华为云计算技术有限公司 一种网络配置方法及装置
CN110111091A (zh) * 2019-05-17 2019-08-09 深圳成谷科技有限公司 高速公路的收费方法、系统和存储介质
CN113595950B (zh) * 2021-06-29 2023-06-13 中国船舶重工集团公司第七一五研究所 一种多体制水声通信网络的信号兼容方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102572992A (zh) * 2012-01-17 2012-07-11 百年金海安防科技有限公司 一种车载网络rsu部署及其数据转发方法
JP2012141800A (ja) * 2010-12-28 2012-07-26 Mitsubishi Heavy Ind Ltd 情報処理装置、料金収受システム、及び料金収受方法
CN102917372A (zh) * 2012-10-18 2013-02-06 北京理工大学 一种面向多场景数据交换的车联网层次化模型设计方法
CN103415082A (zh) * 2013-08-09 2013-11-27 北京邮电大学 车载无线通信信道接入方法、基站单元和车载移动终端

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101518020A (zh) * 2006-09-15 2009-08-26 皇家飞利浦电子股份有限公司 自动分组标记
KR101075021B1 (ko) * 2010-03-26 2011-10-20 전자부품연구원 Ｗａｖｅ 통신 시스템의 적응적 채널 조정 방법 및 시스템
CN102137402B (zh) * 2011-04-27 2013-09-18 北京大学 一种基于道路车辆网络的多信道分配方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012141800A (ja) * 2010-12-28 2012-07-26 Mitsubishi Heavy Ind Ltd 情報処理装置、料金収受システム、及び料金収受方法
CN102572992A (zh) * 2012-01-17 2012-07-11 百年金海安防科技有限公司 一种车载网络rsu部署及其数据转发方法
CN102917372A (zh) * 2012-10-18 2013-02-06 北京理工大学 一种面向多场景数据交换的车联网层次化模型设计方法
CN103415082A (zh) * 2013-08-09 2013-11-27 北京邮电大学 车载无线通信信道接入方法、基站单元和车载移动终端

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109041013A (zh) * 2018-09-28 2018-12-18 河南科技大学 基于认知无线电技术的车联网mac协议及其实现方法
CN109041013B (zh) * 2018-09-28 2021-05-25 河南科技大学 基于认知无线电技术的车联网mac协议及其实现方法
CN114026890A (zh) * 2019-06-26 2022-02-08 松下知识产权经营株式会社 路侧设备和通信拥塞控制方法
US11588236B2 (en) 2020-06-17 2023-02-21 Ford Global Technologies, Llc Vehicle-to-infrastructure communication control including node deficiency determination
US11622286B2 (en) 2020-06-17 2023-04-04 Ford Global Technologies, Llc Vehicle-to-infrastructure communication control

Also Published As

Publication number Publication date
CN107005880B (zh) 2019-12-24
CN107005880A (zh) 2017-08-01

Similar Documents

Publication Publication Date Title
WO2017066912A1 (fr) Procédé de communication, serveur, unité de bord de route et noeud
US10631228B2 (en) Information dissemination in a multi-technology communication network
Rehman et al. An adaptive relay nodes selection scheme for multi-hop broadcast in VANETs
Zhang et al. A scalable CSMA and self-organizing TDMA MAC for IEEE 802.11 p/1609. x in VANETs
CN104994583B (zh) 车载自组织网络中基于簇机制的多信道mac协议方法
Chen et al. A congestion avoidance game for information exchange on intersections in heterogeneous vehicular networks
US10433324B2 (en) Method and apparatus for allocating resource in wireless communication system
Nguyen et al. MAC protocols with dynamic interval schemes for VANETs
Chen et al. A-VeMAC: An adaptive vehicular MAC protocol for vehicular ad hoc networks
Hadded et al. An infrastructure-free slot assignment algorithm for reliable broadcast of periodic messages in vehicular ad hoc networks
Booysen et al. Performance comparison of media access control protocols for vehicular ad hoc networks
WO2016106699A1 (fr) Procédé, dispositif et système pour planifier des données de nœud de réseau
Leal et al. Information-centric opportunistic data dissemination in vehicular ad hoc networks
Bako et al. Efficient information dissemination in VANETs
WO2018058375A1 (fr) Procédé et terminal de communication
CN105684339A (zh) 增强型子信道选择性传输规程
Nguyen et al. Application of the lowest-ID algorithm in cluster-based TDMA system for VANETs
Balador et al. A reliable token-based MAC protocol for V2V communication in urban VANET
Bradai et al. ViCoV: Efficient video streaming for cognitive radio VANET
Han et al. Adaptive network segmentation and channel allocation in large-scale V2X communication networks
Lim et al. Cognitive VANET with enhanced priority scheme
Balador et al. DTB-MAC: Dynamic Token-Based MAC Protocol for reliable and efficient beacon broadcasting in VANETs
Khanafer et al. Enhancements to IEEE 802.15. 4 MAC protocol to support vehicle-to-roadside communications in VANETs
Wang et al. Power control and channel assignment mechanisms for cluster-based multichannel vehicular Ad-Hoc networks
Bi et al. Overview of safety message broadcast in vehicular networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15906431

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15906431

Country of ref document: EP

Kind code of ref document: A1