甚小孔径终端(VSAT)卫星网络拓扑结构及接入方式

本文主要叙述VSAT—卫星网络类型及接入方式。从网络拓扑结构出发分析星形和网状两种网络形式、特点及通信业务。由中心站和若干个VSAT站组成的星形网络有三种通信方式:单跳、双跳和单、双混合式。在中心站的控制下,VSAT站之间通信要通过中心站经卫星线路实现,不能直接进行通信,线路延时较大,且通信业务受限。网状拓扑网络没有中心站,VSAT站之间可直接进行双向通信,线路延时小,在业务范围上也有新的突破。 VSAT网络接入方式极其重要,它决定着VSAT的性能,业务量及线路延时。不同的接入方式将影响卫星的利用率,信道容量的稳定性,结构的简易性,网络造价及组网灵活性等。据以上衡量标准,分别对TDM/FDMA、SCPC/FDMA、TDMA、CDMA和DAMA方式进行了分析,可根据用户不同的业务需求,组合并用,满足各种VSAT站灵活组网需要。     

面向工业无线网络的动态TDMA系统设计与实现

随着工业4.0的发展, 不同种类的新型工业应用被部署到工厂中, 这对现有工业无线技术提出了实时性和高速率的要求. 为了同时满足这两种需求, 本文在支持高速率的IEEE802.11的基础上, 提出了基于软件定义的动态时分多址(Time division multiple access, TDMA)机制无线接入系统. 首先, 为了提供时延有界的传输服务, 设计并实现了基于MAC (Medium access control)层的动态TDMA接入机制. 然后, 为了满足工业无线网络中的动态变化的带宽需求, 考虑设备数据量的动态变化, 在SDN (Software defined network)控制器上通过基于最小二乘法的线性回归算法预测设备时隙需求, 再将动态时隙分配问题转化为优化问题以最大化网络中所有设备动态时隙需求. 最后, 通过仿真对比TDMA时隙分配算法的性能, 并在实际网络环境中开展系统部署与测试. 结果表明, 相对于其他TDMA接入机制, 动态TDMA机制在保障时延有界的同时能有效提升传输性能.     

微小区一点多址无线紧急呼叫系统的设计与实现

首先说明微小区中用户紧急情况下需要无线呼叫业务,接着阐述一点多址无线通信系统的基本工作原理和多址协议主要类型及特点,最后讨论无线紧急呼叫系统的组成和基本结构,并详细说明用单片机实现微小区一点多址无线紧急呼叫系统的方法     

基于协作中继的多点广播码分多址信息系统设计

为了提高多群多点广播中继网络系统的性能,提出一种改进的协作中继多点广播码分多址(CDMA)系统设计。该方案利用协作中继辅助的分布式波束形成 实现单天线基站多播,获得了较好的空间分集增益。在该系统中,多个基站利用多个中继节点向多个目的地的各个小组传播消息;利用CDMA技术来减少中继节点以及目的地节点的多址干扰(MAI)障碍,同时每个中继节点作为线性预编码波束合成器,可以在合适的代码空间重塑基站信号;对线性波束形成矩阵进行优化,使得中继节点的功率最小化,从而满足QoS在信号干扰噪声比方面的要求。系统性能仿真对比实验的结果表明,提出的改进方案明显优于传统的正交复用方案(FDMA / TDMA)。     

一种新颖的无线网状网的混合调度策略

提出一种新颖的时分复用与最大调度的混合调度算法,解决了单信道无线网状网中,当同一时刻待传输链路突增时,信道竞争冲突加剧,网络容量显著下降的问题.算法根据链路与系统子时隙染色,使每条链路都有唯一系统子时隙相对应,链路在同色子时隙上实现时分复用调度;在异色子时隙空闲时,实现链路的最大调度.此算法具有时分复用和最大调度两种调度算法的优点.文中利用李雅普诺夫稳定性定理证明了算法的效率比率.仿真结果表明,该算法下的网络容量有明显提升.     

基于FDMA的超声波室内定位信标识别方法

在超声波室内定位的信标识别问题上,针对无线射频控制分配的信道策略复杂性高、定位滞后和基于码分多址(CDMA,code division multiple access)方法的自相关运算量巨大问题,提出基于频分多址(FDMA,frequence division multiple access)的超声波室内定位信标识别方法,令超声波具备信息携带能力.通过对信号调制技术的分析,在超声波频率响应范围内,利用不同频率的载波调制信源身份识别码,接收节点通过解调、匹配区分信号源进行定位.采用Simulink对多路信号传输过程以及调制与解调进行仿真,并用电路仿真发射、识别了编码.结果表明,FDMA方法能有效区分多路信号源互相干扰,准确恢复发射节点身份识别码,大大减少计算量,有利于定位效率的提高.     

