Energy Aware Clustering Algorithms for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Rakhshan, Noushin; Rafsanjani, Marjan Kuchaki; Liu, Chenglian

2011-09-01

The sensor nodes deployed in wireless sensor networks (WSNs) are extremely power constrained, so maximizing the lifetime of the entire networks is mainly considered in the design. In wireless sensor networks, hierarchical network structures have the advantage of providing scalable and energy efficient solutions. In this paper, we investigate different clustering algorithms for WSNs and also compare these clustering algorithms based on metrics such as clustering distribution, cluster's load balancing, Cluster Head's (CH) selection strategy, CH's role rotation, node mobility, clusters overlapping, intra-cluster communications, reliability, security and location awareness.

Deployment-based lifetime optimization model for homogeneous Wireless Sensor Network under retransmission.

PubMed

Li, Ruiying; Liu, Xiaoxi; Xie, Wei; Huang, Ning

2014-12-10

Sensor-deployment-based lifetime optimization is one of the most effective methods used to prolong the lifetime of Wireless Sensor Network (WSN) by reducing the distance-sensitive energy consumption. In this paper, data retransmission, a major consumption factor that is usually neglected in the previous work, is considered. For a homogeneous WSN, monitoring a circular target area with a centered base station, a sensor deployment model based on regular hexagonal grids is analyzed. To maximize the WSN lifetime, optimization models for both uniform and non-uniform deployment schemes are proposed by constraining on coverage, connectivity and success transmission rate. Based on the data transmission analysis in a data gathering cycle, the WSN lifetime in the model can be obtained through quantifying the energy consumption at each sensor location. The results of case studies show that it is meaningful to consider data retransmission in the lifetime optimization. In particular, our investigations indicate that, with the same lifetime requirement, the number of sensors needed in a non-uniform topology is much less than that in a uniform one. Finally, compared with a random scheme, simulation results further verify the advantage of our deployment model.

A Hybrid Lifetime Extended Directional Approach for WBANs

PubMed Central

Li, Changle; Yuan, Xiaoming; Yang, Li; Song, Yueyang

2015-01-01

Wireless Body Area Networks (WBANs) can provide real-time and reliable health monitoring, attributing to the human-centered and sensor interoperability properties. WBANs have become a key component of the ubiquitous eHealth (electronic health) revolution that prospers on the basis of information and communication technologies. The prime consideration in WBAN is how to maximize the network lifetime with battery-powered sensor nodes in energy constraint. Novel solutions in Medium Access Control (MAC) protocols are imperative to satisfy the particular BAN scenario and the need of excellent energy efficiency in healthcare applications. In this paper, we propose a hybrid Lifetime Extended Directional Approach (LEDA) MAC protocol based on IEEE 802.15.6 to reduce energy consumption and prolong network lifetime. The LEDA MAC protocol takes full advantages of directional superiority in energy saving that employs multi-beam directional mode in Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) and single-beam directional mode in Time Division Multiple Access (TDMA) for alternative in data reservation and transmission according to the traffic varieties. Moreover, the impacts of some inherent problems of directional antennas such as deafness and hidden terminal problem can be decreased owing to that all nodes generate individual beam according to user priorities designated. Furthermore, LEDA MAC employs a Dynamic Polled Allocation Period (DPAP) for burst data transmissions to increase the network reliability and adaptability. Extensive analysis and simulation results show that the proposed LEDA MAC protocol achieves extended network lifetime with improved performance compared with IEEE 802.15.6. PMID:26556357

Smart border: ad-hoc wireless sensor networks for border surveillance

NASA Astrophysics Data System (ADS)

He, Jun; Fallahi, Mahmoud; Norwood, Robert A.; Peyghambarian, Nasser

2011-06-01

Wireless sensor networks have been proposed as promising candidates to provide automated monitoring, target tracking, and intrusion detection for border surveillance. In this paper, we demonstrate an ad-hoc wireless sensor network system for border surveillance. The network consists of heterogeneously autonomous sensor nodes that distributively cooperate with each other to enable a smart border in remote areas. This paper also presents energy-aware and sleeping algorithms designed to maximize the operating lifetime of the deployed sensor network. Lessons learned in building the network and important findings from field experiments are shared in the paper.

A Game-Theoretic Response Strategy for Coordinator Attack in Wireless Sensor Networks

PubMed Central

Liu, Jianhua; Yue, Guangxue; Shang, Huiliang; Li, Hongjie

2014-01-01

The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security. PMID:25105171

A game-theoretic response strategy for coordinator attack in wireless sensor networks.

PubMed

Liu, Jianhua; Yue, Guangxue; Shen, Shigen; Shang, Huiliang; Li, Hongjie

2014-01-01

The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security.

Moving multiple sinks through wireless sensor networks for lifetime maximization.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Petrioli, Chiara; Carosi, Alessio; Basagni, Stefano

2008-01-01

Unattended sensor networks typically watch for some phenomena such as volcanic events, forest fires, pollution, or movements in animal populations. Sensors report to a collection point periodically or when they observe reportable events. When sensors are too far from the collection point to communicate directly, other sensors relay messages for them. If the collection point location is static, sensor nodes that are closer to the collection point relay far more messages than those on the periphery. Assuming all sensor nodes have roughly the same capabilities, those with high relay burden experience battery failure much faster than the rest of themore » network. However, since their death disconnects the live nodes from the collection point, the whole network is then dead. We consider the problem of moving a set of collectors (sinks) through a wireless sensor network to balance the energy used for relaying messages, maximizing the lifetime of the network. We show how to compute an upper bound on the lifetime for any instance using linear and integer programming. We present a centralized heuristic that produces sink movement schedules that produce network lifetimes within 1.4% of the upper bound for realistic settings. We also present a distributed heuristic that produces lifetimes at most 25:3% below the upper bound. More specifically, we formulate a linear program (LP) that is a relaxation of the scheduling problem. The variables are naturally continuous, but the LP relaxes some constraints. The LP has an exponential number of constraints, but we can satisfy them all by enforcing only a polynomial number using a separation algorithm. This separation algorithm is a p-median facility location problem, which we can solve efficiently in practice for huge instances using integer programming technology. This LP selects a set of good sensor configurations. Given the solution to the LP, we can find a feasible schedule by selecting a subset of these configurations, ordering them via a traveling salesman heuristic, and computing feasible transitions using matching algorithms. This algorithm assumes sinks can get a schedule from a central server or a leader sink. If the network owner prefers the sinks make independent decisions, they can use our distributed heuristic. In this heuristic, sinks maintain estimates of the energy distribution in the network and move greedily (with some coordination) based on local search. This application uses the new SUCASA (Solver Utility for Customization with Automatic Symbol Access) facility within the PICO (Parallel Integer and Combinatorial Optimizer) integer programming solver system. SUCASA allows rapid development of customized math programming (search-based) solvers using a problem's natural multidimensional representation. In this case, SUCASA also significantly improves runtime compared to implementations in the ampl math programming language or in perl.« less

Mesopore quality determines the lifetime of hierarchically structured zeolite catalysts

NASA Astrophysics Data System (ADS)

Milina, Maria; Mitchell, Sharon; Crivelli, Paolo; Cooke, David; Pérez-Ramírez, Javier

2014-05-01

Deactivation due to coking limits the lifetime of zeolite catalysts in the production of chemicals and fuels. Superior performance can be achieved through hierarchically structuring the zeolite porosity, yet no relation has been established between the mesopore architecture and the catalyst lifetime. Here we introduce a top-down demetallation strategy to locate mesopores in different regions of MFI-type crystals with identical bulk porous and acidic properties. In contrast, well-established bottom-up strategies as carbon templating and seed silanization fail to yield materials with matching characteristics. Advanced characterization tools capable of accurately discriminating the mesopore size, distribution and connectivity are applied to corroborate the concept of mesopore quality. Positron annihilation lifetime spectroscopy proves powerful to quantify the global connectivity of the intracrystalline pore network, which, as demonstrated in the conversions of methanol or of propanal to hydrocarbons, is closely linked to the lifetime of zeolite catalysts. The findings emphasize the need to aptly tailor hierarchical materials for maximal catalytic advantage.

A Study on Wireless Charging for Prolonging the Lifetime of Wireless Sensor Networks.

PubMed

Tu, Weijian; Xu, Xianghua; Ye, Tingcong; Cheng, Zongmao

2017-07-04

Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node) as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP) to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network.

A multipath routing protocol based on clustering and ant colony optimization for wireless sensor networks.

PubMed

Yang, Jing; Xu, Mai; Zhao, Wei; Xu, Baoguo

2010-01-01

For monitoring burst events in a kind of reactive wireless sensor networks (WSNs), a multipath routing protocol (MRP) based on dynamic clustering and ant colony optimization (ACO) is proposed. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is their limited power supply, and therefore some metrics (such as energy consumption of communication among nodes, residual energy, path length) were considered as very important criteria while designing routing in the MRP. Firstly, a cluster head (CH) is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in the search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance of energy consumption among nodes and reduce the average energy consumption effectively.

Cross Layer Design for Optimizing Transmission Reliability, Energy Efficiency, and Lifetime in Body Sensor Networks.

PubMed

Chen, Xi; Xu, Yixuan; Liu, Anfeng

2017-04-19

High transmission reliability, energy efficiency, and long lifetime are pivotal issues for wireless body area networks (WBANs. However, these performance metrics are not independent of each other, making it hard to obtain overall improvements through optimizing one single aspect. Therefore, a Cross Layer Design Optimal (CLDO) scheme is proposed to simultaneously optimize transmission reliability, energy efficiency, and lifetime of WBANs from several layers. Firstly, due to the fact that the transmission power of nodes directly influences the reliability of links, the optimized transmission power of different nodes is deduced, which is able to maximize energy efficiency in theory under the premise that requirements on delay and jitter are fulfilled. Secondly, a relay decision algorithm is proposed to choose optimized relay nodes. Using this algorithm, nodes will choose relay nodes that ensure a balance of network energy consumption, provided that all nodes transmit with optimized transmission power and the same packet size. Thirdly, the energy consumption of nodes is still unbalanced even with optimized transmission power because of their different locations in the topology of the network. In addition, packet size also has an impact on final performance metrics. Therefore, a synthesized cross layer method for optimization is proposed. With this method, the transmission power of nodes with more residual energy will be enhanced while suitable packet size is determined for different links in the network, leading to further improvements in the WBAN system. Both our comprehensive theoretical analysis and experimental results indicate that the performance of our proposed scheme is better than reported in previous studies. Relative to the relay selection and power control game (RSPCG) scheme, the CLDO scheme can enhance transmission reliability by more than 44.6% and prolong the lifetime by as much as 33.2%.

Cross Layer Design for Optimizing Transmission Reliability, Energy Efficiency, and Lifetime in Body Sensor Networks

PubMed Central

Chen, Xi; Xu, Yixuan; Liu, Anfeng

2017-01-01

High transmission reliability, energy efficiency, and long lifetime are pivotal issues for wireless body area networks (WBANs). However, these performance metrics are not independent of each other, making it hard to obtain overall improvements through optimizing one single aspect. Therefore, a Cross Layer Design Optimal (CLDO) scheme is proposed to simultaneously optimize transmission reliability, energy efficiency, and lifetime of WBANs from several layers. Firstly, due to the fact that the transmission power of nodes directly influences the reliability of links, the optimized transmission power of different nodes is deduced, which is able to maximize energy efficiency in theory under the premise that requirements on delay and jitter are fulfilled. Secondly, a relay decision algorithm is proposed to choose optimized relay nodes. Using this algorithm, nodes will choose relay nodes that ensure a balance of network energy consumption, provided that all nodes transmit with optimized transmission power and the same packet size. Thirdly, the energy consumption of nodes is still unbalanced even with optimized transmission power because of their different locations in the topology of the network. In addition, packet size also has an impact on final performance metrics. Therefore, a synthesized cross layer method for optimization is proposed. With this method, the transmission power of nodes with more residual energy will be enhanced while suitable packet size is determined for different links in the network, leading to further improvements in the WBAN system. Both our comprehensive theoretical analysis and experimental results indicate that the performance of our proposed scheme is better than reported in previous studies. Relative to the relay selection and power control game (RSPCG) scheme, the CLDO scheme can enhance transmission reliability by more than 44.6% and prolong the lifetime by as much as 33.2%. PMID:28422062

A Distance-based Energy Aware Routing algorithm for wireless sensor networks.

PubMed

Wang, Jin; Kim, Jeong-Uk; Shu, Lei; Niu, Yu; Lee, Sungyoung

2010-01-01

Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs) since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation and location tracking etc. However, many of them aim to minimize parameters like total energy consumption, latency etc., which cause hotspot nodes and partitioned network due to the overuse of certain nodes. In this paper, a Distance-based Energy Aware Routing (DEAR) algorithm is proposed to ensure energy efficiency and energy balancing based on theoretical analysis of different energy and traffic models. During the routing process, we consider individual distance as the primary parameter in order to adjust and equalize the energy consumption among involved sensors. The residual energy is also considered as a secondary factor. In this way, all the intermediate nodes will consume their energy at similar rate, which maximizes network lifetime. Simulation results show that the DEAR algorithm can reduce and balance the energy consumption for all sensor nodes so network lifetime is greatly prolonged compared to other routing algorithms.

A Multi-Hop Energy Neutral Clustering Algorithm for Maximizing Network Information Gathering in Energy Harvesting Wireless Sensor Networks.

PubMed

Yang, Liu; Lu, Yinzhi; Zhong, Yuanchang; Wu, Xuegang; Yang, Simon X

2015-12-26

Energy resource limitation is a severe problem in traditional wireless sensor networks (WSNs) because it restricts the lifetime of network. Recently, the emergence of energy harvesting techniques has brought with them the expectation to overcome this problem. In particular, it is possible for a sensor node with energy harvesting abilities to work perpetually in an Energy Neutral state. In this paper, a Multi-hop Energy Neutral Clustering (MENC) algorithm is proposed to construct the optimal multi-hop clustering architecture in energy harvesting WSNs, with the goal of achieving perpetual network operation. All cluster heads (CHs) in the network act as routers to transmit data to base station (BS) cooperatively by a multi-hop communication method. In addition, by analyzing the energy consumption of intra- and inter-cluster data transmission, we give the energy neutrality constraints. Under these constraints, every sensor node can work in an energy neutral state, which in turn provides perpetual network operation. Furthermore, the minimum network data transmission cycle is mathematically derived using convex optimization techniques while the network information gathering is maximal. Simulation results show that our protocol can achieve perpetual network operation, so that the consistent data delivery is guaranteed. In addition, substantial improvements on the performance of network throughput are also achieved as compared to the famous traditional clustering protocol LEACH and recent energy harvesting aware clustering protocols.

A Multi-Hop Energy Neutral Clustering Algorithm for Maximizing Network Information Gathering in Energy Harvesting Wireless Sensor Networks

PubMed Central

Yang, Liu; Lu, Yinzhi; Zhong, Yuanchang; Wu, Xuegang; Yang, Simon X.

2015-01-01

Energy resource limitation is a severe problem in traditional wireless sensor networks (WSNs) because it restricts the lifetime of network. Recently, the emergence of energy harvesting techniques has brought with them the expectation to overcome this problem. In particular, it is possible for a sensor node with energy harvesting abilities to work perpetually in an Energy Neutral state. In this paper, a Multi-hop Energy Neutral Clustering (MENC) algorithm is proposed to construct the optimal multi-hop clustering architecture in energy harvesting WSNs, with the goal of achieving perpetual network operation. All cluster heads (CHs) in the network act as routers to transmit data to base station (BS) cooperatively by a multi-hop communication method. In addition, by analyzing the energy consumption of intra- and inter-cluster data transmission, we give the energy neutrality constraints. Under these constraints, every sensor node can work in an energy neutral state, which in turn provides perpetual network operation. Furthermore, the minimum network data transmission cycle is mathematically derived using convex optimization techniques while the network information gathering is maximal. Simulation results show that our protocol can achieve perpetual network operation, so that the consistent data delivery is guaranteed. In addition, substantial improvements on the performance of network throughput are also achieved as compared to the famous traditional clustering protocol LEACH and recent energy harvesting aware clustering protocols. PMID:26712764

A Study on Wireless Charging for Prolonging the Lifetime of Wireless Sensor Networks

PubMed Central

Tu, Weijian; Xu, Xianghua; Ye, Tingcong; Cheng, Zongmao

2017-01-01

Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node) as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP) to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network. PMID:28677639

Evaluating a Novel Cellular Automata-Based Distributed Power Management Approach for Mobile Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Adabi, Sepideh; Adabi, Sahar; Rezaee, Ali

According to the traditional definition of Wireless Sensor Networks (WSNs), static sensors have limited the feasibility of WSNs in some kind of approaches, so the mobility was introduced in WSN. Mobile nodes in a WSN come equipped with battery and from the point of deployment, this battery reserve becomes a valuable resource since it cannot be replenished. Hence, maximizing the network lifetime by minimizing the energy is an important challenge in Mobile WSN. Energy conservation can be accomplished by different approaches. In this paper, we presented an energy conservation solution based on Cellular Automata. The main objective of this solution is based on dynamically adjusting the transmission range and switching between operational states of the sensor nodes.

A Topology Control Strategy with Reliability Assurance for Satellite Cluster Networks in Earth Observation

PubMed Central

Chen, Qing; Zhang, Jinxiu; Hu, Ze

2017-01-01

This article investigates the dynamic topology control problem of satellite cluster networks (SCNs) in Earth observation (EO) missions by applying a novel metric of stability for inter-satellite links (ISLs). The properties of the periodicity and predictability of satellites’ relative position are involved in the link cost metric which is to give a selection criterion for choosing the most reliable data routing paths. Also, a cooperative work model with reliability is proposed for the situation of emergency EO missions. Based on the link cost metric and the proposed reliability model, a reliability assurance topology control algorithm and its corresponding dynamic topology control (RAT) strategy are established to maximize the stability of data transmission in the SCNs. The SCNs scenario is tested through some numeric simulations of the topology stability of average topology lifetime and average packet loss rate. Simulation results show that the proposed reliable strategy applied in SCNs significantly improves the data transmission performance and prolongs the average topology lifetime. PMID:28241474

A Topology Control Strategy with Reliability Assurance for Satellite Cluster Networks in Earth Observation.

PubMed

Chen, Qing; Zhang, Jinxiu; Hu, Ze

2017-02-23

This article investigates the dynamic topology control problemof satellite cluster networks (SCNs) in Earth observation (EO) missions by applying a novel metric of stability for inter-satellite links (ISLs). The properties of the periodicity and predictability of satellites' relative position are involved in the link cost metric which is to give a selection criterion for choosing the most reliable data routing paths. Also, a cooperative work model with reliability is proposed for the situation of emergency EO missions. Based on the link cost metric and the proposed reliability model, a reliability assurance topology control algorithm and its corresponding dynamic topology control (RAT) strategy are established to maximize the stability of data transmission in the SCNs. The SCNs scenario is tested through some numeric simulations of the topology stability of average topology lifetime and average packet loss rate. Simulation results show that the proposed reliable strategy applied in SCNs significantly improves the data transmission performance and prolongs the average topology lifetime.

An Enhanced PSO-Based Clustering Energy Optimization Algorithm for Wireless Sensor Network.

PubMed

Vimalarani, C; Subramanian, R; Sivanandam, S N

2016-01-01

Wireless Sensor Network (WSN) is a network which formed with a maximum number of sensor nodes which are positioned in an application environment to monitor the physical entities in a target area, for example, temperature monitoring environment, water level, monitoring pressure, and health care, and various military applications. Mostly sensor nodes are equipped with self-supported battery power through which they can perform adequate operations and communication among neighboring nodes. Maximizing the lifetime of the Wireless Sensor networks, energy conservation measures are essential for improving the performance of WSNs. This paper proposes an Enhanced PSO-Based Clustering Energy Optimization (EPSO-CEO) algorithm for Wireless Sensor Network in which clustering and clustering head selection are done by using Particle Swarm Optimization (PSO) algorithm with respect to minimizing the power consumption in WSN. The performance metrics are evaluated and results are compared with competitive clustering algorithm to validate the reduction in energy consumption.

Exploiting node mobility for energy optimization in wireless sensor networks

NASA Astrophysics Data System (ADS)

El-Moukaddem, Fatme Mohammad

Wireless Sensor Networks (WSNs) have become increasingly available for data-intensive applications such as micro-climate monitoring, precision agriculture, and audio/video surveillance. A key challenge faced by data-intensive WSNs is to transmit the sheer amount of data generated within an application's lifetime to the base station despite the fact that sensor nodes have limited power supplies such as batteries or small solar panels. The availability of numerous low-cost robotic units (e.g. Robomote and Khepera) has made it possible to construct sensor networks consisting of mobile sensor nodes. It has been shown that the controlled mobility offered by mobile sensors can be exploited to improve the energy efficiency of a network. In this thesis, we propose schemes that use mobile sensor nodes to reduce the energy consumption of data-intensive WSNs. Our approaches differ from previous work in two main aspects. First, our approaches do not require complex motion planning of mobile nodes, and hence can be implemented on a number of low-cost mobile sensor platforms. Second, we integrate the energy consumption due to both mobility and wireless communications into a holistic optimization framework. We consider three problems arising from the limited energy in the sensor nodes. In the first problem, the network consists of mostly static nodes and contains only a few mobile nodes. In the second and third problems, we assume essentially that all nodes in the WSN are mobile. We first study a new problem called max-data mobile relay configuration (MMRC ) that finds the positions of a set of mobile sensors, referred to as relays, that maximize the total amount of data gathered by the network during its lifetime. We show that the MMRC problem is surprisingly complex even for a trivial network topology due to the joint consideration of the energy consumption of both wireless communication and mechanical locomotion. We present optimal MMRC algorithms and practical distributed implementations for several important network topologies and applications. Second, we consider the problem of minimizing the total energy consumption of a network. We design an iterative algorithm that improves a given configuration by relocating nodes to new positions. We show that this algorithm converges to the optimal configuration for the given transmission routes. Moreover, we propose an efficient distributed implementation that does not require explicit synchronization. Finally, we consider the problem of maximizing the lifetime of the network. We propose an approach that exploits the mobility of the nodes to balance the energy consumption throughout the network. We develop efficient algorithms for single and multiple round approaches. For all three problems, we evaluate the efficiency of our algorithms through simulations. Our simulation results based on realistic energy models obtained from existing mobile and static sensor platforms show that our approaches significantly improve the network's performance and outperform existing approaches.

Moving target tracking through distributed clustering in directional sensor networks.

PubMed

Enayet, Asma; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

2014-12-18

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works.

Moving Target Tracking through Distributed Clustering in Directional Sensor Networks

PubMed Central

Enayet, Asma; Razzaque, Md. Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

2014-01-01

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works. PMID:25529205

Throughput Maximization for Sensor-Aided Cognitive Radio Networks with Continuous Energy Arrivals

PubMed Central

Nguyen, Thanh-Tung; Koo, Insoo

2015-01-01

We consider a Sensor-Aided Cognitive Radio Network (SACRN) in which sensors capable of harvesting energy are distributed throughout the network to support secondary transmitters for sensing licensed channels in order to improve both energy and spectral efficiency. Harvesting ambient energy is one of the most promising solutions to mitigate energy deficiency, prolong device lifetime, and partly reduce the battery size of devices. So far, many works related to SACRN have considered single secondary users capable of harvesting energy in whole slot as well as short-term throughput. In the paper, we consider two types of energy harvesting sensor nodes (EHSN): Type-I sensor nodes will harvest ambient energy in whole slot duration, whereas type-II sensor nodes will only harvest energy after carrying out spectrum sensing. In the paper, we also investigate long-term throughput in the scheduling window, and formulate the throughput maximization problem by considering energy-neutral operation conditions of type-I and -II sensors and the target detection probability. Through simulations, it is shown that the sensing energy consumption of all sensor nodes can be efficiently managed with the proposed scheme to achieve optimal long-term throughput in the window. PMID:26633393

Joint Resource Optimization for Cognitive Sensor Networks with SWIPT-Enabled Relay.

PubMed

Lu, Weidang; Lin, Yuanrong; Peng, Hong; Nan, Tian; Liu, Xin

2017-09-13

Energy-constrained wireless networks, such as wireless sensor networks (WSNs), are usually powered by fixed energy supplies (e.g., batteries), which limits the operation time of networks. Simultaneous wireless information and power transfer (SWIPT) is a promising technique to prolong the lifetime of energy-constrained wireless networks. This paper investigates the performance of an underlay cognitive sensor network (CSN) with SWIPT-enabled relay node. In the CSN, the amplify-and-forward (AF) relay sensor node harvests energy from the ambient radio-frequency (RF) signals using power splitting-based relaying (PSR) protocol. Then, it helps forward the signal of source sensor node (SSN) to the destination sensor node (DSN) by using the harvested energy. We study the joint resource optimization including the transmit power and power splitting ratio to maximize CSN's achievable rate with the constraint that the interference caused by the CSN to the primary users (PUs) is within the permissible threshold. Simulation results show that the performance of our proposed joint resource optimization can be significantly improved.

Performance Optimization of Priority Assisted CSMA/CA Mechanism of 802.15.6 under Saturation Regime

PubMed Central

Shakir, Mustafa; Rehman, Obaid Ur; Rahim, Mudassir; Alrajeh, Nabil; Khan, Zahoor Ali; Khan, Mahmood Ashraf; Niaz, Iftikhar Azim; Javaid, Nadeem

2016-01-01

Due to the recent development in the field of Wireless Sensor Networks (WSNs), the Wireless Body Area Networks (WBANs) have become a major area of interest for the developers and researchers. Human body exhibits postural mobility due to which distance variation occurs and the status of connections amongst sensors change time to time. One of the major requirements of WBAN is to prolong the network lifetime without compromising on other performance measures, i.e., delay, throughput and bandwidth efficiency. Node prioritization is one of the possible solutions to obtain optimum performance in WBAN. IEEE 802.15.6 CSMA/CA standard splits the nodes with different user priorities based on Contention Window (CW) size. Smaller CW size is assigned to higher priority nodes. This standard helps to reduce delay, however, it is not energy efficient. In this paper, we propose a hybrid node prioritization scheme based on IEEE 802.15.6 CSMA/CA to reduce energy consumption and maximize network lifetime. In this scheme, optimum performance is achieved by node prioritization based on CW size as well as power in respective user priority. Our proposed scheme reduces the average back off time for channel access due to CW based prioritization. Additionally, power based prioritization for a respective user priority helps to minimize required number of retransmissions. Furthermore, we also compare our scheme with IEEE 802.15.6 CSMA/CA standard (CW assisted node prioritization) and power assisted node prioritization under postural mobility in WBAN. Mathematical expressions are derived to determine the accurate analytical model for throughput, delay, bandwidth efficiency, energy consumption and life time for each node prioritization scheme. With the intention of analytical model validation, we have performed the simulations in OMNET++/MIXIM framework. Analytical and simulation results show that our proposed hybrid node prioritization scheme outperforms other node prioritization schemes in terms of average network delay, average throughput, average bandwidth efficiency and network lifetime. PMID:27598167

An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks.

PubMed

Javaid, Nadeem; Ilyas, Naveed; Ahmad, Ashfaq; Alrajeh, Nabil; Qasim, Umar; Khan, Zahoor Ali; Liaqat, Tayyaba; Khan, Majid Iqbal

2015-11-17

Most applications of underwater wireless sensor networks (UWSNs) demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS) to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV)-aided efficient data-gathering (AEDG) routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT) algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS) to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics.

An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks

PubMed Central

Javaid, Nadeem; Ilyas, Naveed; Ahmad, Ashfaq; Alrajeh, Nabil; Qasim, Umar; Khan, Zahoor Ali; Liaqat, Tayyaba; Khan, Majid Iqbal

2015-01-01

Most applications of underwater wireless sensor networks (UWSNs) demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS) to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV)-aided efficient data-gathering (AEDG) routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT) algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS) to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics. PMID:26593924

An ACOR-Based Multi-Objective WSN Deployment Example for Lunar Surveying.

PubMed

López-Matencio, Pablo

2016-02-06

Wireless sensor networks (WSNs) can gather in situ real data measurements and work unattended for long periods, even in remote, rough places. A critical aspect of WSN design is node placement, as this determines sensing capacities, network connectivity, network lifetime and, in short, the whole operational capabilities of the WSN. This paper proposes and studies a new node placement algorithm that focus on these aspects. As a motivating example, we consider a network designed to describe the distribution of helium-3 (³He), a potential enabling element for fusion reactors, on the Moon. ³He is abundant on the Moon's surface, and knowledge of its distribution is essential for future harvesting purposes. Previous data are inconclusive, and there is general agreement that on-site measurements, obtained over a long time period, are necessary to better understand the mechanisms involved in the distribution of this element on the Moon. Although a mission of this type is extremely complex, it allows us to illustrate the main challenges involved in a multi-objective WSN placement problem, i.e., selection of optimal observation sites and maximization of the lifetime of the network. To tackle optimization, we use a recent adaptation of the ant colony optimization (ACOR) metaheuristic, extended to continuous domains. Solutions are provided in the form of a Pareto frontier that shows the optimal equilibria. Moreover, we compared our scheme with the four-directional placement (FDP) heuristic, which was outperformed in all cases.

r- and K-selection in fluctuating populations is determined by the evolutionary trade-off between two fitness measures: Growth rate and lifetime reproductive success.

PubMed

Engen, Steinar; Saether, Bernt-Erik

2017-01-01

In a stable environment, evolution maximizes growth rates in populations that are not density regulated and the carrying capacity in the case of density regulation. In a fluctuating environment, evolution maximizes a function of growth rate, carrying capacity and environmental variance, tending to r-selection and K-selection under large and small environmental noise, respectively. Here we analyze a model in which birth and death rates depend on density through the same function but with independent strength of density dependence. As a special case, both functions may be linear, corresponding to logistic dynamics. It is shown that evolution maximizes a function of the deterministic growth rate r 0 and the lifetime reproductive success (LRS) R 0 , both defined at small densities, as well as the environmental variance. Under large noise this function is dominated by r 0 and average lifetimes are small, whereas R 0 dominates and lifetimes are larger under small noise. Thus, K-selection is closely linked to selection for large R 0 so that evolution tends to maximize LRS in a stable environment. Consequently, different quantities (r 0 and R 0 ) tend to be maximized at low and high densities, respectively, favoring density-dependent changes in the optimal life history. © 2016 The Author(s). Evolution © 2016 The Society for the Study of Evolution.

SITRUS: Semantic Infrastructure for Wireless Sensor Networks

PubMed Central

Bispo, Kalil A.; Rosa, Nelson S.; Cunha, Paulo R. F.

2015-01-01

Wireless sensor networks (WSNs) are made up of nodes with limited resources, such as processing, bandwidth, memory and, most importantly, energy. For this reason, it is essential that WSNs always work to reduce the power consumption as much as possible in order to maximize its lifetime. In this context, this paper presents SITRUS (semantic infrastructure for wireless sensor networks), which aims to reduce the power consumption of WSN nodes using ontologies. SITRUS consists of two major parts: a message-oriented middleware responsible for both an oriented message communication service and a reconfiguration service; and a semantic information processing module whose purpose is to generate a semantic database that provides the basis to decide whether a WSN node needs to be reconfigurated or not. In order to evaluate the proposed solution, we carried out an experimental evaluation to assess the power consumption and memory usage of WSN applications built atop SITRUS. PMID:26528974

Lifetime's Limited Feminism: Defining and Deconstructing Television for Women.

ERIC Educational Resources Information Center

Hundley, Heather

The Lifetime Television Network has established itself within the cable industry as the only network that explicitly gendercasts its programming. Lifetime specifically markets itself as "Television for Women"; however, what that means exactly is not clear. On the one hand, Lifetime does not want to be noted as the "feminist network." Yet, former…

Maximizing Aggregation of Organic Fluorophores to Prolong Fluorescence Lifetime for Two-Photon Fluorescence Lifetime Imaging.

PubMed

Hu, Wenbo; Guo, Lihong; Bai, Lei; Miao, Xiaofei; Ni, Yun; Wang, Qi; Zhao, Hui; Xie, Meng; Li, Lin; Lu, Xiaomei; Huang, Wei; Fan, Quli

2018-05-28

Two-photon fluorescence lifetime imaging (TP-FLIM) not only permits imaging deep inside the tissues with precise spatial manipulation but also circumvents tissue autofluorescence, holding tremendous promise in molecular imaging. However, the serious lack of suitable contrast agents with long fluorescence lifetime and efficient two-photon absorption (TPA) greatly limits the advance of TP-FLIM. This study reports a simple approach to fabricate water-soluble organic semiconducting nanoparticles [thioxanthone (TXO) NPs] with ultralong fluorescence lifetime and efficient TPA for in vivo TP-FLIM. The approach utilizes the aggregation of a specifically selected thermally activated delayed fluorescence (TADF) fluorophore to prolong its fluorescence lifetime. Encapsulating the TADF fluorophore within an amphiphilic copolymer not only maximizes its aggregation but also obtains TXO NPs with efficient TPA. Importantly, as-prepared TXO NPs exhibit a considerably long fluorescence lifetime at a magnitude of 4.2 µs, which is almost 1000 times larger than that of existing organic contrast agents. Moreover, such long fluorescence lifetime is almost oxygen-inert, readily realizing both in vitro and in vivo TP-FLIM. This work may set valuable guidance for designing organic semiconducting materials with ultralong fluorescence lifetimes to fulfill the potential of FLIM. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A Network Selection Algorithm Considering Power Consumption in Hybrid Wireless Networks

NASA Astrophysics Data System (ADS)

Joe, Inwhee; Kim, Won-Tae; Hong, Seokjoon

In this paper, we propose a novel network selection algorithm considering power consumption in hybrid wireless networks for vertical handover. CDMA, WiBro, WLAN networks are candidate networks for this selection algorithm. This algorithm is composed of the power consumption prediction algorithm and the final network selection algorithm. The power consumption prediction algorithm estimates the expected lifetime of the mobile station based on the current battery level, traffic class and power consumption for each network interface card of the mobile station. If the expected lifetime of the mobile station in a certain network is not long enough compared the handover delay, this particular network will be removed from the candidate network list, thereby preventing unnecessary handovers in the preprocessing procedure. On the other hand, the final network selection algorithm consists of AHP (Analytic Hierarchical Process) and GRA (Grey Relational Analysis). The global factors of the network selection structure are QoS, cost and lifetime. If user preference is lifetime, our selection algorithm selects the network that offers longest service duration due to low power consumption. Also, we conduct some simulations using the OPNET simulation tool. The simulation results show that the proposed algorithm provides longer lifetime in the hybrid wireless network environment.

Dynamics of history-dependent epidemics in temporal networks

NASA Astrophysics Data System (ADS)

Sunny, Albert; Kotnis, Bhushan; Kuri, Joy

2015-08-01

The structural properties of temporal networks often influence the dynamical processes that occur on these networks, e.g., bursty interaction patterns have been shown to slow down epidemics. In this paper, we investigate the effect of link lifetimes on the spread of history-dependent epidemics. We formulate an analytically tractable activity-driven temporal network model that explicitly incorporates link lifetimes. For Markovian link lifetimes, we use mean-field analysis for computing the epidemic threshold, while the effect of non-Markovian link lifetimes is studied using simulations. Furthermore, we also study the effect of negative correlation between the number of links spawned by an individual and the lifetimes of those links. Such negative correlations may arise due to the finite cognitive capacity of the individuals. Our investigations reveal that heavy-tailed link lifetimes slow down the epidemic, while negative correlations can reduce epidemic prevalence. We believe that our results help shed light on the role of link lifetimes in modulating diffusion processes on temporal networks.

A novel load balanced energy conservation approach in WSN using biogeography based optimization

NASA Astrophysics Data System (ADS)

Kaushik, Ajay; Indu, S.; Gupta, Daya

2017-09-01

Clustering sensor nodes is an effective technique to reduce energy consumption of the sensor nodes and maximize the lifetime of Wireless sensor networks. Balancing load of the cluster head is an important factor in long run operation of WSNs. In this paper we propose a novel load balancing approach using biogeography based optimization (LB-BBO). LB-BBO uses two separate fitness functions to perform load balancing of equal and unequal load respectively. The proposed method is simulated using matlab and compared with existing methods. The proposed method shows better performance than all the previous works implemented for energy conservation in WSN

Totally Implantable Wireless Ultrasonic Doppler Blood Flowmeters: Toward Accurate Miniaturized Chronic Monitors.

PubMed

Rothfuss, Michael A; Unadkat, Jignesh V; Gimbel, Michael L; Mickle, Marlin H; Sejdić, Ervin

2017-03-01

Totally implantable wireless ultrasonic blood flowmeters provide direct-access chronic vessel monitoring in hard-to-reach places without using wired bedside monitors or imaging equipment. Although wireless implantable Doppler devices are accurate for most applications, device size and implant lifetime remain vastly underdeveloped. We review past and current approaches to miniaturization and implant lifetime extension for wireless implantable Doppler devices and propose approaches to reduce device size and maximize implant lifetime for the next generation of devices. Additionally, we review current and past approaches to accurate blood flow measurements. This review points toward relying on increased levels of monolithic customization and integration to reduce size. Meanwhile, recommendations to maximize implant lifetime should include alternative sources of power, such as transcutaneous wireless power, that stand to extend lifetime indefinitely. Coupling together the results will pave the way for ultra-miniaturized totally implantable wireless blood flow monitors for truly chronic implantation. Copyright © 2016 World Federation for Ultrasound in Medicine & Biology. Published by Elsevier Inc. All rights reserved.

Sleep Deprivation Attack Detection in Wireless Sensor Network

NASA Astrophysics Data System (ADS)

Bhattasali, Tapalina; Chaki, Rituparna; Sanyal, Sugata

2012-02-01

Deployment of sensor network in hostile environment makes it mainly vulnerable to battery drainage attacks because it is impossible to recharge or replace the battery power of sensor nodes. Among different types of security threats, low power sensor nodes are immensely affected by the attacks which cause random drainage of the energy level of sensors, leading to death of the nodes. The most dangerous type of attack in this category is sleep deprivation, where target of the intruder is to maximize the power consumption of sensor nodes, so that their lifetime is minimized. Most of the existing works on sleep deprivation attack detection involve a lot of overhead, leading to poor throughput. The need of the day is to design a model for detecting intrusions accurately in an energy efficient manner. This paper proposes a hierarchical framework based on distributed collaborative mechanism for detecting sleep deprivation torture in wireless sensor network efficiently. Proposed model uses anomaly detection technique in two steps to reduce the probability of false intrusion.

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network

PubMed Central

Ahmed, Farwa; Wadud, Zahid; Alrajeh, Nabil; Alabed, Mohamad Souheil

2018-01-01

The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs). The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio. PMID:29614794

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network.

PubMed

Ahmed, Farwa; Wadud, Zahid; Javaid, Nadeem; Alrajeh, Nabil; Alabed, Mohamad Souheil; Qasim, Umar

2018-04-02

The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs). The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

Time-dependent breakdown of fiber networks: Uncertainty of lifetime

NASA Astrophysics Data System (ADS)

Mattsson, Amanda; Uesaka, Tetsu

2017-05-01

Materials often fail when subjected to stresses over a prolonged period. The time to failure, also called the lifetime, is known to exhibit large variability of many materials, particularly brittle and quasibrittle materials. For example, a coefficient of variation reaches 100% or even more. Its distribution shape is highly skewed toward zero lifetime, implying a large number of premature failures. This behavior contrasts with that of normal strength, which shows a variation of only 4%-10% and a nearly bell-shaped distribution. The fundamental cause of this large and unique variability of lifetime is not well understood because of the complex interplay between stochastic processes taking place on the molecular level and the hierarchical and disordered structure of the material. We have constructed fiber network models, both regular and random, as a paradigm for general material structures. With such networks, we have performed Monte Carlo simulations of creep failure to establish explicit relationships among fiber characteristics, network structures, system size, and lifetime distribution. We found that fiber characteristics have large, sometimes dominating, influences on the lifetime variability of a network. Among the factors investigated, geometrical disorders of the network were found to be essential to explain the large variability and highly skewed shape of the lifetime distribution. With increasing network size, the distribution asymptotically approaches a double-exponential form. The implication of this result is that, so-called "infant mortality," which is often predicted by the Weibull approximation of the lifetime distribution, may not exist for a large system.

An Energy Aware Adaptive Sampling Algorithm for Energy Harvesting WSN with Energy Hungry Sensors.

PubMed

Srbinovski, Bruno; Magno, Michele; Edwards-Murphy, Fiona; Pakrashi, Vikram; Popovici, Emanuel

2016-03-28

Wireless sensor nodes have a limited power budget, though they are often expected to be functional in the field once deployed for extended periods of time. Therefore, minimization of energy consumption and energy harvesting technology in Wireless Sensor Networks (WSN) are key tools for maximizing network lifetime, and achieving self-sustainability. This paper proposes an energy aware Adaptive Sampling Algorithm (ASA) for WSN with power hungry sensors and harvesting capabilities, an energy management technique that can be implemented on any WSN platform with enough processing power to execute the proposed algorithm. An existing state-of-the-art ASA developed for wireless sensor networks with power hungry sensors is optimized and enhanced to adapt the sampling frequency according to the available energy of the node. The proposed algorithm is evaluated using two in-field testbeds that are supplied by two different energy harvesting sources (solar and wind). Simulation and comparison between the state-of-the-art ASA and the proposed energy aware ASA (EASA) in terms of energy durability are carried out using in-field measured harvested energy (using both wind and solar sources) and power hungry sensors (ultrasonic wind sensor and gas sensors). The simulation results demonstrate that using ASA in combination with an energy aware function on the nodes can drastically increase the lifetime of a WSN node and enable self-sustainability. In fact, the proposed EASA in conjunction with energy harvesting capability can lead towards perpetual WSN operation and significantly outperform the state-of-the-art ASA.

Polarization-multiplexed rate-adaptive non-binary-quasi-cyclic-LDPC-coded multilevel modulation with coherent detection for optical transport networks.

PubMed

Arabaci, Murat; Djordjevic, Ivan B; Saunders, Ross; Marcoccia, Roberto M

2010-02-01

In order to achieve high-speed transmission over optical transport networks (OTNs) and maximize its throughput, we propose using a rate-adaptive polarization-multiplexed coded multilevel modulation with coherent detection based on component non-binary quasi-cyclic (QC) LDPC codes. Compared to prior-art bit-interleaved LDPC-coded modulation (BI-LDPC-CM) scheme, the proposed non-binary LDPC-coded modulation (NB-LDPC-CM) scheme not only reduces latency due to symbol- instead of bit-level processing but also provides either impressive reduction in computational complexity or striking improvements in coding gain depending on the constellation size. As the paper presents, compared to its prior-art binary counterpart, the proposed NB-LDPC-CM scheme addresses the needs of future OTNs, which are achieving the target BER performance and providing maximum possible throughput both over the entire lifetime of the OTN, better.

Tonic nanomolar dopamine enables an activity-dependent phase recovery mechanism that persistently alters the maximal conductance of the hyperpolarization-activated current in a rhythmically active neuron.

PubMed

Rodgers, Edmund W; Fu, Jing Jing; Krenz, Wulf-Dieter C; Baro, Deborah J

2011-11-09

The phases at which network neurons fire in rhythmic motor outputs are critically important for the proper generation of motor behaviors. The pyloric network in the crustacean stomatogastric ganglion generates a rhythmic motor output wherein neuronal phase relationships are remarkably invariant across individuals and throughout lifetimes. The mechanisms for maintaining these robust phase relationships over the long-term are not well described. Here we show that tonic nanomolar dopamine (DA) acts at type 1 DA receptors (D1Rs) to enable an activity-dependent mechanism that can contribute to phase maintenance in the lateral pyloric (LP) neuron. The LP displays continuous rhythmic bursting. The activity-dependent mechanism was triggered by a prolonged decrease in LP burst duration, and it generated a persistent increase in the maximal conductance (G(max)) of the LP hyperpolarization-activated current (I(h)), but only in the presence of steady-state DA. Interestingly, micromolar DA produces an LP phase advance accompanied by a decrease in LP burst duration that abolishes normal LP network function. During a 1 h application of micromolar DA, LP phase recovered over tens of minutes because, the activity-dependent mechanism enabled by steady-state DA was triggered by the micromolar DA-induced decrease in LP burst duration. Presumably, this mechanism restored normal LP network function. These data suggest steady-state DA may enable homeostatic mechanisms that maintain motor network output during protracted neuromodulation. This DA-enabled, activity-dependent mechanism to preserve phase may be broadly relevant, as diminished dopaminergic tone has recently been shown to reduce I(h) in rhythmically active neurons in the mammalian brain.

Expectation Maximization Algorithm for Box-Cox Transformation Cure Rate Model and Assessment of Model Misspecification Under Weibull Lifetimes.

PubMed

Pal, Suvra; Balakrishnan, Narayanaswamy

2018-05-01

In this paper, we develop likelihood inference based on the expectation maximization algorithm for the Box-Cox transformation cure rate model assuming the lifetimes to follow a Weibull distribution. A simulation study is carried out to demonstrate the performance of the proposed estimation method. Through Monte Carlo simulations, we also study the effect of model misspecification on the estimate of cure rate. Finally, we analyze a well-known data on melanoma with the model and the inferential method developed here.

A Q-Learning-Based Delay-Aware Routing Algorithm to Extend the Lifetime of Underwater Sensor Networks.

PubMed

Jin, Zhigang; Ma, Yingying; Su, Yishan; Li, Shuo; Fu, Xiaomei

2017-07-19

Underwater sensor networks (UWSNs) have become a hot research topic because of their various aquatic applications. As the underwater sensor nodes are powered by built-in batteries which are difficult to replace, extending the network lifetime is a most urgent need. Due to the low and variable transmission speed of sound, the design of reliable routing algorithms for UWSNs is challenging. In this paper, we propose a Q-learning based delay-aware routing (QDAR) algorithm to extend the lifetime of underwater sensor networks. In QDAR, a data collection phase is designed to adapt to the dynamic environment. With the application of the Q-learning technique, QDAR can determine a global optimal next hop rather than a greedy one. We define an action-utility function in which residual energy and propagation delay are both considered for adequate routing decisions. Thus, the QDAR algorithm can extend the network lifetime by uniformly distributing the residual energy and provide lower end-to-end delay. The simulation results show that our protocol can yield nearly the same network lifetime, and can reduce the end-to-end delay by 20-25% compared with a classic lifetime-extended routing protocol (QELAR).

A Q-Learning-Based Delay-Aware Routing Algorithm to Extend the Lifetime of Underwater Sensor Networks

PubMed Central

Ma, Yingying; Su, Yishan; Li, Shuo; Fu, Xiaomei

2017-01-01

Underwater sensor networks (UWSNs) have become a hot research topic because of their various aquatic applications. As the underwater sensor nodes are powered by built-in batteries which are difficult to replace, extending the network lifetime is a most urgent need. Due to the low and variable transmission speed of sound, the design of reliable routing algorithms for UWSNs is challenging. In this paper, we propose a Q-learning based delay-aware routing (QDAR) algorithm to extend the lifetime of underwater sensor networks. In QDAR, a data collection phase is designed to adapt to the dynamic environment. With the application of the Q-learning technique, QDAR can determine a global optimal next hop rather than a greedy one. We define an action-utility function in which residual energy and propagation delay are both considered for adequate routing decisions. Thus, the QDAR algorithm can extend the network lifetime by uniformly distributing the residual energy and provide lower end-to-end delay. The simulation results show that our protocol can yield nearly the same network lifetime, and can reduce the end-to-end delay by 20–25% compared with a classic lifetime-extended routing protocol (QELAR). PMID:28753951

An Energy Aware Adaptive Sampling Algorithm for Energy Harvesting WSN with Energy Hungry Sensors

PubMed Central

Srbinovski, Bruno; Magno, Michele; Edwards-Murphy, Fiona; Pakrashi, Vikram; Popovici, Emanuel

2016-01-01

Wireless sensor nodes have a limited power budget, though they are often expected to be functional in the field once deployed for extended periods of time. Therefore, minimization of energy consumption and energy harvesting technology in Wireless Sensor Networks (WSN) are key tools for maximizing network lifetime, and achieving self-sustainability. This paper proposes an energy aware Adaptive Sampling Algorithm (ASA) for WSN with power hungry sensors and harvesting capabilities, an energy management technique that can be implemented on any WSN platform with enough processing power to execute the proposed algorithm. An existing state-of-the-art ASA developed for wireless sensor networks with power hungry sensors is optimized and enhanced to adapt the sampling frequency according to the available energy of the node. The proposed algorithm is evaluated using two in-field testbeds that are supplied by two different energy harvesting sources (solar and wind). Simulation and comparison between the state-of-the-art ASA and the proposed energy aware ASA (EASA) in terms of energy durability are carried out using in-field measured harvested energy (using both wind and solar sources) and power hungry sensors (ultrasonic wind sensor and gas sensors). The simulation results demonstrate that using ASA in combination with an energy aware function on the nodes can drastically increase the lifetime of a WSN node and enable self-sustainability. In fact, the proposed EASA in conjunction with energy harvesting capability can lead towards perpetual WSN operation and significantly outperform the state-of-the-art ASA. PMID:27043559

Zone-Based Routing Protocol for Wireless Sensor Networks

PubMed Central

Venkateswarlu Kumaramangalam, Muni; Adiyapatham, Kandasamy; Kandasamy, Chandrasekaran

2014-01-01

Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads. PMID:27437455

Zone-Based Routing Protocol for Wireless Sensor Networks.

PubMed

Venkateswarlu Kumaramangalam, Muni; Adiyapatham, Kandasamy; Kandasamy, Chandrasekaran

2014-01-01

Extensive research happening across the globe witnessed the importance of Wireless Sensor Network in the present day application world. In the recent past, various routing algorithms have been proposed to elevate WSN network lifetime. Clustering mechanism is highly successful in conserving energy resources for network activities and has become promising field for researches. However, the problem of unbalanced energy consumption is still open because the cluster head activities are tightly coupled with role and location of a particular node in the network. Several unequal clustering algorithms are proposed to solve this wireless sensor network multihop hot spot problem. Current unequal clustering mechanisms consider only intra- and intercluster communication cost. Proper organization of wireless sensor network into clusters enables efficient utilization of limited resources and enhances lifetime of deployed sensor nodes. This paper considers a novel network organization scheme, energy-efficient edge-based network partitioning scheme, to organize sensor nodes into clusters of equal size. Also, it proposes a cluster-based routing algorithm, called zone-based routing protocol (ZBRP), for elevating sensor network lifetime. Experimental results show that ZBRP out-performs interims of network lifetime and energy conservation with its uniform energy consumption among the cluster heads.

Multiple-predators-based capture process on complex networks

NASA Astrophysics Data System (ADS)

Ramiz Sharafat, Rajput; Pu, Cunlai; Li, Jie; Chen, Rongbin; Xu, Zhongqi

2017-03-01

The predator/prey (capture) problem is a prototype of many network-related applications. We study the capture process on complex networks by considering multiple predators from multiple sources. In our model, some lions start from multiple sources simultaneously to capture the lamb by biased random walks, which are controlled with a free parameter $\\alpha$. We derive the distribution of the lamb's lifetime and the expected lifetime $\\left\\langle T\\right\\rangle $. Through simulation, we find that the expected lifetime drops substantially with the increasing number of lions. We also study how the underlying topological structure affects the capture process, and obtain that locating on small-degree nodes is better than large-degree nodes to prolong the lifetime of the lamb. Moreover, dense or homogeneous network structures are against the survival of the lamb.

Joint Energy Supply and Routing Path Selection for Rechargeable Wireless Sensor Networks.

PubMed

Tang, Liangrui; Cai, Jinqi; Yan, Jiangyu; Zhou, Zhenyu

2018-06-17

The topic of network lifetime has been attracting much research attention because of its importance in prolonging the standing operation of battery-restricted wireless sensor networks, and the rechargeable wireless sensor network has emerged as a promising solution. In this paper, we propose a joint energy supply and routing path selection algorithm to extend the network lifetime based on an initiative power supply. We develop a two-stage energy replenishment strategy to supplement the energy consumption of nodes as much as possible. Furthermore, the influence of charging factors on the selection of next-hop nodes in data routing is considered. The simulation results show that our algorithm effectively prolong the network lifetime, and different demands of network delay and energy consumption can be obtained by dynamically adjusting parameters.

An Energy-Efficient Game-Theory-Based Spectrum Decision Scheme for Cognitive Radio Sensor Networks

PubMed Central

Salim, Shelly; Moh, Sangman

2016-01-01

A cognitive radio sensor network (CRSN) is a wireless sensor network in which sensor nodes are equipped with cognitive radio. In this paper, we propose an energy-efficient game-theory-based spectrum decision (EGSD) scheme for CRSNs to prolong the network lifetime. Note that energy efficiency is the most important design consideration in CRSNs because it determines the network lifetime. The central part of the EGSD scheme consists of two spectrum selection algorithms: random selection and game-theory-based selection. The EGSD scheme also includes a clustering algorithm, spectrum characterization with a Markov chain, and cluster member coordination. Our performance study shows that EGSD outperforms the existing popular framework in terms of network lifetime and coordination overhead. PMID:27376290

An Energy-Efficient Game-Theory-Based Spectrum Decision Scheme for Cognitive Radio Sensor Networks.

PubMed

Salim, Shelly; Moh, Sangman

2016-06-30

A cognitive radio sensor network (CRSN) is a wireless sensor network in which sensor nodes are equipped with cognitive radio. In this paper, we propose an energy-efficient game-theory-based spectrum decision (EGSD) scheme for CRSNs to prolong the network lifetime. Note that energy efficiency is the most important design consideration in CRSNs because it determines the network lifetime. The central part of the EGSD scheme consists of two spectrum selection algorithms: random selection and game-theory-based selection. The EGSD scheme also includes a clustering algorithm, spectrum characterization with a Markov chain, and cluster member coordination. Our performance study shows that EGSD outperforms the existing popular framework in terms of network lifetime and coordination overhead.

Survey of WBSNs for Pre-Hospital Assistance: Trends to Maximize the Network Lifetime and Video Transmission Techniques

PubMed Central

Gonzalez, Enrique; Peña, Raul; Vargas-Rosales, Cesar; Avila, Alfonso; Perez-Diaz de Cerio, David

2015-01-01

This survey aims to encourage the multidisciplinary communities to join forces for innovation in the mobile health monitoring area. Specifically, multidisciplinary innovations in medical emergency scenarios can have a significant impact on the effectiveness and quality of the procedures and practices in the delivery of medical care. Wireless body sensor networks (WBSNs) are a promising technology capable of improving the existing practices in condition assessment and care delivery for a patient in a medical emergency. This technology can also facilitate the early interventions of a specialist physician during the pre-hospital period. WBSNs make possible these early interventions by establishing remote communication links with video/audio support and by providing medical information such as vital signs, electrocardiograms, etc. in real time. This survey focuses on relevant issues needed to understand how to setup a WBSN for medical emergencies. These issues are: monitoring vital signs and video transmission, energy efficient protocols, scheduling, optimization and energy consumption on a WBSN. PMID:26007741

Maximization Network Throughput Based on Improved Genetic Algorithm and Network Coding for Optical Multicast Networks

NASA Astrophysics Data System (ADS)

Wei, Chengying; Xiong, Cuilian; Liu, Huanlin

2017-12-01

Maximal multicast stream algorithm based on network coding (NC) can improve the network's throughput for wavelength-division multiplexing (WDM) networks, which however is far less than the network's maximal throughput in terms of theory. And the existing multicast stream algorithms do not give the information distribution pattern and routing in the meantime. In the paper, an improved genetic algorithm is brought forward to maximize the optical multicast throughput by NC and to determine the multicast stream distribution by hybrid chromosomes construction for multicast with single source and multiple destinations. The proposed hybrid chromosomes are constructed by the binary chromosomes and integer chromosomes, while the binary chromosomes represent optical multicast routing and the integer chromosomes indicate the multicast stream distribution. A fitness function is designed to guarantee that each destination can receive the maximum number of decoding multicast streams. The simulation results showed that the proposed method is far superior over the typical maximal multicast stream algorithms based on NC in terms of network throughput in WDM networks.

Ballistic heat transport in laser generated nano-bubbles

NASA Astrophysics Data System (ADS)

Lombard, Julien; Biben, Thierry; Merabia, Samy

2016-08-01

Nanobubbles generated by laser heated plasmonic nanoparticles are of interest for biomedical and energy harvesting applications. Of utmost importance is the maximal size of these transient bubbles. Here, we report hydrodynamic phase field simulations of the dynamics of laser induced nanobubbles, with the aim to understand which physical processes govern their maximal size. We show that the nanobubble maximal size and lifetime are to a large extent controlled by the ballistic thermal flux which is present inside the bubble. Taking into account this thermal flux, we can reproduce the fluence dependence of the maximal nanobubble radius as reported experimentally. We also discuss the influence of the laser pulse duration on the number of nanobubbles generated and their maximal size. These studies represent a significant step toward the optimization of the nanobubble size, which is of crucial importance for photothermal cancer therapy applications.Nanobubbles generated by laser heated plasmonic nanoparticles are of interest for biomedical and energy harvesting applications. Of utmost importance is the maximal size of these transient bubbles. Here, we report hydrodynamic phase field simulations of the dynamics of laser induced nanobubbles, with the aim to understand which physical processes govern their maximal size. We show that the nanobubble maximal size and lifetime are to a large extent controlled by the ballistic thermal flux which is present inside the bubble. Taking into account this thermal flux, we can reproduce the fluence dependence of the maximal nanobubble radius as reported experimentally. We also discuss the influence of the laser pulse duration on the number of nanobubbles generated and their maximal size. These studies represent a significant step toward the optimization of the nanobubble size, which is of crucial importance for photothermal cancer therapy applications. Electronic supplementary information (ESI) available. See DOI: 10.1039/C6NR02144A

Fuzzy Logic-Based Guaranteed Lifetime Protocol for Real-Time Wireless Sensor Networks.

PubMed

Shah, Babar; Iqbal, Farkhund; Abbas, Ali; Kim, Ki-Il

2015-08-18

Few techniques for guaranteeing a network lifetime have been proposed despite its great impact on network management. Moreover, since the existing schemes are mostly dependent on the combination of disparate parameters, they do not provide additional services, such as real-time communications and balanced energy consumption among sensor nodes; thus, the adaptability problems remain unresolved among nodes in wireless sensor networks (WSNs). To solve these problems, we propose a novel fuzzy logic model to provide real-time communication in a guaranteed WSN lifetime. The proposed fuzzy logic controller accepts the input descriptors energy, time and velocity to determine each node's role for the next duration and the next hop relay node for real-time packets. Through the simulation results, we verified that both the guaranteed network's lifetime and real-time delivery are efficiently ensured by the new fuzzy logic model. In more detail, the above-mentioned two performance metrics are improved up to 8%, as compared to our previous work, and 14% compared to existing schemes, respectively.

Bistability, epigenetics, and bet-hedging in bacteria.

PubMed

Veening, Jan-Willem; Smits, Wiep Klaas; Kuipers, Oscar P

2008-01-01

Clonal populations of microbial cells often show a high degree of phenotypic variability under homogeneous conditions. Stochastic fluctuations in the cellular components that determine cellular states can cause two distinct subpopulations, a property called bistability. Phenotypic heterogeneity can be readily obtained by interlinking multiple gene regulatory pathways, effectively resulting in a genetic logic-AND gate. Although switching between states can occur within the cells' lifetime, cells can also pass their cellular state over to the next generation by a mechanism known as epigenetic inheritance and thus perpetuate the phenotypic state. Importantly, heterogeneous populations can demonstrate increased fitness compared with homogeneous populations. This suggests that microbial cells employ bet-hedging strategies to maximize survival. Here, we discuss the possible roles of interlinked bistable networks, epigenetic inheritance, and bet-hedging in bacteria.

Statistical-QoS Guaranteed Energy Efficiency Optimization for Energy Harvesting Wireless Sensor Networks

PubMed Central

Cheng, Wenchi; Zhang, Hailin

2017-01-01

Energy harvesting, which offers a never-ending energy supply, has emerged as a prominent technology to prolong the lifetime and reduce costs for the battery-powered wireless sensor networks. However, how to improve the energy efficiency while guaranteeing the quality of service (QoS) for energy harvesting based wireless sensor networks is still an open problem. In this paper, we develop statistical delay-bounded QoS-driven power control policies to maximize the effective energy efficiency (EEE), which is defined as the spectrum efficiency under given specified QoS constraints per unit harvested energy, for energy harvesting based wireless sensor networks. For the battery-infinite wireless sensor networks, our developed QoS-driven power control policy converges to the Energy harvesting Water Filling (E-WF) scheme and the Energy harvesting Channel Inversion (E-CI) scheme under the very loose and stringent QoS constraints, respectively. For the battery-finite wireless sensor networks, our developed QoS-driven power control policy becomes the Truncated energy harvesting Water Filling (T-WF) scheme and the Truncated energy harvesting Channel Inversion (T-CI) scheme under the very loose and stringent QoS constraints, respectively. Furthermore, we evaluate the outage probabilities to theoretically analyze the performance of our developed QoS-driven power control policies. The obtained numerical results validate our analysis and show that our developed optimal power control policies can optimize the EEE over energy harvesting based wireless sensor networks. PMID:28832509

Statistical-QoS Guaranteed Energy Efficiency Optimization for Energy Harvesting Wireless Sensor Networks.

PubMed

Gao, Ya; Cheng, Wenchi; Zhang, Hailin

2017-08-23

Energy harvesting, which offers a never-ending energy supply, has emerged as a prominent technology to prolong the lifetime and reduce costs for the battery-powered wireless sensor networks. However, how to improve the energy efficiency while guaranteeing the quality of service (QoS) for energy harvesting based wireless sensor networks is still an open problem. In this paper, we develop statistical delay-bounded QoS-driven power control policies to maximize the effective energy efficiency (EEE), which is defined as the spectrum efficiency under given specified QoS constraints per unit harvested energy, for energy harvesting based wireless sensor networks. For the battery-infinite wireless sensor networks, our developed QoS-driven power control policy converges to the Energy harvesting Water Filling (E-WF) scheme and the Energy harvesting Channel Inversion (E-CI) scheme under the very loose and stringent QoS constraints, respectively. For the battery-finite wireless sensor networks, our developed QoS-driven power control policy becomes the Truncated energy harvesting Water Filling (T-WF) scheme and the Truncated energy harvesting Channel Inversion (T-CI) scheme under the very loose and stringent QoS constraints, respectively. Furthermore, we evaluate the outage probabilities to theoretically analyze the performance of our developed QoS-driven power control policies. The obtained numerical results validate our analysis and show that our developed optimal power control policies can optimize the EEE over energy harvesting based wireless sensor networks.

Mutual-Information-Based Incremental Relaying Communications for Wireless Biomedical Implant Systems

PubMed Central

Liao, Yangzhe; Cai, Qing; Ai, Qingsong; Liu, Quan

2018-01-01

Network lifetime maximization of wireless biomedical implant systems is one of the major research challenges of wireless body area networks (WBANs). In this paper, a mutual information (MI)-based incremental relaying communication protocol is presented where several on-body relay nodes and one coordinator are attached to the clothes of a patient. Firstly, a comprehensive analysis of a system model is investigated in terms of channel path loss, energy consumption, and the outage probability from the network perspective. Secondly, only when the MI value becomes smaller than the predetermined threshold is data transmission allowed. The communication path selection can be either from the implanted sensor to the on-body relay then forwards to the coordinator or from the implanted sensor to the coordinator directly, depending on the communication distance. Moreover, mathematical models of quality of service (QoS) metrics are derived along with the related subjective functions. The results show that the MI-based incremental relaying technique achieves better performance in comparison to our previous proposed protocol techniques regarding several selected performance metrics. The outcome of this paper can be applied to intra-body continuous physiological signal monitoring, artificial biofeedback-oriented WBANs, and telemedicine system design. PMID:29419784

Mutual-Information-Based Incremental Relaying Communications for Wireless Biomedical Implant Systems.

PubMed

Liao, Yangzhe; Leeson, Mark S; Cai, Qing; Ai, Qingsong; Liu, Quan

2018-02-08

Network lifetime maximization of wireless biomedical implant systems is one of the major research challenges of wireless body area networks (WBANs). In this paper, a mutual information (MI)-based incremental relaying communication protocol is presented where several on-body relay nodes and one coordinator are attached to the clothes of a patient. Firstly, a comprehensive analysis of a system model is investigated in terms of channel path loss, energy consumption, and the outage probability from the network perspective. Secondly, only when the MI value becomes smaller than the predetermined threshold is data transmission allowed. The communication path selection can be either from the implanted sensor to the on-body relay then forwards to the coordinator or from the implanted sensor to the coordinator directly, depending on the communication distance. Moreover, mathematical models of quality of service (QoS) metrics are derived along with the related subjective functions. The results show that the MI-based incremental relaying technique achieves better performance in comparison to our previous proposed protocol techniques regarding several selected performance metrics. The outcome of this paper can be applied to intra-body continuous physiological signal monitoring, artificial biofeedback-oriented WBANs, and telemedicine system design.

Impact of individual interest shift on information dissemination in modular networks

NASA Astrophysics Data System (ADS)

Zhao, Narisa; Cui, Xuelian

2017-01-01

Social networks exhibit strong community structure. Many researches have been done to explore the impacts of community structure on information diffusion but few combined with human behaviors together. In this paper, we focus on how the individual interests' changing behavior impacts the dynamics of information propagation. Firstly, we propose an information dissemination model considering both the community structure and individual interest shift where social reinforcement and time decaying are taken into account. The accuracy of the model is evaluated by comparing the simulation and theoretical results. Further, the numerical results illustrate that both the community structure and the interests changing behavior have effects on the outbreak size of the information dissemination. Specially, lower modularity and higher community connection density will accelerate the speed of information propagation especially when the information maximal lifetime is shorter. In addition, the changes of individual interests in the message have a great impact on the final density of the received through increasing or decreasing the number of satisfied individuals directly. What is more, our findings suggest that when the modularity of the network is higher and the community clustering coefficient is lower individual interest shift behavior will have a heavier effect on the spread scope.

Caffeine intake, toxicity and dependence and lifetime risk for psychiatric and substance use disorders: an epidemiologic and co-twin control analysis.

PubMed

Kendler, Kenneth S; Myers, John; O Gardner, Charles

2006-12-01

Although caffeine is the most commonly used psychoactive substance and often produces symptoms of toxicity and dependence, little is known, especially in community samples, about the association between caffeine use, toxicity and dependence and risk for common psychiatric and substance use disorders. Assessments of lifetime maximal caffeine use and symptoms of caffeine toxicity and dependence were available on over 3600 adult twins ascertained from the population-based Virginia Twin Registry. Lifetime histories of major depression (MD), generalized anxiety disorder (GAD) and panic disorder, alcohol dependence, adult antisocial behavior and cannabis and cocaine abuse/dependence were obtained at personal interview. Logistic regression analyses in the entire sample and within monozygotic (MZ) twin pairs were conducted in SAS. In the entire sample, measures of maximal caffeine use, heavy caffeine use, and caffeine-related toxicity and dependence were significantly and positively associated with all seven psychiatric and substance use disorders. However, within MZ twin pairs, controlling for genetic and family environmental factors, these associations, while positive, were all non-significant. These results were similar when excluding twins who denied regular caffeine use. Maximal lifetime caffeine intake and caffeine-associated toxicity and dependence are moderately associated with risk for a wide range of psychiatric and substance use disorders. Analyses of these relationships within MZ twin pairs suggest that most of the observed associations are not causal. Rather, familial factors, which are probably in part genetic, predispose to both caffeine intake, toxicity and dependence and the risk for a broad array of internalizing and externalizing disorders.

A Hybrid Memetic Framework for Coverage Optimization in Wireless Sensor Networks.

PubMed

Chen, Chia-Pang; Mukhopadhyay, Subhas Chandra; Chuang, Cheng-Long; Lin, Tzu-Shiang; Liao, Min-Sheng; Wang, Yung-Chung; Jiang, Joe-Air

2015-10-01

One of the critical concerns in wireless sensor networks (WSNs) is the continuous maintenance of sensing coverage. Many particular applications, such as battlefield intrusion detection and object tracking, require a full-coverage at any time, which is typically resolved by adding redundant sensor nodes. With abundant energy, previous studies suggested that the network lifetime can be maximized while maintaining full coverage through organizing sensor nodes into a maximum number of disjoint sets and alternately turning them on. Since the power of sensor nodes is unevenly consumed over time, and early failure of sensor nodes leads to coverage loss, WSNs require dynamic coverage maintenance. Thus, the task of permanently sustaining full coverage is particularly formulated as a hybrid of disjoint set covers and dynamic-coverage-maintenance problems, and both have been proven to be nondeterministic polynomial-complete. In this paper, a hybrid memetic framework for coverage optimization (Hy-MFCO) is presented to cope with the hybrid problem using two major components: 1) a memetic algorithm (MA)-based scheduling strategy and 2) a heuristic recursive algorithm (HRA). First, the MA-based scheduling strategy adopts a dynamic chromosome structure to create disjoint sets, and then the HRA is utilized to compensate the loss of coverage by awaking some of the hibernated nodes in local regions when a disjoint set fails to maintain full coverage. The results obtained from real-world experiments using a WSN test-bed and computer simulations indicate that the proposed Hy-MFCO is able to maximize sensing coverage while achieving energy efficiency at the same time. Moreover, the results also show that the Hy-MFCO significantly outperforms the existing methods with respect to coverage preservation and energy efficiency.

Reliable Adaptive Data Aggregation Route Strategy for a Trade-off between Energy and Lifetime in WSNs

PubMed Central

Guo, Wenzhong; Hong, Wei; Zhang, Bin; Chen, Yuzhong; Xiong, Naixue

2014-01-01

Mobile security is one of the most fundamental problems in Wireless Sensor Networks (WSNs). The data transmission path will be compromised for some disabled nodes. To construct a secure and reliable network, designing an adaptive route strategy which optimizes energy consumption and network lifetime of the aggregation cost is of great importance. In this paper, we address the reliable data aggregation route problem for WSNs. Firstly, to ensure nodes work properly, we propose a data aggregation route algorithm which improves the energy efficiency in the WSN. The construction process achieved through discrete particle swarm optimization (DPSO) saves node energy costs. Then, to balance the network load and establish a reliable network, an adaptive route algorithm with the minimal energy and the maximum lifetime is proposed. Since it is a non-linear constrained multi-objective optimization problem, in this paper we propose a DPSO with the multi-objective fitness function combined with the phenotype sharing function and penalty function to find available routes. Experimental results show that compared with other tree routing algorithms our algorithm can effectively reduce energy consumption and trade off energy consumption and network lifetime. PMID:25215944

Predicting the Lifetime of Dynamic Networks Experiencing Persistent Random Attacks.

PubMed

Podobnik, Boris; Lipic, Tomislav; Horvatic, Davor; Majdandzic, Antonio; Bishop, Steven R; Eugene Stanley, H

2015-09-21

Estimating the critical points at which complex systems abruptly flip from one state to another is one of the remaining challenges in network science. Due to lack of knowledge about the underlying stochastic processes controlling critical transitions, it is widely considered difficult to determine the location of critical points for real-world networks, and it is even more difficult to predict the time at which these potentially catastrophic failures occur. We analyse a class of decaying dynamic networks experiencing persistent failures in which the magnitude of the overall failure is quantified by the probability that a potentially permanent internal failure will occur. When the fraction of active neighbours is reduced to a critical threshold, cascading failures can trigger a total network failure. For this class of network we find that the time to network failure, which is equivalent to network lifetime, is inversely dependent upon the magnitude of the failure and logarithmically dependent on the threshold. We analyse how permanent failures affect network robustness using network lifetime as a measure. These findings provide new methodological insight into system dynamics and, in particular, of the dynamic processes of networks. We illustrate the network model by selected examples from biology, and social science.

Fuzzy Logic-Based Guaranteed Lifetime Protocol for Real-Time Wireless Sensor Networks

PubMed Central

Shah, Babar; Iqbal, Farkhund; Abbas, Ali; Kim, Ki-Il

2015-01-01

Few techniques for guaranteeing a network lifetime have been proposed despite its great impact on network management. Moreover, since the existing schemes are mostly dependent on the combination of disparate parameters, they do not provide additional services, such as real-time communications and balanced energy consumption among sensor nodes; thus, the adaptability problems remain unresolved among nodes in wireless sensor networks (WSNs). To solve these problems, we propose a novel fuzzy logic model to provide real-time communication in a guaranteed WSN lifetime. The proposed fuzzy logic controller accepts the input descriptors energy, time and velocity to determine each node’s role for the next duration and the next hop relay node for real-time packets. Through the simulation results, we verified that both the guaranteed network’s lifetime and real-time delivery are efficiently ensured by the new fuzzy logic model. In more detail, the above-mentioned two performance metrics are improved up to 8%, as compared to our previous work, and 14% compared to existing schemes, respectively. PMID:26295238

A network coding based routing protocol for underwater sensor networks.

PubMed

Wu, Huayang; Chen, Min; Guan, Xin

2012-01-01

Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime.

A Network Coding Based Routing Protocol for Underwater Sensor Networks

PubMed Central

Wu, Huayang; Chen, Min; Guan, Xin

2012-01-01

Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime. PMID:22666045

Trust Maximization in Social Networks

NASA Astrophysics Data System (ADS)

Zhan, Justin; Fang, Xing

Trust is a human-related phenomenon in social networks. Trust research on social networks has gained much attention on its usefulness, and on modeling propagations. There is little focus on finding maximum trust in social networks which is particularly important when a social network is oriented by certain tasks. In this paper, we propose a trust maximization algorithm based on the task-oriented social networks.

Gun violence in Americans' social network during their lifetime.

PubMed

Kalesan, Bindu; Weinberg, Janice; Galea, Sandro

2016-12-01

The overall burden of gun violence death and injury in the US is now well understood. However, no study has shown the extent to which gun violence is associated with the individual lives of Americans. We used fatal and non-fatal gun injury rates in 2013 from Centers for Disease Control and Prevention's Web-based Injury Statistics Query and Reporting System (WISQARS) and generally accepted estimates about the size of an American's social network to determine the likelihood that any given person will know someone in their personal social network who is a victim of gun violence during their lifetime. We derived estimates in the overall population and among racial/ethnic groups and by gun-injury intent. The likelihood of knowing a gun violence victim within any given personal network over a lifetime is 99.85% (99.8% to 99.9%). The likelihood among non-Hispanic white, black, Hispanic and other race Americans were 97.1%, 99.9%, 99.5% and 88.9% respectively. Nearly all Americans of all racial/ethnic groups are likely to know a victim of gun violence in their social network during their lifetime. Copyright © 2016 Elsevier Inc. All rights reserved.

Clustering and Beamforming for Efficient Communication in Wireless Sensor Networks

PubMed Central

Porcel-Rodríguez, Francisco; Valenzuela-Valdés, Juan; Padilla, Pablo; Luna-Valero, Francisco; Luque-Baena, Rafael; López-Gordo, Miguel Ángel

2016-01-01

Energy efficiency is a critical issue for wireless sensor networks (WSNs) as sensor nodes have limited power availability. In order to address this issue, this paper tries to maximize the power efficiency in WSNs by means of the evaluation of WSN node networks and their performance when both clustering and antenna beamforming techniques are applied. In this work, four different scenarios are defined, each one considering different numbers of sensors: 50, 20, 10, five, and two nodes per scenario, and each scenario is randomly generated thirty times in order to statistically validate the results. For each experiment, two different target directions for transmission are taken into consideration in the optimization process (φ = 0° and θ = 45°; φ = 45°, and θ = 45°). Each scenario is evaluated for two different types of antennas, an ideal isotropic antenna and a conventional dipole one. In this set of experiments two types of WSN are evaluated: in the first one, all of the sensors have the same amount of power for communications purposes; in the second one, each sensor has a different amount of power for its communications purposes. The analyzed cases in this document are focused on 2D surface and 3D space for the node location. To the authors’ knowledge, this is the first time that beamforming and clustering are simultaneously applied to increase the network lifetime in WSNs. PMID:27556463

Leveraging Energy Harvesting and Wake-Up Receivers for Long-Term Wireless Sensor Networks.

PubMed

Ait Aoudia, Fayçal; Gautier, Matthieu; Magno, Michele; Berder, Olivier; Benini, Luca

2018-05-15

Wireless sensor nodes are traditionally powered by individual batteries, and a significant effort has been devoted to maximizing the lifetime of these devices. However, as the batteries can only store a finite amount of energy, the network is still doomed to die, and changing the batteries is not always possible. A promising solution is to enable each node to harvest energy directly in its environment, using individual energy harvesters. Moreover, novel ultra-low power wake-up receivers, which allow continuous listening of the channel with negligible power consumption, are emerging. These devices enable asynchronous communication, further reducing the power consumption related to communication, which is typically one the most energy-consuming tasks in wireless sensor networks. Energy harvesting and wake-up receivers can be combined to significantly increase the energy efficiency of sensor networks. In this paper, we propose an energy manager for energy harvesting wireless sensor nodes and an asynchronous medium access control protocol, which exploits ultra-low power wake-up receivers. The two components are designed to work together and especially to fit the stringent constraints of wireless sensor nodes. The proposed approach has been implemented on a real hardware platform and tested in the field. Experimental results demonstrate the benefits of the proposed approach in terms of energy efficiency, power consumption and throughput, which can be up to more than two-times higher compared to traditional schemes.

Leveraging Energy Harvesting and Wake-Up Receivers for Long-Term Wireless Sensor Networks

PubMed Central

Ait Aoudia, Fayçal; Gautier, Matthieu; Magno, Michele; Benini, Luca

2018-01-01

Wireless sensor nodes are traditionally powered by individual batteries, and a significant effort has been devoted to maximizing the lifetime of these devices. However, as the batteries can only store a finite amount of energy, the network is still doomed to die, and changing the batteries is not always possible. A promising solution is to enable each node to harvest energy directly in its environment, using individual energy harvesters. Moreover, novel ultra-low power wake-up receivers, which allow continuous listening of the channel with negligible power consumption, are emerging. These devices enable asynchronous communication, further reducing the power consumption related to communication, which is typically one the most energy-consuming tasks in wireless sensor networks. Energy harvesting and wake-up receivers can be combined to significantly increase the energy efficiency of sensor networks. In this paper, we propose an energy manager for energy harvesting wireless sensor nodes and an asynchronous medium access control protocol, which exploits ultra-low power wake-up receivers. The two components are designed to work together and especially to fit the stringent constraints of wireless sensor nodes. The proposed approach has been implemented on a real hardware platform and tested in the field. Experimental results demonstrate the benefits of the proposed approach in terms of energy efficiency, power consumption and throughput, which can be up to more than two-times higher compared to traditional schemes. PMID:29762535

A uniform energy consumption algorithm for wireless sensor and actuator networks based on dynamic polling point selection.

PubMed

Li, Shuo; Peng, Jun; Liu, Weirong; Zhu, Zhengfa; Lin, Kuo-Chi

2013-12-19

Recent research has indicated that using the mobility of the actuator in wireless sensor and actuator networks (WSANs) to achieve mobile data collection can greatly increase the sensor network lifetime. However, mobile data collection may result in unacceptable collection delays in the network if the path of the actuator is too long. Because real-time network applications require meeting data collection delay constraints, planning the path of the actuator is a very important issue to balance the prolongation of the network lifetime and the reduction of the data collection delay. In this paper, a multi-hop routing mobile data collection algorithm is proposed based on dynamic polling point selection with delay constraints to address this issue. The algorithm can actively update the selection of the actuator's polling points according to the sensor nodes' residual energies and their locations while also considering the collection delay constraint. It also dynamically constructs the multi-hop routing trees rooted by these polling points to balance the sensor node energy consumption and the extension of the network lifetime. The effectiveness of the algorithm is validated by simulation.

Uncovering the overlapping community structure of complex networks by maximal cliques

NASA Astrophysics Data System (ADS)

Li, Junqiu; Wang, Xingyuan; Cui, Yaozu

2014-12-01

In this paper, a unique algorithm is proposed to detect overlapping communities in the un-weighted and weighted networks with considerable accuracy. The maximal cliques, overlapping vertex, bridge vertex and isolated vertex are introduced. First, all the maximal cliques are extracted by the algorithm based on the deep and bread searching. Then two maximal cliques can be merged into a larger sub-graph by some given rules. In addition, the proposed algorithm successfully finds overlapping vertices and bridge vertices between communities. Experimental results using some real-world networks data show that the performance of the proposed algorithm is satisfactory.

Markov Chain Model-Based Optimal Cluster Heads Selection for Wireless Sensor Networks

PubMed Central

Ahmed, Gulnaz; Zou, Jianhua; Zhao, Xi; Sadiq Fareed, Mian Muhammad

2017-01-01

The longer network lifetime of Wireless Sensor Networks (WSNs) is a goal which is directly related to energy consumption. This energy consumption issue becomes more challenging when the energy load is not properly distributed in the sensing area. The hierarchal clustering architecture is the best choice for these kind of issues. In this paper, we introduce a novel clustering protocol called Markov chain model-based optimal cluster heads (MOCHs) selection for WSNs. In our proposed model, we introduce a simple strategy for the optimal number of cluster heads selection to overcome the problem of uneven energy distribution in the network. The attractiveness of our model is that the BS controls the number of cluster heads while the cluster heads control the cluster members in each cluster in such a restricted manner that a uniform and even load is ensured in each cluster. We perform an extensive range of simulation using five quality measures, namely: the lifetime of the network, stable and unstable region in the lifetime of the network, throughput of the network, the number of cluster heads in the network, and the transmission time of the network to analyze the proposed model. We compare MOCHs against Sleep-awake Energy Efficient Distributed (SEED) clustering, Artificial Bee Colony (ABC), Zone Based Routing (ZBR), and Centralized Energy Efficient Clustering (CEEC) using the above-discussed quality metrics and found that the lifetime of the proposed model is almost 1095, 2630, 3599, and 2045 rounds (time steps) greater than SEED, ABC, ZBR, and CEEC, respectively. The obtained results demonstrate that the MOCHs is better than SEED, ABC, ZBR, and CEEC in terms of energy efficiency and the network throughput. PMID:28241492

Top-up injection schemes for future circular lepton collider

NASA Astrophysics Data System (ADS)

Aiba, M.; Goddard, B.; Oide, K.; Papaphilippou, Y.; Saá Hernández, Á.; Shwartz, D.; White, S.; Zimmermann, F.

2018-02-01

Top-up injection is an essential ingredient for the future circular lepton collider (FCC-ee) to maximize the integrated luminosity and it determines the design performance. In ttbar operation mode, with a beam energy of 175 GeV, the design lifetime of ∼1 h is the shortest of the four anticipated operational modes, and the beam lifetime may be even shorter in actual operation. A highly robust top-up injection scheme is consequently imperative. Various top-up methods are investigated and a number of suitable schemes are considered in developing alternative designs for the injection straight section of the collider ring. For the first time, we consider multipole-kicker off-energy injection, for minimizing detector background in top-up operation, and the use of a thin wire septum in a lepton storage ring, for maximizing the luminosity.

Replacement predictions for drinking water networks through historical data.

PubMed

Malm, Annika; Ljunggren, Olle; Bergstedt, Olof; Pettersson, Thomas J R; Morrison, Gregory M

2012-05-01

Lifetime distribution functions and current network age data can be combined to provide an assessment of the future replacement needs for drinking water distribution networks. Reliable lifetime predictions are limited by a lack of understanding of deterioration processes for different pipe materials under varied conditions. An alternative approach is the use of real historical data for replacement over an extended time series. In this paper, future replacement needs are predicted through historical data representing more than one hundred years of drinking water pipe replacement in Gothenburg, Sweden. The verified data fits well with commonly used lifetime distribution curves. Predictions for the future are discussed in the context of path dependence theory. Copyright © 2012 Elsevier Ltd. All rights reserved.

Distance-Based and Low Energy Adaptive Clustering Protocol for Wireless Sensor Networks

PubMed Central

Gani, Abdullah; Anisi, Mohammad Hossein; Ab Hamid, Siti Hafizah; Akhunzada, Adnan; Khan, Muhammad Khurram

2016-01-01

A wireless sensor network (WSN) comprises small sensor nodes with limited energy capabilities. The power constraints of WSNs necessitate efficient energy utilization to extend the overall network lifetime of these networks. We propose a distance-based and low-energy adaptive clustering (DISCPLN) protocol to streamline the green issue of efficient energy utilization in WSNs. We also enhance our proposed protocol into the multi-hop-DISCPLN protocol to increase the lifetime of the network in terms of high throughput with minimum delay time and packet loss. We also propose the mobile-DISCPLN protocol to maintain the stability of the network. The modelling and comparison of these protocols with their corresponding benchmarks exhibit promising results. PMID:27658194

Pre-Scheduled and Self Organized Sleep-Scheduling Algorithms for Efficient K-Coverage in Wireless Sensor Networks

PubMed Central

Hwang, I-Shyan

2017-01-01

The K-coverage configuration that guarantees coverage of each location by at least K sensors is highly popular and is extensively used to monitor diversified applications in wireless sensor networks. Long network lifetime and high detection quality are the essentials of such K-covered sleep-scheduling algorithms. However, the existing sleep-scheduling algorithms either cause high cost or cannot preserve the detection quality effectively. In this paper, the Pre-Scheduling-based K-coverage Group Scheduling (PSKGS) and Self-Organized K-coverage Scheduling (SKS) algorithms are proposed to settle the problems in the existing sleep-scheduling algorithms. Simulation results show that our pre-scheduled-based KGS approach enhances the detection quality and network lifetime, whereas the self-organized-based SKS algorithm minimizes the computation and communication cost of the nodes and thereby is energy efficient. Besides, SKS outperforms PSKGS in terms of network lifetime and detection quality as it is self-organized. PMID:29257078

A Uniform Energy Consumption Algorithm for Wireless Sensor and Actuator Networks Based on Dynamic Polling Point Selection

PubMed Central

Li, Shuo; Peng, Jun; Liu, Weirong; Zhu, Zhengfa; Lin, Kuo-Chi

2014-01-01

Recent research has indicated that using the mobility of the actuator in wireless sensor and actuator networks (WSANs) to achieve mobile data collection can greatly increase the sensor network lifetime. However, mobile data collection may result in unacceptable collection delays in the network if the path of the actuator is too long. Because real-time network applications require meeting data collection delay constraints, planning the path of the actuator is a very important issue to balance the prolongation of the network lifetime and the reduction of the data collection delay. In this paper, a multi-hop routing mobile data collection algorithm is proposed based on dynamic polling point selection with delay constraints to address this issue. The algorithm can actively update the selection of the actuator's polling points according to the sensor nodes' residual energies and their locations while also considering the collection delay constraint. It also dynamically constructs the multi-hop routing trees rooted by these polling points to balance the sensor node energy consumption and the extension of the network lifetime. The effectiveness of the algorithm is validated by simulation. PMID:24451455

On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model

PubMed Central

Bagula, Antoine; Castelli, Lorenzo; Zennaro, Marco

2015-01-01

Smart parking is a typical IoT application that can benefit from advances in sensor, actuator and RFID technologies to provide many services to its users and parking owners of a smart city. This paper considers a smart parking infrastructure where sensors are laid down on the parking spots to detect car presence and RFID readers are embedded into parking gates to identify cars and help in the billing of the smart parking. Both types of devices are endowed with wired and wireless communication capabilities for reporting to a gateway where the situation recognition is performed. The sensor devices are tasked to play one of the three roles: (1) slave sensor nodes located on the parking spot to detect car presence/absence; (2) master nodes located at one of the edges of a parking lot to detect presence and collect the sensor readings from the slave nodes; and (3) repeater sensor nodes, also called “anchor” nodes, located strategically at specific locations in the parking lot to increase the coverage and connectivity of the wireless sensor network. While slave and master nodes are placed based on geographic constraints, the optimal placement of the relay/anchor sensor nodes in smart parking is an important parameter upon which the cost and efficiency of the parking system depends. We formulate the optimal placement of sensors in smart parking as an integer linear programming multi-objective problem optimizing the sensor network engineering efficiency in terms of coverage and lifetime maximization, as well as its economic gain in terms of the number of sensors deployed for a specific coverage and lifetime. We propose an exact solution to the node placement problem using single-step and two-step solutions implemented in the Mosel language based on the Xpress-MPsuite of libraries. Experimental results reveal the relative efficiency of the single-step compared to the two-step model on different performance parameters. These results are consolidated by simulation results, which reveal that our solution outperforms a random placement in terms of both energy consumption, delay and throughput achieved by a smart parking network. PMID:26134104

On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model.

PubMed

Bagula, Antoine; Castelli, Lorenzo; Zennaro, Marco

2015-06-30

Smart parking is a typical IoT application that can benefit from advances in sensor, actuator and RFID technologies to provide many services to its users and parking owners of a smart city. This paper considers a smart parking infrastructure where sensors are laid down on the parking spots to detect car presence and RFID readers are embedded into parking gates to identify cars and help in the billing of the smart parking. Both types of devices are endowed with wired and wireless communication capabilities for reporting to a gateway where the situation recognition is performed. The sensor devices are tasked to play one of the three roles: (1) slave sensor nodes located on the parking spot to detect car presence/absence; (2) master nodes located at one of the edges of a parking lot to detect presence and collect the sensor readings from the slave nodes; and (3) repeater sensor nodes, also called "anchor" nodes, located strategically at specific locations in the parking lot to increase the coverage and connectivity of the wireless sensor network. While slave and master nodes are placed based on geographic constraints, the optimal placement of the relay/anchor sensor nodes in smart parking is an important parameter upon which the cost and efficiency of the parking system depends. We formulate the optimal placement of sensors in smart parking as an integer linear programming multi-objective problem optimizing the sensor network engineering efficiency in terms of coverage and lifetime maximization, as well as its economic gain in terms of the number of sensors deployed for a specific coverage and lifetime. We propose an exact solution to the node placement problem using single-step and two-step solutions implemented in the Mosel language based on the Xpress-MPsuite of libraries. Experimental results reveal the relative efficiency of the single-step compared to the two-step model on different performance parameters. These results are consolidated by simulation results, which reveal that our solution outperforms a random placement in terms of both energy consumption, delay and throughput achieved by a smart parking network.

Routing to preserve energy in wireless networks

NASA Astrophysics Data System (ADS)

Block, Frederick J., IV

Many applications for wireless radio networks require that some or all radios in the network rely on batteries as energy sources. In many cases, battery replacement is infeasible, expensive, or impossible. Communication protocols for such networks should be designed to preserve limited energy supplies. Because the choice of a route to a traffic sink influences how often radios must transmit and receive, poor route selection can quickly deplete the batteries of certain nodes. Previous work has shown that a network's lifetime can be extended by assigning higher routing costs to nodes with little remaining energy and nodes that must use high transmitter power to reach neighbor radios. Although using remaining energy levels in routing metrics can increase network lifetime, in practice, there may be significant error in a node's estimate of its battery level. The effect of battery level uncertainty on routing is examined. Routing metrics are presented that are designed to explicitly account for uncertainty in remaining energy. Simulation results using several statistical models for this uncertainty show that the proposed metrics perform well. In addition to knowledge of current battery levels, estimates of how quickly radios are consuming energy may be helpful in extending network lifetime. We present a family of routing metrics that incorporate a radio's rate of energy consumption. Simulation results show that the proposed family of metrics performs well under a variety of traffic models and network topologies. Route selection can also be complicated by time-varying link conditions. Radios may be subject to interference from other nearby communication systems, hostile jammers, and other, non-communication sources of noise. A route that first appears to have only a small cost may later require much greater energy expenditure when transmitting packets. Frequent route selection can help radios avoid using links with interference, but additional routing control messages increase energy consumption. We investigate the effects of time-varying interference on the lifetime of ad hoc networks. It is shown that there is a tradeoff between packet delay and node lifetime. We show that it is possible to design the system to perform well under a wide variety of channel conditions.

An Energy Balanced and Lifetime Extended Routing Protocol for Underwater Sensor Networks.

PubMed

Wang, Hao; Wang, Shilian; Zhang, Eryang; Lu, Luxi

2018-05-17

Energy limitation is an adverse problem in designing routing protocols for underwater sensor networks (UWSNs). To prolong the network lifetime with limited battery power, an energy balanced and efficient routing protocol, called energy balanced and lifetime extended routing protocol (EBLE), is proposed in this paper. The proposed EBLE not only balances traffic loads according to the residual energy, but also optimizes data transmissions by selecting low-cost paths. Two phases are operated in the EBLE data transmission process: (1) candidate forwarding set selection phase and (2) data transmission phase. In candidate forwarding set selection phase, nodes update candidate forwarding nodes by broadcasting the position and residual energy level information. The cost value of available nodes is calculated and stored in each sensor node. Then in data transmission phase, high residual energy and relatively low-cost paths are selected based on the cost function and residual energy level information. We also introduce detailed analysis of optimal energy consumption in UWSNs. Numerical simulation results on a variety of node distributions and data load distributions prove that EBLE outperforms other routing protocols (BTM, BEAR and direct transmission) in terms of network lifetime and energy efficiency.

A Novel Energy-Aware Distributed Clustering Algorithm for Heterogeneous Wireless Sensor Networks in the Mobile Environment

PubMed Central

Gao, Ying; Wkram, Chris Hadri; Duan, Jiajie; Chou, Jarong

2015-01-01

In order to prolong the network lifetime, energy-efficient protocols adapted to the features of wireless sensor networks should be used. This paper explores in depth the nature of heterogeneous wireless sensor networks, and finally proposes an algorithm to address the problem of finding an effective pathway for heterogeneous clustering energy. The proposed algorithm implements cluster head selection according to the degree of energy attenuation during the network’s running and the degree of candidate nodes’ effective coverage on the whole network, so as to obtain an even energy consumption over the whole network for the situation with high degree of coverage. Simulation results show that the proposed clustering protocol has better adaptability to heterogeneous environments than existing clustering algorithms in prolonging the network lifetime. PMID:26690440

An Energy-Aware Hybrid ARQ Scheme with Multi-ACKs for Data Sensing Wireless Sensor Networks.

PubMed

Zhang, Jinhuan; Long, Jun

2017-06-12

Wireless sensor networks (WSNs) are one of the important supporting technologies of edge computing. In WSNs, reliable communications are essential for most applications due to the unreliability of wireless links. In addition, network lifetime is also an important performance metric and needs to be considered in many WSN studies. In the paper, an energy-aware hybrid Automatic Repeat-reQuest protocol (ARQ) scheme is proposed to ensure energy efficiency under the guarantee of network transmission reliability. In the scheme, the source node sends data packets continuously with the correct window size and it does not need to wait for the acknowledgement (ACK) confirmation for each data packet. When the destination receives K data packets, it will return multiple copies of one ACK for confirmation to avoid ACK packet loss. The energy consumption of each node in flat circle network applying the proposed scheme is statistical analyzed and the cases under which it is more energy efficiency than the original scheme is discussed. Moreover, how to select parameters of the scheme is addressed to extend the network lifetime under the constraint of the network reliability. In addition, the energy efficiency of the proposed schemes is evaluated. Simulation results are presented to demonstrate that a node energy consumption reduction could be gained and the network lifetime is prolonged.

An energy efficient distance-aware routing algorithm with multiple mobile sinks for wireless sensor networks.

PubMed

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-08-18

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

PubMed Central

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-01-01

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption. PMID:25196015

On Increasing Network Lifetime in Body Area Networks Using Global Routing with Energy Consumption Balancing

PubMed Central

Tsouri, Gill R.; Prieto, Alvaro; Argade, Nikhil

2012-01-01

Global routing protocols in wireless body area networks are considered. Global routing is augmented with a novel link cost function designed to balance energy consumption across the network. The result is a substantial increase in network lifetime at the expense of a marginal increase in energy per bit. Network maintenance requirements are reduced as well, since balancing energy consumption means all batteries need to be serviced at the same time and less frequently. The proposed routing protocol is evaluated using a hardware experimental setup comprising multiple nodes and an access point. The setup is used to assess network architectures, including an on-body access point and an off-body access point with varying number of antennas. Real-time experiments are conducted in indoor environments to assess performance gains. In addition, the setup is used to record channel attenuation data which are then processed in extensive computer simulations providing insight on the effect of protocol parameters on performance. Results demonstrate efficient balancing of energy consumption across all nodes, an average increase of up to 40% in network lifetime corresponding to a modest average increase of 0.4 dB in energy per bit, and a cutoff effect on required transmission power to achieve reliable connectivity. PMID:23201987

On increasing network lifetime in body area networks using global routing with energy consumption balancing.

PubMed

Tsouri, Gill R; Prieto, Alvaro; Argade, Nikhil

2012-09-26

Global routing protocols in wireless body area networks are considered. Global routing is augmented with a novel link cost function designed to balance energy consumption across the network. The result is a substantial increase in network lifetime at the expense of a marginal increase in energy per bit. Network maintenance requirements are reduced as well, since balancing energy consumption means all batteries need to be serviced at the same time and less frequently. The proposed routing protocol is evaluated using a hardware experimental setup comprising multiple nodes and an access point. The setup is used to assess network architectures, including an on-body access point and an off-body access point with varying number of antennas. Real-time experiments are conducted in indoor environments to assess performance gains. In addition, the setup is used to record channel attenuation data which are then processed in extensive computer simulations providing insight on the effect of protocol parameters on performance. Results demonstrate efficient balancing of energy consumption across all nodes, an average increase of up to 40% in network lifetime corresponding to a modest average increase of 0.4 dB in energy per bit, and a cutoff effect on required transmission power to achieve reliable connectivity.

Adaptive Information Dissemination Control to Provide Diffdelay for the Internet of Things.

PubMed

Liu, Xiao; Liu, Anfeng; Huang, Changqin

2017-01-12

Applications running on the Internet of Things, such as the Wireless Sensor and Actuator Networks (WSANs) platform, generally have different quality of service (QoS) requirements. For urgent events, it is crucial that information be reported to the actuator quickly, and the communication cost is the second factor. However, for interesting events, communication costs, network lifetime and time all become important factors. In most situations, these different requirements cannot be satisfied simultaneously. In this paper, an adaptive communication control based on a differentiated delay (ACCDS) scheme is proposed to resolve this conflict. In an ACCDS, source nodes of events adaptively send various searching actuators routings (SARs) based on the degree of sensitivity to delay while maintaining the network lifetime. For a delay-sensitive event, the source node sends a large number of SARs to actuators to identify and inform the actuators in an extremely short time; thus, action can be taken quickly but at higher communication costs. For delay-insensitive events, the source node sends fewer SARs to reduce communication costs and improve network lifetime. Therefore, an ACCDS can meet the QoS requirements of different events using a differentiated delay framework. Theoretical analysis simulation results indicate that an ACCDS provides delay and communication costs and differentiated services; an ACCDS scheme can reduce the network delay by 11.111%-53.684% for a delay-sensitive event and reduce the communication costs by 5%-22.308% for interesting events, and reduce the network lifetime by about 28.713%.

Adaptive Information Dissemination Control to Provide Diffdelay for the Internet of Things

PubMed Central

Liu, Xiao; Liu, Anfeng; Huang, Changqin

2017-01-01

Applications running on the Internet of Things, such as the Wireless Sensor and Actuator Networks (WSANs) platform, generally have different quality of service (QoS) requirements. For urgent events, it is crucial that information be reported to the actuator quickly, and the communication cost is the second factor. However, for interesting events, communication costs, network lifetime and time all become important factors. In most situations, these different requirements cannot be satisfied simultaneously. In this paper, an adaptive communication control based on a differentiated delay (ACCDS) scheme is proposed to resolve this conflict. In an ACCDS, source nodes of events adaptively send various searching actuators routings (SARs) based on the degree of sensitivity to delay while maintaining the network lifetime. For a delay-sensitive event, the source node sends a large number of SARs to actuators to identify and inform the actuators in an extremely short time; thus, action can be taken quickly but at higher communication costs. For delay-insensitive events, the source node sends fewer SARs to reduce communication costs and improve network lifetime. Therefore, an ACCDS can meet the QoS requirements of different events using a differentiated delay framework. Theoretical analysis simulation results indicate that an ACCDS provides delay and communication costs and differentiated services; an ACCDS scheme can reduce the network delay by 11.111%–53.684% for a delay-sensitive event and reduce the communication costs by 5%–22.308% for interesting events, and reduce the network lifetime by about 28.713%. PMID:28085097

Polarity related influence maximization in signed social networks.

PubMed

Li, Dong; Xu, Zhi-Ming; Chakraborty, Nilanjan; Gupta, Anika; Sycara, Katia; Li, Sheng

2014-01-01

Influence maximization in social networks has been widely studied motivated by applications like spread of ideas or innovations in a network and viral marketing of products. Current studies focus almost exclusively on unsigned social networks containing only positive relationships (e.g. friend or trust) between users. Influence maximization in signed social networks containing both positive relationships and negative relationships (e.g. foe or distrust) between users is still a challenging problem that has not been studied. Thus, in this paper, we propose the polarity-related influence maximization (PRIM) problem which aims to find the seed node set with maximum positive influence or maximum negative influence in signed social networks. To address the PRIM problem, we first extend the standard Independent Cascade (IC) model to the signed social networks and propose a Polarity-related Independent Cascade (named IC-P) diffusion model. We prove that the influence function of the PRIM problem under the IC-P model is monotonic and submodular Thus, a greedy algorithm can be used to achieve an approximation ratio of 1-1/e for solving the PRIM problem in signed social networks. Experimental results on two signed social network datasets, Epinions and Slashdot, validate that our approximation algorithm for solving the PRIM problem outperforms state-of-the-art methods.

Polarity Related Influence Maximization in Signed Social Networks

PubMed Central

Li, Dong; Xu, Zhi-Ming; Chakraborty, Nilanjan; Gupta, Anika; Sycara, Katia; Li, Sheng

2014-01-01

Influence maximization in social networks has been widely studied motivated by applications like spread of ideas or innovations in a network and viral marketing of products. Current studies focus almost exclusively on unsigned social networks containing only positive relationships (e.g. friend or trust) between users. Influence maximization in signed social networks containing both positive relationships and negative relationships (e.g. foe or distrust) between users is still a challenging problem that has not been studied. Thus, in this paper, we propose the polarity-related influence maximization (PRIM) problem which aims to find the seed node set with maximum positive influence or maximum negative influence in signed social networks. To address the PRIM problem, we first extend the standard Independent Cascade (IC) model to the signed social networks and propose a Polarity-related Independent Cascade (named IC-P) diffusion model. We prove that the influence function of the PRIM problem under the IC-P model is monotonic and submodular Thus, a greedy algorithm can be used to achieve an approximation ratio of 1-1/e for solving the PRIM problem in signed social networks. Experimental results on two signed social network datasets, Epinions and Slashdot, validate that our approximation algorithm for solving the PRIM problem outperforms state-of-the-art methods. PMID:25061986

Fundamental Lifetime Mechanisms in Routing Protocols for Wireless Sensor Networks: A Survey and Open Issues

PubMed Central

Eslaminejad, Mohammadreza; Razak, Shukor Abd

2012-01-01

Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues. PMID:23202008

Fundamental lifetime mechanisms in routing protocols for wireless sensor networks: a survey and open issues.

PubMed

Eslaminejad, Mohammadreza; Razak, Shukor Abd

2012-10-09

Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues.

Distributed Channel Allocation and Time Slot Optimization for Green Internet of Things.

PubMed

Ding, Kaiqi; Zhao, Haitao; Hu, Xiping; Wei, Jibo

2017-10-28

In sustainable smart cities, power saving is a severe challenge in the energy-constrained Internet of Things (IoT). Efficient utilization of limited multiple non-overlap channels and time resources is a promising solution to reduce the network interference and save energy consumption. In this paper, we propose a joint channel allocation and time slot optimization solution for IoT. First, we propose a channel ranking algorithm which enables each node to rank its available channels based on the channel properties. Then, we propose a distributed channel allocation algorithm so that each node can choose a proper channel based on the channel ranking and its own residual energy. Finally, the sleeping duration and spectrum sensing duration are jointly optimized to maximize the normalized throughput and satisfy energy consumption constraints simultaneously. Different from the former approaches, our proposed solution requires no central coordination or any global information that each node can operate based on its own local information in a total distributed manner. Also, theoretical analysis and extensive simulations have validated that when applying our solution in the network of IoT: (i) each node can be allocated to a proper channel based on the residual energy to balance the lifetime; (ii) the network can rapidly converge to a collision-free transmission through each node's learning ability in the process of the distributed channel allocation; and (iii) the network throughput is further improved via the dynamic time slot optimization.

A decentralized fuzzy C-means-based energy-efficient routing protocol for wireless sensor networks.

PubMed

Alia, Osama Moh'd

2014-01-01

Energy conservation in wireless sensor networks (WSNs) is a vital consideration when designing wireless networking protocols. In this paper, we propose a Decentralized Fuzzy Clustering Protocol, named DCFP, which minimizes total network energy dissipation to promote maximum network lifetime. The process of constructing the infrastructure for a given WSN is performed only once at the beginning of the protocol at a base station, which remains unchanged throughout the network's lifetime. In this initial construction step, a fuzzy C-means algorithm is adopted to allocate sensor nodes into their most appropriate clusters. Subsequently, the protocol runs its rounds where each round is divided into a CH-Election phase and a Data Transmission phase. In the CH-Election phase, the election of new cluster heads is done locally in each cluster where a new multicriteria objective function is proposed to enhance the quality of elected cluster heads. In the Data Transmission phase, the sensing and data transmission from each sensor node to their respective cluster head is performed and cluster heads in turn aggregate and send the sensed data to the base station. Simulation results demonstrate that the proposed protocol improves network lifetime, data delivery, and energy consumption compared to other well-known energy-efficient protocols.

A Decentralized Fuzzy C-Means-Based Energy-Efficient Routing Protocol for Wireless Sensor Networks

PubMed Central

2014-01-01

Energy conservation in wireless sensor networks (WSNs) is a vital consideration when designing wireless networking protocols. In this paper, we propose a Decentralized Fuzzy Clustering Protocol, named DCFP, which minimizes total network energy dissipation to promote maximum network lifetime. The process of constructing the infrastructure for a given WSN is performed only once at the beginning of the protocol at a base station, which remains unchanged throughout the network's lifetime. In this initial construction step, a fuzzy C-means algorithm is adopted to allocate sensor nodes into their most appropriate clusters. Subsequently, the protocol runs its rounds where each round is divided into a CH-Election phase and a Data Transmission phase. In the CH-Election phase, the election of new cluster heads is done locally in each cluster where a new multicriteria objective function is proposed to enhance the quality of elected cluster heads. In the Data Transmission phase, the sensing and data transmission from each sensor node to their respective cluster head is performed and cluster heads in turn aggregate and send the sensed data to the base station. Simulation results demonstrate that the proposed protocol improves network lifetime, data delivery, and energy consumption compared to other well-known energy-efficient protocols. PMID:25162060

An Energy-Efficient Mobile Sink-Based Unequal Clustering Mechanism for WSNs.

PubMed

Gharaei, Niayesh; Abu Bakar, Kamalrulnizam; Mohd Hashim, Siti Zaiton; Hosseingholi Pourasl, Ali; Siraj, Mohammad; Darwish, Tasneem

2017-08-11

Network lifetime and energy efficiency are crucial performance metrics used to evaluate wireless sensor networks (WSNs). Decreasing and balancing the energy consumption of nodes can be employed to increase network lifetime. In cluster-based WSNs, one objective of applying clustering is to decrease the energy consumption of the network. In fact, the clustering technique will be considered effective if the energy consumed by sensor nodes decreases after applying clustering, however, this aim will not be achieved if the cluster size is not properly chosen. Therefore, in this paper, the energy consumption of nodes, before clustering, is considered to determine the optimal cluster size. A two-stage Genetic Algorithm (GA) is employed to determine the optimal interval of cluster size and derive the exact value from the interval. Furthermore, the energy hole is an inherent problem which leads to a remarkable decrease in the network's lifespan. This problem stems from the asynchronous energy depletion of nodes located in different layers of the network. For this reason, we propose Circular Motion of Mobile-Sink with Varied Velocity Algorithm (CM2SV2) to balance the energy consumption ratio of cluster heads (CH). According to the results, these strategies could largely increase the network's lifetime by decreasing the energy consumption of sensors and balancing the energy consumption among CHs.

Spitzer Space Telescope Sequencing Operations Software, Strategies, and Lessons Learned

NASA Technical Reports Server (NTRS)

Bliss, David A.

2006-01-01

The Space Infrared Telescope Facility (SIRTF) was launched in August, 2003, and renamed to the Spitzer Space Telescope in 2004. Two years of observing the universe in the wavelength range from 3 to 180 microns has yielded enormous scientific discoveries. Since this magnificent observatory has a limited lifetime, maximizing science viewing efficiency (ie, maximizing time spent executing activities directly related to science observations) was the key operational objective. The strategy employed for maximizing science viewing efficiency was to optimize spacecraft flexibility, adaptability, and use of observation time. The selected approach involved implementation of a multi-engine sequencing architecture coupled with nondeterministic spacecraft and science execution times. This approach, though effective, added much complexity to uplink operations and sequence development. The Jet Propulsion Laboratory (JPL) manages Spitzer s operations. As part of the uplink process, Spitzer s Mission Sequence Team (MST) was tasked with processing observatory inputs from the Spitzer Science Center (SSC) into efficiently integrated, constraint-checked, and modeled review and command products which accommodated the complexity of non-deterministic spacecraft and science event executions without increasing operations costs. The MST developed processes, scripts, and participated in the adaptation of multi-mission core software to enable rapid processing of complex sequences. The MST was also tasked with developing a Downlink Keyword File (DKF) which could instruct Deep Space Network (DSN) stations on how and when to configure themselves to receive Spitzer science data. As MST and uplink operations developed, important lessons were learned that should be applied to future missions, especially those missions which employ command-intensive operations via a multi-engine sequence architecture.

The roles of carrier concentration and interface, bulk, and grain-boundary recombination for 25% efficient CdTe solar cells

DOE PAGES

Kanevce, A.; Reese, Matthew O.; Barnes, T. M.; ...

2017-06-06

CdTe devices have reached efficiencies of 22% due to continuing improvements in bulk material properties, including minority carrier lifetime. Device modeling has helped to guide these device improvements by quantifying the impacts of material properties and different device designs on device performance. One of the barriers to truly predictive device modeling is the interdependence of these material properties. For example, interfaces become more critical as bulk properties, particularly, hole density and carrier lifetime, increase. We present device-modeling analyses that describe the effects of recombination at the interfaces and grain boundaries as lifetime and doping of the CdTe layer change. Themore » doping and lifetime should be priorities for maximizing open-circuit voltage (V oc) and efficiency improvements. However, interface and grain boundary recombination become bottlenecks for device performance at increased lifetime and doping levels. In conclusion, this work quantifies and discusses these emerging challenges for next-generation CdTe device efficiency.« less

Critical issues in assuring long lifetime and fail-safe operation of optical communications network

NASA Astrophysics Data System (ADS)

Paul, Dilip K.

1993-09-01

Major factors in assuring long lifetime and fail-safe operation in optical communications networks are reviewed in this paper. Reliable functionality to design specifications, complexity of implementation, and cost are the most critical issues. As economics is the driving force to set the goals as well as priorities for the design, development, safe operation, and maintenance schedules of reliable networks, a balance is sought between the degree of reliability enhancement, cost, and acceptable outage of services. Protecting both the link and the network with high reliability components, hardware duplication, and diversity routing can ensure the best network availability. Case examples include both fiber optic and lasercom systems. Also, the state-of-the-art reliability of photonics in space environment is presented.

Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu\\xA0search

NASA Astrophysics Data System (ADS)

Yeh, Cheng-Ta; Lin, Yi-Kuei; Yang, Jo-Yun

2018-07-01

Network reliability is an important performance index for many real-life systems, such as electric power systems, computer systems and transportation systems. These systems can be modelled as stochastic-flow networks (SFNs) composed of arcs and nodes. Most system supervisors respect the network reliability maximization by finding the optimal multi-state resource assignment, which is one resource to each arc. However, a disaster may cause correlated failures for the assigned resources, affecting the network reliability. This article focuses on determining the optimal resource assignment with maximal network reliability for SFNs. To solve the problem, this study proposes a hybrid algorithm integrating the genetic algorithm and tabu search to determine the optimal assignment, called the hybrid GA-TS algorithm (HGTA), and integrates minimal paths, recursive sum of disjoint products and the correlated binomial distribution to calculate network reliability. Several practical numerical experiments are adopted to demonstrate that HGTA has better computational quality than several popular soft computing algorithms.

Numerical simulation of coherent resonance in a model network of Rulkov neurons

NASA Astrophysics Data System (ADS)

Andreev, Andrey V.; Runnova, Anastasia E.; Pisarchik, Alexander N.

2018-04-01

In this paper we study the spiking behaviour of a neuronal network consisting of Rulkov elements. We find that the regularity of this behaviour maximizes at a certain level of environment noise. This effect referred to as coherence resonance is demonstrated in a random complex network of Rulkov neurons. An external stimulus added to some of neurons excites them, and then activates other neurons in the network. The network coherence is also maximized at the certain stimulus amplitude.

Stanol esters as a component of maximal dietary therapy in the National Cholesterol Education Program Adult Treatment Panel III report.

PubMed

Grundy, Scott M

2005-07-04

Use of plant stanols/sterols in forms that are sufficiently bioavailable for therapeutic effect should be a key element of maximal dietary therapy. This principle was recognized by National Cholesterol Education Program (NCEP) Adult Treatment Panel III (ATP III) and has been amply confirmed by experimental studies in humans. Since the introduction of statins, dietary therapy for control of elevated low-density lipoprotein (LDL) cholesterol levels has received less attention. The time has come, however, to reassert the importance of maximal dietary therapy as a cost-effective means for treatment of elevated LDL concentrations and for lifetime prevention of coronary heart disease.

EDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks

PubMed Central

Eun, Yongsoon

2017-01-01

Underwater Acoustic Sensor Network (UASN) comes with intrinsic constraints because it is deployed in the aquatic environment and uses the acoustic signals to communicate. The examples of those constraints are long propagation delay, very limited bandwidth, high energy cost for transmission, very high signal attenuation, costly deployment and battery replacement, and so forth. Therefore, the routing schemes for UASN must take into account those characteristics to achieve energy fairness, avoid energy holes, and improve the network lifetime. The depth based forwarding schemes in literature use node’s depth information to forward data towards the sink. They minimize the data packet duplication by employing the holding time strategy. However, to avoid void holes in the network, they use two hop node proximity information. In this paper, we propose the Energy and Depth variance-based Opportunistic Void avoidance (EDOVE) scheme to gain energy balancing and void avoidance in the network. EDOVE considers not only the depth parameter, but also the normalized residual energy of the one-hop nodes and the normalized depth variance of the second hop neighbors. Hence, it avoids the void regions as well as balances the network energy and increases the network lifetime. The simulation results show that the EDOVE gains more than 15% packet delivery ratio, propagates 50% less copies of data packet, consumes less energy, and has more lifetime than the state of the art forwarding schemes. PMID:28954395

EDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks.

PubMed

Bouk, Safdar Hussain; Ahmed, Syed Hassan; Park, Kyung-Joon; Eun, Yongsoon

2017-09-26

Underwater Acoustic Sensor Network (UASN) comes with intrinsic constraints because it is deployed in the aquatic environment and uses the acoustic signals to communicate. The examples of those constraints are long propagation delay, very limited bandwidth, high energy cost for transmission, very high signal attenuation, costly deployment and battery replacement, and so forth. Therefore, the routing schemes for UASN must take into account those characteristics to achieve energy fairness, avoid energy holes, and improve the network lifetime. The depth based forwarding schemes in literature use node's depth information to forward data towards the sink. They minimize the data packet duplication by employing the holding time strategy. However, to avoid void holes in the network, they use two hop node proximity information. In this paper, we propose the Energy and Depth variance-based Opportunistic Void avoidance (EDOVE) scheme to gain energy balancing and void avoidance in the network. EDOVE considers not only the depth parameter, but also the normalized residual energy of the one-hop nodes and the normalized depth variance of the second hop neighbors. Hence, it avoids the void regions as well as balances the network energy and increases the network lifetime. The simulation results show that the EDOVE gains more than 15 % packet delivery ratio, propagates 50 % less copies of data packet, consumes less energy, and has more lifetime than the state of the art forwarding schemes.

An Energy Centric Cluster-Based Routing Protocol for Wireless Sensor Networks.

PubMed

Hosen, A S M Sanwar; Cho, Gi Hwan

2018-05-11

Clustering is an effective way to prolong the lifetime of a wireless sensor network (WSN). The common approach is to elect cluster heads to take routing and controlling duty, and to periodically rotate each cluster head's role to distribute energy consumption among nodes. However, a significant amount of energy dissipates due to control messages overhead, which results in a shorter network lifetime. This paper proposes an energy-centric cluster-based routing mechanism in WSNs. To begin with, cluster heads are elected based on the higher ranks of the nodes. The rank is defined by residual energy and average distance from the member nodes. With the role of data aggregation and data forwarding, a cluster head acts as a caretaker for cluster-head election in the next round, where the ranks' information are piggybacked along with the local data sending during intra-cluster communication. This reduces the number of control messages for the cluster-head election as well as the cluster formation in detail. Simulation results show that our proposed protocol saves the energy consumption among nodes and achieves a significant improvement in the network lifetime.

An Energy Centric Cluster-Based Routing Protocol for Wireless Sensor Networks

PubMed Central

Hosen, A. S. M. Sanwar; Cho, Gi Hwan

2018-01-01

Clustering is an effective way to prolong the lifetime of a wireless sensor network (WSN). The common approach is to elect cluster heads to take routing and controlling duty, and to periodically rotate each cluster head’s role to distribute energy consumption among nodes. However, a significant amount of energy dissipates due to control messages overhead, which results in a shorter network lifetime. This paper proposes an energy-centric cluster-based routing mechanism in WSNs. To begin with, cluster heads are elected based on the higher ranks of the nodes. The rank is defined by residual energy and average distance from the member nodes. With the role of data aggregation and data forwarding, a cluster head acts as a caretaker for cluster-head election in the next round, where the ranks’ information are piggybacked along with the local data sending during intra-cluster communication. This reduces the number of control messages for the cluster-head election as well as the cluster formation in detail. Simulation results show that our proposed protocol saves the energy consumption among nodes and achieves a significant improvement in the network lifetime. PMID:29751663

Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks

NASA Astrophysics Data System (ADS)

Cui, Yaozu; Wang, Xingyuan; Eustace, Justine

2014-12-01

Community structure is a common phenomenon in complex networks, and it has been shown that some communities in complex networks often overlap each other. So in this paper we propose a new algorithm to detect overlapping community structure in complex networks. To identify the overlapping community structure, our algorithm firstly extracts fully connected sub-graphs which are maximal sub-graphs from original networks. Then two maximal sub-graphs having the key pair-vertices can be merged into a new larger sub-graph using some belonging degree functions. Furthermore we extend the modularity function to evaluate the proposed algorithm. In addition, overlapping nodes between communities are founded successfully. Finally we report the comparison between the modularity and the computational complexity of the proposed algorithm with some other existing algorithms. The experimental results show that the proposed algorithm gives satisfactory results.

On the relevance of using open wireless sensor networks in environment monitoring.

PubMed

Bagula, Antoine B; Inggs, Gordon; Scott, Simon; Zennaro, Marco

2009-01-01

This paper revisits the problem of the readiness for field deployments of wireless sensor networks by assessing the relevance of using Open Hardware and Software motes for environment monitoring. We propose a new prototype wireless sensor network that fine-tunes SquidBee motes to improve the life-time and sensing performance of an environment monitoring system that measures temperature, humidity and luminosity. Building upon two outdoor sensing scenarios, we evaluate the performance of the newly proposed energy-aware prototype solution in terms of link quality when expressed by the Received Signal Strength, Packet Loss and the battery lifetime. The experimental results reveal the relevance of using the Open Hardware and Software motes when setting up outdoor wireless sensor networks.

Maximizing algebraic connectivity in air transportation networks

NASA Astrophysics Data System (ADS)

Wei, Peng

In air transportation networks the robustness of a network regarding node and link failures is a key factor for its design. An experiment based on the real air transportation network is performed to show that the algebraic connectivity is a good measure for network robustness. Three optimization problems of algebraic connectivity maximization are then formulated in order to find the most robust network design under different constraints. The algebraic connectivity maximization problem with flight routes addition or deletion is first formulated. Three methods to optimize and analyze the network algebraic connectivity are proposed. The Modified Greedy Perturbation Algorithm (MGP) provides a sub-optimal solution in a fast iterative manner. The Weighted Tabu Search (WTS) is designed to offer a near optimal solution with longer running time. The relaxed semi-definite programming (SDP) is used to set a performance upper bound and three rounding techniques are discussed to find the feasible solution. The simulation results present the trade-off among the three methods. The case study on two air transportation networks of Virgin America and Southwest Airlines show that the developed methods can be applied in real world large scale networks. The algebraic connectivity maximization problem is extended by adding the leg number constraint, which considers the traveler's tolerance for the total connecting stops. The Binary Semi-Definite Programming (BSDP) with cutting plane method provides the optimal solution. The tabu search and 2-opt search heuristics can find the optimal solution in small scale networks and the near optimal solution in large scale networks. The third algebraic connectivity maximization problem with operating cost constraint is formulated. When the total operating cost budget is given, the number of the edges to be added is not fixed. Each edge weight needs to be calculated instead of being pre-determined. It is illustrated that the edge addition and the weight assignment can not be studied separately for the problem with operating cost constraint. Therefore a relaxed SDP method with golden section search is developed to solve both at the same time. The cluster decomposition is utilized to solve large scale networks.

Filament turnover tunes both force generation and dissipation to control long-range flows in a model actomyosin cortex

PubMed Central

McCall, Patrick M.; Gardel, Margaret L.; Munro, Edwin M.

2017-01-01

Actomyosin-based cortical flow is a fundamental engine for cellular morphogenesis. Cortical flows are generated by cross-linked networks of actin filaments and myosin motors, in which active stress produced by motor activity is opposed by passive resistance to network deformation. Continuous flow requires local remodeling through crosslink unbinding and and/or filament disassembly. But how local remodeling tunes stress production and dissipation, and how this in turn shapes long range flow, remains poorly understood. Here, we study a computational model for a cross-linked network with active motors based on minimal requirements for production and dissipation of contractile stress: Asymmetric filament compliance, spatial heterogeneity of motor activity, reversible cross-links and filament turnover. We characterize how the production and dissipation of network stress depend, individually, on cross-link dynamics and filament turnover, and how these dependencies combine to determine overall rates of cortical flow. Our analysis predicts that filament turnover is required to maintain active stress against external resistance and steady state flow in response to external stress. Steady state stress increases with filament lifetime up to a characteristic time τm, then decreases with lifetime above τm. Effective viscosity increases with filament lifetime up to a characteristic time τc, and then becomes independent of filament lifetime and sharply dependent on crosslink dynamics. These individual dependencies of active stress and effective viscosity define multiple regimes of steady state flow. In particular our model predicts that when filament lifetimes are shorter than both τc and τm, the dependencies of effective viscosity and steady state stress on filament turnover cancel one another, such that flow speed is insensitive to filament turnover, and shows a simple dependence on motor activity and crosslink dynamics. These results provide a framework for understanding how animal cells tune cortical flow through local control of network remodeling. PMID:29253848

Noise-induced modulation of the relaxation kinetics around a non-equilibrium steady state of non-linear chemical reaction networks.

PubMed

Ramaswamy, Rajesh; Sbalzarini, Ivo F; González-Segredo, Nélido

2011-01-28

Stochastic effects from correlated noise non-trivially modulate the kinetics of non-linear chemical reaction networks. This is especially important in systems where reactions are confined to small volumes and reactants are delivered in bursts. We characterise how the two noise sources confinement and burst modulate the relaxation kinetics of a non-linear reaction network around a non-equilibrium steady state. We find that the lifetimes of species change with burst input and confinement. Confinement increases the lifetimes of all species that are involved in any non-linear reaction as a reactant. Burst monotonically increases or decreases lifetimes. Competition between burst-induced and confinement-induced modulation may hence lead to a non-monotonic modulation. We quantify lifetime as the integral of the time autocorrelation function (ACF) of concentration fluctuations around a non-equilibrium steady state of the reaction network. Furthermore, we look at the first and second derivatives of the ACF, each of which is affected in opposite ways by burst and confinement. This allows discriminating between these two noise sources. We analytically derive the ACF from the linear Fokker-Planck approximation of the chemical master equation in order to establish a baseline for the burst-induced modulation at low confinement. Effects of higher confinement are then studied using a partial-propensity stochastic simulation algorithm. The results presented here may help understand the mechanisms that deviate stochastic kinetics from its deterministic counterpart. In addition, they may be instrumental when using fluorescence-lifetime imaging microscopy (FLIM) or fluorescence-correlation spectroscopy (FCS) to measure confinement and burst in systems with known reaction rates, or, alternatively, to correct for the effects of confinement and burst when experimentally measuring reaction rates.

Optimal Location through Distributed Algorithm to Avoid Energy Hole in Mobile Sink WSNs

PubMed Central

Qing-hua, Li; Wei-hua, Gui; Zhi-gang, Chen

2014-01-01

In multihop data collection sensor network, nodes near the sink need to relay on remote data and, thus, have much faster energy dissipation rate and suffer from premature death. This phenomenon causes energy hole near the sink, seriously damaging the network performance. In this paper, we first compute energy consumption of each node when sink is set at any point in the network through theoretical analysis; then we propose an online distributed algorithm, which can adjust sink position based on the actual energy consumption of each node adaptively to get the actual maximum lifetime. Theoretical analysis and experimental results show that the proposed algorithms significantly improve the lifetime of wireless sensor network. It lowers the network residual energy by more than 30% when it is dead. Moreover, the cost for moving the sink is relatively smaller. PMID:24895668

Intelligent Cooperative MAC Protocol for Balancing Energy Consumption

NASA Astrophysics Data System (ADS)

Wu, S.; Liu, K.; Huang, B.; Liu, F.

To extend the lifetime of wireless sensor networks, we proposed an intelligent balanced energy consumption cooperative MAC protocol (IBEC-CMAC) based on the multi-node cooperative transmission model. The protocol has priority to access high-quality channels for reducing energy consumption of each transmission. It can also balance the energy consumption among cooperative nodes by using high residual energy nodes instead of excessively consuming some node's energy. Simulation results show that IBEC-CMAC can obtain longer network lifetime and higher energy utilization than direct transmission.

On Applicability of Network Coding Technique for 6LoWPAN-based Sensor Networks.

PubMed

Amanowicz, Marek; Krygier, Jaroslaw

2018-05-26

In this paper, the applicability of the network coding technique in 6LoWPAN-based sensor multihop networks is examined. The 6LoWPAN is one of the standards proposed for the Internet of Things architecture. Thus, we can expect the significant growth of traffic in such networks, which can lead to overload and decrease in the sensor network lifetime. The authors propose the inter-session network coding mechanism that can be implemented in resource-limited sensor motes. The solution reduces the overall traffic in the network, and in consequence, the energy consumption is decreased. Used procedures take into account deep header compressions of the native 6LoWPAN packets and the hop-by-hop changes of the header structure. Applied simplifications reduce signaling traffic that is typically occurring in network coding deployments, keeping the solution usefulness for the wireless sensor networks with limited resources. The authors validate the proposed procedures in terms of end-to-end packet delay, packet loss ratio, traffic in the air, total energy consumption, and network lifetime. The solution has been tested in a real wireless sensor network. The results confirm the efficiency of the proposed technique, mostly in delay-tolerant sensor networks.

Efficient data communication protocols for wireless networks

NASA Astrophysics Data System (ADS)

Zeydan, Engin

In this dissertation, efficient decentralized algorithms are investigated for cost minimization problems in wireless networks. For wireless sensor networks, we investigate both the reduction in the energy consumption and throughput maximization problems separately using multi-hop data aggregation for correlated data in wireless sensor networks. The proposed algorithms exploit data redundancy using a game theoretic framework. For energy minimization, routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function used in routing takes into account distance, interference and in-network data aggregation. The proposed energy-efficient correlation-aware routing algorithm significantly reduces the energy consumption in the network and converges in a finite number of steps iteratively. For throughput maximization, we consider both the interference distribution across the network and correlation between forwarded data when establishing routes. Nodes along each route are chosen to minimize the interference impact in their neighborhood and to maximize the in-network data aggregation. The resulting network topology maximizes the global network throughput and the algorithm is guaranteed to converge with a finite number of steps using best response dynamics. For multiple antenna wireless ad-hoc networks, we present distributed cooperative and regret-matching based learning schemes for joint transmit beanformer and power level selection problem for nodes operating in multi-user interference environment. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise ratio at each receiver. In cooperative and regret-matching based power minimization algorithms, transmit beanformers are selected from a predefined codebook to minimize the total power. By selecting transmit beamformers judiciously and performing power adaptation, the cooperative algorithm is shown to converge to pure strategy Nash equilibrium with high probability throughout the iterations in the interference impaired network. On the other hand, the regret-matching learning algorithm is noncooperative and requires minimum amount of overhead. The proposed cooperative and regret-matching based distributed algorithms are also compared with centralized solutions through simulation results.

Lifetime prediction for organic coating under alternating hydrostatic pressure by artificial neural network

PubMed Central

Tian, Wenliang; Meng, Fandi; Liu, Li; Li, Ying; Wang, Fuhui

2017-01-01

A concept for prediction of organic coatings, based on the alternating hydrostatic pressure (AHP) accelerated tests, has been presented. An AHP accelerated test with different pressure values has been employed to evaluate coating degradation. And a back-propagation artificial neural network (BP-ANN) has been established to predict the service property and the service lifetime of coatings. The pressure value (P), immersion time (t) and service property (impedance modulus |Z|) are utilized as the parameters of the network. The average accuracies of the predicted service property and immersion time by the established network are 98.6% and 84.8%, respectively. The combination of accelerated test and prediction method by BP-ANN is promising to evaluate and predict coating property used in deep sea. PMID:28094340

Robust Networking Architecture and Secure Communication Scheme for Heterogeneous Wireless Sensor Networks

ERIC Educational Resources Information Center

McNeal, McKenzie, III.

2012-01-01

Current networking architectures and communication protocols used for Wireless Sensor Networks (WSNs) have been designed to be energy efficient, low latency, and long network lifetime. One major issue that must be addressed is the security in data communication. Due to the limited capabilities of low cost and small sized sensor nodes, designing…

An optimally evolved connective ratio of neural networks that maximizes the occurrence of synchronized bursting behavior

PubMed Central

2012-01-01

Background Synchronized bursting activity (SBA) is a remarkable dynamical behavior in both ex vivo and in vivo neural networks. Investigations of the underlying structural characteristics associated with SBA are crucial to understanding the system-level regulatory mechanism of neural network behaviors. Results In this study, artificial pulsed neural networks were established using spike response models to capture fundamental dynamics of large scale ex vivo cortical networks. Network simulations with synaptic parameter perturbations showed the following two findings. (i) In a network with an excitatory ratio (ER) of 80-90%, its connective ratio (CR) was within a range of 10-30% when the occurrence of SBA reached the highest expectation. This result was consistent with the experimental observation in ex vivo neuronal networks, which were reported to possess a matured inhibitory synaptic ratio of 10-20% and a CR of 10-30%. (ii) No SBA occurred when a network does not contain any all-positive-interaction feedback loop (APFL) motif. In a neural network containing APFLs, the number of APFLs presented an optimal range corresponding to the maximal occurrence of SBA, which was very similar to the optimal CR. Conclusions In a neural network, the evolutionarily selected CR (10-30%) optimizes the occurrence of SBA, and APFL serves a pivotal network motif required to maximize the occurrence of SBA. PMID:22462685

Energy-Efficient Next-Generation Passive Optical Networks Based on Sleep Mode and Heuristic Optimization

NASA Astrophysics Data System (ADS)

Zulai, Luis G. T.; Durand, Fábio R.; Abrão, Taufik

2015-05-01

In this article, an energy-efficiency mechanism for next-generation passive optical networks is investigated through heuristic particle swarm optimization. Ten-gigabit Ethernet-wavelength division multiplexing optical code division multiplexing-passive optical network next-generation passive optical networks are based on the use of a legacy 10-gigabit Ethernet-passive optical network with the advantage of using only an en/decoder pair of optical code division multiplexing technology, thus eliminating the en/decoder at each optical network unit. The proposed joint mechanism is based on the sleep-mode power-saving scheme for a 10-gigabit Ethernet-passive optical network, combined with a power control procedure aiming to adjust the transmitted power of the active optical network units while maximizing the overall energy-efficiency network. The particle swarm optimization based power control algorithm establishes the optimal transmitted power in each optical network unit according to the network pre-defined quality of service requirements. The objective is controlling the power consumption of the optical network unit according to the traffic demand by adjusting its transmitter power in an attempt to maximize the number of transmitted bits with minimum energy consumption, achieving maximal system energy efficiency. Numerical results have revealed that it is possible to save 75% of energy consumption with the proposed particle swarm optimization based sleep-mode energy-efficiency mechanism compared to 55% energy savings when just a sleeping-mode-based mechanism is deployed.

Differences in Patterns of Reproductive Allocation between the Sexes in Nicrophorus orbicollis.

PubMed

Smith, Ashlee N; Creighton, J Curtis; Belk, Mark C

2015-01-01

Organisms are selected to maximize lifetime reproductive success by balancing the costs of current reproduction with costs to future survival and fecundity. Males and females typically face different reproductive costs, which makes comparisons of their reproductive strategies difficult. Burying beetles provide a unique system that allows us to compare the costs of reproduction between the sexes because males and females are capable of raising offspring together or alone and carcass preparation and offspring care represent the majority of reproductive costs for both sexes. Because both sexes perform the same functions of carcass preparation and offspring care, we predict that they would experience similar costs and have similar life history patterns. In this study we assess the cost of reproduction in male Nicrophorus orbicollis and compare to patterns observed in females. We compare the reproductive strategies of single males and females that provided pre- and post-hatching parental care. There is a cost to reproduction for both males and females, but the sexes respond to these costs differently. Females match brood size with carcass size, and thus maximize the lifetime number of offspring on a given size carcass. Males cull proportionately more offspring on all carcass sizes, and thus have a lower lifetime number of offspring compared to females. Females exhibit an adaptive reproductive strategy based on resource availability, but male reproductive strategies are not adaptive in relation to resource availability.

Long-Term Memory Stabilized by Noise-Induced Rehearsal

PubMed Central

Wei, Yi

2014-01-01

Cortical networks can maintain memories for decades despite the short lifetime of synaptic strengths. Can a neural network store long-lasting memories in unstable synapses? Here, we study the effects of ongoing spike-timing-dependent plasticity (STDP) on the stability of memory patterns stored in synapses of an attractor neural network. We show that certain classes of STDP rules can stabilize all stored memory patterns despite a short lifetime of synapses. In our model, unstructured neural noise, after passing through the recurrent network connections, carries the imprint of all memory patterns in temporal correlations. STDP, combined with these correlations, leads to reinforcement of all stored patterns, even those that are never explicitly visited. Our findings may provide the functional reason for irregular spiking displayed by cortical neurons and justify models of system memory consolidation. Therefore, we propose that irregular neural activity is the feature that helps cortical networks maintain stable connections. PMID:25411507

Network structures sustained by internal links and distributed lifetime of old nodes in stationary state of number of nodes

NASA Astrophysics Data System (ADS)

Ikeda, Nobutoshi

2017-12-01

In network models that take into account growth properties, deletion of old nodes has a serious impact on degree distributions, because old nodes tend to become hub nodes. In this study, we aim to provide a simple explanation for why hubs can exist even in conditions where the number of nodes is stationary due to the deletion of old nodes. We show that an exponential increase in the degree of nodes is a natural consequence of the balance between the deletion and addition of nodes as long as a preferential attachment mechanism holds. As a result, the largest degree is determined by the magnitude relationship between the time scale of the exponential growth of degrees and lifetime of old nodes. The degree distribution exhibits a power-law form ˜ k -γ with exponent γ = 1 when the lifetime of nodes is constant. However, various values of γ can be realized by introducing distributed lifetime of nodes.

Increasing the Lifetime of Mobile WSNs via Dynamic Optimization of Sensor Node Communication Activity

PubMed Central

Guimarães, Dayan Adionel; Sakai, Lucas Jun; Alberti, Antonio Marcos; de Souza, Rausley Adriano Amaral

2016-01-01

In this paper, a simple and flexible method for increasing the lifetime of fixed or mobile wireless sensor networks is proposed. Based on past residual energy information reported by the sensor nodes, the sink node or another central node dynamically optimizes the communication activity levels of the sensor nodes to save energy without sacrificing the data throughput. The activity levels are defined to represent portions of time or time-frequency slots in a frame, during which the sensor nodes are scheduled to communicate with the sink node to report sensory measurements. Besides node mobility, it is considered that sensors’ batteries may be recharged via a wireless power transmission or equivalent energy harvesting scheme, bringing to the optimization problem an even more dynamic character. We report large increased lifetimes over the non-optimized network and comparable or even larger lifetime improvements with respect to an idealized greedy algorithm that uses both the real-time channel state and the residual energy information. PMID:27657075

Increasing the Lifetime of Mobile WSNs via Dynamic Optimization of Sensor Node Communication Activity.

PubMed

Guimarães, Dayan Adionel; Sakai, Lucas Jun; Alberti, Antonio Marcos; de Souza, Rausley Adriano Amaral

2016-09-20

In this paper, a simple and flexible method for increasing the lifetime of fixed or mobile wireless sensor networks is proposed. Based on past residual energy information reported by the sensor nodes, the sink node or another central node dynamically optimizes the communication activity levels of the sensor nodes to save energy without sacrificing the data throughput. The activity levels are defined to represent portions of time or time-frequency slots in a frame, during which the sensor nodes are scheduled to communicate with the sink node to report sensory measurements. Besides node mobility, it is considered that sensors' batteries may be recharged via a wireless power transmission or equivalent energy harvesting scheme, bringing to the optimization problem an even more dynamic character. We report large increased lifetimes over the non-optimized network and comparable or even larger lifetime improvements with respect to an idealized greedy algorithm that uses both the real-time channel state and the residual energy information.

Adaption of the temporal correlation coefficient calculation for temporal networks (applied to a real-world pig trade network).

PubMed

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-01-01

The average topological overlap of two graphs of two consecutive time steps measures the amount of changes in the edge configuration between the two snapshots. This value has to be zero if the edge configuration changes completely and one if the two consecutive graphs are identical. Current methods depend on the number of nodes in the network or on the maximal number of connected nodes in the consecutive time steps. In the first case, this methodology breaks down if there are nodes with no edges. In the second case, it fails if the maximal number of active nodes is larger than the maximal number of connected nodes. In the following, an adaption of the calculation of the temporal correlation coefficient and of the topological overlap of the graph between two consecutive time steps is presented, which shows the expected behaviour mentioned above. The newly proposed adaption uses the maximal number of active nodes, i.e. the number of nodes with at least one edge, for the calculation of the topological overlap. The three methods were compared with the help of vivid example networks to reveal the differences between the proposed notations. Furthermore, these three calculation methods were applied to a real-world network of animal movements in order to detect influences of the network structure on the outcome of the different methods.

Modeling of BN Lifetime Prediction of a System Based on Integrated Multi-Level Information

PubMed Central

Wang, Xiaohong; Wang, Lizhi

2017-01-01

Predicting system lifetime is important to ensure safe and reliable operation of products, which requires integrated modeling based on multi-level, multi-sensor information. However, lifetime characteristics of equipment in a system are different and failure mechanisms are inter-coupled, which leads to complex logical correlations and the lack of a uniform lifetime measure. Based on a Bayesian network (BN), a lifetime prediction method for systems that combine multi-level sensor information is proposed. The method considers the correlation between accidental failures and degradation failure mechanisms, and achieves system modeling and lifetime prediction under complex logic correlations. This method is applied in the lifetime prediction of a multi-level solar-powered unmanned system, and the predicted results can provide guidance for the improvement of system reliability and for the maintenance and protection of the system. PMID:28926930

Modeling of BN Lifetime Prediction of a System Based on Integrated Multi-Level Information.

PubMed

Wang, Jingbin; Wang, Xiaohong; Wang, Lizhi

2017-09-15

Predicting system lifetime is important to ensure safe and reliable operation of products, which requires integrated modeling based on multi-level, multi-sensor information. However, lifetime characteristics of equipment in a system are different and failure mechanisms are inter-coupled, which leads to complex logical correlations and the lack of a uniform lifetime measure. Based on a Bayesian network (BN), a lifetime prediction method for systems that combine multi-level sensor information is proposed. The method considers the correlation between accidental failures and degradation failure mechanisms, and achieves system modeling and lifetime prediction under complex logic correlations. This method is applied in the lifetime prediction of a multi-level solar-powered unmanned system, and the predicted results can provide guidance for the improvement of system reliability and for the maintenance and protection of the system.

Multiway spectral community detection in networks

NASA Astrophysics Data System (ADS)

Zhang, Xiao; Newman, M. E. J.

2015-11-01

One of the most widely used methods for community detection in networks is the maximization of the quality function known as modularity. Of the many maximization techniques that have been used in this context, some of the most conceptually attractive are the spectral methods, which are based on the eigenvectors of the modularity matrix. Spectral algorithms have, however, been limited, by and large, to the division of networks into only two or three communities, with divisions into more than three being achieved by repeated two-way division. Here we present a spectral algorithm that can directly divide a network into any number of communities. The algorithm makes use of a mapping from modularity maximization to a vector partitioning problem, combined with a fast heuristic for vector partitioning. We compare the performance of this spectral algorithm with previous approaches and find it to give superior results, particularly in cases where community sizes are unbalanced. We also give demonstrative applications of the algorithm to two real-world networks and find that it produces results in good agreement with expectations for the networks studied.

A Temperature-Dependent Battery Model for Wireless Sensor Networks.

PubMed

Rodrigues, Leonardo M; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

2017-02-22

Energy consumption is a major issue in Wireless Sensor Networks (WSNs), as nodes are powered by chemical batteries with an upper bounded lifetime. Estimating the lifetime of batteries is a difficult task, as it depends on several factors, such as operating temperatures and discharge rates. Analytical battery models can be used for estimating both the battery lifetime and the voltage behavior over time. Still, available models usually do not consider the impact of operating temperatures on the battery behavior. The target of this work is to extend the widely-used Kinetic Battery Model (KiBaM) to include the effect of temperature on the battery behavior. The proposed Temperature-Dependent KiBaM (T-KiBaM) is able to handle operating temperatures, providing better estimates for the battery lifetime and voltage behavior. The performed experimental validation shows that T-KiBaM achieves an average accuracy error smaller than 0.33%, when estimating the lifetime of Ni-MH batteries for different temperature conditions. In addition, T-KiBaM significantly improves the original KiBaM voltage model. The proposed model can be easily adapted to handle other battery technologies, enabling the consideration of different WSN deployments.

A Temperature-Dependent Battery Model for Wireless Sensor Networks

PubMed Central

Rodrigues, Leonardo M.; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

2017-01-01

Energy consumption is a major issue in Wireless Sensor Networks (WSNs), as nodes are powered by chemical batteries with an upper bounded lifetime. Estimating the lifetime of batteries is a difficult task, as it depends on several factors, such as operating temperatures and discharge rates. Analytical battery models can be used for estimating both the battery lifetime and the voltage behavior over time. Still, available models usually do not consider the impact of operating temperatures on the battery behavior. The target of this work is to extend the widely-used Kinetic Battery Model (KiBaM) to include the effect of temperature on the battery behavior. The proposed Temperature-Dependent KiBaM (T-KiBaM) is able to handle operating temperatures, providing better estimates for the battery lifetime and voltage behavior. The performed experimental validation shows that T-KiBaM achieves an average accuracy error smaller than 0.33%, when estimating the lifetime of Ni-MH batteries for different temperature conditions. In addition, T-KiBaM significantly improves the original KiBaM voltage model. The proposed model can be easily adapted to handle other battery technologies, enabling the consideration of different WSN deployments. PMID:28241444

Triangular Alignment (TAME). A Tensor-based Approach for Higher-order Network Alignment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mohammadi, Shahin; Gleich, David F.; Kolda, Tamara G.

2015-11-01

Network alignment is an important tool with extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures. This objective function corresponds to an integer programming problem, which is NP-hard. Consequently, we approximate this objective function as a surrogate function whose maximization results in a tensor eigenvalue problem. Based on this formulation, we present an algorithm called Triangularmore » AlignMEnt (TAME), which attempts to maximize the number of aligned triangles across networks. We focus on alignment of triangles because of their enrichment in complex networks; however, our formulation and resulting algorithms can be applied to general motifs. Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99% accuracy in terms of aligned nodes. We further evaluate our method by aligning yeast and human interactomes. Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments.« less

Stimulus Sensitivity of a Spiking Neural Network Model

NASA Astrophysics Data System (ADS)

Chevallier, Julien

2018-02-01

Some recent papers relate the criticality of complex systems to their maximal capacity of information processing. In the present paper, we consider high dimensional point processes, known as age-dependent Hawkes processes, which have been used to model spiking neural networks. Using mean-field approximation, the response of the network to a stimulus is computed and we provide a notion of stimulus sensitivity. It appears that the maximal sensitivity is achieved in the sub-critical regime, yet almost critical for a range of biologically relevant parameters.

QoS and energy aware cooperative routing protocol for wildfire monitoring wireless sensor networks.

PubMed

Maalej, Mohamed; Cherif, Sofiane; Besbes, Hichem

2013-01-01

Wireless sensor networks (WSN) are presented as proper solution for wildfire monitoring. However, this application requires a design of WSN taking into account the network lifetime and the shadowing effect generated by the trees in the forest environment. Cooperative communication is a promising solution for WSN which uses, at each hop, the resources of multiple nodes to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modeling, optimizing a cooperative communication protocol based on RSSI and node energy consumption in a competitive context (RSSI/energy-CC), that is, an energy and quality-of-service aware-based cooperative communication routing protocol. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.

Energy efficient strategy for throughput improvement in wireless sensor networks.

PubMed

Jabbar, Sohail; Minhas, Abid Ali; Imran, Muhammad; Khalid, Shehzad; Saleem, Kashif

2015-01-23

Network lifetime and throughput are one of the prime concerns while designing routing protocols for wireless sensor networks (WSNs). However, most of the existing schemes are either geared towards prolonging network lifetime or improving throughput. This paper presents an energy efficient routing scheme for throughput improvement in WSN. The proposed scheme exploits multilayer cluster design for energy efficient forwarding node selection, cluster heads rotation and both inter- and intra-cluster routing. To improve throughput, we rotate the role of cluster head among various nodes based on two threshold levels which reduces the number of dropped packets. We conducted simulations in the NS2 simulator to validate the performance of the proposed scheme. Simulation results demonstrate the performance efficiency of the proposed scheme in terms of various metrics compared to similar approaches published in the literature.

Energy Efficient Strategy for Throughput Improvement in Wireless Sensor Networks

PubMed Central

Jabbar, Sohail; Minhas, Abid Ali; Imran, Muhammad; Khalid, Shehzad; Saleem, Kashif

2015-01-01

Network lifetime and throughput are one of the prime concerns while designing routing protocols for wireless sensor networks (WSNs). However, most of the existing schemes are either geared towards prolonging network lifetime or improving throughput. This paper presents an energy efficient routing scheme for throughput improvement in WSN. The proposed scheme exploits multilayer cluster design for energy efficient forwarding node selection, cluster heads rotation and both inter- and intra-cluster routing. To improve throughput, we rotate the role of cluster head among various nodes based on two threshold levels which reduces the number of dropped packets. We conducted simulations in the NS2 simulator to validate the performance of the proposed scheme. Simulation results demonstrate the performance efficiency of the proposed scheme in terms of various metrics compared to similar approaches published in the literature. PMID:25625902

Strengthening a Country by Building a Strong Public School Teaching Profession

ERIC Educational Resources Information Center

West, Kazuko Ito

2013-01-01

What would be one of the most sensible ways for a country to invest to achieve maximal economic growth? A recent study (Chetty, Friedman, & Rockoff, 2011) by economists at Harvard and Columbia Universities shows that better teacher quality results in significantly higher students' lifetime earnings. And investing in public school teachers…

Cross-layer cluster-based energy-efficient protocol for wireless sensor networks.

PubMed

Mammu, Aboobeker Sidhik Koyamparambil; Hernandez-Jayo, Unai; Sainz, Nekane; de la Iglesia, Idoia

2015-04-09

Recent developments in electronics and wireless communications have enabled the improvement of low-power and low-cost wireless sensors networks (WSNs). One of the most important challenges in WSNs is to increase the network lifetime due to the limited energy capacity of the network nodes. Another major challenge in WSNs is the hot spots that emerge as locations under heavy traffic load. Nodes in such areas quickly drain energy resources, leading to disconnection in network services. In such an environment, cross-layer cluster-based energy-efficient algorithms (CCBE) can prolong the network lifetime and energy efficiency. CCBE is based on clustering the nodes to different hexagonal structures. A hexagonal cluster consists of cluster members (CMs) and a cluster head (CH). The CHs are selected from the CMs based on nodes near the optimal CH distance and the residual energy of the nodes. Additionally, the optimal CH distance that links to optimal energy consumption is derived. To balance the energy consumption and the traffic load in the network, the CHs are rotated among all CMs. In WSNs, energy is mostly consumed during transmission and reception. Transmission collisions can further decrease the energy efficiency. These collisions can be avoided by using a contention-free protocol during the transmission period. Additionally, the CH allocates slots to the CMs based on their residual energy to increase sleep time. Furthermore, the energy consumption of CH can be further reduced by data aggregation. In this paper, we propose a data aggregation level based on the residual energy of CH and a cost-aware decision scheme for the fusion of data. Performance results show that the CCBE scheme performs better in terms of network lifetime, energy consumption and throughput compared to low-energy adaptive clustering hierarchy (LEACH) and hybrid energy-efficient distributed clustering (HEED).

Photon counting, censor corrections, and lifetime imaging for improved detection in two-photon microscopy

PubMed Central

Driscoll, Jonathan D.; Shih, Andy Y.; Iyengar, Satish; Field, Jeffrey J.; White, G. Allen; Squier, Jeffrey A.; Cauwenberghs, Gert

2011-01-01

We present a high-speed photon counter for use with two-photon microscopy. Counting pulses of photocurrent, as opposed to analog integration, maximizes the signal-to-noise ratio so long as the uncertainty in the count does not exceed the gain-noise of the photodetector. Our system extends this improvement through an estimate of the count that corrects for the censored period after detection of an emission event. The same system can be rapidly reconfigured in software for fluorescence lifetime imaging, which we illustrate by distinguishing between two spectrally similar fluorophores in an in vivo model of microstroke. PMID:21471395

Optimal topologies for maximizing network transmission capacity

NASA Astrophysics Data System (ADS)

Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

2018-04-01

It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.

Initiation of vaporizing cannabis: Individual and social network predictors in a longitudinal study of young adults.

PubMed

Cassidy, Rachel N; Meisel, Matthew K; DiGuiseppi, Graham; Balestrieri, Sara; Barnett, Nancy P

2018-05-19

A trend has recently emerged of individuals using electronic nicotine delivery systems (ENDS) or similar devices to vaporize cannabis, either in the form of high-potency THC concentrates or cannabis plant material. Peer use is central to the adoption of substance use behaviors in young adulthood, but little is known about peer influence for initiating cannabis vaping. A longitudinal investigation of first-year college students (N = 1313) using social network methods was conducted to determine the prevalence of vaping cannabis, differences in networks between individuals who initiate vaping cannabis, and predictors of initiation of vaping cannabis across two time points. The surveys were available for two weeks beginning in the sixth week of each semester. We found that 9.4% vaped in their lifetime but not since the first survey, 7.5% vaped in their lifetime and since the first survey, and 5.9% reported vaping cannabis at the second survey. Lifetime cannabis use, lifetime ENDS use, and number of peers who initiated vaping cannabis from Time 1 to Time 2 were significantly associated with increased odds of the initiation of vaping cannabis; the number of any-cannabis-using or any-ENDS-using peers was not associated with increased odds of initiating vaping cannabis. Individuals with the greatest risk of initiation of vaping cannabis during the first year of college are those with a prior history of other cannabis use and ENDS use and who have peers in their network who initiate cannabis vaping. Copyright © 2018 Elsevier B.V. All rights reserved.

An Efficient Wireless Recharging Mechanism for Achieving Perpetual Lifetime of Wireless Sensor Networks

PubMed Central

Yu, Hongli; Chen, Guilin; Zhao, Shenghui; Chang, Chih-Yung; Chin, Yu-Ting

2016-01-01

Energy recharging has received much attention in recent years. Several recharging mechanisms were proposed for achieving perpetual lifetime of a given Wireless Sensor Network (WSN). However, most of them require a mobile recharger to visit each sensor and then perform the recharging task, which increases the length of the recharging path. Another common weakness of these works is the requirement for the mobile recharger to stop at the location of each sensor. As a result, it is impossible for recharger to move with a constant speed, leading to inefficient movement. To improve the recharging efficiency, this paper takes “recharging while moving” into consideration when constructing the recharging path. We propose a Recharging Path Construction (RPC) mechanism, which enables the mobile recharger to recharge all sensors using a constant speed, aiming to minimize the length of recharging path and improve the recharging efficiency while achieving the requirement of perpetual network lifetime of a given WSN. Performance studies reveal that the proposed RPC outperforms existing proposals in terms of path length and energy utilization index, as well as visiting cycle. PMID:28025567

Two-loop controller for maximizing performance of a grid-connected photovoltaic - fuel cell hybrid power plant

NASA Astrophysics Data System (ADS)

Ro, Kyoungsoo

The study started with the requirement that a photovoltaic (PV) power source should be integrated with other supplementary power sources whether it operates in a stand-alone or grid-connected mode. First, fuel cells for a backup of varying PV power were compared in detail with batteries and were found to have more operational benefits. Next, maximizing performance of a grid-connected PV-fuel cell hybrid system by use of a two-loop controller was discussed. One loop is a neural network controller for maximum power point tracking, which extracts maximum available solar power from PV arrays under varying conditions of insolation, temperature, and system load. A real/reactive power controller (RRPC) is the other loop. The RRPC meets the system's requirement for real and reactive powers by controlling incoming fuel to fuel cell stacks as well as switching control signals to a power conditioning subsystem. The RRPC is able to achieve more versatile control of real/reactive powers than the conventional power sources since the hybrid power plant does not contain any rotating mass. Results of time-domain simulations prove not only effectiveness of the proposed computer models of the two-loop controller, but also their applicability for use in transient stability analysis of the hybrid power plant. Finally, environmental evaluation of the proposed hybrid plant was made in terms of plant's land requirement and lifetime COsb2 emissions, and then compared with that of the conventional fossil-fuel power generating forms.

IMNN: Information Maximizing Neural Networks

NASA Astrophysics Data System (ADS)

Charnock, Tom; Lavaux, Guilhem; Wandelt, Benjamin D.

2018-04-01

This software trains artificial neural networks to find non-linear functionals of data that maximize Fisher information: information maximizing neural networks (IMNNs). As compressing large data sets vastly simplifies both frequentist and Bayesian inference, important information may be inadvertently missed. Likelihood-free inference based on automatically derived IMNN summaries produces summaries that are good approximations to sufficient statistics. IMNNs are robustly capable of automatically finding optimal, non-linear summaries of the data even in cases where linear compression fails: inferring the variance of Gaussian signal in the presence of noise, inferring cosmological parameters from mock simulations of the Lyman-α forest in quasar spectra, and inferring frequency-domain parameters from LISA-like detections of gravitational waveforms. In this final case, the IMNN summary outperforms linear data compression by avoiding the introduction of spurious likelihood maxima.

Real-time topic-aware influence maximization using preprocessing.

PubMed

Chen, Wei; Lin, Tian; Yang, Cheng

2016-01-01

Influence maximization is the task of finding a set of seed nodes in a social network such that the influence spread of these seed nodes based on certain influence diffusion model is maximized. Topic-aware influence diffusion models have been recently proposed to address the issue that influence between a pair of users are often topic-dependent and information, ideas, innovations etc. being propagated in networks are typically mixtures of topics. In this paper, we focus on the topic-aware influence maximization task. In particular, we study preprocessing methods to avoid redoing influence maximization for each mixture from scratch. We explore two preprocessing algorithms with theoretical justifications. Our empirical results on data obtained in a couple of existing studies demonstrate that one of our algorithms stands out as a strong candidate providing microsecond online response time and competitive influence spread, with reasonable preprocessing effort.

Voids in mixed-cation silicate glasses: Studies by positron annihilation lifetime and Fourier transform infrared spectroscopies

NASA Astrophysics Data System (ADS)

Reben, M.; Golis, E.; Filipecki, J.; Sitarz, M.; Kotynia, K.; Jeleń, P.; Grelowska, I.

2014-08-01

PALS in comparison with FTIR studies have been applied to investigate the structure of different oxide glasses. Three components of the positron lifetime τ (τ1 para- and τ3 ortho-positronium and τ2 intermediate lifetime component) and their intensities were obtained. The results of the calculation of mean values of positron lifetimes for the investigated glasses showed the existence of a long-living component on the positron annihilation lifetime spectra. From the Tao-Eldrup formula we can estimate the size of free volume. On the basis of the measurements we can conclude that the size and fraction of free volume reaches the biggest value for the fused silica glass. The degree of network polymerisation increases void size.

Microstructural Characterization of Polymers by Positron Lifetime Spectroscopy

NASA Technical Reports Server (NTRS)

Singh, Jag J.

1996-01-01

Positrons provide a versatile probe for monitoring microstructural features of molecular solids. In this paper, we report on positron lifetime measurements in two different types of polymers. The first group comprises polyacrylates processed on earth and in space. The second group includes fully-compatible and totally-incompatible Semi-Interpenetrating polymer networks of thermosetting and thermoplastic polyimides. On the basis of lifetime measurements, it is concluded that free volumes are a direct reflection of physical/electromagnetic properties of the host polymers.

Temporal intermittency and the lifetime of chimera states in ensembles of nonlocally coupled chaotic oscillators

NASA Astrophysics Data System (ADS)

Semenova, N. I.; Strelkova, G. I.; Anishchenko, V. S.; Zakharova, A.

2017-06-01

We describe numerical results for the dynamics of networks of nonlocally coupled chaotic maps. Switchings in time between amplitude and phase chimera states have been first established and studied. It has been shown that in autonomous ensembles, a nonstationary regime of switchings has a finite lifetime and represents a transient process towards a stationary regime of phase chimera. The lifetime of the nonstationary switching regime can be increased to infinity by applying short-term noise perturbations.

Influencing Busy People in a Social Network

PubMed Central

Sarkar, Kaushik; Sundaram, Hari

2016-01-01

We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this problem is especially important for viral marketing. The problem of maximizing influence in a social network is challenging since it is computationally intractable. We make three contributions. First, we propose a new model of collective behavior that incorporates individual intent, knowledge of neighbors actions and resource constraints. Second, we show that the multiple behavior influence maximization is NP-hard. Furthermore, we show that the problem is submodular, implying the existence of a greedy solution that approximates the optimal solution to within a constant. However, since the greedy algorithm is expensive for large networks, we propose efficient heuristics to identify the influential individuals, including heuristics to assign behaviors to the different early adopters. We test our approach on synthetic and real-world topologies with excellent results. We evaluate the effectiveness under three metrics: unique number of participants, total number of active behaviors and network resource utilization. Our heuristics produce 15-51% increase in expected resource utilization over the naïve approach. PMID:27711127

Influencing Busy People in a Social Network.

PubMed

Sarkar, Kaushik; Sundaram, Hari

2016-01-01

We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this problem is especially important for viral marketing. The problem of maximizing influence in a social network is challenging since it is computationally intractable. We make three contributions. First, we propose a new model of collective behavior that incorporates individual intent, knowledge of neighbors actions and resource constraints. Second, we show that the multiple behavior influence maximization is NP-hard. Furthermore, we show that the problem is submodular, implying the existence of a greedy solution that approximates the optimal solution to within a constant. However, since the greedy algorithm is expensive for large networks, we propose efficient heuristics to identify the influential individuals, including heuristics to assign behaviors to the different early adopters. We test our approach on synthetic and real-world topologies with excellent results. We evaluate the effectiveness under three metrics: unique number of participants, total number of active behaviors and network resource utilization. Our heuristics produce 15-51% increase in expected resource utilization over the naïve approach.

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility

PubMed Central

Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios

2016-01-01

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. PMID:27007373

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility.

PubMed

Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios

2016-03-19

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability.

Recruitment dynamics in adaptive social networks

NASA Astrophysics Data System (ADS)

Shkarayev, Maxim S.; Schwartz, Ira B.; Shaw, Leah B.

2013-06-01

We model recruitment in adaptive social networks in the presence of birth and death processes. Recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. Only a susceptible subset of nodes can be recruited. The recruiting individuals may adapt their connections in order to improve recruitment capabilities, thus changing the network structure adaptively. We derive a mean-field theory to predict the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment level, as well as on network topology. The theoretical predictions are compared with direct simulations of the full system. We identify two parameter regimes with qualitatively different bifurcation diagrams depending on whether nodes become susceptible frequently (multiple times in their lifetime) or rarely (much less than once per lifetime).

Recruitment dynamics in adaptive social networks.

PubMed

Shkarayev, Maxim S; Schwartz, Ira B; Shaw, Leah B

2013-01-01

We model recruitment in adaptive social networks in the presence of birth and death processes. Recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. Only a susceptible subset of nodes can be recruited. The recruiting individuals may adapt their connections in order to improve recruitment capabilities, thus changing the network structure adaptively. We derive a mean field theory to predict the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment level, as well as on network topology. The theoretical predictions are compared with direct simulations of the full system. We identify two parameter regimes with qualitatively different bifurcation diagrams depending on whether nodes become susceptible frequently (multiple times in their lifetime) or rarely (much less than once per lifetime).

Long-term memory stabilized by noise-induced rehearsal.

PubMed

Wei, Yi; Koulakov, Alexei A

2014-11-19

Cortical networks can maintain memories for decades despite the short lifetime of synaptic strengths. Can a neural network store long-lasting memories in unstable synapses? Here, we study the effects of ongoing spike-timing-dependent plasticity (STDP) on the stability of memory patterns stored in synapses of an attractor neural network. We show that certain classes of STDP rules can stabilize all stored memory patterns despite a short lifetime of synapses. In our model, unstructured neural noise, after passing through the recurrent network connections, carries the imprint of all memory patterns in temporal correlations. STDP, combined with these correlations, leads to reinforcement of all stored patterns, even those that are never explicitly visited. Our findings may provide the functional reason for irregular spiking displayed by cortical neurons and justify models of system memory consolidation. Therefore, we propose that irregular neural activity is the feature that helps cortical networks maintain stable connections. Copyright © 2014 the authors 0270-6474/14/3415804-12$15.00/0.

Memetic Algorithm-Based Multi-Objective Coverage Optimization for Wireless Sensor Networks

PubMed Central

Chen, Zhi; Li, Shuai; Yue, Wenjing

2014-01-01

Maintaining effective coverage and extending the network lifetime as much as possible has become one of the most critical issues in the coverage of WSNs. In this paper, we propose a multi-objective coverage optimization algorithm for WSNs, namely MOCADMA, which models the coverage control of WSNs as the multi-objective optimization problem. MOCADMA uses a memetic algorithm with a dynamic local search strategy to optimize the coverage of WSNs and achieve the objectives such as high network coverage, effective node utilization and more residual energy. In MOCADMA, the alternative solutions are represented as the chromosomes in matrix form, and the optimal solutions are selected through numerous iterations of the evolution process, including selection, crossover, mutation, local enhancement, and fitness evaluation. The experiment and evaluation results show MOCADMA can have good capabilities in maintaining the sensing coverage, achieve higher network coverage while improving the energy efficiency and effectively prolonging the network lifetime, and have a significant improvement over some existing algorithms. PMID:25360579

Memetic algorithm-based multi-objective coverage optimization for wireless sensor networks.

PubMed

Chen, Zhi; Li, Shuai; Yue, Wenjing

2014-10-30

Maintaining effective coverage and extending the network lifetime as much as possible has become one of the most critical issues in the coverage of WSNs. In this paper, we propose a multi-objective coverage optimization algorithm for WSNs, namely MOCADMA, which models the coverage control of WSNs as the multi-objective optimization problem. MOCADMA uses a memetic algorithm with a dynamic local search strategy to optimize the coverage of WSNs and achieve the objectives such as high network coverage, effective node utilization and more residual energy. In MOCADMA, the alternative solutions are represented as the chromosomes in matrix form, and the optimal solutions are selected through numerous iterations of the evolution process, including selection, crossover, mutation, local enhancement, and fitness evaluation. The experiment and evaluation results show MOCADMA can have good capabilities in maintaining the sensing coverage, achieve higher network coverage while improving the energy efficiency and effectively prolonging the network lifetime, and have a significant improvement over some existing algorithms.

Designing Secure Library Networks.

ERIC Educational Resources Information Center

Breeding, Michael

1997-01-01

Focuses on designing a library network to maximize security. Discusses UNIX and file servers; connectivity to campus, corporate networks and the Internet; separation of staff from public servers; controlling traffic; the threat of network sniffers; hubs that eliminate eavesdropping; dividing the network into subnets; Switched Ethernet;…

Energy Efficient Cluster Based Scheduling Scheme for Wireless Sensor Networks

PubMed Central

Srie Vidhya Janani, E.; Ganesh Kumar, P.

2015-01-01

The energy utilization of sensor nodes in large scale wireless sensor network points out the crucial need for scalable and energy efficient clustering protocols. Since sensor nodes usually operate on batteries, the maximum utility of network is greatly dependent on ideal usage of energy leftover in these sensor nodes. In this paper, we propose an Energy Efficient Cluster Based Scheduling Scheme for wireless sensor networks that balances the sensor network lifetime and energy efficiency. In the first phase of our proposed scheme, cluster topology is discovered and cluster head is chosen based on remaining energy level. The cluster head monitors the network energy threshold value to identify the energy drain rate of all its cluster members. In the second phase, scheduling algorithm is presented to allocate time slots to cluster member data packets. Here congestion occurrence is totally avoided. In the third phase, energy consumption model is proposed to maintain maximum residual energy level across the network. Moreover, we also propose a new packet format which is given to all cluster member nodes. The simulation results prove that the proposed scheme greatly contributes to maximum network lifetime, high energy, reduced overhead, and maximum delivery ratio. PMID:26495417

Maximize Your Teaching

ERIC Educational Resources Information Center

Cleaver, Samantha

2011-01-01

Here's an awesome thought! Teaching means a teacher's impact on students will last a lifetime. And despite the negatives one hears in the news, a 2010 ING Foundation poll found that 98 percent of adults believe a good teacher can "change the course of a child's life." This year, a teacher will affect every child in his/her class. Over the course…

On Prolonging Network Lifetime through Load-Similar Node Deployment in Wireless Sensor Networks

PubMed Central

Li, Qiao-Qin; Gong, Haigang; Liu, Ming; Yang, Mei; Zheng, Jun

2011-01-01

This paper is focused on the study of the energy hole problem in the Progressive Multi-hop Rotational Clustered (PMRC)-structure, a highly scalable wireless sensor network (WSN) architecture. Based on an analysis on the traffic load distribution in PMRC-based WSNs, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to address the energy hole problem in PMRC-based WSNs. In this strategy, sensor nodes are deployed in the network area according to the load distribution. That is, more nodes shall be deployed in the range where the average load is higher, and then the loads among different areas in the sensor network tend to be balanced. Simulation results demonstrate that the load-similar node distribution strategy prolongs network lifetime and reduces the average packet latency in comparison with existing nonuniform node distribution and uniform node distribution strategies. Note that, besides the PMRC structure, the analysis model and the proposed load-similar node distribution strategy are also applicable to other multi-hop WSN structures. PMID:22163809

Path scheduling for multiple mobile actors in wireless sensor network

NASA Astrophysics Data System (ADS)

Trapasiya, Samir D.; Soni, Himanshu B.

2017-05-01

In wireless sensor network (WSN), energy is the main constraint. In this work we have addressed this issue for single as well as multiple mobile sensor actor network. In this work, we have proposed Rendezvous Point Selection Scheme (RPSS) in which Rendezvous Nodes are selected by set covering problem approach and from that, Rendezvous Points are selected in a way to reduce the tour length. The mobile actors tour is scheduled to pass through those Rendezvous Points as per Travelling Salesman Problem (TSP). We have also proposed novel rendezvous node rotation scheme for fair utilisation of all the nodes. We have compared RPSS with Stationery Actor scheme as well as RD-VT, RD-VT-SMT and WRP-SMT for performance metrics like energy consumption, network lifetime, route length and found the better outcome in all the cases for single actor. We have also applied RPSS for multiple mobile actor case like Multi-Actor Single Depot (MASD) termination and Multi-Actor Multiple Depot (MAMD) termination and observed by extensive simulation that MAMD saves the network energy in optimised way and enhance network lifetime compared to all other schemes.

An auxiliary graph based dynamic traffic grooming algorithm in spatial division multiplexing enabled elastic optical networks with multi-core fibers

NASA Astrophysics Data System (ADS)

Zhao, Yongli; Tian, Rui; Yu, Xiaosong; Zhang, Jiawei; Zhang, Jie

2017-03-01

A proper traffic grooming strategy in dynamic optical networks can improve the utilization of bandwidth resources. An auxiliary graph (AG) is designed to solve the traffic grooming problem under a dynamic traffic scenario in spatial division multiplexing enabled elastic optical networks (SDM-EON) with multi-core fibers. Five traffic grooming policies achieved by adjusting the edge weights of an AG are proposed and evaluated through simulation: maximal electrical grooming (MEG), maximal optical grooming (MOG), maximal SDM grooming (MSG), minimize virtual hops (MVH), and minimize physical hops (MPH). Numeric results show that each traffic grooming policy has its own features. Among different traffic grooming policies, an MPH policy can achieve the lowest bandwidth blocking ratio, MEG can save the most transponders, and MSG can obtain the fewest cores for each request.

Maximizing synchronizability of duplex networks

NASA Astrophysics Data System (ADS)

Wei, Xiang; Emenheiser, Jeffrey; Wu, Xiaoqun; Lu, Jun-an; D'Souza, Raissa M.

2018-01-01

We study the synchronizability of duplex networks formed by two randomly generated network layers with different patterns of interlayer node connections. According to the master stability function, we use the smallest nonzero eigenvalue and the eigenratio between the largest and the second smallest eigenvalues of supra-Laplacian matrices to characterize synchronizability on various duplexes. We find that the interlayer linking weight and linking fraction have a profound impact on synchronizability of duplex networks. The increasingly large inter-layer coupling weight is found to cause either decreasing or constant synchronizability for different classes of network dynamics. In addition, negative node degree correlation across interlayer links outperforms positive degree correlation when most interlayer links are present. The reverse is true when a few interlayer links are present. The numerical results and understanding based on these representative duplex networks are illustrative and instructive for building insights into maximizing synchronizability of more realistic multiplex networks.

Cooperative Resource Pricing in Service Overlay Networks for Mobile Agents

NASA Astrophysics Data System (ADS)

Nakano, Tadashi; Okaie, Yutaka

The success of peer-to-peer overlay networks depends on cooperation among participating peers. In this paper, we investigate the degree of cooperation among individual peers required to induce globally favorable properties in an overlay network. Specifically, we consider a resource pricing problem in a market-oriented overlay network where participating peers sell own resources (e.g., CPU cycles) to earn energy which represents some money or rewards in the network. In the resource pricing model presented in this paper, each peer sets the price for own resource based on the degree of cooperation; non-cooperative peers attempt to maximize their own energy gains, while cooperative peers maximize the sum of own and neighbors' energy gains. Simulation results are presented to demonstrate that the network topology is an important factor influencing the minimum degree of cooperation required to increase the network-wide global energy gain.

Race/Ethnicity and Health-Related Quality of Life Among LGBT Older Adults

PubMed Central

Kim, Hyun-Jun; Jen, Sarah; Fredriksen-Goldsen, Karen I.

2017-01-01

Purpose of the Study: Few existing studies have addressed racial/ethnic differences in the health and quality of life of lesbian, gay, bisexual, and transgender (LGBT) older adults. Guided by the Health Equity Promotion Model, this study examines health-promoting and health risk factors that contribute to racial/ethnic health disparities among LGBT adults aged 50 and older. Design and Methods: We utilized weighted survey data from Aging with Pride: National Health, Aging, and Sexuality/Gender Study. By applying multiple mediator models, we analyzed the indirect effects of race/ethnicity on health-related quality of life (HRQOL) via demographics, lifetime LGBT-related discrimination, and victimization, and socioeconomic, identity-related, spiritual, and social resources. Results: Although African Americans and Hispanics, compared with non-Hispanic Whites, reported lower physical HRQOL and comparable psychological HRQOL, indirect pathways between race/ethnicity and HRQOL were observed. African Americans and Hispanics had lower income, educational attainment, identity affirmation, and social support, which were associated with a decrease in physical and psychological HRQOL. African Americans had higher lifetime LGBT-related discrimination, which was linked to a decrease in their physical and psychological HRQOL. African Americans and Hispanics had higher spirituality, which was associated with an increase in psychological HRQOL. Implications: Findings illustrate the importance of identifying both health-promoting and health risk factors to understand ways to maximize the health potential of racially and ethnically diverse LGBT older adults. Interventions aimed at health equity should be tailored to bolster identity affirmation and social networks of LGBT older adults of color and to support strengths, including spiritual resources. PMID:28087793

On the Impact of Localization and Density Control Algorithms in Target Tracking Applications for Wireless Sensor Networks

PubMed Central

Campos, Andre N.; Souza, Efren L.; Nakamura, Fabiola G.; Nakamura, Eduardo F.; Rodrigues, Joel J. P. C.

2012-01-01

Target tracking is an important application of wireless sensor networks. The networks' ability to locate and track an object is directed linked to the nodes' ability to locate themselves. Consequently, localization systems are essential for target tracking applications. In addition, sensor networks are often deployed in remote or hostile environments. Therefore, density control algorithms are used to increase network lifetime while maintaining its sensing capabilities. In this work, we analyze the impact of localization algorithms (RPE and DPE) and density control algorithms (GAF, A3 and OGDC) on target tracking applications. We adapt the density control algorithms to address the k-coverage problem. In addition, we analyze the impact of network density, residual integration with density control, and k-coverage on both target tracking accuracy and network lifetime. Our results show that DPE is a better choice for target tracking applications than RPE. Moreover, among the evaluated density control algorithms, OGDC is the best option among the three. Although the choice of the density control algorithm has little impact on the tracking precision, OGDC outperforms GAF and A3 in terms of tracking time. PMID:22969329

Development of Energy Efficient Clustering Protocol in Wireless Sensor Network Using Neuro-Fuzzy Approach.

PubMed

Julie, E Golden; Selvi, S Tamil

2016-01-01

Wireless sensor networks (WSNs) consist of sensor nodes with limited processing capability and limited nonrechargeable battery power. Energy consumption in WSN is a significant issue in networks for improving network lifetime. It is essential to develop an energy aware clustering protocol in WSN to reduce energy consumption for increasing network lifetime. In this paper, a neuro-fuzzy energy aware clustering scheme (NFEACS) is proposed to form optimum and energy aware clusters. NFEACS consists of two parts: fuzzy subsystem and neural network system that achieved energy efficiency in forming clusters and cluster heads in WSN. NFEACS used neural network that provides effective training set related to energy and received signal strength of all nodes to estimate the expected energy for tentative cluster heads. Sensor nodes with higher energy are trained with center location of base station to select energy aware cluster heads. Fuzzy rule is used in fuzzy logic part that inputs to form clusters. NFEACS is designed for WSN handling mobility of node. The proposed scheme NFEACS is compared with related clustering schemes, cluster-head election mechanism using fuzzy logic, and energy aware fuzzy unequal clustering. The experiment results show that NFEACS performs better than the other related schemes.

Development of Energy Efficient Clustering Protocol in Wireless Sensor Network Using Neuro-Fuzzy Approach

PubMed Central

Julie, E. Golden; Selvi, S. Tamil

2016-01-01

Wireless sensor networks (WSNs) consist of sensor nodes with limited processing capability and limited nonrechargeable battery power. Energy consumption in WSN is a significant issue in networks for improving network lifetime. It is essential to develop an energy aware clustering protocol in WSN to reduce energy consumption for increasing network lifetime. In this paper, a neuro-fuzzy energy aware clustering scheme (NFEACS) is proposed to form optimum and energy aware clusters. NFEACS consists of two parts: fuzzy subsystem and neural network system that achieved energy efficiency in forming clusters and cluster heads in WSN. NFEACS used neural network that provides effective training set related to energy and received signal strength of all nodes to estimate the expected energy for tentative cluster heads. Sensor nodes with higher energy are trained with center location of base station to select energy aware cluster heads. Fuzzy rule is used in fuzzy logic part that inputs to form clusters. NFEACS is designed for WSN handling mobility of node. The proposed scheme NFEACS is compared with related clustering schemes, cluster-head election mechanism using fuzzy logic, and energy aware fuzzy unequal clustering. The experiment results show that NFEACS performs better than the other related schemes. PMID:26881269

Mechanisms for Prolonging Network Lifetime in Wireless Sensor Networks

ERIC Educational Resources Information Center

Yang, Yinying

2010-01-01

Sensors are used to monitor and control the physical environment. A Wireless Sensor Network (WSN) is composed of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it [18][5]. Sensor nodes measure various parameters of the environment and transmit data collected to one or more sinks, using…

Dynamic Pricing in Electronic Commerce Using Neural Network

NASA Astrophysics Data System (ADS)

Ghose, Tapu Kumar; Tran, Thomas T.

In this paper, we propose an approach where feed-forward neural network is used for dynamically calculating a competitive price of a product in order to maximize sellers’ revenue. In the approach we considered that along with product price other attributes such as product quality, delivery time, after sales service and seller’s reputation contribute in consumers purchase decision. We showed that once the sellers, by using their limited prior knowledge, set an initial price of a product our model adjusts the price automatically with the help of neural network so that sellers’ revenue is maximized.

Coevolution of strategy-selection time scale and cooperation in spatial prisoner's dilemma game

NASA Astrophysics Data System (ADS)

Rong, Zhihai; Wu, Zhi-Xi; Chen, Guanrong

2013-06-01

In this paper, we investigate a networked prisoner's dilemma game where individuals' strategy-selection time scale evolves based on their historical learning information. We show that the more times the current strategy of an individual is learnt by his neighbors, the longer time he will stick on the successful behavior by adaptively adjusting the lifetime of the adopted strategy. Through characterizing the extent of success of the individuals with normalized payoffs, we show that properly using the learned information can form a positive feedback mechanism between cooperative behavior and its lifetime, which can boost cooperation on square lattices and scale-free networks.

Generation Dependent Ultrafast Charge Separation and Recombination in a Pyrene-Viologen Family of Dendrons.

PubMed

Gong, Zheng; Bao, Jianhua; Nagai, Keiji; Iyoda, Tomokazu; Kawauchi, Takehiro; Piotrowiak, Piotr

2016-05-12

The ability of a dendritic network to intercept electrons and extend the lifetime of a short-lived photoinduced charge separated (CS) state was investigated in a homologous family of methyl viologen (MV(2+)) dendrons spanning four generations, G0 through G3. The CS state in the parent pyrene-methylene-viologen G0 system with a single acceptor exhibits an extremely short lifetime of τ = 0.72 ps. The expansion of the viologen network introduces slower components to the recombination kinetics by allowing the injected electron to migrate further away from the donor. The long-lived fraction of the population increases monotonically in the order G3 > G2 > G1 > G0, while the respective recombination rates decrease. In the highest generation of the dendron ∼14% of the CS state population experiences a 10-fold or greater lifetime extension. Long range tunneling across multiple viologen units and sequential site-to-site hopping both contribute to the overall effect. The large excess energy deposited in the apical viologen upon charge separation and the presence of an extended network of low lying π-orbitals likely facilitate shuttling the electron further down the dendron.

Information processing in echo state networks at the edge of chaos.

PubMed

Boedecker, Joschka; Obst, Oliver; Lizier, Joseph T; Mayer, N Michael; Asada, Minoru

2012-09-01

We investigate information processing in randomly connected recurrent neural networks. It has been shown previously that the computational capabilities of these networks are maximized when the recurrent layer is close to the border between a stable and an unstable dynamics regime, the so called edge of chaos. The reasons, however, for this maximized performance are not completely understood. We adopt an information-theoretical framework and are for the first time able to quantify the computational capabilities between elements of these networks directly as they undergo the phase transition to chaos. Specifically, we present evidence that both information transfer and storage in the recurrent layer are maximized close to this phase transition, providing an explanation for why guiding the recurrent layer toward the edge of chaos is computationally useful. As a consequence, our study suggests self-organized ways of improving performance in recurrent neural networks, driven by input data. Moreover, the networks we study share important features with biological systems such as feedback connections and online computation on input streams. A key example is the cerebral cortex, which was shown to also operate close to the edge of chaos. Consequently, the behavior of model systems as studied here is likely to shed light on reasons why biological systems are tuned into this specific regime.

Learning in neural networks based on a generalized fluctuation theorem

NASA Astrophysics Data System (ADS)

Hayakawa, Takashi; Aoyagi, Toshio

2015-11-01

Information maximization has been investigated as a possible mechanism of learning governing the self-organization that occurs within the neural systems of animals. Within the general context of models of neural systems bidirectionally interacting with environments, however, the role of information maximization remains to be elucidated. For bidirectionally interacting physical systems, universal laws describing the fluctuation they exhibit and the information they possess have recently been discovered. These laws are termed fluctuation theorems. In the present study, we formulate a theory of learning in neural networks bidirectionally interacting with environments based on the principle of information maximization. Our formulation begins with the introduction of a generalized fluctuation theorem, employing an interpretation appropriate for the present application, which differs from the original thermodynamic interpretation. We analytically and numerically demonstrate that the learning mechanism presented in our theory allows neural networks to efficiently explore their environments and optimally encode information about them.

Network marketing on a small-world network

NASA Astrophysics Data System (ADS)

Kim, Beom Jun; Jun, Tackseung; Kim, Jeong-Yoo; Choi, M. Y.

2006-02-01

We investigate a dynamic model of network marketing in a small-world network structure artificially constructed similarly to the Watts-Strogatz network model. Different from the traditional marketing, consumers can also play the role of the manufacturer's selling agents in network marketing, which is stimulated by the referral fee the manufacturer offers. As the wiring probability α is increased from zero to unity, the network changes from the one-dimensional regular directed network to the star network where all but one player are connected to one consumer. The price p of the product and the referral fee r are used as free parameters to maximize the profit of the manufacturer. It is observed that at α=0 the maximized profit is constant independent of the network size N while at α≠0, it increases linearly with N. This is in parallel to the small-world transition. It is also revealed that while the optimal value of p stays at an almost constant level in a broad range of α, that of r is sensitive to a change in the network structure. The consumer surplus is also studied and discussed.

Maximizing Information Diffusion in the Cyber-physical Integrated Network †

PubMed Central

Lu, Hongliang; Lv, Shaohe; Jiao, Xianlong; Wang, Xiaodong; Liu, Juan

2015-01-01

Nowadays, our living environment has been embedded with smart objects, such as smart sensors, smart watches and smart phones. They make cyberspace and physical space integrated by their abundant abilities of sensing, communication and computation, forming a cyber-physical integrated network. In order to maximize information diffusion in such a network, a group of objects are selected as the forwarding points. To optimize the selection, a minimum connected dominating set (CDS) strategy is adopted. However, existing approaches focus on minimizing the size of the CDS, neglecting an important factor: the weight of links. In this paper, we propose a distributed maximizing the probability of information diffusion (DMPID) algorithm in the cyber-physical integrated network. Unlike previous approaches that only consider the size of CDS selection, DMPID also considers the information spread probability that depends on the weight of links. To weaken the effects of excessively-weighted links, we also present an optimization strategy that can properly balance the two factors. The results of extensive simulation show that DMPID can nearly double the information diffusion probability, while keeping a reasonable size of selection with low overhead in different distributed networks. PMID:26569254

Maximally informative pairwise interactions in networks

PubMed Central

Fitzgerald, Jeffrey D.; Sharpee, Tatyana O.

2010-01-01

Several types of biological networks have recently been shown to be accurately described by a maximum entropy model with pairwise interactions, also known as the Ising model. Here we present an approach for finding the optimal mappings between input signals and network states that allow the network to convey the maximal information about input signals drawn from a given distribution. This mapping also produces a set of linear equations for calculating the optimal Ising-model coupling constants, as well as geometric properties that indicate the applicability of the pairwise Ising model. We show that the optimal pairwise interactions are on average zero for Gaussian and uniformly distributed inputs, whereas they are nonzero for inputs approximating those in natural environments. These nonzero network interactions are predicted to increase in strength as the noise in the response functions of each network node increases. This approach also suggests ways for how interactions with unmeasured parts of the network can be inferred from the parameters of response functions for the measured network nodes. PMID:19905153

Simple Random Sampling-Based Probe Station Selection for Fault Detection in Wireless Sensor Networks

PubMed Central

Huang, Rimao; Qiu, Xuesong; Rui, Lanlan

2011-01-01

Fault detection for wireless sensor networks (WSNs) has been studied intensively in recent years. Most existing works statically choose the manager nodes as probe stations and probe the network at a fixed frequency. This straightforward solution leads however to several deficiencies. Firstly, by only assigning the fault detection task to the manager node the whole network is out of balance, and this quickly overloads the already heavily burdened manager node, which in turn ultimately shortens the lifetime of the whole network. Secondly, probing with a fixed frequency often generates too much useless network traffic, which results in a waste of the limited network energy. Thirdly, the traditional algorithm for choosing a probing node is too complicated to be used in energy-critical wireless sensor networks. In this paper, we study the distribution characters of the fault nodes in wireless sensor networks, validate the Pareto principle that a small number of clusters contain most of the faults. We then present a Simple Random Sampling-based algorithm to dynamic choose sensor nodes as probe stations. A dynamic adjusting rule for probing frequency is also proposed to reduce the number of useless probing packets. The simulation experiments demonstrate that the algorithm and adjusting rule we present can effectively prolong the lifetime of a wireless sensor network without decreasing the fault detected rate. PMID:22163789

Simple random sampling-based probe station selection for fault detection in wireless sensor networks.

PubMed

Huang, Rimao; Qiu, Xuesong; Rui, Lanlan

2011-01-01

Fault detection for wireless sensor networks (WSNs) has been studied intensively in recent years. Most existing works statically choose the manager nodes as probe stations and probe the network at a fixed frequency. This straightforward solution leads however to several deficiencies. Firstly, by only assigning the fault detection task to the manager node the whole network is out of balance, and this quickly overloads the already heavily burdened manager node, which in turn ultimately shortens the lifetime of the whole network. Secondly, probing with a fixed frequency often generates too much useless network traffic, which results in a waste of the limited network energy. Thirdly, the traditional algorithm for choosing a probing node is too complicated to be used in energy-critical wireless sensor networks. In this paper, we study the distribution characters of the fault nodes in wireless sensor networks, validate the Pareto principle that a small number of clusters contain most of the faults. We then present a Simple Random Sampling-based algorithm to dynamic choose sensor nodes as probe stations. A dynamic adjusting rule for probing frequency is also proposed to reduce the number of useless probing packets. The simulation experiments demonstrate that the algorithm and adjusting rule we present can effectively prolong the lifetime of a wireless sensor network without decreasing the fault detected rate.

Adaptive Aggregation Routing to Reduce Delay for Multi-Layer Wireless Sensor Networks.

PubMed

Li, Xujing; Liu, Anfeng; Xie, Mande; Xiong, Neal N; Zeng, Zhiwen; Cai, Zhiping

2018-04-16

The quality of service (QoS) regarding delay, lifetime and reliability is the key to the application of wireless sensor networks (WSNs). Data aggregation is a method to effectively reduce the data transmission volume and improve the lifetime of a network. In the previous study, a common strategy required that data wait in the queue. When the length of the queue is greater than or equal to the predetermined aggregation threshold ( N t ) or the waiting time is equal to the aggregation timer ( T t ), data are forwarded at the expense of an increase in the delay. The primary contributions of the proposed Adaptive Aggregation Routing (AAR) scheme are the following: (a) the senders select the forwarding node dynamically according to the length of the data queue, which effectively reduces the delay. In the AAR scheme, the senders send data to the nodes with a long data queue. The advantages are that first, the nodes with a long data queue need a small amount of data to perform aggregation; therefore, the transmitted data can be fully utilized to make these nodes aggregate. Second, this scheme balances the aggregating and data sending load; thus, the lifetime increases. (b) An improved AAR scheme is proposed to improve the QoS. The aggregation deadline ( T t ) and the aggregation threshold ( N t ) are dynamically changed in the network. In WSNs, nodes far from the sink have residual energy because these nodes transmit less data than the other nodes. In the improved AAR scheme, the nodes far from the sink have a small value of T t and N t to reduce delay, and the nodes near the sink are set to a large value of T t and N t to reduce energy consumption. Thus, the end to end delay is reduced, a longer lifetime is achieved, and the residual energy is fully used. Simulation results demonstrate that compared with the previous scheme, the performance of the AAR scheme is improved. This scheme reduces the delay by 14.91%, improves the lifetime by 30.91%, and increases energy efficiency by 76.40%.

Adaptive Aggregation Routing to Reduce Delay for Multi-Layer Wireless Sensor Networks

PubMed Central

Li, Xujing; Xie, Mande; Zeng, Zhiwen; Cai, Zhiping

2018-01-01

The quality of service (QoS) regarding delay, lifetime and reliability is the key to the application of wireless sensor networks (WSNs). Data aggregation is a method to effectively reduce the data transmission volume and improve the lifetime of a network. In the previous study, a common strategy required that data wait in the queue. When the length of the queue is greater than or equal to the predetermined aggregation threshold (Nt) or the waiting time is equal to the aggregation timer (Tt), data are forwarded at the expense of an increase in the delay. The primary contributions of the proposed Adaptive Aggregation Routing (AAR) scheme are the following: (a) the senders select the forwarding node dynamically according to the length of the data queue, which effectively reduces the delay. In the AAR scheme, the senders send data to the nodes with a long data queue. The advantages are that first, the nodes with a long data queue need a small amount of data to perform aggregation; therefore, the transmitted data can be fully utilized to make these nodes aggregate. Second, this scheme balances the aggregating and data sending load; thus, the lifetime increases. (b) An improved AAR scheme is proposed to improve the QoS. The aggregation deadline (Tt) and the aggregation threshold (Nt) are dynamically changed in the network. In WSNs, nodes far from the sink have residual energy because these nodes transmit less data than the other nodes. In the improved AAR scheme, the nodes far from the sink have a small value of Tt and Nt to reduce delay, and the nodes near the sink are set to a large value of Tt and Nt to reduce energy consumption. Thus, the end to end delay is reduced, a longer lifetime is achieved, and the residual energy is fully used. Simulation results demonstrate that compared with the previous scheme, the performance of the AAR scheme is improved. This scheme reduces the delay by 14.91%, improves the lifetime by 30.91%, and increases energy efficiency by 76.40%. PMID:29659535

A Data Fusion Method in Wireless Sensor Networks

PubMed Central

Izadi, Davood; Abawajy, Jemal H.; Ghanavati, Sara; Herawan, Tutut

2015-01-01

The success of a Wireless Sensor Network (WSN) deployment strongly depends on the quality of service (QoS) it provides regarding issues such as data accuracy, data aggregation delays and network lifetime maximisation. This is especially challenging in data fusion mechanisms, where a small fraction of low quality data in the fusion input may negatively impact the overall fusion result. In this paper, we present a fuzzy-based data fusion approach for WSN with the aim of increasing the QoS whilst reducing the energy consumption of the sensor network. The proposed approach is able to distinguish and aggregate only true values of the collected data as such, thus reducing the burden of processing the entire data at the base station (BS). It is also able to eliminate redundant data and consequently reduce energy consumption thus increasing the network lifetime. We studied the effectiveness of the proposed data fusion approach experimentally and compared it with two baseline approaches in terms of data collection, number of transferred data packets and energy consumption. The results of the experiments show that the proposed approach achieves better results than the baseline approaches. PMID:25635417

High p-type doping, mobility, and photocarrier lifetime in arsenic-doped CdTe single crystals

NASA Astrophysics Data System (ADS)

Nagaoka, Akira; Kuciauskas, Darius; McCoy, Jedidiah; Scarpulla, Michael A.

2018-05-01

Group-V element doping is promising for simultaneously maximizing the hole concentration and minority carrier lifetime in CdTe for thin film solar cells, but there are roadblocks concerning point defects including the possibility of self-compensation by AX metastability. Herein, we report on doping, lifetime, and mobility of CdTe single crystals doped with As between 1016 and 1020 cm-3 grown from the Cd solvent by the travelling heater method. Evidence consistent with AX instability as a major contributor to compensation in samples doped below 1017 cm-3 is presented, while for higher-doped samples, precipitation of a second phase on planar structural defects is also observed and may explain spatial variation in properties such as lifetime. Rapid cooling after crystal growth increases doping efficiency and mobility for times up to 20-30 days at room temperature with the highest efficiencies observed close to 45% and a hole mobility of 70 cm2/Vs at room temperature. A doping limit in the low 1017/cm3 range is observed for samples quenched at 200-300 °C/h. Bulk minority carrier lifetimes exceeding 20 ns are observed for samples doped near 1016 cm-3 relaxed in the dark and for unintentionally doped samples, while a lifetime of nearly 5 ns is observed for 1018 cm-3 As doping. These results help us to establish limits on properties expected for group-V doped CdTe polycrystalline thin films for use in photovoltaics.

Dynamic Task Allocation in Multi-Hop Multimedia Wireless Sensor Networks with Low Mobility

PubMed Central

Jin, Yichao; Vural, Serdar; Gluhak, Alexander; Moessner, Klaus

2013-01-01

This paper presents a task allocation-oriented framework to enable efficient in-network processing and cost-effective multi-hop resource sharing for dynamic multi-hop multimedia wireless sensor networks with low node mobility, e.g., pedestrian speeds. The proposed system incorporates a fast task reallocation algorithm to quickly recover from possible network service disruptions, such as node or link failures. An evolutional self-learning mechanism based on a genetic algorithm continuously adapts the system parameters in order to meet the desired application delay requirements, while also achieving a sufficiently long network lifetime. Since the algorithm runtime incurs considerable time delay while updating task assignments, we introduce an adaptive window size to limit the delay periods and ensure an up-to-date solution based on node mobility patterns and device processing capabilities. To the best of our knowledge, this is the first study that yields multi-objective task allocation in a mobile multi-hop wireless environment under dynamic conditions. Simulations are performed in various settings, and the results show considerable performance improvement in extending network lifetime compared to heuristic mechanisms. Furthermore, the proposed framework provides noticeable reduction in the frequency of missing application deadlines. PMID:24135992

Energy Efficient Probabilistic Broadcasting for Mobile Ad-Hoc Network

NASA Astrophysics Data System (ADS)

Kumar, Sumit; Mehfuz, Shabana

2017-06-01

In mobile ad-hoc network (MANETs) flooding method is used for broadcasting route request (RREQ) packet from one node to another node for route discovery. This is the simplest method of broadcasting of RREQ packets but it often results in broadcast storm problem, originating collisions and congestion of packets in the network. A probabilistic broadcasting is one of the widely used broadcasting scheme for route discovery in MANETs and provides solution for broadcasting storm problem. But it does not consider limited energy of the battery of the nodes. In this paper, a new energy efficient probabilistic broadcasting (EEPB) is proposed in which probability of broadcasting RREQs is calculated with respect to remaining energy of nodes. The analysis of simulation results clearly indicate that an EEPB route discovery scheme in ad-hoc on demand distance vector (AODV) can increase the network lifetime with a decrease in the average power consumption and RREQ packet overhead. It also decreases the number of dropped packets in the network, in comparison to other EEPB schemes like energy constraint gossip (ECG), energy aware gossip (EAG), energy based gossip (EBG) and network lifetime through energy efficient broadcast gossip (NEBG).

The Associations of Naturalistic Classic Psychedelic Use, Mystical Experience, and Creative Problem Solving.

PubMed

Sweat, Noah W; Bates, Larry W; Hendricks, Peter S

2016-01-01

Developing methods for improving creativity is of broad interest. Classic psychedelics may enhance creativity; however, the underlying mechanisms of action are unknown. This study was designed to assess whether a relationship exists between naturalistic classic psychedelic use and heightened creative problem-solving ability and if so, whether this is mediated by lifetime mystical experience. Participants (N = 68) completed a survey battery assessing lifetime mystical experience and circumstances surrounding the most memorable experience. They were then administered a functional fixedness task in which faster completion times indicate greater creative problem-solving ability. Participants reporting classic psychedelic use concurrent with mystical experience (n = 11) exhibited significantly faster times on the functional fixedness task (Cohen's d = -.87; large effect) and significantly greater lifetime mystical experience (Cohen's d = .93; large effect) than participants not reporting classic psychedelic use concurrent with mystical experience. However, lifetime mystical experience was unrelated to completion times on the functional fixedness task (standardized β = -.06), and was therefore not a significant mediator. Classic psychedelic use may increase creativity independent of its effects on mystical experience. Maximizing the likelihood of mystical experience may need not be a goal of psychedelic interventions designed to boost creativity.

Reliability of high-power QCW arrays

NASA Astrophysics Data System (ADS)

Feeler, Ryan; Junghans, Jeremy; Remley, Jennifer; Schnurbusch, Don; Stephens, Ed

2010-02-01

Northrop Grumman Cutting Edge Optronics has developed a family of arrays for high-power QCW operation. These arrays are built using CTE-matched heat sinks and hard solder in order to maximize the reliability of the devices. A summary of a recent life test is presented in order to quantify the reliability of QCW arrays and associated laser gain modules. A statistical analysis of the raw lifetime data is presented in order to quantify the data in such a way that is useful for laser system designers. The life tests demonstrate the high level of reliability of these arrays in a number of operating regimes. For single-bar arrays, a MTTF of 19.8 billion shots is predicted. For four-bar samples, a MTTF of 14.6 billion shots is predicted. In addition, data representing a large pump source is analyzed and shown to have an expected lifetime of 13.5 billion shots. This corresponds to an expected operational lifetime of greater than ten thousand hours at repetition rates less than 370 Hz.

Adjustable Trajectory Design Based on Node Density for Mobile Sink in WSNs

PubMed Central

Yang, Guisong; Liu, Shuai; He, Xingyu; Xiong, Naixue; Wu, Chunxue

2016-01-01

The design of movement trajectories for mobile sink plays an important role in data gathering for Wireless Sensor Networks (WSNs), as it affects the network coverage, and packet delivery ratio, as well as the network lifetime. In some scenarios, the whole network can be divided into subareas where the nodes are randomly deployed. The node densities of these subareas are quite different, which may result in a decreased packet delivery ratio and network lifetime if the movement trajectory of the mobile sink cannot adapt to these differences. To address these problems, we propose an adjustable trajectory design method based on node density for mobile sink in WSNs. The movement trajectory of the mobile sink in each subarea follows the Hilbert space-filling curve. Firstly, the trajectory is constructed based on network size. Secondly, the adjustable trajectory is established based on node density in specific subareas. Finally, the trajectories in each subarea are combined to acquire the whole network’s movement trajectory for the mobile sink. In addition, an adaptable power control scheme is designed to adjust nodes’ transmitting range dynamically according to the movement trajectory of the mobile sink in each subarea. The simulation results demonstrate that the proposed trajectories can adapt to network changes flexibly, thus outperform both in packet delivery ratio and in energy consumption the trajectories designed only based on the network size and the whole network node density. PMID:27941662

Optimally frugal foraging

NASA Astrophysics Data System (ADS)

Bénichou, O.; Bhat, U.; Krapivsky, P. L.; Redner, S.

2018-02-01

We introduce the frugal foraging model in which a forager performs a discrete-time random walk on a lattice in which each site initially contains S food units. The forager metabolizes one unit of food at each step and starves to death when it last ate S steps in the past. Whenever the forager eats, it consumes all food at its current site and this site remains empty forever (no food replenishment). The crucial property of the forager is that it is frugal and eats only when encountering food within at most k steps of starvation. We compute the average lifetime analytically as a function of the frugality threshold and show that there exists an optimal strategy, namely, an optimal frugality threshold k* that maximizes the forager lifetime.

Evolution of collectivity near mid-shell from excited-state lifetime measurements in rare earth nuclei

NASA Astrophysics Data System (ADS)

Werner, V.; Cooper, N.; Régis, J.-M.; Rudigier, M.; Williams, E.; Jolie, J.; Cakirli, R. B.; Casten, R. F.; Ahn, T.; Anagnostatou, V.; Berant, Z.; Bonett-Matiz, M.; Elvers, M.; Heinz, A.; Ilie, G.; Radeck, D.; Savran, D.; Smith, M. K.

2016-03-01

The B (E 2 ) excitation strength of the first excited 2+ state in even-even nuclei should directly correlate with the size of the valence space and maximize at mid-shell. A previously found saturation of B (E 2 ) strengths in well-deformed rotors at mid-shell is tested through high-precision measurements of the lifetimes of the lowest-lying 2+ states of the 168Hf and 174W rare earth isotopes. Measurements were performed using fast LaBr3 scintillation detectors. Combined with the recently remeasured B (E 2 ;21+→01+) values for Hf and W isotopes the new data remove discrepancies observed in the differentials of B (E 2 ) values for these isotopes.

Network Coding for Function Computation

ERIC Educational Resources Information Center

Appuswamy, Rathinakumar

2011-01-01

In this dissertation, the following "network computing problem" is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a target function f of the messages. The objective is to maximize the average number of times f can be computed per network usage, i.e., the "computing…

Relaxation dynamics of maximally clustered networks

NASA Astrophysics Data System (ADS)

Klaise, Janis; Johnson, Samuel

2018-01-01

We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics—the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erdős-Rényi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erdős-Rényi phenomenology.

Effect of inhibitory firing pattern on coherence resonance in random neural networks

NASA Astrophysics Data System (ADS)

Yu, Haitao; Zhang, Lianghao; Guo, Xinmeng; Wang, Jiang; Cao, Yibin; Liu, Jing

2018-01-01

The effect of inhibitory firing patterns on coherence resonance (CR) in random neuronal network is systematically studied. Spiking and bursting are two main types of firing pattern considered in this work. Numerical results show that, irrespective of the inhibitory firing patterns, the regularity of network is maximized by an optimal intensity of external noise, indicating the occurrence of coherence resonance. Moreover, the firing pattern of inhibitory neuron indeed has a significant influence on coherence resonance, but the efficacy is determined by network property. In the network with strong coupling strength but weak inhibition, bursting neurons largely increase the amplitude of resonance, while they can decrease the noise intensity that induced coherence resonance within the neural system of strong inhibition. Different temporal windows of inhibition induced by different inhibitory neurons may account for the above observations. The network structure also plays a constructive role in the coherence resonance. There exists an optimal network topology to maximize the regularity of the neural systems.

Microstructural Characterization of Semi-Interpenetrating Polymer Networks by Positron Lifetime Spectroscopy

NASA Technical Reports Server (NTRS)

Singh, Jag J.; Pater, Ruth H.; Eftekhari, Abe

1996-01-01

Thermoset and thermoplastic polyimides have complementary physical and mechanical properties. Whereas thermoset polyimides are brittle and generally easier to process, thermoplastic polyimides are tough but harder to process. A combination of these two types of polyimides may help produce polymers more suitable for aerospace applications. Semi-Interpenetrating Polymer Networks (S-IPN) of thermoset LaRC(TM)-RP46 and thermoplastic LaRC(TM)-IA polyimides were prepared in weight percent ratios ranging from 100:0 to 0:100. Positron lifetime measurements were made in these samples to correlate their free volume features with physical and mechanical properties. As expected, positronium atoms are not formed in these samples. The second lifetime component has been used to infer the positron trap dimensions. The 'free volume' goes through a minimum at a ratio of about 50:50, and this suggests that S-IPN samples are not merely solid solutions of the two polymers. These data and related structural properties of the S-IPN samples are discussed.

Water Hydrogen-Bonding Network Structure and Dynamics at Phospholipid Multibilayer Surface: Femtosecond Mid-IR Pump-Probe Spectroscopy.

PubMed

Kundu, Achintya; Błasiak, Bartosz; Lim, Joon-Hyung; Kwak, Kyungwon; Cho, Minhaeng

2016-03-03

The water hydrogen-bonding network at a lipid bilayer surface is crucial to understanding membrane structures and its functional activities. With a phospholipid multibilayer mimicking a biological membrane, we study the temperature dependence of water hydrogen-bonding structure, distribution, and dynamics at a lipid multibilayer surface using femtosecond mid-IR pump-probe spectroscopy. We observe two distinguished vibrational lifetime components. The fast component (0.6 ps) is associated with water interacting with a phosphate part, whereas the slow component (1.9 ps) is with bulk-like choline-associated water. With increasing temperature, the vibrational lifetime of phosphate-associated water remains constant though its relative fraction dramatically increases. The OD stretch vibrational lifetime of choline-bound water slows down in a sigmoidal fashion with respect to temperature, indicating a noticeable change of the water environment upon the phase transition. The water structure and dynamics are thus shown to be in quantitative correlation with the structural change of liquid multibilayer upon the gel-to-liquid crystal phase transition.

Sex-specific effects of protein and carbohydrate intake on reproduction but not lifespan in Drosophila melanogaster

PubMed Central

Jensen, Kim; McClure, Colin; Priest, Nicholas K; Hunt, John

2015-01-01

Modest dietary restriction extends lifespan (LS) in a diverse range of taxa and typically has a larger effect in females than males. Traditionally, this has been attributed to a stronger trade-off between LS and reproduction in females than in males that is mediated by the intake of calories. Recent studies, however, suggest that it is the intake of specific nutrients that extends LS and mediates this trade-off. Here, we used the geometric framework (GF) to examine the sex-specific effects of protein (P) and carbohydrate (C) intake on LS and reproduction in Drosophila melanogaster. We found that LS was maximized at a high intake of C and a low intake of P in both sexes, whereas nutrient intake had divergent effects on reproduction. Male offspring production rate and LS were maximized at the same intake of nutrients, whereas female egg production rate was maximized at a high intake of diets with a P:C ratio of 1:2. This resulted in larger differences in nutrient-dependent optima for LS and reproduction in females than in males, as well as an optimal intake of nutrients for lifetime reproduction that differed between the sexes. Under dietary choice, the sexes followed similar feeding trajectories regulated around a P:C ratio of 1:4. Consequently, neither sex reached their nutritional optimum for lifetime reproduction, suggesting intralocus sexual conflict over nutrient optimization. Our study shows clear sex differences in the nutritional requirements of reproduction in D. melanogaster and joins the growing list of studies challenging the role of caloric restriction in extending LS. PMID:25808180

Tritium-powered radiation sensor network

NASA Astrophysics Data System (ADS)

Litz, Marc S.; Russo, Johnny A.; Katsis, Dimos

2016-05-01

Isotope power supplies offer long-lived (100 years using 63Ni), low-power energy sources, enabling sensors or communications nodes for the lifetime of infrastructure. A tritium beta-source (12.5-year half-life) encapsulated in a phosphor-lined vial couples directly to a photovoltaic (PV) to generate a trickle current into an electrical load. An inexpensive design is described using commercial-of-the-shelf (COTS) components that generate 100 μWe for nextgeneration compact electronics/sensors. A matched radiation sensor has been built for long-duration missions utilizing microprocessor-controlled sleep modes, low-power electronic components, and a passive interrupt driven environmental wake-up. The low-power early-warning radiation detector network and isotope power source enables no-maintenance mission lifetimes.

Wireless Cooperative Networks: Self-Configuration and Optimization

DTIC Science & Technology

2011-09-09

TERMS wireless sensor networks , wireless cooperative networks, resource optimization, ultra-wideband, localization, ranging 16. SECURITY...Communications We consider two prevalent relay protocols for wireless sensor networks : decode-and-forward (DF) and amplify-and-forward (AF). To... sensor networks where each node may have its own sensing data to transmit, since they can maximally conserve energy while helping others as relays

A Gossip-based Energy Efficient Protocol for Robust In-network Aggregation in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Fauji, Shantanu

We consider the problem of energy efficient and fault tolerant in--network aggregation for wireless sensor networks (WSNs). In-network aggregation is the process of aggregation while collecting data from sensors to the base station. This process should be energy efficient due to the limited energy at the sensors and tolerant to the high failure rates common in sensor networks. Tree based in--network aggregation protocols, although energy efficient, are not robust to network failures. Multipath routing protocols are robust to failures to a certain degree but are not energy efficient due to the overhead in the maintenance of multiple paths. We propose a new protocol for in-network aggregation in WSNs, which is energy efficient, achieves high lifetime, and is robust to the changes in the network topology. Our protocol, gossip--based protocol for in-network aggregation (GPIA) is based on the spreading of information via gossip. GPIA is not only adaptive to failures and changes in the network topology, but is also energy efficient. Energy efficiency of GPIA comes from all the nodes being capable of selective message reception and detecting convergence of the aggregation early. We experimentally show that GPIA provides significant improvement over some other competitors like the Ridesharing, Synopsis Diffusion and the pure version of gossip. GPIA shows ten fold, five fold and two fold improvement over the pure gossip, the synopsis diffusion and Ridesharing protocols in terms of network lifetime, respectively. Further, GPIA retains gossip's robustness to failures and improves upon the accuracy of synopsis diffusion and Ridesharing.

Feasibility of maintaining in-plane polarization for a storage ring EDM search

NASA Astrophysics Data System (ADS)

Stephenson, Edward; Storage Ring EDM Collaboration

2014-09-01

A search for an electric dipole moment (EDM) on charged particles using a storage ring requires beam polarization lifetimes approaching 1000 s for in-plane polarization. A feasibility study using beam bunching and sextupole field adjustment is underway with a 0.97-GeV/c vector-polarized deuteron beam at COSY. The polarimeter consists of a thick carbon target positioned at the edge of the beam and the EDDA scintillation detectors. The DAQ system assigns a clock time to each polarimeter event. Once calibrated against the RF-cavity, the clock time is used to select events associated with a maximal sideways polarization (precessing at 120 kHz). With this tool, the in-plane polarization magnitude is tracked versus time. Electron cooling reduces the depolarization from finite emittance and second-order momentum spread acting through synchrotron oscillations. Further lifetime improvement to the level of hundreds of seconds is achieved by adjusting sextupole fields located in the COSY ring arcs at places of large transverse beta functions and dispersion. The dependence of the reciprocal of the lifetime on sextupole field strength is nearly linear, permitting an easy location of the best field values. These typically occur near loci of zero chromaticity. A search for an electric dipole moment (EDM) on charged particles using a storage ring requires beam polarization lifetimes approaching 1000 s for in-plane polarization. A feasibility study using beam bunching and sextupole field adjustment is underway with a 0.97-GeV/c vector-polarized deuteron beam at COSY. The polarimeter consists of a thick carbon target positioned at the edge of the beam and the EDDA scintillation detectors. The DAQ system assigns a clock time to each polarimeter event. Once calibrated against the RF-cavity, the clock time is used to select events associated with a maximal sideways polarization (precessing at 120 kHz). With this tool, the in-plane polarization magnitude is tracked versus time. Electron cooling reduces the depolarization from finite emittance and second-order momentum spread acting through synchrotron oscillations. Further lifetime improvement to the level of hundreds of seconds is achieved by adjusting sextupole fields located in the COSY ring arcs at places of large transverse beta functions and dispersion. The dependence of the reciprocal of the lifetime on sextupole field strength is nearly linear, permitting an easy location of the best field values. These typically occur near loci of zero chromaticity. Supported in part by the Forschungszentrum-Juelich and the European Union.

Using the principle of entropy maximization to infer genetic interaction networks from gene expression patterns.

PubMed

Lezon, Timothy R; Banavar, Jayanth R; Cieplak, Marek; Maritan, Amos; Fedoroff, Nina V

2006-12-12

We describe a method based on the principle of entropy maximization to identify the gene interaction network with the highest probability of giving rise to experimentally observed transcript profiles. In its simplest form, the method yields the pairwise gene interaction network, but it can also be extended to deduce higher-order interactions. Analysis of microarray data from genes in Saccharomyces cerevisiae chemostat cultures exhibiting energy metabolic oscillations identifies a gene interaction network that reflects the intracellular communication pathways that adjust cellular metabolic activity and cell division to the limiting nutrient conditions that trigger metabolic oscillations. The success of the present approach in extracting meaningful genetic connections suggests that the maximum entropy principle is a useful concept for understanding living systems, as it is for other complex, nonequilibrium systems.

Optimizing interconnections to maximize the spectral radius of interdependent networks

NASA Astrophysics Data System (ADS)

Chen, Huashan; Zhao, Xiuyan; Liu, Feng; Xu, Shouhuai; Lu, Wenlian

2017-03-01

The spectral radius (i.e., the largest eigenvalue) of the adjacency matrices of complex networks is an important quantity that governs the behavior of many dynamic processes on the networks, such as synchronization and epidemics. Studies in the literature focused on bounding this quantity. In this paper, we investigate how to maximize the spectral radius of interdependent networks by optimally linking k internetwork connections (or interconnections for short). We derive formulas for the estimation of the spectral radius of interdependent networks and employ these results to develop a suite of algorithms that are applicable to different parameter regimes. In particular, a simple algorithm is to link the k nodes with the largest k eigenvector centralities in one network to the node in the other network with a certain property related to both networks. We demonstrate the applicability of our algorithms via extensive simulations. We discuss the physical implications of the results, including how the optimal interconnections can more effectively decrease the threshold of epidemic spreading in the susceptible-infected-susceptible model and the threshold of synchronization of coupled Kuramoto oscillators.

Competition between Homophily and Information Entropy Maximization in Social Networks

PubMed Central

Zhao, Jichang; Liang, Xiao; Xu, Ke

2015-01-01

In social networks, it is conventionally thought that two individuals with more overlapped friends tend to establish a new friendship, which could be stated as homophily breeding new connections. While the recent hypothesis of maximum information entropy is presented as the possible origin of effective navigation in small-world networks. We find there exists a competition between information entropy maximization and homophily in local structure through both theoretical and experimental analysis. This competition suggests that a newly built relationship between two individuals with more common friends would lead to less information entropy gain for them. We demonstrate that in the evolution of the social network, both of the two assumptions coexist. The rule of maximum information entropy produces weak ties in the network, while the law of homophily makes the network highly clustered locally and the individuals would obtain strong and trust ties. A toy model is also presented to demonstrate the competition and evaluate the roles of different rules in the evolution of real networks. Our findings could shed light on the social network modeling from a new perspective. PMID:26334994

Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle.

PubMed

Gibbs, David L; Shmulevich, Ilya

2017-06-01

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf.

Influence maximization in social networks under an independent cascade-based model

NASA Astrophysics Data System (ADS)

Wang, Qiyao; Jin, Yuehui; Lin, Zhen; Cheng, Shiduan; Yang, Tan

2016-02-01

The rapid growth of online social networks is important for viral marketing. Influence maximization refers to the process of finding influential users who make the most of information or product adoption. An independent cascade-based model for influence maximization, called IMIC-OC, was proposed to calculate positive influence. We assumed that influential users spread positive opinions. At the beginning, users held positive or negative opinions as their initial opinions. When more users became involved in the discussions, users balanced their own opinions and those of their neighbors. The number of users who did not change positive opinions was used to determine positive influence. Corresponding influential users who had maximum positive influence were then obtained. Experiments were conducted on three real networks, namely, Facebook, HEP-PH and Epinions, to calculate maximum positive influence based on the IMIC-OC model and two other baseline methods. The proposed model resulted in larger positive influence, thus indicating better performance compared with the baseline methods.

Race/Ethnicity and Health-Related Quality of Life Among LGBT Older Adults.

PubMed

Kim, Hyun-Jun; Jen, Sarah; Fredriksen-Goldsen, Karen I

2017-02-01

Few existing studies have addressed racial/ethnic differences in the health and quality of life of lesbian, gay, bisexual, and transgender (LGBT) older adults. Guided by the Health Equity Promotion Model, this study examines health-promoting and health risk factors that contribute to racial/ethnic health disparities among LGBT adults aged 50 and older. We utilized weighted survey data from Aging with Pride: National Health, Aging, and Sexuality/Gender Study. By applying multiple mediator models, we analyzed the indirect effects of race/ethnicity on health-related quality of life (HRQOL) via demographics, lifetime LGBT-related discrimination, and victimization, and socioeconomic, identity-related, spiritual, and social resources. Although African Americans and Hispanics, compared with non-Hispanic Whites, reported lower physical HRQOL and comparable psychological HRQOL, indirect pathways between race/ethnicity and HRQOL were observed. African Americans and Hispanics had lower income, educational attainment, identity affirmation, and social support, which were associated with a decrease in physical and psychological HRQOL. African Americans had higher lifetime LGBT-related discrimination, which was linked to a decrease in their physical and psychological HRQOL. African Americans and Hispanics had higher spirituality, which was associated with an increase in psychological HRQOL. Findings illustrate the importance of identifying both health-promoting and health risk factors to understand ways to maximize the health potential of racially and ethnically diverse LGBT older adults. Interventions aimed at health equity should be tailored to bolster identity affirmation and social networks of LGBT older adults of color and to support strengths, including spiritual resources. © The Author 2017. Published by Oxford University Press on behalf of The Gerontological Society of America. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Intrinsic noise and deviations from criticality in Boolean gene-regulatory networks

NASA Astrophysics Data System (ADS)

Villegas, Pablo; Ruiz-Franco, José; Hidalgo, Jorge; Muñoz, Miguel A.

2016-10-01

Gene regulatory networks can be successfully modeled as Boolean networks. A much discussed hypothesis says that such model networks reproduce empirical findings the best if they are tuned to operate at criticality, i.e. at the borderline between their ordered and disordered phases. Critical networks have been argued to lead to a number of functional advantages such as maximal dynamical range, maximal sensitivity to environmental changes, as well as to an excellent tradeoff between stability and flexibility. Here, we study the effect of noise within the context of Boolean networks trained to learn complex tasks under supervision. We verify that quasi-critical networks are the ones learning in the fastest possible way -even for asynchronous updating rules- and that the larger the task complexity the smaller the distance to criticality. On the other hand, when additional sources of intrinsic noise in the network states and/or in its wiring pattern are introduced, the optimally performing networks become clearly subcritical. These results suggest that in order to compensate for inherent stochasticity, regulatory and other type of biological networks might become subcritical rather than being critical, all the most if the task to be performed has limited complexity.

Information theory-based decision support system for integrated design of multivariable hydrometric networks

NASA Astrophysics Data System (ADS)

Keum, Jongho; Coulibaly, Paulin

2017-07-01

Adequate and accurate hydrologic information from optimal hydrometric networks is an essential part of effective water resources management. Although the key hydrologic processes in the water cycle are interconnected, hydrometric networks (e.g., streamflow, precipitation, groundwater level) have been routinely designed individually. A decision support framework is proposed for integrated design of multivariable hydrometric networks. The proposed method is applied to design optimal precipitation and streamflow networks simultaneously. The epsilon-dominance hierarchical Bayesian optimization algorithm was combined with Shannon entropy of information theory to design and evaluate hydrometric networks. Specifically, the joint entropy from the combined networks was maximized to provide the most information, and the total correlation was minimized to reduce redundant information. To further optimize the efficiency between the networks, they were designed by maximizing the conditional entropy of the streamflow network given the information of the precipitation network. Compared to the traditional individual variable design approach, the integrated multivariable design method was able to determine more efficient optimal networks by avoiding the redundant stations. Additionally, four quantization cases were compared to evaluate their effects on the entropy calculations and the determination of the optimal networks. The evaluation results indicate that the quantization methods should be selected after careful consideration for each design problem since the station rankings and the optimal networks can change accordingly.

High p-type doping, mobility, and photocarrier lifetime in arsenic-doped CdTe single crystals

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nagaoka, Akira; Kuciauskas, Darius; McCoy, Jedidiah

Here, Group-V element doping is promising for simultaneously maximizing the hole concentration and minority carrier lifetime in CdTe for thin film solar cells, but there are roadblocks concerning point defects including the possibility of self-compensation by AX metastability. Herein, we report on doping, lifetime, and mobility of CdTe single crystals doped with As between 10 16 and 10 20 cm –3 grown from the Cd solvent by the travelling heater method. Evidence consistent with AX instability as a major contributor to compensation in samples doped below 10 17 cm –3 is presented, while for higher-doped samples, precipitation of a secondmore » phase on planar structural defects is also observed and may explain spatial variation in properties such as lifetime. Rapid cooling after crystal growth increases doping efficiency and mobility for times up to 20–30 days at room temperature with the highest efficiencies observed close to 45% and a hole mobility of 70 cm 2/Vs at room temperature. A doping limit in the low 10 17/cm 3 range is observed for samples quenched at 200–300 °C/h. Bulk minority carrier lifetimes exceeding 20 ns are observed for samples doped near 10 16 cm –3 relaxed in the dark and for unintentionally doped samples, while a lifetime of nearly 5 ns is observed for 10 18 cm –3 As doping. These results help us to establish limits on properties expected for group-V doped CdTe polycrystalline thin films for use in photovoltaics.« less

High p-type doping, mobility, and photocarrier lifetime in arsenic-doped CdTe single crystals

DOE PAGES

Nagaoka, Akira; Kuciauskas, Darius; McCoy, Jedidiah; ...

2018-05-07

Here, Group-V element doping is promising for simultaneously maximizing the hole concentration and minority carrier lifetime in CdTe for thin film solar cells, but there are roadblocks concerning point defects including the possibility of self-compensation by AX metastability. Herein, we report on doping, lifetime, and mobility of CdTe single crystals doped with As between 10 16 and 10 20 cm –3 grown from the Cd solvent by the travelling heater method. Evidence consistent with AX instability as a major contributor to compensation in samples doped below 10 17 cm –3 is presented, while for higher-doped samples, precipitation of a secondmore » phase on planar structural defects is also observed and may explain spatial variation in properties such as lifetime. Rapid cooling after crystal growth increases doping efficiency and mobility for times up to 20–30 days at room temperature with the highest efficiencies observed close to 45% and a hole mobility of 70 cm 2/Vs at room temperature. A doping limit in the low 10 17/cm 3 range is observed for samples quenched at 200–300 °C/h. Bulk minority carrier lifetimes exceeding 20 ns are observed for samples doped near 10 16 cm –3 relaxed in the dark and for unintentionally doped samples, while a lifetime of nearly 5 ns is observed for 10 18 cm –3 As doping. These results help us to establish limits on properties expected for group-V doped CdTe polycrystalline thin films for use in photovoltaics.« less

Price of anarchy is maximized at the percolation threshold.

PubMed

Skinner, Brian

2015-05-01

When many independent users try to route traffic through a network, the flow can easily become suboptimal as a consequence of congestion of the most efficient paths. The degree of this suboptimality is quantified by the so-called price of anarchy (POA), but so far there are no general rules for when to expect a large POA in a random network. Here I address this question by introducing a simple model of flow through a network with randomly placed congestible and incongestible links. I show that the POA is maximized precisely when the fraction of congestible links matches the percolation threshold of the lattice. Both the POA and the total cost demonstrate critical scaling near the percolation threshold.

Extinction times of epidemic outbreaks in networks.

PubMed

Holme, Petter

2013-01-01

In the Susceptible-Infectious-Recovered (SIR) model of disease spreading, the time to extinction of the epidemics happens at an intermediate value of the per-contact transmission probability. Too contagious infections burn out fast in the population. Infections that are not contagious enough die out before they spread to a large fraction of people. We characterize how the maximal extinction time in SIR simulations on networks depend on the network structure. For example we find that the average distances in isolated components, weighted by the component size, is a good predictor of the maximal time to extinction. Furthermore, the transmission probability giving the longest outbreaks is larger than, but otherwise seemingly independent of, the epidemic threshold.

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling.

PubMed

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-09-18

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols.

Energy Efficient Medium Access Control Protocol for Clustered Wireless Sensor Networks with Adaptive Cross-Layer Scheduling

PubMed Central

Sefuba, Maria; Walingo, Tom; Takawira, Fambirai

2015-01-01

This paper presents an Energy Efficient Medium Access Control (MAC) protocol for clustered wireless sensor networks that aims to improve energy efficiency and delay performance. The proposed protocol employs an adaptive cross-layer intra-cluster scheduling and an inter-cluster relay selection diversity. The scheduling is based on available data packets and remaining energy level of the source node (SN). This helps to minimize idle listening on nodes without data to transmit as well as reducing control packet overhead. The relay selection diversity is carried out between clusters, by the cluster head (CH), and the base station (BS). The diversity helps to improve network reliability and prolong the network lifetime. Relay selection is determined based on the communication distance, the remaining energy and the channel quality indicator (CQI) for the relay cluster head (RCH). An analytical framework for energy consumption and transmission delay for the proposed MAC protocol is presented in this work. The performance of the proposed MAC protocol is evaluated based on transmission delay, energy consumption, and network lifetime. The results obtained indicate that the proposed MAC protocol provides improved performance than traditional cluster based MAC protocols. PMID:26393608

Automatic segmentation of fluorescence lifetime microscopy images of cells using multiresolution community detection--a first study.

PubMed

Hu, D; Sarder, P; Ronhovde, P; Orthaus, S; Achilefu, S; Nussinov, Z

2014-01-01

Inspired by a multiresolution community detection based network segmentation method, we suggest an automatic method for segmenting fluorescence lifetime (FLT) imaging microscopy (FLIM) images of cells in a first pilot investigation on two selected images. The image processing problem is framed as identifying segments with respective average FLTs against the background in FLIM images. The proposed method segments a FLIM image for a given resolution of the network defined using image pixels as the nodes and similarity between the FLTs of the pixels as the edges. In the resulting segmentation, low network resolution leads to larger segments, and high network resolution leads to smaller segments. Furthermore, using the proposed method, the mean-square error in estimating the FLT segments in a FLIM image was found to consistently decrease with increasing resolution of the corresponding network. The multiresolution community detection method appeared to perform better than a popular spectral clustering-based method in performing FLIM image segmentation. At high resolution, the spectral segmentation method introduced noisy segments in its output, and it was unable to achieve a consistent decrease in mean-square error with increasing resolution. © 2013 The Authors Journal of Microscopy © 2013 Royal Microscopical Society.

Automatic Segmentation of Fluorescence Lifetime Microscopy Images of Cells Using Multi-Resolution Community Detection -A First Study

PubMed Central

Hu, Dandan; Sarder, Pinaki; Ronhovde, Peter; Orthaus, Sandra; Achilefu, Samuel; Nussinov, Zohar

2014-01-01

Inspired by a multi-resolution community detection (MCD) based network segmentation method, we suggest an automatic method for segmenting fluorescence lifetime (FLT) imaging microscopy (FLIM) images of cells in a first pilot investigation on two selected images. The image processing problem is framed as identifying segments with respective average FLTs against the background in FLIM images. The proposed method segments a FLIM image for a given resolution of the network defined using image pixels as the nodes and similarity between the FLTs of the pixels as the edges. In the resulting segmentation, low network resolution leads to larger segments, and high network resolution leads to smaller segments. Further, using the proposed method, the mean-square error (MSE) in estimating the FLT segments in a FLIM image was found to consistently decrease with increasing resolution of the corresponding network. The MCD method appeared to perform better than a popular spectral clustering based method in performing FLIM image segmentation. At high resolution, the spectral segmentation method introduced noisy segments in its output, and it was unable to achieve a consistent decrease in MSE with increasing resolution. PMID:24251410

Chandra mission scheduling on-orbit experience

NASA Astrophysics Data System (ADS)

Bucher, Sabina; Williams, Brent; Pendexter, Misty; Balke, David

2008-07-01

Scheduling observatory time to maximize both day-to-day science target integration time and the lifetime of the observatory is a formidable challenge. Furthermore, it is not a static problem. Of course, every schedule brings a new set of observations, but the boundaries of the problem change as well. As spacecraft ages, its capabilities may degrade. As in-flight experience grows, capabilities may expand. As observing programs are completed, the needs and expectations of the science community may evolve. Changes such as these impact the rules by which a mission scheduled. In eight years on orbit, the Chandra X-Ray Observatory Mission Planning process has adapted to meet the challenge of maximizing day-to-day and mission lifetime science return, despite a consistently evolving set of scheduling constraints. The success of the planning team has been achieved, not through the use of complex algorithms and optimization routines, but through processes and home grown tools that help individuals make smart short term and long term Mission Planning decisions. This paper walks through the processes and tools used to plan and produce mission schedules for the Chandra X-Ray Observatory. Nominal planning and scheduling, target of opportunity response, and recovery from on-board autonomous safing actions are all addressed. Evolution of tools and processes, best practices, and lessons learned are highlighted along the way.

Design of New Power Management Circuit for Light Energy Harvesting System

PubMed Central

Jafer, Issa; Stack, Paul; MacNamee, Kevin

2016-01-01

Nowadays, it can be observed that Wireless Sensors Networks (WSN) are taking increasingly vital roles in many applications, such as building energy monitoring and control, which is the focus of the work in this paper. However, the main challenging issue with adopting WSN technology is the use of power sources such as batteries, which have a limited lifetime. A smart solution that could tackle this problem is using Energy Harvesting technology. The work in this paper will be focused on proposing a new power management design through harvesting indoor light intensity. The new approach is inspired by the use of the Fractional Open Circuit Voltage based Maximum Power Point tracking (MPPT) concept for sub mw Photo Voltaic (PV) cells. The new design adopts two main features: First, it minimizes the power consumed by the power management section; and second, it maximizes the MPPT-converted output voltage and consequently improves the efficiency of the power conversion in the sub mw power level. The new experimentally-tested design showed an improvement of 81% in the efficiency of MPPT conversion using 0.5 mW input power in comparison with the other presented solutions that showed less efficiency with higher input power. PMID:26907300

Can multilayer brain networks be a real step forward?. Comment on "Network science of biological systems at different scales: A review" by M. Gosak et al.

NASA Astrophysics Data System (ADS)

Buldú, Javier M.; Papo, David

2018-03-01

Over the last two decades Network Science has become one of the most active fields in science, whose growth has been supported by four fundamental pillars: statistical physics, nonlinear dynamics, graph theory and Big Data [1]. Initially concerned with analyzing the structure of networks, Network Science rapidly turned its attention, focused on the implications of network topology, on the dynamics of and processes unfolding on networked systems, greatly improving our understanding of diffusion, synchronization, epidemics and information transmission in complex systems [2]. The network approach typically considered complex systems as evolving in a vacuum; however real networks are generally not isolated systems, but are in continuous and evolving contact with other networks, with which they interact in multiple qualitative different and typically time-varying ways. These systems can then be represented as a collection of subsystems with connectivity layers, which are simply collapsed when considering the traditional monolayer representation. Surprisingly, such an "unpacking" of layers has proven to bear profound consequences on the structural and dynamical properties of networks, leading for instance to counter-intuitive synchronization phenomena, where maximization synchronization is achieved through strategies opposite of those maximizing synchronization in isolated networks [3].

Epoch Lifetimes in the Dynamics of a Competing Population

NASA Astrophysics Data System (ADS)

Yeung, C. H.; Ma, Y. P.; Wong, K. Y. Michael

We propose a dynamical model of a competing population whose agents have a tendency to balance their decisions in time. The model is applicable to financial markets in which the agents trade with finite capital, or other multiagent systems such as routers in communication networks attempting to transmit multiclass traffic in a fair way. We find an oscillatory behavior due to the segregation of agents into two groups. Each group remains winning over epochs. The aggregation of smart agents is able to explain the lifetime distribution of epochs to 8 decades of probability. The existence of the super agents further refines the lifetime distribution of short epochs.

NWTC Aerodynamics Studies Improve Energy Capture and Lower Costs of Wind-Generated Electricity

DOE Office of Scientific and Technical Information (OSTI.GOV)

2015-08-01

Researchers at the National Wind Technology Center (NWTC) at the National Renewable Energy Laboratory (NREL) have expanded wind turbine aerodynamic research from blade and rotor aerodynamics to wind plant and atmospheric inflow effects. The energy capture from wind plants is dependent on all of these aerodynamic interactions. Research at the NWTC is crucial to understanding how wind turbines function in large, multiple-row wind plants. These conditions impact the cumulative fatigue damage of turbine structural components that ultimately effect the useful lifetime of wind turbines. This work also is essential for understanding and maximizing turbine and wind plant energy production. Bothmore » turbine lifetime and wind plant energy production are key determinants of the cost of wind-generated electricity.« less

The Impact of Content-Based Network Technologies on Perceptions of Nutrition Literacy

ERIC Educational Resources Information Center

Brewer, Hannah; Church, E. Mitchell; Brewer, Steven L.

2016-01-01

Background: Consumers are exposed to obesogenic environments on a regular basis. Building nutrition literacy is critical for sustaining healthy dietary habits for a lifetime and reducing the prevalence of chronic disease. Purpose: There is a need to investigate the impact of content-based network (CBN) technologies on perceptions of nutrition…

Balancing energy consumption with hybrid clustering and routing strategy in wireless sensor networks.

PubMed

Xu, Zhezhuang; Chen, Liquan; Liu, Ting; Cao, Lianyang; Chen, Cailian

2015-10-20

Multi-hop data collection in wireless sensor networks (WSNs) is a challenge issue due to the limited energy resource and transmission range of wireless sensors. The hybrid clustering and routing (HCR) strategy has provided an effective solution, which can generate a connected and efficient cluster-based topology for multi-hop data collection in WSNs. However, it suffers from imbalanced energy consumption, which results in the poor performance of the network lifetime. In this paper, we evaluate the energy consumption of HCR and discover an important result: the imbalanced energy consumption generally appears in gradient k = 1, i.e., the nodes that can communicate with the sink directly. Based on this observation, we propose a new protocol called HCR-1, which includes the adaptive relay selection and tunable cost functions to balance the energy consumption. The guideline of setting the parameters in HCR-1 is provided based on simulations. The analytical and numerical results prove that, with minor modification of the topology in Sensors 2015, 15 26584 gradient k = 1, the HCR-1 protocol effectively balances the energy consumption and prolongs the network lifetime.

A Trust-Based Adaptive Probability Marking and Storage Traceback Scheme for WSNs

PubMed Central

Liu, Anfeng; Liu, Xiao; Long, Jun

2016-01-01

Security is a pivotal issue for wireless sensor networks (WSNs), which are emerging as a promising platform that enables a wide range of military, scientific, industrial and commercial applications. Traceback, a key cyber-forensics technology, can play an important role in tracing and locating a malicious source to guarantee cybersecurity. In this work a trust-based adaptive probability marking and storage (TAPMS) traceback scheme is proposed to enhance security for WSNs. In a TAPMS scheme, the marking probability is adaptively adjusted according to the security requirements of the network and can substantially reduce the number of marking tuples and improve network lifetime. More importantly, a high trust node is selected to store marking tuples, which can avoid the problem of marking information being lost. Experimental results show that the total number of marking tuples can be reduced in a TAPMS scheme, thus improving network lifetime. At the same time, since the marking tuples are stored in high trust nodes, storage reliability can be guaranteed, and the traceback time can be reduced by more than 80%. PMID:27043566

Low Duty-Cycling MAC Protocol for Low Data-Rate Medical Wireless Body Area Networks

PubMed Central

Zhang, Chongqing; Wang, Yinglong; Liang, Yongquan; Shu, Minglei; Zhang, Jinquan; Ni, Lina

2017-01-01

Wireless body area networks (WBANs) are severely energy constrained, and how to improve the energy efficiency so as to prolong the network lifetime as long as possible is one of the most important goals of WBAN research. Low data-rate WBANs are promising to cut down the energy consumption and extend the network lifetime. Considering the characteristics and demands of low data-rate WBANs, a low duty-cycling medium access control (MAC) protocol is specially designed for this kind of WBAN in this paper. Longer superframes are exploited to cut down the energy consumed on the transmissions and receptions of redundant beacon frames. Insertion time slots are embedded into the inactive part of a superframe to deliver the frames and satisfy the quality of service (QoS) requirements. The number of the data subsections in an insertion time slot can be adaptively adjusted so as to accommodate low data-rate WBANs with different traffic. Simulation results show that the proposed MAC protocol performs well under the condition of low data-rate monitoring traffic. PMID:28509849

Utilizing Maximal Independent Sets as Dominating Sets in Scale-Free Networks

NASA Astrophysics Data System (ADS)

Derzsy, N.; Molnar, F., Jr.; Szymanski, B. K.; Korniss, G.

Dominating sets provide key solution to various critical problems in networked systems, such as detecting, monitoring, or controlling the behavior of nodes. Motivated by graph theory literature [Erdos, Israel J. Math. 4, 233 (1966)], we studied maximal independent sets (MIS) as dominating sets in scale-free networks. We investigated the scaling behavior of the size of MIS in artificial scale-free networks with respect to multiple topological properties (size, average degree, power-law exponent, assortativity), evaluated its resilience to network damage resulting from random failure or targeted attack [Molnar et al., Sci. Rep. 5, 8321 (2015)], and compared its efficiency to previously proposed dominating set selection strategies. We showed that, despite its small set size, MIS provides very high resilience against network damage. Using extensive numerical analysis on both synthetic and real-world (social, biological, technological) network samples, we demonstrate that our method effectively satisfies four essential requirements of dominating sets for their practical applicability on large-scale real-world systems: 1.) small set size, 2.) minimal network information required for their construction scheme, 3.) fast and easy computational implementation, and 4.) resiliency to network damage. Supported by DARPA, DTRA, and NSF.

3D Architecture of Trabecular Bone in the Pig Mandible and Femur: Inter-Trabecular Angle Distributions.

NASA Astrophysics Data System (ADS)

Ben-Zvi, Yehonatan; Reznikov, Natalie; Shahar, Ron; Weiner, Steve

2017-09-01

Cancellous bone is an intricate network of interconnected trabeculae, to which analysis of network topology can be applied. The inter-trabecular angle (ITA) analysis - an analysis of network topological parameters and regularity of network-forming nodes, was previously carried out on human proximal femora and showed that trabecular bone follows two main principles: sparsity of the network connectedness (prevalence of nodes with low connectivity in the network) and maximal space spanning (angular offset of connected elements is maximal for their number and approximates the values of geometrically symmetric shapes). These observations suggest that 3D organization of trabecular bone, irrespective of size and shape of individual elements, reflects a tradeoff between minimal metabolic cost of maintenance and maximal network stability under conditions of multidirectional loading. In this study we validate the ITA application using additional 3D structures (cork and 3D-printed metal lattices), analyze the ITA parameters in porcine proximal femora and mandibles and carry out a spatial analysis of the most common node type in the porcine mandibular condyle. The validation shows that the ITA application reliably detects designed or evolved topological parameters. The ITA parameters of porcine trabecular bones are similar to those of human bones. We demonstrate functional adaptation in the pig mandibular condyle by showing that the planar nodes with 3 edges are preferentially aligned in relation to the muscle forces that are applied to the condyle. We conclude that the ITA topological parameters are remarkable conserved, but locally do adapt to applied stresses.

The effects of neuron morphology on graph theoretic measures of network connectivity: the analysis of a two-level statistical model.

PubMed

Aćimović, Jugoslava; Mäki-Marttunen, Tuomo; Linne, Marja-Leena

2015-01-01

We developed a two-level statistical model that addresses the question of how properties of neurite morphology shape the large-scale network connectivity. We adopted a low-dimensional statistical description of neurites. From the neurite model description we derived the expected number of synapses, node degree, and the effective radius, the maximal distance between two neurons expected to form at least one synapse. We related these quantities to the network connectivity described using standard measures from graph theory, such as motif counts, clustering coefficient, minimal path length, and small-world coefficient. These measures are used in a neuroscience context to study phenomena from synaptic connectivity in the small neuronal networks to large scale functional connectivity in the cortex. For these measures we provide analytical solutions that clearly relate different model properties. Neurites that sparsely cover space lead to a small effective radius. If the effective radius is small compared to the overall neuron size the obtained networks share similarities with the uniform random networks as each neuron connects to a small number of distant neurons. Large neurites with densely packed branches lead to a large effective radius. If this effective radius is large compared to the neuron size, the obtained networks have many local connections. In between these extremes, the networks maximize the variability of connection repertoires. The presented approach connects the properties of neuron morphology with large scale network properties without requiring heavy simulations with many model parameters. The two-steps procedure provides an easier interpretation of the role of each modeled parameter. The model is flexible and each of its components can be further expanded. We identified a range of model parameters that maximizes variability in network connectivity, the property that might affect network capacity to exhibit different dynamical regimes.

Using the principle of entropy maximization to infer genetic interaction networks from gene expression patterns

PubMed Central

Lezon, Timothy R.; Banavar, Jayanth R.; Cieplak, Marek; Maritan, Amos; Fedoroff, Nina V.

2006-01-01

We describe a method based on the principle of entropy maximization to identify the gene interaction network with the highest probability of giving rise to experimentally observed transcript profiles. In its simplest form, the method yields the pairwise gene interaction network, but it can also be extended to deduce higher-order interactions. Analysis of microarray data from genes in Saccharomyces cerevisiae chemostat cultures exhibiting energy metabolic oscillations identifies a gene interaction network that reflects the intracellular communication pathways that adjust cellular metabolic activity and cell division to the limiting nutrient conditions that trigger metabolic oscillations. The success of the present approach in extracting meaningful genetic connections suggests that the maximum entropy principle is a useful concept for understanding living systems, as it is for other complex, nonequilibrium systems. PMID:17138668

Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual

PubMed Central

Alim, Karen; Amselem, Gabriel; Peaudecerf, François; Brenner, Michael P.; Pringle, Anne

2013-01-01

Individuals can function as integrated organisms only when information and resources are shared across a body. Signals and substrates are commonly moved using fluids, often channeled through a network of tubes. Peristalsis is one mechanism for fluid transport and is caused by a wave of cross-sectional contractions along a tube. We extend the concept of peristalsis from the canonical case of one tube to a random network. Transport is maximized within the network when the wavelength of the peristaltic wave is of the order of the size of the network. The slime mold Physarum polycephalum grows as a random network of tubes, and our experiments confirm peristalsis is used by the slime mold to drive internal cytoplasmic flows. Comparisons of theoretically generated contraction patterns with the patterns exhibited by individuals of P. polycephalum demonstrate that individuals maximize internal flows by adapting patterns of contraction to size, thus optimizing transport throughout an organism. This control of fluid flow may be the key to coordinating growth and behavior, including the dynamic changes in network architecture seen over time in an individual. PMID:23898203

Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual.

PubMed

Alim, Karen; Amselem, Gabriel; Peaudecerf, François; Brenner, Michael P; Pringle, Anne

2013-08-13

Individuals can function as integrated organisms only when information and resources are shared across a body. Signals and substrates are commonly moved using fluids, often channeled through a network of tubes. Peristalsis is one mechanism for fluid transport and is caused by a wave of cross-sectional contractions along a tube. We extend the concept of peristalsis from the canonical case of one tube to a random network. Transport is maximized within the network when the wavelength of the peristaltic wave is of the order of the size of the network. The slime mold Physarum polycephalum grows as a random network of tubes, and our experiments confirm peristalsis is used by the slime mold to drive internal cytoplasmic flows. Comparisons of theoretically generated contraction patterns with the patterns exhibited by individuals of P. polycephalum demonstrate that individuals maximize internal flows by adapting patterns of contraction to size, thus optimizing transport throughout an organism. This control of fluid flow may be the key to coordinating growth and behavior, including the dynamic changes in network architecture seen over time in an individual.

Expectation maximization-based likelihood inference for flexible cure rate models with Weibull lifetimes.

PubMed

Balakrishnan, Narayanaswamy; Pal, Suvra

2016-08-01

Recently, a flexible cure rate survival model has been developed by assuming the number of competing causes of the event of interest to follow the Conway-Maxwell-Poisson distribution. This model includes some of the well-known cure rate models discussed in the literature as special cases. Data obtained from cancer clinical trials are often right censored and expectation maximization algorithm can be used in this case to efficiently estimate the model parameters based on right censored data. In this paper, we consider the competing cause scenario and assuming the time-to-event to follow the Weibull distribution, we derive the necessary steps of the expectation maximization algorithm for estimating the parameters of different cure rate survival models. The standard errors of the maximum likelihood estimates are obtained by inverting the observed information matrix. The method of inference developed here is examined by means of an extensive Monte Carlo simulation study. Finally, we illustrate the proposed methodology with a real data on cancer recurrence. © The Author(s) 2013.

Tuning carrier lifetime in InGaN/GaN LEDs via strain compensation for high-speed visible light communication

PubMed Central

Du, Chunhua; Huang, Xin; Jiang, Chunyan; Pu, Xiong; Zhao, Zhenfu; Jing, Liang; Hu, Weiguo; Wang, Zhong Lin

2016-01-01

In recent years, visible light communication (VLC) technology has attracted intensive attention due to its huge potential in superior processing ability and fast data transmission. The transmission rate relies on the modulation bandwidth, which is predominantly determined by the minority-carrier lifetime in III-group nitride semiconductors. In this paper, the carrier dynamic process under a stress field was studied for the first time, and the carrier recombination lifetime was calculated within the framework of quantum perturbation theory. Owing to the intrinsic strain due to the lattice mismatch between InGaN and GaN, the wave functions for the holes and electrons are misaligned in an InGaN/GaN device. By applying an external strain that “cancels” the internal strain, the overlap between the wave functions can be maximized so that the lifetime of the carrier is greatly reduced. As a result, the maximum speed of a single chip was increased from 54 MHz up to 117 MHz in a blue LED chip under 0.14% compressive strain. Finally, a bandwidth contour plot depending on the stress and operating wavelength was calculated to guide VLC chip design and stress optimization. PMID:27841368

Sex-specific effects of protein and carbohydrate intake on reproduction but not lifespan in Drosophila melanogaster.

PubMed

Jensen, Kim; McClure, Colin; Priest, Nicholas K; Hunt, John

2015-08-01

Modest dietary restriction extends lifespan (LS) in a diverse range of taxa and typically has a larger effect in females than males. Traditionally, this has been attributed to a stronger trade-off between LS and reproduction in females than in males that is mediated by the intake of calories. Recent studies, however, suggest that it is the intake of specific nutrients that extends LS and mediates this trade-off. Here, we used the geometric framework (GF) to examine the sex-specific effects of protein (P) and carbohydrate (C) intake on LS and reproduction in Drosophila melanogaster. We found that LS was maximized at a high intake of C and a low intake of P in both sexes, whereas nutrient intake had divergent effects on reproduction. Male offspring production rate and LS were maximized at the same intake of nutrients, whereas female egg production rate was maximized at a high intake of diets with a P:C ratio of 1:2. This resulted in larger differences in nutrient-dependent optima for LS and reproduction in females than in males, as well as an optimal intake of nutrients for lifetime reproduction that differed between the sexes. Under dietary choice, the sexes followed similar feeding trajectories regulated around a P:C ratio of 1:4. Consequently, neither sex reached their nutritional optimum for lifetime reproduction, suggesting intralocus sexual conflict over nutrient optimization. Our study shows clear sex differences in the nutritional requirements of reproduction in D. melanogaster and joins the growing list of studies challenging the role of caloric restriction in extending LS. © 2015 The Authors. Aging Cell published by the Anatomical Society and John Wiley & Sons Ltd.

Analyzing Online Teacher Networks: Cyber Networks Require Cyber Research Tools

ERIC Educational Resources Information Center

Schlager, Mark S.; Farooq, Umer; Fusco, Judith; Schank, Patricia; Dwyer, Nathan

2009-01-01

The authors argue that conceptual and methodological limitations in existing research approaches severely hamper theory building and empirical exploration of teacher learning and collaboration through cyber-enabled networks. They conclude that new frameworks, tools, and techniques are needed to understand and maximize the benefits of teacher…

Energy efficient data representation and aggregation with event region detection in wireless sensor networks

NASA Astrophysics Data System (ADS)

Banerjee, Torsha

Unlike conventional networks, wireless sensor networks (WSNs) are limited in power, have much smaller memory buffers, and possess relatively slower processing speeds. These characteristics necessitate minimum transfer and storage of information in order to prolong the network lifetime. In this dissertation, we exploit the spatio-temporal nature of sensor data to approximate the current values of the sensors based on readings obtained from neighboring sensors and itself. We propose a Tree based polynomial REGression algorithm, (TREG) that addresses the problem of data compression in wireless sensor networks. Instead of aggregated data, a polynomial function (P) is computed by the regression function, TREG. The coefficients of P are then passed to achieve the following goals: (i) The sink can get attribute values in the regions devoid of sensor nodes, and (ii) Readings over any portion of the region can be obtained at one time by querying the root of the tree. As the size of the data packet from each tree node to its parent remains constant, the proposed scheme scales very well with growing network density or increased coverage area. Since physical attributes exhibit a gradual change over time, we propose an iterative scheme, UPDATE_COEFF, which obviates the need to perform the regression function repeatedly and uses approximations based on previous readings. Extensive simulations are performed on real world data to demonstrate the effectiveness of our proposed aggregation algorithm, TREG. Results reveal that for a network density of 0.0025 nodes/m2, a complete binary tree of depth 4 could provide the absolute error to be less than 6%. A data compression ratio of about 0.02 is achieved using our proposed algorithm, which is almost independent of the tree depth. In addition, our proposed updating scheme makes the aggregation process faster while maintaining the desired error bounds. We also propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for WSNs. When a single event occurs, a child of the tree sends a Flagged Polynomial (FP) to its parent, if the readings approximated by it falls outside the data range defining the existing phenomenon. After the aggregation process is over, the root having the two polynomials, P and FP can be queried for FP (approximating the new event region) instead of flooding the whole network. For multiple such events, instead of computing a polynomial corresponding to each new event, areas with same data range are combined by the corresponding tree nodes and the aggregated coefficients are passed on. Results reveal that a new event can be detected by PERD while error in detection remains constant and is less than a threshold of 10%. As the node density increases, accuracy and delay for event detection are found to remain almost constant, making PERD highly scalable. Whenever an event occurs in a WSN, data is generated by closeby sensors and relaying the data to the base station (BS) make sensors closer to the BS run out of energy at a much faster rate than sensors in other parts of the network. This gives rise to an unequal distribution of residual energy in the network and makes those sensors with lower remaining energy level die at much faster rate than others. We propose a scheme for enhancing network Lifetime using mobile cluster heads (CH) in a WSN. To maintain remaining energy more evenly, some energy-rich nodes are designated as CHs which move in a controlled manner towards sensors rich in energy and data. This eliminates multihop transmission required by the static sensors and thus increases the overall lifetime of the WSN. We combine the idea of clustering and mobile CH to first form clusters of static sensor nodes. A collaborative strategy among the CHs further increases the lifetime of the network. Time taken for transmitting data to the BS is reduced further by making the CHs follow a connectivity strategy that always maintain a connected path to the BS. Spatial correlation of sensor data can be further exploited for dynamic channel selection in Cellular Communication. In such a scenario within a licensed band, wireless sensors can be deployed (each sensor tuned to a frequency of the channel at a particular time) to sense the interference power of the frequency band. In an ideal channel, interference temperature (IT) which is directly proportional to the interference power, can be assumed to vary spatially with the frequency of the sub channel. We propose a scheme for fitting the sub channel frequencies and corresponding ITs to a regression model for calculating the IT of a random sub channel for further analysis of the channel interference at the base station. Our scheme, based on the readings reported by Sensors helps in Dynamic Channel Selection (S-DCS) in extended C-band for assignment to unlicensed secondary users. S-DCS proves to be economic from energy consumption point of view and it also achieves accuracy with error bound within 6.8%. Again, users are assigned empty sub channels without actually probing them, incurring minimum delay in the process. The overall channel throughput is maximized along with fairness to individual users.

Free volume of mixed cation borosilicate glass sealants elucidated by positron annihilation lifetime spectroscopy and its correlation with glass properties

NASA Astrophysics Data System (ADS)

Ojha, Prasanta K.; Rath, Sangram K.; Sharma, Sandeep K.; Sudarshan, Kathi; Pujari, Pradeep K.; Chongdar, Tapas K.; Gokhale, Nitin M.

2015-01-01

The role of La+3/Sr+2 ratios, which is varied from 0.08 to 5.09, on density, molar volume, packing fraction, free volume, thermal and electrical properties in strontium lanthanum aluminoborosilicate based glass sealants intended for solid oxide fuel cell (SOFC) applications is evaluated. The studies reveal expansion of the glass network evident from increasing molar volume and decreasing packing fraction of glasses with progressive La+3 substitutions. The molecular origin of these macroscopic structural features can be accounted for by the free volume parameters measured from positron annihilation lifetime spectroscopy (PALS). The La+3 induced expanded glass networks show increased number of subnanoscopic voids with larger sizes, as revealed from the ortho-positronium (o-Ps) lifetime and its intensity. A remarkably direct correspondence between the molar volume and fractional free volume trend is established with progressive La2O3 substitution in the glasses. The effect of these structural changes on the glass transition temperature, softening temperature, coefficient of thermal expansion, thermal stability as well as electrical conductivity has been studied.

Using crowdsourcing to prioritize bicycle network improvements : final report.

DOT National Transportation Integrated Search

2016-04-01

Effort to improve the bicycle route network using crowdsourced data is a powerful means : of incorporating citizens in infrastructure improvement decisions, which will improve : livability by maximizing the benefit of the bicycle infrastructure fundi...

3D hierarchical MnO2 nanorod/welded Ag-nanowire-network composites for high-performance supercapacitor electrodes.

PubMed

Qiao, Zhensong; Yang, Xiaopeng; Yang, Shuhua; Zhang, Liqiang; Cao, Bingqiang

2016-06-28

3D MnO2 nanorod/welded Ag-nanowire-network supercapacitor electrodes were prepared. Welding treatment of the Ag nanowire-network leads to low resistance and long lifetime. Galvanostatic charge/discharge (GCD) induces an ever-lasting morphology changing from flower-like to honeycomb-like for MnO2, which manifests as increasing specific capacitance to 663.4 F g(-1) after 7000 GCD cycles.

Variable fidelity robust optimization of pulsed laser orbital debris removal under epistemic uncertainty

NASA Astrophysics Data System (ADS)

Hou, Liqiang; Cai, Yuanli; Liu, Jin; Hou, Chongyuan

2016-04-01

A variable fidelity robust optimization method for pulsed laser orbital debris removal (LODR) under uncertainty is proposed. Dempster-shafer theory of evidence (DST), which merges interval-based and probabilistic uncertainty modeling, is used in the robust optimization. The robust optimization method optimizes the performance while at the same time maximizing its belief value. A population based multi-objective optimization (MOO) algorithm based on a steepest descent like strategy with proper orthogonal decomposition (POD) is used to search robust Pareto solutions. Analytical and numerical lifetime predictors are used to evaluate the debris lifetime after the laser pulses. Trust region based fidelity management is designed to reduce the computational cost caused by the expensive model. When the solutions fall into the trust region, the analytical model is used to reduce the computational cost. The proposed robust optimization method is first tested on a set of standard problems and then applied to the removal of Iridium 33 with pulsed lasers. It will be shown that the proposed approach can identify the most robust solutions with minimum lifetime under uncertainty.

Coupled modeling of the competitive gettering of transition metals and impact on performance of lifetime sensitive devices

NASA Astrophysics Data System (ADS)

Yazdani, Armin; Chen, Renyu; Dunham, Scott T.

2017-03-01

This work models competitive gettering of metals (Cu, Ni, Fe, Mo, and W) by boron, phosphorus, and dislocation loops, and connects those results directly to device performance. Density functional theory calculations were first performed to determine the binding energies of metals to the gettering sites, and based on that, continuum models were developed to model the redistribution and trapping of the metals. Our models found that Fe is most strongly trapped by the dislocation loops while Cu and Ni are most strongly trapped by the P4V clusters formed in high phosphorus concentrations. In addition, it is found that none of the mentioned gettering sites are effective in gettering Mo and W. The calculated metal redistribution along with the associated capture cross sections and trap energy levels are passed to device simulation via the recombination models to calculate carrier lifetime and the resulting device performance. Thereby, a comprehensive and predictive TCAD framework is developed to optimize the processing conditions to maximize performance of lifetime sensitive devices.

Designing Robust and Resilient Tactical MANETs

DTIC Science & Technology

2014-09-25

Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks , IEEE/ACM Transactions on Networking , (06 2011): 0. doi: N... Wireless Sensor Networks and Effects of Long Range Dependant Data, Special IWSM Issue of Sequential Analysis, (11 2012): 0. doi: A. D. Dominguez...Bushnell, R. Poovendran. A Convex Optimization Approach for Clone Detection in Wireless Sensor Networks , Pervasive and Mobile Computing, (01 2012

Maximal Neighbor Similarity Reveals Real Communities in Networks

PubMed Central

Žalik, Krista Rizman

2015-01-01

An important problem in the analysis of network data is the detection of groups of densely interconnected nodes also called modules or communities. Community structure reveals functions and organizations of networks. Currently used algorithms for community detection in large-scale real-world networks are computationally expensive or require a priori information such as the number or sizes of communities or are not able to give the same resulting partition in multiple runs. In this paper we investigate a simple and fast algorithm that uses the network structure alone and requires neither optimization of pre-defined objective function nor information about number of communities. We propose a bottom up community detection algorithm in which starting from communities consisting of adjacent pairs of nodes and their maximal similar neighbors we find real communities. We show that the overall advantage of the proposed algorithm compared to the other community detection algorithms is its simple nature, low computational cost and its very high accuracy in detection communities of different sizes also in networks with blurred modularity structure consisting of poorly separated communities. All communities identified by the proposed method for facebook network and E-Coli transcriptional regulatory network have strong structural and functional coherence. PMID:26680448

Real-Time Optimization in Complex Stochastic Environment

DTIC Science & Technology

2015-06-24

simpler ones, thus addressing scalability and the limited resources of networked wireless devices. This, however, comes at the expense of increased...Maximization of Wireless Sensor Networks with Non-ideal Batteries”, IEEE Trans. on Control of Network Systems, Vol. 1, 1, pp. 86-98, 2014. [27...C.G., “Optimal Energy-Efficient Downlink Transmission Scheduling for Real-Time Wireless Networks ”, subm. to IEEE Trans. on Control of Network Systems

A Differential Evolution-Based Routing Algorithm for Environmental Monitoring Wireless Sensor Networks

PubMed Central

Li, Xiaofang; Xu, Lizhong; Wang, Huibin; Song, Jie; Yang, Simon X.

2010-01-01

The traditional Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol is a clustering-based protocol. The uneven selection of cluster heads results in premature death of cluster heads and premature blind nodes inside the clusters, thus reducing the overall lifetime of the network. With a full consideration of information on energy and distance distribution of neighboring nodes inside the clusters, this paper proposes a new routing algorithm based on differential evolution (DE) to improve the LEACH routing protocol. To meet the requirements of monitoring applications in outdoor environments such as the meteorological, hydrological and wetland ecological environments, the proposed algorithm uses the simple and fast search features of DE to optimize the multi-objective selection of cluster heads and prevent blind nodes for improved energy efficiency and system stability. Simulation results show that the proposed new LEACH routing algorithm has better performance, effectively extends the working lifetime of the system, and improves the quality of the wireless sensor networks. PMID:22219670

Tailoring chain length and cross-link density in dielectric elastomer toward enhanced actuation strain

NASA Astrophysics Data System (ADS)

Zhang, Quan-Ping; Liu, Jun-Hua; Liu, Hai-Dong; Jia, Fei; Zhou, Yuan-Lin; Zheng, Jian

2017-10-01

Adding ceramic or conductive fillers into polymers for increasing permittivity is a direct and effective approach to enhance the actuation strain of dielectric elastomer actuators (DEAs). Unfortunately, the major dielectric loss caused by weak interfaces potentially harms the electro-mechanical stability and lifetime of DEAs. Here, we construct a desired macromolecular network with a long chain length and low cross-link density to reduce the elastic modulus of silicone elastomers. Selecting a high molecular weight of polymethylvinylsiloxane and a low dose of the cross-linker leads the soft but tough networks with rich entanglements, poor cross-links, and a low amount of defects. Then, a ductile material with low elastic modulus but high elongation at break is obtained. It accounts for much more excellent actuation strain of Hl in comparison to that of the other silicone elastomers. Importantly, without other fillers, the ultralow dielectric loss, conductivity, and firm networks possibly promote the electro-mechanical stability and lifetime for the DEA application.

Nonlinear Dynamic Model-Based Multiobjective Sensor Network Design Algorithm for a Plant with an Estimator-Based Control System

DOE Office of Scientific and Technical Information (OSTI.GOV)

Paul, Prokash; Bhattacharyya, Debangsu; Turton, Richard

Here, a novel sensor network design (SND) algorithm is developed for maximizing process efficiency while minimizing sensor network cost for a nonlinear dynamic process with an estimator-based control system. The multiobjective optimization problem is solved following a lexicographic approach where the process efficiency is maximized first followed by minimization of the sensor network cost. The partial net present value, which combines the capital cost due to the sensor network and the operating cost due to deviation from the optimal efficiency, is proposed as an alternative objective. The unscented Kalman filter is considered as the nonlinear estimator. The large-scale combinatorial optimizationmore » problem is solved using a genetic algorithm. The developed SND algorithm is applied to an acid gas removal (AGR) unit as part of an integrated gasification combined cycle (IGCC) power plant with CO 2 capture. Due to the computational expense, a reduced order nonlinear model of the AGR process is identified and parallel computation is performed during implementation.« less

Stochastic user equilibrium model with a tradable credit scheme and application in maximizing network reserve capacity

NASA Astrophysics Data System (ADS)

Han, Fei; Cheng, Lin

2017-04-01

The tradable credit scheme (TCS) outperforms congestion pricing in terms of social equity and revenue neutrality, apart from the same perfect performance on congestion mitigation. This article investigates the effectiveness and efficiency of TCS on enhancing transportation network capacity in a stochastic user equilibrium (SUE) modelling framework. First, the SUE and credit market equilibrium conditions are presented; then an equivalent general SUE model with TCS is established by virtue of two constructed functions, which can be further simplified under a specific probability distribution. To enhance the network capacity by utilizing TCS, a bi-level mathematical programming model is established for the optimal TCS design problem, with the upper level optimization objective maximizing network reserve capacity and lower level being the proposed SUE model. The heuristic sensitivity analysis-based algorithm is developed to solve the bi-level model. Three numerical examples are provided to illustrate the improvement effect of TCS on the network in different scenarios.

Nonlinear Dynamic Model-Based Multiobjective Sensor Network Design Algorithm for a Plant with an Estimator-Based Control System

DOE PAGES

Paul, Prokash; Bhattacharyya, Debangsu; Turton, Richard; ...

2017-06-06

Here, a novel sensor network design (SND) algorithm is developed for maximizing process efficiency while minimizing sensor network cost for a nonlinear dynamic process with an estimator-based control system. The multiobjective optimization problem is solved following a lexicographic approach where the process efficiency is maximized first followed by minimization of the sensor network cost. The partial net present value, which combines the capital cost due to the sensor network and the operating cost due to deviation from the optimal efficiency, is proposed as an alternative objective. The unscented Kalman filter is considered as the nonlinear estimator. The large-scale combinatorial optimizationmore » problem is solved using a genetic algorithm. The developed SND algorithm is applied to an acid gas removal (AGR) unit as part of an integrated gasification combined cycle (IGCC) power plant with CO 2 capture. Due to the computational expense, a reduced order nonlinear model of the AGR process is identified and parallel computation is performed during implementation.« less

Generalized networking engineering: optimal pricing and routing in multiservice networks

NASA Astrophysics Data System (ADS)

Mitra, Debasis; Wang, Qiong

2002-07-01

One of the functions of network engineering is to allocate resources optimally to forecasted demand. We generalize the mechanism by incorporating price-demand relationships into the problem formulation, and optimizing pricing and routing jointly to maximize total revenue. We consider a network, with fixed topology and link bandwidths, that offers multiple services, such as voice and data, each having characteristic price elasticity of demand, and quality of service and policy requirements on routing. Prices, which depend on service type and origin-destination, determine demands, that are routed, subject to their constraints, so as to maximize revenue. We study the basic properties of the optimal solution and prove that link shadow costs provide the basis for both optimal prices and optimal routing policies. We investigate the impact of input parameters, such as link capacities and price elasticities, on prices, demand growth, and routing policies. Asymptotic analyses, in which network bandwidth is scaled to grow, give results that are noteworthy for their qualitative insights. Several numerical examples illustrate the analyses.

Maximizing Resource Utilization in Video Streaming Systems

ERIC Educational Resources Information Center

Alsmirat, Mohammad Abdullah

2013-01-01

Video streaming has recently grown dramatically in popularity over the Internet, Cable TV, and wire-less networks. Because of the resource demanding nature of video streaming applications, maximizing resource utilization in any video streaming system is a key factor to increase the scalability and decrease the cost of the system. Resources to…

Microstructural Characterization of Polymers with Positrons

NASA Technical Reports Server (NTRS)

Singh, Jag J.

1997-01-01

Positrons provide a versatile probe for monitoring microstructural features of molecular solids. In this paper, we report on positron lifetime measurements in two different types of polymers. The first group comprises polyacrylates processed on earth and in space. The second group includes fully-compatible and totally-incompatible Semi-Interpenetrating polymer networks of thermosetting and thermoplastic polyimides. On the basis of lifetime measurements, it is concluded that free volumes are a direct reflection of physical/electromagnetic properties of the host polymers.

Hot spots, indicator taxa, complementarity and optimal networks of taiga.

PubMed Central

Virolainen, K M; Ahlroth, P; Hyvärinen, E; Korkeamäki, E; Mattila, J; Päiivinen, J; Rintala, T; Suomi, T; Suhonen, J

2000-01-01

If hot spots for different taxa coincide, priority-setting surveys in a region could be carried out more cheaply by focusing on indicator taxa. Several previous studies show that hot spots of different taxa rarely coincide. However, in tropical areas indicator taxa may be used in selecting complementary networks to represent biodiversity as a whole. We studied beetles (Coleoptera), Heteroptera, polypores or bracket fungi (Polyporaceae) and vascular plants of old growth boreal taiga forests. Optimal networks for Heteroptera maximized the high overall species richness of beetles and vascular plants, but these networks were least favourable options for polypores. Polypores are an important group indicating the conservation value of old growth taiga forests. Random selection provided a better option. Thus, certain groups may function as good indicators for maximizing the overall species richness of some taxonomic groups, but all taxa should be examined separately. PMID:10885520

A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes

NASA Astrophysics Data System (ADS)

Agha Mohammad Ali Kermani, Mehrdad; Fatemi Ardestani, Seyed Farshad; Aliahmadi, Alireza; Barzinpour, Farnaz

2017-01-01

Influence maximization deals with identification of the most influential nodes in a social network given an influence model. In this paper, a game theoretic framework is developed that models a competitive influence maximization problem. A novel competitive influence model is additionally proposed that incorporates user heterogeneity, message content, and network structure. The proposed game-theoretic model is solved using Nash Equilibrium in a real-world dataset. It is shown that none of the well-known strategies are stable and at least one player has the incentive to deviate from the proposed strategy. Moreover, violation of Nash equilibrium strategy by each player leads to their reduced payoff. Contrary to previous works, our results demonstrate that graph topology, as well as the nodes' sociability and initial tendency measures have an effect on the determination of the influential node in the network.

Lifetime depression and anxiety increase prevalent psychological symptoms and worsen glycemic control in type 2 diabetes: The Fremantle Diabetes Study Phase II.

PubMed

Whitworth, S R; Bruce, D G; Starkstein, S E; Davis, W A; Davis, T M E; Bucks, R S

2016-12-01

To determine the contribution of lifetime major depressive disorder (L-MDD) and lifetime generalized anxiety disorder (L-GAD) to current psychological symptom severity, health behaviour and glycaemic control in type 2 diabetes. 1285 community-dwelling people with type 2 diabetes (Fremantle Diabetes Study Phase-II; FDS2) completed the PHQ-9 and Brief Life-Time Depression Scale (BLDS) to assess current and past MDD. The Generalized Anxiety Disorder Scale (GADS) and the Generalized Anxiety Disorder Scale-Lifetime (GAD-LT), designed for FDS2, assessed current and past anxiety. Data were analysed using analysis of covariance and multiple mediation models, controlling for age, gender, marital status, and diabetes duration. L-MDD and L-GAD were independently associated with more severe current depression (both P<0.001) and anxiety (both P<0.001) symptoms. Mediation models revealed that, through increasing the severity of current depressive symptoms, L-MDD was associated with higher HbA 1c and body mass index (BMI), greater likelihood of current smoking, and reduced self-monitoring of blood glucose (SMBG) (indirect regression path ab, all P<0.001). In combination, L-MDD+L-GAD additionally elevated the risk of higher HbA 1c and worse diabetes management, by increasing the severity of current depressive symptoms (indirect regression path ab, all P<0.001). Lifetime depression and anxiety increase risk of more severe psychological symptoms, hyperglycaemia, and difficulties with health behaviour in type 2 diabetes. Early screening for these disorders at diabetes diagnosis may be warranted to maximize long-term health outcomes. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

An Adaption Broadcast Radius-Based Code Dissemination Scheme for Low Energy Wireless Sensor Networks.

PubMed

Yu, Shidi; Liu, Xiao; Liu, Anfeng; Xiong, Naixue; Cai, Zhiping; Wang, Tian

2018-05-10

Due to the Software Defined Network (SDN) technology, Wireless Sensor Networks (WSNs) are getting wider application prospects for sensor nodes that can get new functions after updating program codes. The issue of disseminating program codes to every node in the network with minimum delay and energy consumption have been formulated and investigated in the literature. The minimum-transmission broadcast (MTB) problem, which aims to reduce broadcast redundancy, has been well studied in WSNs where the broadcast radius is assumed to be fixed in the whole network. In this paper, an Adaption Broadcast Radius-based Code Dissemination (ABRCD) scheme is proposed to reduce delay and improve energy efficiency in duty cycle-based WSNs. In the ABCRD scheme, a larger broadcast radius is set in areas with more energy left, generating more optimized performance than previous schemes. Thus: (1) with a larger broadcast radius, program codes can reach the edge of network from the source in fewer hops, decreasing the number of broadcasts and at the same time, delay. (2) As the ABRCD scheme adopts a larger broadcast radius for some nodes, program codes can be transmitted to more nodes in one broadcast transmission, diminishing the number of broadcasts. (3) The larger radius in the ABRCD scheme causes more energy consumption of some transmitting nodes, but radius enlarging is only conducted in areas with an energy surplus, and energy consumption in the hot-spots can be reduced instead due to some nodes transmitting data directly to sink without forwarding by nodes in the original hot-spot, thus energy consumption can almost reach a balance and network lifetime can be prolonged. The proposed ABRCD scheme first assigns a broadcast radius, which doesn’t affect the network lifetime, to nodes having different distance to the code source, then provides an algorithm to construct a broadcast backbone. In the end, a comprehensive performance analysis and simulation result shows that the proposed ABRCD scheme shows better performance in different broadcast situations. Compared to previous schemes, the transmission delay is reduced by 41.11~78.42%, the number of broadcasts is reduced by 36.18~94.27% and the energy utilization ratio is improved up to 583.42%, while the network lifetime can be prolonged up to 274.99%.

An Adaption Broadcast Radius-Based Code Dissemination Scheme for Low Energy Wireless Sensor Networks

PubMed Central

Yu, Shidi; Liu, Xiao; Cai, Zhiping; Wang, Tian

2018-01-01

Due to the Software Defined Network (SDN) technology, Wireless Sensor Networks (WSNs) are getting wider application prospects for sensor nodes that can get new functions after updating program codes. The issue of disseminating program codes to every node in the network with minimum delay and energy consumption have been formulated and investigated in the literature. The minimum-transmission broadcast (MTB) problem, which aims to reduce broadcast redundancy, has been well studied in WSNs where the broadcast radius is assumed to be fixed in the whole network. In this paper, an Adaption Broadcast Radius-based Code Dissemination (ABRCD) scheme is proposed to reduce delay and improve energy efficiency in duty cycle-based WSNs. In the ABCRD scheme, a larger broadcast radius is set in areas with more energy left, generating more optimized performance than previous schemes. Thus: (1) with a larger broadcast radius, program codes can reach the edge of network from the source in fewer hops, decreasing the number of broadcasts and at the same time, delay. (2) As the ABRCD scheme adopts a larger broadcast radius for some nodes, program codes can be transmitted to more nodes in one broadcast transmission, diminishing the number of broadcasts. (3) The larger radius in the ABRCD scheme causes more energy consumption of some transmitting nodes, but radius enlarging is only conducted in areas with an energy surplus, and energy consumption in the hot-spots can be reduced instead due to some nodes transmitting data directly to sink without forwarding by nodes in the original hot-spot, thus energy consumption can almost reach a balance and network lifetime can be prolonged. The proposed ABRCD scheme first assigns a broadcast radius, which doesn’t affect the network lifetime, to nodes having different distance to the code source, then provides an algorithm to construct a broadcast backbone. In the end, a comprehensive performance analysis and simulation result shows that the proposed ABRCD scheme shows better performance in different broadcast situations. Compared to previous schemes, the transmission delay is reduced by 41.11~78.42%, the number of broadcasts is reduced by 36.18~94.27% and the energy utilization ratio is improved up to 583.42%, while the network lifetime can be prolonged up to 274.99%. PMID:29748525

A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks.

PubMed

Ogundile, Olayinka O; Alfa, Attahiru S

2017-05-10

Wireless sensor networks (WSNs) form an important part of industrial application. There has been growing interest in the potential use of WSNs in applications such as environment monitoring, disaster management, health care monitoring, intelligence surveillance and defence reconnaissance. In these applications, the sensor nodes (SNs) are envisaged to be deployed in sizeable numbers in an outlying area, and it is quite difficult to replace these SNs after complete deployment in many scenarios. Therefore, as SNs are predominantly battery powered devices, the energy consumption of the nodes must be properly managed in order to prolong the network lifetime and functionality to a rational time. Different energy-efficient and energy-balanced routing protocols have been proposed in literature over the years. The energy-efficient routing protocols strive to increase the network lifetime by minimizing the energy consumption in each SN. On the other hand, the energy-balanced routing protocols protract the network lifetime by uniformly balancing the energy consumption among the nodes in the network. There have been various survey papers put forward by researchers to review the performance and classify the different energy-efficient routing protocols for WSNs. However, there seems to be no clear survey emphasizing the importance, concepts, and principles of load-balanced energy routing protocols for WSNs. In this paper, we provide a clear picture of both the energy-efficient and energy-balanced routing protocols for WSNs. More importantly, this paper presents an extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols. A taxonomy is introduced in this paper to classify the surveyed energy-efficient and energy-balanced routing protocols based on their proposed mode of communication towards the base station (BS). In addition, we classified these routing protocols based on the solution types or algorithms, and the input decision variables defined in the routing algorithm. The strengths and weaknesses of the choice of the decision variables used in the design of these energy-efficient and energy-balanced routing protocols are emphasised. Finally, we suggest possible research directions in order to optimize the energy consumption in sensor networks.

Enhancing Electrophoretic Display Lifetime: Thiol-Polybutadiene Evaporation Barrier Property Response to Network Microstructure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cook, Caitlyn Christian

An evaporation barrier is required to enhance the lifetime of electrophoretic deposition (EPD) displays. As EPD functions on the basis of reversible deposition and resuspension of colloids suspended in a solvent, evaporation of the solvent ultimately leads to device failure. Incorporation of a thiol-polybutadiene elastomer into EPD displays enabled display lifetime surpassing six months in counting and catalyzed rigid display transition into a flexible package. Final flexible display transition to mass production compels an electronic-ink approach to encapsulate display suspension within an elastomer shell. Final thiol-polybutadiene photosensitive resin network microstructure was idealized to be dense, homogeneous, and expose an elasticmore » response to deformation. Research at hand details an approach to understanding microstructural change within display elastomers. Polybutadiene-based resin properties are modified via polymer chain structure, with and without added aromatic urethane methacrylate difunctionality, and in measuring network response to variation in thiol and initiator concentration. Dynamic mechanical analysis results signify that cross-linked segments within a difunctionalized polybutadiene network were on average eight times more elastically active than that of linked segments within a non-functionalized polybutadiene network. Difunctionalized polybutadiene samples also showed a 2.5 times greater maximum elastic modulus than non-functionalized samples. Hybrid polymer composed of both polybutadiene chains encompassed TE-2000 stiffness and B-1000 elasticity for use in encapsulating display suspension. Later experiments measured kinetic and rheological response due to alteration in dithiol cross-linker chain length via real time Fourier transform infrared spectroscopy and real-time dynamic rheology. Distinct differences were discovered between dithiol resin systems, as maximum thiol conversion achieved in short and long chain length dithiols was 86% and 11%, respectively. Oscillatory real-time rheological experiments confirmed a more uniform network to better dissipate applied shear in short chain length dithiol systems, as long chain length dithiols relayed a steep internal stress build-up due to less cross-links and chain entanglements. Thorough understanding of network formation aids the production of a stronger and impermeable elastomeric barrier for preservation of EPD displays.« less

A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks

PubMed Central

Ogundile, Olayinka O.; Alfa, Attahiru S.

2017-01-01

Wireless sensor networks (WSNs) form an important part of industrial application. There has been growing interest in the potential use of WSNs in applications such as environment monitoring, disaster management, health care monitoring, intelligence surveillance and defence reconnaissance. In these applications, the sensor nodes (SNs) are envisaged to be deployed in sizeable numbers in an outlying area, and it is quite difficult to replace these SNs after complete deployment in many scenarios. Therefore, as SNs are predominantly battery powered devices, the energy consumption of the nodes must be properly managed in order to prolong the network lifetime and functionality to a rational time. Different energy-efficient and energy-balanced routing protocols have been proposed in literature over the years. The energy-efficient routing protocols strive to increase the network lifetime by minimizing the energy consumption in each SN. On the other hand, the energy-balanced routing protocols protract the network lifetime by uniformly balancing the energy consumption among the nodes in the network. There have been various survey papers put forward by researchers to review the performance and classify the different energy-efficient routing protocols for WSNs. However, there seems to be no clear survey emphasizing the importance, concepts, and principles of load-balanced energy routing protocols for WSNs. In this paper, we provide a clear picture of both the energy-efficient and energy-balanced routing protocols for WSNs. More importantly, this paper presents an extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols. A taxonomy is introduced in this paper to classify the surveyed energy-efficient and energy-balanced routing protocols based on their proposed mode of communication towards the base station (BS). In addition, we classified these routing protocols based on the solution types or algorithms, and the input decision variables defined in the routing algorithm. The strengths and weaknesses of the choice of the decision variables used in the design of these energy-efficient and energy-balanced routing protocols are emphasised. Finally, we suggest possible research directions in order to optimize the energy consumption in sensor networks. PMID:28489054

Distributed Sensing and Processing: A Graphical Model Approach

DTIC Science & Technology

2005-11-30

that Ramanujan graph toplogies maximize the convergence rate of distributed detection consensus algorithms, improving over three orders of...small world type network designs. 14. SUBJECT TERMS Ramanujan graphs, sensor network topology, sensor network...that Ramanujan graphs, for which there are explicit algebraic constructions, have large eigenratios, converging much faster than structured graphs

Efficient Deployment of Key Nodes for Optimal Coverage of Industrial Mobile Wireless Networks

PubMed Central

Li, Xiaomin; Li, Di; Dong, Zhijie; Hu, Yage; Liu, Chengliang

2018-01-01

In recent years, industrial wireless networks (IWNs) have been transformed by the introduction of mobile nodes, and they now offer increased extensibility, mobility, and flexibility. Nevertheless, mobile nodes pose efficiency and reliability challenges. Efficient node deployment and management of channel interference directly affect network system performance, particularly for key node placement in clustered wireless networks. This study analyzes this system model, considering both industrial properties of wireless networks and their mobility. Then, static and mobile node coverage problems are unified and simplified to target coverage problems. We propose a novel strategy for the deployment of clustered heads in grouped industrial mobile wireless networks (IMWNs) based on the improved maximal clique model and the iterative computation of new candidate cluster head positions. The maximal cliques are obtained via a double-layer Tabu search. Each cluster head updates its new position via an improved virtual force while moving with full coverage to find the minimal inter-cluster interference. Finally, we develop a simulation environment. The simulation results, based on a performance comparison, show the efficacy of the proposed strategies and their superiority over current approaches. PMID:29439439

Achieving High Throughput for Data Transfer over ATM Networks

NASA Technical Reports Server (NTRS)

Johnson, Marjory J.; Townsend, Jeffrey N.

1996-01-01

File-transfer rates for ftp are often reported to be relatively slow, compared to the raw bandwidth available in emerging gigabit networks. While a major bottleneck is disk I/O, protocol issues impact performance as well. Ftp was developed and optimized for use over the TCP/IP protocol stack of the Internet. However, TCP has been shown to run inefficiently over ATM. In an effort to maximize network throughput, data-transfer protocols can be developed to run over UDP or directly over IP, rather than over TCP. If error-free transmission is required, techniques for achieving reliable transmission can be included as part of the transfer protocol. However, selected image-processing applications can tolerate a low level of errors in images that are transmitted over a network. In this paper we report on experimental work to develop a high-throughput protocol for unreliable data transfer over ATM networks. We attempt to maximize throughput by keeping the communications pipe full, but still keep packet loss under five percent. We use the Bay Area Gigabit Network Testbed as our experimental platform.

Maximal switchability of centralized networks

NASA Astrophysics Data System (ADS)

Vakulenko, Sergei; Morozov, Ivan; Radulescu, Ovidiu

2016-08-01

We consider continuous time Hopfield-like recurrent networks as dynamical models for gene regulation and neural networks. We are interested in networks that contain n high-degree nodes preferably connected to a large number of N s weakly connected satellites, a property that we call n/N s -centrality. If the hub dynamics is slow, we obtain that the large time network dynamics is completely defined by the hub dynamics. Moreover, such networks are maximally flexible and switchable, in the sense that they can switch from a globally attractive rest state to any structurally stable dynamics when the response time of a special controller hub is changed. In particular, we show that a decrease of the controller hub response time can lead to a sharp variation in the network attractor structure: we can obtain a set of new local attractors, whose number can increase exponentially with N, the total number of nodes of the nework. These new attractors can be periodic or even chaotic. We provide an algorithm, which allows us to design networks with the desired switching properties, or to learn them from time series, by adjusting the interactions between hubs and satellites. Such switchable networks could be used as models for context dependent adaptation in functional genetics or as models for cognitive functions in neuroscience.

The fourth dimension of life: fractal geometry and allometric scaling of organisms.

PubMed

West, G B; Brown, J H; Enquist, B J

1999-06-04

Fractal-like networks effectively endow life with an additional fourth spatial dimension. This is the origin of quarter-power scaling that is so pervasive in biology. Organisms have evolved hierarchical branching networks that terminate in size-invariant units, such as capillaries, leaves, mitochondria, and oxidase molecules. Natural selection has tended to maximize both metabolic capacity, by maximizing the scaling of exchange surface areas, and internal efficiency, by minimizing the scaling of transport distances and times. These design principles are independent of detailed dynamics and explicit models and should apply to virtually all organisms.

Sampling Based Influence Maximization on Linear Threshold Model

NASA Astrophysics Data System (ADS)

Jia, Su; Chen, Ling

2018-04-01

A sampling based influence maximization on linear threshold (LT) model method is presented. The method samples the routes in the possible worlds in the social networks, and uses Chernoff bound to estimate the number of samples so that the error can be constrained within a given bound. Then the active possibilities of the routes in the possible worlds are calculated, and are used to compute the influence spread of each node in the network. Our experimental results show that our method can effectively select appropriate seed nodes set that spreads larger influence than other similar methods.

Pore network extraction from pore space images of various porous media systems

NASA Astrophysics Data System (ADS)

Yi, Zhixing; Lin, Mian; Jiang, Wenbin; Zhang, Zhaobin; Li, Haishan; Gao, Jian

2017-04-01

Pore network extraction, which is defined as the transformation from irregular pore space to a simplified network in the form of pores connected by throats, is significant to microstructure analysis and network modeling. A physically realistic pore network is not only a representation of the pore space in the sense of topology and morphology, but also a good tool for predicting transport properties accurately. We present a method to extract pore network by employing the centrally located medial axis to guide the construction of maximal-balls-like skeleton where the pores and throats are defined and parameterized. To validate our method, various rock samples including sand pack, sandstones, and carbonates were used to extract pore networks. The pore structures were compared quantitatively with the structures extracted by medial axis method or maximal ball method. The predicted absolute permeability and formation factor were verified against the theoretical solutions obtained by lattice Boltzmann method and finite volume method, respectively. The two-phase flow was simulated through the networks extracted from homogeneous sandstones, and the generated relative permeability curves were compared with the data obtained from experimental method and other numerical models. The results show that the accuracy of our network is higher than that of other networks for predicting transport properties, so the presented method is more reliable for extracting physically realistic pore network.

Secure Multiuser Communications in Wireless Sensor Networks with TAS and Cooperative Jamming

PubMed Central

Yang, Maoqiang; Zhang, Bangning; Huang, Yuzhen; Yang, Nan; Guo, Daoxing; Gao, Bin

2016-01-01

In this paper, we investigate the secure transmission in wireless sensor networks (WSNs) consisting of one multiple-antenna base station (BS), multiple single-antenna legitimate users, one single-antenna eavesdropper and one multiple-antenna cooperative jammer. In an effort to reduce the scheduling complexity and extend the battery lifetime of the sensor nodes, the switch-and-stay combining (SSC) scheduling scheme is exploited over the sensor nodes. Meanwhile, transmit antenna selection (TAS) is employed at the BS and cooperative jamming (CJ) is adopted at the jammer node, aiming at achieving a satisfactory secrecy performance. Moreover, depending on whether the jammer node has the global channel state information (CSI) of both the legitimate channel and the eavesdropper’s channel, it explores a zero-forcing beamforming (ZFB) scheme or a null-space artificial noise (NAN) scheme to confound the eavesdropper while avoiding the interference to the legitimate user. Building on this, we propose two novel hybrid secure transmission schemes, termed TAS-SSC-ZFB and TAS-SSC-NAN, for WSNs. We then derive the exact closed-form expressions for the secrecy outage probability and the effective secrecy throughput of both schemes to characterize the secrecy performance. Using these closed-form expressions, we further determine the optimal switching threshold and obtain the optimal power allocation factor between the BS and jammer node for both schemes to minimize the secrecy outage probability, while the optimal secrecy rate is decided to maximize the effective secrecy throughput for both schemes. Numerical results are provided to verify the theoretical analysis and illustrate the impact of key system parameters on the secrecy performance. PMID:27845753

A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks

NASA Technical Reports Server (NTRS)

Bhaduri, Kanishka; Srivastava, Ashok N.

2009-01-01

This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining tasks in a distributed environment such as clustering, anomaly detection, target tracking to name a few. This technology is crucial for many emerging peer-to-peer applications for bioinformatics, astronomy, social networking, sensor networks and web mining. Centralizing all or some of the data for building global models is impractical in such peer-to-peer environments because of the large number of data sources, the asynchronous nature of the peer-to-peer networks, and dynamic nature of the data/network. The distributed algorithm we have developed in this paper is provably-correct i.e. it converges to the same result compared to a similar centralized algorithm and can automatically adapt to changes to the data and the network. We show that the communication overhead of the algorithm is very low due to its local nature. This monitoring algorithm is then used as a feedback loop to sample data from the network and rebuild the model when it is outdated. We present thorough experimental results to verify our theoretical claims.

Decompositions of large-scale biological systems based on dynamical properties.

PubMed

Soranzo, Nicola; Ramezani, Fahimeh; Iacono, Giovanni; Altafini, Claudio

2012-01-01

Given a large-scale biological network represented as an influence graph, in this article we investigate possible decompositions of the network aimed at highlighting specific dynamical properties. The first decomposition we study consists in finding a maximal directed acyclic subgraph of the network, which dynamically corresponds to searching for a maximal open-loop subsystem of the given system. Another dynamical property investigated is strong monotonicity. We propose two methods to deal with this property, both aimed at decomposing the system into strongly monotone subsystems, but with different structural characteristics: one method tends to produce a single large strongly monotone component, while the other typically generates a set of smaller disjoint strongly monotone subsystems. Original heuristics for the methods investigated are described in the article. altafini@sissa.it

A Race to the Top Scorecard: How the "Great Teachers and Leaders" Assurance Area Can Help States Maximize Their Odds of Winning a "Race to the Top" Grant

ERIC Educational Resources Information Center

National Council on Teacher Quality, 2009

2009-01-01

Most states are now working in earnest to respond to the U.S. Department of Education's invitation for applications for the $4.35 billion "Race to the Top" fund (RTT), described by Secretary Arne Duncan as a "once in a lifetime chance to change our schools." Although the Department is clear that states must articulate a coherent and comprehensive…

Life Extension Activities for the Hubble Space Telescope

NASA Technical Reports Server (NTRS)

Walyus, Keith D.; Pepe, Joyce A. K.; Prior, Michael

2004-01-01

With the cancellation of the Hubble Space Telescope (HST) Servicing Mission 4 (SM4), the HST Project will face numerous challenges to keep the Telescope operating during the remainder of the decade. As part of the SM4, the HST Project had planned to install various upgrades to the Telescope including the installation of new batteries and new rate integrating gyros. Without these upgrades, reliability analysis indicates that the spacecraft will lose the capability to conduct science operations later this decade. The HST team will be severely challenged to maximize the Telescope's remaining operational lifetime, while still trying to maximize - its science output and quality. Two of the biggest areas of concern are the age and condition of the batteries and gyros. Together they offer the largest potential extension in Telescope lifetime and present the biggest challenges to the HST team. The six Ni-H batteries on HST are the original batteries from launch. With fourteen years of operational life, these batteries have collectively lasted longer than any other comparable mission. Yet as with all batteries, their capacity has been declining. Engineers are examining various methods to prolong the life of these mission critical batteries, and retard the rate of degradation. This paper will focus on these and other efforts to prolong the life of the HST, thus enabling it to remain a world-class observatory for as long as possible.

A modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments

NASA Astrophysics Data System (ADS)

Ebrahimi Zade, Amir; Sadegheih, Ahmad; Lotfi, Mohammad Mehdi

2014-07-01

Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and variables. Also, uncertain shipments are studied in the context of hub maximal covering problems. In many real-world applications, any link on the path from origin to destination may fail to work due to disruption. Therefore, in the proposed bi-objective model, maximizing safety of the weakest path in the network is considered as the second objective together with the traditional maximum coverage goal. Furthermore, to solve the bi-objective model, a modified version of NSGA-II with a new dynamic immigration operator is developed in which the accurate number of immigrants depends on the results of the other two common NSGA-II operators, i.e. mutation and crossover. Besides validating proposed models, computational results confirm a better performance of modified NSGA-II versus traditional one.

Use of Groundwater Lifetime Expectancy for the Performance Assessment of Deep Geologic Radioactive Waste Repositories.

NASA Astrophysics Data System (ADS)

Cornaton, F.; Park, Y.; Normani, S.; Sudicky, E.; Sykes, J.

2005-12-01

Long-term solutions for the disposal of toxic wastes usually involve isolation of the wastes in a deep subsurface geologic environment. In the case of spent nuclear fuel, the safety of the host repository depends on two main barriers: the engineered barrier and the natural geological barrier. If radionuclide leakage occurs from the engineered barrier, the geological medium represents the ultimate barrier that is relied upon to ensure safety. Consequently, an evaluation of radionuclide travel times from the repository to the biosphere is critically important in a performance assessment analysis. In this study, we develop a travel time framework based on the concept of groundwater lifetime expectancy as a safety indicator. Lifetime expectancy characterizes the time radionuclides will spend in the subsurface after their release from the repository and prior to discharging into the biosphere. The probability density function of lifetime expectancy is computed throughout the host rock by solving the backward-in-time solute transport equation subject to a properly posed set of boundary conditions. It can then be used to define optimal repository locations. In a second step, the risk associated with selected sites can be evaluated by simulating an appropriate contaminant release history. The proposed methodology is applied in the context of a typical Canadian Shield environment. Based on a statistically-generated three-dimension network of fracture zones embedded in the granitic host rock, the sensitivity and the uncertainty of lifetime expectancy to the hydraulic and dispersive properties of the fracture network, including the impact of conditioning via their surface expressions, is computed in order to demonstrate the utility of the methodology.

Social networking technology, social network composition, and reductions in substance use among homeless adolescents.

PubMed

Rice, Eric; Milburn, Norweeta G; Monro, William

2011-03-01

Peer-based prevention programs for homeless youth are complicated by the potential for reinforcing high-risk behaviors among participants. The goal of this study is to understand how homeless youth could be linked to positive peers in prevention programming by understanding where in social and physical space positive peers for homeless youth are located, how these ties are associated with substance use, and the role of social networking technologies (e.g., internet and cell phones) in this process. Personal social network data were collected from 136 homeless adolescents in Los Angeles, CA. Respondents reported on composition of their social networks with respect to: home-based peers and parents (accessed via social networking technology; e.g., the internet, cell phone, texting), homeless peers and agency staff (accessed face-to-face) and whether or not network members were substance-using or non-substance-using. Associations between respondent's lifetime cocaine, heroin, and methamphetamine use and recent (previous 30 days) alcohol and marijuana use were assessed by the number of non-substance-using versus substance-using ties in multivariate linear regression models. 43% of adolescents reported a non-substance-using home-based tie. More of these ties were associated with less recent alcohol use. 62% of adolescents reported a substance-using homeless tie. More of these ties were associated with more recent marijuana use as well as more lifetime heroin and methamphetamine use. For homeless youth, who are physically disconnected from positive peers, social networking technologies can be used to facilitate the sorts of positive social ties that effective peer-based prevention programs require.

FTUC: A Flooding Tree Uneven Clustering Protocol for a Wireless Sensor Network.

PubMed

He, Wei; Pillement, Sebastien; Xu, Du

2017-11-23

Clustering is an efficient approach in a wireless sensor network (WSN) to reduce the energy consumption of nodes and to extend the lifetime of the network. Unfortunately, this approach requires that all cluster heads (CHs) transmit their data to the base station (BS), which gives rise to the long distance communications problem, and in multi-hop routing, the CHs near the BS have to forward data from other nodes that lead those CHs to die prematurely, creating the hot zones problem. Unequal clustering has been proposed to solve these problems. Most of the current algorithms elect CH only by considering their competition radius, leading to unevenly distributed cluster heads. Furthermore, global distances values are needed when calculating the competition radius, which is a tedious task in large networks. To face these problems, we propose a flooding tree uneven clustering protocol (FTUC) suited for large networks. Based on the construction of a tree type sub-network to calculate the minimum and maximum distances values of the network, we then apply the unequal cluster theory. We also introduce referenced position circles to evenly elect cluster heads. Therefore, cluster heads are elected depending on the node's residual energy and their distance to a referenced circle. FTUC builds the best inter-cluster communications route by evaluating a cluster head cost function to find the best next hop to the BS. The simulation results show that the FTUC algorithm decreases the energy consumption of the nodes and balances the global energy consumption effectively, thus extending the lifetime of the network.

Teaching Gateways and Bridges To Rank Broadcast Messages for Educational Networks.

ERIC Educational Resources Information Center

Losee, Robert M., Jr.

Messages entering an educational information distribution network may be ranked for an ordered introduction into the network to maximize the timeliness of message arrivals over the set of users. Electronic mail, EDI documents, and broadcast news may be ranked by the users who choose to examine those messages of interest or benefit to themselves.…

Conjunctive management of multi-reservoir network system and groundwater system

NASA Astrophysics Data System (ADS)

Mani, A.; Tsai, F. T. C.

2015-12-01

This study develops a successive mixed-integer linear fractional programming (successive MILFP) method to conjunctively manage water resources provided by a multi-reservoir network system and a groundwater system. The conjunctive management objectives are to maximize groundwater withdrawals and maximize reservoir storages while satisfying water demands and raising groundwater level to a target level. The decision variables in the management problem are reservoir releases and spills, network flows and groundwater pumping rates. Using the fractional programming approach, the objective function is defined as a ratio of total groundwater withdraws to total reservoir storage deficits from the maximum storages. Maximizing this ratio function tends to maximizing groundwater use and minimizing surface water use. This study introduces a conditional constraint on groundwater head in order to sustain aquifers from overpumping: if current groundwater level is less than a target level, groundwater head at the next time period has to be raised; otherwise, it is allowed to decrease up to a certain extent. This conditional constraint is formulated into a set of mixed binary nonlinear constraints and results in a mixed-integer nonlinear fractional programming (MINLFP) problem. To solve the MINLFP problem, we first use the response matrix approach to linearize groundwater head with respect to pumping rate and reduce the problem to an MILFP problem. Using the Charnes-Cooper transformation, the MILFP is transformed to an equivalent mixed-integer linear programming (MILP). The solution of the MILP is successively updated by updating the response matrix in every iteration. The study uses IBM CPLEX to solve the MILP problem. The methodology is applied to water resources management in northern Louisiana. This conjunctive management approach aims to recover the declining groundwater level of the stressed Sparta aquifer by using surface water from a network of four reservoirs as an alternative source of supply.

Statistical mechanics of influence maximization with thermal noise

NASA Astrophysics Data System (ADS)

Lynn, Christopher W.; Lee, Daniel D.

2017-03-01

The problem of optimally distributing a budget of influence among individuals in a social network, known as influence maximization, has typically been studied in the context of contagion models and deterministic processes, which fail to capture stochastic interactions inherent in real-world settings. Here, we show that by introducing thermal noise into influence models, the dynamics exactly resemble spins in a heterogeneous Ising system. In this way, influence maximization in the presence of thermal noise has a natural physical interpretation as maximizing the magnetization of an Ising system given a budget of external magnetic field. Using this statistical mechanical formulation, we demonstrate analytically that for small external-field budgets, the optimal influence solutions exhibit a highly non-trivial temperature dependence, focusing on high-degree hub nodes at high temperatures and on easily influenced peripheral nodes at low temperatures. For the general problem, we present a projected gradient ascent algorithm that uses the magnetic susceptibility to calculate locally optimal external-field distributions. We apply our algorithm to synthetic and real-world networks, demonstrating that our analytic results generalize qualitatively. Our work establishes a fruitful connection with statistical mechanics and demonstrates that influence maximization depends crucially on the temperature of the system, a fact that has not been appreciated by existing research.

Pricing Resources in LTE Networks through Multiobjective Optimization

PubMed Central

Lai, Yung-Liang; Jiang, Jehn-Ruey

2014-01-01

The LTE technology offers versatile mobile services that use different numbers of resources. This enables operators to provide subscribers or users with differential quality of service (QoS) to boost their satisfaction. On one hand, LTE operators need to price the resources high for maximizing their profits. On the other hand, pricing also needs to consider user satisfaction with allocated resources and prices to avoid “user churn,” which means subscribers will unsubscribe services due to dissatisfaction with allocated resources or prices. In this paper, we study the pricing resources with profits and satisfaction optimization (PRPSO) problem in the LTE networks, considering the operator profit and subscribers' satisfaction at the same time. The problem is modelled as nonlinear multiobjective optimization with two optimal objectives: (1) maximizing operator profit and (2) maximizing user satisfaction. We propose to solve the problem based on the framework of the NSGA-II. Simulations are conducted for evaluating the proposed solution. PMID:24526889

Pricing resources in LTE networks through multiobjective optimization.

PubMed

Lai, Yung-Liang; Jiang, Jehn-Ruey

2014-01-01

The LTE technology offers versatile mobile services that use different numbers of resources. This enables operators to provide subscribers or users with differential quality of service (QoS) to boost their satisfaction. On one hand, LTE operators need to price the resources high for maximizing their profits. On the other hand, pricing also needs to consider user satisfaction with allocated resources and prices to avoid "user churn," which means subscribers will unsubscribe services due to dissatisfaction with allocated resources or prices. In this paper, we study the pricing resources with profits and satisfaction optimization (PRPSO) problem in the LTE networks, considering the operator profit and subscribers' satisfaction at the same time. The problem is modelled as nonlinear multiobjective optimization with two optimal objectives: (1) maximizing operator profit and (2) maximizing user satisfaction. We propose to solve the problem based on the framework of the NSGA-II. Simulations are conducted for evaluating the proposed solution.

Wireless Sensor Network-Based Service Provisioning by a Brokering Platform

PubMed Central

Guijarro, Luis; Pla, Vicent; Vidal, Jose R.; Naldi, Maurizio; Mahmoodi, Toktam

2017-01-01

This paper proposes a business model for providing services based on the Internet of Things through a platform that intermediates between human users and Wireless Sensor Networks (WSNs). The platform seeks to maximize its profit through posting both the price charged to each user and the price paid to each WSN. A complete analysis of the profit maximization problem is performed in this paper. We show that the service provider maximizes its profit by incentivizing all users and all Wireless Sensor Infrastructure Providers (WSIPs) to join the platform. This is true not only when the number of users is high, but also when it is moderate, provided that the costs that the users bear do not trespass a cost ceiling. This cost ceiling depends on the number of WSIPs, on the value of the intrinsic value of the service and on the externality that the WSIP has on the user utility. PMID:28498347

Wireless Sensor Network-Based Service Provisioning by a Brokering Platform.

PubMed

Guijarro, Luis; Pla, Vicent; Vidal, Jose R; Naldi, Maurizio; Mahmoodi, Toktam

2017-05-12

This paper proposes a business model for providing services based on the Internet of Things through a platform that intermediates between human users and Wireless Sensor Networks (WSNs). The platform seeks to maximize its profit through posting both the price charged to each user and the price paid to each WSN. A complete analysis of the profit maximization problem is performed in this paper. We show that the service provider maximizes its profit by incentivizing all users and all Wireless Sensor Infrastructure Providers (WSIPs) to join the platform. This is true not only when the number of users is high, but also when it is moderate, provided that the costs that the users bear do not trespass a cost ceiling. This cost ceiling depends on the number of WSIPs, on the value of the intrinsic value of the service and on the externality that the WSIP has on the user utility.

Network Modeling and Energy-Efficiency Optimization for Advanced Machine-to-Machine Sensor Networks

PubMed Central

Jung, Sungmo; Kim, Jong Hyun; Kim, Seoksoo

2012-01-01

Wireless machine-to-machine sensor networks with multiple radio interfaces are expected to have several advantages, including high spatial scalability, low event detection latency, and low energy consumption. Here, we propose a network model design method involving network approximation and an optimized multi-tiered clustering algorithm that maximizes node lifespan by minimizing energy consumption in a non-uniformly distributed network. Simulation results show that the cluster scales and network parameters determined with the proposed method facilitate a more efficient performance compared to existing methods. PMID:23202190

Open-WiSe: a solar powered wireless sensor network platform.

PubMed

González, Apolinar; Aquino, Raúl; Mata, Walter; Ochoa, Alberto; Saldaña, Pedro; Edwards, Arthur

2012-01-01

Because battery-powered nodes are required in wireless sensor networks and energy consumption represents an important design consideration, alternate energy sources are needed to provide more effective and optimal function. The main goal of this work is to present an energy harvesting wireless sensor network platform, the Open Wireless Sensor node (WiSe). The design and implementation of the solar powered wireless platform is described including the hardware architecture, firmware, and a POSIX Real-Time Kernel. A sleep and wake up strategy was implemented to prolong the lifetime of the wireless sensor network. This platform was developed as a tool for researchers investigating Wireless sensor network or system integrators.

Control of amplitude chimeras by time delay in oscillator networks

NASA Astrophysics Data System (ADS)

Gjurchinovski, Aleksandar; Schöll, Eckehard; Zakharova, Anna

2017-04-01

We investigate the influence of time-delayed coupling in a ring network of nonlocally coupled Stuart-Landau oscillators upon chimera states, i.e., space-time patterns with coexisting partially coherent and partially incoherent domains. We focus on amplitude chimeras, which exhibit incoherent behavior with respect to the amplitude rather than the phase and are transient patterns, and we show that their lifetime can be significantly enhanced by coupling delay. To characterize their transition to phase-lag synchronization (coherent traveling waves) and other coherent structures, we generalize the Kuramoto order parameter. Contrasting the results for instantaneous coupling with those for constant coupling delay, for time-varying delay, and for distributed-delay coupling, we demonstrate that the lifetime of amplitude chimera states and related partially incoherent states can be controlled, i.e., deliberately reduced or increased, depending upon the type of coupling delay.

Network efficient power control for wireless communication systems.

PubMed

Campos-Delgado, Daniel U; Luna-Rivera, Jose Martin; Martinez-Sánchez, C J; Gutierrez, Carlos A; Tecpanecatl-Xihuitl, J L

2014-01-01

We introduce a two-loop power control that allows an efficient use of the overall power resources for commercial wireless networks based on cross-layer optimization. This approach maximizes the network's utility in the outer-loop as a function of the averaged signal to interference-plus-noise ratio (SINR) by considering adaptively the changes in the network characteristics. For this purpose, the concavity property of the utility function was verified with respect to the SINR, and an iterative search was proposed with guaranteed convergence. In addition, the outer-loop is in charge of selecting the detector that minimizes the overall power consumption (transmission and detection). Next the inner-loop implements a feedback power control in order to achieve the optimal SINR in the transmissions despite channel variations and roundtrip delays. In our proposal, the utility maximization process and detector selection and feedback power control are decoupled problems, and as a result, these strategies are implemented at two different time scales in the two-loop framework. Simulation results show that substantial utility gains may be achieved by improving the power management in the wireless network.

Network Efficient Power Control for Wireless Communication Systems

PubMed Central

Campos-Delgado, Daniel U.; Luna-Rivera, Jose Martin; Martinez-Sánchez, C. J.; Gutierrez, Carlos A.; Tecpanecatl-Xihuitl, J. L.

2014-01-01

We introduce a two-loop power control that allows an efficient use of the overall power resources for commercial wireless networks based on cross-layer optimization. This approach maximizes the network's utility in the outer-loop as a function of the averaged signal to interference-plus-noise ratio (SINR) by considering adaptively the changes in the network characteristics. For this purpose, the concavity property of the utility function was verified with respect to the SINR, and an iterative search was proposed with guaranteed convergence. In addition, the outer-loop is in charge of selecting the detector that minimizes the overall power consumption (transmission and detection). Next the inner-loop implements a feedback power control in order to achieve the optimal SINR in the transmissions despite channel variations and roundtrip delays. In our proposal, the utility maximization process and detector selection and feedback power control are decoupled problems, and as a result, these strategies are implemented at two different time scales in the two-loop framework. Simulation results show that substantial utility gains may be achieved by improving the power management in the wireless network. PMID:24683350

Coverage maximization under resource constraints using a nonuniform proliferating random walk.

PubMed

Saha, Sudipta; Ganguly, Niloy

2013-02-01

Information management services on networks, such as search and dissemination, play a key role in any large-scale distributed system. One of the most desirable features of these services is the maximization of the coverage, i.e., the number of distinctly visited nodes under constraints of network resources as well as time. However, redundant visits of nodes by different message packets (modeled, e.g., as walkers) initiated by the underlying algorithms for these services cause wastage of network resources. In this work, using results from analytical studies done in the past on a K-random-walk-based algorithm, we identify that redundancy quickly increases with an increase in the density of the walkers. Based on this postulate, we design a very simple distributed algorithm which dynamically estimates the density of the walkers and thereby carefully proliferates walkers in sparse regions. We use extensive computer simulations to test our algorithm in various kinds of network topologies whereby we find it to be performing particularly well in networks that are highly clustered as well as sparse.

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks.

PubMed

Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa

2017-05-16

In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks.

Simultaneous Wireless Power Transfer and Secure Multicasting in Cooperative Decode-and-Forward Relay Networks

PubMed Central

Lee, Jong-Ho; Sohn, Illsoo; Kim, Yong-Hwa

2017-01-01

In this paper, we investigate simultaneous wireless power transfer and secure multicasting via cooperative decode-and-forward (DF) relays in the presence of multiple energy receivers and eavesdroppers. Two scenarios are considered under a total power budget: maximizing the minimum harvested energy among the energy receivers under a multicast secrecy rate constraint; and maximizing the multicast secrecy rate under a minimum harvested energy constraint. For both scenarios, we solve the transmit power allocation and relay beamformer design problems by using semidefinite relaxation and bisection technique. We present numerical results to analyze the energy harvesting and secure multicasting performances in cooperative DF relay networks. PMID:28509841

Bioengineering and Coordination of Regulatory Networks and Intracellular Complexes to Maximize Hydrogen Production by Phototrophic Microorganisms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tabita, F. Robert

2013-07-30

In this study, the Principal Investigator, F.R. Tabita has teamed up with J. C. Liao from UCLA. This project's main goal is to manipulate regulatory networks in phototrophic bacteria to affect and maximize the production of large amounts of hydrogen gas under conditions where wild-type organisms are constrained by inherent regulatory mechanisms from allowing this to occur. Unrestrained production of hydrogen has been achieved and this will allow for the potential utilization of waste materials as a feed stock to support hydrogen production. By further understanding the means by which regulatory networks interact, this study will seek to maximize themore » ability of currently available “unrestrained” organisms to produce hydrogen. The organisms to be utilized in this study, phototrophic microorganisms, in particular nonsulfur purple (NSP) bacteria, catalyze many significant processes including the assimilation of carbon dioxide into organic carbon, nitrogen fixation, sulfur oxidation, aromatic acid degradation, and hydrogen oxidation/evolution. Moreover, due to their great metabolic versatility, such organisms highly regulate these processes in the cell and since virtually all such capabilities are dispensable, excellent experimental systems to study aspects of molecular control and biochemistry/physiology are available.« less

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks.

PubMed

Teng, Xian; Pei, Sen; Morone, Flaviano; Makse, Hernán A

2016-10-26

Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called "Collective Influence (CI)" has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes' significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in various social and scientific platforms including American Physical Society, Facebook, Twitter and LiveJournal. Since empirical data cannot be directly mapped to ideal multi-source spreading, we leverage the behavioral patterns of users extracted from data to construct "virtual" information spreading processes. Our results demonstrate that the set of spreaders selected by CI can induce larger scale of information propagation. Moreover, local measures as the number of connections or citations are not necessarily the deterministic factors of nodes' importance in realistic information spreading. This result has significance for rankings scientists in scientific networks like the APS, where the commonly used number of citations can be a poor indicator of the collective influence of authors in the community.

Maximization of the Supportable Number of Sensors in QoS-Aware Cluster-Based Underwater Acoustic Sensor Networks

PubMed Central

Nguyen, Thi-Tham; Van Le, Duc; Yoon, Seokhoon

2014-01-01

This paper proposes a practical low-complexity MAC (medium access control) scheme for quality of service (QoS)-aware and cluster-based underwater acoustic sensor networks (UASN), in which the provision of differentiated QoS is required. In such a network, underwater sensors (U-sensor) in a cluster are divided into several classes, each of which has a different QoS requirement. The major problem considered in this paper is the maximization of the number of nodes that a cluster can accommodate while still providing the required QoS for each class in terms of the PDR (packet delivery ratio). In order to address the problem, we first estimate the packet delivery probability (PDP) and use it to formulate an optimization problem to determine the optimal value of the maximum packet retransmissions for each QoS class. The custom greedy and interior-point algorithms are used to find the optimal solutions, which are verified by extensive simulations. The simulation results show that, by solving the proposed optimization problem, the supportable number of underwater sensor nodes can be maximized while satisfying the QoS requirements for each class. PMID:24608009

Maximization of the supportable number of sensors in QoS-aware cluster-based underwater acoustic sensor networks.

PubMed

Nguyen, Thi-Tham; Le, Duc Van; Yoon, Seokhoon

2014-03-07

This paper proposes a practical low-complexity MAC (medium access control) scheme for quality of service (QoS)-aware and cluster-based underwater acoustic sensor networks (UASN), in which the provision of differentiated QoS is required. In such a network, underwater sensors (U-sensor) in a cluster are divided into several classes, each of which has a different QoS requirement. The major problem considered in this paper is the maximization of the number of nodes that a cluster can accommodate while still providing the required QoS for each class in terms of the PDR (packet delivery ratio). In order to address the problem, we first estimate the packet delivery probability (PDP) and use it to formulate an optimization problem to determine the optimal value of the maximum packet retransmissions for each QoS class. The custom greedy and interior-point algorithms are used to find the optimal solutions, which are verified by extensive simulations. The simulation results show that, by solving the proposed optimization problem, the supportable number of underwater sensor nodes can be maximized while satisfying the QoS requirements for each class.

Integrated design of multivariable hydrometric networks using entropy theory with a multiobjective optimization approach

NASA Astrophysics Data System (ADS)

Kim, Y.; Hwang, T.; Vose, J. M.; Martin, K. L.; Band, L. E.

2016-12-01

Obtaining quality hydrologic observations is the first step towards a successful water resources management. While remote sensing techniques have enabled to convert satellite images of the Earth's surface to hydrologic data, the importance of ground-based observations has never been diminished because in-situ data are often highly accurate and can be used to validate remote measurements. The existence of efficient hydrometric networks is becoming more important to obtain as much as information with minimum redundancy. The World Meteorological Organization (WMO) has recommended a guideline for the minimum hydrometric network density based on physiography; however, this guideline is not for the optimum network design but for avoiding serious deficiency from a network. Moreover, all hydrologic variables are interconnected within the hydrologic cycle, while monitoring networks have been designed individually. This study proposes an integrated network design method using entropy theory with a multiobjective optimization approach. In specific, a precipitation and a streamflow networks in a semi-urban watershed in Ontario, Canada were designed simultaneously by maximizing joint entropy, minimizing total correlation, and maximizing conditional entropy of streamflow network given precipitation network. After comparing with the typical individual network designs, the proposed design method would be able to determine more efficient optimal networks by avoiding the redundant stations, in which hydrologic information is transferable. Additionally, four quantization cases were applied in entropy calculations to assess their implications on the station rankings and the optimal networks. The results showed that the selection of quantization method should be considered carefully because the rankings and optimal networks are subject to change accordingly.

Integrated design of multivariable hydrometric networks using entropy theory with a multiobjective optimization approach

NASA Astrophysics Data System (ADS)

Keum, J.; Coulibaly, P. D.

2017-12-01

Obtaining quality hydrologic observations is the first step towards a successful water resources management. While remote sensing techniques have enabled to convert satellite images of the Earth's surface to hydrologic data, the importance of ground-based observations has never been diminished because in-situ data are often highly accurate and can be used to validate remote measurements. The existence of efficient hydrometric networks is becoming more important to obtain as much as information with minimum redundancy. The World Meteorological Organization (WMO) has recommended a guideline for the minimum hydrometric network density based on physiography; however, this guideline is not for the optimum network design but for avoiding serious deficiency from a network. Moreover, all hydrologic variables are interconnected within the hydrologic cycle, while monitoring networks have been designed individually. This study proposes an integrated network design method using entropy theory with a multiobjective optimization approach. In specific, a precipitation and a streamflow networks in a semi-urban watershed in Ontario, Canada were designed simultaneously by maximizing joint entropy, minimizing total correlation, and maximizing conditional entropy of streamflow network given precipitation network. After comparing with the typical individual network designs, the proposed design method would be able to determine more efficient optimal networks by avoiding the redundant stations, in which hydrologic information is transferable. Additionally, four quantization cases were applied in entropy calculations to assess their implications on the station rankings and the optimal networks. The results showed that the selection of quantization method should be considered carefully because the rankings and optimal networks are subject to change accordingly.

Correlation of ion and beam current densities in Kaufman thrusters.

NASA Technical Reports Server (NTRS)

Wilbur, P. J.

1973-01-01

In the absence of direct impingement erosion, electrostatic thruster accelerator grid lifetime is defined by the charge exchange erosion that occurs at peak values of the ion beam current density. In order to maximize the thrust from an engine with a specified grid lifetime, the ion beam current density profile should therefore be as flat as possible. Knauer (1970) has suggested this can be achieved by establishing a radial plasma uniformity within the thruster discharge chamber; his tests with the radial field thruster provide an example of uniform plasma properties within the chamber and a flat ion beam profile occurring together. It is shown that, in particular, the ion density profile within the chamber determines the beam current density profile, and that a uniform ion density profile at the screen grid end of the discharge chamber should lead to a flat beam current density profile.

Energy-Efficient Cognitive Radio Sensor Networks: Parametric and Convex Transformations

PubMed Central

Naeem, Muhammad; Illanko, Kandasamy; Karmokar, Ashok; Anpalagan, Alagan; Jaseemuddin, Muhammad

2013-01-01

Designing energy-efficient cognitive radio sensor networks is important to intelligently use battery energy and to maximize the sensor network life. In this paper, the problem of determining the power allocation that maximizes the energy-efficiency of cognitive radio-based wireless sensor networks is formed as a constrained optimization problem, where the objective function is the ratio of network throughput and the network power. The proposed constrained optimization problem belongs to a class of nonlinear fractional programming problems. Charnes-Cooper Transformation is used to transform the nonlinear fractional problem into an equivalent concave optimization problem. The structure of the power allocation policy for the transformed concave problem is found to be of a water-filling type. The problem is also transformed into a parametric form for which a ε-optimal iterative solution exists. The convergence of the iterative algorithms is proven, and numerical solutions are presented. The iterative solutions are compared with the optimal solution obtained from the transformed concave problem, and the effects of different system parameters (interference threshold level, the number of primary users and secondary sensor nodes) on the performance of the proposed algorithms are investigated. PMID:23966194

Game among interdependent networks: The impact of rationality on system robustness

NASA Astrophysics Data System (ADS)

Fan, Yuhang; Cao, Gongze; He, Shibo; Chen, Jiming; Sun, Youxian

2016-12-01

Many real-world systems are composed of interdependent networks that rely on one another. Such networks are typically designed and operated by different entities, who aim at maximizing their own payoffs. There exists a game among these entities when designing their own networks. In this paper, we study the game investigating how the rational behaviors of entities impact the system robustness. We first introduce a mathematical model to quantify the interacting payoffs among varying entities. Then we study the Nash equilibrium of the game and compare it with the optimal social welfare. We reveal that the cooperation among different entities can be reached to maximize the social welfare in continuous game only when the average degree of each network is constant. Therefore, the huge gap between Nash equilibrium and optimal social welfare generally exists. The rationality of entities makes the system inherently deficient and even renders it extremely vulnerable in some cases. We analyze our model for two concrete systems with continuous strategy space and discrete strategy space, respectively. Furthermore, we uncover some factors (such as weakening coupled strength of interdependent networks, designing a suitable topology dependence of the system) that help reduce the gap and the system vulnerability.

Adjacency Matrix-Based Transmit Power Allocation Strategies in Wireless Sensor Networks

PubMed Central

Consolini, Luca; Medagliani, Paolo; Ferrari, Gianluigi

2009-01-01

In this paper, we present an innovative transmit power control scheme, based on optimization theory, for wireless sensor networks (WSNs) which use carrier sense multiple access (CSMA) with collision avoidance (CA) as medium access control (MAC) protocol. In particular, we focus on schemes where several remote nodes send data directly to a common access point (AP). Under the assumption of finite overall network transmit power and low traffic load, we derive the optimal transmit power allocation strategy that minimizes the packet error rate (PER) at the AP. This approach is based on modeling the CSMA/CA MAC protocol through a finite state machine and takes into account the network adjacency matrix, depending on the transmit power distribution and determining the network connectivity. It will be then shown that the transmit power allocation problem reduces to a convex constrained minimization problem. Our results show that, under the assumption of low traffic load, the power allocation strategy, which guarantees minimal delay, requires the maximization of network connectivity, which can be equivalently interpreted as the maximization of the number of non-zero entries of the adjacency matrix. The obtained theoretical results are confirmed by simulations for unslotted Zigbee WSNs. PMID:22346705

Robust Rate Maximization for Heterogeneous Wireless Networks under Channel Uncertainties

PubMed Central

Xu, Yongjun; Hu, Yuan; Li, Guoquan

2018-01-01

Heterogeneous wireless networks are a promising technology in next generation wireless communication networks, which has been shown to efficiently reduce the blind area of mobile communication and improve network coverage compared with the traditional wireless communication networks. In this paper, a robust power allocation problem for a two-tier heterogeneous wireless networks is formulated based on orthogonal frequency-division multiplexing technology. Under the consideration of imperfect channel state information (CSI), the robust sum-rate maximization problem is built while avoiding sever cross-tier interference to macrocell user and maintaining the minimum rate requirement of each femtocell user. To be practical, both of channel estimation errors from the femtocells to the macrocell and link uncertainties of each femtocell user are simultaneously considered in terms of outage probabilities of users. The optimization problem is analyzed under no CSI feedback with some cumulative distribution function and partial CSI with Gaussian distribution of channel estimation error. The robust optimization problem is converted into the convex optimization problem which is solved by using Lagrange dual theory and subgradient algorithm. Simulation results demonstrate the effectiveness of the proposed algorithm by the impact of channel uncertainties on the system performance. PMID:29466315

Locating an imaging radar in Canada for identifying spaceborne objects

NASA Astrophysics Data System (ADS)

Schick, William G.

1992-12-01

This research presents a study of the maximal coverage p-median facility location problem as applied to the location of an imaging radar in Canada for imaging spaceborne objects. The classical mathematical formulation of the maximal coverage p-median problem is converted into network-flow with side constraint formulations that are developed using a scaled down version of the imaging radar location problem. Two types of network-flow with side constraint formulations are developed: a network using side constraints that simulates the gains in a generalized network; and a network resembling a multi-commodity flow problem that uses side constraints to force flow along identical arcs. These small formulations are expanded to encompass a case study using 12 candidate radar sites, and 48 satellites divided into three states. SAS/OR PROC NETFLOW was used to solve the network-flow with side constraint formulations. The case study show that potential for both formulations, although the simulated gains formulation encountered singular matrix computational difficulties as a result of the very organized nature of its side constraint matrix. The multi-commodity flow formulation, when combined with equi-distribution of flow constraints, provided solutions for various values of p, the number of facilities to be selected.

Visualizing deep neural network by alternately image blurring and deblurring.

PubMed

Wang, Feng; Liu, Haijun; Cheng, Jian

2018-01-01

Visualization from trained deep neural networks has drawn massive public attention in recent. One of the visualization approaches is to train images maximizing the activation of specific neurons. However, directly maximizing the activation would lead to unrecognizable images, which cannot provide any meaningful information. In this paper, we introduce a simple but effective technique to constrain the optimization route of the visualization. By adding two totally inverse transformations, image blurring and deblurring, to the optimization procedure, recognizable images can be created. Our algorithm is good at extracting the details in the images, which are usually filtered by previous methods in the visualizations. Extensive experiments on AlexNet, VGGNet and GoogLeNet illustrate that we can better understand the neural networks utilizing the knowledge obtained by the visualization. Copyright © 2017 Elsevier Ltd. All rights reserved.

Liposomal-Encapsulated Stroma-Free Hemoglobin as a Potential Blood Substitute.

DTIC Science & Technology

1980-01-02

circulating life-time even further. If all liposomes are taken up by RE cells, then when 14C- inulin is administered i.v. encapsulated in liposomes one should...of inulin would result only when liposomes become leaky or decompose before being taken up by cells. If liposomes are not maximally stable, then after...some time any liposome which had not been taken-up by RE cells would have decomposed and the released inulin excreted. We have used these facts to

Are Your Employees Retirement-Ready?

PubMed

Vorchheiner, Alan H; Zaleta, Cynthia O

2016-01-01

Much of the discussion on the decumulation phase of retirement savings has focused on the lack of any lifetime annuities. But there is a whole range of options sponsors can employ to facilitate the generation of retirement income and bolster financial wellness. As U.S. employers show no sign of substantially increasing spending on compensation or benefits, it is imperative that human resources professionals help employees--particularly the retiring baby boomers--to maximize what they have saved. This article presents five first-step ideas toward achieving that goal.

The Child and Adolescent Psychiatry Trials Network

ERIC Educational Resources Information Center

March, John S.; Silva, Susan G.; Compton, Scott; Anthony, Ginger; DeVeaugh-Geiss, Joseph; Califf, Robert; Krishnan, Ranga

2004-01-01

Objective: The current generation of clinical trials in pediatric psychiatry often fails to maximize clinical utility for practicing clinicians, thereby diluting its impact. Method: To attain maximum clinical relevance and acceptability, the Child and Adolescent Psychiatry Trials Network (CAPTN) will transport to pediatric psychiatry the practical…

Optimizing integrated luminosity of future hadron colliders

NASA Astrophysics Data System (ADS)

Benedikt, Michael; Schulte, Daniel; Zimmermann, Frank

2015-10-01

The integrated luminosity, a key figure of merit for any particle-physics collider, is closely linked to the peak luminosity and to the beam lifetime. The instantaneous peak luminosity of a collider is constrained by a number of boundary conditions, such as the available beam current, the maximum beam-beam tune shift with acceptable beam stability and reasonable luminosity lifetime (i.e., the empirical "beam-beam limit"), or the event pileup in the physics detectors. The beam lifetime at high-luminosity hadron colliders is largely determined by particle burn off in the collisions. In future highest-energy circular colliders synchrotron radiation provides a natural damping mechanism, which can be exploited for maximizing the integrated luminosity. In this article, we derive analytical expressions describing the optimized integrated luminosity, the corresponding optimum store length, and the time evolution of relevant beam parameters, without or with radiation damping, while respecting a fixed maximum value for the total beam-beam tune shift or for the event pileup in the detector. Our results are illustrated by examples for the proton-proton luminosity of the existing Large Hadron Collider (LHC) at its design parameters, of the High-Luminosity Large Hadron Collider (HL-LHC), and of the Future Circular Collider (FCC-hh).

Optimal synchronization of Kuramoto oscillators: A dimensional reduction approach

NASA Astrophysics Data System (ADS)

Pinto, Rafael S.; Saa, Alberto

2015-12-01

A recently proposed dimensional reduction approach for studying synchronization in the Kuramoto model is employed to build optimal network topologies to favor or to suppress synchronization. The approach is based in the introduction of a collective coordinate for the time evolution of the phase locked oscillators, in the spirit of the Ott-Antonsen ansatz. We show that the optimal synchronization of a Kuramoto network demands the maximization of the quadratic function ωTL ω , where ω stands for the vector of the natural frequencies of the oscillators and L for the network Laplacian matrix. Many recently obtained numerical results can be reobtained analytically and in a simpler way from our maximization condition. A computationally efficient hill climb rewiring algorithm is proposed to generate networks with optimal synchronization properties. Our approach can be easily adapted to the case of the Kuramoto models with both attractive and repulsive interactions, and again many recent numerical results can be rederived in a simpler and clearer analytical manner.

TCP throughput adaptation in WiMax networks using replicator dynamics.

PubMed

Anastasopoulos, Markos P; Petraki, Dionysia K; Kannan, Rajgopal; Vasilakos, Athanasios V

2010-06-01

The high-frequency segment (10-66 GHz) of the IEEE 802.16 standard seems promising for the implementation of wireless backhaul networks carrying large volumes of Internet traffic. In contrast to wireline backbone networks, where channel errors seldom occur, the TCP protocol in IEEE 802.16 Worldwide Interoperability for Microwave Access networks is conditioned exclusively by wireless channel impairments rather than by congestion. This renders a cross-layer design approach between the transport and physical layers more appropriate during fading periods. In this paper, an adaptive coding and modulation (ACM) scheme for TCP throughput maximization is presented. In the current approach, Internet traffic is modulated and coded employing an adaptive scheme that is mathematically equivalent to the replicator dynamics model. The stability of the proposed ACM scheme is proven, and the dependence of the speed of convergence on various physical-layer parameters is investigated. It is also shown that convergence to the strategy that maximizes TCP throughput may be further accelerated by increasing the amount of information from the physical layer.

Scalable detection of statistically significant communities and hierarchies, using message passing for modularity

PubMed Central

Zhang, Pan; Moore, Cristopher

2014-01-01

Modularity is a popular measure of community structure. However, maximizing the modularity can lead to many competing partitions, with almost the same modularity, that are poorly correlated with each other. It can also produce illusory ‘‘communities’’ in random graphs where none exist. We address this problem by using the modularity as a Hamiltonian at finite temperature and using an efficient belief propagation algorithm to obtain the consensus of many partitions with high modularity, rather than looking for a single partition that maximizes it. We show analytically and numerically that the proposed algorithm works all of the way down to the detectability transition in networks generated by the stochastic block model. It also performs well on real-world networks, revealing large communities in some networks where previous work has claimed no communities exist. Finally we show that by applying our algorithm recursively, subdividing communities until no statistically significant subcommunities can be found, we can detect hierarchical structure in real-world networks more efficiently than previous methods. PMID:25489096

Local excitation-inhibition ratio for synfire chain propagation in feed-forward neuronal networks

NASA Astrophysics Data System (ADS)

Guo, Xinmeng; Yu, Haitao; Wang, Jiang; Liu, Jing; Cao, Yibin; Deng, Bin

2017-09-01

A leading hypothesis holds that spiking activity propagates along neuronal sub-populations which are connected in a feed-forward manner, and the propagation efficiency would be affected by the dynamics of sub-populations. In this paper, how the interaction between local excitation and inhibition effects on synfire chain propagation in feed-forward network (FFN) is investigated. The simulation results show that there is an appropriate excitation-inhibition (EI) ratio maximizing the performance of synfire chain propagation. The optimal EI ratio can significantly enhance the selectivity of FFN to synchronous signals, which thereby increases the stability to background noise. Moreover, the effect of network topology on synfire chain propagation is also investigated. It is found that synfire chain propagation can be maximized by an optimal interlayer linking probability. We also find that external noise is detrimental to synchrony propagation by inducing spiking jitter. The results presented in this paper may provide insights into the effects of network dynamics on neuronal computations.

Sequential associative memory with nonuniformity of the layer sizes.

PubMed

Teramae, Jun-Nosuke; Fukai, Tomoki

2007-01-01

Sequence retrieval has a fundamental importance in information processing by the brain, and has extensively been studied in neural network models. Most of the previous sequential associative memory embedded sequences of memory patterns have nearly equal sizes. It was recently shown that local cortical networks display many diverse yet repeatable precise temporal sequences of neuronal activities, termed "neuronal avalanches." Interestingly, these avalanches displayed size and lifetime distributions that obey power laws. Inspired by these experimental findings, here we consider an associative memory model of binary neurons that stores sequences of memory patterns with highly variable sizes. Our analysis includes the case where the statistics of these size variations obey the above-mentioned power laws. We study the retrieval dynamics of such memory systems by analytically deriving the equations that govern the time evolution of macroscopic order parameters. We calculate the critical sequence length beyond which the network cannot retrieve memory sequences correctly. As an application of the analysis, we show how the present variability in sequential memory patterns degrades the power-law lifetime distribution of retrieved neural activities.

On the Minimization of Fluctuations in the Response Times of Autoregulatory Gene Networks

PubMed Central

Murugan, Rajamanickam; Kreiman, Gabriel

2011-01-01

The temporal dynamics of the concentrations of several proteins are tightly regulated, particularly for critical nodes in biological networks such as transcription factors. An important mechanism to control transcription factor levels is through autoregulatory feedback loops where the protein can bind its own promoter. Here we use theoretical tools and computational simulations to further our understanding of transcription-factor autoregulatory loops. We show that the stochastic dynamics of feedback and mRNA synthesis can significantly influence the speed of response of autoregulatory genetic networks toward external stimuli. The fluctuations in the response-times associated with the accumulation of the transcription factor in the presence of negative or positive autoregulation can be minimized by confining the ratio of mRNA/protein lifetimes within 1:10. This predicted range of mRNA/protein lifetime agrees with ranges observed empirically in prokaryotes and eukaryotes. The theory can quantitatively and systematically account for the influence of regulatory element binding and unbinding dynamics on the transcription-factor concentration rise-times. The simulation results are robust against changes in several system parameters of the gene expression machinery. PMID:21943410

Wireless sensor placement for structural monitoring using information-fusing firefly algorithm

NASA Astrophysics Data System (ADS)

Zhou, Guang-Dong; Yi, Ting-Hua; Xie, Mei-Xi; Li, Hong-Nan

2017-10-01

Wireless sensor networks (WSNs) are promising technology in structural health monitoring (SHM) applications for their low cost and high efficiency. The limited wireless sensors and restricted power resources in WSNs highlight the significance of optimal wireless sensor placement (OWSP) during designing SHM systems to enable the most useful information to be captured and to achieve the longest network lifetime. This paper presents a holistic approach, including an optimization criterion and a solution algorithm, for optimally deploying self-organizing multi-hop WSNs on large-scale structures. The combination of information effectiveness represented by the modal independence and the network performance specified by the network connectivity and network lifetime is first formulated to evaluate the performance of wireless sensor configurations. Then, an information-fusing firefly algorithm (IFFA) is developed to solve the OWSP problem. The step sizes drawn from a Lévy distribution are adopted to drive fireflies toward brighter individuals. Following the movement with Lévy flights, information about the contributions of wireless sensors to the objective function as carried by the fireflies is fused and applied to move inferior wireless sensors to better locations. The reliability of the proposed approach is verified via a numerical example on a long-span suspension bridge. The results demonstrate that the evaluation criterion provides a good performance metric of wireless sensor configurations, and the IFFA outperforms the simple discrete firefly algorithm.

Charge transport network dynamics in molecular aggregates

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jackson, Nicholas E.; Chen, Lin X.; Ratner, Mark A.

2016-07-20

Due to the nonperiodic nature of charge transport in disordered systems, generating insight into static charge transport networks, as well as analyzing the network dynamics, can be challenging. Here, we apply time-dependent network analysis to scrutinize the charge transport networks of two representative molecular semiconductors: a rigid n-type molecule, perylenediimide, and a flexible p-type molecule, bBDT(TDPP)2. Simulations reveal the relevant timescale for local transfer integral decorrelation to be ~100 fs, which is shown to be faster than that of a crystalline morphology of the same molecule. Using a simple graph metric, global network changes are observed over timescales competitive withmore » charge carrier lifetimes. These insights demonstrate that static charge transport networks are qualitatively inadequate, whereas average networks often overestimate network connectivity. Finally, a simple methodology for tracking dynamic charge transport properties is proposed.« less

Proactive schema based link lifetime estimation and connectivity ratio.

PubMed

Bachir, Bouamoud; Ali, Ouacha; Ahmed, Habbani; Mohamed, Elkoutbi

2014-01-01

The radio link between a pair of wireless nodes is affected by a set of random factors such as transmission range, node mobility, and environment conditions. The properties of such radio links are continually experienced when nodes status balances between being reachable and being unreachable; thereby on completion of each experience the statistical distribution of link lifetime is updated. This aspect is emphasized in mobile ad hoc network especially when it is deployed in some fields that require intelligent processing of data information such as aerospace domain.

The Current State of Silicone-Based Dielectric Elastomer Transducers.

PubMed

Madsen, Frederikke B; Daugaard, Anders E; Hvilsted, Søren; Skov, Anne L

2016-03-01

Silicone elastomers are promising materials for dielectric elastomer transducers (DETs) due to their superior properties such as high efficiency, reliability and fast response times. DETs consist of thin elastomer films sandwiched between compliant electrodes, and they constitute an interesting class of transducer due to their inherent lightweight and potentially large strains. For the field to progress towards industrial implementation, a leap in material development is required, specifically targeting longer lifetime and higher energy densities to provide more efficient transduction at lower driving voltages. In this review, the current state of silicone elastomers for DETs is summarised and critically discussed, including commercial elastomers, composites, polymer blends, grafted elastomers and complex network structures. For future developments in the field it is essential that all aspects of the elastomer are taken into account, namely dielectric losses, lifetime and the very often ignored polymer network integrity and stability. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A Novel Design of an Automatic Lighting Control System for a Wireless Sensor Network with Increased Sensor Lifetime and Reduced Sensor Numbers

PubMed Central

Mohamaddoust, Reza; Haghighat, Abolfazl Toroghi; Sharif, Mohamad Javad Motahari; Capanni, Niccolo

2011-01-01

Wireless sensor networks (WSN) are currently being applied to energy conservation applications such as light control. We propose a design for such a system called a Lighting Automatic Control System (LACS). The LACS system contains a centralized or distributed architecture determined by application requirements and space usage. The system optimizes the calculations and communications for lighting intensity, incorporates user illumination requirements according to their activities and performs adjustments based on external lighting effects in external sensor and external sensor-less architectures. Methods are proposed for reducing the number of sensors required and increasing the lifetime of those used, for considerably reduced energy consumption. Additionally we suggest methods for improving uniformity of illuminance distribution on a workplane’s surface, which improves user satisfaction. Finally simulation results are presented to verify the effectiveness of our design. PMID:22164114

A novel design of an automatic lighting control system for a wireless sensor network with increased sensor lifetime and reduced sensor numbers.

PubMed

Mohamaddoust, Reza; Haghighat, Abolfazl Toroghi; Sharif, Mohamad Javad Motahari; Capanni, Niccolo

2011-01-01

Wireless sensor networks (WSN) are currently being applied to energy conservation applications such as light control. We propose a design for such a system called a lighting automatic control system (LACS). The LACS system contains a centralized or distributed architecture determined by application requirements and space usage. The system optimizes the calculations and communications for lighting intensity, incorporates user illumination requirements according to their activities and performs adjustments based on external lighting effects in external sensor and external sensor-less architectures. Methods are proposed for reducing the number of sensors required and increasing the lifetime of those used, for considerably reduced energy consumption. Additionally we suggest methods for improving uniformity of illuminance distribution on a workplane's surface, which improves user satisfaction. Finally simulation results are presented to verify the effectiveness of our design.

Energy efficient mechanisms for high-performance Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Alsaify, Baha'adnan

2009-12-01

Due to recent advances in microelectronics, the development of low cost, small, and energy efficient devices became possible. Those advances led to the birth of the Wireless Sensor Networks (WSNs). WSNs consist of a large set of sensor nodes equipped with communication capabilities, scattered in the area to monitor. Researchers focus on several aspects of WSNs. Such aspects include the quality of service the WSNs provide (data delivery delay, accuracy of data, etc...), the scalability of the network to contain thousands of sensor nodes (the terms node and sensor node are being used interchangeably), the robustness of the network (allowing the network to work even if a certain percentage of nodes fails), and making the energy consumption in the network as low as possible to prolong the network's lifetime. In this thesis, we present an approach that can be applied to the sensing devices that are scattered in an area for Sensor Networks. This work will use the well-known approach of using a awaking scheduling to extend the network's lifespan. We designed a scheduling algorithm that will reduce the delay's upper bound the reported data will experience, while at the same time keeps the advantages that are offered by the use of the awaking scheduling -- the energy consumption reduction which will lead to the increase in the network's lifetime. The wakeup scheduling is based on the location of the node relative to its neighbors and its distance from the Base Station (the terms Base Station and sink are being used interchangeably). We apply the proposed method to a set of simulated nodes using the "ONE Simulator". We test the performance of this approach with three other approaches -- Direct Routing technique, the well known LEACH algorithm, and a multi-parent scheduling algorithm. We demonstrate a good improvement on the network's quality of service and a reduction of the consumed energy.

Towards a unified description of the hydrogen bond network of liquid water: A dynamics based approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ozkanlar, Abdullah, E-mail: abdullah.ozkanlar@wsu.edu; Zhou, Tiecheng; Clark, Aurora E., E-mail: auclark@wsu.edu

2014-12-07

The definition of a hydrogen bond (H-bond) is intimately related to the topological and dynamic properties of the hydrogen bond network within liquid water. The development of a universal H-bond definition for water is an active area of research as it would remove many ambiguities in the network properties that derive from the fixed definition employed to assign whether a water dimer is hydrogen bonded. This work investigates the impact that an electronic-structure based definition, an energetic, and a geometric definition of the H-bond has upon both topological and dynamic network behavior of simulated water. In each definition, the usemore » of a cutoff (either geometric or energetic) to assign the presence of a H-bond leads to the formation of transiently bonded or broken dimers, which have been quantified within the simulation data. The relative concentration of transient species, and their duration, results in two of the three definitions sharing similarities in either topological or dynamic features (H-bond distribution, H-bond lifetime, etc.), however no two definitions exhibit similar behavior for both classes of network properties. In fact, two networks with similar local network topology (as indicated by similar average H-bonds) can have dramatically different global network topology (as indicated by the defect state distributions) and altered H-bond lifetimes. A dynamics based correction scheme is then used to remove artificially transient H-bonds and to repair artificially broken bonds within the network such that the corrected network exhibits the same structural and dynamic properties for two H-bond definitions (the properties of the third definition being significantly improved). The algorithm described represents a significant step forward in the development of a unified hydrogen bond network whose properties are independent of the original hydrogen bond definition that is employed.« less

Quality of Service Metrics in Wireless Sensor Networks: A Survey

NASA Astrophysics Data System (ADS)

Snigdh, Itu; Gupta, Nisha

2016-03-01

Wireless ad hoc network is characterized by autonomous nodes communicating with each other by forming a multi hop radio network and maintaining connectivity in a decentralized manner. This paper presents a systematic approach to the interdependencies and the analogy of the various factors that affect and constrain the wireless sensor network. This article elaborates the quality of service parameters in terms of methods of deployment, coverage and connectivity which affect the lifetime of the network that have been addressed, till date by the different literatures. The analogy of the indispensable rudiments was discussed that are important factors to determine the varied quality of service achieved, yet have not been duly focused upon.

Open-WiSe: A Solar Powered Wireless Sensor Network Platform

PubMed Central

González, Apolinar; Aquino, Raúl; Mata, Walter; Ochoa, Alberto; Saldaña, Pedro; Edwards, Arthur

2012-01-01

Because battery-powered nodes are required in wireless sensor networks and energy consumption represents an important design consideration, alternate energy sources are needed to provide more effective and optimal function. The main goal of this work is to present an energy harvesting wireless sensor network platform, the Open Wireless Sensor node (WiSe). The design and implementation of the solar powered wireless platform is described including the hardware architecture, firmware, and a POSIX Real-Time Kernel. A sleep and wake up strategy was implemented to prolong the lifetime of the wireless sensor network. This platform was developed as a tool for researchers investigating Wireless sensor network or system integrators. PMID:22969396

A Routing Protocol for Multisink Wireless Sensor Networks in Underground Coalmine Tunnels

PubMed Central

Xia, Xu; Chen, Zhigang; Liu, Hui; Wang, Huihui; Zeng, Feng

2016-01-01

Traditional underground coalmine monitoring systems are mainly based on the use of wired transmission. However, when cables are damaged during an accident, it is difficult to obtain relevant data on environmental parameters and the emergency situation underground. To address this problem, the use of wireless sensor networks (WSNs) has been proposed. However, the shape of coalmine tunnels is not conducive to the deployment of WSNs as they are long and narrow. Therefore, issues with the network arise, such as extremely large energy consumption, very weak connectivity, long time delays, and a short lifetime. To solve these problems, in this study, a new routing protocol algorithm for multisink WSNs based on transmission power control is proposed. First, a transmission power control algorithm is used to negotiate the optimal communication radius and transmission power of each sink. Second, the non-uniform clustering idea is adopted to optimize the cluster head selection. Simulation results are subsequently compared to the Centroid of the Nodes in a Partition (CNP) strategy and show that the new algorithm delivers a good performance: power efficiency is increased by approximately 70%, connectivity is increased by approximately 15%, the cluster interference is diminished by approximately 50%, the network lifetime is increased by approximately 6%, and the delay is reduced with an increase in the number of sinks. PMID:27916917

A Routing Protocol for Multisink Wireless Sensor Networks in Underground Coalmine Tunnels.

PubMed

Xia, Xu; Chen, Zhigang; Liu, Hui; Wang, Huihui; Zeng, Feng

2016-11-30

Traditional underground coalmine monitoring systems are mainly based on the use of wired transmission. However, when cables are damaged during an accident, it is difficult to obtain relevant data on environmental parameters and the emergency situation underground. To address this problem, the use of wireless sensor networks (WSNs) has been proposed. However, the shape of coalmine tunnels is not conducive to the deployment of WSNs as they are long and narrow. Therefore, issues with the network arise, such as extremely large energy consumption, very weak connectivity, long time delays, and a short lifetime. To solve these problems, in this study, a new routing protocol algorithm for multisink WSNs based on transmission power control is proposed. First, a transmission power control algorithm is used to negotiate the optimal communication radius and transmission power of each sink. Second, the non-uniform clustering idea is adopted to optimize the cluster head selection. Simulation results are subsequently compared to the Centroid of the Nodes in a Partition (CNP) strategy and show that the new algorithm delivers a good performance: power efficiency is increased by approximately 70%, connectivity is increased by approximately 15%, the cluster interference is diminished by approximately 50%, the network lifetime is increased by approximately 6%, and the delay is reduced with an increase in the number of sinks.

Social networks uncovered: 10 tips every plastic surgeon should know.

PubMed

Dauwe, Phillip; Heller, Justin B; Unger, Jacob G; Graham, Darrell; Rohrich, Rod J

2012-11-01

Understanding online social networks is of critical importance to the plastic surgeon. With knowledge, it becomes apparent that the numerous networks available are similar in their structure, usage, and function. The key is communication between Internet media such that one maximizes exposure to patients. This article focuses on 2 social networking platforms that we feel provide the most utility to plastic surgeons. Ten tips are provided for incorporation of Facebook and Twitter into your practice.

Synchronization on Erdös-Rényi networks.

PubMed

Gong, Baihua; Yang, Lei; Yang, Kongqing

2005-09-01

In this Brief Report, by analyzing the spectral properties of the Laplacian matrix of Erdös-Rényi networks, we obtained the critical coupling strength of the complete synchronization analytically. In particular, for any size of the networks, when the average degree is greater than a threshold and the coupling strength is large enough, the networks can synchronize. Here, the threshold is determined by the value of the maximal Lyapunov exponent of each dynamical unit.

Envisioning, quantifying, and managing thermal regimes on river networks

Treesearch

E. Ashley Steel; Timothy J. Beechie; Christian E. Torgersen; Aimee H. Fullerton

2017-01-01

Water temperatures fluctuate in time and space, creating diverse thermal regimes on river networks. Temporal variability in these thermal landscapes has important biological and ecological consequences because of nonlinearities in physiological reactions; spatial diversity in thermal landscapes provides aquatic organisms with options to maximize growth and survival....

Optimal deployment of resources for maximizing impact in spreading processes

PubMed Central

2017-01-01

The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of “influential spreaders” for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings, the problem is often characterized by heterogeneous interactions and requires interventions in a dynamic fashion over a finite time window via a restricted set of controllable nodes. The optimal distribution of available resources hence results from an interplay between network topology and spreading dynamics. We show how these problems can be addressed as particular instances of a universal analytical framework based on a scalable dynamic message-passing approach and demonstrate the efficacy of the method on a variety of real-world examples. PMID:28900013

Lifetime exposure to particulate air pollutants is negatively associated with lung function in non-asthmatic children.

PubMed

Tsui, Hung-Chang; Chen, Chi-Hsien; Wu, Ying-Hsuan; Chiang, Hung-Che; Chen, Bing-Yu; Guo, Yue Leon

2018-05-01

Pulmonary function is known to be affected by acute and subacute exposure to ambient air pollution. However, the impacts of lifetime exposure to air pollution on the pulmonary function of children have been inconsistent. The present study investigated the impact of lifetime residential exposure to intermediate levels of air pollution on the pulmonary function of schoolchildren. In 2011, a survey of children aged 6-15 years was conducted in 44 schools in Taiwan. Atopic history, residential history, and environmental factors were recorded. Spirograms were obtained from a random sample of children without asthma. A total of 535 girls and 481 boys without a history of asthma were enrolled. Lifetime residential exposure to air pollutants, including particulate matter with an aerodynamic diameter less than 10 μm (PM 10 ), ozone (O 3 ), sulfur dioxide (SO 2 ), nitrogen dioxide (NO 2 ), and carbon monoxide (CO), was estimated using the kriging method, based on monitored data from the Taiwan Environmental Protection Administration. Multiple linear regression was used to analyze the association between lifetime air pollution exposure and pulmonary function, after adjustment for potential confounders and recent exposure. After adjustment for 7-day average air pollutant levels, a 10 μg/m 3 increase in PM 10 was related to reductions in the forced expiratory volume in 1 s (-2.00%; 95% confidence interval [CI] -3.09% to -0.90%), forced vital capacity (-1.86%; CI: -2.96% to -0.75%), and maximal midexpiratory flow (-2.28%; CI: -4.04% to -0.51%). These associations were independent of the other pollutants. Lifetime exposure to 25-85 μg/m 3 of PM 10 has negative impacts on the pulmonary function of children. Copyright © 2017 Elsevier Ltd. All rights reserved.

Availability Issues in Wireless Visual Sensor Networks

PubMed Central

Costa, Daniel G.; Silva, Ivanovitch; Guedes, Luiz Affonso; Vasques, Francisco; Portugal, Paulo

2014-01-01

Wireless visual sensor networks have been considered for a large set of monitoring applications related with surveillance, tracking and multipurpose visual monitoring. When sensors are deployed over a monitored field, permanent faults may happen during the network lifetime, reducing the monitoring quality or rendering parts or the entire network unavailable. In a different way from scalar sensor networks, camera-enabled sensors collect information following a directional sensing model, which changes the notions of vicinity and redundancy. Moreover, visual source nodes may have different relevancies for the applications, according to the monitoring requirements and cameras' poses. In this paper we discuss the most relevant availability issues related to wireless visual sensor networks, addressing availability evaluation and enhancement. Such discussions are valuable when designing, deploying and managing wireless visual sensor networks, bringing significant contributions to these networks. PMID:24526301

Multimodal network models for robust transportation systems.

DOT National Transportation Integrated Search

2009-10-01

Since transportation infrastructure projects have a lifetime of many decades, project developers must consider : not only the current demand for the project but also the future demand. Future demand is of course uncertain and should : be treated as s...

An Optimized Hidden Node Detection Paradigm for Improving the Coverage and Network Efficiency in Wireless Multimedia Sensor Networks

PubMed Central

Alanazi, Adwan; Elleithy, Khaled

2016-01-01

Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The nodes in WMSNs are either static or mobile. Thus, the node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND) paradigm. The OHND consists of three phases: hidden node detection, message exchange, and location detection. These three phases aim to maximize the multimedia node coverage, and improve energy efficiency, hidden node detection capacity, and packet delivery ratio. OHND helps multimedia sensor nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous node– continuous neighbor discovery process in order to handle the mobility of the nodes. We implement our proposed algorithms by using a network simulator (NS2). The simulation results demonstrate that nodes are capable of maintaining direct coverage and detecting hidden nodes in order to maximize coverage and multimedia node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches. PMID:27618048

An Optimized Hidden Node Detection Paradigm for Improving the Coverage and Network Efficiency in Wireless Multimedia Sensor Networks.

PubMed

Alanazi, Adwan; Elleithy, Khaled

2016-09-07

Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The nodes in WMSNs are either static or mobile. Thus, the node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND) paradigm. The OHND consists of three phases: hidden node detection, message exchange, and location detection. These three phases aim to maximize the multimedia node coverage, and improve energy efficiency, hidden node detection capacity, and packet delivery ratio. OHND helps multimedia sensor nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous node- continuous neighbor discovery process in order to handle the mobility of the nodes. We implement our proposed algorithms by using a network simulator (NS2). The simulation results demonstrate that nodes are capable of maintaining direct coverage and detecting hidden nodes in order to maximize coverage and multimedia node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches.

Multi-criteria decision making development of ion chromatographic method for determination of inorganic anions in oilfield waters based on artificial neural networks retention model.

PubMed

Stefanović, Stefica Cerjan; Bolanča, Tomislav; Luša, Melita; Ukić, Sime; Rogošić, Marko

2012-02-24

This paper describes the development of ad hoc methodology for determination of inorganic anions in oilfield water, since their composition often significantly differs from the average (concentration of components and/or matrix). Therefore, fast and reliable method development has to be performed in order to ensure the monitoring of desired properties under new conditions. The method development was based on computer assisted multi-criteria decision making strategy. The used criteria were: maximal value of objective functions used, maximal robustness of the separation method, minimal analysis time, and maximal retention distance between two nearest components. Artificial neural networks were used for modeling of anion retention. The reliability of developed method was extensively tested by the validation of performance characteristics. Based on validation results, the developed method shows satisfactory performance characteristics, proving the successful application of computer assisted methodology in the described case study. Copyright © 2011 Elsevier B.V. All rights reserved.

Cournot games with network effects for electric power markets

NASA Astrophysics Data System (ADS)

Spezia, Carl John

The electric utility industry is moving from regulated monopolies with protected service areas to an open market with many wholesale suppliers competing for consumer load. This market is typically modeled by a Cournot game oligopoly where suppliers compete by selecting profit maximizing quantities. The classical Cournot model can produce multiple solutions when the problem includes typical power system constraints. This work presents a mathematical programming formulation of oligopoly that produces unique solutions when constraints limit the supplier outputs. The formulation casts the game as a supply maximization problem with power system physical limits and supplier incremental profit functions as constraints. The formulation gives Cournot solutions identical to other commonly used algorithms when suppliers operate within the constraints. Numerical examples demonstrate the feasibility of the theory. The results show that the maximization formulation will give system operators more transmission capacity when compared to the actions of suppliers in a classical constrained Cournot game. The results also show that the profitability of suppliers in constrained networks depends on their location relative to the consumers' load concentration.

A decentralized mechanism for improving the functional robustness of distribution networks.

PubMed

Shi, Benyun; Liu, Jiming

2012-10-01

Most real-world distribution systems can be modeled as distribution networks, where a commodity can flow from source nodes to sink nodes through junction nodes. One of the fundamental characteristics of distribution networks is the functional robustness, which reflects the ability of maintaining its function in the face of internal or external disruptions. In view of the fact that most distribution networks do not have any centralized control mechanisms, we consider the problem of how to improve the functional robustness in a decentralized way. To achieve this goal, we study two important problems: 1) how to formally measure the functional robustness, and 2) how to improve the functional robustness of a network based on the local interaction of its nodes. First, we derive a utility function in terms of network entropy to characterize the functional robustness of a distribution network. Second, we propose a decentralized network pricing mechanism, where each node need only communicate with its distribution neighbors by sending a "price" signal to its upstream neighbors and receiving "price" signals from its downstream neighbors. By doing so, each node can determine its outflows by maximizing its own payoff function. Our mathematical analysis shows that the decentralized pricing mechanism can produce results equivalent to those of an ideal centralized maximization with complete information. Finally, to demonstrate the properties of our mechanism, we carry out a case study on the U.S. natural gas distribution network. The results validate the convergence and effectiveness of our mechanism when comparing it with an existing algorithm.

Resource Allocation and Cross Layer Control in Wireless Networks

DTIC Science & Technology

2006-08-25

arrival rates lies within the capacity region of the network. The notion of controlling the system to maximize its stability region and the following...optimization problem (4.5) that must be solved at the beginning of 48 Dynamic Control for Network Stability each time slot requires in general knowledge...Dynamic Control for Network Stability ~ (c) ab (t) those of any other feasible algorithm, then for any time t 0; X ic U (c) i (t) "X b ~ (c) ab (t) X

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks

NASA Astrophysics Data System (ADS)

Teng, Xian; Pei, Sen; Morone, Flaviano; Makse, Hernán A.

2016-10-01

Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called “Collective Influence (CI)” has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes’ significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in various social and scientific platforms including American Physical Society, Facebook, Twitter and LiveJournal. Since empirical data cannot be directly mapped to ideal multi-source spreading, we leverage the behavioral patterns of users extracted from data to construct “virtual” information spreading processes. Our results demonstrate that the set of spreaders selected by CI can induce larger scale of information propagation. Moreover, local measures as the number of connections or citations are not necessarily the deterministic factors of nodes’ importance in realistic information spreading. This result has significance for rankings scientists in scientific networks like the APS, where the commonly used number of citations can be a poor indicator of the collective influence of authors in the community.

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks

PubMed Central

Teng, Xian; Pei, Sen; Morone, Flaviano; Makse, Hernán A.

2016-01-01

Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called “Collective Influence (CI)” has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes’ significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in various social and scientific platforms including American Physical Society, Facebook, Twitter and LiveJournal. Since empirical data cannot be directly mapped to ideal multi-source spreading, we leverage the behavioral patterns of users extracted from data to construct “virtual” information spreading processes. Our results demonstrate that the set of spreaders selected by CI can induce larger scale of information propagation. Moreover, local measures as the number of connections or citations are not necessarily the deterministic factors of nodes’ importance in realistic information spreading. This result has significance for rankings scientists in scientific networks like the APS, where the commonly used number of citations can be a poor indicator of the collective influence of authors in the community. PMID:27782207

Using a genetic algorithm to optimize a water-monitoring network for accuracy and cost effectiveness

NASA Astrophysics Data System (ADS)

Julich, R. J.

2004-05-01

The purpose of this project is to determine the optimal spatial distribution of water-monitoring wells to maximize important data collection and to minimize the cost of managing the network. We have employed a genetic algorithm (GA) towards this goal. The GA uses a simple fitness measure with two parts: the first part awards a maximal score to those combinations of hydraulic head observations whose net uncertainty is closest to the value representing all observations present, thereby maximizing accuracy; the second part applies a penalty function to minimize the number of observations, thereby minimizing the overall cost of the monitoring network. We used the linear statistical inference equation to calculate standard deviations on predictions from a numerical model generated for the 501-observation Death Valley Regional Flow System as the basis for our uncertainty calculations. We have organized the results to address the following three questions: 1) what is the optimal design strategy for a genetic algorithm to optimize this problem domain; 2) what is the consistency of solutions over several optimization runs; and 3) how do these results compare to what is known about the conceptual hydrogeology? Our results indicate the genetic algorithms are a more efficient and robust method for solving this class of optimization problems than have been traditional optimization approaches.

Stock market network’s topological stability: Evidence from planar maximally filtered graph and minimal spanning tree

NASA Astrophysics Data System (ADS)

Yan, Xin-Guo; Xie, Chi; Wang, Gang-Jin

2015-08-01

We study the topological stability of stock market network by investigating the topological robustness, namely the ability of the network to resist structural or topological changes. The stock market network is extracted by minimal spanning tree (MST) and planar maximally filtered graph (PMFG). We find that the specific delisting thresholds of the listed companies exist in both MST and PMFG networks. In comparison with MST, PMFG provides more information and is better for the aim of exploring stock market network’s robustness. The PMFG before the US sub-prime crisis (i.e., from June 2005 to May 2007) has a stronger robustness against the intentional topological damage than the other two sub-periods (i.e., from June 2007 to May 2009 and from June 2009 to May 2011). We also find that the nonfractal property exists in MSTs of S&P 500, i.e., the highly connected nodes link with each other directly, which indicates that the MSTs are vulnerable to the removal of such important nodes. Moreover, the financial institutions and high technology companies are important in maintaining the stability of S&P 500 network.

Efficient Network Coding-Based Loss Recovery for Reliable Multicast in Wireless Networks

NASA Astrophysics Data System (ADS)

Chi, Kaikai; Jiang, Xiaohong; Ye, Baoliu; Horiguchi, Susumu

Recently, network coding has been applied to the loss recovery of reliable multicast in wireless networks [19], where multiple lost packets are XOR-ed together as one packet and forwarded via single retransmission, resulting in a significant reduction of bandwidth consumption. In this paper, we first prove that maximizing the number of lost packets for XOR-ing, which is the key part of the available network coding-based reliable multicast schemes, is actually a complex NP-complete problem. To address this limitation, we then propose an efficient heuristic algorithm for finding an approximately optimal solution of this optimization problem. Furthermore, we show that the packet coding principle of maximizing the number of lost packets for XOR-ing sometimes cannot fully exploit the potential coding opportunities, and we then further propose new heuristic-based schemes with a new coding principle. Simulation results demonstrate that the heuristic-based schemes have very low computational complexity and can achieve almost the same transmission efficiency as the current coding-based high-complexity schemes. Furthermore, the heuristic-based schemes with the new coding principle not only have very low complexity, but also slightly outperform the current high-complexity ones.

Maximal qubit violation of n-locality inequalities in a star-shaped quantum network

NASA Astrophysics Data System (ADS)

Andreoli, Francesco; Carvacho, Gonzalo; Santodonato, Luca; Chaves, Rafael; Sciarrino, Fabio

2017-11-01

Bell's theorem was a cornerstone for our understanding of quantum theory and the establishment of Bell non-locality played a crucial role in the development of quantum information. Recently, its extension to complex networks has been attracting growing attention, but a deep characterization of quantum behavior is still missing for this novel context. In this work we analyze quantum correlations arising in the bilocality scenario, that is a tripartite quantum network where the correlations between the parties are mediated by two independent sources of states. First, we prove that non-bilocal correlations witnessed through a Bell-state measurement in the central node of the network form a subset of those obtainable by means of a local projective measurement. This leads us to derive the maximal violation of the bilocality inequality that can be achieved by arbitrary two-qubit quantum states and arbitrary local projective measurements. We then analyze in details the relation between the violation of the bilocality inequality and the CHSH inequality. Finally, we show how our method can be extended to the n-locality scenario consisting of n two-qubit quantum states distributed among n+1 nodes of a star-shaped network.

Social Network Influence and Personal Financial Status

NASA Astrophysics Data System (ADS)

Luo, Shaojun; Morone, Flaviano; Sarraute, Carlos; Makse, Hernan

Networks of social ties emerging from individual economic needs display a highly structured architecture. In response to socio-economic demands, people reshape their circle of contacts for maximizing their social status, and ipso facto, the pattern of their interconnections is strongly correlates with their personal financial situation. In this work we transform this qualitative and verbal statement into an operative definition, which allows us to quantify the economic wellness of individuals trough a measure of their collective influence. We consider the network of mobile phone calls made by the Mexican population during three months, in order to study the correlation of person's economic situation with her network location. Notably, we find that rich people tend to be also the most influential nodes, i.e., they self-organize to optimally position themselves in the network. This finding may be also raised at the level of a principle, a fact that would explain the emergence of the phenomenon of collective influence itself as the result of the local optimization of socio-economic interactions. Our method represents a powerful and efficient indicator of socio-economic robustness, which may be applied to maximize the effect of large scale economic intervention and stimulus policies

Self-organizing feature maps for dynamic control of radio resources in CDMA microcellular networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

1998-03-01

The application of artificial neural networks to the channel assignment problem for cellular code-division multiple access (CDMA) cellular networks has previously been investigated. CDMA takes advantage of voice activity and spatial isolation because its capacity is only interference limited, unlike time-division multiple access (TDMA) and frequency-division multiple access (FDMA) where capacities are bandwidth-limited. Any reduction in interference in CDMA translates linearly into increased capacity. To satisfy the high demands for new services and improved connectivity for mobile communications, microcellular and picocellular systems are being introduced. For these systems, there is a need to develop robust and efficient management procedures for the allocation of power and spectrum to maximize radio capacity. Topology-conserving mappings play an important role in the biological processing of sensory inputs. The same principles underlying Kohonen's self-organizing feature maps (SOFMs) are applied to the adaptive control of radio resources to minimize interference, hence, maximize capacity in direct-sequence (DS) CDMA networks. The approach based on SOFMs is applied to some published examples of both theoretical and empirical models of DS/CDMA microcellular networks in metropolitan areas. The results of the approach for these examples are informally compared to the performance of algorithms, based on Hopfield- Tank neural networks and on genetic algorithms, for the channel assignment problem.

Configuration of Wireless Cooperative/Sensor Networks

DTIC Science & Technology

2008-05-25

WSN), the advantages of cooperation can be further exploited by optimally allocating the energy and bandwidth resources among users based on the... consumption and extend system lifetime [Sin98]. The implementation of a minimum energy routing protocol is discussed in [Dos02a, Dos02b]. An online...power consumption in the network given the required SER at the destination. For example, with source power Ps=20dB, the EP algorithm requires one relay

Retirement investment theory explains patterns in songbird nest-site choice

USGS Publications Warehouse

Streby, Henry M.; Refsnider, Jeanine M.; Peterson, Sean M.; Andersen, David E.

2014-01-01

When opposing evolutionary selection pressures act on a behavioural trait, the result is often stabilizing selection for an intermediate optimal phenotype, with deviations from the predicted optimum attributed to tracking a moving target, development of behavioural syndromes or shifts in riskiness over an individual's lifetime. We investigated nest-site choice by female golden-winged warblers, and the selection pressures acting on that choice by two fitness components, nest success and fledgling survival. We observed strong and consistent opposing selection pressures on nest-site choice for maximizing these two fitness components, and an abrupt, within-season switch in the fitness component birds prioritize via nest-site choice, dependent on the time remaining for additional nesting attempts. We found that females consistently deviated from the predicted optimal behaviour when choosing nest sites because they can make multiple attempts at one fitness component, nest success, but only one attempt at the subsequent component, fledgling survival. Our results demonstrate a unique natural strategy for balancing opposing selection pressures to maximize total fitness. This time-dependent switch from high to low risk tolerance in nest-site choice maximizes songbird fitness in the same way a well-timed switch in human investor risk tolerance can maximize one's nest egg at retirement. Our results also provide strong evidence for the adaptive nature of songbird nest-site choice, which we suggest has been elusive primarily due to a lack of consideration for fledgling survival.

Maximizing optical efficacy and color gamut in projection applications by combining four laser wavelengths

NASA Astrophysics Data System (ADS)

Wallhead, Ian; Ocaña, Roberto

2014-05-01

Laser projection devices should be designed to maximize their luminous efficacy and color gamut. This is for two main reasons. Firstly, being either stand alone devices or embedded in other products, they could be powered by battery, and lifetime is an important factor. Secondly, the increasing use of lasers to project images calls for a consideration of eye safety issues. The brightness of the projected image may be limited by the Class II accessible emission limit. There is reason to believe that current laser beam scanning projection technology is already close to the power ceiling based on eye safety limits. Consequently, it would be desirable to improve luminous efficacy to increase the output luminous flux whilst maintaining or improving color gamut for the same eye-safe optical power limit. Here we present a novel study about the combination of four laser wavelengths in order to maximize both color gamut and efficacy to produce the color white. Firstly, an analytic method to calculate efficacy as function of both four laser wavelengths and four laser powers is derived. Secondly we provide a new way to present the results by providing the diagram efficacy vs color gamut area that summarizes the performance of any wavelength combination for projection purposes. The results indicate that the maximal efficacy for the D65 white is only achievable by using a suitable combination of both laser power ratios and wavelengths.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mercier, C.W.

The Network File System (NFS) will be the user interface to a High-Performance Data System (HPDS) being developed at Los Alamos National Laboratory (LANL). HPDS will manage high-capacity, high-performance storage systems connected directly to a high-speed network from distributed workstations. NFS will be modified to maximize performance and to manage massive amounts of data. 6 refs., 3 figs.

Implications of RFID in Location-Aware Wi-Fi Networks

ERIC Educational Resources Information Center

Duhainy, Robert

2010-01-01

The use of radio frequency identification (RFID) technology is increasingly common. Its use for specific applications has been mandated by a number of major retailers, as well as by the U.S. government; however, core RFID technologies and networks lack consistent approaches to maximize the efficiency and security of RFID applications. The purpose…

Stability-Aware Geographic Routing in Energy Harvesting Wireless Sensor Networks

PubMed Central

Hieu, Tran Dinh; Dung, Le The; Kim, Byung-Seo

2016-01-01

A new generation of wireless sensor networks that harvest energy from environmental sources such as solar, vibration, and thermoelectric to power sensor nodes is emerging to solve the problem of energy limitation. Based on the photo-voltaic model, this research proposes a stability-aware geographic routing for reliable data transmissions in energy-harvesting wireless sensor networks (EH-WSNs) to provide a reliable routes selection method and potentially achieve an unlimited network lifetime. Specifically, the influences of link quality, represented by the estimated packet reception rate, on network performance is investigated. Simulation results show that the proposed method outperforms an energy-harvesting-aware method in terms of energy consumption, the average number of hops, and the packet delivery ratio. PMID:27187414

Characteristic of Nitron for Use as a Chemical Sensor in Studies of the Upper Atmosphere

NASA Technical Reports Server (NTRS)

Meadows, Kapres; Wright, Cassandra K.; Sims, S. C.; Morris, V. R.

1997-01-01

We are investigating the use of nitron as a potential chemical sensor for nitric acid and other electron deficient nitrogen oxides. Solutions of nitron in 1-propanol, toluene, and chloroform have been tested for use on a piezoelectric quartz crystal microbalance. We are testing various solvents and metal cations which can maximize the lifetime and reaction specificity of nitron so that they may be used as chemical coatings for stratospheric measurement of trace gases. Results of the work to date will be shown, and future direction discussed.

Managing the patent thicket and maximizing patent lifetime in vaccine technology.

PubMed

Mertes, Maria M M; Stötter, Gerd

2010-10-01

Patents are exclusive rights for a limited period of time that are granted to provide an incentive for innovation and in exchange for the public disclosure of an invention. Patenting in the medical field, especially in the field of human vaccine technologies, is full of pitfalls, because the products that finally access the market are often covered by a multitude of exclusive IP rights. This commentary gives an overview on obstacles in vaccine patenting and how to overcome them, and intends to provide a patenting guideline for researchers.

Short relaxation times but long transient times in both simple and complex reaction networks

PubMed Central

Henry, Adrien; Martin, Olivier C.

2016-01-01

When relaxation towards an equilibrium or steady state is exponential at large times, one usually considers that the associated relaxation time τ, i.e. the inverse of the decay rate, is the longest characteristic time in the system. However, that need not be true, other times such as the lifetime of an infinitesimal perturbation can be much longer. In the present work, we demonstrate that this paradoxical property can arise even in quite simple systems such as a linear chain of reactions obeying mass action (MA) kinetics. By mathematical analysis of simple reaction networks, we pin-point the reason why the standard relaxation time does not provide relevant information on the potentially long transient times of typical infinitesimal perturbations. Overall, we consider four characteristic times and study their behaviour in both simple linear chains and in more complex reaction networks taken from the publicly available database ‘Biomodels’. In all these systems, whether involving MA rates, Michaelis–Menten reversible kinetics, or phenomenological laws for reaction rates, we find that the characteristic times corresponding to lifetimes of tracers and of concentration perturbations can be significantly longer than τ. PMID:27411726

Positron annihilation spectroscopic study of high performance semi-interpenetrating network polyimids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ray, A.K.

1995-12-01

Semi-interpenetrating (S-IPN) network polyimids were made from different proportions of LaRC RP46 (a thermosetpolyimid) and LaRC BDTA-ODA (a thermoplastic polyimid). The ultimate goal of this networking is to improve the mechanical properties of the thermoset polyimid. Positron lifetime study was made to calculate lifetime based on second component of the life time spectra and the free volume & microvoid size. All these properties tend to decrease steadily with increasing thermoset content except at the 50 percent thermoset level where these properties show sudden drop. This result contradicts with the initial expectation that the blend properties should change gradually if itmore » were a solid solution of thermoset (TSP) and thermoplastic (TPP) components. Thermal analyses (TMA, DSC, DMA & TGA) were run to complement the positron life time studies. The TMA and DSC studies confirm the contradiction mentioned above. Further experimentation with S-IPN polymers made at TSP/TTP content around 50/50 level are being conducted to explain this anomaly. Scanning electron microscope study of the S-IPN polyimid samples is under way in order to detect morphological differences which might help explain the phenomenon mentioned above.« less

Energy-Efficient Crowdsensing of Human Mobility and Signal Levels in Cellular Networks

PubMed Central

Foremski, Paweł; Gorawski, Michał; Grochla, Krzysztof; Polys, Konrad

2015-01-01

The paper presents a practical application of the crowdsensing idea to measure human mobility and signal coverage in cellular networks. Currently, virtually everyone is carrying a mobile phone, which may be used as a sensor to gather research data by measuring, e.g., human mobility and radio signal levels. However, many users are unwilling to participate in crowdsensing experiments. This work begins with the analysis of the barriers for engaging people in crowdsensing. A survey showed that people who agree to participate in crowdsensing expect a minimum impact on their battery lifetime and phone usage habits. To address these requirements, this paper proposes an application for measuring the location and signal strength data based on energy-efficient GPS tracking, which allows one to perform the measurements of human mobility and radio signal levels with minimum energy utilization and without any engagement of the user. The method described combines measurements from the accelerometer with effective management of the GPS to monitor the user mobility with the decrease in battery lifetime by approximately 20%. To show the applicability of the proposed platform, the sample results of signal level distribution and coverage maps gathered for an LTE network and representing human mobility are shown. PMID:26340633

Analytical network process based optimum cluster head selection in wireless sensor network.

PubMed

Farman, Haleem; Javed, Huma; Jan, Bilal; Ahmad, Jamil; Ali, Shaukat; Khalil, Falak Naz; Khan, Murad

2017-01-01

Wireless Sensor Networks (WSNs) are becoming ubiquitous in everyday life due to their applications in weather forecasting, surveillance, implantable sensors for health monitoring and other plethora of applications. WSN is equipped with hundreds and thousands of small sensor nodes. As the size of a sensor node decreases, critical issues such as limited energy, computation time and limited memory become even more highlighted. In such a case, network lifetime mainly depends on efficient use of available resources. Organizing nearby nodes into clusters make it convenient to efficiently manage each cluster as well as the overall network. In this paper, we extend our previous work of grid-based hybrid network deployment approach, in which merge and split technique has been proposed to construct network topology. Constructing topology through our proposed technique, in this paper we have used analytical network process (ANP) model for cluster head selection in WSN. Five distinct parameters: distance from nodes (DistNode), residual energy level (REL), distance from centroid (DistCent), number of times the node has been selected as cluster head (TCH) and merged node (MN) are considered for CH selection. The problem of CH selection based on these parameters is tackled as a multi criteria decision system, for which ANP method is used for optimum cluster head selection. Main contribution of this work is to check the applicability of ANP model for cluster head selection in WSN. In addition, sensitivity analysis is carried out to check the stability of alternatives (available candidate nodes) and their ranking for different scenarios. The simulation results show that the proposed method outperforms existing energy efficient clustering protocols in terms of optimum CH selection and minimizing CH reselection process that results in extending overall network lifetime. This paper analyzes that ANP method used for CH selection with better understanding of the dependencies of different components involved in the evaluation process.

Analytical network process based optimum cluster head selection in wireless sensor network

PubMed Central

Javed, Huma; Jan, Bilal; Ahmad, Jamil; Ali, Shaukat; Khalil, Falak Naz; Khan, Murad

2017-01-01

Wireless Sensor Networks (WSNs) are becoming ubiquitous in everyday life due to their applications in weather forecasting, surveillance, implantable sensors for health monitoring and other plethora of applications. WSN is equipped with hundreds and thousands of small sensor nodes. As the size of a sensor node decreases, critical issues such as limited energy, computation time and limited memory become even more highlighted. In such a case, network lifetime mainly depends on efficient use of available resources. Organizing nearby nodes into clusters make it convenient to efficiently manage each cluster as well as the overall network. In this paper, we extend our previous work of grid-based hybrid network deployment approach, in which merge and split technique has been proposed to construct network topology. Constructing topology through our proposed technique, in this paper we have used analytical network process (ANP) model for cluster head selection in WSN. Five distinct parameters: distance from nodes (DistNode), residual energy level (REL), distance from centroid (DistCent), number of times the node has been selected as cluster head (TCH) and merged node (MN) are considered for CH selection. The problem of CH selection based on these parameters is tackled as a multi criteria decision system, for which ANP method is used for optimum cluster head selection. Main contribution of this work is to check the applicability of ANP model for cluster head selection in WSN. In addition, sensitivity analysis is carried out to check the stability of alternatives (available candidate nodes) and their ranking for different scenarios. The simulation results show that the proposed method outperforms existing energy efficient clustering protocols in terms of optimum CH selection and minimizing CH reselection process that results in extending overall network lifetime. This paper analyzes that ANP method used for CH selection with better understanding of the dependencies of different components involved in the evaluation process. PMID:28719616

Tyre-road grip coefficient assessment - Part II: online estimation using instrumented vehicle, extended Kalman filter, and neural network

NASA Astrophysics Data System (ADS)

Luque, Pablo; Mántaras, Daniel A.; Fidalgo, Eloy; Álvarez, Javier; Riva, Paolo; Girón, Pablo; Compadre, Diego; Ferran, Jordi

2013-12-01

The main objective of this work is to determine the limit of safe driving conditions by identifying the maximal friction coefficient in a real vehicle. The study will focus on finding a method to determine this limit before reaching the skid, which is valuable information in the context of traffic safety. Since it is not possible to measure the friction coefficient directly, it will be estimated using the appropriate tools in order to get the most accurate information. A real vehicle is instrumented to collect information of general kinematics and steering tie-rod forces. A real-time algorithm is developed to estimate forces and aligning torque in the tyres using an extended Kalman filter and neural networks techniques. The methodology is based on determining the aligning torque; this variable allows evaluation of the behaviour of the tyre. It transmits interesting information from the tyre-road contact and can be used to predict the maximal tyre grip and safety margin. The maximal grip coefficient is estimated according to a knowledge base, extracted from computer simulation of a high detailed three-dimensional model, using Adams® software. The proposed methodology is validated and applied to real driving conditions, in which maximal grip and safety margin are properly estimated.

Effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks

NASA Astrophysics Data System (ADS)

Jiang, Zhong-Yuan; Ma, Jian-Feng

Existing routing strategies such as the global dynamic routing [X. Ling, M. B. Hu, R. Jiang and Q. S. Wu, Phys. Rev. E 81, 016113 (2010)] can achieve very high traffic capacity at the cost of extremely long packet traveling delay. In many real complex networks, especially for real-time applications such as the instant communication software, extremely long packet traveling time is unacceptable. In this work, we propose to assign a finite Time-to-Live (TTL) parameter for each packet. To guarantee every packet to arrive at its destination within its TTL, we assume that a packet is retransmitted by its source once its TTL expires. We employ source routing mechanisms in the traffic model to avoid the routing-flaps induced by the global dynamic routing. We compose extensive simulations to verify our proposed mechanisms. With small TTL, the effects of packet retransmission on network traffic capacity are obvious, and the phase transition from flow free state to congested state occurs. For the purpose of reducing the computation frequency of the routing table, we employ a computing cycle Tc within which the routing table is recomputed once. The simulation results show that the traffic capacity decreases with increasing Tc. Our work provides a good insight into the understanding of effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks.

An Embedded Wireless Sensor Network with Wireless Power Transmission Capability for the Structural Health Monitoring of Reinforced Concrete Structures.

PubMed

Gallucci, Luca; Menna, Costantino; Angrisani, Leopoldo; Asprone, Domenico; Moriello, Rosario Schiano Lo; Bonavolontà, Francesco; Fabbrocino, Francesco

2017-11-07

Maintenance strategies based on structural health monitoring can provide effective support in the optimization of scheduled repair of existing structures, thus enabling their lifetime to be extended. With specific regard to reinforced concrete (RC) structures, the state of the art seems to still be lacking an efficient and cost-effective technique capable of monitoring material properties continuously over the lifetime of a structure. Current solutions can typically only measure the required mechanical variables in an indirect, but economic, manner, or directly, but expensively. Moreover, most of the proposed solutions can only be implemented by means of manual activation, making the monitoring very inefficient and then poorly supported. This paper proposes a structural health monitoring system based on a wireless sensor network (WSN) that enables the automatic monitoring of a complete structure. The network includes wireless distributed sensors embedded in the structure itself, and follows the monitoring-based maintenance (MBM) approach, with its ABCDE paradigm, namely: accuracy, benefit, compactness, durability, and easiness of operations. The system is structured in a node level and has a network architecture that enables all the node data to converge in a central unit. Human control is completely unnecessary until the periodic evaluation of the collected data. Several tests are conducted in order to characterize the system from a metrological point of view and assess its performance and effectiveness in real RC conditions.

DCBRP: a deterministic chain-based routing protocol for wireless sensor networks.

PubMed

Marhoon, Haydar Abdulameer; Mahmuddin, M; Nor, Shahrudin Awang

2016-01-01

Wireless sensor networks (WSNs) are a promising area for both researchers and industry because of their various applications The sensor node expends the majority of its energy on communication with other nodes. Therefore, the routing protocol plays an important role in delivering network data while minimizing energy consumption as much as possible. The chain-based routing approach is superior to other approaches. However, chain-based routing protocols still expend substantial energy in the Chain Head (CH) node. In addition, these protocols also have the bottleneck issues. A novel routing protocol which is Deterministic Chain-Based Routing Protocol (DCBRP). DCBRP consists of three mechanisms: Backbone Construction Mechanism, Chain Head Selection (CHS), and the Next Hop Connection Mechanism. The CHS mechanism is presented in detail, and it is evaluated through comparison with the CCM and TSCP using an ns-3 simulator. It show that DCBRP outperforms both CCM and TSCP in terms of end-to-end delay by 19.3 and 65%, respectively, CH energy consumption by 18.3 and 23.0%, respectively, overall energy consumption by 23.7 and 31.4%, respectively, network lifetime by 22 and 38%, respectively, and the energy*delay metric by 44.85 and 77.54%, respectively. DCBRP can be used in any deterministic node deployment applications, such as smart cities or smart agriculture, to reduce energy depletion and prolong the lifetimes of WSNs.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chesny, D. L.; Oluseyi, H. M.; Orange, N. B.

We report on the identification of dynamic flaring non-potential structures on quiet Sun (QS) supergranular network scales. Data from the Atmospheric Imaging Assembly on board the Solar Dynamics Observatory allow for the high spatial and temporal resolution of this diverse class of compact structures. The rapidly evolving non-potential events presented here, with lifetimes <10 minutes, are on the order of 10″ in length. Thus, they contrast significantly with well-known active region (AR) non-potential structures such as high-temperature X-ray and EUV sigmoids (>100″) and micro-sigmoids (>10″) with lifetimes on the order of hours to days. The photospheric magnetic field environment derivedmore » from the Helioseismic and Magnetic Imager shows a lack of evidence for these flaring non-potential fields being associated with significant concentrations of bipolar magnetic elements. Of much interest to our events is the possibility of establishing them as precursor signatures of eruptive dynamics, similar to notions for AR sigmoids and micro-sigmoids, but associated with uneventful magnetic network regions. We suggest that the mixed network flux of QS-like magnetic environments, though unresolved, can provide sufficient free magnetic energy for flaring non-potential plasma structuring. The appearance of non-potential magnetic fields could be a fundamental process leading to self-organized criticality in the QS-like supergranular network and contribute to coronal heating, as these events undergo rapid helicial and vortical relaxations.« less

Optimizing the network topology of block copolymer liquid crystal elastomers for enhanced extensibility and toughness

NASA Astrophysics Data System (ADS)

Nowak, Christian; Escobedo, Fernando A.

2017-08-01

Molecular simulations are used to study the effect of synthesis conditions on the tensile response of liquid-crystalline elastomers formed by block copolymer chains. Remarkably, it is found that despite the significant presence of trapped entanglements, these networks can exhibit the sawtooth tensile response previously predicted for ideal unentangled networks. It is also found that the monomer concentration during crosslinking can be tuned to limit the extent of entanglements and inhomogeneities while also maximizing network extensibility. It is predicted that networks synthesized at a "critical" concentration will have the greatest toughness.

Synergistic interactions of ecosystem services: florivorous pest control boosts crop yield increase through insect pollination

PubMed Central

Albrecht, Matthias

2016-01-01

Insect pollination and pest control are pivotal functions sustaining global food production. However, they have mostly been studied in isolation and how they interactively shape crop yield remains largely unexplored. Using controlled field experiments, we found strong synergistic effects of insect pollination and simulated pest control on yield quantity and quality. Their joint effect increased yield by 23%, with synergistic effects contributing 10%, while their single contributions were 7% and 6%, respectively. The potential economic benefit for a farmer from the synergistic effects (12%) was 1.8 times greater than their individual contributions (7% each). We show that the principal underlying mechanism was a pronounced pest-induced reduction in flower lifetime, resulting in a strong reduction in the number of pollinator visits a flower receives during its lifetime. Our findings highlight the importance of non-additive interactions among ecosystem services (ES) when valuating, mapping or predicting them and reveal fundamental implications for ecosystem management and policy aimed at maximizing ES for sustainable agriculture. PMID:26865304

Dynamic Involvement of Real World Objects in the IoT: A Consensus-Based Cooperation Approach

PubMed Central

Pilloni, Virginia; Atzori, Luigi; Mallus, Matteo

2017-01-01

A significant role in the Internet of Things (IoT) will be taken by mobile and low-cost unstable devices, which autonomously self-organize and introduce highly dynamic and heterogeneous scenarios for the deployment of distributed applications. This entails the devices to cooperate to dynamically find the suitable combination of their involvement so as to improve the system reliability while following the changes in their status. Focusing on the above scenario, we propose a distributed algorithm for resources allocation that is run by devices that can perform the same task required by the applications, allowing for a flexible and dynamic binding of the requested services with the physical IoT devices. It is based on a consensus approach, which maximizes the lifetime of groups of nodes involved and ensures the fulfillment of the requested Quality of Information (QoI) requirements. Experiments have been conducted with real devices, showing an improvement of device lifetime of more than 20%, with respect to a uniform distribution of tasks. PMID:28257030

Synergistic interactions of ecosystem services: florivorous pest control boosts crop yield increase through insect pollination.

PubMed

Sutter, Louis; Albrecht, Matthias

2016-02-10

Insect pollination and pest control are pivotal functions sustaining global food production. However, they have mostly been studied in isolation and how they interactively shape crop yield remains largely unexplored. Using controlled field experiments, we found strong synergistic effects of insect pollination and simulated pest control on yield quantity and quality. Their joint effect increased yield by 23%, with synergistic effects contributing 10%, while their single contributions were 7% and 6%, respectively. The potential economic benefit for a farmer from the synergistic effects (12%) was 1.8 times greater than their individual contributions (7% each). We show that the principal underlying mechanism was a pronounced pest-induced reduction in flower lifetime, resulting in a strong reduction in the number of pollinator visits a flower receives during its lifetime. Our findings highlight the importance of non-additive interactions among ecosystem services (ES) when valuating, mapping or predicting them and reveal fundamental implications for ecosystem management and policy aimed at maximizing ES for sustainable agriculture. © 2016 The Author(s).

Dynamic Involvement of Real World Objects in the IoT: A Consensus-Based Cooperation Approach.

PubMed

Pilloni, Virginia; Atzori, Luigi; Mallus, Matteo

2017-03-01

A significant role in the Internet of Things (IoT) will be taken by mobile and low-cost unstable devices, which autonomously self-organize and introduce highly dynamic and heterogeneous scenarios for the deployment of distributed applications. This entails the devices to cooperate to dynamically find the suitable combination of their involvement so as to improve the system reliability while following the changes in their status. Focusing on the above scenario, we propose a distributed algorithm for resources allocation that is run by devices that can perform the same task required by the applications, allowing for a flexible and dynamic binding of the requested services with the physical IoT devices. It is based on a consensus approach, which maximizes the lifetime of groups of nodes involved and ensures the fulfillment of the requested Quality of Information (QoI) requirements. Experiments have been conducted with real devices, showing an improvement of device lifetime of more than 20 % , with respect to a uniform distribution of tasks.

Varying Tutorial Modality and Interface Restriction to Maximize Transfer in a Complex Simulation Environment

ERIC Educational Resources Information Center

Mayrath, Michael C.; Nihalani, Priya K.; Robinson, Daniel H.

2011-01-01

In 2 experiments, 241 undergraduates with low domain knowledge viewed a tutorial on how to use Packet Tracer (PT), a computer-networking training simulation developed by the Cisco Networking Academy. Participants were then tested on retention of tutorial content and transfer using PT. Tutorial modality (text, narration, or narration plus text) was…

Taking the Network on the Road: Portable Network Solutions for Computer Security Educators

ERIC Educational Resources Information Center

Rosenberg, Timothy; Hoffman, Lance J.

2006-01-01

Educational institutions that wish to implement a specialized teaching laboratory often have a variety of obstacles to overcome. Some of these obstacles are related to adapting existing classroom infrastructure, building the laboratory, and meeting the demands for multiple-use classrooms to maximize the return on investment. In some cases, such as…

COOPERATIVE ROUTING FOR DYNAMIC AERIAL LAYER NETWORKS

DTIC Science & Technology

2018-03-01

Advisor, Computing & Communications Division Information Directorate This report is published in the interest of scientific and technical...information accumulation at the physical layer, and study the cooperative routing and resource allocation problems associated with such SU networks...interference power constraint is studied . In [Shi2012Joint], an optimal power and sub-carrier allocation strategy to maximize SUs’ throughput subject to

Network clustering and community detection using modulus of families of loops.

PubMed

Shakeri, Heman; Poggi-Corradini, Pietro; Albin, Nathan; Scoglio, Caterina

2017-01-01

We study the structure of loops in networks using the notion of modulus of loop families. We introduce an alternate measure of network clustering by quantifying the richness of families of (simple) loops. Modulus tries to minimize the expected overlap among loops by spreading the expected link usage optimally. We propose weighting networks using these expected link usages to improve classical community detection algorithms. We show that the proposed method enhances the performance of certain algorithms, such as spectral partitioning and modularity maximization heuristics, on standard benchmarks.

Quantum speedup in solving the maximal-clique problem

NASA Astrophysics Data System (ADS)

Chang, Weng-Long; Yu, Qi; Li, Zhaokai; Chen, Jiahui; Peng, Xinhua; Feng, Mang

2018-03-01

The maximal-clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry, and bioinformatics to social networks. Here we develop a quantum algorithm to solve the maximal-clique problem for any graph G with n vertices with quadratic speedup over its classical counterparts, where the time and spatial complexities are reduced to, respectively, O (√{2n}) and O (n2) . With respect to oracle-related quantum algorithms for the NP-complete problems, we identify our algorithm as optimal. To justify the feasibility of the proposed quantum algorithm, we successfully solve a typical clique problem for a graph G with two vertices and one edge by carrying out a nuclear magnetic resonance experiment involving four qubits.

Use of groundwater lifetime expectancy for the performance assessment of a deep geologic waste repository: 1. Theory, illustrations, and implications

NASA Astrophysics Data System (ADS)

Cornaton, F. J.; Park, Y.-J.; Normani, S. D.; Sudicky, E. A.; Sykes, J. F.

2008-04-01

Long-term solutions for the disposal of toxic wastes usually involve isolation of the wastes in a deep subsurface geologic environment. In the case of spent nuclear fuel, if radionuclide leakage occurs from the engineered barrier, the geological medium represents the ultimate barrier that is relied upon to ensure safety. Consequently, an evaluation of radionuclide travel times from a repository to the biosphere is critically important in a performance assessment analysis. In this study, we develop a travel time framework based on the concept of groundwater lifetime expectancy as a safety indicator. Lifetime expectancy characterizes the time that radionuclides will spend in the subsurface after their release from the repository and prior to discharging into the biosphere. The probability density function of lifetime expectancy is computed throughout the host rock by solving the backward-in-time solute transport adjoint equation subject to a properly posed set of boundary conditions. It can then be used to define optimal repository locations. The risk associated with selected sites can be evaluated by simulating an appropriate contaminant release history. The utility of the method is illustrated by means of analytical and numerical examples, which focus on the effect of fracture networks on the uncertainty of evaluated lifetime expectancy.

Cluster Size Optimization in Sensor Networks with Decentralized Cluster-Based Protocols

PubMed Central

Amini, Navid; Vahdatpour, Alireza; Xu, Wenyao; Gerla, Mario; Sarrafzadeh, Majid

2011-01-01

Network lifetime and energy-efficiency are viewed as the dominating considerations in designing cluster-based communication protocols for wireless sensor networks. This paper analytically provides the optimal cluster size that minimizes the total energy expenditure in such networks, where all sensors communicate data through their elected cluster heads to the base station in a decentralized fashion. LEACH, LEACH-Coverage, and DBS comprise three cluster-based protocols investigated in this paper that do not require any centralized support from a certain node. The analytical outcomes are given in the form of closed-form expressions for various widely-used network configurations. Extensive simulations on different networks are used to confirm the expectations based on the analytical results. To obtain a thorough understanding of the results, cluster number variability problem is identified and inspected from the energy consumption point of view. PMID:22267882

Energy Efficient In-network RFID Data Filtering Scheme in Wireless Sensor Networks

PubMed Central

Bashir, Ali Kashif; Lim, Se-Jung; Hussain, Chauhdary Sajjad; Park, Myong-Soon

2011-01-01

RFID (Radio frequency identification) and wireless sensor networks are backbone technologies for pervasive environments. In integration of RFID and WSN, RFID data uses WSN protocols for multi-hop communications. Energy is a critical issue in WSNs; however, RFID data contains a lot of duplication. These duplications can be eliminated at the base station, but unnecessary transmissions of duplicate data within the network still occurs, which consumes nodes’ energy and affects network lifetime. In this paper, we propose an in-network RFID data filtering scheme that efficiently eliminates the duplicate data. For this we use a clustering mechanism where cluster heads eliminate duplicate data and forward filtered data towards the base station. Simulation results prove that our approach saves considerable amounts of energy in terms of communication and computational cost, compared to existing filtering schemes. PMID:22163999

Stoichiometry for activation of neuronal α7 nicotinic receptors

PubMed Central

Andersen, Natalia; Corradi, Jeremías; Sine, Steven M.; Bouzat, Cecilia

2013-01-01

Neuronal α7 nicotinic receptors elicit rapid cation influx in response to acetylcholine (ACh) or its hydrolysis product choline. They contribute to cognition, synaptic plasticity, and neuroprotection and have been implicated in neurodegenerative and neuropsychiatric disorders. α7, however, often localizes distal to sites of nerve-released ACh and binds ACh with low affinity, and thus elicits its biological response with low agonist occupancy. To assess the function of α7 when ACh occupies fewer than five of its identical binding sites, we measured the open-channel lifetime of individual receptors in which four of the five ACh binding sites were disabled. To improve the time resolution of the inherently brief α7 channel openings, background mutations or a potentiator was used to increase open duration. We find that, in receptors with only one intact binding site, the open-channel lifetime is indistinguishable from receptors with five intact binding sites, counter to expectations from prototypical neurotransmitter-gated ion channels where the open-channel lifetime increases with the number of binding sites occupied by agonist. Replacing the membrane-embedded domain of α7 by that of the related 5-HT3A receptor increases the number of sites that need to be occupied to achieve the maximal open-channel lifetime, thus revealing a unique interdependence between the detector and actuator domains of these receptors. The distinctive ability of a single occupancy to elicit a full biological response adapts α7 to volume transmission, a prevalent mechanism of ACh-mediated signaling in the nervous system and nonneuronal cells. PMID:24297903

Controlled release of cavity states into propagating modes induced via a single qubit

NASA Astrophysics Data System (ADS)

Pfaff, Wolfgang; Constantin, Marius; Reagor, Matthew; Axline, Christopher; Blumoff, Jacob; Chou, Kevin; Leghtas, Zaki; Touzard, Steven; Heeres, Reinier; Reinhold, Philip; Ofek, Nissim; Sliwa, Katrina; Frunzio, Luigi; Mirrahimi, Mazyar; Lehnert, Konrad; Jiang, Liang; Devoret, Michel; Schoelkopf, Robert

Photonic states stored in long-lived cavities are a promising platform for scalable quantum computing and for the realization of quantum networks. An important aspect in such a cavity-based architecture will be the controlled conversion of stored photonic states into propagating ones. This will allow, for instance, quantum state transfer between remote cavities. We demonstrate the controlled release of quantum states from a microwave resonator with millisecond lifetime in a 3D circuit QED system. Dispersive coupling of the cavity to a transmon qubit allows us to enable a four-wave mixing process that transfers the stored state into a second resonator from which it can leave the system through a transmission line. This permits us to evacuate the cavity on time scales that are orders of magnitude faster than the intrinsic lifetime. This Q-switching process can in principle be fully coherent, making our system highly promising for quantum state transfer between nodes in a quantum network of high-Q cavities.

Efficient Coding and Energy Efficiency Are Promoted by Balanced Excitatory and Inhibitory Synaptic Currents in Neuronal Network

PubMed Central

Yu, Lianchun; Shen, Zhou; Wang, Chen; Yu, Yuguo

2018-01-01

Selective pressure may drive neural systems to process as much information as possible with the lowest energy cost. Recent experiment evidence revealed that the ratio between synaptic excitation and inhibition (E/I) in local cortex is generally maintained at a certain value which may influence the efficiency of energy consumption and information transmission of neural networks. To understand this issue deeply, we constructed a typical recurrent Hodgkin-Huxley network model and studied the general principles that governs the relationship among the E/I synaptic current ratio, the energy cost and total amount of information transmission. We observed in such a network that there exists an optimal E/I synaptic current ratio in the network by which the information transmission achieves the maximum with relatively low energy cost. The coding energy efficiency which is defined as the mutual information divided by the energy cost, achieved the maximum with the balanced synaptic current. Although background noise degrades information transmission and imposes an additional energy cost, we find an optimal noise intensity that yields the largest information transmission and energy efficiency at this optimal E/I synaptic transmission ratio. The maximization of energy efficiency also requires a certain part of energy cost associated with spontaneous spiking and synaptic activities. We further proved this finding with analytical solution based on the response function of bistable neurons, and demonstrated that optimal net synaptic currents are capable of maximizing both the mutual information and energy efficiency. These results revealed that the development of E/I synaptic current balance could lead a cortical network to operate at a highly efficient information transmission rate at a relatively low energy cost. The generality of neuronal models and the recurrent network configuration used here suggest that the existence of an optimal E/I cell ratio for highly efficient energy costs and information maximization is a potential principle for cortical circuit networks. Summary We conducted numerical simulations and mathematical analysis to examine the energy efficiency of neural information transmission in a recurrent network as a function of the ratio of excitatory and inhibitory synaptic connections. We obtained a general solution showing that there exists an optimal E/I synaptic ratio in a recurrent network at which the information transmission as well as the energy efficiency of this network achieves a global maximum. These results reflect general mechanisms for sensory coding processes, which may give insight into the energy efficiency of neural communication and coding. PMID:29773979

Efficient Coding and Energy Efficiency Are Promoted by Balanced Excitatory and Inhibitory Synaptic Currents in Neuronal Network.

PubMed

Yu, Lianchun; Shen, Zhou; Wang, Chen; Yu, Yuguo

2018-01-01

Selective pressure may drive neural systems to process as much information as possible with the lowest energy cost. Recent experiment evidence revealed that the ratio between synaptic excitation and inhibition (E/I) in local cortex is generally maintained at a certain value which may influence the efficiency of energy consumption and information transmission of neural networks. To understand this issue deeply, we constructed a typical recurrent Hodgkin-Huxley network model and studied the general principles that governs the relationship among the E/I synaptic current ratio, the energy cost and total amount of information transmission. We observed in such a network that there exists an optimal E/I synaptic current ratio in the network by which the information transmission achieves the maximum with relatively low energy cost. The coding energy efficiency which is defined as the mutual information divided by the energy cost, achieved the maximum with the balanced synaptic current. Although background noise degrades information transmission and imposes an additional energy cost, we find an optimal noise intensity that yields the largest information transmission and energy efficiency at this optimal E/I synaptic transmission ratio. The maximization of energy efficiency also requires a certain part of energy cost associated with spontaneous spiking and synaptic activities. We further proved this finding with analytical solution based on the response function of bistable neurons, and demonstrated that optimal net synaptic currents are capable of maximizing both the mutual information and energy efficiency. These results revealed that the development of E/I synaptic current balance could lead a cortical network to operate at a highly efficient information transmission rate at a relatively low energy cost. The generality of neuronal models and the recurrent network configuration used here suggest that the existence of an optimal E/I cell ratio for highly efficient energy costs and information maximization is a potential principle for cortical circuit networks. We conducted numerical simulations and mathematical analysis to examine the energy efficiency of neural information transmission in a recurrent network as a function of the ratio of excitatory and inhibitory synaptic connections. We obtained a general solution showing that there exists an optimal E/I synaptic ratio in a recurrent network at which the information transmission as well as the energy efficiency of this network achieves a global maximum. These results reflect general mechanisms for sensory coding processes, which may give insight into the energy efficiency of neural communication and coding.

Interference-Robust Transmission in Wireless Sensor Networks

PubMed Central

Han, Jin-Seok; Lee, Yong-Hwan

2016-01-01

Low-power wireless sensor networks (WSNs) operating in unlicensed spectrum bands may seriously suffer from interference from other coexisting radio systems, such as IEEE 802.11 wireless local area networks. In this paper, we consider the improvement of the transmission performance of low-power WSNs by adjusting the transmission rate and the payload size in response to the change of co-channel interference. We estimate the probability of transmission failure and the data throughput and then determine the payload size to maximize the throughput performance. We investigate that the transmission time maximizing the normalized throughput is not much affected by the transmission rate, but rather by the interference condition. We adjust the transmission rate and the transmission time in response to the change of the channel and interference condition, respectively. Finally, we verify the performance of the proposed scheme by computer simulation. The simulation results show that the proposed scheme significantly improves data throughput compared with conventional schemes while preserving energy efficiency even in the presence of interference. PMID:27854249

Interference-Robust Transmission in Wireless Sensor Networks.

PubMed

Han, Jin-Seok; Lee, Yong-Hwan

2016-11-14

Low-power wireless sensor networks (WSNs) operating in unlicensed spectrum bands may seriously suffer from interference from other coexisting radio systems, such as IEEE 802.11 wireless local area networks. In this paper, we consider the improvement of the transmission performance of low-power WSNs by adjusting the transmission rate and the payload size in response to the change of co-channel interference. We estimate the probability of transmission failure and the data throughput and then determine the payload size to maximize the throughput performance. We investigate that the transmission time maximizing the normalized throughput is not much affected by the transmission rate, but rather by the interference condition. We adjust the transmission rate and the transmission time in response to the change of the channel and interference condition, respectively. Finally, we verify the performance of the proposed scheme by computer simulation. The simulation results show that the proposed scheme significantly improves data throughput compared with conventional schemes while preserving energy efficiency even in the presence of interference.

Optimal deployment of resources for maximizing impact in spreading processes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lokhov, Andrey Y.; Saad, David

The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of “influential spreaders” for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings, the problem is often characterized by heterogeneous interactions and requires interventions in a dynamic fashion over a finite time window via a restricted set of controllable nodes. The optimal distributionmore » of available resources hence results from an interplay between network topology and spreading dynamics. Here, we show how these problems can be addressed as particular instances of a universal analytical framework based on a scalable dynamic message-passing approach and demonstrate the efficacy of the method on a variety of real-world examples.« less

Optimal deployment of resources for maximizing impact in spreading processes

DOE PAGES

Lokhov, Andrey Y.; Saad, David

2017-09-12

The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of “influential spreaders” for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings, the problem is often characterized by heterogeneous interactions and requires interventions in a dynamic fashion over a finite time window via a restricted set of controllable nodes. The optimal distributionmore » of available resources hence results from an interplay between network topology and spreading dynamics. Here, we show how these problems can be addressed as particular instances of a universal analytical framework based on a scalable dynamic message-passing approach and demonstrate the efficacy of the method on a variety of real-world examples.« less

Information Overload and Viral Marketing: Countermeasures and Strategies

NASA Astrophysics Data System (ADS)

Cheng, Jiesi; Sun, Aaron; Zeng, Daniel

Studying information diffusion through social networks has become an active research topic with important implications in viral marketing applications. One of the fundamental algorithmic problems related to viral marketing is the Influence Maximization (IM) problem: given an social network, which set of nodes should be considered by the viral marketer as the initial targets, in order to maximize the influence of the advertising message. In this work, we study the IM problem in an information-overloaded online social network. Information overload occurs when individuals receive more information than they can process, which can cause negative impacts on the overall marketing effectiveness. Many practical countermeasures have been proposed for alleviating the load of information on recipients. However, how these approaches can benefit viral marketers is not well understood. In our work, we have adapted the classic Information Cascade Model to incorporate information overload and study its countermeasures. Our results suggest that effective control of information overload has the potential to improve marketing effectiveness, but the targeting strategy should be re-designed in response to these countermeasures.

Experimental and Computational Studies of Cortical Neural Network Properties Through Signal Processing

NASA Astrophysics Data System (ADS)

Clawson, Wesley Patrick

Previous studies, both theoretical and experimental, of network level dynamics in the cerebral cortex show evidence for a statistical phenomenon called criticality; a phenomenon originally studied in the context of phase transitions in physical systems and that is associated with favorable information processing in the context of the brain. The focus of this thesis is to expand upon past results with new experimentation and modeling to show a relationship between criticality and the ability to detect and discriminate sensory input. A line of theoretical work predicts maximal sensory discrimination as a functional benefit of criticality, which can then be characterized using mutual information between sensory input, visual stimulus, and neural response,. The primary finding of our experiments in the visual cortex in turtles and neuronal network modeling confirms this theoretical prediction. We show that sensory discrimination is maximized when visual cortex operates near criticality. In addition to presenting this primary finding in detail, this thesis will also address our preliminary results on change-point-detection in experimentally measured cortical dynamics.

Research of ad hoc network based on SINCGARS network

NASA Astrophysics Data System (ADS)

Nie, Hao; Cai, Xiaoxia; Chen, Hong; Chen, Jian; Weng, Pengfei

2016-03-01

In today's world, science and technology make a spurt of progress, so society has entered the era of information technology, network. Only the comprehensive use of electronic warfare and network warfare means can we maximize their access to information and maintain the information superiority. Combined with the specific combat mission and operational requirements, the research design and construction in accordance with the actual military which are Suitable for the future of information technology needs of the tactical Adhoc network, tactical internet, will greatly improve the operational efficiency of the command of the army. Through the study of the network of the U.S. military SINCGARS network, it can explore the routing protocol and mobile model, to provide a reference for the research of our army network.

Determinants of Sexual Network Structure and Their Impact on Cumulative Network Measures

PubMed Central

Schmid, Boris V.; Kretzschmar, Mirjam

2012-01-01

There are four major quantities that are measured in sexual behavior surveys that are thought to be especially relevant for the performance of sexual network models in terms of disease transmission. These are (i) the cumulative distribution of lifetime number of partners, (ii) the distribution of partnership durations, (iii) the distribution of gap lengths between partnerships, and (iv) the number of recent partners. Fitting a network model to these quantities as measured in sexual behavior surveys is expected to result in a good description of Chlamydia trachomatis transmission in terms of the heterogeneity of the distribution of infection in the population. Here we present a simulation model of a sexual contact network, in which we explored the role of behavioral heterogeneity of simulated individuals on the ability of the model to reproduce population-level sexual survey data from the Netherlands and UK. We find that a high level of heterogeneity in the ability of individuals to acquire and maintain (additional) partners strongly facilitates the ability of the model to accurately simulate the powerlaw-like distribution of the lifetime number of partners, and the age at which these partnerships were accumulated, as surveyed in actual sexual contact networks. Other sexual network features, such as the gap length between partnerships and the partnership duration, could–at the current level of detail of sexual survey data against which they were compared–be accurately modeled by a constant value (for transitional concurrency) and by exponential distributions (for partnership duration). Furthermore, we observe that epidemiological measures on disease prevalence in survey data can be used as a powerful tool for building accurate sexual contact networks, as these measures provide information on the level of mixing between individuals of different levels of sexual activity in the population, a parameter that is hard to acquire through surveying individuals. PMID:22570594

An Online Algorithm for Maximizing Submodular Functions

DTIC Science & Technology

2007-12-20

dynamics of the social network are known. In theory, our online algorithms could be used to adapt a marketing campaign to unknown or time-varying social...An Online Algorithm for Maximizing Submodular Functions Matthew Streeter Daniel Golovin December 20, 2007 CMU-CS-07-171 School of Computer Science...number. 1. REPORT DATE 20 DEC 2007 2. REPORT TYPE 3. DATES COVERED 00-00-2007 to 00-00-2007 4. TITLE AND SUBTITLE An Online Algorithm for

An energy efficient multiple mobile sinks based routing algorithm for wireless sensor networks

NASA Astrophysics Data System (ADS)

Zhong, Peijun; Ruan, Feng

2018-03-01

With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.

Automatic physical inference with information maximizing neural networks

NASA Astrophysics Data System (ADS)

Charnock, Tom; Lavaux, Guilhem; Wandelt, Benjamin D.

2018-04-01

Compressing large data sets to a manageable number of summaries that are informative about the underlying parameters vastly simplifies both frequentist and Bayesian inference. When only simulations are available, these summaries are typically chosen heuristically, so they may inadvertently miss important information. We introduce a simulation-based machine learning technique that trains artificial neural networks to find nonlinear functionals of data that maximize Fisher information: information maximizing neural networks (IMNNs). In test cases where the posterior can be derived exactly, likelihood-free inference based on automatically derived IMNN summaries produces nearly exact posteriors, showing that these summaries are good approximations to sufficient statistics. In a series of numerical examples of increasing complexity and astrophysical relevance we show that IMNNs are robustly capable of automatically finding optimal, nonlinear summaries of the data even in cases where linear compression fails: inferring the variance of Gaussian signal in the presence of noise, inferring cosmological parameters from mock simulations of the Lyman-α forest in quasar spectra, and inferring frequency-domain parameters from LISA-like detections of gravitational waveforms. In this final case, the IMNN summary outperforms linear data compression by avoiding the introduction of spurious likelihood maxima. We anticipate that the automatic physical inference method described in this paper will be essential to obtain both accurate and precise cosmological parameter estimates from complex and large astronomical data sets, including those from LSST and Euclid.

Navigable networks as Nash equilibria of navigation games.

PubMed

Gulyás, András; Bíró, József J; Kőrösi, Attila; Rétvári, Gábor; Krioukov, Dmitri

2015-07-03

Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges, by altering which one can efficiently improve or paralyse navigation in the network.

Near-optimality of special periodic protocols for fluid models of single server switched networks with switchover times

NASA Astrophysics Data System (ADS)

Matveev, A. S.; Ishchenko, R.

2017-11-01

We consider a generic deterministic time-invariant fluid model of a single server switched network, which consists of finitely many infinite size buffers (queues) and receives constant rate inflows of jobs from the outside. Any flow undergoes a multi-phase service, entering a specific buffer after every phase, and ultimately leaves the network; the route of the flow over the buffers is pre-specified, and flows may merge inside the network. They share a common source of service, which can serve at most one buffer at a time and has to switch among buffers from time to time; any switch consumes a nonzero switchover period. With respect to the long-run maximal scaled wip (work in progress) performance metric, near-optimality of periodic scheduling and service protocols is established: the deepest optimum (that is over all feasible processes in the network, irrespective of the initial state) is furnished by such a protocol up to as small error as desired. Moreover, this can be achieved with a special periodic protocol introduced in the paper. It is also shown that the exhaustive policy is optimal for any buffer whose service at the maximal rate does not cause growth of the scaled wip.

A Gap-Filling Procedure for Hydrologic Data Based on Kalman Filtering and Expectation Maximization: Application to Data from the Wireless Sensor Networks of the Sierra Nevada

NASA Astrophysics Data System (ADS)

Coogan, A.; Avanzi, F.; Akella, R.; Conklin, M. H.; Bales, R. C.; Glaser, S. D.

2017-12-01

Automatic meteorological and snow stations provide large amounts of information at dense temporal resolution, but data quality is often compromised by noise and missing values. We present a new gap-filling and cleaning procedure for networks of these stations based on Kalman filtering and expectation maximization. Our method utilizes a multi-sensor, regime-switching Kalman filter to learn a latent process that captures dependencies between nearby stations and handles sharp changes in snowfall rate. Since the latent process is inferred using observations across working stations in the network, it can be used to fill in large data gaps for a malfunctioning station. The procedure was tested on meteorological and snow data from Wireless Sensor Networks (WSN) in the American River basin of the Sierra Nevada. Data include air temperature, relative humidity, and snow depth from dense networks of 10 to 12 stations within 1 km2 swaths. Both wet and dry water years have similar data issues. Data with artificially created gaps was used to quantify the method's performance. Our multi-sensor approach performs better than a single-sensor one, especially with large data gaps, as it learns and exploits the dominant underlying processes in snowpack at each site.

Multiscale Embedded Gene Co-expression Network Analysis

PubMed Central

Song, Won-Min; Zhang, Bin

2015-01-01

Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma. PMID:26618778

Multiscale Embedded Gene Co-expression Network Analysis.

PubMed

Song, Won-Min; Zhang, Bin

2015-11-01

Gene co-expression network analysis has been shown effective in identifying functional co-expressed gene modules associated with complex human diseases. However, existing techniques to construct co-expression networks require some critical prior information such as predefined number of clusters, numerical thresholds for defining co-expression/interaction, or do not naturally reproduce the hallmarks of complex systems such as the scale-free degree distribution of small-worldness. Previously, a graph filtering technique called Planar Maximally Filtered Graph (PMFG) has been applied to many real-world data sets such as financial stock prices and gene expression to extract meaningful and relevant interactions. However, PMFG is not suitable for large-scale genomic data due to several drawbacks, such as the high computation complexity O(|V|3), the presence of false-positives due to the maximal planarity constraint, and the inadequacy of the clustering framework. Here, we developed a new co-expression network analysis framework called Multiscale Embedded Gene Co-expression Network Analysis (MEGENA) by: i) introducing quality control of co-expression similarities, ii) parallelizing embedded network construction, and iii) developing a novel clustering technique to identify multi-scale clustering structures in Planar Filtered Networks (PFNs). We applied MEGENA to a series of simulated data and the gene expression data in breast carcinoma and lung adenocarcinoma from The Cancer Genome Atlas (TCGA). MEGENA showed improved performance over well-established clustering methods and co-expression network construction approaches. MEGENA revealed not only meaningful multi-scale organizations of co-expressed gene clusters but also novel targets in breast carcinoma and lung adenocarcinoma.

Competition-Driven Network Dynamics: Emergence of a Scale-Free Leadership Structure and Collective Efficiency

NASA Astrophysics Data System (ADS)

Anghel, M.; Toroczkai, Zoltán; Bassler, Kevin E.; Korniss, G.

2004-02-01

Using the minority game as a model for competition dynamics, we investigate the effects of interagent communications across a network on the global evolution of the game. Agent communication across this network leads to the formation of an influence network, which is dynamically coupled to the evolution of the game, and it is responsible for the information flow driving the agents' actions. We show that the influence network spontaneously develops hubs with a broad distribution of in-degrees, defining a scale-free robust leadership structure. Furthermore, in realistic parameter ranges, facilitated by information exchange on the network, agents can generate a high degree of cooperation making the collective almost maximally efficient.

Residual energy level based clustering routing protocol for wireless sensor networks

NASA Astrophysics Data System (ADS)

Yuan, Xu; Zhong, Fangming; Chen, Zhikui; Yang, Deli

2015-12-01

The wireless sensor networks, which nodes prone to premature death, with unbalanced energy consumption and a short life time, influenced the promotion and application of this technology in internet of things in agriculture. This paper proposes a clustering routing protocol based on the residual energy level (RELCP). RELCP includes three stages: the selection of cluster head, establishment of cluster and data transmission. RELCP considers the remaining energy level and distance to base station, while election of cluster head nodes and data transmitting. Simulation results demonstrate that the protocol can efficiently balance the energy dissipation of all nodes, and prolong the network lifetime.

Retirement investment theory explains patterns in songbird nest-site choice

PubMed Central

Streby, Henry M.; Refsnider, Jeanine M.; Peterson, Sean M.; Andersen, David E.

2014-01-01

When opposing evolutionary selection pressures act on a behavioural trait, the result is often stabilizing selection for an intermediate optimal phenotype, with deviations from the predicted optimum attributed to tracking a moving target, development of behavioural syndromes or shifts in riskiness over an individual's lifetime. We investigated nest-site choice by female golden-winged warblers, and the selection pressures acting on that choice by two fitness components, nest success and fledgling survival. We observed strong and consistent opposing selection pressures on nest-site choice for maximizing these two fitness components, and an abrupt, within-season switch in the fitness component birds prioritize via nest-site choice, dependent on the time remaining for additional nesting attempts. We found that females consistently deviated from the predicted optimal behaviour when choosing nest sites because they can make multiple attempts at one fitness component, nest success, but only one attempt at the subsequent component, fledgling survival. Our results demonstrate a unique natural strategy for balancing opposing selection pressures to maximize total fitness. This time-dependent switch from high to low risk tolerance in nest-site choice maximizes songbird fitness in the same way a well-timed switch in human investor risk tolerance can maximize one's nest egg at retirement. Our results also provide strong evidence for the adaptive nature of songbird nest-site choice, which we suggest has been elusive primarily due to a lack of consideration for fledgling survival. PMID:24403320

Dynamic Spectrum Access for Internet of Things Service in Cognitive Radio-Enabled LPWANs

PubMed Central

Moon, Bongkyo

2017-01-01

In this paper, we focus on a dynamic spectrum access strategy for Internet of Things (IoT) applications in two types of radio systems: cellular networks and cognitive radio-enabled low power wide area networks (CR-LPWANs). The spectrum channel contention between the licensed cellular networks and the unlicensed CR-LPWANs, which work with them, only takes place within the cellular radio spectrum range. Our aim is to maximize the spectrum capacity for the unlicensed users while ensuring that it never interferes with the licensed network. Therefore, in this paper we propose a dynamic spectrum access strategy for CR-LPWANs operating in both licensed and unlicensed bands. The simulation and the numerical analysis by using a matrix geometric approach for the strategy are presented. Finally, we obtain the blocking probability of the licensed users, the mean dwell time of the unlicensed user, and the total carried traffic and combined service quality for the licensed and unlicensed users. The results show that the proposed strategy can maximize the spectrum capacity for the unlicensed users using IoT applications as well as keep the service quality of the licensed users independent of them. PMID:29206215

Dynamic Spectrum Access for Internet of Things Service in Cognitive Radio-Enabled LPWANs.

PubMed

Moon, Bongkyo

2017-12-05

In this paper, we focus on a dynamic spectrum access strategy for Internet of Things (IoT) applications in two types of radio systems: cellular networks and cognitive radio-enabled low power wide area networks (CR-LPWANs). The spectrum channel contention between the licensed cellular networks and the unlicensed CR-LPWANs, which work with them, only takes place within the cellular radio spectrum range. Our aim is to maximize the spectrum capacity for the unlicensed users while ensuring that it never interferes with the licensed network. Therefore, in this paper we propose a dynamic spectrum access strategy for CR-LPWANs operating in both licensed and unlicensed bands. The simulation and the numerical analysis by using a matrix geometric approach for the strategy are presented. Finally, we obtain the blocking probability of the licensed users, the mean dwell time of the unlicensed user, and the total carried traffic and combined service quality for the licensed and unlicensed users. The results show that the proposed strategy can maximize the spectrum capacity for the unlicensed users using IoT applications as well as keep the service quality of the licensed users independent of them.

Optimal resource allocation strategy for two-layer complex networks

NASA Astrophysics Data System (ADS)

Ma, Jinlong; Wang, Lixin; Li, Sufeng; Duan, Congwen; Liu, Yu

2018-02-01

We study the traffic dynamics on two-layer complex networks, and focus on its delivery capacity allocation strategy to enhance traffic capacity measured by the critical value Rc. With the limited packet-delivering capacity, we propose a delivery capacity allocation strategy which can balance the capacities of non-hub nodes and hub nodes to optimize the data flow. With the optimal value of parameter αc, the maximal network capacity is reached because most of the nodes have shared the appropriate delivery capacity by the proposed delivery capacity allocation strategy. Our work will be beneficial to network service providers to design optimal networked traffic dynamics.

Critical behavior of the contact process in a multiscale network

NASA Astrophysics Data System (ADS)

Ferreira, Silvio C.; Martins, Marcelo L.

2007-09-01

Inspired by dengue and yellow fever epidemics, we investigated the contact process (CP) in a multiscale network constituted by one-dimensional chains connected through a Barabási-Albert scale-free network. In addition to the CP dynamics inside the chains, the exchange of individuals between connected chains (travels) occurs at a constant rate. A finite epidemic threshold and an epidemic mean lifetime diverging exponentially in the subcritical phase, concomitantly with a power law divergence of the outbreak’s duration, were found. A generalized scaling function involving both regular and SF components was proposed for the quasistationary analysis and the associated critical exponents determined, demonstrating that the CP on this hybrid network and nonvanishing travel rates establishes a new universality class.

Supporting the Maritime Information Dominance: Optimizing Tactical Network for Biometric Data Sharing in Maritime Interdiction Operations

DTIC Science & Technology

2015-03-01

information dominance in the maritime domain by optimizing tactical mobile ad hoc network (MANET) systems for wireless sharing of biometric data in maritime interdiction operations (MIO). Current methods for sharing biometric data in MIO are unnecessarily slow and do not leverage wireless networks at the tactical edge to maximize information dominance . Field experiments allow students to test wireless MANETs at the tactical edge. Analysis is focused on determining optimal MANET design and implementation. It considers various implementations with

Networking Micro-Processors for Effective Computer Utilization in Nursing

PubMed Central

Mangaroo, Jewellean; Smith, Bob; Glasser, Jay; Littell, Arthur; Saba, Virginia

1982-01-01

Networking as a social entity has important implications for maximizing computer resources for improved utilization in nursing. This paper describes the one process of networking of complementary resources at three institutions. Prairie View A&M University, Texas A&M University and the University of Texas School of Public Health, which has effected greater utilization of computers at the college. The results achieved in this project should have implications for nurses, users, and consumers in the development of computer resources.

Convergent neuromodulation onto a network neuron can have divergent effects at the network level.

PubMed

Kintos, Nickolas; Nusbaum, Michael P; Nadim, Farzan

2016-04-01

Different neuromodulators often target the same ion channel. When such modulators act on different neuron types, this convergent action can enable a rhythmic network to produce distinct outputs. Less clear are the functional consequences when two neuromodulators influence the same ion channel in the same neuron. We examine the consequences of this seeming redundancy using a mathematical model of the crab gastric mill (chewing) network. This network is activated in vitro by the projection neuron MCN1, which elicits a half-center bursting oscillation between the reciprocally-inhibitory neurons LG and Int1. We focus on two neuropeptides which modulate this network, including a MCN1 neurotransmitter and the hormone crustacean cardioactive peptide (CCAP). Both activate the same voltage-gated current (I MI ) in the LG neuron. However, I MI-MCN1 , resulting from MCN1 released neuropeptide, has phasic dynamics in its maximal conductance due to LG presynaptic inhibition of MCN1, while I MI-CCAP retains the same maximal conductance in both phases of the gastric mill rhythm. Separation of time scales allows us to produce a 2D model from which phase plane analysis shows that, as in the biological system, I MI-MCN1 and I MI-CCAP primarily influence the durations of opposing phases of this rhythm. Furthermore, I MI-MCN1 influences the rhythmic output in a manner similar to the Int1-to-LG synapse, whereas I MI-CCAP has an influence similar to the LG-to-Int1 synapse. These results show that distinct neuromodulators which target the same voltage-gated ion channel in the same network neuron can nevertheless produce distinct effects at the network level, providing divergent neuromodulator actions on network activity.

Convergent neuromodulation onto a network neuron can have divergent effects at the network level

PubMed Central

Kintos, Nickolas; Nusbaum, Michael P.; Nadim, Farzan

2016-01-01

Different neuromodulators often target the same ion channel. When such modulators act on different neuron types, this convergent action can enable a rhythmic network to produce distinct outputs. Less clear are the functional consequences when two neuromodulators influence the same ion channel in the same neuron. We examine the consequences of this seeming redundancy using a mathematical model of the crab gastric mill (chewing) network. This network is activated in vitro by the projection neuron MCN1, which elicits a half-center bursting oscillation between the reciprocally-inhibitory neurons LG and Int1. We focus on two neuropeptides which modulate this network, including a MCN1 neurotransmitter and the hormone crustacean cardioactive peptide (CCAP). Both activate the same voltage-gated current (IMI) in the LG neuron. However, IMI-MCN1, resulting from MCN1 released neuropeptide, has phasic dynamics in its maximal conductance due to LG presynaptic inhibition of MCN1, while IMI-CCAP retains the same maximal conductance in both phases of the gastric mill rhythm. Separation of time scales allows us to produce a 2D model from which phase plane analysis shows that, as in the biological system, IMI-MCN1 and IMI-CCAP primarily influence the durations of opposing phases of this rhythm. Furthermore, IMI-MCN1 influences the rhythmic output in a manner similar to the Int1-to-LG synapse, whereas IMI-CCAP has an influence similar to the LG-to-Int1 synapse. These results show that distinct neuromodulators which target the same voltage-gated ion channel in the same network neuron can nevertheless produce distinct effects at the network level, providing divergent neuromodulator actions on network activity. PMID:26798029

Signatures of hypermassive neutron star lifetimes on r-process nucleosynthesis in the disc ejecta from neutron star mergers

NASA Astrophysics Data System (ADS)

Lippuner, Jonas; Fernández, Rodrigo; Roberts, Luke F.; Foucart, Francois; Kasen, Daniel; Metzger, Brian D.; Ott, Christian D.

2017-11-01

We investigate the nucleosynthesis of heavy elements in the winds ejected by accretion discs formed in neutron star mergers. We compute the element formation in disc outflows from hypermassive neutron star (HMNS) remnants of variable lifetime, including the effect of angular momentum transport in the disc evolution. We employ long-term axisymmetric hydrodynamic disc simulations to model the ejecta, and compute r-process nucleosynthesis with tracer particles using a nuclear reaction network containing ∼8000 species. We find that the previously known strong correlation between HMNS lifetime, ejected mass and average electron fraction in the outflow is directly related to the amount of neutrino irradiation on the disc, which dominates mass ejection at early times in the form of a neutrino-driven wind. Production of lanthanides and actinides saturates at short HMNS lifetimes (≲10 ms), with additional ejecta contributing to a blue optical kilonova component for longer-lived HMNSs. We find good agreement between the abundances from the disc outflow alone and the solar r-process distribution only for short HMNS lifetimes (≲10 ms). For longer lifetimes, the rare-earth and third r-process peaks are significantly underproduced compared to the solar pattern, requiring additional contributions from the dynamical ejecta. The nucleosynthesis signature from a spinning black hole (BH) can only overlap with that from an HMNS of moderate lifetime (≲60 ms). Finally, we show that angular momentum transport not only contributes with a late-time outflow component, but that it also enhances the neutrino-driven component by moving material to shallower regions of the gravitational potential, in addition to providing additional heating.

Hybrid Radio Frequency/Free-Space Optics (RF/FSO) Wireless Sensor Network: Security Concerns and Protective Measures

NASA Astrophysics Data System (ADS)

Banerjee, Koushik; Sharma, Hemant; Sengupta, Anasuya

Wireless sensor networks (WSNs) are ad hoc wireless networks that are written off as spread out structure and ad hoc deployment. Sensor networks have all the rudimentary features of ad hoc networks but to altered points—for instance, considerably lesser movement and far more energy necessities. Commonly used technology for communication is radio frequency (RF) communications. Free-space optics (FSO) is relatively new technology which has the prospective to deliver remarkable increases in network lifetime of WSN. Hybrid RF/FSO communications has been suggested to decrease power consumption by a single sensor node. It is observed that security plays a very important role for either RF WSN or hybrid RF/FSO WSN as those are vulnerable to numerous threats. In this paper, various possible attacks in RF/FSO WSN are discussed and aimed to propose some way out from those attacks.

Multi-mode clustering model for hierarchical wireless sensor networks

NASA Astrophysics Data System (ADS)

Hu, Xiangdong; Li, Yongfu; Xu, Huifen

2017-03-01

The topology management, i.e., clusters maintenance, of wireless sensor networks (WSNs) is still a challenge due to its numerous nodes, diverse application scenarios and limited resources as well as complex dynamics. To address this issue, a multi-mode clustering model (M2 CM) is proposed to maintain the clusters for hierarchical WSNs in this study. In particular, unlike the traditional time-trigger model based on the whole-network and periodic style, the M2 CM is proposed based on the local and event-trigger operations. In addition, an adaptive local maintenance algorithm is designed for the broken clusters in the WSNs using the spatial-temporal demand changes accordingly. Numerical experiments are performed using the NS2 network simulation platform. Results validate the effectiveness of the proposed model with respect to the network maintenance costs, node energy consumption and transmitted data as well as the network lifetime.

Study on the effect of sink moving trajectory on wireless sensor networks

NASA Astrophysics Data System (ADS)

Zhong, Peijun; Ruan, Feng

2018-03-01

Wireless sensor networks are developing very fast in recent years, due to their wide potential applications. However there exists the so-called hot spot problem, namely the nodes close to static sink node tend to die earlier than other nodes since they have heavier burden to forward. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we make extensive experimental simulations for circular sensor network, with one mobile sink moving along different radius circumference. The whole network is divided into several clusters and there is one cluster head (CH) inside each cluster. The ordinary sensors communicate with CH and CHs construct a chain until the sink node. Simulation results show that the best network performance appears when sink moves along 0.25 R in terms of network lifetime.

An energy-efficient data gathering protocol in large wireless sensor network

NASA Astrophysics Data System (ADS)

Wang, Yamin; Zhang, Ruihua; Tao, Shizhong

2006-11-01

Wireless sensor network consisting of a large number of small sensors with low-power transceiver can be an effective tool for gathering data in a variety of environment. The collected data must be transmitted to the base station for further processing. Since a network consists of sensors with limited battery energy, the method for data gathering and routing must be energy efficient in order to prolong the lifetime of the network. In this paper, we presented an energy-efficient data gathering protocol in wireless sensor network. The new protocol used data fusion technology clusters nodes into groups and builds a chain among the cluster heads according to a hybrid of the residual energy and distance to the base station. Results in stochastic geometry are used to derive the optimum parameter of our algorithm that minimizes the total energy spent in the network. Simulation results show performance superiority of the new protocol.

Relationship between extreme ultraviolet microflares and small-scale magnetic fields in the quiet Sun

NASA Astrophysics Data System (ADS)

Jiang, Fayu; Zhang, Jun; Yang, Shuhong

2016-04-01

Microflares are small dynamic signatures observed in X-ray and extreme-ultraviolet channels. Because of their impulsive emission enhancements and wide distribution, they are thought to be closely related to coronal heating. By using the high resolution 171 Å images from the Atmospheric Imaging Assembly and the lines-of-sight magnetograms obtained by the Helioseismic and Magnetic Imager on board the Solar Dynamics Observatory, we trace 10794 microflares in a quiet region near the disk center with a field of view of 960''× 1068'' during 24 hr. The microflares have an occurrence rate of 4.4 × 103 hr-1 extrapolated over the whole Sun. Their average brightness, size, and lifetime are 1.7 I0 (of the quiet Sun), 9.6 Mm2, and 3.6 min, respectively. There exists a mutual positive correlation between the microflares' brightness, area and lifetime. In general, the microflares distribute uniformly across the solar disk, but form network patterns locally, which are similar to and matched with the magnetic network structures. Typical cases show that the microflares prefer to occur in magnetic cancellation regions of network boundaries. We roughly calculate the upper limit of energy flux supplied by the microflares and find that the result is still a factor of ˜15 below the coronal heating requirement.

Relationship between extreme ultraviolet microflares and small-scale magnetic fields in the quiet Sun

NASA Astrophysics Data System (ADS)

Jiang, Fayu; Zhang, Jun; Yang, Shuhong

2015-06-01

Microflares are small dynamic signatures observed in X-ray and extreme-ultraviolet channels. Because of their impulsive emission enhancements and wide distribution, they are thought to be closely related to coronal heating. By using the high-resolution 171 Å images from the Atmospheric Imaging Assembly and the lines-of-sight magnetograms obtained by the Helioseismic and Magnetic Imager on board the Solar Dynamics Observatory, we trace 10794 microflares in a quiet region near the disk center with a field of view of 960″ × 1068″ during 24 hr. The microflares have an occurrence rate of 4.4 × 103 hr-1 extrapolated over the whole Sun. Their average brightness, size, and lifetime are 1.7I0 (of the quiet Sun), 9.6 Mm2, and 3.6 min, respectively. There exists a mutual positive correlation between the microflares' brightness, area, and lifetime. In general, the microflares distribute uniformly across the solar disk, but form network patterns locally, which are similar to and matched with the magnetic network structures. Typical cases show that the microflares prefer to occur in magnetic cancellation regions of network boundaries. We roughly calculate the upper limit of energy flux supplied by the microflares and find that the result is still a factor of ˜ 15 below the coronal heating requirement.

Low-complex energy-aware image communication in visual sensor networks

NASA Astrophysics Data System (ADS)

Phamila, Yesudhas Asnath Victy; Amutha, Ramachandran

2013-10-01

A low-complex, low bit rate, energy-efficient image compression algorithm explicitly designed for resource-constrained visual sensor networks applied for surveillance, battle field, habitat monitoring, etc. is presented, where voluminous amount of image data has to be communicated over a bandwidth-limited wireless medium. The proposed method overcomes the energy limitation of individual nodes and is investigated in terms of image quality, entropy, processing time, overall energy consumption, and system lifetime. This algorithm is highly energy efficient and extremely fast since it applies energy-aware zonal binary discrete cosine transform (DCT) that computes only the few required significant coefficients and codes them using enhanced complementary Golomb Rice code without using any floating point operations. Experiments are performed using the Atmel Atmega128 and MSP430 processors to measure the resultant energy savings. Simulation results show that the proposed energy-aware fast zonal transform consumes only 0.3% of energy needed by conventional DCT. This algorithm consumes only 6% of energy needed by Independent JPEG Group (fast) version, and it suits for embedded systems requiring low power consumption. The proposed scheme is unique since it significantly enhances the lifetime of the camera sensor node and the network without any need for distributed processing as was traditionally required in existing algorithms.

Unstable matter and the 1-0 MeV gamma-ray background

NASA Technical Reports Server (NTRS)

Daly, Ruth A.

1988-01-01

The spectrum of photons produced by an unstable particle which decayed while the universe was young is calculated. This spectrum is compared to that of the 1-10 MeV shoulder, a feature of the high-energy, extragalactic gamma-ray background, whose origin has not yet been determined. The calculated spectrum contains two parameters which are adjusted to obtain a maximal fit to the observed spectrum; the fit thus obtained is accurate to the 99 percent confidence level. The implications for the mass, lifetime, initial abundance, and branching ratio of the unstable particle are discussed.

Space Shuttle Orbiter oxygen partial pressure sensing and control system improvements

NASA Technical Reports Server (NTRS)

Frampton, Robert F.; Hoy, Dennis M.; Kelly, Kevin J.; Walleshauser, James J.

1992-01-01

A program aimed at developing a new PPO2 oxygen sensor and a replacement amplifier for the Space Shuttle Orbiter is described. Experimental design methodologies used in the test and modeling process made it possible to enhance the effectiveness of the program and to reduce its cost. Significant cost savings are due to the increased lifetime of the basic sensor cell, the maximization of useful sensor life through an increased amplifier gain adjustment capability, the use of streamlined production processes for the manufacture of the assemblies, and the refurbishment capability of the replacement sensor.

Detecting hidden particles with MATHUSLA

NASA Astrophysics Data System (ADS)

Evans, Jared A.

2018-03-01

A hidden sector containing light long-lived particles provides a well-motivated place to find new physics. The recently proposed MATHUSLA experiment has the potential to be extremely sensitive to light particles originating from rare meson decays in the very long lifetime region. In this work, we illustrate this strength with the specific example of a light scalar mixed with the standard model-like Higgs boson, a model where MATHUSLA can further probe unexplored parameter space from exotic Higgs decays. Design augmentations should be considered in order to maximize the ability of MATHUSLA to discover very light hidden sector particles.

Intraoperative optical biopsy for brain tumors using spectro-lifetime properties of intrinsic fluorophores

NASA Astrophysics Data System (ADS)

Vasefi, Fartash; Kittle, David S.; Nie, Zhaojun; Falcone, Christina; Patil, Chirag G.; Chu, Ray M.; Mamelak, Adam N.; Black, Keith L.; Butte, Pramod V.

2016-04-01

We have developed and tested a system for real-time intra-operative optical identification and classification of brain tissues using time-resolved fluorescence spectroscopy (TRFS). A supervised learning algorithm using linear discriminant analysis (LDA) employing selected intrinsic fluorescence decay temporal points in 6 spectral bands was employed to maximize statistical significance difference between training groups. The linear discriminant analysis on in vivo human tissues obtained by TRFS measurements (N = 35) were validated by histopathologic analysis and neuronavigation correlation to pre-operative MRI images. These results demonstrate that TRFS can differentiate between normal cortex, white matter and glioma.

Navigable networks as Nash equilibria of navigation games

PubMed Central

Gulyás, András; Bíró, József J.; Kőrösi, Attila; Rétvári, Gábor; Krioukov, Dmitri

2015-01-01

Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges, by altering which one can efficiently improve or paralyse navigation in the network. PMID:26138277

Classroom Norms and Individual Smoking Behavior in Middle School

ERIC Educational Resources Information Center

Yarnell, Lisa M.; Brown, H. Shelton, III; Pasch, Keryn E.; Perry, Cheryl L.; Komro, Kelli A.

2012-01-01

Objectives: To investigate whether smoking prevalence in grade-level networks influences individual smoking, suggesting that peers are important social multipliers in teen smoking. Methods: We measured gender-specific, grade-level recent and life-time smoking among urban middle-school students who participated in Project Northland Chicago in a…

FUSE: a profit maximization approach for functional summarization of biological networks.

PubMed

Seah, Boon-Siew; Bhowmick, Sourav S; Dewey, C Forbes; Yu, Hanry

2012-03-21

The availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein interaction network (PPI) using graph theoretic analysis. Despite the recent progress, systems level analysis of PPIS remains a daunting task as it is challenging to make sense out of the deluge of high-dimensional interaction data. Specifically, techniques that automatically abstract and summarize PPIS at multiple resolutions to provide high level views of its functional landscape are still lacking. We present a novel data-driven and generic algorithm called FUSE (Functional Summary Generator) that generates functional maps of a PPI at different levels of organization, from broad process-process level interactions to in-depth complex-complex level interactions, through a pro t maximization approach that exploits Minimum Description Length (MDL) principle to maximize information gain of the summary graph while satisfying the level of detail constraint. We evaluate the performance of FUSE on several real-world PPIS. We also compare FUSE to state-of-the-art graph clustering methods with GO term enrichment by constructing the biological process landscape of the PPIS. Using AD network as our case study, we further demonstrate the ability of FUSE to quickly summarize the network and identify many different processes and complexes that regulate it. Finally, we study the higher-order connectivity of the human PPI. By simultaneously evaluating interaction and annotation data, FUSE abstracts higher-order interaction maps by reducing the details of the underlying PPI to form a functional summary graph of interconnected functional clusters. Our results demonstrate its effectiveness and superiority over state-of-the-art graph clustering methods with GO term enrichment.

Maximizing the Potential of Telecommunications Technology.

ERIC Educational Resources Information Center

Young, Dennis M.

2003-01-01

Offers advice on planning a reliable and cost-effective school telecommunications system, including issues such as the layered nature of many schools' systems, and the move from centralized to distributed networks. (EV)

An efficient coordination protocol for wireless sensor networks

NASA Astrophysics Data System (ADS)

Paruchuri, Vamsi; Durresi, Arjan; Durresi, Mimoza; Barolli, Leonard

2005-10-01

Backbones infrastructures in wireless sensor networks reduce the communication overhead and energy consumption. In this paper, we present BackBone Routing (BBR), a fully distributed protocol for construction and rotation of backbone networks. BBR reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Another key feature of BBR is its energy balancing nature by distributing the role of being Backbone Node among all the nodes. BBR builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Improvement in system lifetime due to BBR increases as the ratio of idle-to-sleep energy consumption increases, and increases as the density of the network increases. Our experiments show that BBR is more efficient in saving energy and extending network life without deteriorating network performance when compared with geographical shortest path routing.

Criticality of forcing directions on the fragmentation and resilience of grid networks.

PubMed

Abundo, Cheryl; Monterola, Christopher; Legara, Erika Fille

2014-08-27

A general framework for probing the dynamic evolution of spatial networks comprised of nodes applying force amongst each other is presented. Aside from the already reported magnitude of forces and elongation thresholds, we show that preservation of links in a network is also crucially dependent on how nodes are connected and how edges are directed. We demonstrate that the time it takes for the networks to reach its equilibrium network structure follows a robust power law relationship consistent with Basquin's law with an exponent that can be tuned by changing only the force directions. Further, we illustrate that networks with different connection structures, node positions and edge directions have different Basquin's exponent which can be used to distinguish spatial directed networks from each other. Using an extensive waiting time simulation that spans up to over 16 orders of magnitude, we establish that the presence of memory combined with the scale-free bursty dynamics of edge breaking at the micro level leads to the evident macroscopic power law distribution of network lifetime.

Properties of highly clustered networks

NASA Astrophysics Data System (ADS)

Newman, M. E.

2003-08-01

We propose and solve exactly a model of a network that has both a tunable degree distribution and a tunable clustering coefficient. Among other things, our results indicate that increased clustering leads to a decrease in the size of the giant component of the network. We also study susceptible/infective/recovered type epidemic processes within the model and find that clustering decreases the size of epidemics, but also decreases the epidemic threshold, making it easier for diseases to spread. In addition, clustering causes epidemics to saturate sooner, meaning that they infect a near-maximal fraction of the network for quite low transmission rates.

An Embedded Wireless Sensor Network with Wireless Power Transmission Capability for the Structural Health Monitoring of Reinforced Concrete Structures

PubMed Central

Gallucci, Luca; Menna, Costantino; Angrisani, Leopoldo; Asprone, Domenico

2017-01-01

Maintenance strategies based on structural health monitoring can provide effective support in the optimization of scheduled repair of existing structures, thus enabling their lifetime to be extended. With specific regard to reinforced concrete (RC) structures, the state of the art seems to still be lacking an efficient and cost-effective technique capable of monitoring material properties continuously over the lifetime of a structure. Current solutions can typically only measure the required mechanical variables in an indirect, but economic, manner, or directly, but expensively. Moreover, most of the proposed solutions can only be implemented by means of manual activation, making the monitoring very inefficient and then poorly supported. This paper proposes a structural health monitoring system based on a wireless sensor network (WSN) that enables the automatic monitoring of a complete structure. The network includes wireless distributed sensors embedded in the structure itself, and follows the monitoring-based maintenance (MBM) approach, with its ABCDE paradigm, namely: accuracy, benefit, compactness, durability, and easiness of operations. The system is structured in a node level and has a network architecture that enables all the node data to converge in a central unit. Human control is completely unnecessary until the periodic evaluation of the collected data. Several tests are conducted in order to characterize the system from a metrological point of view and assess its performance and effectiveness in real RC conditions. PMID:29112128

Effective Network Size Predicted From Simulations of Pathogen Outbreaks Through Social Networks Provides a Novel Measure of Structure-Standardized Group Size.

PubMed

McCabe, Collin M; Nunn, Charles L

2018-01-01

The transmission of infectious disease through a population is often modeled assuming that interactions occur randomly in groups, with all individuals potentially interacting with all other individuals at an equal rate. However, it is well known that pairs of individuals vary in their degree of contact. Here, we propose a measure to account for such heterogeneity: effective network size (ENS), which refers to the size of a maximally complete network (i.e., unstructured, where all individuals interact with all others equally) that corresponds to the outbreak characteristics of a given heterogeneous, structured network. We simulated susceptible-infected (SI) and susceptible-infected-recovered (SIR) models on maximally complete networks to produce idealized outbreak duration distributions for a disease on a network of a given size. We also simulated the transmission of these same diseases on random structured networks and then used the resulting outbreak duration distributions to predict the ENS for the group or population. We provide the methods to reproduce these analyses in a public R package, "enss." Outbreak durations of simulations on randomly structured networks were more variable than those on complete networks, but tended to have similar mean durations of disease spread. We then applied our novel metric to empirical primate networks taken from the literature and compared the information represented by our ENSs to that by other established social network metrics. In AICc model comparison frameworks, group size and mean distance proved to be the metrics most consistently associated with ENS for SI simulations, while group size, centralization, and modularity were most consistently associated with ENS for SIR simulations. In all cases, ENS was shown to be associated with at least two other independent metrics, supporting its use as a novel metric. Overall, our study provides a proof of concept for simulation-based approaches toward constructing metrics of ENS, while also revealing the conditions under which this approach is most promising.

Influence of dental restorations and mastication loadings on dentine fatigue behaviour: Image-based modelling approach.

PubMed

Vukicevic, Arso M; Zelic, Ksenija; Jovicic, Gordana; Djuric, Marija; Filipovic, Nenad

2015-05-01

The aim of this study was to use Finite Element Analysis (FEA) to estimate the influence of various mastication loads and different tooth treatments (composite restoration and endodontic treatment) on dentine fatigue. The analysis of fatigue behaviour of human dentine in intact and composite restored teeth with root-canal-treatment using FEA and fatigue theory was performed. Dentine fatigue behaviour was analysed in three virtual models: intact, composite-restored and endodontically-treated tooth. Volumetric change during the polymerization of composite was modelled by thermal expansion in a heat transfer analysis. Low and high shrinkage stresses were obtained by varying the linear shrinkage of composite. Mastication forces were applied occlusally with the load of 100, 150 and 200N. Assuming one million cycles, Fatigue Failure Index (FFI) was determined using Goodman's criterion while residual fatigue lifetime assessment was performed using Paris-power law. The analysis of the Goodman diagram gave both maximal allowed crack size and maximal number of cycles for the given stress ratio. The size of cracks was measured on virtual models. For the given conditions, fatigue-failure is not likely to happen neither in the intact tooth nor in treated teeth with low shrinkage stress. In the cases of high shrinkage stress, crack length was much larger than the maximal allowed crack and failure occurred with 150 and 200N loads. The maximal allowed crack size was slightly lower in the tooth with root canal treatment which induced somewhat higher FFI than in the case of tooth with only composite restoration. Main factors that lead to dentine fatigue are levels of occlusal load and polymerization stress. However, root canal treatment has small influence on dentine fatigue. The methodology proposed in this study provides a new insight into the fatigue behaviour of teeth after dental treatments. Furthermore, it estimates maximal allowed crack size and maximal number of cycles for a specific case. Copyright © 2015 Elsevier Ltd. All rights reserved.

Model of electron lifetimes inside the plasmasphere calculated using a CRRES derived hiss wave amplitude model

NASA Astrophysics Data System (ADS)

Orlova, Ksenia; Spasojevic, Maria; Shprits, Yuri

Particle populations in the inner magnetosphere can change by orders of magnitude on very short time scales. For the last decade observations and theoretical computations showed that resonant interaction of electrons with various plasma waves plays an important role in acceleration and loss mechanisms. Using data from the CRRES plasma wave experiment, we develop quadratic fits to the mean of the wave amplitude squared for plasmaspheric hiss as a function of geomagnetic activity (Kp) and magnetic latitude (lambda) for the dayside (6

Neural Network (NN) retrievals of Stratocumulus cloud properties using multi-angle polarimetric observations during ORACLES

NASA Astrophysics Data System (ADS)

Segal-Rosenhaimer, M.; Knobelspiesse, K. D.; Redemann, J.; Cairns, B.; Alexandrov, M. D.

2016-12-01

The ORACLES (ObseRvations of Aerosols above CLouds and their intEractionS) campaign is taking place in the South-East Atlantic during the Austral Spring for three consecutive years from 2016-2018. The study area encompasses one of the Earth's three semi-permanent subtropical Stratocumulus (Sc) cloud decks, and experiences very large aerosol optical depths, mainly biomass burning, originating from Africa. Over time, cloud optical depth (COD), lifetime and cloud microphysics (number concentration, effective radii Reff and precipitation) are expected to be influenced by indirect aerosol effects. These changes play a key role in the energetic balance of the region, and are part of the core investigation objectives of the ORACLES campaign, which acquires measurements of clean and polluted scenes of above cloud aerosols (ACA). Simultaneous retrievals of aerosol and cloud optical properties are being developed (e.g. MODIS, OMI), but still challenging, especially for passive, single viewing angle instruments. By comparison, multiangle polarimetric instruments like RSP (Research Scanning Polarimeter) show promise for detection and quantification of ACA, however, there are no operational retrieval algorithms available yet. Here we describe a new algorithm to retrieve cloud and aerosol optical properties from observations by RSP flown on the ER-2 and P-3 during the 2016 ORACLES campaign. The algorithm is based on training a NN, and is intended to retrieve aerosol and cloud properties simultaneously. However, the first step was to establish the retrieval scheme for low level Sc cloud optical properties. The NN training was based on simulated RSP total and polarized radiances for a range of COD, Reff, and effective variances, spanning 7 wavelength bands and 152 viewing zenith angles. Random and correlated noise were added to the simulations to achieve a more realistic representation of the signals. Before introducing the input variables to the network, the signals are projected on a principle component plane that retains the maximal signal information but minimizes the noise contribution. We will discuss parameter choices for the network and present preliminary results of cloud retrievals from ORACLES, compared with standard RSP low-level cloud retrieval method that has been validated against in situ observations.

Maximum Data Collection Rate Routing Protocol Based on Topology Control for Rechargeable Wireless Sensor Networks.

PubMed

Lin, Haifeng; Bai, Di; Gao, Demin; Liu, Yunfei

2016-07-30

In Rechargeable Wireless Sensor Networks (R-WSNs), in order to achieve the maximum data collection rate it is critical that sensors operate in very low duty cycles because of the sporadic availability of energy. A sensor has to stay in a dormant state in most of the time in order to recharge the battery and use the energy prudently. In addition, a sensor cannot always conserve energy if a network is able to harvest excessive energy from the environment due to its limited storage capacity. Therefore, energy exploitation and energy saving have to be traded off depending on distinct application scenarios. Since higher data collection rate or maximum data collection rate is the ultimate objective for sensor deployment, surplus energy of a node can be utilized for strengthening packet delivery efficiency and improving the data generating rate in R-WSNs. In this work, we propose an algorithm based on data aggregation to compute an upper data generation rate by maximizing it as an optimization problem for a network, which is formulated as a linear programming problem. Subsequently, a dual problem by introducing Lagrange multipliers is constructed, and subgradient algorithms are used to solve it in a distributed manner. At the same time, a topology controlling scheme is adopted for improving the network's performance. Through extensive simulation and experiments, we demonstrate that our algorithm is efficient at maximizing the data collection rate in rechargeable wireless sensor networks.

A Decade of Experience: Which Network Structures Maximize Fire Service Capacity for Homeland Security Incidents in Metropolitan Regions?

DTIC Science & Technology

2011-12-01

Pennsylvania Emergency Management Agency QHSR Quadrennial Homeland Security Review Report RCP Regional Catastrophic Preparedness SAA State...service has evolved from a single-purpose service focused on controlling fires to a multidimensional response element responsible for pre- hospital ... hospital preparedness program Preparedness Training for all personnel; training and network activities during prior year assist in preparedness

A 250-Mbit/s ring local computer network using 1.3-microns single-mode optical fibers

NASA Technical Reports Server (NTRS)

Eng, S. T.; Tell, R.; Andersson, T.; Eng, B.

1985-01-01

A 250-Mbit/s three-station fiber-optic ring local computer network was built and successfully demonstrated. A conventional token protocol was employed for bus arbitration to maximize the bus efficiency under high loading conditions, and a non-return-to-zero (NRS) data encoding format was selected for simplicity and maximum utilization of the ECL-circuit bandwidth.

Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time

DTIC Science & Technology

2011-01-01

523 10 Arabisopsis thaliana 1745 3098 71 12 Drosophila melanogaster 7282 24894 176 12 Homo Sapiens 9527 31182 308 12 Schizosaccharomyces pombe 2031...clusters of actors [6,14,28,40] and may be used as features in exponential random graph models for statistical analysis of social networks [17,19,20,44,49...29. R. Horaud and T. Skordas. Stereo correspondence through feature grouping and maximal cliques. IEEE Trans. Patt. An. Mach. Int. 11(11):1168–1180

An Incentive-based Online Optimization Framework for Distribution Grids

DOE PAGES

Zhou, Xinyang; Dall'Anese, Emiliano; Chen, Lijun; ...

2017-10-09

This article formulates a time-varying social-welfare maximization problem for distribution grids with distributed energy resources (DERs) and develops online distributed algorithms to identify (and track) its solutions. In the considered setting, network operator and DER-owners pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. The proposed algorithm affords an online implementation to enable tracking of the solutions in the presence of time-varying operational conditions and changing optimization objectives. It involves a strategy where the network operator collects voltage measurements throughout the feeder to build incentive signals for the DER-owners in real time; DERs thenmore » adjust the generated/consumed powers in order to avoid the violation of the voltage constraints while maximizing given objectives. Stability of the proposed schemes is analytically established and numerically corroborated.« less

An Incentive-based Online Optimization Framework for Distribution Grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhou, Xinyang; Dall'Anese, Emiliano; Chen, Lijun

This article formulates a time-varying social-welfare maximization problem for distribution grids with distributed energy resources (DERs) and develops online distributed algorithms to identify (and track) its solutions. In the considered setting, network operator and DER-owners pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. The proposed algorithm affords an online implementation to enable tracking of the solutions in the presence of time-varying operational conditions and changing optimization objectives. It involves a strategy where the network operator collects voltage measurements throughout the feeder to build incentive signals for the DER-owners in real time; DERs thenmore » adjust the generated/consumed powers in order to avoid the violation of the voltage constraints while maximizing given objectives. Stability of the proposed schemes is analytically established and numerically corroborated.« less

Multidimensional density shaping by sigmoids.

PubMed

Roth, Z; Baram, Y

1996-01-01

An estimate of the probability density function of a random vector is obtained by maximizing the output entropy of a feedforward network of sigmoidal units with respect to the input weights. Classification problems can be solved by selecting the class associated with the maximal estimated density. Newton's optimization method, applied to the estimated density, yields a recursive estimator for a random variable or a random sequence. A constrained connectivity structure yields a linear estimator, which is particularly suitable for "real time" prediction. A Gaussian nonlinearity yields a closed-form solution for the network's parameters, which may also be used for initializing the optimization algorithm when other nonlinearities are employed. A triangular connectivity between the neurons and the input, which is naturally suggested by the statistical setting, reduces the number of parameters. Applications to classification and forecasting problems are demonstrated.

Accelerating the Mining of Influential Nodes in Complex Networks through Community Detection

DOE Office of Scientific and Technical Information (OSTI.GOV)

Halappanavar, Mahantesh; Sathanur, Arun V.; Nandi, Apurba

Computing the set of influential nodes with a given size to ensure maximal spread of influence on a complex network is a challenging problem impacting multiple applications. A rigorous approach to influence maximization involves utilization of optimization routines that comes with a high computational cost. In this work, we propose to exploit the existence of communities in complex networks to accelerate the mining of influential seeds. We provide intuitive reasoning to explain why our approach should be able to provide speedups without significantly degrading the extent of the spread of influence when compared to the case of influence maximization withoutmore » using the community information. Additionally, we have parallelized the complete workflow by leveraging an existing parallel implementation of the Louvain community detection algorithm. We then conduct a series of experiments on a dataset with three representative graphs to first verify our implementation and then demonstrate the speedups. Our method achieves speedups ranging from 3x - 28x for graphs with small number of communities while nearly matching or even exceeding the activation performance on the entire graph. Complexity analysis reveals that dramatic speedups are possible for larger graphs that contain a correspondingly larger number of communities. In addition to the speedups obtained from the utilization of the community structure, scalability results show up to 6.3x speedup on 20 cores relative to the baseline run on 2 cores. Finally, current limitations of the approach are outlined along with the planned next steps.« less

Incentive-Based Voltage Regulation in Distribution Networks: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhou, Xinyang; Chen, Lijun; Dall'Anese, Emiliano

This paper considers distribution networks fea- turing distributed energy resources, and designs incentive-based mechanisms that allow the network operator and end-customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Two different network-customer coordination mechanisms that require different amounts of information shared between the network operator and end-customers are developed to identify a solution of a well-defined social-welfare maximization prob- lem. Notably, the signals broadcast by the network operator assume the connotation of prices/incentives that induce the end- customers to adjust the generated/consumed powers in order to avoid the violation of the voltagemore » constraints. Stability of the proposed schemes is analytically established and numerically corroborated.« less

Incentive-Based Voltage Regulation in Distribution Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall-Anese, Emiliano; Baker, Kyri A; Zhou, Xinyang

This paper considers distribution networks fea- turing distributed energy resources, and designs incentive-based mechanisms that allow the network operator and end-customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Two different network-customer coordination mechanisms that require different amounts of information shared between the network operator and end-customers are developed to identify a solution of a well-defined social-welfare maximization prob- lem. Notably, the signals broadcast by the network operator assume the connotation of prices/incentives that induce the end- customers to adjust the generated/consumed powers in order to avoid the violation of the voltagemore » constraints. Stability of the proposed schemes is analytically established and numerically corroborated.« less

Modeling and optimization of Quality of Service routing in Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Rafsanjani, Marjan Kuchaki; Fatemidokht, Hamideh; Balas, Valentina Emilia

2016-01-01

Mobile ad hoc networks (MANETs) are a group of mobile nodes that are connected without using a fixed infrastructure. In these networks, nodes communicate with each other by forming a single-hop or multi-hop network. To design effective mobile ad hoc networks, it is important to evaluate the performance of multi-hop paths. In this paper, we present a mathematical model for a routing protocol under energy consumption and packet delivery ratio of multi-hop paths. In this model, we use geometric random graphs rather than random graphs. Our proposed model finds effective paths that minimize the energy consumption and maximizes the packet delivery ratio of the network. Validation of the mathematical model is performed through simulation.

Complete graph model for community detection

NASA Astrophysics Data System (ADS)

Sun, Peng Gang; Sun, Xiya

2017-04-01

Community detection brings plenty of considerable problems, which has attracted more attention for many years. This paper develops a new framework, which tries to measure the interior and the exterior of a community based on a same metric, complete graph model. In particular, the exterior is modeled as a complete bipartite. We partition a network into subnetworks by maximizing the difference between the interior and the exterior of the subnetworks. In addition, we compare our approach with some state of the art methods on computer-generated networks based on the LFR benchmark as well as real-world networks. The experimental results indicate that our approach obtains better results for community detection, is capable of splitting irregular networks and achieves perfect results on the karate network and the dolphin network.

Wireless Sensor Node Power Profiling Based on IEEE 802.11 and IEEE 802.15.4 Communication Protocols. Modeling and Simulation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Agarwal, Vivek; Richardson, Joseph; Zhang, Yanliang

Most wireless sensor network (comprising of thousands of WSNs) applications require operation over extended periods of time beginning with their deployment. Network lifetime is extremely critical for most applications and is one of the limiting factors for energy-constrained networks. Based on applications, there are wide ranges of different energy sources suitable for powering WSNs. A battery is traditionally used to power WSNs. The deployed WSN is required to last for long time. Due to finite amount of energy present in batteries, it is not feasible to replace batteries. Recently there has been a new surge in the area of energymore » harvesting were ambient energy in the environment can be utilized to prolong the lifetime of WSNs. Some of the sources of ambient energies are solar power, thermal gradient, human motion and body heat, vibrations, and ambient RF energy. The design and development of TEGs to power WSNs that would remain active for a long period of time requires comprehensive understanding of WSN operational. This motivates the research in modeling the lifetime, i.e., power consumption, of a WSN by taking into consideration various node and network level activities. A WSN must perform three essential tasks: sense events, perform quick local information processing of sensed events, and wirelessly exchange locally processed data with the base station or with other WSNs in the network. Each task has a power cost per unit tine and an additional cost when switching between tasks. There are number of other considerations that must also be taken into account when computing the power consumption associated with each task. The considerations includes: number of events occurring in a fixed active time period and the duration of each event, event-information processing time, total communication time, number of retransmission, etc. Additionally, at the network level the communication of information data packets between WSNs involves collisions, latency, and retransmission, which result in unanticipated power losses. This report focuses rigorous stochastic modeling of power demand for a schedule-driven WSN utilizing Institute of Electrical and Electronics Engineers 802.11 and 802.15.4 communication protocols. The model captures the generic operation of a schedule-driven WSN when an external event occurs, i.e., sensing, following by processing, and followed by communication. The report will present development of an expression to compute the expected energy consumption per operational cycle of a schedule-driven WSN by taking into consideration the node level activities, i.e., sensing and processing, and the network level activities, i.e., channel access, packet collision, retransmission attempts, and transmission of a data packet.« less

Temporal lobe epilepsy and affective disorders: the role of the subgenual anterior cingulate cortex.

PubMed

Stretton, J; Pope, R A; Winston, G P; Sidhu, M K; Symms, M; Duncan, J S; Koepp, M; Thompson, P J; Foong, J

2015-02-01

Reduced deactivation within the default mode network (DMN) is common in individuals with primary affective disorders relative to healthy volunteers (HVs). It is unknown whether similar network abnormalities are present in temporal lobe epilepsy (TLE) patients with a history of affective psychopathology. 17 TLE patients with a lifetime affective diagnosis, 31 TLE patients with no formal psychiatric history and 30 HVs were included. We used a visuo-spatial 'n-back' paradigm to compare working memory (WM) network activation between these groups. Post hoc analyses included voxel-based morphometry and diffusion tensor imaging. The Beck Depression Inventory-Fast Screen and Beck Anxiety Inventory were completed on the day of scanning. Each group activated the fronto-parietal WM networks and deactivated the typical DMN in response to increasing task demands. Group comparison revealed that TLE patients with lifetime affective morbidity showed significantly greater deactivation in subgenual anterior cingulate cortex (sACC) than either the TLE-only or the HVs (p<0.001). This effect persisted after covarying for current psychotropic medication and severity of current depressive/anxiety symptoms (all p<0.001). Correlational analysis revealed that this finding was not driven by differences in task performance. There were no significant differences in grey matter volume or structural connectivity between the TLE groups. Our results provide novel evidence suggesting that affective psychopathology in TLE has a neurobiological correlate, and in this context the sACC performs differently compared with network activity in primary affective disorders. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

Data Gathering and Energy Transfer Dilemma in UAV-Assisted Flying Access Network for IoT.

PubMed

Arabi, Sara; Sabir, Essaid; Elbiaze, Halima; Sadik, Mohamed

2018-05-11

Recently, Unmanned Aerial Vehicles (UAVs) have emerged as an alternative solution to assist wireless networks, thanks to numerous advantages they offer in comparison to terrestrial fixed base stations. For instance, a UAV can be used to embed a flying base station providing an on-demand nomadic access to network services. A UAV can also be used to wirelessly recharge out-of-battery ground devices. In this paper, we aim to deal with both data collection and recharging depleted ground Internet-of-Things (IoT) devices through a UAV station used as a flying base station. To extend the network lifetime, we present a novel use of UAV with energy harvesting module and wireless recharging capabilities. However, the UAV is used as an energy source to empower depleted IoT devices. On one hand, the UAV charges depleted ground IoT devices under three policies: (1) low-battery first scheme; (2) high-battery first scheme; and (3) random scheme. On the other hand, the UAV station collects data from IoT devices that have sufficient energy to transmit their packets, and in the same phase, the UAV exploits the Radio Frequency (RF) signals transmitted by IoT devices to extract and harvest energy. Furthermore, and as the UAV station has a limited coverage time due to its energy constraints, we propose and investigate an efficient trade-off between ground users recharging time and data gathering time. Furthermore, we suggest to control and optimize the UAV trajectory in order to complete its travel within a minimum time, while minimizing the energy spent and/or enhancing the network lifetime. Extensive numerical results and simulations show how the system behaves under different scenarios and using various metrics in which we examine the added value of UAV with energy harvesting module.

The NASA Science Internet: An integrated approach to networking

NASA Technical Reports Server (NTRS)

Rounds, Fred

1991-01-01

An integrated approach to building a networking infrastructure is an absolute necessity for meeting the multidisciplinary science networking requirements of the Office of Space Science and Applications (OSSA) science community. These networking requirements include communication connectivity between computational resources, databases, and library systems, as well as to other scientists and researchers around the world. A consolidated networking approach allows strategic use of the existing science networking within the Federal government, and it provides networking capability that takes into consideration national and international trends towards multivendor and multiprotocol service. It also offers a practical vehicle for optimizing costs and maximizing performance. Finally, and perhaps most important to the development of high speed computing is that an integrated network constitutes a focus for phasing to the National Research and Education Network (NREN). The NASA Science Internet (NSI) program, established in mid 1988, is structured to provide just such an integrated network. A description of the NSI is presented.

Using NetMaster to manage IBM networks

NASA Technical Reports Server (NTRS)

Ginsburg, Guss

1991-01-01

After defining a network and conveying its importance to support the activities at the JSC, the need for network management based on the size and complexity of the IBM SNA network at JSC is demonstrated. Network Management consists of being aware of component status and the ability to control resources to meet the availability and service needs of users. The concerns of the user are addressed as well as those of the staff responsible for managing the network. It is explained how NetMaster (a network management system for managing SNA networks) is used to enhance reliability and maximize service to SNA network users through automated procedures. The following areas are discussed: customization, problem and configuration management, and system measurement applications of NetMaster. Also, several examples are given that demonstrate NetMaster's ability to manage and control the network, integrate various product functions, as well as provide useful management information.

The Design of Passive Optical Networking+Ethernet over Coaxial Cable Access Networking and Video-on-Demand Services Carrying

NASA Astrophysics Data System (ADS)

Ji, Wei

2013-07-01

Video on demand is a very attractive service used for entertainment, education, and other purposes. The design of passive optical networking+Ethernet over coaxial cable accessing and a home gateway system is proposed. The network integrates the passive optical networking and Ethernet over coaxial cable to provide high dedicated bandwidth for the metropolitan video-on-demand services. Using digital video broadcasting, IP television protocol, unicasting, and broadcasting mechanisms maximizes the system throughput. The home gateway finishes radio frequency signal receiving and provides three kinds of interfaces for high-definition video, voice, and data, which achieves triple-play and wire/wireless access synchronously.

Magnetic flux transport of decaying active regions and enhanced magnetic network. [of solar supergranulation

NASA Technical Reports Server (NTRS)

Wang, Haimin; Zirin, Harold; Ai, Guoxiang

1991-01-01

Several series of coordinated observations on decaying active regions and enhanced magnetic network regions on the sun were carried out jointly at Big Bear Solar Observatory and at the Huairou Solar Observing Station of the Bejing Astronomical Observatory in China. The magnetic field evolution in several regions was followed closely for three to seven days. The magnetic flux transport from the remnants of decayed active regions was studied, along with the evolution and lifetime of the magnetic network which defines the boundaries of supergranules. The magnetic flux transport in an enhanced network region was studied in detail and found to be negative. Also briefly described are some properties of moving magnetic features around a sunspot. Results of all of the above studies are presented.

The moderating role of social networks in the relationship between alcohol consumption and treatment utilization for alcohol-related problems

PubMed Central

Mowbray, Orion

2014-01-01

Many individuals wait until alcohol use becomes severe before treatment is sought. However, social networks, or the number of social groups an individual belongs to, may play a moderating role in this relationship. Logistic regression examined the interaction of alcohol consumption and social networks as a predictor of treatment utilization while adjusting for sociodemographic and clinical variables among 1,433 lifetime alcohol-dependent respondents from wave 2 of the National Epidemiologic Survey on Alcohol Related Conditions (NESARC). Results showed that social networks moderate the relationship between alcohol consumption and treatment utilization such that for individuals with few network ties, the relationship between alcohol consumption and treatment utilization was diminished, compared to the relationship between alcohol consumption and treatment utilization for individuals with many network ties. Findings offer insight into how social networks, at times, can influence individuals to pursue treatment, while at other times, influence individuals to stay out of treatment, or seek treatment substitutes. PMID:24462223

Markov State Models of gene regulatory networks.

PubMed

Chu, Brian K; Tse, Margaret J; Sato, Royce R; Read, Elizabeth L

2017-02-06

Gene regulatory networks with dynamics characterized by multiple stable states underlie cell fate-decisions. Quantitative models that can link molecular-level knowledge of gene regulation to a global understanding of network dynamics have the potential to guide cell-reprogramming strategies. Networks are often modeled by the stochastic Chemical Master Equation, but methods for systematic identification of key properties of the global dynamics are currently lacking. The method identifies the number, phenotypes, and lifetimes of long-lived states for a set of common gene regulatory network models. Application of transition path theory to the constructed Markov State Model decomposes global dynamics into a set of dominant transition paths and associated relative probabilities for stochastic state-switching. In this proof-of-concept study, we found that the Markov State Model provides a general framework for analyzing and visualizing stochastic multistability and state-transitions in gene networks. Our results suggest that this framework-adopted from the field of atomistic Molecular Dynamics-can be a useful tool for quantitative Systems Biology at the network scale.

Genetic counseling and cascade genetic testing in Lynch syndrome.

PubMed

Hampel, Heather

2016-07-01

Lynch syndrome is the most common cause of inherited colorectal and endometrial cancers. Individuals with Lynch syndrome have a 10-80 % lifetime risk for colorectal cancer and a 15-60 % lifetime risk for endometrial cancer. Both cancers are preventable through chemoprevention, intensive cancer surveillance, and risk-reducing surgery options. Efforts to identify as many individuals with Lynch syndrome as possible will prevent cancers and save lives. This includes the traditional cancer genetic counseling model whereby individuals with and without cancer are evaluated for a possible Lynch syndrome diagnosis based on their personal and family history of colon polyps and cancers. It also includes universal tumor screening for Lynch syndrome whereby all individuals with colorectal or endometrial cancer are screened for tumor features of Lynch syndrome at the time of diagnosis. Those with tumors suspicious for Lynch syndrome are referred for cancer genetic counseling regardless of their family history of cancer. This two approaches must be maximized to attain high patient reach. Finally, and perhaps most importantly, cascade testing among the at-risk relatives of those diagnosed with Lynch syndrome is critically important to maximize the diagnosis of individuals with Lynch syndrome. In fact, the cost-effectiveness of universal tumor screening for Lynch syndrome relies entirely on counseling and testing as many at-risk individuals as possible since young unaffected individuals stand to benefit the most from an early diagnosis of Lynch syndrome. This approach must be optimized to achieve high family reach. It will take a concerted effort from patients, clinicians and public health officials to improve current approaches to the diagnosis of Lynch syndrome and the prevention and treatment of Lynch syndrome-associated cancer but these lessons can be applied to other conditions as the ultimate example of personalized medicine.

Performance Analysis of Physical Layer Security of Opportunistic Scheduling in Multiuser Multirelay Cooperative Networks

PubMed Central

Shim, Kyusung; Do, Nhu Tri; An, Beongku

2017-01-01

In this paper, we study the physical layer security (PLS) of opportunistic scheduling for uplink scenarios of multiuser multirelay cooperative networks. To this end, we propose a low-complexity, yet comparable secrecy performance source relay selection scheme, called the proposed source relay selection (PSRS) scheme. Specifically, the PSRS scheme first selects the least vulnerable source and then selects the relay that maximizes the system secrecy capacity for the given selected source. Additionally, the maximal ratio combining (MRC) technique and the selection combining (SC) technique are considered at the eavesdropper, respectively. Investigating the system performance in terms of secrecy outage probability (SOP), closed-form expressions of the SOP are derived. The developed analysis is corroborated through Monte Carlo simulation. Numerical results show that the PSRS scheme significantly improves the secure ability of the system compared to that of the random source relay selection scheme, but does not outperform the optimal joint source relay selection (OJSRS) scheme. However, the PSRS scheme drastically reduces the required amount of channel state information (CSI) estimations compared to that required by the OJSRS scheme, specially in dense cooperative networks. PMID:28212286

Introducing health gains in location-allocation models: A stochastic model for planning the delivery of long-term care

NASA Astrophysics Data System (ADS)

Cardoso, T.; Oliveira, M. D.; Barbosa-Póvoa, A.; Nickel, S.

2015-05-01

Although the maximization of health is a key objective in health care systems, location-allocation literature has not yet considered this dimension. This study proposes a multi-objective stochastic mathematical programming approach to support the planning of a multi-service network of long-term care (LTC), both in terms of services location and capacity planning. This approach is based on a mixed integer linear programming model with two objectives - the maximization of expected health gains and the minimization of expected costs - with satisficing levels in several dimensions of equity - namely, equity of access, equity of utilization, socioeconomic equity and geographical equity - being imposed as constraints. The augmented ε-constraint method is used to explore the trade-off between these conflicting objectives, with uncertainty in the demand and delivery of care being accounted for. The model is applied to analyze the (re)organization of the LTC network currently operating in the Great Lisbon region in Portugal for the 2014-2016 period. Results show that extending the network of LTC is a cost-effective investment.

Maximization of Learning Speed in the Motor Cortex Due to Neuronal Redundancy

PubMed Central

Takiyama, Ken; Okada, Masato

2012-01-01

Many redundancies play functional roles in motor control and motor learning. For example, kinematic and muscle redundancies contribute to stabilizing posture and impedance control, respectively. Another redundancy is the number of neurons themselves; there are overwhelmingly more neurons than muscles, and many combinations of neural activation can generate identical muscle activity. The functional roles of this neuronal redundancy remains unknown. Analysis of a redundant neural network model makes it possible to investigate these functional roles while varying the number of model neurons and holding constant the number of output units. Our analysis reveals that learning speed reaches its maximum value if and only if the model includes sufficient neuronal redundancy. This analytical result does not depend on whether the distribution of the preferred direction is uniform or a skewed bimodal, both of which have been reported in neurophysiological studies. Neuronal redundancy maximizes learning speed, even if the neural network model includes recurrent connections, a nonlinear activation function, or nonlinear muscle units. Furthermore, our results do not rely on the shape of the generalization function. The results of this study suggest that one of the functional roles of neuronal redundancy is to maximize learning speed. PMID:22253586

A new hierarchical method to find community structure in networks

NASA Astrophysics Data System (ADS)

Saoud, Bilal; Moussaoui, Abdelouahab

2018-04-01

Community structure is very important to understand a network which represents a context. Many community detection methods have been proposed like hierarchical methods. In our study, we propose a new hierarchical method for community detection in networks based on genetic algorithm. In this method we use genetic algorithm to split a network into two networks which maximize the modularity. Each new network represents a cluster (community). Then we repeat the splitting process until we get one node at each cluster. We use the modularity function to measure the strength of the community structure found by our method, which gives us an objective metric for choosing the number of communities into which a network should be divided. We demonstrate that our method are highly effective at discovering community structure in both computer-generated and real-world network data.

Optimal percolation on multiplex networks.

PubMed

Osat, Saeed; Faqeeh, Ali; Radicchi, Filippo

2017-11-16

Optimal percolation is the problem of finding the minimal set of nodes whose removal from a network fragments the system into non-extensive disconnected clusters. The solution to this problem is important for strategies of immunization in disease spreading, and influence maximization in opinion dynamics. Optimal percolation has received considerable attention in the context of isolated networks. However, its generalization to multiplex networks has not yet been considered. Here we show that approximating the solution of the optimal percolation problem on a multiplex network with solutions valid for single-layer networks extracted from the multiplex may have serious consequences in the characterization of the true robustness of the system. We reach this conclusion by extending many of the methods for finding approximate solutions of the optimal percolation problem from single-layer to multiplex networks, and performing a systematic analysis on synthetic and real-world multiplex networks.

Optimizing the switching time for 400 kV SF6 circuit breakers

NASA Astrophysics Data System (ADS)

Ciulica, D.

2018-01-01

This paper presents real-time voltage and current analysis for optimizing the wave switching point of the circuit breaker SF6. Circuit Breaker plays an important role in power systems. It provides protection for equipment in embedded stations in transport networks. SF6 Circuit Breaker is very important equipment in Power Systems, which is used for up to 400 kV due to its excellent performance. The controlled switching is used to eliminate transient modes and electrodynamic and dielectric charges in the network at manual switching of capacitor, shunt reactors and power transformers. These effects reduce the reliability and lifetime of the equipment installed on the network, or may lead to erroneous protection.

Modeling of Current Consumption in 802.15.4/ZigBee Sensor Motes

PubMed Central

Casilari, Eduardo; Cano-García, Jose M.; Campos-Garrido, Gonzalo

2010-01-01

Battery consumption is a key aspect in the performance of wireless sensor networks. One of the most promising technologies for this type of networks is 802.15.4/ZigBee. This paper presents an empirical characterization of battery consumption in commercial 802.15.4/ZigBee motes. This characterization is based on the measurement of the current that is drained from the power source under different 802.15.4 communication operations. The measurements permit the definition of an analytical model to predict the maximum, minimum and mean expected battery lifetime of a sensor networking application as a function of the sensor duty cycle and the size of the sensed data. PMID:22219671

Modeling of current consumption in 802.15.4/ZigBee sensor motes.

PubMed

Casilari, Eduardo; Cano-García, Jose M; Campos-Garrido, Gonzalo

2010-01-01

Battery consumption is a key aspect in the performance of wireless sensor networks. One of the most promising technologies for this type of networks is 802.15.4/ZigBee. This paper presents an empirical characterization of battery consumption in commercial 802.15.4/ZigBee motes. This characterization is based on the measurement of the current that is drained from the power source under different 802.15.4 communication operations. The measurements permit the definition of an analytical model to predict the maximum, minimum and mean expected battery lifetime of a sensor networking application as a function of the sensor duty cycle and the size of the sensed data.

Link-state-estimation-based transmission power control in wireless body area networks.

PubMed

Kim, Seungku; Eom, Doo-Seop

2014-07-01

This paper presents a novel transmission power control protocol to extend the lifetime of sensor nodes and to increase the link reliability in wireless body area networks (WBANs). We first experimentally investigate the properties of the link states using the received signal strength indicator (RSSI). We then propose a practical transmission power control protocol based on both short- and long-term link-state estimations. Both the short- and long-term link-state estimations enable the transceiver to adapt the transmission power level and target the RSSI threshold range, respectively, to simultaneously satisfy the requirements of energy efficiency and link reliability. Finally, the performance of the proposed protocol is experimentally evaluated in two experimental scenarios-body posture change and dynamic body motion-and compared with the typical WBAN transmission power control protocols, a real-time reactive scheme, and a dynamic postural position inference mechanism. From the experimental results, it is found that the proposed protocol increases the lifetime of the sensor nodes by a maximum of 9.86% and enhances the link reliability by reducing the packet loss by a maximum of 3.02%.

Integrated Toolset for WSN Application Planning, Development, Commissioning and Maintenance: The WSN-DPCM ARTEMIS-JU Project.

PubMed

Antonopoulos, Christos; Asimogloy, Katerina; Chiti, Sarah; D'Onofrio, Luca; Gianfranceschi, Simone; He, Danping; Iodice, Antonio; Koubias, Stavros; Koulamas, Christos; Lavagno, Luciano; Lazarescu, Mihai T; Mujica, Gabriel; Papadopoulos, George; Portilla, Jorge; Redondo, Luis; Riccio, Daniele; Riesgo, Teresa; Rodriguez, Daniel; Ruello, Giuseppe; Samoladas, Vasilis; Stoyanova, Tsenka; Touliatos, Gerasimos; Valvo, Angela; Vlahoy, Georgia

2016-06-02

In this article we present the main results obtained in the ARTEMIS-JU WSN-DPCM project between October 2011 and September 2015. The first objective of the project was the development of an integrated toolset for Wireless sensor networks (WSN) application planning, development, commissioning and maintenance, which aims to support application domain experts, with limited WSN expertise, to efficiently develop WSN applications from planning to lifetime maintenance. The toolset is made of three main tools: one for planning, one for application development and simulation (which can include hardware nodes), and one for network commissioning and lifetime maintenance. The tools are integrated in a single platform which promotes software reuse by automatically selecting suitable library components for application synthesis and the abstraction of the underlying architecture through the use of a middleware layer. The second objective of the project was to test the effectiveness of the toolset for the development of two case studies in different domains, one for detecting the occupancy state of parking lots and one for monitoring air concentration of harmful gasses near an industrial site.

Nuclear Instruments and Methods in Physics Research. Section B; Microstructural Characterization of Semi-Interpenetrating Polymer Networks by Positron Lifetime Spectroscopy

NASA Technical Reports Server (NTRS)

Singh, Jag J.; Pater, Ruth H.; Eftekhari, Abe

1998-01-01

Thermoset and thermoplastic polyimides have complementary physical/mechanical properties. Whereas thermoset polyimides are brittle and generally easier to process, thermoplastic polyimides are tough but harder to process. It is expected that a combination of these two types of polyimides may help produce polymers more suitable for aerospace applications. Semi-Interpenetrating Polymer Networks (S-IPNs) of thermoset LaRC(Trademark)-RP46 and thermoplastic LARC(Trademark)-IA polyimides were prepared in weight percent ratios ranging from 100:0 to 0: 100. Positron lifetime measurements were made in these samples to correlate their free volume features with physical/mechanical properties. As expected, positronium atoms are not formed in these samples. The second life time component has been used to infer the positron trap dimensions. The "free volume" goes through a minimum at about 50:50 ratio, suggesting that S-IPN samples are not merely solid solutions of the two polymers. These data and related structural properties of the S-IPN samples have been discussed in this paper.

Integrated Toolset for WSN Application Planning, Development, Commissioning and Maintenance: The WSN-DPCM ARTEMIS-JU Project

PubMed Central

Antonopoulos, Christos; Asimogloy, Katerina; Chiti, Sarah; D’Onofrio, Luca; Gianfranceschi, Simone; He, Danping; Iodice, Antonio; Koubias, Stavros; Koulamas, Christos; Lavagno, Luciano; Lazarescu, Mihai T.; Mujica, Gabriel; Papadopoulos, George; Portilla, Jorge; Redondo, Luis; Riccio, Daniele; Riesgo, Teresa; Rodriguez, Daniel; Ruello, Giuseppe; Samoladas, Vasilis; Stoyanova, Tsenka; Touliatos, Gerasimos; Valvo, Angela; Vlahoy, Georgia

2016-01-01

In this article we present the main results obtained in the ARTEMIS-JU WSN-DPCM project between October 2011 and September 2015. The first objective of the project was the development of an integrated toolset for Wireless sensor networks (WSN) application planning, development, commissioning and maintenance, which aims to support application domain experts, with limited WSN expertise, to efficiently develop WSN applications from planning to lifetime maintenance. The toolset is made of three main tools: one for planning, one for application development and simulation (which can include hardware nodes), and one for network commissioning and lifetime maintenance. The tools are integrated in a single platform which promotes software reuse by automatically selecting suitable library components for application synthesis and the abstraction of the underlying architecture through the use of a middleware layer. The second objective of the project was to test the effectiveness of the toolset for the development of two case studies in different domains, one for detecting the occupancy state of parking lots and one for monitoring air concentration of harmful gasses near an industrial site. PMID:27271622

Energy Aware Cluster-Based Routing in Flying Ad-Hoc Networks.

PubMed

Aadil, Farhan; Raza, Ali; Khan, Muhammad Fahad; Maqsood, Muazzam; Mehmood, Irfan; Rho, Seungmin

2018-05-03

Flying ad-hoc networks (FANETs) are a very vibrant research area nowadays. They have many military and civil applications. Limited battery energy and the high mobility of micro unmanned aerial vehicles (UAVs) represent their two main problems, i.e., short flight time and inefficient routing. In this paper, we try to address both of these problems by means of efficient clustering. First, we adjust the transmission power of the UAVs by anticipating their operational requirements. Optimal transmission range will have minimum packet loss ratio (PLR) and better link quality, which ultimately save the energy consumed during communication. Second, we use a variant of the K-Means Density clustering algorithm for selection of cluster heads. Optimal cluster heads enhance the cluster lifetime and reduce the routing overhead. The proposed model outperforms the state of the art artificial intelligence techniques such as Ant Colony Optimization-based clustering algorithm and Grey Wolf Optimization-based clustering algorithm. The performance of the proposed algorithm is evaluated in term of number of clusters, cluster building time, cluster lifetime and energy consumption.

Research and realization of info-net security controlling system

NASA Astrophysics Data System (ADS)

Xu, Tao; Zhang, Wei; Li, Xuhong; Wang, Xia; Pan, Wenwen

2017-03-01

The thesis introduces some relative concepts about Network Cybernetics, and we design and realize a new info-net security controlling system based on Network Cybernetics. The system can control the endpoints, safely save files, encrypt communication, supervise actions of users and show security conditions, in order to realize full-scale security management. At last, we simulate the functions of the system. The results show, the system can ensure the controllability of users and devices, and supervise them real-time. The system can maximize the security of the network and users.

Multiobjective Particle Swarm Optimization for the optimal design of photovoltaic grid-connected systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kornelakis, Aris

2010-12-15

Particle Swarm Optimization (PSO) is a highly efficient evolutionary optimization algorithm. In this paper a multiobjective optimization algorithm based on PSO applied to the optimal design of photovoltaic grid-connected systems (PVGCSs) is presented. The proposed methodology intends to suggest the optimal number of system devices and the optimal PV module installation details, such that the economic and environmental benefits achieved during the system's operational lifetime period are both maximized. The objective function describing the economic benefit of the proposed optimization process is the lifetime system's total net profit which is calculated according to the method of the Net Present Valuemore » (NPV). The second objective function, which corresponds to the environmental benefit, equals to the pollutant gas emissions avoided due to the use of the PVGCS. The optimization's decision variables are the optimal number of the PV modules, the PV modules optimal tilt angle, the optimal placement of the PV modules within the available installation area and the optimal distribution of the PV modules among the DC/AC converters. (author)« less

Efficient two-step photocarrier generation in bias-controlled InAs/GaAs quantum dot superlattice intermediate-band solar cells.

PubMed

Kada, T; Asahi, S; Kaizu, T; Harada, Y; Tamaki, R; Okada, Y; Kita, T

2017-07-19

We studied the effects of the internal electric field on two-step photocarrier generation in InAs/GaAs quantum dot superlattice (QDSL) intermediate-band solar cells (IBSCs). The external quantum efficiency of QDSL-IBSCs was measured as a function of the internal electric field intensity, and compared with theoretical calculations accounting for interband and intersubband photoexcitations. The extra photocurrent caused by the two-step photoexcitation was maximal for a reversely biased electric field, while the current generated by the interband photoexcitation increased monotonically with increasing electric field intensity. The internal electric field in solar cells separated photogenerated electrons and holes in the superlattice (SL) miniband that played the role of an intermediate band, and the electron lifetime was extended to the microsecond scale, which improved the intersubband transition strength, therefore increasing the two-step photocurrent. There was a trade-off relation between the carrier separation enhancing the two-step photoexcitation and the electric-field-induced carrier escape from QDSLs. These results validate that long-lifetime electrons are key to maximising the two-step photocarrier generation in QDSL-IBSCs.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Smith, Kandler; Shi, Ying; Santhanagopalan, Shriram

Predictive models of Li-ion battery lifetime must consider a multiplicity of electrochemical, thermal, and mechanical degradation modes experienced by batteries in application environments. To complicate matters, Li-ion batteries can experience different degradation trajectories that depend on storage and cycling history of the application environment. Rates of degradation are controlled by factors such as temperature history, electrochemical operating window, and charge/discharge rate. We present a generalized battery life prognostic model framework for battery systems design and control. The model framework consists of trial functions that are statistically regressed to Li-ion cell life datasets wherein the cells have been aged under differentmore » levels of stress. Degradation mechanisms and rate laws dependent on temperature, storage, and cycling condition are regressed to the data, with multiple model hypotheses evaluated and the best model down-selected based on statistics. The resulting life prognostic model, implemented in state variable form, is extensible to arbitrary real-world scenarios. The model is applicable in real-time control algorithms to maximize battery life and performance. We discuss efforts to reduce lifetime prediction error and accommodate its inevitable impact in controller design.« less