[go: up one dir, main page]

CN103415045A - Design method for efficient wireless information interaction network protocol - Google Patents

Design method for efficient wireless information interaction network protocol Download PDF

Info

Publication number
CN103415045A
CN103415045A CN2013103928351A CN201310392835A CN103415045A CN 103415045 A CN103415045 A CN 103415045A CN 2013103928351 A CN2013103928351 A CN 2013103928351A CN 201310392835 A CN201310392835 A CN 201310392835A CN 103415045 A CN103415045 A CN 103415045A
Authority
CN
China
Prior art keywords
node
network
data
information interaction
nodes
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
CN2013103928351A
Other languages
Chinese (zh)
Other versions
CN103415045B (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.)
Central South University
Original Assignee
Central South 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 Central South University filed Critical Central South University
Priority to CN201310392835.1A priority Critical patent/CN103415045B/en
Publication of CN103415045A publication Critical patent/CN103415045A/en
Application granted granted Critical
Publication of CN103415045B publication Critical patent/CN103415045B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

本发明公布了一种高效无线信息交互网络协议的设计方法。具体的,是以无线自组织网络的物理层为基础,利用信息交互技术设计了无线信道接入协议,所述方法的步骤包括自组织组网、信道接入控制方法、信道接入协议的退避算法;同时,提出了基于自动优先级调整的网络传输速率动态控制协议,通过对网内节点进行不同优先级的动态调整,合理分配网络带宽,按需求控制不同节点的速率,实现了对数据信息的分布式检测,具有广泛的适应性和通用性。所述的高效无线信息交互网络协议,实现了节点间的高效信息交互并保证了良好的服务质量,为无线信息交互技术建立了完整的框架结构。

Figure 201310392835

The invention discloses a design method of an efficient wireless information interaction network protocol. Specifically, based on the physical layer of the wireless ad hoc network, a wireless channel access protocol is designed using information interaction technology, and the steps of the method include ad hoc networking, channel access control methods, and backoff of the channel access protocol At the same time, a dynamic network transmission rate control protocol based on automatic priority adjustment is proposed. By dynamically adjusting different priorities of nodes in the network, the network bandwidth is allocated reasonably, and the speed of different nodes is controlled according to demand. The distributed detection has wide adaptability and versatility. The high-efficiency wireless information interaction network protocol realizes efficient information interaction between nodes and ensures good service quality, and establishes a complete framework structure for wireless information interaction technology.

Figure 201310392835

Description

一种高效无线信息交互网络协议的设计方法A Design Method of Efficient Wireless Information Interaction Network Protocol

技术领域technical field

本发明涉及一种高效无线信息交互网络协议的整体框架及设计方法,具体的,是通过设计无线信道接入协议和网络传输速率动态控制协议,实现具有优良实时性、适合处理实时交互信息和突发信息的自组织无线信息交互网络,属于无线信息交互领域。The present invention relates to an overall framework and a design method of an efficient wireless information interaction network protocol. Specifically, by designing a wireless channel access protocol and a network transmission rate dynamic control protocol, a network protocol with excellent real-time performance and suitable for processing real-time interactive information and bursts is realized. An ad hoc wireless information interaction network for sending information belongs to the field of wireless information interaction.

背景技术Background technique

随着现代无线通信的不断发展,各领域开发设计人员对无线网络有了越来越高的要求,以无线自组织网络为代表的新的无线通讯方式得到了广泛的研究和应用。目前,无线自组织网络在路由协议、网络拓扑控制、能源分配等方面已有很多研究成果,但无线信息实时交互技术还没有引起人们足够的关注。现有的信息交互网络理论模型都是针对所有节点具有相同数据请求速率的情况,在这样的网络中,节点被要求以相同的频率发送实时信息,并且所有节点都要求参与,但是在实际应用中,不同数据往往有不同的实时性要求,导致其在工业领域一直应用很少,至今还没有针对工业实时控制的无线自组织通信协议出现。传统无线数据传输技术的研究重心在于数据的收集和分发,而信息交互的目标是为了让网络中每一个节点获得周围其它所有节点的信息,节点间组成自组织无线通信网络,在无基站的环境下运行,具有极大实用价值。不同通信系统和网络环境,可根据各自需求采用不同的数据传输模式,从而实现高效信息交互。随着协同作业对无线网络越来越广泛的需求,无线信息交互技术将成为未来通信的基础,必将得到更快的发展。With the continuous development of modern wireless communication, developers and designers in various fields have higher and higher requirements for wireless networks, and new wireless communication methods represented by wireless ad hoc networks have been extensively researched and applied. At present, there have been many research results in routing protocols, network topology control, and energy distribution in wireless ad hoc networks, but the wireless information real-time interaction technology has not attracted enough attention. The existing theoretical models of information exchange networks are all aimed at the situation that all nodes have the same data request rate. In such a network, nodes are required to send real-time information at the same frequency, and all nodes are required to participate, but in practical applications , different data often have different real-time requirements, resulting in its application in the industrial field has been seldom, so far there is no wireless ad hoc communication protocol for industrial real-time control. The research focus of traditional wireless data transmission technology lies in the collection and distribution of data, and the goal of information exchange is to allow each node in the network to obtain information from all other nodes around it, and form an ad hoc wireless communication network between nodes. It has great practical value. Different communication systems and network environments can adopt different data transmission modes according to their respective needs, so as to achieve efficient information exchange. With the increasingly extensive demand for wireless networks in collaborative operations, wireless information interaction technology will become the basis of future communications and will surely develop faster.

发明内容Contents of the invention

针对上述问题和不足,本发明公布了一种高效无线信息交互网络协议的设计方法。具体的,是以无线自组织网络的物理层为基础,设计了应用于信息交互领域的无线信道接入协议,使无线信息交互网络具有更好的实时性,更适合处理实时交互信息和突发信息;同时,提出了基于自动优先级调整的网络传输速率动态控制协议,通过对网内节点进行不同优先级的动态调整,合理分配网络带宽,按需求控制不同节点的速率,具有广泛的适应性和通用性。所述的高效无线信息交互网络协议,实现了节点间的高效信息交互并保证了良好的服务质量,为无线信息交互技术建立了完整的框架结构。In view of the above problems and deficiencies, the present invention discloses a design method of an efficient wireless information interaction network protocol. Specifically, based on the physical layer of the wireless self-organizing network, a wireless channel access protocol applied in the field of information interaction is designed, so that the wireless information interaction network has better real-time performance and is more suitable for processing real-time interactive information and bursts. At the same time, a dynamic network transmission rate control protocol based on automatic priority adjustment is proposed. By dynamically adjusting different priorities of nodes in the network, the network bandwidth can be allocated reasonably, and the speed of different nodes can be controlled according to demand, which has wide adaptability and versatility. The high-efficiency wireless information interaction network protocol realizes efficient information interaction between nodes and ensures good service quality, and establishes a complete framework structure for wireless information interaction technology.

所述的高效无线信息交互网络协议具体包括如下两个方面:The high-efficiency wireless information interaction network protocol specifically includes the following two aspects:

I、无线信息交互网络信道接入协议I. Wireless information exchange network channel access protocol

所述的无线信息交互网络,其特征在于,所组建的信息交互网络具有良好的自组网能力,在网络结构发生变化时,可以迅速自愈,以保证网络的连通性;有较高的无线信道带宽利用率,以保证数据稳定、准确地传输,实现信息的交互共享;检测到冲突发生时有相应的退避算法,以避免报文间的冲突;网络传输时延低,实时性好,具有良好的服务质量保障和有效的安全机制。The wireless information interaction network is characterized in that the established information interaction network has a good self-organizing network capability, and can quickly self-heal when the network structure changes, so as to ensure the connectivity of the network; Utilization of channel bandwidth to ensure stable and accurate data transmission and realize interactive sharing of information; when a conflict is detected, there is a corresponding backoff algorithm to avoid conflicts between messages; the network transmission delay is low, and the real-time performance is good. Good service quality guarantee and effective security mechanism.