Side-Channel Analysis for the Authentication Protocols of CDMA Cellular Networks

Time-division multiple access (TDMA) and code-division multiple access (CDMA) are two technologies used in digital cellular networks. The authentication protocols of TDMA networks have been proven to be vulnerable to side-channel analysis (SCA), giving rise to a series of powerful SCA-based attacks against unprotected subscriber identity module (SIM) cards. CDMA networks have two authentication protocols, cellular authentication and voice encryption (CAVE) based authentication protocol and authentication and key agreement (AKA) based authentication protocol, which are used in different phases of the networks. However, there has been no SCA attack for these two protocols so far. In this paper, in order to figure out if the authentication protocols of CDMA networks are sufficiently secure against SCA, we investigate the two existing protocols and their cryptographic algorithms. We find the side-channel weaknesses of the two protocols when they are implemented on embedded systems. Based on these weaknesses, we propose specific attack strategies to recover their authentication keys for the two protocols, respectively. We verify our strategies on an 8-bit microcontroller and a real-world SIM card, showing that the authentication keys can be fully recovered within a few minutes with a limited number of power measurements. The successful experiments demonstrate the correctness and the effectiveness of our proposed strategies and prove that the unprotected implementations of the authentication protocols of CDMA networks cannot resist SCA.     

基于TDMA方式WMN中一种链路调度机制研究

基于TDMA方式的无线网状网中,链路调度对网络性能起着重要作用.针对固定顺序的待调度链路集,提出求解最优调度周期的启发式算法;基于链路顺序对算法性能的影响,从全局优化的角度对全网链路进行排序,提出基于遗传算法的最优链路调度机制.仿真结果表明,该算法能快速收敛于全网链路的最小调度周期,具有比现有算法更高的传输效率和更低的实施复杂度.     

Enhanced MAC protocol to support multimedia traffic in cognitive wireless mesh networks

With the advanced physical layer techniques such as multiple-input and multiple-output (MIMO) and orthogonal frequency-division multiplexing (OFDM), transmission real-time 2D/3D contents and applications becomes more and more necessary in wireless networks for the amazing growing in demand of customers. However, the low efficiency of medium access control (MAC) protocol degrades the performance of real-time traffic greatly in multihop, wireless and mobile environment. Focusing on supporting real-time multimedia traffic in cognitive wireless mesh networks (WMNs), an enhanced MAC protocol is proposed. And the contribution of this paper is twofold: (1) An efficient carrier sense multiple access with collision avoidance (CSMA/CA) compatible time division multiple access (TDMA)-like MAC protocol called T-MAC is proposed, which aims to improve the system performance by allocating more channel access time in centralized manner and decreasing overhead. (2) An optimal adaptive scheduling scheme is proposed to support real-time multimedia applications and guarantee QoS for different priority traffic, which aims to find the optimized schedule among all possible sequences of concurrent transmissions by minimizing the occupied resources. Detailed simulation results and comparison with IEEE 802.11e MAC scheme show that the proposed T-MAC can effectively improve quality of service (QoS) for multimedia traffic in terms of throughput, end-to-end delay and packet loss rate, which also manifests that T-MAC is an efficient multimedia applications transmission scheme for mobile terminals and MAPs in cognitive WMNs.     

基于竞争允许TDMA的无线传感器MAC层协议

无线传感器网络在许多重要领域有着广泛的应用,而传感网的媒体访问控制子层(MAC)协议对传感器网络的运行和性能具有重要影响。该文概述了目前存在的传感网MAC协议的设计思想,在SMAC协议的基础上,将TDMA和CSMA两种思想结合起来并与SMAC协议同步机制相统一,提出了一个新的基于竞争允许TDMA的无线传感器网络MAC协议。模拟结果显示,与SMAC协议相比,该协议在数据包延迟、能量消耗及数据包的接收率等性能上有很大提高。     

一种基于方向天线和时间同步机制的多信道无线网状网MAC协议

在城市小区和广阔的农村建立低成本的无线网状网,为无线终端用户提供高速的接入服务,是一项极具现实意义的工作.设计了一种适合于此类网络的MAC层协议称为Mesh-MAC,该协议建立在已有的IEEE 802.11硬件产品基础上,每两个节点之间的通信是由一对方向天线完成,通过一种全新的时间同步方案,可以实现M ESH网内高效的数据转发.仿真结果表明,与IEEE 802.11及2P协议相比,Mesh-MAC协议在吞吐量和端到端传输延时等方面,都有明显的改善.     

