Publication Types:

Sort by year:

Power-efficient Routing for SDN with Discrete Link Rates and Size-limited Flow Tables: a Tree-based Particle Swarm Optimization Approach

Journal Paper
Mohamad Khattar Awad, Mohammed El-Shafei, Tassos Dimitriou, Yousef Rafique, Mohammed W. Baidas, Ammar H. Alhusaini
Wiley International Journal of Network Management
Publication year: 2017

Software defined networking (SDN) is a promising networking paradigm for achieving programmability and centralized control in communication networks. These features simplify network management and enable innovation in network applications and services such as routing, virtual machine migration, load balancing, security, access control, and traffic engineering. The routing application can be optimized for power efficiency by routing flows and coalescing them such that the least number of links is activated with the lowest link rates. However, in practice, flow coalescing can generally overflow the flow tables, which are implemented in a size-limited and power-hungry ternary content addressable memory (TCAM). In this paper, a set of practical constraints are imposed to the SDN routing problem, namely size-limited flow table and discrete link rate constraints, to ensure applicability in real networks. Because the problem is NP-hard and difficult to approximate, a low-complexity particle swarm optimization-based and power-efficient routing (PSOPR) heuristic is proposed. Performance evaluation results revealed that PSOPR achieves more than 90% of the optimal network power consumption while requiring only 0.0045% to 0.9% of the optimal computation time in real network topologies. In addition, PSOPR generates shorter routes than the optimal routes generated by CPLEX.

Distributed and Load Adaptive Energy Management Algorithm for Ethernet Green Routers

Journal Paper
Mohamad Khattar Awad, Phone Lin, and Gi-Ren Liu
Journal of Internet Technology, 10.6138/JIT.2018.19.6.20161017
Publication year: 2017

The existing Ethernet networks are designed with high redundancy and over-dimensioning so they can provide reliable services during peak traffic demand periods. However, this has increased the total energy consumption and operational cost. In this paper, we propose an energy saving algorithm (ESA) to reduce the energy consumption of green routers by considering the buffer status and the traffic load. We develop a Network Simulator, version 2, (NS-2)–based simulation model for ESA to evaluate its performance with respect to real traffic traces. Performance bounds of the proposed algorithm are derived. Numerical evaluations are conducted to verify the accuracy of the simulation model against derived bounds. Performance evaluations demonstrate that the proposed algorithm outperforms candidate algorithms, thereby providing greater energy savings with an acceptable packet delay and loss. We show that the introduced delay is bounded by an upper bound that is slightly larger than half of the sleep timer. Furthermore, performance comparisons are extensive and detailed, thus providing insights into the performance of different energy saving functions considered by the candidate algorithms.

Energy Harvesting-Aided Spectrum Sensing and Data Transmission in Heterogeneous Cognitive Radio Sensor Network

Journal Paper
D. Zhang and Z. Chen and J. Ren and N. Zhang and M. Awad and H. Zhou and X. Shen
IEEE Transactions on Vehicular Technology, Vol. 66, no. 1, Pages 831- 841.
Publication year: 2017

The incorporation of Cognitive Radio (CR) and Energy Harvesting (EH) capabilities in wireless sensor networks enables spectrum and energy efficient heterogeneous cognitive radio sensor networks (HCRSNs). The new networking paradigm of HCRSNs consists of EH-enabled spectrum sensors and batterypowered data sensors. Spectrum sensors can cooperatively scan the licensed spectrum for available channels, while data sensors monitor an area of interest and transmit sensed data to the sink over those channels. In this work, we propose a resource allocation solution for the HCRSN to achieve the sustainability of spectrum sensors and conserve energy of data sensors. The proposed solution is achieved by two algorithms that operate in tandem, a spectrum sensor scheduling algorithm and a data sensor resource allocation algorithm. The spectrum sensor scheduling algorithm allocates channels to spectrum sensors such that the average detected available time for the channels is maximized, while the EH dynamics are considered and PU transmissions are protected. The data sensor resource allocation algorithm allocates the transmission time, power and channels such that the energy consumption of the data sensors is minimized. Extensive simulation results demonstrate that the energy consumption of the data sensors can be significantly reduced while maintaining the sustainability of the spectrum sensors.

Secure and scalable aggregation in the smart grid resilient against malicious entities