所述的无线信息交互网络信道接入协议具体包括如下步骤:The wireless information exchange network channel access protocol specifically includes the following steps:

步骤A、自组织组网Step A. Ad hoc networking

无线信息交互网络采用自组织的组网方式,从节点上电初始化至整个网络的完全建立包含如下步骤:The wireless information interaction network adopts a self-organizing networking method. From node power-on initialization to the complete establishment of the entire network, the following steps are included:

网络探测:网络节点上电、初始化完成后,开始进行网络探测,其特征在于,从低频率信道往高频率信道依次扫描占用情况,根据不同的信道占用情况做出相应的决策,获取信道内所有节点的地址及实时数据信息,使用相应逻辑算法协调节点加入与节点离开过程。Network detection: After the network nodes are powered on and initialized, the network detection starts, which is characterized in that the occupancy status is scanned sequentially from low-frequency channels to high-frequency channels, and corresponding decisions are made according to different channel occupancy conditions to obtain all information in the channel. Node addresses and real-time data information, use the corresponding logic algorithm to coordinate the process of node joining and node leaving.

节点加入:所述的节点加入过程,其特征在于,节点探测完成后,获得信道占用信息,选择存在网络的信道,监听该信道内节点是否已经满员,选择不同的节点加入策略,加入成功后,将自己的地址编号,并更新在线节点列表,重新同步时序,开始进行数据发送。Node joining: the described node joining process is characterized in that, after the node detection is completed, the channel occupancy information is obtained, a channel in the network is selected, and whether the node in the channel is monitored is full, and a different node joining strategy is selected. After the joining is successful, Number your own address, update the online node list, resynchronize the timing, and start sending data.

节点离开:所述的节点离开分为正常离线和意外离线,其特征在于,对正常离线与意外离线设置不同的策略,保证离线节点不影响网络内其它在线节点的正常运作,不影响网络的构建和网络性能。Node leaving: the node leaving is divided into normal offline and accidental offline, which is characterized in that different strategies are set for normal offline and accidental offline to ensure that offline nodes do not affect the normal operation of other online nodes in the network and do not affect the construction of the network and network performance.

步骤B、信道接入控制方法Step B, channel access control method

为了使所述的信道接入协议稳定、可靠地工作,将节点的行为予以明确定义,使节点在不同状态下,收到不同报文数据时做出正确反应。网络节点具体包括如下5种状态:In order to make the channel access protocol work stably and reliably, the behavior of the nodes is clearly defined, so that the nodes can respond correctly when receiving different message data in different states. Network nodes specifically include the following five states:

协议初始化:该状态为节点上电后自动进入的状态,节点在此时进行信道检测,并随机竞争临时主节点。一旦检测到信道繁忙、竞争成为临时主节点、竞争失败等事件,则退出该状态。Protocol initialization: This state is the state that the node automatically enters after power-on. At this time, the node performs channel detection and randomly competes for the temporary master node. Once it detects that the channel is busy, competing to become a temporary master node, or failing to compete, it will exit this state.

临时主节点:节点在竞争中获胜成为临时主节点,自动生成网络地址,并将本地址加入在线节点列表,周期性地发送本地数据信息;同时,临时主节点收到新上线节点的上线请求后,根据不同情况发出相应的指令信息,维持网络的秩序。临时主节点是可以变化的,任何节点可以成为临时主节点。Temporary master node: The node wins the competition to become the temporary master node, automatically generates a network address, and adds this address to the online node list, and periodically sends local data information; at the same time, after the temporary master node receives the online request of the new online node , according to different situations, send corresponding instruction information to maintain the order of the network. The temporary master node can be changed, and any node can become the temporary master node.

等待加入:如果同时上线的节点有多个,那么在一个信息交互周期内将不能全部加入网络,加入失败的节点将由初始化状态转到等待加入状态,该状态中的节点根据临时主节点的指令消息,随后进入在线成员状态。Waiting to join: If there are multiple nodes that go online at the same time, all of them cannot join the network within an information exchange cycle, and the nodes that fail to join will change from the initialization state to the waiting to join state. , and then enter the online member state.

在线成员:当节点确认已经加入网络后,节点的状态自动更改为在线成员;在线成员节点按照预定时序依次发送数据信息,并可以在数据信息中加入指令,以便灵活转换到其它状态。Online member: When the node confirms that it has joined the network, the state of the node is automatically changed to an online member; the online member node sends data information in sequence according to the predetermined timing, and can add instructions to the data information to flexibly switch to other states.

休眠:节点在发送休眠指令后,进入休眠状态,该状态主要是为了方便重新加入在线成员和节省功耗,省去不必要的功能。Sleep: After the node sends the sleep command, it enters the sleep state. This state is mainly for the convenience of rejoining online members and saving power consumption, eliminating unnecessary functions.

所述的信道接入控制方法需要进行网络节点的时隙划分和时钟同步,一方面保证网络中节点的信息能够严格按照预先设定的逻辑进行交互,同时也决定着网络的实时性能和服务质量。还需要针对所述的信道接入控制方法,设计数据帧格式,用于网络协调控制和数据信息传输。The channel access control method requires time slot division and clock synchronization of network nodes. On the one hand, it ensures that the information of nodes in the network can interact strictly according to the preset logic, and at the same time, it also determines the real-time performance and service quality of the network. . It is also necessary to design a data frame format for the above-mentioned channel access control method, which is used for network coordination control and data information transmission.

步骤C、信道接入协议的退避算法Step C, the backoff algorithm of the channel access protocol

所述的无线信息交互网络,对时序进行了严格同步,在2个预留时隙阶段存在多个节点争用信道的情况,这就需要采用信道接入协议的退避算法来进行协调。所述的信道接入协议退避算法,其特征为,根据退避时间、区间设定退避计数器的值,退避计数器的增加值Fmc及减少值Fdec的确定规则如下:The wireless information interaction network described above strictly synchronizes the time sequence, and there is a situation where multiple nodes compete for the channel during the two reserved time slot stages, which requires a backoff algorithm of the channel access protocol for coordination. The back-off algorithm of the channel access protocol is characterized in that the value of the back-off counter is set according to the back-off time and the interval, and the determination rules of the increase value F mc and the decrease value F dec of the back-off counter are as follows:

Fmc=Min(α×counter,MAX)F mc =Min(α×counter,MAX)

Ff decdec == MaxMax (( countercounter ,, MINMIN ))

当冲突发生时,计数器递增,退避区间的左边界左移使退避区间增大,同时使平均退避时长减小,这就让退避的节点在下一次发送的时候成功概率更大。随着退避计数器的继续增大,可为比较拥堵的网络提供更大的退避空间;数据发送成功后,退避计数器的数值采用负指数幂等方式以较快速度减小,以迅速减轻网络压力。When a conflict occurs, the counter is incremented, and the left boundary of the backoff interval is moved to the left to increase the backoff interval, and at the same time reduce the average backoff time, which makes the backoff node have a higher probability of success in the next transmission. As the backoff counter continues to increase, more backoff space can be provided for relatively congested networks; after the data is successfully sent, the value of the backoff counter decreases at a faster rate in a negative exponent idempotent manner to quickly reduce network pressure.

II、网络传输速率动态控制协议设计II. Design of dynamic control protocol for network transmission rate