On time-triggered and event-based control of integrator systems over a shared communication system

When analyzing networked control systems, where the control loop is closed over a communication system, it is crucial to take the communication system into account. Hence, time-triggered and event-based control of an integrator system with noise over a shared communication system is analyzed. Thereby, analytical models of different communication systems are used and the analysis is focused on the effect of the communication system on the performance, as well as the interaction between control and communication. For time-triggered control, where the event times are known in advance, a deterministic communication protocol can be used. Hence, time-triggered control with the two most well-known deterministic communication protocols, time division multiple access (TDMA) and frequency division multiple access (FDMA), is analyzed. For event-based control, where the events appear at random times, a contention-based communication protocol should be used. Hence, event-based control is analyzed with different contention-based communication protocols: pure ALOHA, slotted ALOHA, a queueing system, and Erlang’s loss model. It turns out that time-triggered control with either TDMA or FDMA outperforms event-based control with pure or slotted ALOHA. However, event-based control with a properly designed queueing system gives an even better performance. Thus, we conclude that it is crucial to take the details of the communication system into account.     

多信道时分多址MAC协议在WMN中的优化应用

随着无线Mesh网络(WMN)中跳数的增加,端到端的延时急剧增大,所以,在多跳WMN中很难做到服务质量(QoS)保证。针对以上问题,提出了一种新型多信道时分多址(TDMA)媒体访问控制(McTMAC)的协议,可以有效地降低在多跳网络中端到端的延时。通过测试评估结果显示:McTMAC协议优于现有的无线WMN协议,通过使用McTMAC协议端到端最大延时降低了60%。     

基于SDN的TDMA体制星间网络架构设计

TDMA(时分多址)体制的导航星间网络既可以实现导航测距,也具备较高的数据传输速率,具有较为广泛的业务适应能力;然而,TDMA体制的星间网络系统也存在着星上处理复杂与卫星节点处理能力低的矛盾;借鉴SDN(软件定义网络)将网络系统控制层面与数据层面相分离的思想,在TDMA体制的星间网络中引入SDN技术,设计了基于SDN的TDMA体制星间网络架构,将控制功能从卫星节点抽离出来,使其可以专注于星间数据转发,控制管理信息主要由卫星地面站(后续为高轨道卫星)扮演的SDN控制节点制定并分发,从而简化了卫星的业务负担,同时可以借鉴成熟的地面网络技术制定高效的控管策略;对所设计架构的主要的控管流程进行了仿真模拟,仿真结果表明,该架构具有一定的可行性。     

利用发送和接收时隙分配策略改善无线传感器网络MAC协议能效

摘　要 针对无线传感器网络中存在数据冲突和串音而影响MAC协议能量效率的问题,提出了基于接收和基于发送的TDMA-MAC协议时隙分配策略。通过考虑各种无线收发器模式(即发送、接收、休眠和空闲)花费的不同时间段来计算WSN能耗,假设聚类中WN数据包时间间隔为指数分布,采用两级TDMA方法实现对多步聚类的评估。利用OPNET Modeler软件执行仿真实验验证了本文模型的有效性,仿真结果表明,基于接收的SAS的能效是基于发送的SAS的5倍,相比基于分簇的TDMA/CDMA混合HCT-MAC协议,本文协议可节省4.3%的能量,减少了0.35ms的端到端延迟,相比倍增超周期多信道MAC协议,可节省10.8%的能量,减少了1ms的端到端延迟。     

基于竞争与TDMA的低时延无线传感器网络MAC协议

针对经典无线传感器网络（WSNs） S-MAC协议的累积睡眠延迟问题,提出了一种基于竞争与时分复用（TDMA）方式混合的低时延LH-MAC协议.LH-MAC根据包的传输跳数,提供不同优先级的接入服务,使已完成多跳传输的包以更大的概率接入信道,实现较远节点的低时延传输目标.仿真比较S-MAC与LH-MAC的平均延迟和能耗,表明LH-MAC在保持能量高效前提下,有效降低了端到端时延.     

A Learning Automata-Based Cognitive Radio for Clustered Wireless Ad-Hoc Networks

