CN113301664A - Network access method for state information sequence competition - Google Patents

Network access method for state information sequence competition Download PDF

Info

Publication number
CN113301664A
CN113301664A CN202110520433.XA CN202110520433A CN113301664A CN 113301664 A CN113301664 A CN 113301664A CN 202110520433 A CN202110520433 A CN 202110520433A CN 113301664 A CN113301664 A CN 113301664A
Authority
CN
China
Prior art keywords
information
priority
competition
vehicle
node
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
CN202110520433.XA
Other languages
Chinese (zh)
Other versions
CN113301664B (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.)
Northwestern Polytechnical University
Original Assignee
Northwestern Polytechnical University
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 Northwestern Polytechnical University filed Critical Northwestern Polytechnical University
Priority to CN202110520433.XA priority Critical patent/CN113301664B/en
Publication of CN113301664A publication Critical patent/CN113301664A/en
Application granted granted Critical
Publication of CN113301664B publication Critical patent/CN113301664B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0866Non-scheduled access, e.g. ALOHA using a dedicated channel for access
    • H04W74/0875Non-scheduled access, e.g. ALOHA using a dedicated channel for access with assigned priorities based access

Landscapes

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

Abstract

The invention provides a network access method of state information sequence competition, which combines the advantages of a competition type MAC layer access method and a non-competition type MAC layer access method, and different vehicle nodes in a network compete in a competition stage of network allocation by adopting different state information sequences aiming at messages with different priorities so as to reserve a transmission time slot in a transmission stage. In the transmission stage, a time division multiple access mode is adopted, and different vehicle nodes transmit information according to the time slots reserved in the competition stage. According to the invention, the information transmitted among the vehicle nodes is classified, so that the information with high priority is transmitted first, and the information with low priority is transmitted last, thereby being more in line with the actual application scene of the vehicle-mounted self-organizing network. Meanwhile, a self-adaptive adjustment mechanism is introduced, a solution scheme for realizing the conflict occurrence is provided, and the network throughput and the transmission efficiency are improved.

Description