Journal Paper
Tassos Dimitriou, Mohamad Khattar Awad
Elsevier, Ad Hoc Networks, vol. 50, no. 1, 2016, pp. 58 - 67
Publication year: 2016

The smart electricity grid introduces new opportunities for fine-grained consumption monitoring. Such functionality, however, requires the constant collection of electricity data that can be used to undermine consumer privacy. In this work, we address this problem by proposing two decentralized protocols to securely aggregate the measurements of n smart meters. The first protocol is a very lightweight one, it uses only symmetric cryptographic primitives and provides security against honest-but-curious adversaries. The second protocol is public-key based and considers the malicious adversarial model; malicious entities not only try to learn the private measurements of smart meters but also disrupt protocol execution. Both protocols do not rely on centralized entities or trusted third parties to operate. Additionally, we show that they are highly scalable owning to the fact that every smart meter has to interact with only a few others, thus requiring only O(1) work and memory overhead. Finally, we implement a prototype based on our proposals and we evaluate its performance in realistic deployment settings.

Energy-aware Routing for Software-defined Networks with Discrete Link Rates: A Benders Decomposition-based Heuristic Approach

Journal Paper
Mohamad Khattar Awad Yousef Rafique Rym A. M’Hallah
Sustainable Computing: Informatics and Systems,
Publication year: 2016

The energy efficiency of wired networks has received considerable attention over the past decade due to its economic and environmental impacts. However, because of the vertical integration of the control and data planes in conventional networks, optimizing energy consumption in such networks is challenging. Software-defined networking (SDN) is an emerging networking paradigm that decouples the control plane from the data plane and introduces network programmability for the development of network applications. In this work, we propose an energy-aware integral flow-routing solution to improve the energy efficiency of the SDN routing application. We consider discreteness of link rates and pose the routing problem as a Mixed Integer Linear Programming (MILP) problem, which is known to be NP complete. The proposed solution is a heuristic implementation of the Benders decomposition method that routes additional single and multiple flows without resolving the routing problem. Performance evaluations demonstrate that the proposed solution achieves a close-to-optimal performance (within 3.27% error) compared to CPLEX on various topologies with less than 0.056% of CPLEX average computation time. Furthermore, our solution outperforms the shortest path algorithm by 24.12% to 54.35% in power savings.

Towards Energy-Efficient and Robust Large-Scale WSNs: A Scale-Free Network Approach

Journal Paper
Haixia Peng, Shuaizong Si, Mohamad Khattar Awad, Ning Zhang, Hai Zhao, Sherman Shen
IEEE Journal on Selected Areas in Communications, Vol. 34, no. 12, Pages 4035 - 4047
Publication year: 2016

Due to the limited battery power of sensor nodes and harsh deployment environment, it is of fundamental importance and great challenge to achieve high energy efficiency and strong robustness in large-scale wireless sensor networks (LS-WSNs). To this end, we propose two self-organizing schemes for LS-WSNs. The first scheme is the energy-aware common neighbor (ECN) scheme, which considers the neighborhood overlap in link establishment. The second scheme is energy-aware low potential-degree common neighbor (ELDCN) scheme, which takes both neighborhood overlap in topology formation and the potential degrees of common neighbors into consideration. Both schemes generate clustering-based and scale-free-inspired LS-WSNs, which are energy-efficient and robust. However, the ELDCN scheme shows higher energy efficiency and stronger robustness to node failures because it avoids establishing links to hub-nodes with high potential connectivity. Analytical and simulation results demonstrate that our proposed schemes outperform the existing scale-free evolution models in terms of energy efficiency and robustness.

Utility-optimal Resource Management and Allocation Algorithm for Energy Harvesting Cognitive Radio Sensor Networks

Journal Paper
D. Zhang and Z. Chen and M. K. Awad and N. Zhang and H. Zhou and X. S. Shen
IEEE Journal on Selected Areas in Communications, Vol. 34, no. 12, Pages 3552 - 3565
Publication year: 2016

