Utility‐driven construction of balanced data routing trees in wireless sensor networks

In wireless sensor networks, achieving load balancing in an energy‐efficient manner to improve the network lifetime as much as possible is still a challenging problem because in such networks, the only energy resource for sensor nodes is their battery supplies. This paper proposes a game theoretical‐based solution in the form of a distributed algorithm for constructing load‐balanced routing trees in wireless sensor networks. In our algorithm, load balancing is realized by adjusting the number of children among parents as much as possible, where child adjustment is considered as a game between the parents and child nodes; parents are considered as cooperative players, and children are considered as selfish players. The gained utility by each node is determined by means of some utility functions defined per role, which themselves determine the behavior of nodes in each role. When the game is over, each node gains the maximum benefit on the basis of its utility function, and the balanced tree is constructed. The proposed method provides additional benefits when in‐network aggregation is applied. Analytical and simulation results are provided, demonstrating that our proposed algorithm outperform two recently proposed benchmarking algorithms [1, 2], in terms of time complexity and communication overhead required for constructing the load‐balanced routing trees. Copyright © 2012 John Wiley & Sons, Ltd.     

A schedule‐based medium access control protocol for mobile wireless sensor networks

Recent advances in body area network technologies such as radio frequency identification and ham radio, to name a few, have introduced a huge gap between the use of current wireless sensor network technologies and specific needs of some important wireless sensor network applications such as medical care, disaster relief, or emergency preparedness and response. In these types of applications, the mobility of nodes can occur, leading to the challenge of mobility handling. In this paper, we address this challenge by prioritizing transmissions of mobile nodes over static nodes. This is achieved by using shorter contention windows in reservation slots for mobile nodes (the so‐called backoff technique) combined with a novel hybrid medium access control (MAC) protocol (the so‐called versatile MAC). The proposed protocol advocates channel reuse for bandwidth efficiency and management purpose. Through extensive simulations, our protocol is compared with other MAC alternatives such as time division multiple access and IEEE 802.11 with request to send/clear to send exchange, chosen as benchmarks. The performance metrics used are bandwidth utilization, fairness of medium access, and energy consumption. The superiority of versatile MAC against the studied benchmark protocols is established with respect to these metrics. Copyright © 2012 John Wiley & Sons, Ltd.     

Exploiting Multichannel Diversity in Spectrum Sharing Systems Using Optimal Stopping Rule

This letter studies the problem of exploiting multichannel diversity in a spectrum sharing system, where the secondary user (SU) sequentially explores channel state information on the licensed channels with time consumption. To maximize the expected achievable throughput for the SU, we formulate this problem as an optimal stopping problem, whose objective is to choose the right channel to stop exploration based on the observed signal‐to‐noise ratio sequence. Moreover, we propose a myopic but optimal rule, called one‐stage look‐ahead rule, to solve the stopping problem.     

Inhibition study of Erioglaucine disodium salt on carbon steel in hydrochloric acid medium using weight loss,electrochemical and thermodynamic properties

The corrosion inhibitory action of Erioglaucine disodium salt (EDS) on carbon steel in acid medium was evaluated by weight loss measurement, impedance and polarization studies. The increased inhibitory action against corrosion in the presence of inhibitor with increased of Erioglaucine disodium salt concentration. The effect of concentration and temperature studies were performed on the inhibition effect. The adsorption efficiency of Erioglaucine disodium salt was corroborated with high capacitive loop of Nyquist plot. The polarization behavior of Erioglaucine disodium salt concentration has been recorded showed it behaved as mixed type nature in acid medium. The enhancement in the inhibition action on the carbon steel has increased with increasing inhibitor concentration. The Langmuir adsorption isotherm gave information about the adsorption mode with carbon steel. Thermodynamic properties (ΔS¹, ΔH¹, ΔG° and E_a) of the Erioglaucine of the adsorption reaction were measured from the temperature effect. The hydrogen gas evolution measurement showed the strong adsorption nature of the inhibitor with the metal surface. The surface protection effect of Erioglaucine disodium salt on the carbon steel has studied with SEM and FTIR analysis.     

A semi-Markov decision process-based joint call admission control for inter-RAT cell re-selection in next generation wireless networks

In the next generation wireless networks (NGWNs), where different radio access technologies (RAT) will coexist and work in collaboration to provide ubiquitous access, a mechanism called Joint Call Admission Control (JCAC) will play an important role by deciding whether or not an incoming service request will be accepted according to an admission constraint as well as determining in which RAT (among the available) it will be connected. In this paper, we propose an optimal JCAC for inter-RAT cell re-selection problem also referred to as initial RAT selection in co-located wireless networks, which supports both real-time services and non-real-time services. To properly meet the JCAC goals, we propose a cost function that weigh two criteria: the blocking cost function, which takes into account the priority of each service class in each RAT, and the alternative acceptance cost, which reflects the multiplicity of RATs working in a collaborative fashion, mandatory in NGWN. We use the framework of Semi-Markov Decision Process (SMDP) to formulate the optimization problem and the value iteration algorithm to compute the optimal policy. Our model still takes into consideration the ratio between the radius of the co-located RATs and shows how it may impact on optimal initial RAT selection. Numerical results, supported by an analysis of the structure of the optimal policy, show that the proposed optimal JCAC selects for real-time service class the biggest RAT and for non-real-time service class the smallest one. This optimal JCAC policy is ratified by the current trend in the design of NGWN and also follows the 3rd Generation Partnership Project (3GPP) expectations.     