所述的网络传输速率动态控制协议,实现了各个节点不同速率的动态调整,其特征在于,首先,通过相应算法确定节点发送数据的动态请求速率,并对其进行标识;然后,对数据传输过程进行实时控制,让节点数据传输按照实时信息交互要求进行调整;再次,优先级的设置和调整策略决定整个传输控制协议的效率,这就需要有完整的逻辑来协调不同优先级的节点;最后,动态速率调整是为了实现节点信息交互的高效性,对不重要节点采集到的实时信息进行压缩融合,除去冗余的、无实用性的高精度数据,同时为重要节点数据留出更多的网络带宽,保证重要节点间的高速信息交互。The network transmission rate dynamic control protocol realizes the dynamic adjustment of different rates of each node, and is characterized in that, firstly, the dynamic request rate of the node sending data is determined through a corresponding algorithm, and is identified; then, the data transmission process Carry out real-time control, so that node data transmission can be adjusted according to the requirements of real-time information interaction; again, the priority setting and adjustment strategy determine the efficiency of the entire transmission control protocol, which requires a complete logic to coordinate nodes with different priorities; finally, Dynamic rate adjustment is to realize the high efficiency of node information interaction, compress and fuse the real-time information collected by unimportant nodes, remove redundant and impractical high-precision data, and reserve more network space for important node data Bandwidth ensures high-speed information exchange between important nodes.

为了提高网络节点在数据请求速率存在差异情况下的信息交互效率,各个节点必须维护一份节点优先级分类列表,并在此基础上动态生成一组用于分配数据信息交互时隙的节点列表,从而让不同优先级的节点在一个信息交互周期内拥有多次发送数据的机会,让信息交互频率得到较大幅度提升;在采集到数据后,各个节点需对数据信息进行分布式检测,并按当前优先级与节点实时数据采集速率的关系进行数据压缩融合,为节点信息交互所需发送的数据提供更高效的信息。In order to improve the information interaction efficiency of network nodes in the case of differences in data request rates, each node must maintain a node priority classification list, and on this basis, dynamically generate a set of node lists for allocating data information interaction time slots, In this way, nodes with different priorities have the opportunity to send data multiple times within an information interaction cycle, and the frequency of information interaction is greatly improved; after collecting data, each node needs to perform distributed detection on the data information, and press The relationship between the current priority and the real-time data collection rate of the node is compressed and fused to provide more efficient information for the data sent by the node for information interaction.

所述的网络传输速率动态控制协议,在于:参加信息交互的每个节点拥有独立的动态传输速率和独立的数据请求速率,实现了不同数据的实时性要求,为网络节点行为的独立性和定制性提供了必要的基础框架。The network transmission rate dynamic control protocol lies in that: each node participating in information exchange has an independent dynamic transmission rate and an independent data request rate, which realizes the real-time requirements of different data, and provides for the independence and customization of network node behavior. Sexuality provides the necessary basic framework.

附图说明Description of drawings

图1为信道接入协议与标准网络分层结构协议栈的关系Figure 1 shows the relationship between the channel access protocol and the standard network layered structure protocol stack

图2为网络建立流程图Figure 2 is a flow chart of network establishment

图3为节点状态转换关系Figure 3 shows the node state transition relationship

图4为完整周期时隙图Figure 4 is a complete cycle time slot diagram

图5为退避区间示意图Figure 5 is a schematic diagram of the backoff interval

具体实施方式Detailed ways

下面结合附图与具体实施方式对本发明作进一步详细描述:Below in conjunction with accompanying drawing and specific embodiment the present invention is described in further detail:

信道接入协议是无线信息交互网络协议的基础,位于无线网络协议栈结构的最底层,紧邻物理层,如图1所示,它直接控制节点接入无线信道的时间以及各种报文在信道上的传输行为,规定了无线节点接入无线信道的整个过程,决定了无线通信网络的整体性能。所述的高效无线信息交互网络协议,具体的,是以无线自组织网络的物理层为基础,应用信息交互技术设计无线信道接入协议,同时提出基于自动优先级调整的网络传输速率动态控制协议。所述的高效无线信息交互网络协议具体包括如下两个方面:The channel access protocol is the basis of the wireless information exchange network protocol. It is located at the bottom of the wireless network protocol stack structure, next to the physical layer. The transmission behavior on the network specifies the whole process of wireless nodes accessing the wireless channel and determines the overall performance of the wireless communication network. Specifically, the efficient wireless information interaction network protocol is based on the physical layer of the wireless self-organizing network, and uses information interaction technology to design a wireless channel access protocol, and proposes a network transmission rate dynamic control protocol based on automatic priority adjustment . The high-efficiency wireless information interaction network protocol specifically includes the following two aspects:

I、无线信息交互网络信道接入协议设计I. Design of Channel Access Protocol for Wireless Information Interaction Network

所述的无线信息交互网络信道接入协议具体包括如下步骤:The wireless information exchange network channel access protocol specifically includes the following steps:

步骤A、自组织组网Step A. Ad hoc networking

无线信息交互网络采用自组织的组网方式,从节点上电初始化至整个网络的完全建立包含如下步骤:The wireless information interaction network adopts a self-organizing networking method. From node power-on initialization to the complete establishment of the entire network, the following steps are included:

网络探测:节点初始化完成后,主程序跳转到网络协议的网络初始化部分,并开始进行网络探测。通过网络探测,从低频率信道往高频率信道依次扫描占用情况,当扫描到信道被占时,说明该信道存在已建立的网络。对该信道进行一个完整周期的监听,获取信道内所有节点的地址及实时数据信息,进入节点加入步骤;若检测到该信道未被占用,则随机退避一段时间后成为该信道内的主节点,并周期性发送自身节点实时数据信息,等待其它节点加入。Network detection: After the node initialization is completed, the main program jumps to the network initialization part of the network protocol and starts network detection. Through network detection, the occupancy status is scanned sequentially from low-frequency channels to high-frequency channels. When the channel is occupied, it means that there is an established network on this channel. Monitor the channel for a complete cycle, obtain the addresses and real-time data information of all nodes in the channel, and enter the node joining step; if it is detected that the channel is not occupied, it will randomly back off for a period of time and become the master node in the channel. And periodically send real-time data information of its own nodes, waiting for other nodes to join.

节点加入:节点探测完成后,获得信道占用信息,选择存在网络的信道,监听该信道内节点是否已经满员,若已经满员,探测下一信道;若未满员,则在所有在线节点进行数据交互的预留时隙发送上线信息,并将自己的地址自动编号为当前在线节点中未使用的最小节点编号,其它在线节点在收到该节点的上线信息后更新在线节点列表,重新同步时序,由最小编号节点开始进行数据发送。Node joining: After the node detection is completed, obtain channel occupancy information, select a channel that exists in the network, and monitor whether the node in the channel is full. If it is full, detect the next channel; if it is not full, perform data interaction on all online nodes. Reserve time slots to send online information, and automatically number its own address as the smallest node number that is not used among the current online nodes. The numbered node starts to send data.

节点离开:节点离开分为正常离线和意外离线。正常离线时,节点在自身数据发送时隙发送离线通知消息,其它节点在收到离线通知消息后,将该节点从各自在线节点列表中删除;意外离线时,节点来不及发送离线通知消息,在该节点的数据发送时隙,其它节点检测到其未发送数据,判断其为意外离线,并将其从在线节点列表中删除。Node leaving: Node leaving is divided into normal offline and accidental offline. When the node is offline normally, the node sends an offline notification message in its own data sending time slot, and other nodes delete the node from their respective online node lists after receiving the offline notification message; The node's data transmission time slot, other nodes detect that it has not sent data, judge it as an accidental offline, and delete it from the online node list.