In this paper, we study resource management and allocation for Energy Harvesting Cognitive Radio Sensor Networks (EHCRSNs). In these networks, energy harvesting supplies the network with a continual source of energy to facilitate self-sustainability of the power-limited sensors. Furthermore, cognitive radio enables access to the underutilized licensed spectrum to mitigate the spectrum-scarcity problem in the unlicensed band. We develop an aggregate network utility optimization framework for the design of an online energy management, spectrum management and resource allocation algorithm based on Lyapunov optimization. The framework captures three stochastic processes: energy harvesting dynamics, inaccuracy of channel occupancy information, and channel fading. However, a priori knowledge of any of these processes statistics is not required. Based on the framework, we propose an online algorithm to achieve two major goals: first, balancing sensors’ energy consumption and energy harvesting while stabilizing their data and energy queues; second, optimizing the utilization of the licensed spectrum while maintaining a tolerable collision rate between the licensed subscriber and unlicensed sensors. Performance analysis shows that the proposed algorithm achieves a close-to-optimal aggregate network utility while guaranteeing bounded data and energy queue occupancy. Extensive simulations are conducted to verify the effectiveness of the proposed algorithm and the impact of various network parameters on its performance.

On the optimality of escalating penalties for repeat offences against the academic honour code

Journal Paper
M. K. Awad, B. Zogheib, and H. AlAzemi,
Taylor and Francis Group, Applied Economics, No. 7, Vol. 47, 2015, pp. 553-562
Publication year: 2015

Although academic dishonesty has a long history in academia, its pervasiveness has recently reached an alarming level. Academic dishonesty not only undermines the purpose of education and the assessment process but also threatens the creditability of academic records. We propose a framework for analysing students’ behaviour with respect to academic policies and honour codes. We draw an analogy between law enforcement and academic integrity enforcement and highlight similarities and differences. The proposed framework captures major determinants of academic dishonesty reported in the literature, namely detection probability, punishment severity, class average and record of academic deviance. The framework models both students’ development of nonacademic skills to improve their grades and teaching assistants’ development of detection skills, which both affect the detection probability. Our analysis demonstrates that the optimality of escalating penalties is conditional on the offenders and academic policy enforcers learning. Use-case scenarios are presented to facilitate the implementation of our results in classrooms.

Errata: Recursive Least-Squares Source Tracking using One Acoustic Vector Sensor

Journal Paper
M. K. Awad and K. T. Wong.
IEEE Transactions on Aerospace & Electronic Systems, Vol. 49, Jan., 2013, pp. 688-692.
Publication year: 2013

The above paper (Awad M. K. and Wong K. T., Recursive Least-Squares Source Tracking using One Acoustic Vector Sensor, IEEE Transactions on Aerospace and Electronic Systems, 48, 4 (Oct. 2012), 3073—3083) was published with incomplete figures. The correct figures appears below.

Recursive Least-Squares Source Tracking Using One Acoustic Vector Sensor

Journal Paper
M. K. Awad and K. T. Wong
IEEE Transactions on Aerospace & Electronic Systems, Vol. 48, Oct., 2012, pp. 3073-3083.
Publication year: 2012

An acoustic vector-sensor (a.k.a. vector-hydrophone) is composed of three acoustic velocity-sensors, plus a collocated pressure-sensor, all collocated in space. The velocity-sensors are identical, but orthogonally oriented, each measuring a different Cartesian component of the three-dimensional particle-velocity field. This acoustic vector-sensor offers an azimuth-elevation response that is invariant with respect to the source’s centre frequency or bandwidth. This acoustic vector-sensor is adopted here for recursive least-squares (RLS) adaptation, to track a single mobile source, in the absence of any multi path fading and any directional interference. A formula is derived to preset the RLS forgetting factor, based on the prior knowledge of only the incident signal power, the incident source’s spatial random walk variance, and the additive noise power. The work presented here further advances a multiple-forgetting-factor (MFF) version of the RLS adaptive tracking algorithm, that requires no prior knowledge of these aforementioned source statistics or noise statistics. Monte Carlo simulations demonstrate the tracking performance and computational load of the proposed algorithms.

Design of Fair Weights for Heterogeneous Traffic Scheduling in Multichannel Wireless Networks

Journal Paper
M. Mehrjoo, M. K. Awad, M. Dianati and X. S. Shen
IEEE Transactions on Communications, Vol. 58, Oct, 2010, pp. 2892 - 2902.
Publication year: 2010

