Dynamic power management approaches based on neural network

Dynamic Power Management (DPM) is a technique to reduce power consumption of electronic system. by selectively shutting down idle components. In this article we try to introduce back propagation network and radial basis network into the research of the system-level policies. We proposed two PAY policies-Back propagation Power Management (BPPM) and Radial Basis Function Power management (RBFPM) which are based on Artificial Neural Networks (ANN). Our experiments show that the two power management policies greatly lowered the system-level power consumption and have higher performance than traditional Power Management(PM) techniques-BPPM is 1.09-competitive and RBFPM is 1.08-competitive vs. 1.79,145,1.18-competitive separately for traditional timeout PM, adaptive predictive PM and stochastic PM.

SOC dynamic power management using artificial neural network

Dynamic Power Management (DPM) is a technique to reduce power consumption of electronic system by selectively shutting down idle components. In this article we try to introduce back propagation network and radial basis network into the research of the system-level power management policies. We proposed two PM policies-Back propagation Power Management (BPPM) and Radial Basis Function Power Management (RBFPM) which are based on Artificial Neural Networks (ANN). Our experiments show that the two power management policies greatly lowered the system-level power consumption and have higher performance than traditional Power Management(PM) techniques-BPPM is 1.09-competitive and RBFPM is 1.08-competitive vs. 1.79 . 1.45 . 1.18-competitive separately for traditional timeout PM . adaptive predictive PM and stochastic PM.

Efficiency Dynamics on Two Coupled Small-World Networks

We investigate the effect of clusters in complex networks on efficiency dynamics by studying a simple efficiency model in two coupled small-world networks. It is shown that the critical network randomness corresponding to transition from a stagnant phase to a growing one decreases to zero as the connection strength of clusters increases. It is also shown for fixed randomness that the state of clusters transits from a stagnant phase to a growing one as the connection strength of clusters increases. This work can be useful for understanding the critical transition appearing in many dynamic processes on the cluster networks.

Fabrication and characterization of microstructured and pH sensitive interpenetrating networks hydrogel films and application in drug delivery field

Novel microstructured and pH sensitive poly(acryliac acid-co-2-hydroxyethyl methacrylate)/poly(vinyl alcohol) (P(AA-co-HEMA)/PVA) interpenetrating network (IPN) hydrogel films were prepared by radical precipitation copolymerization and sequential IPN technology. The first P(AA-co-HEMA) network was synthesized in the present of IPN aqueous solution by radical initiating, then followed by condensation reaction (Glutaraldehyde as crosslinking agent) within the resultant latex, it formed multiple IPN microstructured hydrogel film. The film samples were characterized by IR, SEM and DSC. Swelling and deswelling behaviors and mechanical property showed the novel multiple IPN nanostuctured film had rapid response and good mechanical property. The IPN films were studied as controlled drug delivery material in different pH buffer solution using cationic compound, crystal violet as a model drug.

Dynamic mechanical studies of the sulfonated butyl rubber ionomers and their blends

Dynamic mechanical properties of sulfonated butyl rubber ionomers neutralized with different amine or metallic ion (zinc or barium) and their blends with polypropylene (PP), high-density polyethylene (HDPE), or styrene-butadiene-styrene (SBS) triblock copolymer were studied using viscoelastometry. The results showed that glass transition temperatures of ion pair-containing matrix and ionic domains (T-g1 and T-g2, respectively) of amine-neutralized ionomers were lower than those of ionomers neutralized with metallic ions, and the temperature range of the rubbery plateau on the storage modulus plot for amine-neutralized ionomers was narrower. The modulus of the rubbery plateau for amine-neutralized ionomers was lower than that of ionomers neutralized with zinc or barium ion. With increasing size of the amine, the temperature range for the rubbery plateau decreased, and the height of the loss peak at higher temperature increased. Dynamic mechanical properties of blends of the zinc ionomer with PP or HDPE showed that, with decreasing ionomer content, the T-m of PP or HDPE increased and T-g1 decreased, whereas T-g2 or the upper loss peak temperature changed only slightly. The T-g1 for the blend with SBS also decreased with decreasing ionomer content. The decrease of T-g1 is attributed to the enhanced compatibilization of the matrix of the ionomer-containing ion pairs with amorphous regions of PP or HDPE or the continuous phase of SBS due to the formation of thermoplastic interpenetrating polymer networks by ionic domains and crystalline or glassy domains.

MORPHOLOGY AND DYNAMIC MECHANICAL-PROPERTIES OF AB CROSS-LINKED POLYMERS BASED ON POLYURETHANES

