Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 12 of 12

Full-Text Articles in Engineering

On Demand Cell Sectoring Based Fractional Frequency Reuse In Wireless Networks, Shakil Ahmed, Mohammad Arif Hossain, Mostafa Zaman Chowdhury Dec 2014

On Demand Cell Sectoring Based Fractional Frequency Reuse In Wireless Networks, Shakil Ahmed, Mohammad Arif Hossain, Mostafa Zaman Chowdhury

Electrical and Computer Engineering Student Research

In this paper, a dynamic channel assigning along with dynamic cell sectoring model has been proposed that focuses on the Fractional Frequency Reuse (FFR) not only for interference mitigation but also for enhancement of overall system capacity in wireless networks. We partition the cells in a cluster into two part named centre user part (CUP) and edge user part (EUP). Instead of huge traffic, there may be unoccupied channels in the EUPs of the cells. These unoccupied channels of the EUPs can assist the excessive number of users if these channels are assigned with proper interference management. If the number …


Class-Based Interference Management In Wireless Networks, Mohammad Arif Hossain, Mostafa Zaman Chowdhury, Shakil Ahmed, Yeong Min Jang Dec 2014

Class-Based Interference Management In Wireless Networks, Mohammad Arif Hossain, Mostafa Zaman Chowdhury, Shakil Ahmed, Yeong Min Jang

Electrical and Computer Engineering Student Research

Technological advancement has brought revolutionary change in the converged wireless networks. Due to the existence of different types of traffic, provisioning of Quality of Service (QoS) becomes a challenge in the wireless networks. In case of a congested network, resource allocation has emerged as an effective way to provide the excessive users with desirable QoS. Since QoS for non-real-time traffic are not as strict as for real-time traffic, the unoccupied channels of the adjacent cells can be assigned to the non-real-time traffic to retain QoS for real-time traffic. This results in the intensified bandwidth utilization as well as less interference …


Tackling Qos-Induced Aging In Exascale Systems Through Agile Path Selection, Dean Michael Ancajas, Koushik Chakraborty, Sanghamitra Roy, Jason Allred Oct 2014

Tackling Qos-Induced Aging In Exascale Systems Through Agile Path Selection, Dean Michael Ancajas, Koushik Chakraborty, Sanghamitra Roy, Jason Allred

Electrical and Computer Engineering Faculty Publications

Network-On-Chips (NoCs) have become the standard communication platform for future massively parallel systems due to their performance, flexibility and scalability advantages. However, reliability issues brought about by scaling in the sub-20nm era threaten to undermine the benefits offered by NoCs. In this paper, we showthat QoS policies exacerbate the reliability profile of an exascale system. To mitigate this imposing challenge, we propose Dynamic Wearout Resilient Routing (DWRR) algorithms in QoS-enabled exascale NoCs. Our proposal includes two novel DWRR algorithms enabled by a critical-path monitor and a broadcast-based routing configuration. Using PARSEC benchmarks, our best algorithm improves QoS and long-term sustainability …


Compositional Model Checking Of Concurrent Systems, Hao Zheng, Zhen Zhang, Chris J. Myers, Emmanuel Rodriguez, Yingying Zhang Jul 2014

Compositional Model Checking Of Concurrent Systems, Hao Zheng, Zhen Zhang, Chris J. Myers, Emmanuel Rodriguez, Yingying Zhang

Electrical and Computer Engineering Faculty Publications

This paper presents a compositional framework to address the state explosion problem in model checking of concurrent systems. This framework takes as input a system model described as a network of communicating components in a high-level description language, finds the local state transition models for each individual component where local properties can be verified, and then iteratively reduces and composes the component state transition models to form a reduced global model for the entire system where global safety properties can be verified. The state space reductions used in this framework result in a reduced model that contains the exact same …


Radio Resource Management For Dynamic Channel Borrowing Scheme In Wireless Networks, Mohammad Arif Hossain, Shakil Ahmed, Mostafa Zaman Chowdhury Jul 2014

Radio Resource Management For Dynamic Channel Borrowing Scheme In Wireless Networks, Mohammad Arif Hossain, Shakil Ahmed, Mostafa Zaman Chowdhury

Electrical and Computer Engineering Student Research

Provisioning of Quality of Service (QoS) is the key concern for Radio Resource Management now-a-days. In this paper, an efficient dynamic channel borrowing architecture has been proposed that ensures better QoS. The proposed scheme lessens the problem of excessive overall call blocking probability without sacrificing bandwidth utilization. If a channel is borrowed from an adjacent cell and causes interference, in that case we also propose architecture that diminishes the interference problem. The numerical results show comparison between the proposed scheme and the conventional scheme before channel borrowing process. The results show a satisfactory performance that are in favor of the …


A New Guard-Band Call Admission Control Policy Based On Acceptance Factor For Wireless Cellular Networks, Asadur Rahman, Mohammad Arif Hossain, Shakil Ahmed, Mostafa Zaman Chowdhury Jul 2014

A New Guard-Band Call Admission Control Policy Based On Acceptance Factor For Wireless Cellular Networks, Asadur Rahman, Mohammad Arif Hossain, Shakil Ahmed, Mostafa Zaman Chowdhury

Electrical and Computer Engineering Student Research

Utilization of limited resources and quality of service (QoS) improvement are the major concerns for wireless communication networks. Excessive call blocking is a constraint to attain the desired QoS. In cellular network, as the traffic arrival rate increases, new call blocking probability (CBP) increases considerably. Paying profound concern, we have proposed a guard-band call admission control policy that reduces the new call blocking probability with approximately steady handover call dropping probability (CDP) that ensures QoS. Our proposed scheme introduces the acceptance factor in specific guard channels where new calls get access according to the acceptance factor. The analytical results prove …