节点编号通过计算自动获得,由两个部分构成,分别是信道编号和网络地址,通过1个双字节的16位二进制数表示,高8位为信道编号,低8位为网络地址。图2为网络建立过程。The node number is automatically obtained through calculation and consists of two parts, namely the channel number and the network address. It is represented by a double-byte 16-bit binary number. The upper 8 bits are the channel number and the lower 8 bits are the network address. Figure 2 shows the network establishment process.

步骤B、信道接入控制方法Step B, channel access control method

为了使得所述的信道接入协议稳定、可靠地工作,需要明确定义节点的行为,以控制节点在不同的状态下,收到不同报文数据时做出不同的反应。网络节点具体包括如下5种状态:In order to make the channel access protocol work stably and reliably, the behavior of the nodes needs to be clearly defined, so as to control the nodes to make different responses when receiving different message data in different states. Network nodes specifically include the following five states:

协议初始化:该状态为节点上电后自动进入的状态,节点在此时进行信道探测,并随机竞争临时主节点。一旦探测到信道繁忙、竞争成为临时主节点、竞争失败等事件,则退出该状态。Protocol initialization: This state is the state that the node automatically enters after power-on. At this time, the node performs channel detection and randomly competes for the temporary master node. Once it detects that the channel is busy, competing to become a temporary master node, or failing to compete, it will exit this state.

临时主节点:当节点在竞争中获胜成为临时主节点时,自动生成网络地址0x00,并将本地址加入在线节点列表,同时按周期发送本地数据信息;临时主节点收到新上线节点的上线请求后,将该节点地址加入在线节点列表,在预留时隙发送网络节点更新指令,新加入节点收到该消息后确认已加入网络,否则继续等待一个信息交互周期,再次发送上线请求。临时主节点是可以变化的,任何节点可以成为临时主节点,保证其编号为网内最小即可。Temporary master node: When the node wins the competition and becomes the temporary master node, the network address 0x00 is automatically generated, and this address is added to the online node list, and local data information is sent periodically; the temporary master node receives the online request of the new online node Finally, add the node address to the online node list, and send a network node update command in the reserved time slot. After receiving the message, the newly added node confirms that it has joined the network. Otherwise, continue to wait for an information interaction cycle and send the online request again. The temporary master node can be changed. Any node can become the temporary master node, as long as its number is the smallest in the network.

等待加入:如果同时上线的节点有多个,那么在一个信息交互周期内将不能全部加入网络,加入竞争失败的节点将由初始化状态转到等待加入状态;该状态中的节点会在下一个预留时隙发送上线请求,在收到临时主节点的确认消息后,进入在线成员状态。Waiting to join: If there are multiple nodes that are online at the same time, they will not all be able to join the network within an information exchange cycle, and the nodes that fail to join the competition will change from the initialization state to the waiting to join state; the nodes in this state will be in the next reservation. Send an online request every slot, and enter the online member state after receiving the confirmation message from the temporary master node.

在线成员:当节点确认已经加入网络后,节点的状态自动更改为在线成员;在线成员节点按照预定时序依次发送数据信息,并在数据信息中加入指令,以便灵活转换到其它状态。Online member: When the node confirms that it has joined the network, the status of the node is automatically changed to an online member; the online member node sends data information in sequence according to the predetermined timing, and adds instructions to the data information to flexibly switch to other states.

休眠:节点在发送休眠指令后,进入休眠状态,保留其节点地址,且不从在线节点列表中删除,只被动接收其它节点数据;唤醒的过程与节点加入的过程相同,但是消息指令不同,且不需要重新生成网络地址。Sleep: After the node sends the sleep command, it enters the sleep state, retains its node address, and does not delete it from the online node list, but only passively receives other node data; the process of waking up is the same as the process of joining the node, but the message command is different, and There is no need to regenerate network addresses.

信道接入的控制涉及到上述的每一种状态,利用这些状态的合理转化,可以实现信道争用时的逻辑协调,达到较高的网络效率和良好的稳定性,状态之间的转换关系如图3所示。The control of channel access involves each of the above-mentioned states. Using the reasonable conversion of these states, the logical coordination during channel contention can be realized to achieve high network efficiency and good stability. The transition relationship between states is shown in the figure 3.

所述的信道接入控制方法需要进行网络节点的时隙划分和时钟同步。所述的时隙划分与硬件性能参数存在对应关系,现有的250kb/s无线模块发送一个16byte数据帧所需的实际时间为0.6835ms。所述的时隙划分,其特征在于,时隙的基本长度单位为1ms。当网络内节点数上限为8个时,信息交互速度可达到100Hz以上,预留2个时隙作为节点加入和临时主节点对网络的控制,及向低频率信道发送数据使用。当存在N个节点时,完成一个周期的信息交互一共需要(N+2)ms。图4为一个完整周期的时隙图。The channel access control method requires time slot division and clock synchronization of network nodes. There is a corresponding relationship between the time slot division and the hardware performance parameters, and the actual time required for the existing 250kb/s wireless module to send a 16byte data frame is 0.6835ms. The time slot division is characterized in that the basic length unit of the time slot is 1 ms. When the upper limit of the number of nodes in the network is 8, the information interaction speed can reach more than 100Hz, and 2 time slots are reserved for node joining and temporary master node control of the network, and for sending data to low-frequency channels. When there are N nodes, it takes (N+2) ms to complete a cycle of information exchange. Figure 4 is a time slot diagram of a complete cycle.

所述的时钟同步开始于随机竞争产生临时主节点之后,其特征在于,在没有节点加入时,临时主节点周期性的发送自身数据信息。要加入的节点收到该数据信息后进入同步状态,在预留时隙中进行随机竞争,发送上线请求,完成上线节点与临时主节点时间的同步。新节点加入网络后,在下一个信息交互周期开始时,进行新的全局时间同步。临时主节点在接收到上线请求后立即发送一个网络更新消息,以确认请求节点的加入,同时同步所有在线节点,并更新在线节点列表。The clock synchronization starts after the temporary master node is generated by random competition, and is characterized in that, when no node joins, the temporary master node periodically sends its own data information. The node to join enters the synchronization state after receiving the data information, conducts random competition in the reserved time slot, sends an online request, and completes the time synchronization between the online node and the temporary master node. After a new node joins the network, a new global time synchronization is performed at the beginning of the next information exchange cycle. After receiving the online request, the temporary master node immediately sends a network update message to confirm the joining of the requesting node, and simultaneously synchronizes all online nodes and updates the online node list.

在正常的信息交互周期中,为避免微小差异不断叠加,设计两组定时器,一组用于单位时隙校准,一组用于周期同步。在每个节点发送数据信息后,其余节点进行一次时隙计时器清零,保证每个节点发送时隙的准确性,同时为整个周期节省一部分时间。周期同步主要依赖于在线节点列表,当检测到该网络内最大编号的节点发送完数据信息,则进入预留时隙,长度为2ms。为了获得更好的网络效率,并让临时主节点有足够时间向下级信道发送本网络的数据信息,预留时隙可以动态延长至一个完整周期,最大时间长度可以到周期计时器的上限10ms。临时主节点在预留时隙的发送任务完成后,即开始进入新一轮信息交互周期。In the normal information exchange cycle, in order to avoid the continuous superposition of small differences, two sets of timers are designed, one set is used for unit time slot calibration, and the other set is used for cycle synchronization. After each node sends data information, the other nodes perform a time slot timer reset to ensure the accuracy of each node's sending time slot and save part of the time for the entire cycle. Periodic synchronization mainly depends on the online node list. When it is detected that the node with the largest number in the network has sent data information, it will enter a reserved time slot with a length of 2ms. In order to obtain better network efficiency and allow the temporary master node to have enough time to send the data information of the network to the lower channel, the reserved time slot can be dynamically extended to a complete cycle, and the maximum length of time can reach the upper limit of the cycle timer 10ms. After the temporary master node completes the sending task of the reserved time slot, it starts to enter a new round of information interaction cycle.

