WO2015074574A1 - 一种电力线通信网的信道接入控制方法和系统 - Google Patents
一种电力线通信网的信道接入控制方法和系统 Download PDFInfo
- Publication number
- WO2015074574A1 WO2015074574A1 PCT/CN2014/091700 CN2014091700W WO2015074574A1 WO 2015074574 A1 WO2015074574 A1 WO 2015074574A1 CN 2014091700 W CN2014091700 W CN 2014091700W WO 2015074574 A1 WO2015074574 A1 WO 2015074574A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- data
- probability
- primary station
- time slot
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/64—Hybrid switching systems
- H04L12/6418—Hybrid transport
Definitions
- the present invention relates to the field of power communications, and in particular to a channel access control method and system for a power line communication network.
- Low-Voltage Powerline Communications (LPLC) technology as a unique communication technology in the power industry, has a huge advantage of wide coverage and low cost. It is widely used in power users' information collection systems. The field has great application prospects.
- LPLC Low-Voltage Powerline Communications
- the CSMA/CA mechanism In the MAC protocol of the LPLC network, the CSMA/CA mechanism is still widely used.
- the communication node In the competitive CSMA/CA protocol based on the slot window, if there is data to be transmitted, the communication node first randomly selects one in the transmission window. Transmitting a time slot; the communication node then listens to the channel until the randomly selected transmission time slot is heard. If no other node uses the power line channel during this listening period, the node immediately transmits the data; otherwise, the channel is reselected after the channel is idle. Send time slot.
- Three Frame Intervals IFS
- DIFS Distributed Coordination IFS
- the workflow of the CSMA/CA protocol is mainly divided into two parts:
- RTS Request to Send
- CTS Clear to Send
- the existing CSMA/CA mechanism has certain problems: when many nodes simultaneously respond to the query instruction of the primary station and simultaneously send data, it is easy to cause multiple nodes to be busy or idle at the same time, resulting in busy hours. Nodes compete frequently for channels and take a long time to come Adjusting the time window value, the number of retransmissions increases, and the increase in retransmission in higher load networks means a vicious circle of channel contention in the network, resulting in network congestion.
- the present invention is to overcome the problem that the CSMA/CA mechanism channel competition frequently leads to poor communication efficiency in the LPLC network in the prior art. According to an aspect of the present invention, a channel access control method and system for a power line communication network are proposed.
- a channel access control method for a power line communication network includes:
- the primary station divides the time window in which each node transmits data into a plurality of time slots according to the number of nodes of each node that transmits data;
- Each node calculates and compares the probability of transmitting data in each slot, and the node with the highest probability of transmitting data transmits data to the primary station in the corresponding slot.
- the channel access control method of the power line communication network of the present invention combines event driving and probability function to ensure that only one node in the network has the highest probability of transmitting data each time data is transmitted, so it can effectively suppress or reduce Channel contention conflicts.
- the channel access control method of the power line communication network of the invention can effectively reduce the number of data retransmissions, thereby reducing the delay of the power line communication network; and the implementation is relatively simple, and the system complexity is reduced.
- the present invention is to overcome the problem that the CSMA/CA mechanism channel competition frequently leads to communication efficiency and communication quality in the LPLC network in the prior art.
- a channel access control system for a power line communication network is proposed.
- a channel access control system for a power line communication network includes:
- the primary station includes a time slot dividing module, configured to divide the time window for sending data of each node into multiple time slots according to the number of nodes of each node that sends data;
- the node includes a calculation sending module for calculating and comparing the probability of transmitting data in each time slot, and the node having the highest probability of transmitting data transmits data to the primary station in the corresponding time slot.
- the system for channel access control of the power line communication network of the present invention combines event driving and probability function to ensure that only one node in the network has the highest probability of transmitting data each time data is transmitted, so it can effectively suppress or Reduce channel contention conflicts.
- the channel access control system of the power line communication network of the invention can effectively reduce the number of data retransmissions, thereby reducing the delay of the power line communication network; and the implementation is relatively simple, and the system complexity is reduced. degree.
- FIG. 1 is a flowchart showing the operation of a channel access control method of a power line communication network according to an embodiment of the present invention
- FIG. 2 is a flowchart of specific steps of a channel access control method of a power line communication network according to an embodiment of the present invention
- FIG. 3 is a schematic structural diagram of a channel access control system of a power line communication network according to an embodiment of the present invention.
- the present invention proposes a power line communication network channel access control method.
- FIG. 1 is a flowchart of an EDAC operation, and the specific steps are as follows:
- Step 101 Before sending data, each node listens to the channel, and implements access to the channel by responding to an event instruction sent by the primary station;
- Step 102 The primary station sends a discovery instruction to each node, and after receiving the discovery command, each node advances.
- the line initialization process uses the CSMA/CA method to contend for the channel and sends an initialization response frame to the primary station;
- Step 103 After receiving the initialization response frame reported by each node, the primary station sends an allocation instruction to each node, assigns a logical number i to each node, and informs the node number N thereof, and the primary station sends each node according to the number of nodes N.
- the time window of the data is divided into W time slots, at which time each node enters an event waiting state, waiting for the primary station to issue a query instruction;
- Step 104 The primary station sends a query instruction to each node. After receiving the query command, each node enters an event response state, and each node calculates a probability of sending data in each time slot according to the following formula. The following is the i-th node i The probability of sending data in a time slot:
- the value of ⁇ is determined by the number of nodes N and the time slot W:
- Step 105 Comparing the transmission data probability values of each node obtained in step 104 in each time slot, and selecting the node corresponding to the maximum value of the transmission data probability to proceed to step 106;
- Step 106 The node corresponding to the maximum value of the transmitted data probability in step 105 sends a data response frame to the primary station in the corresponding time slot, and sends data through the channel;
- Step 107 After the node corresponding to the maximum value of the transmitted data probability in step 106 sends all the data in the node, the other nodes except the node sequentially send data to the primary station according to the order of the probability of sending the data. After each node sends all the data, the nodes go to the event waiting state, re-receive the query command sent by the master station, calculate and compare the probability of sending data in each time slot, where the node corresponding to the maximum value of the transmitted data probability is Corresponding time slots (the nodes may be the same node or different nodes corresponding to the maximum value of the transmitted data probability in step 105) send data response frames to the primary station, perform data transmission, and perform the processes of steps 104-107.
- Step 201 Before sending the data, each node listens to the channel, and implements access to the channel by responding to an event instruction sent by the primary station;
- Step 202 The primary station sends a discovery command to each node, and after receiving the discovery command, each node performs an initialization process, uses a CSMA/CA manner to contend for the channel, and sends an initialization response frame to the primary station;
- Step 203 After receiving the initialization response frame reported by each node, the primary station sends an allocation instruction to each node, assigns a logical number i to each node, and informs the node number N thereof, and the primary station sends each node according to the number of nodes N.
- the time window of the data is divided into W time slots, at which time each node enters an event waiting state, waiting for the primary station to issue a query instruction;
- Step 204 The primary station sends a query command to each node, and after receiving the query command, each node enters an event response state, and calculates a probability of sending data of each node in each time slot according to the following formula. The following is the i-th node i The probability of sending data in a time slot:
- the value of ⁇ is determined by the number of nodes N and the time slot W:
- Step 205 Each node obtained in step 204 is arranged according to the probability of sending data probability in the transmission data probability value of each time slot, and the order of each node is a, b, c, d, ..., At this time, the node a having the highest probability of sending data is selected to proceed to step 206;
- Step 206 Node a sends a data response frame to the primary station in the corresponding time slot, and sends data through the channel.
- Step 207 After the node a sends all the data in the node, the b, c, d... nodes sequentially send the data in the node. After each node sends all the data, each node goes into the event waiting state, re-receives the query command sent by the primary station, and calculates and compares the probability of sending data in each time slot. According to the probability of sending data, the order of each node may be a, b, c, d..., or b, a, c, d..., and possibly c.
- the node may send a data response frame to the primary station for a or b or c or dituated to send data. After each node sends all the data, it loops. The process of steps 204-207 is performed.
- the channel access control method of the power line communication network of the present invention combines event driving and probability function to ensure that only one node in the network has the highest probability of transmitting data each time data is transmitted, so it can effectively suppress or reduce Channel contention conflicts.
- the channel access control method of the power line communication network of the invention can effectively reduce the number of data retransmissions, thereby reducing the delay of the power line communication network; and the implementation is relatively simple, and the system complexity is reduced.
- the present invention proposes a power line communication network channel access control system.
- a channel access control system for a power line communication network includes a primary station and a node, where:
- the primary station includes a time slot dividing module 301, configured to divide a time window for sending data of each node into multiple time slots according to the number of nodes of each node that sends data;
- the node includes a calculation sending module 302 for calculating and comparing the probability of transmitting data in each time slot, and the node having the highest probability of transmitting data transmits data to the primary station in the corresponding time slot.
- the calculation sending module 302 in the node specifically includes:
- the probability calculation sub-module 3021 is configured to calculate the probability of sending data of each node in each time slot according to the following formula, and the probability function P of the node i transmitting data in the ith time slot is:
- the value of ⁇ is determined by the number of network nodes N and the time slot W:
- the comparison sending sub-module 3022 is configured to compare the transmission data probabilities of the nodes in each time slot, and take the maximum value, and the node corresponding to the maximum value transmits data to the primary station in the corresponding time slot.
- the node further includes:
- the initialization module 303 is configured to: after receiving the discovery command sent by the primary station, perform an initialization process, contend for the channel, report the initialization response frame to the primary station, and receive the node logical number assigned by the primary station.
- the node further includes:
- the event response module 304 is configured to receive a query instruction sent by the primary station after completing the initialization process, and enter an event response state.
- the system for channel access control of the power line communication network of the present invention combines event driving and probability function to ensure that only one node in the network has the highest probability of transmitting data each time data is transmitted, so it can effectively suppress or Reduce channel contention conflicts.
- the channel access control system of the power line communication network of the invention can effectively reduce the number of data retransmissions, thereby reducing the delay of the power line communication network; and the implementation is relatively simple, and the system complexity is reduced.
- the present invention can be embodied in a variety of different forms, and the technical solutions of the present invention are illustrated by taking the figures of FIG. 1 to FIG. 3 as an example, which does not mean that the specific examples applied to the present invention can be limited to In a particular process or embodiment structure, one of ordinary skill in the art will appreciate that the specific embodiments provided above are only a few examples of various preferred uses, and any embodiment embodying the claims of the present invention should be in the present invention. Within the scope of the technical solution.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
Abstract
本发明公开了一种电力线通信网的信道接入控制方法和系统，其中，该方法包括：主站根据发送数据的各节点的节点数，将各节点发送数据的时间窗口划分为多个时隙；各节点计算并比较其在各时隙的发送数据概率，由发送数据概率最大的节点在对应的时隙向主站发送数据。本发明的电力线通信网的信道接入控制方法和系统，通过事件驱动和概率函数相结合的方式，保证每次发送数据竞争时，网络中仅有一个节点发送数据的概率最高，故而能有效抑制或减少信道争用冲突；本发明的电力线通信网的信道接入控制方法和系统，还能有效减少数据重发的次数，故能降低电力线通信网络时延；且实现较为简单，降低系统复杂度。
Description
本发明涉及电力通信领域，具体地，涉及一种电力线通信网的信道接入控制方法和系统。
低压电力线通信(Low-Voltage Powerline Communications，以下简称LPLC)技术作为电力行业特有的通信技术，拥有覆盖范围广、成本低的巨大优势，广泛应用于电力用户用电信息采集系统，在智能配用电领域有着巨大的应用前景。
在LPLC网络的MAC协议中目前广泛采用的仍是CSMA/CA机制，在基于时隙窗口的竞争性CSMA/CA协议中，如果有数据需要发送，通信节点首先在发送窗口内等概率随机选择一个发送时隙；之后通信节点一直侦听信道，直到侦听到该随机选择的发送时隙，如果在此侦听期间内没有其他节点使用电力线信道，节点立即发送数据；否则在信道空闲后重新选择发送时隙。CSMA/CA中定义了3种帧间隔(IFS)，其中DIFS(分布式协调IFS)用于异步帧竞争访问。
CSMA/CA协议的工作流程主要分为两个部分：
1)监听信道状态，等信道空闲维持一段时间后，再等待一段随机的时间后，如果信道依然空闲，才发送数据；如果信道繁忙，则每个节点采用基于二进制指数的随机规避时间，以减少冲突的机会。
2)传送出数据前，先发送一个短帧的请求传送报文(RTS：Request to Send)给目标端，等待目标端回应(CTS：Clear to Send)报文后，才开始传送数据。利用RTS-CTS握手(handshake)程序，确保接下来传送数据帧时，不会被碰撞。
在用电信息采集系统通信应用中，现有的CSMA/CA机制存在一定的问题：当众多节点同时响应主站的查询指令并同时发送数据时，容易造成多节点同时忙或闲，导致忙时节点对信道的竞争频繁，需要经过很长时间来
调整时间窗口值，重传次数的增加，在较高负荷的网络中重传的增加意味着网络中信道争用的恶性循环，以致网络拥塞。
发明内容
本发明是为了克服现有技术中LPLC网络中CSMA/CA机制信道竞争频繁导致通信效率差的问题，根据本发明的一个方面，提出一种电力线通信网的信道接入控制方法和系统。
根据本发明的电力线通信网的信道接入控制方法，包括：
主站根据发送数据的各节点的节点数，将各节点发送数据的时间窗口划分为多个时隙；
各节点计算并比较其在各时隙的发送数据概率，由发送数据概率最大的节点在对应的时隙向主站发送数据。
本发明的电力线通信网的信道接入控制方法，通过事件驱动和概率函数相结合的方式，保证每次发送数据竞争时，网络中仅有一个节点发送数据的概率最高，故而能有效抑制或减少信道争用冲突。
本发明的电力线通信网的信道接入控制方法，能有效减少数据重发的次数，故能降低电力线通信网络时延；且实现较为简单，降低系统复杂度。
本发明是为了克服现有技术中LPLC网络中CSMA/CA机制信道竞争频繁导致通信效率和通信质量不高的问题，根据本发明的一个方面，提出一种电力线通信网的信道接入控制系统。
根据本发明的电力线通信网的信道接入控制系统，包括：
主站，包括时隙划分模块，用于根据发送数据的各节点的节点数，将各节点发送数据的时间窗口划分为多个时隙；
节点，包括计算发送模块，用于计算并比较其在各时隙的发送数据概率，由发送数据概率最大的节点在对应的时隙向主站发送数据。
本发明的电力线通信网的信道接入控制的系统，通过事件驱动和概率函数相结合的方式，保证每次发送数据竞争时，网络中仅有一个节点发送数据的概率最高，故而能有效抑制或减少信道争用冲突。
本发明的电力线通信网的信道接入控制的系统，能有效减少数据重发的次数，故能降低电力线通信网络时延；且实现较为简单，降低系统复杂
度。
本发明的其它特征和优点将在随后的说明书中阐述，并且，部分地从说明书中变得显而易见，或者通过实施本发明而了解。本发明的目的和其他优点可通过在所写的说明书、权利要求书、以及附图中所特别指出的结构来实现和获得。
下面通过附图和实施例，对本发明的技术方案做进一步的详细描述。
附图用来提供对本发明的进一步理解，并且构成说明书的一部分，与本发明的实施例一起用于解释本发明，并不构成对本发明的限制。在附图中：
图1为本发明实施例的电力线通信网的信道接入控制方法的工作流程图；
图2为本发明实施例的电力线通信网的信道接入控制方法的具体步骤流程图；
图3为本发明实施例的电力线通信网的信道接入控制系统的结构示意图。
下面结合附图，对本发明的具体实施方式进行详细描述，但应当理解本发明的保护范围并不受具体实施方式的限制。
为了解决现有技术中LPLC网络中CSMA/CA机制信道竞争频繁导致通信效率和通信质量不高的问题，本发明提出了一种电力线通信网信道接入控制方法。
根据本发明实施例，提供了一种电力线通信网的信道接入控制方法(Event Drived Access Control，以下简称EDAC)，图1为EDAC工作流程图，具体步骤如下：
步骤101：发送数据前，各节点侦听信道，通过响应主站发出的事件指令来实现对信道的接入访问；
步骤102：主站向各节点下发发现指令，各节点收到发现指令后，进
行初始化过程，采用CSMA/CA的方式争用信道，向主站发送初始化应答帧；
步骤103：主站收到各节点上报的初始化应答帧后，向各节点下发分配指令，为每个节点分配逻辑编号i，并告知其节点数N，主站根据节点数N将各节点发送数据的时间窗口划分为W时隙，此时各节点进入事件等待状态，等待主站下发查询指令；
步骤104：主站向各节点下发查询指令，各节点收到查询指令后，进入事件响应状态，各节点根据下列公式计算在各时隙各自的发送数据概率，以下为节点i在第i个时隙发送数据的概率：
其中，α的取值由节点数N和时隙W决定：
步骤105：对步骤104中得到的各节点在各时隙的发送数据概率值进行比较，选择发送数据概率最大值对应的节点转入步骤106；
步骤106：步骤105中发送数据概率最大值对应的节点在对应时隙向主站发送数据响应帧，并通过信道发送数据；
步骤107：待步骤106中发送数据概率最大值对应的节点将该节点内全部数据发送完毕后，该节点之外的其他节点按照发送数据概率大小的排列顺序依次向主站发送数据。待各节点将所有数据发送完毕后，各节点转入事件等待状态，重新接收主站下发的查询指令，计算并比较其在各时隙发送数据概率，其中发送数据概率最大值对应的节点在对应时隙(该节点可能与步骤105中的发送数据概率最大值对应的节点为同一节点或不同节点)向主站发送数据响应帧，进行数据发送，循环进行步骤104-107的过程。
更具体的实施例工作流程如图2所示，步骤说明如下：
步骤201：发送数据前，各节点侦听信道，通过响应主站发出的事件指令来实现对信道的接入访问；
步骤202：主站向各节点下发发现指令，各节点收到发现指令后，进行初始化过程，采用CSMA/CA的方式争用信道，向主站发送初始化应答帧；
步骤203：主站收到各节点上报的初始化应答帧后，向各节点下发分配指令，为每个节点分配逻辑编号i，并告知其节点数N，主站根据节点数N将各节点发送数据的时间窗口划分为W时隙，此时各节点进入事件等待状态，等待主站下发查询指令；
假设主站为各节点分配的逻辑编号分别为a、b、c、d......；
步骤204：主站向上述各节点下发查询指令，各节点收到查询指令后，进入事件响应状态，根据下列公式计算各节点在各时隙的发送数据概率，以下为节点i在第i个时隙发送数据的概率：
其中，α的取值由节点数N和时隙W决定：
步骤205：在步骤204得到的各节点在各时隙的发送数据概率值中，假设按照发送数据概率的大小排列，各节点的先后顺序为a、b、c、d......，此时选择发送数据概率最大的节点a转入步骤206；
步骤206：节点a在对应的时隙向主站发送数据响应帧，并通过信道发送数据；
步骤207：待节点a将该节点内全部数据发送完毕后，b、c、d......节点依次发送本节点内的数据。待各节点将所有数据发送完毕之后，各节点转入事件等待状态，重新接收主站下发的查询指令，计算并比较其在各时隙发送数据概率。按照发送数据概率大小排列，各节点的先后顺序可能为a、b、c、d......，也可能为b、a、c、d......，还有可能为c、b、a、d......，或d、a、b、c......等等，其中发送数据概率最大值对应的节点在对应时隙(在本实施例中，根据不同的节点先后顺序排列情形，该节点可能为a或b或c或d......)向主站发送数据响应帧，进行数据发送，待各节点将所有数据发送完毕之后，循环进行步骤204-207的过程。
本发明的电力线通信网的信道接入控制方法，通过事件驱动和概率函数相结合的方式，保证每次发送数据竞争时，网络中仅有一个节点发送数据的概率最高，故而能有效抑制或减少信道争用冲突。
本发明的电力线通信网的信道接入控制方法，能有效减少数据重发的次数，故能降低电力线通信网络时延；且实现较为简单，降低系统复杂度。
为了解决LPLC网络中CSMA/CA机制信道竞争频繁导致通信效率和通信质量不高的问题，本发明提出了一种电力线通信网信道接入控制系统。
根据本发明实施例，提供了一种电力线通信网的信道接入控制系统，如图3所示，该电力线通信网的信道接入控制系统包括主站和节点，其中：
主站包括时隙划分模块301，用于根据发送数据的各节点的节点数，将各节点发送数据的时间窗口划分为多个时隙；
节点包括计算发送模块302，用于计算并比较其在各时隙的发送数据概率，由发送数据概率最大的节点在对应的时隙向主站发送数据。
在本发明的电力线通信网的信道接入控制系统中，节点中的计算发送模块302具体包括：
概率计算子模块3021，用于根据下列公式计算各节点在各时隙的发送数据概率，节点i在第i个时隙发送数据的概率函数P为：
其中，α的取值由网络节点数N和所述时隙W决定：
比较发送子模块3022，用于将各节点在各时隙的发送数据概率进行比较，取其中最大值，该最大值对应的节点在对应时隙向主站发送数据。
在本发明的电力线通信网的信道接入控制系统中，节点还包括：
初始化模块303，用于接收主站下发的发现指令后，进行初始化过程，争用信道，向主站上报初始化应答帧，接收主站分配的节点逻辑编号。
在本发明的电力线通信网的信道接入控制系统中，节点还包括：
事件响应模块304，用于完成初始化过程后，接收主站下发的查询指令，进入事件响应状态。
本发明的电力线通信网的信道接入控制的系统，通过事件驱动和概率函数相结合的方式，保证每次发送数据竞争时，网络中仅有一个节点发送数据的概率最高，故而能有效抑制或减少信道争用冲突。
本发明的电力线通信网的信道接入控制的系统，能有效减少数据重发的次数，故能降低电力线通信网络时延；且实现较为简单，降低系统复杂度。
本发明能有多种不同形式的具体实施方式，上面以图1-图3为例结合附图对本发明的技术方案作举例说明，这并不意味着本发明所应用的具体实例只能局限在特定的流程或实施例结构中，本领域的普通技术人员应当了解，上文所提供的具体实施方案只是多种优选用法中的一些示例，任何体现本发明权利要求的实施方式均应在本发明技术方案所要求保护的范围之内。
最后应说明的是：以上所述仅为本发明的优选实施例而已，并不用于限制本发明，尽管参照前述实施例对本发明进行了详细的说明，对于本领域的技术人员来说，其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分技术特征进行等同替换。凡在本发明的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。
Claims (8)
- 一种电力线通信网的信道接入控制方法，其特征在于，包括：主站根据发送数据的各节点的节点数，将所述各节点发送数据的时间窗口划分为多个时隙；所述各节点计算并比较其在各所述时隙的发送数据概率，由所述发送数据概率最大的节点在对应的所述时隙向所述主站发送数据。
- 根据权利要求1所述的方法，其特征在于，所述各节点计算并比较其在各所述时隙的发送数据概率，由所述发送数据概率最大的节点在对应的所述时隙向所述主站发送数据，具体包括：根据下列公式计算节点i在第i个时隙发送数据概率的函数P为：
其中，α的取值由节点数N和时隙W决定：
将所述各节点在各所述时隙的所述发送数据概率进行比较，取其中最大值，所述最大值对应的节点在对应的所述时隙向所述主站发送数据。 - 根据权利要求1所述的方法，其特征在于，还包括：所述各节点接收所述主站下发的发现指令后，进行初始化过程，争用信道，向所述主站上报初始化应答帧，接收所述主站分配的节点逻辑编号。
- 根据权利要求3所述的方法，其特征在于，还包括：所述各节点完成所述初始化过程后，接收所述主站下发的查询指令，进入事件响应状态。
- 一种电力线通信网的信道接入控制系统，其特征在于，包括：主站，包括时隙划分模块，用于根据发送数据的各节点的节点数，将 所述各节点发送数据的时间窗口划分为多个时隙；节点，包括计算发送模块，用于计算并比较其在各所述时隙的发送数据概率，由所述发送数据概率最大的节点在对应的所述时隙向所述主站发送数据。
- 根据权利要求5所述的电力线通信网的信道接入控制系统，其特征在于，所述计算发送模块包括：概率计算子模块，用于根据下列公式计算所述各节点在各所述时隙的所述发送数据概率，节点i在第i个时隙发送数据的概率函数P为：
其中，α的取值由网络节点数N和所述时隙W决定：
比较发送子模块，用于将所述各节点在各所述时隙的所述发送数据概率进行比较，取其中最大值，所述最大值对应的节点在对应的所述时隙向所述主站发送数据。 - 根据权利要求5所述的电力线通信网的信道接入控制系统，其特征在于，所述节点还包括：初始化模块，用于接收所述主站下发的发现指令后，进行初始化过程，争用信道，向所述主站上报初始化应答帧，接收所述主站分配的节点逻辑编号。
- 根据权利要求5所述的电力线通信网的信道接入控制系统，其特征在于，所述节点还包括：事件响应模块，用于完成所述初始化过程后，接收所述主站下发的查询指令，进入事件响应状态。
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310606669.0A CN104660524B (zh) | 2013-11-25 | 2013-11-25 | 一种电力线通信网的信道接入控制方法和系统 |
| CN201310606669.0 | 2013-11-25 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2015074574A1 true WO2015074574A1 (zh) | 2015-05-28 |
Family
ID=53178965
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2014/091700 WO2015074574A1 (zh) | 2013-11-25 | 2014-11-19 | 一种电力线通信网的信道接入控制方法和系统 |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN104660524B (zh) |
| WO (1) | WO2015074574A1 (zh) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107463470B (zh) * | 2016-06-03 | 2020-10-02 | 中芯国际集成电路制造(上海)有限公司 | 通道冲突检测方法及系统 |
| CN109585948B (zh) * | 2018-12-06 | 2021-11-23 | 重庆西南集成电路设计有限责任公司 | 汽车锂电池电芯分布式检测系统和方法以及测量模块 |
| CN113437996B (zh) * | 2021-06-18 | 2023-02-03 | 深圳市力合微电子股份有限公司 | 一种plbus-rdm的通信方法及系统 |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1929421A (zh) * | 2006-07-28 | 2007-03-14 | 西安电子科技大学 | 运动目标探测无线传感器网络多址接入方法 |
| CN101179492A (zh) * | 2007-11-14 | 2008-05-14 | 中国人民解放军理工大学 | 用于随机接入时隙化自组织网络中的节能包冲突解析方法 |
| CN101800567A (zh) * | 2010-03-24 | 2010-08-11 | 哈尔滨工业大学 | 协作超宽带中的转发时隙分配及中继节点选择方法 |
| CN102959532A (zh) * | 2010-06-24 | 2013-03-06 | 熵通信有限公司 | 基于节点的服务质量管理 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101977385B (zh) * | 2010-10-27 | 2013-01-09 | 南京航空航天大学 | 一种支持QoS的规模可扩展单跳ad hoc网络动态时隙分配方法 |
-
2013
- 2013-11-25 CN CN201310606669.0A patent/CN104660524B/zh active Active
-
2014
- 2014-11-19 WO PCT/CN2014/091700 patent/WO2015074574A1/zh active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1929421A (zh) * | 2006-07-28 | 2007-03-14 | 西安电子科技大学 | 运动目标探测无线传感器网络多址接入方法 |
| CN101179492A (zh) * | 2007-11-14 | 2008-05-14 | 中国人民解放军理工大学 | 用于随机接入时隙化自组织网络中的节能包冲突解析方法 |
| CN101800567A (zh) * | 2010-03-24 | 2010-08-11 | 哈尔滨工业大学 | 协作超宽带中的转发时隙分配及中继节点选择方法 |
| CN102959532A (zh) * | 2010-06-24 | 2013-03-06 | 熵通信有限公司 | 基于节点的服务质量管理 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104660524A (zh) | 2015-05-27 |
| CN104660524B (zh) | 2017-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7315528B2 (en) | Management of frame bursting | |
| EP2978273B1 (en) | Ofdma contention method and access point | |
| CN102802171B (zh) | 用于无线通信系统的退避方法和退避设备 | |
| CN110943861B (zh) | 一种适用于水声传感器网络的多链路并发传输方法 | |
| CN108617005B (zh) | 一种低功耗远距离组网方法 | |
| EP1819105B1 (en) | Wireless communication device and wireless communication method | |
| KR101805560B1 (ko) | 채널 액세스를 위한 방법, 장치 및 시스템 | |
| CN107046733B (zh) | 基于信道预约机制的可见光全双工连续传输随机接入方法 | |
| US8705505B2 (en) | Distributed medium access scheduling with implicit ordering | |
| WO2022057901A1 (zh) | 无线局域网中的信道接入方法及相关装置 | |
| CN102300257A (zh) | 无线自组网中基于信道预约机制的多信道多址接入方法 | |
| CN101150469A (zh) | 一种无线局域网中基于退避机制的分组调度方法 | |
| WO2013159552A1 (zh) | 无线帧的接收方法及装置 | |
| CN102421151A (zh) | 基于wlan竞争站点数目的最小竞争窗口自适应调整方法 | |
| WO2012028035A1 (zh) | 一种资源竞争方法和站点 | |
| CN103747006A (zh) | 一种无线控制网络的媒介访问控制方法 | |
| WO2015074574A1 (zh) | 一种电力线通信网的信道接入控制方法和系统 | |
| CN106535353B (zh) | 随机退避方法及装置 | |
| CN102256317B (zh) | 无线信道访问控制方法 | |
| WO2016127348A1 (zh) | 接入点ap、站点sta、通信系统及数据传输方法 | |
| CN106550481B (zh) | 一种基于竞争的无线网络介质访问控制层接入方法及系统 | |
| CN109005065B (zh) | 一种用于大规模d2d网络的隐藏节点可感知的分簇算法 | |
| CN115835290A (zh) | 一种报文传输方法、装置及电子设备和存储介质 | |
| WO2016078092A1 (zh) | 一种多信道传输的退避方法及退避设备 | |
| US20050013325A1 (en) | Method for transmitting multimedia data in wireless network |
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: 14863393 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: 14863393 Country of ref document: EP Kind code of ref document: A1 |