Ant Colony Optimization Based Sub-channel Allocation Algorithm for Small Cell HetNets

Two-tier heterogeneous networks (HetNets) composed of a conventional macrocellular network and small cell networks (SCNs) have been proposed in the literature with the aim to extend indoor coverage and realize efficient radio resource usage. As SCN shares the same frequency band with the underlying macrocell, the cross tier interference needs to be mitigated since the inter-SCN and cross tier interference at the SCN boundary may result in undesirable network performance degradation. In this paper, we propose an intelligent physical resource block (PRB) allocation as a solution to mitigate the downlink intra-SCN interference as well as the inter-tier interference in OFDM-based systems. The allocation of the PRBs to the network users is formulated as a graph coloring problem, and solved using an ant colony optimization (ACO)-based approach. Simulation results are provided, showing that our ACO-based algorithm outperforms the Received Power-based Allocation (RPA) and Received SINR-based Allocation (RSA) algorithms in terms of average SINR experienced by network users, outage probability, and number of required PRBs.     

IEEE Canadian Conference on Electrical and Computer Engineering 2008

The annual IEEE Canadian Conference on Electrical and Computer Engineering (CCECE) provides a forum for the presentation and discussion of high-quality technical papers that encompass a wide range of disciplines within electrical and computer engineering. The 21st episode of the CCECE very well matched the conference theme ?Wonders of Technology,? featuring seven mini-symposia that included about 90 technical paper sessions. There were new initiatives in this conference, and they included full-paper submission and elaborate technical review; and a technical focus in the form of symposia. We sincerely hope that a new era is born for the Canadian flagship conference CCECE with its focused approach and peer-reviewed, high-quality, full-paper submissions.     

A comparative simulation study on the power–performance of multi-core architecture

Nowadays, multi-core processor is the main technology used in desktop PCs, laptop computers and mobile hardware platforms. As the number of cores on a chip keeps increasing, it adds up the complexity and impacts more on both power and performance of a processor. In multi-processors, the number of cores and various parameters, such as issue-width, number of instructions and execution time, are key design factors to balance the amount of thread-level parallelism and instruction-level parallelism. In this paper, we perform a comprehensive simulation study that aims to find the optimum number of processor cores in desktop/laptop computing processor models with shallow pipeline depth. This paper also explores the trade-off between the number of cores and different parameters used in multi-processors in terms of power–performance gains and analyzes the impact of 3D stacking on the design of simultaneous multi-threading and chip multiprocessing. Our analysis shows that the optimum number of cores varies with different classes of workloads, namely: SPEC2000, SPEC2006 and MiBench. Simulation study is presented using architectures with shorter pipeline depth, showing that (1) the optimum number of cores for power–performance is 8, (2) the optimum number of threads in the range [2, 4], and (3) for beyond 32 cores, multi-core processors are no longer efficient in terms of performance benefits and overall power consumption.     

Variable Cyclic Prefix for Contention-Based Wireless Access in OFDM-Based Vehicular Communication Systems

In vehicular environment, signal transmissions face more challenges than in indoor wireless local area systems. In such an unpredictable communication environment, multipath fading causes high bit error rate, which leads to higher dropping probability of packets. In order to reduce the dropping probability of handshaking packets without increasing the infrastructure capability, we propose to modify the traditional cyclic prefix into a variable cyclic prefix (VCP) of request-to-send and clear-to-send frames. By reducing the handshaking packet error rates, we improve the contention ability in carrier sense multiple access with collision avoidance scheme in vehicle-to-infrastructure transmission. Suitable VCP time slots and dynamically adjustable VCPs are predicted based on the analysis of appropriate environmental parameters.     

Performance Analysis of Two Dimensional Spreading for OFCDM Femtocell Users Overlaid with OFDM Macrocell

Femtocells provide indoor coverage for voice and high speed data services and are self-deployed by end-users. Orthogonal frequency code division multiplexing (OFCDM) is a multi-carrier spread spectrum technique that utilizes two dimensional spreading in time and frequency domains simultaneously to improve frequency diversity and minimize multiuser access interference. In this paper, variable spreading factor (VSF)-OFCDM is employed in subcarrier allocation for femto users (FUEs) in a hybrid femto/macro network, and the effect of FUE deployment on macro users (MUEs) is studied. We evaluate the bit error rate (BER) performance of FUEs and MUEs through Monte Carlo simulation under various load conditions in noise and interference-limited scenarios. Relationship between the channel load and optimum spreading factor employed by FUEs for the given network configuration, is also analyzed. We provide various graphs showing the impact of FUE spreading factor on the MUE BER. We note that in interference-limited conditions, $4\times 8$ spreading $(\text{ time}\times \text{ freq}.)$ proves to be the best choice for macro users; and for the noise-limited case, when there are limited number of users and channel noise is dominant, $2\times 16$ spreading is the optimum choice for the considered hybrid network configuration. We also evaluate the effect of femto wall penetration loss on macro BER for various spreading factors. The favorable spreading factor for MUEs is tabulated for different loads and different number of subcarriers, which can be used as a deployment guide in this heterogeneous network.