卫星光网络的虚拟信道和主信道双重优化数据封装方法

针对卫星 光网络中不同类型、不同速率业务统一封装实现难度大和传输效率低的问题,提出利用虚拟 信道(VC) 与主信道(MC)联合优化的数据封装方法,分别给出VC封装与MC处理方法,并针 对其原理进 行分析。在VC中,提出了基于优先级的虚拟信道调度算法,对帧调度的时间冲突进 行优化,提 高虚拟信道处理的帧复用效率。在MC处理中,对传输帧支持的业务类型进行了扩展, 分析了前向 纠错编码对帧传输的性能影响。研究结果表明,采用优先级算法后帧传输效率提升 24.61%;外码为RS 码、内码为卷积码的级联码是MC处理中可选择的最佳编码方式。     

A distributed network coded control channel for multihop cognitive radio networks

Designing a solution for multihop cognitive radio networks poses several challenges such as the realization of the control channel, the detection of primary users, and the coordination of secondary users for dynamic spectrum access purposes. In this article we discuss these challenges and propose a solution that aims to meet most of them. The proposed solution is completely distributed, and does not need dedicated spectrum resources for control purposes, but rather leverages on a virtual control channel that is implemented by having users exchange control information whenever they meet in a particular channel, using network coding techniques for better dissemination performance. Due to these aspects, our proposal represents a significant improvement over existing dynamic spectrum access and multichannel MAC solutions. We discuss the effectiveness of our scheme in multihop cognitive ad hoc networks, where secondary users need to opportunistically access the spectrum at those locations and times at which it is not used by primary users. Finally, we report the results of an evaluation study assessing the performance of the proposed scheme with respect to different system and scenario parameters.     

802.11ax系统中基于传输延迟的多用户调度与资源分配算法