所述的信道接入控制方法,需要两种数据帧格式,一种用于网络协调控制,一种用于数据信息传输。网络控制帧数据结构如表1所示,其中数值均用16进制数表示,长度为8byte。数据第1byte为帧头,其固定值为0xC0,作为起始标识;第2byte为源节点信道编号,第3byte为源节点网络地址,2、3byte共同构成源节点在整个网络中的唯一地址;第4、5byte构成目标节点在网络中的唯一地址;第6、7byte为控制指令,其中第6byte为信道接入控制指令、第7byte为路由控制指令;第8byte为帧尾标识,固定值为0xE0。网络控制帧由临时主节点发出,用于节点的加入和退出、同步信息交互周期、数据发送控制、多信道数据传输控制、多信道全局路由。The channel access control method requires two data frame formats, one for network coordination control and one for data information transmission. The data structure of the network control frame is shown in Table 1, where the values are expressed in hexadecimal numbers, and the length is 8 bytes. The 1st byte of the data is the frame header, and its fixed value is 0xC0, which is used as the initial identifier; the 2nd byte is the channel number of the source node, the 3rd byte is the network address of the source node, and 2 and 3 bytes together constitute the unique address of the source node in the entire network; 4. The 5byte constitutes the unique address of the target node in the network; the 6th and 7bytes are control commands, of which the 6th byte is a channel access control command, and the 7th byte is a routing control command; the 8th byte is a frame end identifier, with a fixed value of 0xE0. The network control frame is sent by the temporary master node, and is used for node joining and exiting, synchronous information exchange cycle, data transmission control, multi-channel data transmission control, and multi-channel global routing.

表1网络控制帧数据结构Table 1 Network control frame data structure

Figure BSA0000094648660000061
Figure BSA0000094648660000061

表中,zhetou表示帧头,yjdxdbh表示源节点信道编号,yjdwldz表示源节点网络地址,mbjdxdbh表示目标节点信道编号,mbjdwldz表示目标节点网络地址,xdjrkzzl表示信道接入控制指令,lykzzl表示路由控制指令,zhewei表示帧尾。In the table, zhetou represents the frame header, yjdxdbh represents the channel number of the source node, yjdwldz represents the network address of the source node, mbjdxdbh represents the channel number of the target node, mbjdwldz represents the network address of the target node, xdjrkzzl represents the channel access control command, lykzzl represents the routing control command, zhewei indicates the end of the frame.

数据帧用于数据信息的传输,帧头为0XD0,同时也附带2个byte的命令用于传输控制,其数据结构前7byte与网络控制帧相同,第8byte开始,为数据信息。普通数据帧长度为16byte,即第8至第15byte为数据信息,第6byte为帧尾标识0xE0,为了便于后期扩展和较长数据的发送,数据帧可以自动调整其发送长度,最大可达到32byte,这样发送时长可以控制在2个预留时隙内。数据帧的数据结构见表2。The data frame is used for the transmission of data information, the frame header is 0XD0, and it also comes with 2 byte commands for transmission control. The first 7 bytes of its data structure are the same as the network control frame, and the 8th byte starts with data information. The length of a normal data frame is 16 bytes, that is, the 8th to 15th bytes are data information, and the 6th byte is the frame end mark 0xE0. In order to facilitate later expansion and longer data transmission, the data frame can automatically adjust its transmission length, up to 32 bytes. In this way, the sending duration can be controlled within 2 reserved time slots. The data structure of the data frame is shown in Table 2.

表2数据帧数据结构Table 2 Data frame data structure

Figure BSA0000094648660000062
Figure BSA0000094648660000062

表中,cskzzllb表示传输控制指令类别,cskzzlsz表示传输控制指令数值,sjxx表示数据信息。In the table, cskzzllb represents the type of the transmission control command, cskzzlsz represents the value of the transmission control command, and sjxx represents the data information.

步骤C、信道接入协议的退避算法Step C, the backoff algorithm of the channel access protocol

所述的无线信息交互网络,对时序进行了严格同步,在2个预留时隙阶段存在多个节点争用信道的情况:临时主节点需要发送网络控制和网络更新信息、节点发送上线、下线请求、跨信道的通信。这类数据的冲突是突发性的,而且数量并不大。所述的信道接入协议的退避算法,其特征为,所设定的退避计数器的值与退避时间、区间相关,而不是单纯的退避时间长度;其次,最大退避区间长度为1个时隙;退避算法的Fmc和Fdec函数如下:The wireless information interaction network mentioned above strictly synchronizes the time sequence, and there are multiple nodes competing for the channel in the two reserved time slot stages: the temporary master node needs to send network control and network update information, and the node sends online and offline information. Line requests, cross-channel communication. Such data conflicts are sudden, and the number is not large. The backoff algorithm of the channel access protocol is characterized in that the set backoff counter value is related to the backoff time and interval, rather than the simple backoff time length; secondly, the maximum backoff interval length is 1 time slot; The F mc and F dec functions of the backoff algorithm are as follows:

Fmc=Min(α×counter,MAX)F mc =Min(α×counter,MAX)

Ff decdec == MaxMax (( countercounter ,, MINMIN ))

Finc用于增加退避计数器的值,Fdec用于减少退避计数器的值。F inc is used to increase the value of the backoff counter, and F dec is used to decrease the value of the backoff counter.

设定默认退避区间为[0.5ms~1.0ms],当冲突发生时,计数器递增,退避区间的左边界左移使退避区间增大,同时使平均退避时长减小,这就让退避的节点在下一次发送的时候成功概率更大,随着退避计数器的继续增大,也为比较拥堵的网络提供更大的退避空间;数据发送成功后,采用负指数幂等方式快速递减退避计数器的数值,以迅速减轻网络压力。退避区间示意图如图5所示。Set the default backoff interval to [0.5ms~1.0ms]. When a conflict occurs, the counter is incremented, and the left boundary of the backoff interval is moved to the left to increase the backoff interval and decrease the average backoff time, which makes the backoff node in the next The probability of success is higher when sending once. As the backoff counter continues to increase, it also provides more backoff space for congested networks; Quickly reduce the pressure on the network. The schematic diagram of the back-off interval is shown in Figure 5.

II、网络传输速率动态控制协议设计II. Design of dynamic control protocol for network transmission rate

所述的网络传输速率动态控制协议,是通过优先级调整策略和动态速率控制策略实现的。具体的,是在节点加入网络后,通过各个节点的上线信息和实时信息交互,自动生成一个所有数据发送请求速率相同的在线节点列表。为了实现不同节点可以拥有不同的数据发送请求速率,将节点的数据发送状态设置为0~7一共8个优先级。在所有节点数据发送请求速率相同的情况下,每个节点都处于最低的数据发送优先级,即0级,按照所述的信道接入协议进行信息交互;当节点根据当前应用的需要,需改变其发送数据请求速率时,更改数据帧中的数据传输控制指令,并广播到整个信道,在本周期信息交互完成后,生成新的数据发送节点列表,并按新列表进行下一周期的信息交互。The network transmission rate dynamic control protocol is realized through a priority adjustment strategy and a dynamic rate control strategy. Specifically, after a node joins the network, an online node list with the same data sending request rate is automatically generated through the online information and real-time information interaction of each node. In order to realize that different nodes can have different data transmission request rates, the data transmission status of the nodes is set to 8 priorities in total from 0 to 7. In the case of the same data transmission request rate of all nodes, each node is at the lowest data transmission priority, that is, level 0, and performs information exchange according to the channel access protocol; when the node needs to change according to the needs of the current application When it sends the data request rate, it changes the data transmission control command in the data frame and broadcasts it to the entire channel. After the information interaction in this cycle is completed, a new list of data sending nodes is generated, and the next cycle of information interaction is carried out according to the new list. .