Network access method for state information sequence competition
Technical Field
The invention relates to the field of wireless communication MAC layers, in particular to a network access method, specifically to an Internet of vehicles access method.
Background
The vehicle-mounted self-organizing network is a wireless network consisting of traffic entities such as vehicles, road infrastructure and the like in the internet of vehicles. Based on this, data communication can be directly performed between vehicles, between vehicles and roads, and between vehicles and people. Because the nodes in the vehicle-mounted ad hoc network share the same frequency spectrum, the unreasonable access of the communication nodes to the channel may cause problems of data transmission collision or wireless channel waste and the like, and the communication quality of the network is reduced. Meanwhile, the type of road information may have different degrees of influence on the safety of road traffic, for example, the safety information of the road directly influences the driving state of the vehicle, and has the highest priority compared with other types of information, and the vehicle ad hoc network needs to serve for high-quality and efficient data transmission of such information. In order to ensure the effectiveness and reliability of data information transmission with different priorities in a vehicle-mounted self-organizing network, a good channel management mechanism must be designed for the vehicle-mounted self-organizing network, and a special MAC layer access method is designed to ensure the road safety.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a network access method for state information sequence competition. In order to overcome the defects and shortcomings, the invention provides a state information sequence competition Internet of vehicles access method aiming at different vehicle nodes to transmit road information with different priorities. In the transmission stage, a Time Division Multiple Access (TDMA) mode is adopted, and different vehicle nodes carry out information transmission according to the time slots reserved in the competition stage. On the basis of maintaining the network stability, the priority of the vehicle node information in the network is considered, the high-priority safety information can be effectively sent out, and the phenomenon that the high-priority safety information competes with conventional information, so that time is wasted, and the road state paralysis caused by network delay is caused is avoided.
The technical scheme adopted by the invention for solving the technical problem comprises the following steps:
step one, time slot division stage;
the vehicle-mounted self-organizing network consists of vehicle nodes and roadbed nodes, the information of each vehicle node is divided into three priorities, the information with the highest priority is road emergency safety information, the information with the second highest priority is non-emergency safety information, and the information with the low priority is common entertainment information; when each vehicle node has information to be transmitted, different state information sequences are generated according to the priority of the information to be transmitted, the value in the state information sequences is not 0, namely 1, 0 represents that the vehicle node is in an interception state, and 1 represents that the vehicle node broadcasts a busy signal state;
the subgrade node broadcasts the time slot division result of the subgrade node, divides a frame into two stages, namely a competition stage and a transmission stage, and simultaneously broadcasts the allocation proportions of high priority, low priority and low priority in a state information sequence; the initial stage defaults that the proportion of the high priority, the second low priority and the low priority is the same, the subsequent stage automatically adjusts according to the actual situation, and the adjustment strategy is explained in the fourth step. As shown in fig. 1, each vehicle node can receive the time slot division result and the state information sequence priority distribution result broadcasted by the roadbed node, and uses different state information sequences to reserve the time slot in the transmission phase according to the priority of the transmitted data in the competition phase;
step two, a competition phase;
as shown in fig. 2, the state information sequence is composed of K bits, K bits are allocated to three different priority information, for each priority, the lengths of the allocated information state sequences are K1, K2, K3, and K1+ K2+ K3 ═ K, the first K1 bits in the state information sequence are used to indicate whether the information has low priority, if all the first K1 bits are 1, the information does not have low priority, and if there is a 0 in the first K1 bits, the information has low priority; bits k1+1 to k1+ k2 of the state information sequence are used for indicating whether the information has the second highest priority, if bits k1+1 to k1+ k2 are all 1, the information does not have the second highest priority, and if bits k1+1 to k1+ k2 have a 0, the information has the second highest priority; the k1+ k2+ 1-k 1+ k2+ k3 bits of the state information sequence are used to indicate whether the information has the highest priority, the k1+ k2+ 1-k 1+ k2+ k3 bits are all 1, indicating that the information does not have the highest priority, if a 0 exists in bits K1+ K2+ 1-K1 + K2+ K3, indicating that the information has the highest priority, restricting the state information sequence of the K bits to have at most one listening state, starting from the leftmost bit of the state information sequence, each vehicle node selecting a broadcast busy signal or a listening channel according to the state information sequence, if the vehicle node listens to the busy information broadcast by other vehicle nodes, the vehicle node being listened to exits the competition, according to the order of quitting competition of the vehicle nodes, the vehicle nodes quitting first reserve the last time slot of the transmission stage for transmitting information, namely the vehicle nodes quitting competition first transmit information last;
step three, transmission stage
According to the time slot reservation result of each vehicle node in the competition stage, fixed transmission time slots are allocated to different vehicle nodes in a TDMA (time division multiple access) mode in the transmission stage to finish information transmission; according to the property of the competition stage, when different vehicle nodes have the same priority and adopt the same information state sequence for information transmission, the information transmission conflict in the transmission stage is caused, in this case, the roadbed node rebroadcasts the distribution state information sequence and retransmits the conflicting data according to the step one and the step one in the next time frame;
step four, self-adaptive adjusting stage
Adopting a method for self-adaptive adjustment of the state information sequence; and (4) detecting the conflict condition generated by different kinds of information by using the roadbed node, adjusting the distribution proportion of the state information sequence, and skipping to the first step for redistribution.
If the roadbed node detects that the information with the highest priority or the second highest priority or the low priority conflicts in the last information transmission process, the roadbed node broadcasts to each vehicle node to adaptively increase the information state sequence length corresponding to the priority to relieve the conflict, divides the remaining information state sequence length into two bits corresponding to the other two priorities, and retransmits the conflicting data in the next time frame according to the first step and the second step.
The method has the advantages that the information transmitted among the vehicle nodes is classified, so that the information with high priority is transmitted first, the information with low priority is transmitted last, and the method is more suitable for the actual application scene of the vehicle-mounted self-organizing network. Meanwhile, a self-adaptive adjustment mechanism is introduced, a solution scheme for realizing the conflict occurrence is provided, and the network throughput and the transmission efficiency are improved.
Drawings
Fig. 1 is a diagram of a transmission slot architecture according to the present invention.
Fig. 2 is a diagram of the structure of the state information sequence of the present invention.
Fig. 3 is a schematic diagram of an implementation scenario of the present invention.
Detailed Description
The invention is further illustrated with reference to the following figures and examples.
The invention provides a state information sequence competition internet of vehicles access method, which specifically introduces the detailed steps of the access method by taking the situation in fig. 3 as an example.
The application scenario of the invention is that different vehicle nodes are in a mutual communication range in a vehicle-mounted self-organizing network, and the method specifically comprises the following steps:
the method comprises the following steps: the subgrade node broadcasts the time slot division result of the subgrade node, and divides a frame into two stages, namely a competition stage and a transmission stage.
Step two: as shown in fig. 3, 3 vehicle nodes receive the time slot allocation result of the roadbed node, and generate a corresponding state information sequence according to the priority of information to be sent in a competition phase, where the state information sequence is assumed to be composed of 9 bits, and the allocation proportion of different priorities is a high priority: second highest priority: low priority 4:3: 2. The low priority occupies the upper 4 bits, the highest priority occupies the lower 2 bits, and the rest is the next highest priority. Assuming that the information to be transmitted by the first vehicle node is high priority, the corresponding status information sequence is generated as follows: 111111101, the information that the second vehicle node needs to transmit is low priority, and the corresponding state information sequence is generated as follows: 110111111, the information that the third vehicle node needs to transmit is the second highest priority, and the corresponding state information sequence is generated as follows: 111110111. according to the competition criterion, the second vehicle node monitors in the third competition time slot, and the busy signal of the channel broadcasted by the other two vehicle nodes is monitored, so that competition is promoted and the second vehicle node is used as the last node for sending information in the transmission stage; and the third vehicle node listens in the seventh competition time slot and listens for a channel busy signal broadcast by another vehicle node, so that competition is promoted and the third vehicle node is used as a node for sending information the last time in the transmission stage, and the first vehicle node is used as a node for sending information the first time in the transmission stage.
Step three: and according to the competition result of the competition stage, allocating a fixed transmission time slot for each vehicle node in the transmission stage, and finishing the information transmission of each vehicle node in the fixed transmission time slot according to a TDMA (time division multiple access) mode. If two vehicle nodes generate the same state information sequence in the competition stage and conflict occurs in the transmission stage, the roadbed node rebroadcasts the distribution state information sequence and retransmits the conflicting data according to the steps in the next time frame.
Step four: and (4) detecting the conflict condition generated by different types of information by the roadbed node, adjusting the distribution proportion of the state information sequence, and repeating the steps to finish the transmission of the information with different priorities of the vehicle nodes.
If the subgrade node detects that the information of k3 conflicts in the last information transmission process, the subgrade node broadcasts to each vehicle node to adaptively increase k3 to relieve the conflicts, the lengths of the remaining information state sequences are averagely divided into lengths corresponding to k1 and k2, and the conflicting data are retransmitted according to the step one and the step one in the next time frame.

