Clustering-based adaptive low-power subframe configuration with load-aware offsetting in dense heterogeneous networks

Heterogeneous Networks(HetNets)and cell densification represent promising solutions for the surging data traffic demand in wireless networks.In dense HetNets,user traffic is steered toward the Low-Power Node(LPN)when possible to enhance the user throughput and system capacity by increasing the area spectral efficiency.However,because of the transmit power differences in different tiers of HetNets and irregular service demand,a load imbalance typically exists among different serving nodes.To offload more traffic to LPNs and coordinate the Inter-Cell Interference(ICI),Third-Generation Partnership Project(3GPP)has facilitated the development of the Cell Range Expansion(CRE),enhanced Inter-Cell Interference Coordination(eICIC)and Further enhanced ICIC(FeICIC).In this paper,we develop a cell clustering-based load-aware offsetting and an adaptive Low-Power Subframe(LPS)approach.Our solution allows the separation of User Association(UA)functions at the User Equipment(UE)and network server such that users can make a simple cell-selection decision similar to that in the maximum Received Signal Strength(max-RSS)based UA scheme,where the network server computes the load-aware offsetting and required LPS periods based on the load conditions of the system.The proposed solution is evaluated using system-level simulations wherein the results correspond to performance changes in different service regions.Results show that our method effectively solves the offloading and interference coordination problems in dense HetNets.

Modeling Components and Services of LTE Mobile Communications System

The latest wireless broadband network standard is LTE (Long Term Evolution) which is developed by 3GPP (3rd Generation Partnership Project). It will enable mobile devices such as smart phones, tablets and laptops to access Internet at a very high speed along with lots of multimedia services. There are many issues that are yet to be solved due to dynamic complex nature of wireless systems, multimedia software applications and software requirements. Poor service quality, service disconnections due to mobility, seamless handover, handover interruption time and downward compatibility to other Radio Access Networks (RAN) are some of the key issues for the current LTE systems that are addressed very recently in the scientific literature. Formal method is one of the promising software engineering techniques that assure quality and perfection in software system models. Formal methods use mathematical language to explicitly specify system specifications and requirements that serve as initial grounds for further development and implementation. It efficiently handles all component connections and resource management parameters using discrete structures. Z Schema language is used to model static aspects of LTE communications system. All the schemas are being verified using Z/Eves toolset. The aim is to provide sound mathematical foundation for system validation and verification that eventually results in a more reliable, scalable and complete software system.

MCRO-PUF:A Novel Modified Crossover RO-PUF with an Ultra-Expanded CRP Space

With the expanding use of the Internet of Things(IoT)devices and the connection of humans and devices to the Internet,the need to provide security in this field is constantly growing.The conventional cryptographic solutions need the IoT device to store secret keys in its non-volatile memory(NVM)leading the system to be vulnerable to physical attacks.In addition,they are not appropriate for IoT applications due to their complex calculations.Thus,physically unclonable functions(PUFs)have been introduced to simultaneously address these issues.PUFs are lightweight and easy-toaccess hardware security primitives which employ the unique characteristics of integrated circuits(ICs)to generate secret keys.Among all proposed PUFs,ring oscillator PUF(RO-PUF)has had amore suitable structure for hardware implementation because of its high reliability and easier providing of circuital symmetry.However,RO-PUF has not been so attractive for authentication purposes due to its limited supported challenge-response pairs(CRPs).A few efforts have been made in recent years that could successfully improve the RO-PUF CRP space,such as configurable RO-PUF(CRO-PUF).In this paper,by considerably improving the CRO-PUF structure and adding spare paths,we propose a novel strong RO-PUF structure that exponentially grows the CRP space and dramatically reduces the hardware cost.We implement our design on a simple and low-cost FPGA chip named XC6SLX9-2tqg144,stating that the proposed design can be used in IoT applications.In addition,to improve the CRP space,our design creates a suitable improvement in different security/performance terms of the generated responses,and dramatically outperforms the state-of-the-art.The average reliability,uniqueness,and uniformity of the responses generated are 99.55%,48.49%,and 50.99%,respectively.

Adaptive QoS Management for Mobile Cloud Services

The rapid growth of cloud computing and mobile Internet services has triggered the emergence of mobile cloud services. Among many challenges,QoS management is one of the crucial issues for mobile cloud services. However,existing works on QoS management for cloud computing can hardly fit well to the mobile environment. This paper presents a QoS management architecture and an adaptive management process that can predict,assess and ensure QoS of mobile cloud services. Furthermore,we propose an adaptive QoS management model based on Fuzzy Cognitive Maps ( FCM) ,which suitably represents the causal relationships among QoS related properties and cloud service modes. We evaluate the proposed solution and demonstrate its effectiveness and benefits based on simulation work.

A Novel Decoder Based on Parallel Genetic Algorithms for Linear Block Codes

Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.