-
公开(公告)号：US20170339702A1
公开(公告)日：2017-11-23
申请号：US15160014
申请日：2016-05-20
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao , Yuan Wu , Haohan Chai , Liping Qian , Weidang Lu , ChangSheng Yu
CPC classification number: H04W28/0236 , H04W28/10
Abstract: A communication system and a method for transmitting data over a communication network includes a processing module arranged for selectively splitting a traffic demand of a transmission link into a plurality of portions of traffic demands distributed over a main channel and at least one auxiliary channel of the communication network, and the processing module is further arranged to determine a data transmission relationship associated with the traffic demand of the transmission link and at least one parameter of both the main channel and the at least one auxiliary channel; and a transmission module arranged to transmit data over one or more of the main channel and the at least one auxiliary channel according to the data transmission relationship.
-
2.发明申请Method and System for Contention Queuing using a Queue-Based MAC Protocol 有权使用基于队列的MAC协议进行争用排队的方法和系统公开(公告)号：US20170019933A1
公开(公告)日：2017-01-19
申请号：US14828159
申请日：2015-08-17
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao , Fangxin Xu , Yu Zeng , Jie Yang
CPC classification number: H04W74/0866 , H04W74/008 , H04W74/02 , H04W74/08 , H04W74/0816
Abstract: A MAC protocol, useful for wireless local area networks (WLANs), is provided for improving throughput efficiency. The protocol includes three concurrent processes, and the channel is divided into a contention subchannel and a transmission subchannel. In the contention process, all nodes use the standard RTS/CTS mechanism operated on the contention channel to contend for a right of transmission. When one node gains the right, all the nodes store the contention result into their respective contention queue (CQ) buffers. In the transmission process, the nodes sequentially transmit their data over the transmission channel according to the order of the nodes stored in the CQ buffers. When one node finishes data transmission, the CQ buffers are updated. The contention process and the transmission process are connected by the queuing process, where each node dynamically updates its own CQ buffer according to the contention result and each instance of data transmission.
Abstract translation: 提供了一种用于无线局域网（WLAN）的MAC协议，用于提高吞吐量效率。 该协议包括三个并发进程，并且该信道被划分为竞争子信道和传输子信道。 在竞争过程中，所有节点都使用在争用通道上运行的标准RTS / CTS机制来争取传输权。 当一个节点获得权限时，所有节点将争用结果存储到它们各自的争用队列（CQ）缓冲器中。 在传输过程中，节点根据存储在CQ缓冲器中的节点的顺序，依次通过传输信道发送它们的数据。 当一个节点完成数据传输时，更新CQ缓冲区。 竞争过程和传输过程通过排队过程连接，其中每个节点根据竞争结果和每个数据传输实例动态更新自己的CQ缓冲区。
-
公开(公告)号：US09232351B1
公开(公告)日：2016-01-05
申请号：US14658227
申请日：2015-03-15
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao
CPC classification number: H04W4/02 , H04W4/021 , H04W60/04 , H04W64/003 , H04W68/005
Abstract: The present invention provides a method for updating a mobile terminal (MT) for a mobile communication network when the MT crosses a boundary of a first location-update (LA) area. The method comprises determining a second LA to be assigned to the MT for replacing the first LA. The second LA is characterized by a LA center and a LA size, both determined by optimizing them in a sense that a mean total location-management cost is minimized without restricting the LA center to be fixed at the initial position. The initial position is defined as the location where the MT performs a latest location update at the first LA before crossing the boundary. This invention also provides schemes of partitioning the second LA into sub-paging areas for use in paging the MT when a call arrives at the network, so as to minimize the paging cost while satisfying delay requirements.
Abstract translation: 本发明提供一种当MT越过第一位置更新（LA）区域的边界时，为移动通信网络更新移动终端（MT）的方法。 该方法包括确定要分配给MT以用于替换第一LA的第二LA。 第二个LA的特征在于LA中心和LA大小，两者都通过优化它们来确定，即在平均总位置管理成本最小化的意义上，而不将LA中心限制在初始位置。 初始位置被定义为MT在穿过边界之前在第一LA处执行最新位置更新的位置。 本发明还提供了当呼叫到达网络时将第二LA划分为子寻呼区域以用于寻呼MT的方案，以便在满足延迟要求的同时最小化寻呼成本。
-
公开(公告)号：US10004090B2
公开(公告)日：2018-06-19
申请号：US15153748
申请日：2016-05-13
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao , Fangxin Xu , Yu Zeng , Jie Yang
CPC classification number: H04W74/0866 , H04W74/008 , H04W74/02 , H04W74/08 , H04W74/0816
Abstract: A MAC protocol, useful for WLANs, is provided for random access over a channel. The protocol includes three concurrent processes. The channel includes a contention subchannel and a transmission subchannel. In the contention process, all nodes use the standard RTS/CTS mechanism operated on the contention subchannel to contend for a transmission right. When one node gains the right, all the nodes store the contention result into their respective contention queue (CQ) buffers. In the transmission process, the nodes sequentially transmit their data over the transmission subchannel according to the order of the nodes stored in the CQ buffers. When one node finishes transmission, the CQ buffers are updated. The contention and transmission processes are connected by the queuing process for dynamically updating each node's CQ buffer. When OFDM is used in a random-access system, numbers of data subcarriers in both subchannels for maximizing the system throughput are given.
-
公开(公告)号：US09942150B2
公开(公告)日：2018-04-10
申请号：US15160043
申请日：2016-05-20
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao , Zhijie Ma
IPC: G08C15/00 , H04L12/801 , H04L12/911 , H04L12/26
CPC classification number: H04L47/10 , H04L43/0882 , H04L47/783 , H04W28/0205 , H04W74/0816
Abstract: A method for optimizing throughput of a network with stations adapted to transmit data to an access point includes the step of determining a respective required throughput for each station based on: respective time periods required for decreasing a count of a respective back-off counter associated with each of the stations, a transmission packet length of the respective station, and a probability of successful transmission for of the respective station. The respective required throughput so determined is a function of a respective transmission attempt rate for the station. The method further includes the step of determining the respective transmission attempt rate for each station for maximizing a sum of the respective required throughput such that a respective fixed throughput is provided for inelastic data flow in the network, a respective proportional throughput ratio is provided for elastic data flow in the network, and the throughput of the network is maximized.
-
Patent Agency Ranking
6.发明授权Method for scheduling a random-access communication system with absolute and proportional throughput guarantees 有权用于以绝对和比例的吞吐量保证来调度随机接入通信系统的方法公开(公告)号：US09307560B2
公开(公告)日：2016-04-05
申请号：US14308713
申请日：2014-06-19
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao , Zhijie Ma
CPC classification number: H04W74/0833 , H04W74/0816 , H04W74/0875 , H04W84/12
Abstract: A method for scheduling a random-access communication system having high-priority (HP) and low-priority (LP) nodes is provided, where the scheduling is configured such that the system provides an absolute throughput guarantee for the HP nodes, and a proportional throughput guarantee for the LP nodes. The method is based on obtaining a length of a contention window assigned to an individual node, which is either a HP or a LP node, from a per-slot attempt rate of this individual node. In particular, the attempt rate of each individual node is determined by an algorithm configured such that a resultant sum of the per-slot attempt rates of all the individual nodes is a fixed value independent of the number of the individual nodes. By this scheduling method, the maximum system throughput is approached. The method can be advantageously used in a wireless local area network (WLAN).
Abstract translation: 提供了一种用于调度具有高优先级（HP）和低优先级（LP）节点的随机接入通信系统的方法，其中调度被配置为使得系统为HP节点提供绝对吞吐量保证，并且成比例 LP节点的吞吐量保证。 该方法基于从该单独节点的每时隙尝试速率获得分配给单个节点（即HP或LP节点）的争用窗口的长度。 具体地，每个单独节点的尝试速率由配置为使得所有单个节点的每时隙尝试速率的合成和是独立于各个节点的数量的固定值的算法来确定。 通过该调度方法，接近最大系统吞吐量。 该方法可以有利地用于无线局域网（WLAN）。
-
公开(公告)号：US10084661B2
公开(公告)日：2018-09-25
申请号：US15416035
申请日：2017-01-26
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao , Rongchang Duan , Hanwen Zhang , Yujun Zhang , Zhongcheng Li
CPC classification number: H04L41/142 , H04L43/08 , H04L43/0888 , H04L67/12 , H04W4/70
Abstract: A method for evaluating performance of a data communication network with a receiver node arranged to initiate data transmission thereto from a plurality of transmitter nodes directly connected therewith includes applying to the data communication network a stochastic operation model arranged to model operation characteristics of the receiver node, and determining throughput or power consumption of the network based on the stochastic operation model. The operation characteristics include: a duration of a work cycle of the receiver node (Tcycle), the work cycle including an active data communication period (Thold) and an inactive period (Tdwell); a duration of the active data communication period (Thold), the active data communication period including a number of data communication events; the number of data communication events in the work cycle n; a duration of the respective data communication events (Ttx); and amount of data successfully received at the receiver node in the work cycle (Bi).
-
公开(公告)号：US20180212836A1
公开(公告)日：2018-07-26
申请号：US15416035
申请日：2017-01-26
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao , Rongchang Duan , Hanwen Zhang , Yujun Zhang , Zhongcheng Li
CPC classification number: H04L41/142 , H04L43/08 , H04L43/0888 , H04W4/70
Abstract: A method for evaluating performance of a data communication network with a receiver node arranged to initiate data transmission thereto from a plurality of transmitter nodes directly connected therewith includes applying to the data communication network a stochastic operation model arranged to model operation characteristics of the receiver node, and determining throughput or power consumption of the network based on the stochastic operation model. The operation characteristics include: a duration of a work cycle of the receiver node (Tcycle), the work cycle including an active data communication period (Thold) and an inactive period (Tdwell); a duration of the active data communication period (Thold), the active data communication period including a number of data communication events; the number of data communication events in the work cycle n; a duration of the respective data communication events (Ttx); and amount of data successfully received at the receiver node in the work cycle (Bi).
-
公开(公告)号：US10004037B2
公开(公告)日：2018-06-19
申请号：US15219293
申请日：2016-07-26
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao , Caihong Kai , Hanxu Zheng
IPC: G08C17/00 , H04W52/02 , H04B17/391
CPC classification number: H04W52/0219 , H04B17/3912 , H04W4/70 , Y02D70/00 , Y02D70/22
Abstract: The throughput of a wireless network can be boosted by network coding (NC). The present invention combines NC-aware routing and TDMA-based MAC protocol for energy-efficient design in the wireless network, and provides a method thereof. An optimization model, which is a minimum energy consumption model (MECM), is formulated for minimizing the energy consumption for accomplishing a set of flow transmissions. In particular, based on a set of user traffic-flow demands, a NC-aware traffic-flow assignment that minimizes a total energy consumption of packets delivering to meet the user traffic-flow demands is determined. Thereafter, given the optimal flow assignment, a minimum timeslots model (MTM) which leads to a TDMA-based scheduling strategy at the MAC layer is developed. The MTM is to minimize the total number of timeslots required for transmission under a condition that the NC-aware traffic-flow assignment as already determined is accomplishable.
-
公开(公告)号：US09961702B2
公开(公告)日：2018-05-01
申请号：US14828159
申请日：2015-08-17
Applicant: Macau University of Science and Technology
Inventor： Qinglin Zhao , Fangxin Xu , Yu Zeng , Jie Yang
CPC classification number: H04W74/0866 , H04W74/008 , H04W74/02 , H04W74/08 , H04W74/0816
Abstract: A MAC protocol, useful for wireless local area networks (WLANs), is provided for improving throughput efficiency. The protocol includes three concurrent processes, and the channel is divided into a contention subchannel and a transmission subchannel. In the contention process, all nodes use the standard RTS/CTS mechanism operated on the contention channel to contend for a right of transmission. When one node gains the right, all the nodes store the contention result into their respective contention queue (CQ) buffers. In the transmission process, the nodes sequentially transmit their data over the transmission channel according to the order of the nodes stored in the CQ buffers. When one node finishes data transmission, the CQ buffers are updated. The contention process and the transmission process are connected by the queuing process, where each node dynamically updates its own CQ buffer according to the contention result and each instance of data transmission.
-
-
-
-
-
-
-
-
-
Search Results
13
records
(took 0.036 seconds)
