Modeling and analysis of multiple access channel capacity based on hybrid energy storage and energy harvesting

Energy harvesting (EH) has been considered as a promising technology to solve the constrained energy problem in the devices of IoT with its advantages of flexible deployment and sustainable energy supply.For multiple access channel with energy harvesting,a hybrid energy storage structure model composed by super capacitor and battery was proposed for the devices of IoT.According to the peculiarities of medium access channel and energy harvesting system,an optimized energy allocation strategy with exponential-type decline (ETD) was presented,the upper and lower bounds of the average throughput were deduced,in particular,the gap of two bounds was derived to be a constant.The channel capacity was further obtained by utilizing the relationship between the average throughput and the channel capacity.In the simulations,the effect of harvested energy,storage capacity and the number of nodes on the channel capacity were analyzed respectively.Experiment results show that compared with the conventional wireless node with single battery storage,the proposed hybrid energy storage structure can improve the harvested energy value and increase the multiple access channel capacity by using adaptive modulation scheme when transmitting the signals.     

对CATV系统指标叠加与分配的探讨

针对全电缆系统与HFC系统两种网络结构对有线电视系统指标的叠加与分配进行了探讨，论述了它们的不同点，提出在HFC系统中应使用HFC的指标计算公式。     

Single Machine Batch Scheduling Problem with Resource Dependent Setup and Processing Time in the Presence of Fuzzy Due Date

We consider a batch scheduling problem on a single machine which processes jobs with resource dependent setup and processing time in the presence of fuzzy due-dates given as follows:1. There are n independent non-preemptive and simultaneously available jobs processed on a single machine in batches. Each job j has a processing time and a due-date.2. All jobs in a batch are completed together upon the completion of the last job in the batch. The batch processing time is equal to the sum of the processing times of its jobs. A common machine setup time is required before the processing of each batch.3. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource.4. The due-date of each job is flexible. That is, a membership function describing non-decreasing satisfaction degree about completion time of each job is defined.5. Under above setting, we find an optimal batch sequence and resource values such that the total weighted resource consumption is minimized subject to meeting the job due-dates, and minimal satisfaction degree about each due-date of each job is maximized. But usually we cannot optimize two objectives at a time. So we seek non-dominated pairs i.e. the batch sequence and resource value, after defining dominance between solutions.A polynomial algorithm is constructed based on linear programming formulations of the corresponding problems.     

An Intersection Theorem on an Unbounded Set and Its Application to the Fair Allocation Problem

We prove the following theorem. Let m and n be any positive integers with mn, and let be a subset of the n-dimensional Euclidean space ⁿ . For each i=1, . . . , m, there is a class of subsets M _i ^j of ^Tn . Assume that for each i=1, . . . , m, that M _i ^j is nonempty and closed for all i, j, and that there exists a real number B(i, j) such that and its jth component _{xjB(i, j)} imply . Then, there exists a partition of {1, . . . , n} such that for all i and We prove this theorem based upon a generalization of a well-known theorem of Birkhoff and von Neumann. Moreover, we apply this theorem to the fair allocation problem of indivisible objects with money and obtain an existence theorem.     

Simulation optimization of buffer allocations in production lines with unreliable machines

We use a recent simulationbased optimization method, sample path optimization, to find optimal buffer allocations in tandem production lines where machines are subject to random breakdowns and repairs, and the product is fluidtype. We explore some of the functional properties of throughput of such systems and exploit these properties to prove the almost sure convergence of our optimization technique, under a regularity condition on the steady state. Utilizing a generalized semiMarkov process (GSMP) representation of the system, we derive recursive expressions to compute onesided directional derivatives of throughput, from a single simulation run. Finally, we give computational results for lines with up to 50 machines. We also compare results for smaller lines with the results from a more conventional method, stochastic approximation, whenever applicable. In these numerical studies, our method performed quite well on problems that are considered difficult by current computational standards.     

Extended Virtual Boundary and Its Application in Dynamic Spectrum Allocation

This paper presents an efficient dynamic spectrum allocation （DSA） scheme in a flexible spectrum licensing environment where multiple networks coexist and interfere with each other. In particular, an extension of virtual boundary concept in DSA is proposed, which is spectrally efficient than the previous virtual boundary concept applied to donor systems only. Here, the same technique is applied to both donor and rental systems so as to further reduce the occurrences where the insertion of guard bands is obligatory and as a result provides better spectral efficiency. The proposed extension improves the spectrum utilization without any compromise on interference and fairness issues.     

对地面固定辐射源的机载双站无源定位配置

以机载双站对辐射源进行联合定位为背景，建立了相应的数学模型并分析了定位精度。研究了双站间距和有效定位面积之间的关系，将定位精度和有效定位面积这两项重要指标综合一起从而确定出双站最佳配置模型，最后给出仿真结果。     

Throughput guarantees for multi-priority traffic in ad hoc networks

In this paper, we present MPARC (Multi-Priority Admission and Rate Control), a novel joint admission control and rate policing protocol for multi-priority ad hoc networks. MPARC is based on our novel bandwidth allocation model, which captures the bandwidth allocation for saturated, unsaturated and semi-saturated networks. MPARC guarantees that the throughput of admitted realtime flows will not decrease due to later arriving realtime flows with equal or lower priorities or due to best effort flows. MPARC achieves this goal by performing accurate admission control on every newly arriving realtime flow and appropriate rate policing on all best effort traffic. Through simulation, we demonstrate that MPARC has better performance than existing approaches.     

Dynamic Resource Allocation for Beyond 3G Cellular Networks

The Multicarrier CDMA Transmission Techniques for Integrated Broadband Cellular Systems (MATRICE) project addresses a candidate solution for a Beyond 3G (B3G) air-interface based on Multi-Carrier Code Division Multiple Access (MC-CDMA). It investigates dynamic resource allocation strategies at the Medium Access Control (MAC) layer to support the transport of Internet Protocol (IP) packets over the air-interface in a cost effective manner and maximise the cell capacity with a target QoS. A candidate Dynamic Resource Allocation (DRA) protocol architecture is proposed that is based on cross-layer signalling to provide reactive resource allocation according to the fast channel and traffic variations. In-line with B3G expectations, the proposed DRA handles a very large number of users with inherent flexibility and granularity necessary to support heterogeneous traffic, and still with limited complexity. Thanks to the modular architecture of the DRA, various scheduling policies are investigated and compared in terms of capacity and reactivity to the system environment. Simulation results have shown that the MATRICE system has the potential to deliver broadband heterogenous services in a cost-effective manner, and emerge as a propespective candidate air-interface for B3G cellular networks.     

Interference Mitigation in MIMO Systems by Subset Antenna Transmission

This paper investigates subset antenna transmission (SAT) for multiple-input multiple-output (MIMO) systems in the presence of strong dominant co-channel interferer. The capacity gain from SAT is investigated in the context of optimal antenna subset selection and power allocation. The SAT does not require channel state information of the co-channel interference, and achieves capacity gains by distributing the transmit power equally over a selected subset of the transmit antennas. The capacity gain of the SAT method is analyzed in terms of transmit power and eigenvalues of channel matrix, and its performance in V-BLAST MIMO systems with various signal constellations is evaluated by computer simulation.