IEEE 802.11ax系统中站点(Station,STA)数量众多和潜在的高数据包冲突率导致无线局域网通信效率显著降低,本文针对上行多用户传输中的无效帧填充问题,以每轮传输中用户组的传输延迟为优化目标,提出一种多用户调度和资源分配算法.基于OFDMA上行调度接入中动态传输时间的帧交互方案,接入点(Access Po...     

Distributed channel selection in CRAHNs: A non-selfish scheme for mitigating spectrum fragmentation

In this paper, we consider the problem of spectrum sharing in CRAHNs and propose a distributed channel selection scheme. The key functionality of our proposal, best-fit channel selection (BFC) is that it accounts both the primary channel traffic activity and CR traffic activity in channel selection. We assume CR nodes have the capability of estimating the primary channel traffic activities. In BFC, each CR selects a channel among the primary user (PU) channels for transmission that best fits to its transmission time requirement. We compare the performance of BFC to the widely known longest idle time channel selection (LITC) scheme. In LITC, a CR selects the channel that has the longest expected idle time independent of its transmission needs. In a multi-user CRN, this may degrade the network performance compared to the non-selfish BFC approach. LITC is considered selfish since each CR aims to maximize its own benefit and thus wastes resources that may be utilized by other nodes in the network. BFC providing an efficient spectrum sharing mechanism implicitly mitigates the effect of spectrum fragmentation which is a significant issue degrading the CR spectrum utilization. In CRNs, spectrum may be fragmented in various dimensions, e.g. time and frequency, such that some parts of the spectrum can not be used although being idle. Our proposal provides a solution to the spectrum fragmentation issue in time dimension at the medium access control (MAC) layer. By a set of simulations, we highlight the performance improvement by BFC over the conventional LITC under various CR/PU traffic, number of CRs, estimation accuracy and buffering capability. Simulation results show that the performance of the proposed BFC is significantly superior to that of LITC in terms of probability of successful transmission, spectrum opportunity utilization and fragmentation.     

认知无线网络中基于主用户行为的联合路由和信道分配算法

针对认知无线网络中主用户行为将导致频谱瞬时变化而影响路由稳定性的问题,提出了一种基于主用户行为的路由和信道联合分配算法。该算法通过采用呼叫模型对主用户行为建模,并根据动态源路由协议的路由寻找机制,在目的节点等待多个路由请求分组后选择受主用户行为影响最小的路由,然后沿着所选定路径的反方向传送路由回复分组并完成信道分配。理论分析证明了算法中的链路平均持续时间期望与主用户活动概率成反比且具有与网络节点数成正比的计算复杂度。仿真结果表明,该算法具有比Gymkhana路由方案更高的分组投递率和更低的平均分组时延。     

Cross‐Layer Resource Allocation in Multi‐interface Multi‐channel Wireless Multi‐hop Networks

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi‐channel wireless multi‐hop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems — flow control; next‐hop routing; rate allocation and scheduling; power control; and channel allocation — and finally solved by a low‐complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.     

Partial channel information feedback mechanism for FFR-based multi-channel systems

This article puts forward a partial channel state information(CSI) feedback scheme for fractional frequency reuse(FFR)-based orthogonal frequency division multiple access(OFDMA) systems.Efficient CSI feedback strategy plays an important role in opportunistic scheduling because base station(BS) can employ adaptive modulation and coding(AMC) technique to adaptively change transmission rates according to CSI feedback,and therefore the spectrum efficiency can be improved significantly.On the other hand,FFR is a...     

Cognitive radio network with coordinated multipoint joint transmission

Cognitive radio (CR) is considered to be a promising technology for future wireless networks to make opportunistic utilization of the unused or underused licensed spectrum. Meanwhile, coordinated multipoint joint transmission (CoMP JT) is another promising technique to improve the performance of cellular networks. In this paper, we propose a CR system with CoMP JT technique. We develop an analytical model of the received signal‐to‐noise ratio at a CR to determine the energy detection threshold and the minimum number of required samples for energy detection–based spectrum sensing in a CR network (CRN) with CoMP JT technique. The performance of energy detection–based spectrum sensing under the developed analytical model is evaluated by simulation and found to be reliable. We formulate an optimization problem for a CRN with CoMP JT technique to configure the channel allocation and user scheduling for maximizing the minimum throughput of the users. The problem is found to be a complex mixed integer linear programming. We solve the problem using an optimization tool for several CRN instances by limiting the number of slots in frames. Further, we propose a heuristic‐based simple channel allocation and user scheduling algorithm to maximize the minimum throughput of the users in CRNs with CoMP JT technique. The proposed algorithm is evaluated via simulation and found to be very efficient.     

A joint resource allocation‐channel coding design based on distributed source coding

Wireless sensor networks (WSNs) have found a wide variety of applications recently. However, the challenges in WSNs still remain in improving the sensor energy efficiency and information quality (distortion reduction) of the sensing data transmissions. In this paper, we propose a novel cross‐layer design of resource allocation and channel coding to protect distributed source coding (DSC)‐based data transmission. Resource allocation strategies include rate adaptation and automatic repeat‐request retransmissions. Our proposed joint design of resource allocation, channel coding, and DSC can improve the network energy efficiency and information quality while meeting the data transmission latency requirements. Further, we investigate how the resource allocation enables the network to achieve unequal error protection among correlated DSC streams. Our simulation studies demonstrate that the proposed joint design significantly improves the DSC‐based data transmission quality and the network energy efficiency. Copyright © 2013 John Wiley & Sons, Ltd.     

Improving Voice‐Service Support in Cognitive Radio Networks

Voice service is very demanding in cognitive radio networks (CRNs). The available spectrum in a CRN for CR users varies owing to the presence of licensed users. On the other hand, voice packets are delay sensitive and can tolerate a limited amount of delay. This makes the support of voice traffic in a CRN a complicated task that can be achieved by devising necessary considerations regarding the various network functionalities. In this paper, the support of secondary voice users in a CRN is investigated. First, a novel packet scheduling scheme that can provide the required quality of service (QoS) to voice users is proposed. The proposed scheme utilizes the maximum packet transmission rate for secondary voice users by assigning each secondary user the channel with the best level of quality. Furthermore, an analytical framework developed for a performance analysis of the system, is described in which the effect of erroneous spectrum sensing on the performance of secondary voice users is also taken into account. The QoS parameters of secondary voice users, which were obtained analytically, are also detailed. The analytical results were verified through the simulation, and will provide helpful insight in supporting voice services in a CRN.     

信息优先级保护的动态频谱分配算法

为提高海上无人艇编队无线网络频谱利用率,同时满足不同优先级信息的传输需求,提出了一种信息优先级保护的动态频谱分配算法。算法采用完全信息动态博弈模型,引入异步分布式定价（Asynchronous Distributed Pricing,ADP）算法设计效用函数。鉴于传统ADP算法在有较多通信余量时干扰价格定价过高,改进干扰价格定义。为体现优先级对分配的影响,在效用函数中加入信息权重。对效用函数成本部分进一步更改,可在实现高优先级信息优先传输的同时,依据通信速率需求合理分配信道通信容量。经过仿真验证,所提算法在吞吐量和可靠性方面优于基于节点优先级的分配算法。     

A trust mechanism-based channel assignment and routing scheme in cognitive wireless mesh networks with intrusion detection

Cognitive Wireless Mesh Networks (CWMN) is a novel wireless network which combines the advantage of Cognitive Radio (CR) and wireless mesh networks. CWMN can realize seamless integration of heterogeneous wireless networks and achieve better radio resource utilization. However, it is particularly vulnerable due to its features of open medium, dynamic spectrum, dynamic topology, and multi-top routing, etc.. Being a dynamic positive security strategy, intrusion detection can provide powerful safeguard to CWMN. In this paper, we introduce trust mechanism into CWMN with intrusion detection and present a trust establishment model based on intrusion detection. Node trust degree and the trust degree of data transmission channels between nodes are defined and an algorithm of calculating trust degree is given based on distributed detection of attack to networks. A channel assignment and routing scheme is proposed, in which selects the trusted nodes and allocates data channel with high trust degree for the transmission between neighbor nodes to establish a trusted route. Simulation results indicate that the scheme can vary channel allocation and routing dynamically according to network security state so as to avoid suspect nodes and unsafe channels, and improve the packet safe delivery fraction effectively.     

Neural network-based dynamic channel assignment for cellular mobilecommunication systems

Conventional dynamic channel assignment schemes are both time-consuming and algorithmically complex. An alternative approach, based on cascaded multilayered feedforward neural networks, is proposed and examined on two cellular systems with different configurations. Simulation results showed that the blocking performance of our multistage neural network approach can match that of an example conventional scheme with less complexity and higher computational efficiency. The example scheme considered here is the ordered channel search, which can achieve a reasonably high spectral efficiency as compared to that of an ideal dynamic channel allocation algorithm. We conclude that our neural network approach is well-suited to the dynamic channel allocation problem of future cellular or microcellular systems with decentralized control     

QoS保证的多信道混合接入CRN频谱共享策略设计

根据既不对主用户(Primary Radio user,PR)产生干扰,又对认知无线电用户(Cognitive Radio user,CR)提供QoS保证的原则,将认知无线电网络(Cognitive Radio Network,CRN)中多信道接入频谱共享问题建模为混合整数非线性规划。采用多级功率限制保证PR不被干扰,以CR物理层能够提供的速率作为信道和功率分配的依据,提出将能够为CR提供最大传输速率的信道分配给该CR的分配策略,将混合整数非线性规划转化为整数线性规划,并给出集中式启发算法和基于功率速率比(Power Rate Ratio,PRR)最小的分布式启发算法求解该整数线性规划。仿真结果表明,文中给出的算法能够提供较高的CRN吞吐量和较好的CR用户QoS保证。     

Context awareness beacon scheduling scheme for congestion control in vehicle to vehicle safety communication

Vehicle safety applications based on vehicle to vehicle communication typically transmit safety-related beacons to all neighboring vehicles with high reliability and a strict timeline. However, due to high vehicle mobility, dynamic network topology and limited network resource, this periodic beaconing could lead to congestion in the communication network. Therefore, beacon transmission method has a special challenge to efficiently use the limited network resources to satisfy the requirements of safety applications. With this motivation, we propose a novel distributed beacon scheduling scheme referred to as the context awareness beacon scheduling (CABS) which is based on spatial context information dynamically scheduling the beacon by means of TDMA-like transmission. The proposed beacon scheduling scheme was evaluated using different traffic scenarios within both a realistic channel model and IEEE 802.11p PHY/MAC model in our simulation. The simulation results showed that the performance of the CABS scheme was better than periodic scheduling in terms of packet delivery ratio and channel access delay. Also, the CABS scheme satisfies the requirements of the safety applications.     

Toward In-Band Self-Organization in Energy-Efficient MAC Protocols for Sensor Networks

This paper presents a self-organizing medium access control (MAC) protocol framework for distributed sensor networks with arbitrary mesh topologies. The novelty of the proposed In-band self-organized MAC (ISOMAC) protocol lies in its in-band control mechanism for exchanging time-division multiple access (TDMA) slot information with distributed MAC scheduling. A fixed-length bitmap vector is used in each packet header for exchanging relative slot timing information across immediate and up to two-hop neighbors. It is shown that, by avoiding explicit timing information exchange, ISOMAC can work without networkwide time synchronization, which can be prohibitive for severely cost-constrained sensor nodes in very large networks. A slot-clustering effect, caused by in-band bitmap constraints, enables ISOMAC to offer better spatial channel reuse compared to traditional distributed TDMA protocols. ISOMAC employs a partial node wake-up and header-only transmission strategy to adjust energy expenditure based on the instantaneous nodal data rate. Both analytical and simulation models have been developed for characterizing the proposed protocol. Results demonstrate that, with in-band bitmap vectors of moderate length, ISOMAC converges reasonably quickly, that is, approximately within a four to eight TDMA frame duration. Also, if the bitmap header duration is restricted within 10 percent of packet duration, then the energy penalty of the in-band information is quite negligible. It is also shown that ISOMAC can be implemented in the presence of network time synchronization, although its performance without synchronization is just marginally worse than that with synchronization.     

卫星光网络标准化数据传输与虚拟信道复用研究

针对激光链路中不同业务数据传输效率低的问题, 提出传输帧再封装单元(TFRU)设计方法。 TFRU采用虚拟信道(CVC)技术,通过对业务数据二次封装与VC复用实现传输数据格 式与速率的统一。 为进一步提升复用效率,提出基于TFRU的VC优先级调度算法,依据TFRU的封装原理 与信源数 据到达率,定义了由VC优先级和帧紧迫度决定的动态帧优先级,并给出VC优先级调 度的具体方 法。仿真表明,采用TFRU后系统吞吐量提高了3.054M,调度时延减少0.918s,较大提升了 系统性能; 只有当TFRU的传输速率大于各信源数据率的总和时,缓存需求才能被满足;基于TFRU的优先 级算法通过对不同信源TFRU帧的动态调度,保证了各VC中TFRU帧的调度公平性。     

A Power-Efficient Distributed TDMA Scheduling Algorithm with Distance-Measurement for Wireless Sensor Networks

This paper describes a power-efficient distributed TDMA slot scheduling algorithm which the slot allocation priority is controlled by distance measurement information in details. In our former proposed scheme, L-DRAND+, an extension of Lamport’s bakery algorithm for prioritized slot allocation based on the distance measurement information between nodes and a packet-based transmission power control had been applied. In this paper, we propose its enhanced scheme with a weighted rule control and state machines refinements of L-DRAND+, named L-DRAND++. This aims at the achievement of media access control methods which can construct a local wireless network practically by limiting the scope, and eliminate the redundant power consumption in the network. The proposed scheme can be shown as a possible replacement of DRAND algorithm for Z-MAC scheme in a distance-measurement-oriented manner. In addition, to evaluate the ordered node sequence determined by the algorithm, node sequence metric is proposed. By using the metric, we can evaluate protocol behaviors according to the environmental situation around the node.     

A Two‐Step Scheduling Algorithm to Support Dual Bandwidth Allocation Policies in an Ethernet Passive Optical Network

In this paper, we design a two‐step scheduling algorithm to support multiple bandwidth allocation policies for upstream channel access in an Ethernet passive optical network. The proposed scheduling algorithm allows us a simultaneous approach for multiple access control policies: static bandwidth allocation for guaranteed bandwidth service and dynamic bandwidth allocation for on‐demand, dynamic traffic services. In order to reduce the scheduling complexity, we separate the process of the transmission start‐ time decision from the process of grant generation. This technique does not require the timing information of other bandwidth allocation modules, so respective modules are free from a heavy amount of timing information or complex processing.     

An in-band signaling protocol for optical packet switching networks

Advances in optical networking reveal that all optical networks offering a multigigabit rate per wavelength will soon become economical as the underlying backbone in wide-area networks, in which the optical switch plays a central role. One of the central issues is the design of efficient signaling protocols which can support diversified traffic types, in particular the bursty IP traffic. This paper introduces a novel signaling protocol called the sampling probe algorithm (or SPA) to be used in a class of optical packet switching systems based on wavelength division multiplexing (WDM). The proposed scheme takes a drastically different approach from all existing signaling protocols. The salient features are 1) the pretransmission coordination is using an in-band signaling protocol, and thus does not require separate control channel(s) for transmission coordination; 2) the protocol is based on a reservation (connection) scheme which is capable of supporting multimedia traffic; 3) a gated service is adopted in which each successful reservation allows multiple packets (train of packets) to be transmitted, which can significantly reduce the per packet overhead; 4) the scheduling algorithm is adaptive by allowing flexible assignment of bandwidth on-demand; 5) the channel status gathering is done in a distributed fashion, and uses a passive listening mechanism, which itself does not interfere with packet transmissions. The results demonstrate that the proposed in-band signaling protocol can achieve high throughput and stability under heavy traffic condition.