Polyoxypropylene glycol (PPG) (or castor oil) and toluene diisocyanate (TDI) were mixed, and the prepolymer polyurethane (PU) (I) was formed. Vinyl-terminated polyurethane (II) was prepared from (I), and hydroxyethyl acrylate, AB crosslinked polymers (ABCPs) were synthesized from (II) and vinyl monomers such as styrene, methyl methacrylate, vinyl acetate, etc. The dynamic mechanical properties and morphology of ABCPs were measured. The ABCPs based on PPG have double glass transition temperatures (T(g)) on the sigma-vs. temperature curves. They display a two-phase morphology with plastic components forming the continous phase and PU-rich domains forming the separated phase on the electron micrographs. Irregular shapes and a highly polydisperse distribution of PU-rich domain sizes were observed. The crosslink density of ABCPs has a notable effect on the morphology and properties. The average diameter of the PU-rich domains depends on the molecular weight of prepolymer PPG. The highly crosslinked structures will produce large numbers of very small domains. ABCPs based on castor oil show a single T(g) relaxation on the dynamic mechanical spectra. The compatibility between the two components is much better in ABCPs based on castor oil than in those based on PPG, because there is a high crosslink density in the former. Comparison of the dynamic mechanical spectra of ABCP and interpenetrating networks (IPN) based on castor oil with similar crosslink density and composition imply that the two components in ABCP are compatible whereas microphase separation occurs in IPN. An improvement in the compatibility is achieved by the crosslinking between the two networks.

自动生产线和柔性制造系统的建模、分析与控制

自动生产线和柔性制造系统是典型的离散事件动态系统,近几年在控制理论界受到极大重视。本文首先对自动生产线的建模与分析的研究概况做了综述,重点放在排队网络模型。然后介绍了柔性制造系统的管理与控制问题。

Reliable Interconnection Networks for Parallel Computers

This technical report describes a new protocol, the Unique Token Protocol, for reliable message communication. This protocol eliminates the need for end-to-end acknowledgments and minimizes the communication effort when no dynamic errors occur. Various properties of end-to-end protocols are presented. The unique token protocol solves the associated problems. It eliminates source buffering by maintaining in the network at least two copies of a message. A token is used to decide if a message was delivered to the destination exactly once. This technical report also presents a possible implementation of the protocol in a worm-hole routed, 3-D mesh network.

Performance evaluation of the RPL Protocol in fixed and mobile sinks low-power and lossy networks.

Low-Power and Lossy-Network (LLN) are usually composed of static nodes, but the increase demand for mobility in mobile robotic and dynamic environment raises the question how a routing protocol for low-power and lossy-networks such as (RPL) would perform if a mobile sink is deployed. In this paper we investigate and evaluate the behaviour of the RPL protocol in fixed and mobile sink environments with respect to different network metrics such as latency, packet delivery ratio (PDR) and energy consumption. Extensive simulation using instant Contiki simulator show significant performance differences between fixed and mobile sink environments. Fixed sink LLNs performed better in terms of average power consumption, latency and packet delivery ratio. The results demonstrated also that RPL protocol is sensitive to mobility and it increases the number of isolated nodes.

Measuring Bottleneck Link Speed in Package-Switched Networks

The quality of available network connections can often have a large impact on the performance of distributed applications. For example, document transfer applications such as FTP, Gopher and the World Wide Web suffer increased response times as a result of network congestion. For these applications, the document transfer time is directly related to the available bandwidth of the connection. Available bandwidth depends on two things: 1) the underlying capacity of the path from client to server, which is limited by the bottleneck link; and 2) the amount of other traffic competing for links on the path. If measurements of these quantities were available to the application, the current utilization of connections could be calculated. Network utilization could then be used as a basis for selection from a set of alternative connections or servers, thus providing reduced response time. Such a dynamic server selection scheme would be especially important in a mobile computing environment in which the set of available servers is frequently changing. In order to provide these measurements at the application level, we introduce two tools: bprobe, which provides an estimate of the uncongested bandwidth of a path; and cprobe, which gives an estimate of the current congestion along a path. These two measures may be used in combination to provide the application with an estimate of available bandwidth between server and client thereby enabling application-level congestion avoidance. In this paper we discuss the design and implementation of our probe tools, specifically illustrating the techniques used to achieve accuracy and robustness. We present validation studies for both tools which demonstrate their reliability in the face of actual Internet conditions; and we give results of a survey of available bandwidth to a random set of WWW servers as a sample application of our probe technique. We conclude with descriptions of other applications of our measurement tools, several of which are currently under development.

TCP Boston: A Fragmentation-tolerant TCP Protocol for ATM Networks

The popularity of TCP/IP coupled with the premise of high speed communication using Asynchronous Transfer Mode (ATM) technology have prompted the network research community to propose a number of techniques to adapt TCP/IP to ATM network environments. ATM offers Available Bit Rate (ABR) and Unspecified Bit Rate (UBR) services for best-effort traffic, such as conventional file transfer. However, recent studies have shown that TCP/IP, when implemented using ABR or UBR, leads to serious performance degradations, especially when the utilization of network resources (such as switch buffers) is high. Proposed techniques-switch-level enhancements, for example-that attempt to patch up TCP/IP over ATMs have had limited success in alleviating this problem. The major reason for TCP/IP's poor performance over ATMs has been consistently attributed to packet fragmentation, which is the result of ATM's 53-byte cell-oriented switching architecture. In this paper, we present a new transport protocol, TCP Boston, that turns ATM's 53-byte cell-oriented switching architecture into an advantage for TCP/IP. At the core of TCP Boston is the Adaptive Information Dispersal Algorithm (AIDA), an efficient encoding technique that allows for dynamic redundancy control. AIDA makes TCP/IP's performance less sensitive to cell losses, thus ensuring a graceful degradation of TCP/IP's performance when faced with congested resources. In this paper, we introduce AIDA and overview the main features of TCP Boston. We present detailed simulation results that show the superiority of our protocol when compared to other adaptations of TCP/IP over ATMs. In particular, we show that TCP Boston improves TCP/IP's performance over ATMs for both network-centric metrics (e.g., effective throughput) and application-centric metrics (e.g., response time).

