Femtocell based green power consumption methods for mobile network

This paper presents the analytical models of power consumption in macrocell, microcell, picocell and femtocell based networks. Five case studies are presented in this paper where macrocells, microcells, picocells and femtocells are deployed based on the number of mobile subscribers present in a region, mobile user traffic in that region and the area of the region where cellular coverage has to be provided. A comparative study is performed between the power consumption by the base stations in each of these five cases and that of the only macrocell based network. The simulation results demonstrate that using each of these five strategies the power consumption by the base stations can be minimized than that of only macrocell based network. Based on the power consumption by the base stations in these five schemes, we have categorized the networks into five classes, A, B, C, D and E, each of which contains cells of different types to reduce power consumption to achieve green cellular network.     

Fairness-related challenges in mobile opportunistic networking

The fundamental challenge in opportunistic networking, regardless of the application, is when and how to forward a message. Rank-based forwarding techniques currently represent one of the most promising methods for addressing this message forwarding challenge. While these techniques have demonstrated great efficiency in performance, they do not address the rising concern of fairness amongst various nodes in the network. Higher ranked nodes typically carry the largest burden in delivering messages, which creates a high potential of dissatisfaction amongst them. In this paper, we adopt a real-trace driven approach to study and analyze the trade-offs between efficiency, cost, and fairness of rank-based forwarding techniques in mobile opportunistic networks.Our work comprises three major contributions. First, we quantitatively analyze the trade-off between fair and efficient environments. Second, we demonstrate how fairness coupled with efficiency can be achieved based on real mobility traces. Third, we propose FOG, a real-time distributed framework to ensure efficiency–fairness trade-off using local information. Our framework, FOG, enables state-of-the-art rank-based opportunistic forwarding algorithms to ensure a better fairness–efficiency trade-off while maintaining a low overhead. Within FOG, we implement two real-time distributed fairness algorithms; Proximity Fairness Algorithm (PFA), and Message Context Fairness Algorithm (MCFA). Our data-driven experiments and analysis show that mobile opportunistic communication between users may fail with the absence of fairness in participating high-ranked nodes, and an absolute fair treatment of all users yields inefficient communication performance. Finally our analysis shows that FOG-based algorithms ensure relative equality in the distribution of resource usage among neighbor nodes while keeping the success rate and cost performance near optimal.     

An update-based step-wise optimal cache replacement for wireless data access

Many network applications requires access to most up-to-date information. An update event makes the corresponding cached data item obsolete, and cache hits due to obsolete data items become simply useless to those applications. Frequently accessed but infrequently updated data items should get higher preference while caching, and infrequently accessed but frequently updated items should have lower preference. Such items may not be cached at all or should be evicted from the cache to accommodate items with higher preference. In wireless networks, remote data access is typically more expensive than in wired networks. Hence, an efficient caching scheme considers both data access and update patterns can better reduce data transmissions in wireless networks. In this paper, we propose a step-wise optimal update-based replacement policy, called the Update-based Step-wise Optimal (USO) policy, for wireless data networks to optimize transmission cost by increasing effective hit ratio. Our cache replacement policy is based on the idea of giving preference to frequently accessed but infrequently updated data, and is supported by an analytical model with quantitative analysis. We also present results from our extensive simulations. We demonstrate that (1) the analytical model is validated by the simulation results and (2) the proposed scheme outperforms the Least Frequently Used (LFU) scheme in terms of effective hit ratio and communication cost.     

Generalizing the CHOKe flow protection

This paper proposes a simple and stateless active queue management (AQM) scheme, called geometric CHOKe (gCHOKe), to protect responsive flows from unresponsive ones. gCHOKe has its root in and is a generalization of the original CHOKe. It provides an additional power of protection, achieved by introducing an extra flow matching trial following each successful flow comparison of packets. The maximum number of comparisons permitted for an arrival can be controlled by a parameter called maxcomp. The quality of flow protection improves with maxcomp. Compared to the plain CHOKe (which is just the simplest case of gCHOKe), our analysis and simulations show that the scheme can achieve over 20% improvement in the bounds of both bandwidth and buffer space used by an aggressive flow. In addition, up to 14% of the total link capacity can be saved from the unresponsive flow, allowing responsive or rate-adaptive flows to obtain a better share of resources in the router.     

A high-throughput and high-capacity IPv6 routing lookup system