Fair weights have been implemented to maintain fairness in recent resource allocation schemes. However, designing fair weights for multiservice wireless networks is not trivial because users’ rate requirements are heterogeneous and their channel gains are variable. In this paper, we design fair weights for opportunistic scheduling of heterogeneous traffic in orthogonal frequency division multiple access (OFDMA) networks. The fair weights determine each user’s share of rate for maintaining a utility notion of fairness. We then present a scheduling scheme which enforces users’ long term average transmission rates to be proportional to the fair weights. The proposed scheduler takes the advantage of users’ channel state information and the inherent flexibility of OFDMA resource allocation for efficient resource utilization. Furthermore, using the fair weights allows flexibility for realization of different scheduling schemes which accommodate a variety of requirements in terms of heterogeneous traffic types and user mobility. Simulation based performance analysis is presented to demonstrate efficacy of the proposed solution in this paper.

A Dual-Decomposition-Based Resource Allocation for OFDMA Networks With Imperfect CSI

Journal Paper
M. K. Awad, V. Mahinthan, M. Mehrjoo, X. Shen and J. W. Mark
IEEE Transactions on Vehicular Technology, Vol. 59, Jun., 2010, pp. 2394 -2403.
Publication year: 2010

This paper presents a novel scheme for the allocation of subcarriers, rates, and power in orthogonal frequency-division multiple-access (OFDMA) networks. The scheme addresses practical implementation issues of resource allocation in OFDMA networks: the inaccuracy of channel-state information (CSI) available to the resource allocation unit (RAU) and the diversity of subscribers’ quality-of-service (QoS) requirements. In addition to embedding the effect of CSI imperfection in the evaluation of the subscribers’ expected rate, the resource-allocation problem is posed as a network utility maximization (NUM) one that is solved via decomposing it into a hierarchy of subproblems. These subproblems coordinate their allocations to achieve a final allocation that satisfies aggregate rate constraints imposed by the call-admission control (CAC) unit and OFDMA-related constraints. A complexity analysis shows that the proposed scheme is computationally efficient. In addition, performance evaluation findings support our theoretical claims: A substantial data rate gain can be achieved by considering the CSI imperfection, and multiservice classes can be supported with QoS guarantees.

Ergodic mutual information of OFDMA-based Selection-Decode-and-Forward cooperative relay networks with imperfect CSI

Journal Paper
Mohamad Khattar Awad, Xuemin (Sherman) Shen, Bashar Zogheib
Elsevier Physical Communication, Vol. 2. 2009, pp. 184 - 193.
Publication year: 2009

This paper presents a novel approach to investigate ergodic mutual information of OFDMA Selection-Decode-and-Forward (SDF) cooperative relay networks with imperfect channel state information (CSI). Relay stations are either dedicated or non-dedicated (i.e., subscriber stations assisting other subscriber stations). The CSI imperfection is modeled as an additive random variable with known statistics. Numerical evaluations and simulations demonstrate that by considering the CSI imperfection based on a priori knowledge of the estimation error statistics, a substantial gain can be achieved in terms of ergodic mutual information which makes channel adaptive schemes closer to practical implementations.

An Integrated Overview of the Open Literature's Empirical Data on the Indoor Radiowave Channel's Delay Properties

Journal Paper
Mohamad Khattar Awad, K.T. Wong, Zheng-bin Li
IEEE Transactions on Antennas and Propagation, Vol. 56, may., 2008, pp. 1451 -1468.
Publication year: 2008

A comprehensive and integrative overview (excluding ultrawideband measurements) is given of all the empirical data available from the open literature on various temporal properties of the indoor radiowave communication channel. The concerned frequency range spans over 0.8-8 GHz. Originally, these data were presented in about 70 papers in various journals, at diverse conferences, and in different books. Herein overviewed are the multipaths’ amplitude versus arrival delay, the probability of multipath arrival versus arrival delay, the multipath amplitude’s temporal correlation, the power delay profile and associated time dispersion parameters (e.g., the RMS delay spread and the mean delay), the coherence bandwidth, and empirically ldquotunedrdquo tapped-delay-line models. Supported by the present authors’ new analysis, this paper discusses how these channel-fading metrics depend on the indoor radiowave propagation channel’s various properties, (e.g., the physical environment, the floor layout, the construction materials, the furnishing’s locations and electromagnetic properties) as well as the transmitted signal’s carrier-frequency, the transmitting-antenna’s location, the receiving-antenna’s location, and the receiver’s detection amplitude threshold.