Claims (2)

1. A network access method of state information sequence competition is characterized by comprising the following steps:
step one, time slot division stage;
the vehicle-mounted self-organizing network consists of vehicle nodes and roadbed nodes, the information of each vehicle node is divided into three priorities, the information with the highest priority is road emergency safety information, the information with the second highest priority is non-emergency safety information, and the information with the low priority is common entertainment information; when each vehicle node has information to be transmitted, different state information sequences are generated according to the priority of the information to be transmitted, the value in the state information sequences is not 0, namely 1, 0 represents that the vehicle node is in an interception state, and 1 represents that the vehicle node broadcasts a busy signal state;
the subgrade node broadcasts the time slot division result of the subgrade node, divides a frame into two stages, namely a competition stage and a transmission stage, and simultaneously broadcasts the allocation proportions of high priority, low priority and low priority in a state information sequence; the initial stage defaults that the proportion of high priority, second low priority and low priority is the same, each vehicle node can receive the time slot division result and the state information sequence priority distribution result broadcasted by the roadbed node, and different state information sequences are adopted to reserve the time slot of the transmission stage in the competition stage according to the priority of the transmitted data;
step two, a competition phase;
the state information sequence is composed of K bits, the K bits are allocated to three different kinds of priority information, the lengths of the allocated information state sequences are K1, K2 and K3, K1+ K2+ K3 is K, the first K1 bits in the state information sequence are used for indicating whether the information has low priority, if all the first K1 bits are 1, the information does not have low priority, and if one 0 exists in the first K1 bits, the information has low priority; bits k1+1 to k1+ k2 of the state information sequence are used for indicating whether the information has the second highest priority, if bits k1+1 to k1+ k2 are all 1, the information does not have the second highest priority, and if bits k1+1 to k1+ k2 have a 0, the information has the second highest priority; the k1+ k2+ 1-k 1+ k2+ k3 bits of the state information sequence are used to indicate whether the information has the highest priority, the k1+ k2+ 1-k 1+ k2+ k3 bits are all 1, indicating that the information does not have the highest priority, if a 0 exists in bits K1+ K2+ 1-K1 + K2+ K3, indicating that the information has the highest priority, restricting the state information sequence of the K bits to have at most one listening state, starting from the leftmost bit of the state information sequence, each vehicle node selecting a broadcast busy signal or a listening channel according to the state information sequence, if the vehicle node listens to the busy information broadcast by other vehicle nodes, the vehicle node being listened to exits the competition, according to the order of quitting competition of the vehicle nodes, the vehicle nodes quitting first reserve the last time slot of the transmission stage for transmitting information, namely the vehicle nodes quitting competition first transmit information last;
step three, transmission stage
According to the time slot reservation result of each vehicle node in the competition stage, fixed transmission time slots are allocated to different vehicle nodes in a TDMA (time division multiple access) mode in the transmission stage to finish information transmission; according to the property of the competition stage, when different vehicle nodes have the same priority and adopt the same information state sequence for information transmission, the information transmission conflict in the transmission stage is caused, in this case, the roadbed node rebroadcasts the distribution state information sequence and retransmits the conflicting data according to the step one and the step one in the next time frame;
step four, self-adaptive adjusting stage
Adopting a method for self-adaptive adjustment of the state information sequence; and (4) detecting the conflict condition generated by different kinds of information by using the roadbed node, adjusting the distribution proportion of the state information sequence, and skipping to the first step for redistribution.
2. The method of claim 1, wherein the network access method comprises:
if the roadbed node detects that the information with the highest priority or the second highest priority or the low priority conflicts in the last information transmission process, the roadbed node broadcasts to each vehicle node to adaptively increase the information state sequence length corresponding to the priority to relieve the conflict, divides the remaining information state sequence length into two bits corresponding to the other two priorities, and retransmits the conflicting data in the next time frame according to the first step and the second step.
CN202110520433.XA 2021-05-13 2021-05-13 Network access method for state information sequence competition Active CN113301664B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110520433.XA CN113301664B (en) 2021-05-13 2021-05-13 Network access method for state information sequence competition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110520433.XA CN113301664B (en) 2021-05-13 2021-05-13 Network access method for state information sequence competition