数据发送节点列表的生成策略:假设信道内节点数为N,单位时隙长度为Δt,各个节点的编号为i(0~N-1),各节点的数据发送优先级为p(i)。数据发送节点列表第一段为所有在线节点列表,第二段为优先级为1以上的所有节点列表,第p段为优先级为p-1以上的节点列表,所有列表依次连接成为一个数据发送节点列表,加上2个预留时隙,构成一个完整的信息交互周期。生成的数据发送节点列表一共包含的发送时隙数量为Nt,一个数据交互周期的长度为Nt+2xΔt,其中:The generation strategy of the data sending node list: Assume that the number of nodes in the channel is N, the length of the unit time slot is Δt, the number of each node is i(0~N-1), and the data sending priority of each node is p(i). The first section of the data sending node list is a list of all online nodes, the second section is a list of all nodes with a priority of 1 or higher, and the pth section is a list of nodes with a priority of p-1 or higher. All lists are connected in turn to form a data transmission The node list, plus 2 reserved time slots, constitute a complete information exchange cycle. The generated data sending node list contains a total of N t sending time slots, and the length of a data interaction cycle is N t +2xΔt, where:

NN tt == ΣΣ ii == 00 NN -- 11 (( pp ii ++ 11 ))

编号为i=n的节点其优先级为pn,在一个完整的数据交互周期内,一共发送pn+1次,则节点n的发送频率为fnThe node numbered i=n has a priority of p n . In a complete data interaction cycle, a total of p n +1 times is sent, and the sending frequency of node n is f n :

ff nno == pp nno ++ 11 (( 22 ++ ΣΣ ii == 00 NN -- 11 (( pp ii ++ 11 )) )) ×× ΔtΔt

这就为节点的数据请求速率和优先级直接建立了一个映射关系,节点根据应用所需求的数据请求速率,结合当前所获取的信道内节点总数N、其它各节点的数据发送优先级,就可以求出本节点在该数据请求速率下的优先级设定值pn,pn向上取整。This directly establishes a mapping relationship between the data request rate and priority of the node. According to the data request rate required by the application, the node can combine the total number of nodes in the channel currently obtained N and the data transmission priority of other nodes. Calculate the priority setting value p n of this node at the data request rate, p n is rounded up.

根据上述所设计的优先级调整方法,其它节点也可以通过此方式进行优先级调整,从而实现节点数据请求速率的动态控制。According to the priority adjustment method designed above, other nodes can also perform priority adjustment in this way, so as to realize the dynamic control of the node data request rate.

所述的网络传输速率动态控制协议,参加信息交互的每个节点拥有独立的动态传输速率,独立的数据请求速率,实现了不同数据的实时性要求,为网络节点行为的独立性和定制性提供必要的基础框架,这对于实际信息交互网络系统的开发具有重要的意义。In the network transmission rate dynamic control protocol, each node participating in information exchange has an independent dynamic transmission rate and an independent data request rate, which realizes the real-time requirements of different data and provides independence and customization for network node behavior. It is a necessary basic framework, which is of great significance to the development of the actual information interaction network system.

根据所述的信道接入协议和基于自动优先级的网络动态速率传输控制协议,实现无线高效信息交互网络的主要过程表述如下:According to the channel access protocol and the network dynamic rate transmission control protocol based on automatic priority, the main process of realizing the wireless high-efficiency information interaction network is expressed as follows:

所述的无线高效信息交互网络协议运行于CC2530等无线射频模块中,传感器数据以串口总线形式传输到无线射频模块中。The wireless high-efficiency information interaction network protocol runs in wireless radio frequency modules such as CC2530, and sensor data is transmitted to the wireless radio frequency module in the form of serial bus.

模块上电完成硬件初始化后,开始运行协议程序。根据协议设计,节点首先进行信道扫描,由于之前在射频模块传输范围内不存在其它网络,因此选择0号信道,进行随机退避竞争为临时主节点,生成网络地址0x00,并按时序定时发送网络控制帧,发送目标为信道内所有节点,此时建立一个只有临时主节点的网络。未成功竞争成为临时主节点的节点和新上电的节点,在检测到有网络的信道之后,选择该信道,并进入等待加入状态。临时主节点发送网络控制帧一个周期后,完成周期同步,同时将临时主节点的地址加入在线节点列表,自动生成网络地址0x01。等待加入的节点在预留时隙按照退避算法进行上线请求数据帧的发送,成功发送的节点将被临时主节点所捕捉。临时主节点会立即回复一个网络控制帧,提示网络节点已经更新,作为对新加入节点的确认。该网络控制帧发送之后,网络进入第一个信息交互周期,临时主节点和新加入节点开始按照在线节点列表发送数据信息。其它需要加入网络的节点利用后面每个周期末尾的预留时隙,按照相同方式加入网络,直至信道内节点上限。超出节点上限的节点,转换至另一可用频率信道,开始临时主节点的随机退避竞争。After the module is powered on and completes the hardware initialization, it starts to run the protocol program. According to the protocol design, the node first scans the channel. Since there is no other network in the transmission range of the radio frequency module before, it selects channel 0, performs random backoff competition to become the temporary master node, generates the network address 0x00, and sends the network control according to the timing Frame, the sending target is all nodes in the channel, at this time, a network with only temporary master nodes is established. The nodes that have not successfully competed to become the temporary master node and the nodes that are newly powered on, after detecting a channel with a network, select the channel and enter the waiting to join state. After the temporary master node sends the network control frame for one cycle, the cycle synchronization is completed, and at the same time, the address of the temporary master node is added to the online node list, and the network address 0x01 is automatically generated. The nodes waiting to join will send the online request data frame according to the back-off algorithm in the reserved time slot, and the nodes that successfully send it will be captured by the temporary master node. The temporary master node will immediately reply a network control frame, prompting that the network node has been updated, as a confirmation of the newly joined node. After the network control frame is sent, the network enters the first information interaction cycle, and the temporary master node and the newly joined node start to send data information according to the online node list. Other nodes that need to join the network use the reserved time slots at the end of each cycle to join the network in the same way until the upper limit of nodes in the channel. Nodes that exceed the upper limit of nodes switch to another available frequency channel and start random backoff competition for temporary master nodes.

在网络内存在2个以上节点时,信息交互开始进行,基于自动优先级的网络动态速率传输控制协议开始作用于数据传输过程。应用程序通过无线信息交互协议预留接口参数,向节点提出提升数据信息交互请求速率的要求,协议接收到该参数后,利用对信道内网络的监听,获取其它节点的实时数据发送优先级。根据协议原理,计算出需要设置的数据发送优先级,在当前周期内发送自身数据的时隙,将带有优先级调整的数据传输控制指令的数据帧发送出去。下一个数据交互周期时,就会按照新生成的数据传输节点列表进行数据交互,实现节点的高速信息交互和数据信息请求速率的动态调整。When there are more than 2 nodes in the network, information exchange starts, and the network dynamic rate transmission control protocol based on automatic priority starts to act on the data transmission process. The application program reserves interface parameters through the wireless information exchange protocol, and requests nodes to increase the rate of data information exchange requests. After receiving the parameters, the protocol uses the monitoring of the network in the channel to obtain the real-time data transmission priority of other nodes. According to the principle of the protocol, calculate the data transmission priority that needs to be set, and send the data frame with the data transmission control instruction for priority adjustment in the time slot for sending its own data in the current cycle. In the next data interaction cycle, data interaction will be performed according to the newly generated data transmission node list to realize high-speed information interaction of nodes and dynamic adjustment of data information request rate.