Interference Declination For Dynamic Channel Borrowing Scheme In Wireless Networks, Shakil Ahmed, Mohammad Arif Hossain, Mostafa Zaman Chowdhury Jul 2014

Interference Declination For Dynamic Channel Borrowing Scheme In Wireless Networks, Shakil Ahmed, Mohammad Arif Hossain, Mostafa Zaman Chowdhury

Electrical and Computer Engineering Student Research

In modern days, users in the wireless networks are increasing drastically. It has become the major concern for researchers to manage the maximum users with limited radio resource. Interference is one of the biggest hindrances to reach the goal. In this paper, being deep apprehension of the issue, an efficient dynamic channel borrowing scheme is proposed that ensures better Quality of Service (QoS) with interference declination. We propose that if channels are borrowed from adjacent cells, cell bifurcation will be introduced that ensures interference declination when the borrowed channels have same frequency band. We also propose a scheme that inactivates …


Radio Resource Management For Dynamic Channel Borrowing Scheme In Wireless Networks, Mohammad Arif Hossain, Shakil Ahmed, Mostafa Zaman Chowdhury Jul 2014

Radio Resource Management For Dynamic Channel Borrowing Scheme In Wireless Networks, Mohammad Arif Hossain, Shakil Ahmed, Mostafa Zaman Chowdhury

Electrical and Computer Engineering Student Research

Provisioning of Quality of Service (QoS) is the key concern for Radio Resource Management now-a-days. In this paper, an efficient dynamic channel borrowing architecture has been proposed that ensures better QoS. The proposed scheme lessens the problem of excessive overall call blocking probability without sacrificing bandwidth utilization. If a channel is borrowed from an adjacent cell and causes interference, in that case we also propose architecture that diminishes the interference problem. The numerical results show comparison between the proposed scheme and the conventional scheme before channel borrowing process. The results show a satisfactory performance that are in favor of the …


Fort-Nocs: Mitigating The Threat Of A Compromised Noc, Dean Michael Ancajas, Koushik Chakraborty, Sanghamitra Roy Jun 2014

Fort-Nocs: Mitigating The Threat Of A Compromised Noc, Dean Michael Ancajas, Koushik Chakraborty, Sanghamitra Roy

Electrical and Computer Engineering Faculty Publications

In this paper, we uncover a novel and imminent threat to an emerging computing paradigm: MPSoCs built with 3rd party IP NoCs. We demonstrate that a compromised NoC (C-NoC) can enable a range of security attacks with an accomplice software component. To counteract these threats, we propose Fort-NoCs, a series of techniques that work together to provide protection from a C-NoC in an MPSoC. Fort-NoCs's foolproof protection disables covert backdoor activation, and reduces the chance of a successful side-channel attack by "clouding" the information obtained by an attacker. Compared to recently proposed techniques, Fort-NoCs offers a substantially better protection with …


Dark Silicon Aware Multicore Systems: Employing Design Automation With Architectural Insight, Jason M. Allred, Sanghamitra Roy, Koushik Chakraborty May 2014

Dark Silicon Aware Multicore Systems: Employing Design Automation With Architectural Insight, Jason M. Allred, Sanghamitra Roy, Koushik Chakraborty

Electrical and Computer Engineering Faculty Publications

The emergence of dark silicon - a fundamental design constraint absent in past generations - brings intriguing challenges and opportunities to microprocessor design. In this brief, we demonstrate the challenges of comparing competing design styles across different technology generations in a dark silicon era. We provide a new metric to guide a dark silicon aware (DSA) system design and propose a stochastic optimization algorithm for DSA multicore system design. Our technique shows 11%-58% and 5.7-5.8 times improvement in energy efficiency for forthcoming technology generations with two multicore design styles: cores with various voltage-frequency domains and cores with heterogeneous microarchitectures. © …


Exploring High Throughput Computing Paradigm For Global Routing, Yiding Han, Dean Michael Ancajas, Koushik Chakraborty, Sanghamitra Roy Jan 2014

Exploring High Throughput Computing Paradigm For Global Routing, Yiding Han, Dean Michael Ancajas, Koushik Chakraborty, Sanghamitra Roy

Electrical and Computer Engineering Faculty Publications

With aggressive technology scaling, the complexity of the global routing problem is poised to grow rapidly. Solving such a large computational problem demands a high-throughput hardware platform such as modern graphics processing units (GPUs). In this paper, we explore a hybrid GPU-CPU high-throughput computing environment as a scalable alternative to the traditional CPU-based router. We introduce net-level concurrency (NLC), which is a novel parallel model for router algorithms and aims to exploit concurrency at the level of individual nets. To efficiently uncover NLC, we design a scheduler to create groups of nets that can be routed in parallel. At its …


Noisy Gradient Descent Bit-Flip Decoding For Ldpc Codes, G. Sundararajan, Chris J. Winstead, E. Boutillon Jan 2014

Noisy Gradient Descent Bit-Flip Decoding For Ldpc Codes, G. Sundararajan, Chris J. Winstead, E. Boutillon

Electrical and Computer Engineering Faculty Publications

A modified Gradient Descent Bit Flipping (GDBF) algorithm is proposed for decoding Low Density Parity Check (LDPC) codes on the binary-input additive white Gaussian noise channel. The new algorithm, called Noisy GDBF (NGDBF), introduces a random perturbation into each symbol metric at each iteration. The noise perturbation allows the algorithm to escape from undesirable local maxima, resulting in improved performance. A combination of heuristic improvements to the algorithm are proposed and evaluated. When the proposed heuristics are applied, NGDBF performs better than any previously reported GDBF variant, and comes within 0.5 dB of the belief propagation algorithm for several tested …