Publications (2)

Publication Number Publication Date
CN113301664A true CN113301664A (en) 2021-08-24
CN113301664B CN113301664B (en) 2022-12-06

Family

ID=77321817

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110520433.XA Active CN113301664B (en) 2021-05-13 2021-05-13 Network access method for state information sequence competition

Country Status (1)

Country Link
CN (1) CN113301664B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103118336A (en) * 2013-01-28 2013-05-22 华南理工大学 Method for expanding coverage of vehicle networking security information broadcast
CN108282502A (en) * 2017-01-05 2018-07-13 上海竺程信息科技有限公司 Vehicle network message optimisation broadcasting method based on dynamic priority
WO2019066882A1 (en) * 2017-09-29 2019-04-04 Intel IP Corporation Method and apparatus for resource slot configuration and allocating user equipments to resource slots for controlling channel access from the user equipments
CN109819474A (en) * 2019-01-24 2019-05-28 辽宁大学 Multipriority MAC protocol formulating method in vehicular ad hoc network based on sub-clustering
US20190251848A1 (en) * 2019-03-29 2019-08-15 Intel Corporation Technologies for vehicle-to-vehicle communications for autonomous vehicles

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103118336A (en) * 2013-01-28 2013-05-22 华南理工大学 Method for expanding coverage of vehicle networking security information broadcast
CN108282502A (en) * 2017-01-05 2018-07-13 上海竺程信息科技有限公司 Vehicle network message optimisation broadcasting method based on dynamic priority
WO2019066882A1 (en) * 2017-09-29 2019-04-04 Intel IP Corporation Method and apparatus for resource slot configuration and allocating user equipments to resource slots for controlling channel access from the user equipments
CN109819474A (en) * 2019-01-24 2019-05-28 辽宁大学 Multipriority MAC protocol formulating method in vehicular ad hoc network based on sub-clustering
US20190251848A1 (en) * 2019-03-29 2019-08-15 Intel Corporation Technologies for vehicle-to-vehicle communications for autonomous vehicles

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
KHALID ABDEL HAFEEZ; LIAN ZHAO; JON W. MARK; XUEMIN SHEN; ZHISHE: "《Distributed Multichannel and Mobility-Aware Cluster-Based MAC Protocol for Vehicular Ad Hoc Networks》", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 *
任秀丽,陈梓航: "《车载自组网中基于分簇的多优先级异步MAC协议》", 《小型微型计算机系统》 *
李大鹏,袁涛,赵海涛: "《车载自组织网络中基于邻居节点数估计的最小竞争窗口调整算法》", 《电信科学》 *