In current wireless networks, the radio systems are regulated by a fixed spectrum assignment strategy. This policy partitions the whole radio spectrum into a fixed number of radio ranges, each exclusively assigned to a specific user. Such a spectrum assignment strategy leads to an undesirable condition under which some systems only use a small portion of the allocated spectrum while the others have very serious spectrum insufficiency. The learning automata-based cognitive radio which is proposed in this paper is a highly potential technology to address the spectrum scarcity challenges in wireless ad hoc networks. This paper proposes a learning automata-based dynamic frame length TDMA scheme for slot assignment in clustered wireless ad-hoc networks with unknown traffic parameters, where the intra-cluster communications are scheduled by a TDMA scheme, and a CDMA scheme is overlaid on the TDMA to handle an interference-free inter-cluster communication. In this method, each cluster-head is responsible for a collision-free slot assignment within the cluster and determines the input traffic parameters of its own cluster members. It then takes these traffic parameters into consideration for an optimal channel access scheduling in the cluster. The medium access control layer in each cluster is based on a time division multiple access (TDMA) scheme, in which each host is assigned a fraction of the TDMA frame proportional to its traffic load. The simulation experiments show the superiority of our proposed slot assignment algorithm over the existing methods in terms of the channel utilization, control overhead, and throughput, specifically, under bursty traffic conditions.     

An efficient broadcast scheduling algorithm for TDMA ad-hoc networks

In this paper, we propose an efficient algorithm to find a collision-free time slot schedule in a time division multiple access frame. In order to minimize the system delay, the optimal schedule must be defined as the one that has the minimum frame length and provides the maximum slot utilization. The proposed algorithm is based on the sequential vertex coloring algorithm. Numerical examples and comparisons with the algorithm in previous research have shown that the proposed algorithm can find near-optimal solutions in respect of the system delay.Scope and purposeAn ad-hoc network was introduced in order to apply packet switching communication to a shared radio channel. Using a radio channel as the broadcast medium to interconnect users, an ad-hoc network provides flexible data communication services among a large number of geographically distributed, possibly mobile, radio units. In an ad-hoc network, since all users share a single channel by multiple access protocol, unconstrained transmission may lead to the time overlap of two or more packet receptions, called collision, resulting in damaged useless packets at the destination. Collided packets increase the system delay because they must be retransmitted. Therefore, the transmission for each station must be scheduled to avoid any collision, that is, collision-free transmission should be guaranteed. The time division multiple access (TDMA) technology can be used to schedule collision-free transmission. In this paper, we propose an efficient algorithm to find a collision-free time slot schedule in a TDMA ad-hoc network.     

Interworking wireless mesh networks: Problems,performance characterization,and perspectives

Wireless broadband networks based on the IEEE 802.11 technology are being increasingly deployed as mesh networks to provide users with extended coverage for wireless Internet access. These wireless mesh networks, however, may be deployed by different authorities without any coordination a priori, and hence it is possible that they overlap partially or even entirely in service area, resulting in contention of radio resources among them. In this paper, we investigate the artifacts that result from the uncoordinated deployment of wireless mesh networks. We use a network optimization approach to model the problem as resource sharing among nodes belonging to one or different networks. Based on the proposed LP formulation, we then conduct simulations to characterize the performance of overlaying wireless mesh networks, with the goal to provide perspectives for addressing the problems. We find that in a system with multiple overlaying wireless mesh networks, if no form of inter-domain coordination is present, individual mesh networks could suffer from capacity degradation due to increased network contention. One solution toward addressing the performance degradation is to “interwork” these wireless mesh networks by allowing inter-domain traffic relay through provisioning of “bridge” nodes. However, if such bridge nodes are chosen arbitrarily, the problems of throughput sub-optimality and unfairness may arise. We profile the impact of bridge node selection and show the importance in controlling network unfairness for wireless mesh network interworking. We conclude that mesh network interworking is a promising direction to address the artifacts due to uncoordinated deployment of wireless mesh networks if it is supplemented with appropriate mechanisms.     

An optimal GTS scheduling algorithm for time-sensitive transactions in IEEE 802.15.4 networks

IEEE 802.15.4 is a new enabling standard for low-rate wireless personal area networks and has been widely accepted as a de facto standard for wireless sensor networking. While primary motivations behind 802.15.4 are low power and low cost wireless communications, the standard also supports time and rate sensitive applications because of its ability to operate in TDMA access modes. The TDMA mode of operation is supported via the Guaranteed Time Slot (GTS) feature of the standard. In a beacon-enabled network topology, the Personal Area Network (PAN) coordinator reserves and assigns the GTS to applications on a first-come-first-served (FCFS) basis in response to requests from wireless sensor nodes. This fixed FCFS scheduling service offered by the standard may not satisfy the time constraints of time-sensitive transactions with delay deadlines. Such operating scenarios often arise in wireless video surveillance and target detection applications running on sensor networks. In this paper, we design an optimal work-conserving scheduling algorithm for meeting the delay constraints of time-sensitive transactions and show that the proposed algorithm outperforms the existing scheduling model specified in IEEE 802.15.4.