无线信息实时交互技术在实际应用中,不同数据往往有不同的实时性要求,关键在于网络中的每一个节点通过信息交互获得周围其它所有节点的信息。本发明公布了一种高效无线信息交互网络协议的设计方法,针对信息交互技术设计了无线信道接入协议,使无线信息交互网络具有更好的实时性,更适合处理实时交互信息和突发信息;同时,提出了基于自动优先级调整的网络传输速率动态控制协议,该协议通过对网内节点进行不同优先级的动态调整,合理分配网络带宽,按需求控制不同节点的速率,具有广泛的适应性和通用性。所述的高效无线信息交互网络协议,实现了节点间的高效信息交互并保证了良好的服务质量,为无线信息交互技术建立了完整的框架结构。In the practical application of wireless information real-time interaction technology, different data often have different real-time requirements. The key is that each node in the network obtains the information of all other nodes around it through information interaction. The invention discloses a design method of an efficient wireless information interaction network protocol, and designs a wireless channel access protocol for information interaction technology, so that the wireless information interaction network has better real-time performance and is more suitable for processing real-time interaction information and burst information ; At the same time, a dynamic network transmission rate control protocol based on automatic priority adjustment is proposed. This protocol dynamically adjusts the different priorities of nodes in the network, allocates network bandwidth reasonably, and controls the speed of different nodes according to requirements. It has a wide range of adaptability and versatility. The high-efficiency wireless information interaction network protocol realizes efficient information interaction between nodes and ensures good service quality, and establishes a complete framework structure for wireless information interaction technology.

如上所述,结合附图和说明所给出的方案内容,可以衍生出类似的技术方案。但凡是依据本发明的技术实质所作的任何简单修改、等同变化与修饰,均仍属于本发明技术方案的范围内。As mentioned above, similar technical solutions can be derived in combination with the solutions presented in the drawings and descriptions. However, any simple modifications, equivalent changes and modifications made according to the technical essence of the present invention still fall within the scope of the technical solutions of the present invention.

Claims (3)

1. the method for designing of an efficient wireless information interaction procotol, it is characterized in that the method comprises wireless information interaction network channel access protocol and network dynamic rate transmission control protocol, described wireless information interaction network channel access protocol, its key step comprises:
(1) ad hoc networking.It is characterized in that, at network node, power on, after initialization completes, start to carry out network detection, from channel of low frequency toward the high-frequency channel, scan successively the situation of taking, according to different channel occupancy situations, make corresponding decision, use respective logic algorithm coordinator node adition process and node departure process.Described node adition process, is characterized in that, after node has been surveyed, obtains channel occupancy information, selects to exist the channel of network, reaches suitable node and add strategy, guarantees that node successfully adds network.Described node leaves and is divided into normal off-line and unexpected off-line, it is characterized in that, normal off-line is arranged to different strategies from unexpected off-line, guarantees that the off-line node does not affect the normal operation of other line node in network, does not affect structure and the network performance of network.
(2) channel access control method.It is characterized in that, the behavior of node is defined as to five kinds of states, set node under different conditions, the reaction of making while receiving different message data makes described channel access protocol stablize, work reliably:
Protocol initializing: this state is the node rear state automatically entered that powers on, and node carries out the interim host node of channel detection and random competition at this moment.
Interim host node: node is won in competition become interim host node, and the automatic generating network address sends local data information by the cycle; Simultaneously, interim host node is received after reaching the standard grade of the node of newly reaching the standard grade asked and is sent command adapted thereto, maintains network order.
Etc. to be added: a plurality of if the node of reaching the standard grade simultaneously has, the node of the interim master node failure of competition will the state to be added such as forward to by init state, and the node in this state, according to the instruction message of interim host node, enters online member condition subsequently.
Online member: after node added network, the state of node changed to online member, and online member node sends data message successively according to scheduled timing, and can in data message, add instruction.
Dormancy: node, after sending the dormancy instruction, enters resting state, and this state is mainly again add online member and save power consumption for convenient, and saves unnecessary function.
(3) back off algorithm of channel access protocol.It is characterized in that, according to back off time, the interval value of setting backoff counter.When conflict occurs, counter increases progressively, the left margin of avoidance sector moves to left avoidance sector is increased, making simultaneously on average to keep out of the way duration reduces, thereby increase, keep out of the way the probability of success of node when next time sending, continuation increase along with backoff counter, also provide the larger space of keeping out of the way for the network relatively blocked up; After data send successfully, adopt negative exponent idempotent form with fast speed, to delete the value of backoff counter, thereby alleviate rapidly network pressure.
2. according to claim 1, described network dynamic rate transmission control protocol, is characterized in that, realized the dynamic adjustment of each node different rates.At first, by corresponding algorithm, determine that node sends the dynamic requests speed of data, and it is identified; Then, data transmission procedure is controlled in real time, allowed the transfer of data of node adjust according to the real-time information interaction demand; Again, the node that complete adjustment strategy is coordinated different priorities is set; Finally, the real time information that unessential node collects is compressed to fusion, remove redundancy, without the high accuracy data of practicality, for the data of important node reserve the more network bandwidth, the high speed information that guarantees to have between the interdependent node of important information is mutual.In the situation that request of data speed there are differences, in order to improve the information interaction efficiency of network node, each node must be safeguarded a node priority tabulation, and dynamically generates on this basis one group of node listing for distribute data information interaction time slot.
3. according to claim 1, described channel access control method is carried out to the time slot of network node and divide and clock synchronous, guarantee that the information of nodes is carried out alternately according to predefined logic, improve real-time performance and the service quality of network.Simultaneously, for described channel access control method, the design data frame format, for network coordination control and data information transfer.
CN201310392835.1A 2013-09-03 2013-09-03 A kind of method for designing of efficient wireless information interaction procotol Expired - Fee Related CN103415045B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310392835.1A CN103415045B (en) 2013-09-03 2013-09-03 A kind of method for designing of efficient wireless information interaction procotol

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310392835.1A CN103415045B (en) 2013-09-03 2013-09-03 A kind of method for designing of efficient wireless information interaction procotol

Publications (2)

Publication Number Publication Date
CN103415045A true CN103415045A (en) 2013-11-27
CN103415045B CN103415045B (en) 2016-03-02

Family

ID=49608021

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310392835.1A Expired - Fee Related CN103415045B (en) 2013-09-03 2013-09-03 A kind of method for designing of efficient wireless information interaction procotol

Country Status (1)

