A Simple and Efficient Method to Mitigate the Hot Spot Problem in Wireless Sensor Networks

Much work on wireless sensor networks deals with or considers the hot spot problem, i.e., the problem that the sensor nodes closest to the base station are critical for the lifetime of the sensor network because these nodes need to relay more packet than nodes further away from the base station. Since it is often assumed that sensor nodes will become inexpensive, a simple solution to the hot spot problem is to place additional sensor nodes around the base stations. Using a simple mathematical model we discuss the possible performance gains of adding these supplementary nodes. Our results show that for certain networks only a limited number of additional nodes are required to fourfold network lifetime. We also show that the possible gain depends heavily on the fraction of nodes already present in the vicinity of the base station

A Decentralized and Proactive Architecture based on the Cyber Physical System Paradigm for Smart Transmission Grids Modelling, Monitoring and Control

n/

Thermal-Aware Networked Many-Core Systems

Advancements in IC processing technology has led to the innovation and growth happening in the consumer electronics sector and the evolution of the IT infrastructure supporting this exponential growth. One of the most difficult obstacles to this growth is the removal of large amount of heatgenerated by the processing and communicating nodes on the system. The scaling down of technology and the increase in power density is posing a direct and consequential effect on the rise in temperature. This has resulted in the increase in cooling budgets, and affects both the life-time reliability and performance of the system. Hence, reducing on-chip temperatures has become a major design concern for modern microprocessors. This dissertation addresses the thermal challenges at different levels for both 2D planer and 3D stacked systems. It proposes a self-timed thermal monitoring strategy based on the liberal use of on-chip thermal sensors. This makes use of noise variation tolerant and leakage current based thermal sensing for monitoring purposes. In order to study thermal management issues from early design stages, accurate thermal modeling and analysis at design time is essential. In this regard, spatial temperature profile of the global Cu nanowire for on-chip interconnects has been analyzed. It presents a 3D thermal model of a multicore system in order to investigate the effects of hotspots and the placement of silicon die layers, on the thermal performance of a modern ip-chip package. For a 3D stacked system, the primary design goal is to maximise the performance within the given power and thermal envelopes. Hence, a thermally efficient routing strategy for 3D NoC-Bus hybrid architectures has been proposed to mitigate on-chip temperatures by herding most of the switching activity to the die which is closer to heat sink. Finally, an exploration of various thermal-aware placement approaches for both the 2D and 3D stacked systems has been presented. Various thermal models have been developed and thermal control metrics have been extracted. An efficient thermal-aware application mapping algorithm for a 2D NoC has been presented. It has been shown that the proposed mapping algorithm reduces the effective area reeling under high temperatures when compared to the state of the art.Siirretty Doriast

On demand multicast routing in wireless sensor networks

The wireless networking environment presents imposing challenges to the study of broadcasting and multicasting problems. Developing an algorithm to optimize communication amongst a group of spatially distributed sensor nodes in a WSN (Wireless Sensor Network) has been met with a number challenges due to the characterization of the sensor node device. These challenges include, but are not limited to: energy, memory, and throughput constraints. The traditional approach to overcome these challenges have emphasised the development of low power electronics, efficient modulation, coding, antenna design etc., it has been recognised that networking techniques can also have a strong impact on the energy efficiency of such systems. A variety of networking based approaches to energy efficiency are possible. One of the well-known approaches is to apply clustering techniques to effectively establish an ordered connection of sensor nodes whilst improving the overall network lifetime. This paper proposes an improved clustering based multicast approach that allows any cluster head to be a multicast source with an unlimited number of subscribers, to optimize group communication in WSNs whilst ensuring sensor nodes do not deprecate rapidly in energy levels. We review several clustering approaches and examine multicast versus broadcast communication in WSNs

On demand multicast routing in wireless sensor networks

The wireless networking environment presents imposing challenges to the study of broadcasting and multicasting problems. Developing an algorithm to optimize communication amongst a group of spatially distributed sensor nodes in a WSN (Wireless Sensor Network) has been met with a number challenges due to the characterization of the sensor node device. These challenges include, but are not limited to: energy, memory, and throughput constraints. The traditional approach to overcome these challenges have emphasised the development of low power electronics, efficient modulation, coding, antenna design etc., it has been recognised that networking techniques can also have a strong impact on the energy efficiency of such systems. A variety of networking based approaches to energy efficiency are possible. One of the well-known approaches is to apply clustering techniques to effectively establish an ordered connection of sensor nodes whilst improving the overall network lifetime. This paper proposes an improved clustering based multicast approach that allows any cluster head to be a multicast source with an unlimited number of subscribers, to optimize group communication in WSNs whilst ensuring sensor nodes do not deprecate rapidly in energy levels. We review several clustering approaches and examine multicast versus broadcast communication in WSNs

Multi-hop/Direct Forwarding (MDF) for Static Wireless Sensor Networks

