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.     

Distributed probabilistic inferencing in sensor networks using variational approximation

This paper considers the problem of distributed inferencing in a sensor network. It particularly explores the probabilistic inferencing problem in the context of a distributed Boltzmann machine-based framework for monitoring the network. The paper offers a variational mean-field approach to develop communication-efficient local algorithm for variational inferencing in distributed environments (VIDE). It compares the performance of the proposed approximate variational technique with respect to the exact and centralized techniques. It shows that the VIDE offers a much more communication-efficient solution at very little cost in terms of the accuracy. It also offers experimental results in order to substantiate the scalability of the proposed algorithm.     

Approximation Bounds for Minimum Information Loss Microaggregation

The NP-hard microaggregation problem seeks a partition of data points into groups of minimum specified size k, so as to minimize the sum of the squared euclidean distances of every point to its group's centroid. One recent heuristic provides an O(k³) guarantee for this objective function and an O(k²) guarantee for a version of the problem that seeks to minimize the sum of the distances of the points to its group's centroid. This paper establishes approximation bounds for another microaggregation heuristic, providing better approximation guarantees of O(k²) for the squared distance measure and O(k) for the distance measure.     

Bacteria-Responsive Self-Assembly of Antimicrobial Peptide Nanonets for Trap-and-Kill of Antibiotic-Resistant Strains

Bacterial trapping using nanonets is a ubiquitous immune defense mechanism against infectious microbes. These nanonets can entrap microbial cells, effectively arresting their dissemination and rendering them more vulnerable to locally secreted microbicides. Inspired by this evolutionarily conserved anti-infective strategy, a series of 15 to 16 residue-long synthetic β-hairpin peptides is herein constructed with the ability to self-assemble into nanonets in response to the presence of bacteria, enabling spatiotemporal control over microbial killing. Using amyloid-specific K114 assay and confocal microscopy, the membrane components lipoteichoic acid and lipopolysaccharide are shown to play a major role in determining the amyloid-nucleating capacity as triggered by Gram-positive and Gram-negative bacteria respectively. These nanonets displayed both trapping and killing functionalities, hence offering a direct improvement from the trap-only biomimetics in literature. By substituting a single turn residue of the non-amyloidogenic BTT1 peptide, the nanonet-forming BTT1-3A analog is produced with comparable antimicrobial potency. With the same sequence manipulation approach, BTT2-4A analog modified from BTT2 peptide showed improved antimicrobial potency against colistin-resistant clinical isolates. The peptide nanonets also demonstrated robust stability against proteolytic degradation, and promising in vivo efficacy and biosafety profile. Overall, these bacteria-responsive peptide nanonets are promising clinical anti-infective alternatives for circumventing antibiotic resistance.     

Yet another cybersecurity risk assessment framework

IT systems pervade our society more and more, and we become heavily dependent on them. At the same time, these systems are increasingly targeted in cyberattacks, making us vulnerable. Enterprise and cybersecurity responsibles face the problem of defining techniques that raise the level of security. They need to decide which mechanism provides the most efficient defense with limited resources. Basically, the risks need to be assessed to determine the best cost-to-benefit ratio. One way to achieve this is through threat modeling; however, threat modeling is not commonly used in the enterprise IT risk domain. Furthermore, the existing threat modeling methods have shortcomings. This paper introduces a metamodel-based approach named Yet Another Cybersecurity Risk Assessment Framework (Yacraf). Yacraf aims to enable comprehensive risk assessment for organizations with more decision support. The paper includes a risk calculation formalization and also an example showing how an organization can use and benefit from Yacraf.

     

Throughput analysis in censoring-based cooperative cognitive radio network with energy harvesting

An energy harvesting (EH) and cooperative cognitive radio (CR) network (CRN) is studied in this paper where CR users transmit data through a primary user (PU) channel if the channel remains idle, else an optimal number CRs helps in transmission of PU. To achieve the optimum number of CRs (ONCR) involved in cooperation, a novel scheme based on a combination of channel censoring and total error is proposed. The performance of the proposed scheme is investigated under RF harvesting scenario. The EH is dependent on sensing decision and a CR source harvests energy from PU's RF signal. The harvested energy (HE) is split into two parts: One part is used by the CR network (CRN) for its own transmission, and the other part is used for supporting PU. The effect of the energy allocation factor on total throughput is also investigated. New expressions for optimal number of CRs and throughput are developed. The effect of network parameters such as sensing time, censoring threshold, and energy allocation parameter (EAP) on throughput is investigated. Impact of distance between nodes is also studied.     

ENROUTE: An Entropy Aware Routing Scheme for Information-Centric Networks (ICN)

With the exponential growth of end users and web data, the internet is undergoing the change of paradigm from a user-centric model to a content-centric one, popularly known as information-centric networks (ICN). Current ICN research evolves around three key-issues namely (i) content request searching, (ii) content routing, and (iii) in-network caching scheme to deliver the requested content to the end user. This would improve the user experience to obtain requested content because it lowers the download delay and provides higher throughput. Existing researches have mainly focused on on-path congestion or expected delivery time of a content to determine the optimized path towards custodian. However, it ignores the cumulative effect of the link-state parameters and the state of the cache, and consequently it leads to degrade the delay performance. In order to overcome this shortfall, we consider both the congestion of a link and the state of on-path caches to determine the best possible routes. We introduce a generic term entropy to quantify the effects of link congestion and state of on-path caches. Thereafter, we develop a novel entropy dependent algorithm namely ENROUTE for searching of content request triggered by any user, routing of this content, and caching for the delivery this requested content to the user. The entropy value of an intra-domain node indicates how many popular contents are already cached in the node, which, in turn, signifies the degree of enrichment of that node with the popular contents. On the other hand, the entropy for a link indicates how much the link is congested with the traversal of contents. In order to have reduced delay, we enhance the entropy of caches in nodes, and also use path with low entropy for downloading contents. We evaluate the performance of our proposed ENROUTE algorithm against state-of-the-art schemes for various network parameters and observe an improvement of 29–52% in delay, 12–39% in hit rate, and 4–39% in throughput.

     

In-process monitoring and prediction of droplet quality in droplet-on-demand liquid metal jetting additive manufacturing using machine learning

Journal of Intelligent Manufacturing - In droplet-on-demand liquid metal jetting (DoD-LMJ) additive manufacturing, complex physical interactions govern the droplet characteristics, such as size,...