Country Link
CN (1) CN103415045B (en)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105227349A (en) * 2015-08-27 2016-01-06 北京泰乐德信息技术有限公司 Nomadic MANET dispatching patcher and dispatching method thereof
CN106255137A (en) * 2016-09-18 2016-12-21 南方电网科学研究院有限责任公司 Method and system for improving communication rate of LoRa network
CN106444640A (en) * 2016-11-30 2017-02-22 南京阿凡达机器人科技有限公司 System and method for wireless networking of module inside robot
CN107040284A (en) * 2017-03-27 2017-08-11 西安电子科技大学 A kind of multiple access method for the reliability and stability for improving data transfer
CN108667487A (en) * 2018-05-19 2018-10-16 杭州海兴电力科技股份有限公司 G3 carrier network dynamic adjustment based on priority of registration list and network-building method
CN109218126A (en) * 2017-06-30 2019-01-15 中兴通讯股份有限公司 The method, apparatus and system of monitoring node existing state
CN109561459A (en) * 2018-11-28 2019-04-02 中国运载火箭技术研究院 A kind of sea VHF frequency range self-organizing network data transmission system and method
CN110780630A (en) * 2019-11-25 2020-02-11 广州邦讯信息系统有限公司 Protocol library docking execution system suitable for Internet of things and working method
CN113364838A (en) * 2021-05-26 2021-09-07 中建三局智能技术有限公司 MQTT-based equipment ad hoc network method and system
CN113515543A (en) * 2021-03-23 2021-10-19 广东便捷神科技股份有限公司 Automatic goods picking method and system for unmanned vending machine
CN115002930A (en) * 2022-05-23 2022-09-02 天津市智慧物联信息技术研究院 IEEE802.11ah wireless networking system and communication method for edge intelligent cooperation
CN115604050A (en) * 2022-09-02 2023-01-13 上海机电工程研究所(Cn) Method and system for using CAN-FD bus with adaptive conversion rate
CN116665888A (en) * 2023-07-26 2023-08-29 大安健康科技(北京)有限公司 Traditional Chinese medicine syndrome fine granularity quantitative evaluation method and system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101986728A (en) * 2010-12-15 2011-03-16 山东大学 A cross-layer multicast communication method with high delivery rate and low delay
CN102547584A (en) * 2010-12-13 2012-07-04 浙江海洋学院 Channel access method for ship-mounted wireless mobile Ad-hoc network based on self-organization time division multiple access

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102547584A (en) * 2010-12-13 2012-07-04 浙江海洋学院 Channel access method for ship-mounted wireless mobile Ad-hoc network based on self-organization time division multiple access
CN101986728A (en) * 2010-12-15 2011-03-16 山东大学 A cross-layer multicast communication method with high delivery rate and low delay

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
YUNNAN WU ET AL: "Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast", 《2005 CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS》 *
夏海轮 等: "Ad hoc网络中一种新的退避算法", 《电子科技大学学报》 *
翟建华: "AdHoc网络接入机制与路由协议研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *
赵志峰 等: "Ad hoc网络信道接入技术研究", 《解放军理工大学学报(自然科学版)》 *

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105227349B (en) * 2015-08-27 2018-04-17 北京泰乐德信息技术有限公司 Nomadic ad hoc network dispatches system and its dispatching method
CN105227349A (en) * 2015-08-27 2016-01-06 北京泰乐德信息技术有限公司 Nomadic MANET dispatching patcher and dispatching method thereof
CN106255137A (en) * 2016-09-18 2016-12-21 南方电网科学研究院有限责任公司 Method and system for improving communication rate of LoRa network
CN106255137B (en) * 2016-09-18 2019-08-27 南方电网科学研究院有限责任公司 Method and system for improving communication rate of LoRa network
CN106444640A (en) * 2016-11-30 2017-02-22 南京阿凡达机器人科技有限公司 System and method for wireless networking of module inside robot
CN107040284B (en) * 2017-03-27 2020-10-02 西安电子科技大学 A Multiple Access Method for Improving Reliability and Stability of Data Transmission
CN107040284A (en) * 2017-03-27 2017-08-11 西安电子科技大学 A kind of multiple access method for the reliability and stability for improving data transfer
CN109218126A (en) * 2017-06-30 2019-01-15 中兴通讯股份有限公司 The method, apparatus and system of monitoring node existing state
CN109218126B (en) * 2017-06-30 2023-10-17 中兴通讯股份有限公司 Method, device and system for monitoring node survival state
CN108667487A (en) * 2018-05-19 2018-10-16 杭州海兴电力科技股份有限公司 G3 carrier network dynamic adjustment based on priority of registration list and network-building method
CN109561459B (en) * 2018-11-28 2021-11-16 中国运载火箭技术研究院 Offshore VHF frequency band self-organizing network data transmission system and method
CN109561459A (en) * 2018-11-28 2019-04-02 中国运载火箭技术研究院 A kind of sea VHF frequency range self-organizing network data transmission system and method
CN110780630A (en) * 2019-11-25 2020-02-11 广州邦讯信息系统有限公司 Protocol library docking execution system suitable for Internet of things and working method
CN113515543A (en) * 2021-03-23 2021-10-19 广东便捷神科技股份有限公司 Automatic goods picking method and system for unmanned vending machine
CN113515543B (en) * 2021-03-23 2024-02-13 广东便捷神科技股份有限公司 Automatic goods picking method and system for vending machine
CN113364838A (en) * 2021-05-26 2021-09-07 中建三局智能技术有限公司 MQTT-based equipment ad hoc network method and system
CN113364838B (en) * 2021-05-26 2022-08-26 中建三局智能技术有限公司 Equipment ad hoc network method and system based on MQTT
CN115002930A (en) * 2022-05-23 2022-09-02 天津市智慧物联信息技术研究院 IEEE802.11ah wireless networking system and communication method for edge intelligent cooperation
CN115002930B (en) * 2022-05-23 2022-12-09 天津市智慧物联信息技术研究院 IEEE802.11ah wireless networking system and communication method for edge intelligent cooperation
CN115604050A (en) * 2022-09-02 2023-01-13 上海机电工程研究所(Cn) Method and system for using CAN-FD bus with adaptive conversion rate
CN115604050B (en) * 2022-09-02 2025-03-04 上海机电工程研究所 Method and system for using CAN-FD bus with adaptive conversion rate
CN116665888A (en) * 2023-07-26 2023-08-29 大安健康科技(北京)有限公司 Traditional Chinese medicine syndrome fine granularity quantitative evaluation method and system

Also Published As

Publication number Publication date
CN103415045B (en) 2016-03-02

Similar Documents

Publication Publication Date Title
CN103415045B (en) A kind of method for designing of efficient wireless information interaction procotol
CN103415018B (en) Communication resource allocation method of wireless sensor network
CN101296249B (en) Media access control method for wireless sensor network
CN101489304B (en) Media access control method based on differentiate service of wireless multimedia sensor network
CN103220216B (en) A kind of wireless body area network route method based on Region dividing
KR100656385B1 (en) Real-time wireless sensor network communication method with linear structure
CN101466161B (en) Data collection method suitable for multi-hop wireless sensor network
CN101557637B (en) Method for realizing cross-layer wireless sensor network medium access control protocol
CN102752844B (en) Multistage distribution method of channel resources of wireless sensor network
CN107682905B (en) A Layerless Communication Method for Starlink Wireless Sensor Networks
CN102196598B (en) An Adaptive Hybrid MAC Protocol for Wireless Sensor Networks
CN102740365B (en) Single-stream bulk data acquisition method suitable for wireless sensor network
CN102946631A (en) Medium access control (MAC) layer node scheduling method based on beacon frame synchronization and communication asynchronization
CN113453304B (en) Self-adaptive synchronous MAC protocol based on virtual clustering and path reservation
CN109673045A (en) Wireless sensor network time slot allocation multi-hop synchronous transmission system and method
CN101547451B (en) Wireless sensor network local region covering algorithm based on delayed start
CN105163394B (en) The implementation method of service-aware SQ-MAC agreements for wireless sensor network
CN106507432B (en) A low-latency and energy-efficient TDMA protocol implementation method for wireless sensor networks
CN109413706B (en) Method for realizing synchronous RM-MAC protocol of reserved multi-hop node
CN106102170A (en) A kind of channel sharing method being applicable to distributed restructural spacecraft
CN112911672B (en) Wireless sensor network resource allocation method based on reliability
KR100846351B1 (en) Virtual Backbone Wireless Sensor Network Data Transmission System
US10999891B2 (en) Method for communicating in multi-MAC-operating environment and IoT apparatus
US8289986B2 (en) Self-organizing resource access apparatus and method in local area network communication environment
Li et al. Research on the impact of interaction times in distributed wireless ad hoc networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160302

Termination date: 20200903

CF01 Termination of patent right due to non-payment of annual fee