TCP over CDMA2000 Networks: A Cross-Layer Measurement Study

Modern cellular channels in 3G networks incorporate sophisticated power control and dynamic rate adaptation which can have a significant impact on adaptive transport layer protocols, such as TCP. Though there exists studies that have evaluated the performance of TCP over such networks, they are based solely on observations at the transport layer and hence have no visibility into the impact of lower layer dynamics, which are a key characteristic of these networks. In this work, we present a detailed characterization of TCP behavior based on cross-layer measurement of transport, as well as RF and MAC layer parameters. In particular, through a series of active TCP/UDP experiments and measurement of the relevant variables at all three layers, we characterize both, the wireless scheduler in a commercial CDMA2000 network and its impact on TCP dynamics. Somewhat surprisingly, our findings indicate that the wireless scheduler is mostly insensitive to channel quality and sector load over short timescales and is mainly affected by the transport layer data rate. Furthermore, we empirically demonstrate the impact of the wireless scheduler on various TCP parameters such as the round trip time, throughput and packet loss rate.

Forewarding in Mobile Opportunistic Networks

Recent advances in processor speeds, mobile communications and battery life have enabled computers to evolve from completely wired to completely mobile. In the most extreme case, all nodes are mobile and communication takes place at available opportunities – using both traditional communication infrastructure as well as the mobility of intermediate nodes. These are mobile opportunistic networks. Data communication in such networks is a difficult problem, because of the dynamic underlying topology, the scarcity of network resources and the lack of global information. Establishing end-to-end routes in such networks is usually not feasible. Instead a store-and-carry forwarding paradigm is better suited for such networks. This dissertation describes and analyzes algorithms for forwarding of messages in such networks. In order to design effective forwarding algorithms for mobile opportunistic networks, we start by first building an understanding of the set of all paths between nodes, which represent the available opportunities for any forwarding algorithm. Relying on real measurements, we enumerate paths between nodes and uncover what we refer to as the path explosion effect. The term path explosion refers to the fact that the number of paths between a randomly selected pair of nodes increases exponentially with time. We draw from the theory of epidemics to model and explain the path explosion effect. This is the first contribution of the thesis, and is a key observation that underlies subsequent results. Our second contribution is the study of forwarding algorithms. For this, we rely on trace driven simulations of different algorithms that span a range of design dimensions. We compare the performance (success rate and average delay) of these algorithms. We make the surprising observation that most algorithms we consider have roughly similar performance. We explain this result in light of the path explosion phenomenon. While the performance of most algorithms we studied was roughly the same, these algorithms differed in terms of cost. This prompted us to focus on designing algorithms with the explicit intent of reducing costs. For this, we cast the problem of forwarding as an optimal stopping problem. Our third main contribution is the design of strategies based on optimal stopping principles which we refer to as Delegation schemes. Our analysis shows that using a delegation scheme reduces cost over naive forwarding by a factor of O(√N), where N is the number of nodes in the network. We further validate this result on real traces, where the cost reduction observed is even greater. Our results so far include a key assumption, which is unbounded buffers on nodes. Next, we relax this assumption, so that the problem shifts to one of prioritization of messages for transmission and dropping. Our fourth contribution is the study of message prioritization schemes, combined with forwarding. Our main result is that one achieves higher performance by assigning higher priorities to young messages in the network. We again interpret this result in light of the path explosion effect.

Seed Scheduling for Peer-to-Peer Networks

The initial phase in a content distribution (file sharing) scenario is a delicate phase due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. We devise a scheduling algorithm at the seed (source peer with full content), based on a proportional fair approach, and we implement it on a real file sharing client [1]. In dynamic overlays, our solution improves up to 25% the average downloading time of a standard protocol ala BitTorrent.

CSR: Constrained Selfish Routing in Ad-hoc Networks

Routing protocols for ad-hoc networks assume that the nodes forming the network are either under a single authority, or else that they would be altruistically forwarding data for other nodes with no expectation of a return. These assumptions are unrealistic since in ad-hoc networks, nodes are likely to be autonomous and rational (selfish), and thus unwilling to help unless they have an incentive to do so. Providing such incentives is an important aspect that should be considered when designing ad-hoc routing protocols. In this paper, we propose a dynamic, decentralized routing protocol for ad-hoc networks that provides incentives in the form of payments to intermediate nodes used to forward data for others. In our Constrained Selfish Routing (CSR) protocol, game-theoretic approaches are used to calculate payments (incentives) that ensure both the truthfulness of participating nodes and the fairness of the CSR protocol. We show through simulations that CSR is an energy efficient protocol and that it provides lower communication overhead in the best and average cases compared to existing approaches.