The success of Wireless Sensor Networks (WSNs) depends largely on efficient information delivery from target areas toward data sinks. The problem of data forwarding is complicated by the severe energy constraints of sensors in WSNs. In this work, we propose and analyze a data forwarding scheme, termed Multi-hop/Direct Forwarding (MDF), for WSNs where sensor nodes forward data traffic toward a common data sink. In the MDF scheme, a node splits out-going traffic into at most two branches: one is sent to a node that is h units away, the other is sent directly to the data sink. The value of h is chosen to minimize the overall energy consumption of the network. The direct transmission is employed to balance the energy consumption of nodes at different locations and to avoid the so-called ?hot spot? problem in data forwarding. In order to calculate its traffic splitting ratio, a node only needs to know the distance toward the common data sink and that of the farthest node. Our analytical and simulation results show that the MDF scheme performs close to, in terms of energy efficiency and network lifetime, the optimum data forwarding rules, which are more complex and computation intensive

Improving processor efficiency through thermal modeling and runtime management of hybrid cooling strategies

One of the main challenges in building future high performance systems is the ability to maintain safe on-chip temperatures in presence of high power densities. Handling such high power densities necessitates novel cooling solutions that are significantly more efficient than their existing counterparts. A number of advanced cooling methods have been proposed to address the temperature problem in processors. However, tradeoffs exist between performance, cost, and efficiency of those cooling methods, and these tradeoffs depend on the target system properties. Hence, a single cooling solution satisfying optimum conditions for any arbitrary system does not exist. This thesis claims that in order to reach exascale computing, a dramatic improvement in energy efficiency is needed, and achieving this improvement requires a temperature-centric co-design of the cooling and computing subsystems. Such co-design requires detailed system-level thermal modeling, design-time optimization, and runtime management techniques that are aware of the underlying processor architecture and application requirements. To this end, this thesis first proposes compact thermal modeling methods to characterize the complex thermal behavior of cutting-edge cooling solutions, mainly Phase Change Material (PCM)-based cooling, liquid cooling, and thermoelectric cooling (TEC), as well as hybrid designs involving a combination of these. The proposed models are modular and they enable fast and accurate exploration of a large design space. Comparisons against multi-physics simulations and measurements on testbeds validate the accuracy of our models (resulting in less than 1C error on average) and demonstrate significant reductions in simulation time (up to four orders of magnitude shorter simulation times). This thesis then introduces temperature-aware optimization techniques to maximize energy efficiency of a given system as a whole (including computing and cooling energy). The proposed optimization techniques approach the temperature problem from various angles, tackling major sources of inefficiency. One important angle is to understand the application power and performance characteristics and to design management techniques to match them. For workloads that require short bursts of intense parallel computation, we propose using PCM-based cooling in cooperation with a novel Adaptive Sprinting technique. By tracking the PCM state and incorporating this information during runtime decisions, Adaptive Sprinting utilizes the PCM heat storage capability more efficiently, achieving 29\% performance improvement compared to existing sprinting policies. In addition to the application characteristics, high heterogeneity in on-chip heat distribution is an important factor affecting efficiency. Hot spots occur on different locations of the chip with varying intensities; thus, designing a uniform cooling solution to handle worst-case hot spots significantly reduces the cooling efficiency. The hybrid cooling techniques proposed as part of this thesis address this issue by combining the strengths of different cooling methods and localizing the cooling effort over hot spots. Specifically, the thesis introduces LoCool, a cooling system optimizer that minimizes cooling power under temperature constraints for hybrid-cooled systems using TECs and liquid cooling. Finally, the scope of this work is not limited to existing advanced cooling solutions, but it also extends to emerging technologies and their potential benefits and tradeoffs. One such technology is integrated flow cell array, where fuel cells are pumped through microchannels, providing both cooling and on-chip power generation. This thesis explores a broad range of design parameters including maximum chip temperature, leakage power, and generated power for flow cell arrays in order to maximize the benefits of integrating this technology with computing systems. Through thermal modeling and runtime management techniques, and by exploring the design space of emerging cooling solutions, this thesis provides significant improvements in processor energy efficiency.2018-07-09T00:00:00

An Individual Node Delay Based Efficient Power Aware Routing Protocol for Wireless Heterogeneous Sensor Networks

Miscellaneous node transmission ranges builds up Wireless Heterogeneous Sensor Networks (WHSNs). Designing an efficient, reliable and scalable routing protocol for WHSNs with intermittent asymmetric links is a challenging task. In this paper, we propose an efficient power aware routing scheme for WHSNs, which can provide loop-free, stateless, source-to-sink routing scheme without using prior information about neighbor. It uses both symmetric and asymmetric links to forward data from source to sink. The source node broadcasts location information to all its neighbor nodes. Each neighbor node calculates a delay slot based on the information obtained from the source to forward its power value to it. The node that has a minimum delay slot forwards the power earlier than the other nodes during contention phase and the delay slot is used to suppress the selection of unsuitable low-power nodes at that time. We also prove that our protocol is loop-free assuming no failures in greedy forwarding. By simulations we show that our protocol significantly outperforms the existing protocols in WHSNs