Also Published As

Publication number Publication date
CN113301664B (en) 2022-12-06

Similar Documents

Publication Publication Date Title
EP1611700B1 (en) Multi-hop time reservation using adaptive control for energy efficiency
CN108430111B (en) Mixed type time slot reservation method in distributed TDMA protocol
Zhang et al. A scalable CSMA and self-organizing TDMA MAC for IEEE 802.11 p/1609. x in VANETs
US8571003B2 (en) Timeslot sharing protocol for wireless communication networks
US7447180B2 (en) Wireless media access method
Shao et al. A multi-priority supported medium access control in vehicular ad hoc networks
US7555004B2 (en) Coordinating communications in a heterogeneous communications network using different signal formats
US20050152394A1 (en) Method of transferring a TCP stream in PAN
CN110809324B (en) MAC transmission method based on distributed TDMA and wireless self-organizing network system
CN104994583A (en) Multi-channel MAC protocol method based on cluster mechanism in vehicular Ad hoc network
CN109041013B (en) Internet of vehicles MAC protocol based on cognitive radio technology and implementation method thereof
US8831516B2 (en) Apparatus and method for transmitting and receiving data depending on connection priorities between terminals in near field communication system
Abdalla et al. Space-orthogonal frequency-time medium access control (SOFT MAC) for VANET
Zhang et al. A black-burst based time slot acquisition scheme for the hybrid TDMA/CSMA multichannel MAC in VANETs
CN102780696B (en) Multi-channel cognitive MAC (media access control) protocol of vehicle-mounted self-organization network
CN100505584C (en) Fast precontract and line transmission multi-address access method
CN102104517B (en) Random number statement-based multiple access method
CN113939030A (en) Dynamic TDMA time slot allocation method based on node priority
KR102049047B1 (en) Method of data transmitting and receiving in the talk-around direct communication network
Almalag et al. A modified TC-MAC protocol for multi-hop cluster communications in VANETs
CN113301664B (en) Network access method for state information sequence competition
CN110191500B (en) Self-organizing network time frequency resource scheduling method supporting resource fragment reduction
CN115499933A (en) Wireless communication method and device
Ferreira et al. On the adequacy of 802.11 p MAC protocols to support safety services in ITS
KR20220137372A (en) Channel control method of cognitive wireless network

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