With the growing number of routing entries, IP routing lookup has become the major performance bottleneck in backbone routers. In this paper, a complete hardware-based routing lookup system is proposed to achieve high-throughput and high-capacity for IPv6. The proposed system is a cache-centric, hash-based architecture that contains a routing lookup application specific integrated circuit (ASIC) and a memory set. A hash function is used to reduce lookup time for the routing table and ternary content addressable memory (TCAM) effectively resolves the collision problem. The gate count of the ASIC, excluding the binary content addressable memory (BCAM), is about 5306 gates, using an in-house 0.18 μm CMOS single-poly six-metal standard cell library. The results of post-layout simulations show that the ASIC operates in 3.6 ns so that the routing lookup system approaches 260 Mega lookups per second (Mlps), which is sufficient for 100 Gbps networks. The memory density is good, with each routing entry requiring only 64 bits. Moreover, the routing table only needs 10.24 KB on-chip BCAM, 20.04 KB off-chip TCAM and 29.29 MB DRAM for 3.6 M routing entries in the proposed system.     

Adaptive fuzzy sliding mode power system stabilizer using Nussbaum gain

Power system stability is enhanced through a novel stabilizer developed around an adaptive fuzzy sliding mode approach which applies the Nussbaum gain to a nonlinear model of a single-machine infinite-bus （SMIB） and multi-machine power system stabilizer subjected to a three phase fault. The Nussbaum gain is used to avoid the positive sign constraint and the problem of controllability of the system. A comparative simulation study is presented to evaluate the achieved performance.     

Accurately estimating reflectance parameters for color and gloss reproduction

A new method is described to estimate diffuse and specular reflectance parameters using spectral images, which overcomes the dynamic range limitation of imaging devices. After eliminating the influences of illumination and camera on spectral images, reflection values are initially assumed as diffuse-only reflection components, and subjected to the least squares method to estimate diffuse reflectance parameters at each wavelength on each single surface particle. Based on the dichromatic reflection model, specular reflection components are obtained, and then subjected to the least squares method to estimate specular reflectance parameters for gloss intensity and surface roughness. Experiments were carried out using both simulation data and measured spectral images. Our results demonstrate that this method is capable of estimating diffuse and specular reflectance parameters precisely for color and gloss reproduction, without requiring preprocesses such as image segmentation and synthesis of high dynamic range images.     

Do social media literacy skills help in combating fake news spread? Modelling the moderating role of social media literacy skills in the relationship between rational choice factors and fake news sharing behaviour

This study modelled the rational factors that predict fake news sharing behaviour. It also tested the moderating role of social media literacy skills. The focus was on social media users in Nigeria. An online survey was conducted to gather the responses from participants across Nigerian geopolitical zones. Structural equation modelling (SEM) Smart PLS 3.6 was used to analyse the data. We found that information sharing, the news finds me perception, trust in social media and status-seeking lead to fake news sharing among social media users in Nigeria. Specifically, trust in social media and status-seeking had a greater effect on fake news sharing behaviour. We also found that social media literacy skills significantly moderate the relationship between information sharing, status-seeking, the news finds me perception, trust in social media and fake news sharing in such a way that the effects/relationships are stronger among those with low social media literacy skills. This outcome contributes to theory and practice which was highlighted in the concluding aspect of this study.     

The synthesis of pixelated metamaterial cross polarizer using binary wind driven optimization algorithm

Microsystem Technologies - In this paper synthesis of two wideband Metamaterial Cross Polarizer (MCPs) is proposed. The synthesis of proposed MCPs is done by using Binary Wind Driven Optimization...     

Investigating paper vs. screen in real-life hospital workflows: Performance contradicts perceived superiority of paper in the user experience

IntroductionAll hospitals in the province of Styria (Austria) are well equipped with sophisticated Information Technology, which provides all-encompassing on-screen patient information. Previous research made on the theoretical properties, advantages and disadvantages, of reading from paper vs. reading from a screen has resulted in the assumption that reading from a screen is slower, less accurate and more tiring. However, recent flat screen technology, especially on the basis of LCD, is of such high quality that obviously this assumption should now be challenged. As the electronic storage and presentation of information has many advantages in addition to a faster transfer and processing of the information, the usage of electronic screens in clinics should outperform the traditional hardcopy in both execution and preference ratings.This study took part in a County hospital Styria, Austria, with 111 medical professionals, working in a real-life setting. They were each asked to read original and authentic diagnosis reports, a gynecological report and an internal medical document, on both screen and paper in a randomly assigned order. Reading comprehension was measured by the Chunked Reading Test, and speed and accuracy of reading performance was quantified. In order to get a full understanding of the clinicians' preferences, subjective ratings were also collected.ResultsWilcoxon Signed Rank Tests showed no significant differences on reading performance between paper vs. screen. However, medical professionals showed a significant (90%) preference for reading from paper. Despite the high quality and the benefits of electronic media, paper still has some qualities which cannot provided electronically do date.