WorldWideScience

Sample records for hierarchical sensor networks

  1. Genetic Algorithm for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sajid Hussain

    2007-09-01

    Full Text Available Large scale wireless sensor networks (WSNs can be used for various pervasive and ubiquitous applications such as security, health-care, industry automation, agriculture, environment and habitat monitoring. As hierarchical clusters can reduce the energy consumption requirements for WSNs, we investigate intelligent techniques for cluster formation and management. A genetic algorithm (GA is used to create energy efficient clusters for data dissemination in wireless sensor networks. The simulation results show that the proposed intelligent hierarchical clustering technique can extend the network lifetime for different network deployment environments.

  2. A Hierarchical Sensor Network Based on Voronoi Diagram

    Institute of Scientific and Technical Information of China (English)

    SHANG Rui-qiang; ZHAO Jian-li; SUN Qiu-xia; WANG Guang-xing

    2006-01-01

    A hierarchical sensor network is proposed which places the sensing and routing capacity at different layer nodes.It thus simplifies the hardware design and reduces cost. Adopting Voronoi diagram in the partition of backbone network,a mathematical model of data aggregation based on hierarchical architecture is given. Simulation shows that the number of transmission data packages is sharply cut down in the network, thus reducing the needs in the bandwidth and energy resources and is thus well adapted to sensor networks.

  3. An Extended Hierarchical Trusted Model for Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    DU Ruiying; XU Mingdi; ZHANG Huanguo

    2006-01-01

    Cryptography and authentication are traditional approach for providing network security. However, they are not sufficient for solving the problems which malicious nodes compromise whole wireless sensor network leading to invalid data transmission and wasting resource by using vicious behaviors. This paper puts forward an extended hierarchical trusted architecture for wireless sensor network, and establishes trusted congregations by three-tier framework. The method combines statistics, economics with encrypt mechanism for developing two trusted models which evaluate cluster head nodes and common sensor nodes respectively. The models form logical trusted-link from command node to common sensor nodes and guarantees the network can run in secure and reliable circumstance.

  4. Time Synchronization in Hierarchical TESLA Wireless Sensor Networks

    Energy Technology Data Exchange (ETDEWEB)

    Jason L. Wright; Milos Manic

    2009-08-01

    Time synchronization and event time correlation are important in wireless sensor networks. In particular, time is used to create a sequence events or time line to answer questions of cause and effect. Time is also used as a basis for determining the freshness of received packets and the validity of cryptographic certificates. This paper presents secure method of time synchronization and event time correlation for TESLA-based hierarchical wireless sensor networks. The method demonstrates that events in a TESLA network can be accurately timestamped by adding only a few pieces of data to the existing protocol.

  5. Hierarchical Compressed Sensing for Cluster Based Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Vishal Krishna Singh

    2016-02-01

    Full Text Available Data transmission consumes significant amount of energy in large scale wireless sensor networks (WSNs. In such an environment, reducing the in-network communication and distributing the load evenly over the network can reduce the overall energy consumption and maximize the network lifetime significantly. In this work, the aforementioned problem of network lifetime and uneven energy consumption in large scale wireless sensor networks is addressed. This work proposes a hierarchical compressed sensing (HCS scheme to reduce the in-network communication during the data gathering process. Co-related sensor readings are collected via a hierarchical clustering scheme. A compressed sensing (CS based data processing scheme is devised to transmit the data from the source to the sink. The proposed HCS is able to identify the optimal position for the application of CS to achieve reduced and similar number of transmissions on all the nodes in the network. An activity map is generated to validate the reduced and uniformly distributed communication load of the WSN. Based on the number of transmissions per data gathering round, the bit-hop metric model is used to analyse the overall energy consumption. Simulation results validate the efficiency of the proposed method over the existing CS based approaches.

  6. Sensor Networks Hierarchical Optimization Model for Security Monitoring in High-Speed Railway Transport Hub

    Directory of Open Access Journals (Sweden)

    Zhengyu Xie

    2015-01-01

    Full Text Available We consider the sensor networks hierarchical optimization problem in high-speed railway transport hub (HRTH. The sensor networks are optimized from three hierarchies which are key area sensors optimization, passenger line sensors optimization, and whole area sensors optimization. Case study on a specific HRTH in China showed that the hierarchical optimization method is effective to optimize the sensor networks for security monitoring in HRTH.

  7. Multi-mode clustering model for hierarchical wireless sensor networks

    Science.gov (United States)

    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.

  8. Reliable Point to Multipoint Hierarchical Routing in Scatternet Sensor Network

    Directory of Open Access Journals (Sweden)

    R.Dhaya

    2011-01-01

    Full Text Available In the recent development of communication, Bluetooth Scatternet wireless is a technology developed for wideband local accesses. Bluetooth technology is very popular because of its low cost and easy deployment which is based on IEEE 802.11standards. On the other hand Wireless Sensor Network (WSN consists of large number of sensor nodes distributed to monitor an environment and each node in a WSN consists of a small CPU, a sensing device and battery. Mostly, the sensor networks are distributed in an inconvenient location and it is difficult to recharge often. So routing in WSN is an important issue to consume energy and as well as to increase the life of the network, since a routing protocol finds the path between sources and sink. Moreover it is a challenging task to schedule the data between nodes in a scatternet in a congestive environment. Here this paper presents a new scheduling method for point to multi- point routing in Scatternet sensor network and the new dynamic routing method designed is cluster-based with hierarchical routing. The efficiency of this method is also compared in terms of energy consumption and the results show that the proposed routing is an energy efficient one which simultaneously increases the lifetime of the network.

  9. A HIERARCHICAL INTRUSION DETECTION ARCHITECTURE FOR WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    Hossein Jadidoleslamy

    2011-10-01

    Full Text Available Networks protection against different types of attacks is one of most important posed issue into the network andinformation security application domains. This problem on Wireless Sensor Networks (WSNs, in attention to theirspecial properties, has more importance. Now, there are some of proposed architectures and guide lines to protectWireless Sensor Networks (WSNs against different types of intrusions; but any one of them do not has acomprehensive view to this problem and they are usually designed and implemented in single-purpose; but, theproposed design in this paper tries to has been a comprehensive view to this issue by presenting a complete andcomprehensive Intrusion Detection Architecture (IDA. The main contribution of this architecture is its hierarchicalstructure; i.e., it is designed and applicable, in one or two levels, consistent to the application domain and itsrequired security level. Focus of this paper is on the clustering WSNs, designing and deploying Cluster-basedIntrusion Detection System (CIDS on cluster-heads and Wireless Sensor Network wide level Intrusion DetectionSystem (WSNIDS on the central server. Suppositions of the WSN and Intrusion Detection Architecture (IDA are:static and heterogeneous network, hierarchical and clustering structure, clusters' overlapping and using hierarchicalrouting protocol such as LEACH, but along with minor changes. Finally, the proposed idea has been verified bydesigning a questionnaire, representing it to some (about 50 people experts and then, analyzing and evaluating itsacquired results.

  10. SOFM Neural Network Based Hierarchical Topology Control for Wireless Sensor Networks

    OpenAIRE

    2014-01-01

    Well-designed network topology provides vital support for routing, data fusion, and target tracking in wireless sensor networks (WSNs). Self-organization feature map (SOFM) neural network is a major branch of artificial neural networks, which has self-organizing and self-learning features. In this paper, we propose a cluster-based topology control algorithm for WSNs, named SOFMHTC, which uses SOFM neural network to form a hierarchical network structure, completes cluster head selection by the...

  11. Distributed Plume Source Localization Using Hierarchical Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    KUANG Xing-hong; LIU Yu-qing; WU Yan-xiang; SHAO Hui-he

    2009-01-01

    A hierarchical wireless sensor networks (WSN) was proposed to estimate the plume source location. Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding to an accident. The entire surveillant field is divided into several small sub-regions. In each sub-region, the localization algorithm based on the improved particle filter (IPF) was performed to estimate the location. Some improved methods such as weighted centroid, residual resampling were introduced to the IPF algorithm to increase the localization performance. This distributed estimation method elirninates many drawbacks inherent with the traditional centralized optimization method. Simulation results show that localization algorithm is efficient far estimating the plume source location.

  12. An Isolation Intrusion Detection System for Hierarchical Wireless Sensor Networks

    OpenAIRE

    Rung-Ching Chen; Chia-Fen Hsieh; Yung-Fa Huang

    2010-01-01

    A wireless sensor network (WSN) is a wireless network consisting of spatially distributed autonomous devices using sensors to cooperatively monitor environmental conditions, such as battlefield data and personal health information, and some environment limited resources. To avoid malicious damage is important while information is transmitted in wireless network. Thus, Wireless Intrusion Detection Systems are crucial to safe operation in wireless sensor networks. Wireless networks are subject ...

  13. Dynamic Hierarchical Sleep Scheduling for Wireless Ad-Hoc Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chih-Yu Wen

    2009-05-01

    Full Text Available This paper presents two scheduling management schemes for wireless sensor networks, which manage the sensors by utilizing the hierarchical network structure and allocate network resources efficiently. A local criterion is used to simultaneously establish the sensing coverage and connectivity such that dynamic cluster-based sleep scheduling can be achieved. The proposed schemes are simulated and analyzed to abstract the network behaviors in a number of settings. The experimental results show that the proposed algorithms provide efficient network power control and can achieve high scalability in wireless sensor networks.

  14. Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

    Science.gov (United States)

    Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

    2017-07-19

    Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

  15. An Advanced Survey on Secure Energy-Efficient Hierarchical Routing Protocols in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Abdoulaye Diop

    2013-01-01

    Full Text Available Wireless Sensor Networks (WSNs are often deployed in hostile environments, which make such networks highly vulnerable and increase the risk of attacks against this type of network. WSN comprise of large number of sensor nodes with different hardware abilities and functions. Due to the limited memory resources and energy constraints, complex security algorithms cannot be used in sensor networks. Therefore, it is necessary to balance between the security level and the associated energy consumption overhead to mitigate the security risks. Hierarchical routing protocol is more energy-efficient than other routing protocols in WSNs. Many secure cluster-based routing protocols have been proposed in the literature to overcome these constraints. In this paper, we discuss Secure Energy-Efficient Hierarchical Routing Protocols in WSNs and compare them in terms of security, performance and efficiency. Security issues for WSNs and their solutions are also discussed.

  16. HIERARCHICAL DESIGN BASED INTRUSION DETECTION SYSTEM FOR WIRELESS AD HOC SENSOR NETWORK

    Directory of Open Access Journals (Sweden)

    Mohammad Saiful Islam Mamun

    2010-07-01

    Full Text Available In recent years, wireless ad hoc sensor network becomes popular both in civil and military jobs.However, security is one of the significant challenges for sensor network because of their deploymentin open and unprotected environment. As cryptographic mechanism is not enough to protect sensornetwork from external attacks, intrusion detection system needs to be introduced. Though intrusionprevention mechanism is one of the major and efficient methods against attacks, but there might besome attacks for which prevention method is not known. Besides preventing the system from someknown attacks, intrusion detection system gather necessary information related to attack technique andhelp in the development of intrusion prevention system. In addition to reviewing the present attacksavailable in wireless sensor network this paper examines the current efforts to intrusion detectionsystem against wireless sensor network. In this paper we propose a hierarchical architectural designbased intrusion detection system that fits the current demands and restrictions of wireless ad hocsensor network. In this proposed intrusion detection system architecture we followed clusteringmechanism to build a four level hierarchical network which enhances network scalability to largegeographical area and use both anomaly and misuse detection techniques for intrusion detection. Weintroduce policy based detection mechanism as well as intrusion response together with GSM cellconcept for intrusion detection architecture.

  17. Hierarchically Coordinated Power Management for Target Tracking in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Feng Juan

    2013-10-01

    Full Text Available Energy efficiency is very important for wireless sensor networks (WSNs since sensor nodes have a limited energy supply from a battery. So far, a lot research has focused on this issue, while less emphasis has been placed on the adaptive sleep time for each node with a consideration for the application constraints. In this paper, we propose a hierarchically coordinated power management (HCPM approach, which both addresses the energy conservation problem and reduces the packet forwarding delay for target tracking WSNs based on a virtual‐grid‐based network structure. We extend the network lifetime by adopting an adaptive sleep scheduling scheme that combines the local power management (PM and the adaptive coordinate PM strategies to schedule the activities of the sensor nodes at the surveillance stage. Furthermore, we propose a hierarchical structure for the tracking stage. Experimental results show that the proposed approach has a greater capability of extending the network lifetime while maintaining a short transmission delay when compared with the protocol which does not consider the application constraints in target tracking sensor networks.

  18. NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    CHENG Hong-bing; YANG Geng; HU Su-jun

    2008-01-01

    Considering severe resources constraints and security threat of wireless sensor networks (WSN), the article proposed a novel hierarchical routing protocol algorithm. The proposed routing protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node compromise attacks, the results show that the proposed routing protocol algorithm is more efficient for wireless sensor networks.

  19. An energy efficient cooperative hierarchical MIMO clustering scheme for wireless sensor networks.

    Science.gov (United States)

    Nasim, Mehwish; Qaisar, Saad; Lee, Sungyoung

    2012-01-01

    In this work, we present an energy efficient hierarchical cooperative clustering scheme for wireless sensor networks. Communication cost is a crucial factor in depleting the energy of sensor nodes. In the proposed scheme, nodes cooperate to form clusters at each level of network hierarchy ensuring maximal coverage and minimal energy expenditure with relatively uniform distribution of load within the network. Performance is enhanced by cooperative multiple-input multiple-output (MIMO) communication ensuring energy efficiency for WSN deployments over large geographical areas. We test our scheme using TOSSIM and compare the proposed scheme with cooperative multiple-input multiple-output (CMIMO) clustering scheme and traditional multihop Single-Input-Single-Output (SISO) routing approach. Performance is evaluated on the basis of number of clusters, number of hops, energy consumption and network lifetime. Experimental results show significant energy conservation and increase in network lifetime as compared to existing schemes.

  20. Sensor Network Data Fault Detection using Hierarchical Bayesian Space-Time Modeling

    OpenAIRE

    Ni, Kevin; Pottie, G J

    2009-01-01

    We present a new application of hierarchical Bayesian space-time (HBST) modeling: data fault detection in sensor networks primarily used in environmental monitoring situations. To show the effectiveness of HBST modeling, we develop a rudimentary tagging system to mark data that does not fit with given models. Using this, we compare HBST modeling against first order linear autoregressive (AR) modeling, which is a commonly used alternative due to its simplicity. We show that while HBST is mo...

  1. A Hierarchical Approach to Real-time Activity Recognition in Body Sensor Networks

    DEFF Research Database (Denmark)

    Wang, Liang; Gu, Tao; Tao, Xianping

    2012-01-01

    algorithm to detect gestures at the sensor node level, and then propose a pattern based real-time algorithm to recognize complex, high-level activities at the portable device level. We evaluate our algorithms over a real-world dataset. The results show that the proposed system not only achieves good......Real-time activity recognition in body sensor networks is an important and challenging task. In this paper, we propose a real-time, hierarchical model to recognize both simple gestures and complex activities using a wireless body sensor network. In this model, we rst use a fast and lightweight...... performance (an average utility of 0.81, an average accuracy of 82.87%, and an average real-time delay of 5.7 seconds), but also signicantly reduces the network communication cost by 60.2%....

  2. Prolonging the Lifetime of Wireless Sensor Networks Interconnected to Fixed Network Using Hierarchical Energy Tree Based Routing Algorithm

    Directory of Open Access Journals (Sweden)

    M. Kalpana

    2014-01-01

    Full Text Available This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN. It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP. The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.

  3. Hierarchical Self-healing Key Distribution for Heterogeneous Wireless Sensor Networks

    Science.gov (United States)

    Yang, Yanjiang; Zhou, Jianying; Deng, Robert H.; Bao, Feng

    Self-healing group key distribution aims to achieve robust key distribution over lossy channels in wireless sensor networks (WSNs). However, all existing self-healing group key distribution schemes in the literature consider homogenous WSNs which are known to be unscalable. Heterogeneous WSNs have better scalability and performance than homogenous ones. We are thus motivated to study hierarchial self-healing group key distribution, tailored to the heterogeneous WSN architecture. In particular, we revisit and adapt Dutta et al.’s model to the setting of hierarchical self-healing group key distribution, and propose a concrete scheme that achieves computational security and high efficiency.

  4. A Hierarchical Energy Efficient Reliable Transport Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Prabhudutta Mohanty

    2014-12-01

    Full Text Available The two important requirements for many Wireless Senor Networks (WSNs are prolonged network lifetime and end-to-end reliability. The sensor nodes consume more energy during data transmission than the data sensing. In WSN, the redundant data increase the energy consumption, latency and reduce reliability during data transmission. Therefore, it is important to support energy efficient reliable data transport in WSNs. In this paper, we present a Hierarchical Energy Efficient Reliable Transport Protocol (HEERTP for the data transmission within the WSN. This protocol maximises the network lifetime by controlling the redundant data transmission with the co-ordination of Base Station (BS. The proposed protocol also achieves end-to-end reliability using a hop-by-hop acknowledgement scheme. We evaluate the performance of the proposed protocol through simulation. The simulation results reveal that our proposed protocol achieves better performance in terms of energy efficiency, latency and reliability than the existing protocols.

  5. Decentralized Cooperative TOA/AOA Target Tracking for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chih-Yu Wen

    2012-11-01

    Full Text Available This paper proposes a distributed method for cooperative target tracking in hierarchical wireless sensor networks. The concept of leader-based information processingis conducted to achieve object positioning, considering a cluster-based network topology. Random timers and local information are applied to adaptively select a sub-cluster for thelocalization task. The proposed energy-efficient tracking algorithm allows each sub-clustermember to locally estimate the target position with a Bayesian filtering framework and a neural networking model, and further performs estimation fusion in the leader node with the covariance intersection algorithm. This paper evaluates the merits and trade-offs of the protocol design towards developing more efficient and practical algorithms for objectposition estimation. 

  6. Decentralized cooperative TOA/AOA target tracking for hierarchical wireless sensor networks.

    Science.gov (United States)

    Chen, Ying-Chih; Wen, Chih-Yu

    2012-11-08

    This paper proposes a distributed method for cooperative target tracking in hierarchical wireless sensor networks. The concept of leader-based information processing is conducted to achieve object positioning, considering a cluster-based network topology. Random timers and local information are applied to adaptively select a sub-cluster for the localization task. The proposed energy-efficient tracking algorithm allows each sub-cluster member to locally estimate the target position with a Bayesian filtering framework and a neural networking model, and further performs estimation fusion in the leader node with the covariance intersection algorithm. This paper evaluates the merits and trade-offs of the protocol design towards developing more efficient and practical algorithms for object position estimation.

  7. Coordinated Workload Scheduling in Hierarchical Sensor Networks for Data Fusion Applications

    Institute of Scientific and Technical Information of China (English)

    Xiao-Lin Li; Jian-Nong Cao

    2008-01-01

    To minimize the execution time of a sensing task over a multi-hop hierarchical sensor network, we present acoordinated scheduling method following the divisible load scheduling paradigm. The proposed scheduling strategy builds on eliminating transmission collisions and idle gaps between two successive data transmissions. We consider a sensor network consisting of several clusters. In a cluster, after related raw data measured by source nodes are collected at the fusion node,in-network data aggregation is further considered. The scheduling strategies consist of two phases: intra-cluster scheduling and inter-cluster scheduling. Intra-cluster scheduling deals with assigning different fractions of a sensing workload among source nodes in each cluster; inter-cluster scheduling involves the distribution of fused data among all fusion nodes. Closed-form solutions to the problem of task scheduling are derived. Finally, numerical examples are presented to demonstrate the impacts of different system parameters such as the number of sensor nodes, measurement, communication, and processing speed, on the finish time and energy consumption.

  8. A Dynamic Key Management Scheme Based on Secret Sharing for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Enjian Bai

    2013-01-01

    Full Text Available Since wireless sensor networks (WSN for short are often deployed in hostile environments in many applications, security becomes one of the critical issues in WSN. Moreover, due to the limitation of the sensor nodes, traditional key management schemes are not suitable for it. Thereby,a feasible and efficient key management scheme is an important guarantee for WSN to communicate securely. For the moment, many protocols have been proposed and each has its own advantages. However, these protocols cannot provide sufficient security in many cases, such as node capture attack, which makes WSN more vulnerable than traditional wireless networks. Key protection and revocation issues must be considered with special attention in WSN. To address these two issues, we propose a dynamically clustering key management scheme based on secret sharing for WSN. The scheme combined the hierarchical structure of wireless sensor networks with dynamic key management scheme. The analysis results show that the scheme has strong security and resistance of captured attack, as well as low communicational overhead, and it well meets the requirement of scalability.

  9. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    of different types of hierarchical networks. This is supplemented by a review of ring network design problems and a presentation of a model allowing for modeling most hierarchical networks. We use methods based on linear programming to design the hierarchical networks. Thus, a brief introduction to the various....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...... linear programming based methods is included. The thesis is thus suitable as a foundation for study of design of hierarchical networks. The major contribution of the thesis consists of seven papers which are included in the appendix. The papers address hierarchical network design and/or ring network...

  10. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    Communication networks are immensely important today, since both companies and individuals use numerous services that rely on them. This thesis considers the design of hierarchical (communication) networks. Hierarchical networks consist of layers of networks and are well-suited for coping...... the clusters. The design of hierarchical networks involves clustering of nodes, hub selection, and network design, i.e. selection of links and routing of ows. Hierarchical networks have been in use for decades, but integrated design of these networks has only been considered for very special types of networks....... The thesis investigates models for hierarchical network design and methods used to design such networks. In addition, ring network design is considered, since ring networks commonly appear in the design of hierarchical networks. The thesis introduces hierarchical networks, including a classification scheme...

  11. Mobile Agent Based Hierarchical Intrusion Detection System in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Surraya Khanum

    2012-01-01

    Full Text Available Security mechanism is a fundamental requirement of wireless networks in general and Wireless Sensor Networks (WSN in particular. Therefore, it is necessary that this security concern must be articulate right from the beginning of the network design and deployment. WSN needs strong security mechanism as it is usually deployed in a critical, hostile and sensitive environment where human labour is usually not involved. However, due to inbuilt resource and computing restriction, security in WSN needs a special consideration. Traditional security techniques such as encryption, VPN, authentication and firewalls cannot be directly applied to WSN as it provides defence only against external threats. The existing literature shows that there seems an inverse relationship between strong security mechanism and efficient network resource utilization. In this research article, we have proposed a Mobile Agent Based Hierarchical Intrusion Detection System (MABHIDS for WSN. The Proposed scheme performs two levels of intrusion detection by utilizing minimum possible network resources. Our proposed idea enhance network lifetime by reducing the work load on Cluster Head (CH and it also provide enhanced level of security in WSN.

  12. Hierarchical Agglomerative Clustering Schemes for Energy-Efficiency in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Taleb Tariq

    2017-06-01

    Full Text Available Extending the lifetime of wireless sensor networks (WSNs while delivering the expected level of service remains a hot research topic. Clustering has been identified in the literature as one of the primary means to save communication energy. In this paper, we argue that hierarchical agglomerative clustering (HAC provides a suitable foundation for designing highly energy efficient communication protocols for WSNs. To this end, we study a new mechanism for selecting cluster heads (CHs based both on the physical location of the sensors and their residual energy. Furthermore, we study different patterns of communications between the CHs and the base station depending on the possible transmission ranges and the ability of the sensors to act as traffic relays. Simulation results show that our proposed clustering and communication schemes outperform well-knows existing approaches by comfortable margins. In particular, networks lifetime is increased by more than 60% compared to LEACH and HEED, and by more than 30% compared to K-means clustering.

  13. AH-MAC: Adaptive Hierarchical MAC Protocol for Low-Rate Wireless Sensor Network Applications

    Directory of Open Access Journals (Sweden)

    Adnan Ismail Al-Sulaifanie

    2017-01-01

    Full Text Available This paper proposes an adaptive hierarchical MAC protocol (AH-MAC with cross-layer optimization for low-rate and large-scale wireless sensor networks. The main goal of the proposed protocol is to combine the strengths of LEACH and IEEE 802.15.4 while offsetting their weaknesses. The predetermined cluster heads are supported with an energy harvesting circuit, while the normal nodes are battery-operated. To prolong the network’s operational lifetime, the proposed protocol transfers most of the network’s activities to the cluster heads while minimizing the node’s activity. Some of the main features of this protocol include energy efficiency, self-configurability, scalability, and self-healing. The simulation results showed great improvement of the AH-MAC over LEACH protocol in terms of energy consumption and throughput. AH-MAC consumes eight times less energy while improving throughput via acknowledgment support.

  14. A Hierarchical of Security Situation Element Acquisition Mechanism in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Li Fangwei

    2015-08-01

    Full Text Available In wireless sensor network, the processing ability of the sensor nodes is poor. And the security situational element acquisition is also a serious problem. Thus, this paper proposes a hierarchical framework of security situational elements acquisition mechanism. In this framework, support vector machine hyper sphere multi class algorithm is introduced as basic classifier. The method of attribute reduction uses non negative matrix factorization algorithm. The fuzzy classification algorithm used to initialize non negative matrix factorization, in order to avoid the local optimal which is caused by non negative matrix factorization random initialization. In the sink node classification rules and attribute reduction rules are formed by learning. The classification analyses respectively focus on the cluster head and sink node, which can reduce the requirement of the sensor node properties. Attribute reduction before the data transmission, which reduces communication consumption data transmission, improves the performance of classifiers. By simulation analysis, the scheme has preferably accuracy in the situation elements acquisiton, and smaller communication overhead in the process of information transmission.

  15. Hierarchical leak detection and localization method in natural gas pipeline monitoring sensor networks.

    Science.gov (United States)

    Wan, Jiangwen; Yu, Yang; Wu, Yinfeng; Feng, Renjian; Yu, Ning

    2012-01-01

    In light of the problems of low recognition efficiency, high false rates and poor localization accuracy in traditional pipeline security detection technology, this paper proposes a type of hierarchical leak detection and localization method for use in natural gas pipeline monitoring sensor networks. In the signal preprocessing phase, original monitoring signals are dealt with by wavelet transform technology to extract the single mode signals as well as characteristic parameters. In the initial recognition phase, a multi-classifier model based on SVM is constructed and characteristic parameters are sent as input vectors to the multi-classifier for initial recognition. In the final decision phase, an improved evidence combination rule is designed to integrate initial recognition results for final decisions. Furthermore, a weighted average localization algorithm based on time difference of arrival is introduced for determining the leak point's position. Experimental results illustrate that this hierarchical pipeline leak detection and localization method could effectively improve the accuracy of the leak point localization and reduce the undetected rate as well as false alarm rate.

  16. A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

    Directory of Open Access Journals (Sweden)

    Nabil Sabor

    2017-01-01

    Full Text Available Introducing mobility to Wireless Sensor Networks (WSNs puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs. Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

  17. A comparative performance evaluation of intrusion detection techniques for hierarchical wireless sensor networks

    Directory of Open Access Journals (Sweden)

    H.H. Soliman

    2012-11-01

    Full Text Available An explosive growth in the field of wireless sensor networks (WSNs has been achieved in the past few years. Due to its important wide range of applications especially military applications, environments monitoring, health care application, home automation, etc., they are exposed to security threats. Intrusion detection system (IDS is one of the major and efficient defensive methods against attacks in WSN. Therefore, developing IDS for WSN have attracted much attention recently and thus, there are many publications proposing new IDS techniques or enhancement to the existing ones. This paper evaluates and compares the most prominent anomaly-based IDS systems for hierarchical WSNs and identifying their strengths and weaknesses. For each IDS, the architecture and the related functionality are briefly introduced, discussed, and compared, focusing on both the operational strengths and weakness. In addition, a comparison of the studied IDSs is carried out using a set of critical evaluation metrics that are divided into two groups; the first one related to performance and the second related to security. Finally based on the carried evaluation and comparison, a set of design principles are concluded, which have to be addressed and satisfied in future research of designing and implementing IDS for WSNs.

  18. Energy Efficient Backoff Hierarchical Clustering Algorithms for Multi-Hop Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    Jun Wang; Yong-Tao Cao; Jun-Yuan Xie; Shi-Fu Chen

    2011-01-01

    Compared with flat routing protocols, clustering is a fundamental performance improvement technique in wireless sensor networks, which can increase network scalability and lifetime. In this paper, we integrate the multi-hop technique with a backoff-based clustering algorithm to organize sensors. By using an adaptive backoff strategy, the algorithm not only realizes load balance among sensor node, but also achieves fairly uniform cluster head distribution across the network. Simulation results also demonstrate our algorithm is more energy-efficient than classical ones. Our algorithm is also easily extended to generate a hierarchy of cluster heads to obtain better network management and energy-efficiency.

  19. A Social Potential Fields Approach for Self-Deployment and Self-Healing in Hierarchical Mobile Wireless Sensor Networks

    Science.gov (United States)

    González-Parada, Eva; Cano-García, Jose; Aguilera, Francisco; Sandoval, Francisco; Urdiales, Cristina

    2017-01-01

    Autonomous mobile nodes in mobile wireless sensor networks (MWSN) allow self-deployment and self-healing. In both cases, the goals are: (i) to achieve adequate coverage; and (ii) to extend network life. In dynamic environments, nodes may use reactive algorithms so that each node locally decides when and where to move. This paper presents a behavior-based deployment and self-healing algorithm based on the social potential fields algorithm. In the proposed algorithm, nodes are attached to low cost robots to autonomously navigate in the coverage area. The proposed algorithm has been tested in environments with and without obstacles. Our study also analyzes the differences between non-hierarchical and hierarchical routing configurations in terms of network life and coverage. PMID:28075364

  20. RAHIM: Robust Adaptive Approach Based on Hierarchical Monitoring Providing Trust Aggregation for Wireless Sensor Networks

    NARCIS (Netherlands)

    Labraoui, Nabila; Gueroui, Mourad; Aliouat, Makhlouf; Petit, Jonathan

    2011-01-01

    In-network data aggregation has a great impact on the energy consumption in large-scale wireless sensor networks. However, the resource constraints and vulnerable deployment environments challenge the application of this technique in terms of security and efficiency. A compromised node may forge

  1. RAHIM: Robust Adaptive Approach Based on Hierarchical Monitoring Providing Trust Aggregation for Wireless Sensor Networks

    NARCIS (Netherlands)

    Labraoui, Nabila; Gueroui, Mourad; Aliouat, Makhlouf; Petit, Jonathan

    2011-01-01

    In-network data aggregation has a great impact on the energy consumption in large-scale wireless sensor networks. However, the resource constraints and vulnerable deployment environments challenge the application of this technique in terms of security and efficiency. A compromised node may forge arb

  2. Energy Efficient Zone Division Multihop Hierarchical Clustering Algorithm for Load Balancing in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Ashim Kumar Ghosh

    2011-12-01

    Full Text Available Wireless sensor nodes are use most embedded computing application. Multihop cluster hierarchy has been presented for large wireless sensor networks (WSNs that can provide scalable routing, data aggregation, and querying. The energy consumption rate for sensors in a WSN varies greatly based on the protocols the sensors use for communications. In this paper we present a cluster based routing algorithm. One of our main goals is to design the energy efficient routing protocol. Here we try to solve the usual problems of WSNs. We know the efficiency of WSNs depend upon the distance between node to base station and the amount of data to be transferred and the performance of clustering is greatly influenced by the selection of cluster-heads, which are in charge of creating clusters and controlling member nodes. This algorithm makes the best use of node with low number of cluster head know as super node. Here we divided the full region in four equal zones and the centre area of the region is used to select for super node. Each zone is considered separately and the zone may be or not divided further that’s depending upon the density of nodes in that zone and capability of the super node. This algorithm forms multilayer communication. The no of layer depends on the network current load and statistics. Our algorithm is easily extended to generate a hierarchy of cluster heads to obtain better network management and energy efficiency.

  3. Hierarchical Wireless Multimedia Sensor Networks for Collaborative Hybrid Semi-Supervised Classifier Learning

    Directory of Open Access Journals (Sweden)

    Liang Ding

    2007-11-01

    Full Text Available Wireless multimedia sensor networks (WMSN have recently emerged as one ofthe most important technologies, driven by the powerful multimedia signal acquisition andprocessing abilities. Target classification is an important research issue addressed in WMSN,which has strict requirement in robustness, quickness and accuracy. This paper proposes acollaborative semi-supervised classifier learning algorithm to achieve durative onlinelearning for support vector machine (SVM based robust target classification. The proposedalgorithm incrementally carries out the semi-supervised classifier learning process inhierarchical WMSN, with the collaboration of multiple sensor nodes in a hybrid computingparadigm. For decreasing the energy consumption and improving the performance, somemetrics are introduced to evaluate the effectiveness of the samples in specific sensor nodes,and a sensor node selection strategy is also proposed to reduce the impact of inevitablemissing detection and false detection. With the ant optimization routing, the learningprocess is implemented with the selected sensor nodes, which can decrease the energyconsumption. Experimental results demonstrate that the collaborative hybrid semi-supervised classifier learning algorithm can effectively implement target classification inhierarchical WMSN. It has outstanding performance in terms of energy efficiency and timecost, which verifies the effectiveness of the sensor nodes selection and ant optimizationrouting.

  4. Onboard hierarchical network

    Science.gov (United States)

    Tunesi, Luca; Armbruster, Philippe

    2004-02-01

    The objective of this paper is to demonstrate a suitable hierarchical networking solution to improve capabilities and performances of space systems, with significant recurrent costs saving and more efficient design & manufacturing flows. Classically, a satellite can be split in two functional sub-systems: the platform and the payload complement. The platform is in charge of providing power, attitude & orbit control and up/down-link services, whereas the payload represents the scientific and/or operational instruments/transponders and embodies the objectives of the mission. One major possibility to improve the performance of payloads, by limiting the data return to pertinent information, is to process data on board thanks to a proper implementation of the payload data system. In this way, it is possible to share non-recurring development costs by exploiting a system that can be adopted by the majority of space missions. It is believed that the Modular and Scalable Payload Data System, under development by ESA, provides a suitable solution to fulfil a large range of future mission requirements. The backbone of the system is the standardised high data rate SpaceWire network http://www.ecss.nl/. As complement, a lower speed command and control bus connecting peripherals is required. For instance, at instrument level, there is a need for a "local" low complexity bus, which gives the possibility to command and control sensors and actuators. Moreover, most of the connections at sub-system level are related to discrete signals management or simple telemetry acquisitions, which can easily and efficiently be handled by a local bus. An on-board hierarchical network can therefore be defined by interconnecting high-speed links and local buses. Additionally, it is worth stressing another important aspect of the design process: Agencies and ESA in particular are frequently confronted with a big consortium of geographically spread companies located in different countries, each one

  5. Soft sensor of chemical processes with large numbers of input parameters using auto-associative hierarchical neural network

    Institute of Scientific and Technical Information of China (English)

    Yanlin He; Yuan Xu; Zhiqiang Geng; Qunxiong Zhu

    2015-01-01

    To explore the problems of monitoring chemical processes with large numbers of input parameters, a method based on Auto-associative Hierarchical Neural Network (AHNN) is proposed. AHNN focuses on dealing with datasets in high-dimension. AHNNs consist of two parts:groups of subnets based on well trained Auto-associative Neural Networks (AANNs) and a main net. The subnets play an important role on the performance of AHNN. A simple but effective method of designing the subnets is developed in this paper. In this method, the subnets are designed according to the classification of the data attributes. For getting the classification, an effective method called Extension Data Attributes Classification (EDAC) is adopted. Soft sensor using AHNN based on EDAC (EDAC-AHNN) is introduced. As a case study, the production data of Purified Terephthalic Acid (PTA) solvent system are selected to examine the proposed model. The results of the EDAC-AHNN model are compared with the experimental data extracted from the literature, which shows the efficiency of the proposed model.

  6. Enhanced Deployment Strategy for Role-based Hierarchical Application Agents in Wireless Sensor Networks with Established Clusterheads

    Science.gov (United States)

    Gendreau, Audrey

    Efficient self-organizing virtual clusterheads that supervise data collection based on their wireless connectivity, risk, and overhead costs, are an important element of Wireless Sensor Networks (WSNs). This function is especially critical during deployment when system resources are allocated to a subsequent application. In the presented research, a model used to deploy intrusion detection capability on a Local Area Network (LAN), in the literature, was extended to develop a role-based hierarchical agent deployment algorithm for a WSN. The resulting model took into consideration the monitoring capability, risk, deployment distribution cost, and monitoring cost associated with each node. Changing the original LAN methodology approach to model a cluster-based sensor network depended on the ability to duplicate a specific parameter that represented the monitoring capability. Furthermore, other parameters derived from a LAN can elevate costs and risk of deployment, as well as jeopardize the success of an application on a WSN. A key component of the approach presented in this research was to reduce the costs when established clusterheads in the network were found to be capable of hosting additional detection agents. In addition, another cost savings component of the study addressed the reduction of vulnerabilities associated with deployment of agents to high volume nodes. The effectiveness of the presented method was validated by comparing it against a type of a power-based scheme that used each node's remaining energy as the deployment value. While available energy is directly related to the model used in the presented method, the study deliberately sought out nodes that were identified with having superior monitoring capability, cost less to create and sustain, and are at low-risk of an attack. This work investigated improving the efficiency of an intrusion detection system (IDS) by using the proposed model to deploy monitoring agents after a temperature sensing

  7. Detecting Hierarchical Structure in Networks

    DEFF Research Database (Denmark)

    Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard;

    2012-01-01

    a generative Bayesian model that is able to infer whether hierarchies are present or not from a hypothesis space encompassing all types of hierarchical tree structures. For efficient inference we propose a collapsed Gibbs sampling procedure that jointly infers a partition and its hierarchical structure......Many real-world networks exhibit hierarchical organization. Previous models of hierarchies within relational data has focused on binary trees; however, for many networks it is unknown whether there is hierarchical structure, and if there is, a binary tree might not account well for it. We propose....... On synthetic and real data we demonstrate that our model can detect hierarchical structure leading to better link-prediction than competing models. Our model can be used to detect if a network exhibits hierarchical structure, thereby leading to a better comprehension and statistical account the network....

  8. Hierarchal Variable Switching Sets of Interacting Multiple Model for Tracking Maneuvering Targets in Sensor Network

    Directory of Open Access Journals (Sweden)

    Seham Moawoud Ay Ebrahim

    2013-01-01

    Full Text Available Tracking maneuvering targets introduce two major directions to improve the Multiple Model (MM approach: Develop a better MM algorithm and design a better model set. The Interacting Multiple Model (IMM estimator is a suboptimal hybrid filter that has been shown to be one of the most cost-effective hybrid state estimation schemes. The main feature of this algorithm is the ability to estimate the state of a dynamic system with several behavior modes which can "switch" from one to another. In particular, the use of too many models is performance-wise as bad as that of too few models. In this paper we show that the use of too many models is performance-wise as bad as that of too few models. To overcome this we divide the models into a small number of sets, tuning these sets during operation at the right operating set. We proposed Hierarchal Switching sets of IMM (HSIMM. The state space of the nonlinear variable is divided into sets each set has its own IMM. The connection between them is the switching algorithm which manages the activation and termination of sets. Also the re-initialization process overcomes the error accumulation due to the targets changes from one model to another. This switching can introduce a number of different models while no restriction on their number. The activation of sets depends on the threshold value of set likely hood. As the likely hood of the set is higher than threshold it is active otherwise it is minimized. The result is the weighted sum of the output of active sets. The computational time is minimum than introduced by IMM and VIMM. HSIMM introduces less error as the noise increase and there is no need for re adjustment to the Covariance as the noise increase so it is more robust against noise and introduces minimum computational time.

  9. Enhanced Deployment Strategy for Role-Based Hierarchical Application Agents in Wireless Sensor Networks with Established Clusterheads

    Science.gov (United States)

    Gendreau, Audrey

    2014-01-01

    Efficient self-organizing virtual clusterheads that supervise data collection based on their wireless connectivity, risk, and overhead costs, are an important element of Wireless Sensor Networks (WSNs). This function is especially critical during deployment when system resources are allocated to a subsequent application. In the presented research,…

  10. Memory Stacking in Hierarchical Networks.

    Science.gov (United States)

    Westö, Johan; May, Patrick J C; Tiitinen, Hannu

    2016-02-01

    Robust representations of sounds with a complex spectrotemporal structure are thought to emerge in hierarchically organized auditory cortex, but the computational advantage of this hierarchy remains unknown. Here, we used computational models to study how such hierarchical structures affect temporal binding in neural networks. We equipped individual units in different types of feedforward networks with local memory mechanisms storing recent inputs and observed how this affected the ability of the networks to process stimuli context dependently. Our findings illustrate that these local memories stack up in hierarchical structures and hence allow network units to exhibit selectivity to spectral sequences longer than the time spans of the local memories. We also illustrate that short-term synaptic plasticity is a potential local memory mechanism within the auditory cortex, and we show that it can bring robustness to context dependence against variation in the temporal rate of stimuli, while introducing nonlinearities to response profiles that are not well captured by standard linear spectrotemporal receptive field models. The results therefore indicate that short-term synaptic plasticity might provide hierarchically structured auditory cortex with computational capabilities important for robust representations of spectrotemporal patterns.

  11. Hierarchical Nanoceramics for Industrial Process Sensors

    Energy Technology Data Exchange (ETDEWEB)

    Ruud, James, A.; Brosnan, Kristen, H.; Striker, Todd; Ramaswamy, Vidya; Aceto, Steven, C.; Gao, Yan; Willson, Patrick, D.; Manoharan, Mohan; Armstrong, Eric, N., Wachsman, Eric, D.; Kao, Chi-Chang

    2011-07-15

    This project developed a robust, tunable, hierarchical nanoceramics materials platform for industrial process sensors in harsh-environments. Control of material structure at multiple length scales from nano to macro increased the sensing response of the materials to combustion gases. These materials operated at relatively high temperatures, enabling detection close to the source of combustion. It is anticipated that these materials can form the basis for a new class of sensors enabling widespread use of efficient combustion processes with closed loop feedback control in the energy-intensive industries. The first phase of the project focused on materials selection and process development, leading to hierarchical nanoceramics that were evaluated for sensing performance. The second phase focused on optimizing the materials processes and microstructures, followed by validation of performance of a prototype sensor in a laboratory combustion environment. The objectives of this project were achieved by: (1) synthesizing and optimizing hierarchical nanostructures; (2) synthesizing and optimizing sensing nanomaterials; (3) integrating sensing functionality into hierarchical nanostructures; (4) demonstrating material performance in a sensing element; and (5) validating material performance in a simulated service environment. The project developed hierarchical nanoceramic electrodes for mixed potential zirconia gas sensors with increased surface area and demonstrated tailored electrocatalytic activity operable at high temperatures enabling detection of products of combustion such as NOx close to the source of combustion. Methods were developed for synthesis of hierarchical nanostructures with high, stable surface area, integrated catalytic functionality within the structures for gas sensing, and demonstrated materials performance in harsh lab and combustion gas environments.

  12. Sensor network architectures for monitoring underwater pipelines.

    Science.gov (United States)

    Mohamed, Nader; Jawhar, Imad; Al-Jaroodi, Jameela; Zhang, Liren

    2011-01-01

    This paper develops and compares different sensor network architecture designs that can be used for monitoring underwater pipeline infrastructures. These architectures are underwater wired sensor networks, underwater acoustic wireless sensor networks, RF (radio frequency) wireless sensor networks, integrated wired/acoustic wireless sensor networks, and integrated wired/RF wireless sensor networks. The paper also discusses the reliability challenges and enhancement approaches for these network architectures. The reliability evaluation, characteristics, advantages, and disadvantages among these architectures are discussed and compared. Three reliability factors are used for the discussion and comparison: the network connectivity, the continuity of power supply for the network, and the physical network security. In addition, the paper also develops and evaluates a hierarchical sensor network framework for underwater pipeline monitoring.

  13. Sensor Network Architectures for Monitoring Underwater Pipelines

    Directory of Open Access Journals (Sweden)

    Imad Jawhar

    2011-11-01

    Full Text Available This paper develops and compares different sensor network architecture designs that can be used for monitoring underwater pipeline infrastructures. These architectures are underwater wired sensor networks, underwater acoustic wireless sensor networks, RF (Radio Frequency wireless sensor networks, integrated wired/acoustic wireless sensor networks, and integrated wired/RF wireless sensor networks. The paper also discusses the reliability challenges and enhancement approaches for these network architectures. The reliability evaluation, characteristics, advantages, and disadvantages among these architectures are discussed and compared. Three reliability factors are used for the discussion and comparison: the network connectivity, the continuity of power supply for the network, and the physical network security. In addition, the paper also develops and evaluates a hierarchical sensor network framework for underwater pipeline monitoring.

  14. Hierarchical networks of scientific journals

    CERN Document Server

    Palla, Gergely; Mones, Enys; Pollner, Péter; Vicsek, Tamás

    2015-01-01

    Scientific journals are the repositories of the gradually accumulating knowledge of mankind about the world surrounding us. Just as our knowledge is organised into classes ranging from major disciplines, subjects and fields to increasingly specific topics, journals can also be categorised into groups using various metrics. In addition to the set of topics characteristic for a journal, they can also be ranked regarding their relevance from the point of overall influence. One widespread measure is impact factor, but in the present paper we intend to reconstruct a much more detailed description by studying the hierarchical relations between the journals based on citation data. We use a measure related to the notion of m-reaching centrality and find a network which shows the level of influence of a journal from the point of the direction and efficiency with which information spreads through the network. We can also obtain an alternative network using a suitably modified nested hierarchy extraction method applied ...

  15. Hierarchical Network Design Using Simulated Annealing

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Clausen, Jens

    2002-01-01

    The hierarchical network problem is the problem of finding the least cost network, with nodes divided into groups, edges connecting nodes in each groups and groups ordered in a hierarchy. The idea of hierarchical networks comes from telecommunication networks where hierarchies exist. Hierarchical...... networks are described and a mathematical model is proposed for a two level version of the hierarchical network problem. The problem is to determine which edges should connect nodes, and how demand is routed in the network. The problem is solved heuristically using simulated annealing which as a sub......-algorithm uses a construction algorithm to determine edges and route the demand. Performance for different versions of the algorithm are reported in terms of runtime and quality of the solutions. The algorithm is able to find solutions of reasonable quality in approximately 1 hour for networks with 100 nodes....

  16. Hierarchical modularity in human brain functional networks

    CERN Document Server

    Meunier, D; Fornito, A; Ersche, K D; Bullmore, E T; 10.3389/neuro.11.037.2009

    2010-01-01

    The idea that complex systems have a hierarchical modular organization originates in the early 1960s and has recently attracted fresh support from quantitative studies of large scale, real-life networks. Here we investigate the hierarchical modular (or "modules-within-modules") decomposition of human brain functional networks, measured using functional magnetic resonance imaging (fMRI) in 18 healthy volunteers under no-task or resting conditions. We used a customized template to extract networks with more than 1800 regional nodes, and we applied a fast algorithm to identify nested modular structure at several hierarchical levels. We used mutual information, 0 < I < 1, to estimate the similarity of community structure of networks in different subjects, and to identify the individual network that is most representative of the group. Results show that human brain functional networks have a hierarchical modular organization with a fair degree of similarity between subjects, I=0.63. The largest 5 modules at ...

  17. Analyzing security protocols in hierarchical networks

    DEFF Research Database (Denmark)

    Zhang, Ye; Nielson, Hanne Riis

    2006-01-01

    Validating security protocols is a well-known hard problem even in a simple setting of a single global network. But a real network often consists of, besides the public-accessed part, several sub-networks and thereby forms a hierarchical structure. In this paper we first present a process calculus...... capturing the characteristics of hierarchical networks and describe the behavior of protocols on such networks. We then develop a static analysis to automate the validation. Finally we demonstrate how the technique can benefit the protocol development and the design of network systems by presenting a series...

  18. Modular, Hierarchical Learning By Artificial Neural Networks

    Science.gov (United States)

    Baldi, Pierre F.; Toomarian, Nikzad

    1996-01-01

    Modular and hierarchical approach to supervised learning by artificial neural networks leads to neural networks more structured than neural networks in which all neurons fully interconnected. These networks utilize general feedforward flow of information and sparse recurrent connections to achieve dynamical effects. The modular organization, sparsity of modular units and connections, and fact that learning is much more circumscribed are all attractive features for designing neural-network hardware. Learning streamlined by imitating some aspects of biological neural networks.

  19. Environmental Sensor Networks

    OpenAIRE

    Martinez, Kirk; Hart, Jane; Ong, Royan

    2004-01-01

    Sensor networks for the natural environment require an understanding of earth science, combined with sensor, communications and computer technology. We discuss the evolution from data logging to sensor networks, describe our research from a glacial environment and highlight future challenges in this field.

  20. Universal hierarchical behavior of citation networks

    CERN Document Server

    Mones, Enys; Vicsek, Tamás

    2014-01-01

    Many of the essential features of the evolution of scientific research are imprinted in the structure of citation networks. Connections in these networks imply information about the transfer of knowledge among papers, or in other words, edges describe the impact of papers on other publications. This inherent meaning of the edges infers that citation networks can exhibit hierarchical features, that is typical of networks based on decision-making. In this paper, we investigate the hierarchical structure of citation networks consisting of papers in the same field. We find that the majority of the networks follow a universal trend towards a highly hierarchical state, and i) the various fields display differences only concerning their phase in life (distance from the "birth" of a field) or ii) the characteristic time according to which they are approaching the stationary state. We also show by a simple argument that the alterations in the behavior are related to and can be understood by the degree of specializatio...

  1. Hierarchical social networks and information flow

    Science.gov (United States)

    López, Luis; F. F. Mendes, Jose; Sanjuán, Miguel A. F.

    2002-12-01

    Using a simple model for the information flow on social networks, we show that the traditional hierarchical topologies frequently used by companies and organizations, are poorly designed in terms of efficiency. Moreover, we prove that this type of structures are the result of the individual aim of monopolizing as much information as possible within the network. As the information is an appropriate measurement of centrality, we conclude that this kind of topology is so attractive for leaders, because the global influence each actor has within the network is completely determined by the hierarchical level occupied.

  2. Strategic games on a hierarchical network model

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Among complex network models, the hierarchical network model is the one most close to such real networks as world trade web, metabolic network, WWW, actor network, and so on. It has not only the property of power-law degree distribution, but growth based on growth and preferential attachment, showing the scale-free degree distribution property. In this paper, we study the evolution of cooperation on a hierarchical network model, adopting the prisoner's dilemma (PD) game and snowdrift game (SG) as metaphors of the interplay between connected nodes. BA model provides a unifying framework for the emergence of cooperation. But interestingly, we found that on hierarchical model, there is no sign of cooperation for PD game, while the frequency of cooperation decreases as the common benefit decreases for SG. By comparing the scaling clustering coefficient properties of the hierarchical network model with that of BA model, we found that the former amplifies the effect of hubs. Considering different performances of PD game and SG on complex network, we also found that common benefit leads to cooperation in the evolution. Thus our study may shed light on the emergence of cooperation in both natural and social environments.

  3. Ultrafast Hierarchical OTDM/WDM Network

    Directory of Open Access Journals (Sweden)

    Hideyuki Sotobayashi

    2003-12-01

    Full Text Available Ultrafast hierarchical OTDM/WDM network is proposed for the future core-network. We review its enabling technologies: C- and L-wavelength-band generation, OTDM-WDM mutual multiplexing format conversions, and ultrafast OTDM wavelengthband conversions.

  4. Noise enhances information transfer in hierarchical networks.

    Science.gov (United States)

    Czaplicka, Agnieszka; Holyst, Janusz A; Sloot, Peter M A

    2013-01-01

    We study the influence of noise on information transmission in the form of packages shipped between nodes of hierarchical networks. Numerical simulations are performed for artificial tree networks, scale-free Ravasz-Barabási networks as well for a real network formed by email addresses of former Enron employees. Two types of noise are considered. One is related to packet dynamics and is responsible for a random part of packets paths. The second one originates from random changes in initial network topology. We find that the information transfer can be enhanced by the noise. The system possesses optimal performance when both kinds of noise are tuned to specific values, this corresponds to the Stochastic Resonance phenomenon. There is a non-trivial synergy present for both noisy components. We found also that hierarchical networks built of nodes of various degrees are more efficient in information transfer than trees with a fixed branching factor.

  5. Wireless Sensors Network (Sensornet)

    Science.gov (United States)

    Perotti, J.

    2003-01-01

    The Wireless Sensor Network System presented in this paper provides a flexible reconfigurable architecture that could be used in a broad range of applications. It also provides a sensor network with increased reliability; decreased maintainability costs, and assured data availability by autonomously and automatically reconfiguring to overcome communication interferences.

  6. Biased trapping issue on weighted hierarchical networks

    Indian Academy of Sciences (India)

    Meifeng Dai; Jie Liu; Feng Zhu

    2014-10-01

    In this paper, we present trapping issues of weight-dependent walks on weighted hierarchical networks which are based on the classic scale-free hierarchical networks. Assuming that edge’s weight is used as local information by a random walker, we introduce a biased walk. The biased walk is that a walker, at each step, chooses one of its neighbours with a probability proportional to the weight of the edge. We focus on a particular case with the immobile trap positioned at the hub node which has the largest degree in the weighted hierarchical networks. Using a method based on generating functions, we determine explicitly the mean first-passage time (MFPT) for the trapping issue. Let parameter (0 < < 1) be the weight factor. We show that the efficiency of the trapping process depends on the parameter a; the smaller the value of a, the more efficient is the trapping process.

  7. Sensor Network Motes:

    DEFF Research Database (Denmark)

    Leopold, Martin

    This dissertation describes our efforts to improve sensor network performance evaluation and portability, within the context of the sensor network project Hogthrob. In Hogthrob, we faced the challenge of building an sensor network architecture for sow monitoring. This application has hard...... requirements on price and performance, and shows great potential for using sensor networks. Throughout the project we let the application requirements guide our design choices, leading us to push the technologies further to meet the specific goal of the application. In this dissertation, we attack two key...... to investigate these challenges and apart from developing the methodologies, we also present the results of our experiments. In particular, we present a new vector based methodology for performance evaluation of sensor network devices (motes) and applications, based on application specific benchmarking...

  8. Hierarchical Neural Network Structures for Phoneme Recognition

    CERN Document Server

    Vasquez, Daniel; Minker, Wolfgang

    2013-01-01

    In this book, hierarchical structures based on neural networks are investigated for automatic speech recognition. These structures are evaluated on the phoneme recognition task where a  Hybrid Hidden Markov Model/Artificial Neural Network paradigm is used. The baseline hierarchical scheme consists of two levels each which is based on a Multilayered Perceptron. Additionally, the output of the first level serves as a second level input. The computational speed of the phoneme recognizer can be substantially increased by removing redundant information still contained at the first level output. Several techniques based on temporal and phonetic criteria have been investigated to remove this redundant information. The computational time could be reduced by 57% whilst keeping the system accuracy comparable to the baseline hierarchical approach.

  9. Non-homogeneous fractal hierarchical weighted networks.

    Science.gov (United States)

    Dong, Yujuan; Dai, Meifeng; Ye, Dandan

    2015-01-01

    A model of fractal hierarchical structures that share the property of non-homogeneous weighted networks is introduced. These networks can be completely and analytically characterized in terms of the involved parameters, i.e., the size of the original graph Nk and the non-homogeneous weight scaling factors r1, r2, · · · rM. We also study the average weighted shortest path (AWSP), the average degree and the average node strength, taking place on the non-homogeneous hierarchical weighted networks. Moreover the AWSP is scrupulously calculated. We show that the AWSP depends on the number of copies and the sum of all non-homogeneous weight scaling factors in the infinite network order limit.

  10. Hierarchical community structure in complex (social) networks

    CERN Document Server

    Massaro, Emanuele

    2014-01-01

    The investigation of community structure in networks is a task of great importance in many disciplines, namely physics, sociology, biology and computer science where systems are often represented as graphs. One of the challenges is to find local communities from a local viewpoint in a graph without global information in order to reproduce the subjective hierarchical vision for each vertex. In this paper we present the improvement of an information dynamics algorithm in which the label propagation of nodes is based on the Markovian flow of information in the network under cognitive-inspired constraints \\cite{Massaro2012}. In this framework we have introduced two more complex heuristics that allow the algorithm to detect the multi-resolution hierarchical community structure of networks from a source vertex or communities adopting fixed values of model's parameters. Experimental results show that the proposed methods are efficient and well-behaved in both real-world and synthetic networks.

  11. Routing Technique Based on Clustering for Data Duplication Prevention in Wireless Sensor Network

    OpenAIRE

    Boseung Kim; HuiBin Lim; Yongtae Shin

    2009-01-01

    Wireless Sensor Networks is important to node’s energy consumption for long activity of sensor nodes because nodes that compose sensor network are small size, and battery capacity is limited. For energy consumption decrease of sensor nodes, sensor network’s routing technique is divided by flat routing and hierarchical routing technique. Specially, hierarchical routing technique is energy-efficient routing protocol to pare down energy consumption of whole sensor nodes and to scatter energy con...

  12. The Hourglass Effect in Hierarchical Dependency Networks

    CERN Document Server

    Sabrin, Kaeser M

    2016-01-01

    Many hierarchically modular systems are structured in a way that resembles a bow-tie or hourglass. This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system (the waist of the hourglass). We investigate the hourglass effect in general (not necessarily layered) hierarchical dependency networks. Our analysis focuses on the number of source-to-target dependency paths that traverse each vertex, and it identifies the core of a dependency network as the smallest set of vertices that collectively cover almost all dependency paths. We then examine if a given network exhibits the hourglass property or not, comparing its core size with a "flat" (i.e., non-hierarchical) network that preserves the source dependencies of each target in the original network. As a possible explanation for the hourglass effect, we propose the Reuse Preference (RP) model that captures the bias of new mo...

  13. Synchronization patterns: from network motifs to hierarchical networks

    Science.gov (United States)

    Krishnagopal, Sanjukta; Lehnert, Judith; Poel, Winnie; Zakharova, Anna; Schöll, Eckehard

    2017-03-01

    We investigate complex synchronization patterns such as cluster synchronization and partial amplitude death in networks of coupled Stuart-Landau oscillators with fractal connectivities. The study of fractal or self-similar topology is motivated by the network of neurons in the brain. This fractal property is well represented in hierarchical networks, for which we present three different models. In addition, we introduce an analytical eigensolution method and provide a comprehensive picture of the interplay of network topology and the corresponding network dynamics, thus allowing us to predict the dynamics of arbitrarily large hierarchical networks simply by analysing small network motifs. We also show that oscillation death can be induced in these networks, even if the coupling is symmetric, contrary to previous understanding of oscillation death. Our results show that there is a direct correlation between topology and dynamics: hierarchical networks exhibit the corresponding hierarchical dynamics. This helps bridge the gap between mesoscale motifs and macroscopic networks. This article is part of the themed issue 'Horizons of cybernetical physics'.

  14. Miniaturized wireless sensor network

    CERN Document Server

    Lecointre, Aubin; Dubuc, David; Katia, Grenier; Patrick, Pons; Aubert, Hervé; Muller, A; Berthou, Pascal; Gayraud, Thierry; Plana, Robert

    2010-01-01

    This paper addresses an overview of the wireless sensor networks. It is shown that MEMS/NEMS technologies and SIP concept are well suited for advanced architectures. It is also shown analog architectures have to be compatible with digital signal techniques to develop smart network of microsystem.

  15. Wireless Sensor Networks Approach

    Science.gov (United States)

    Perotti, Jose M.

    2003-01-01

    This viewgraph presentation provides information on hardware and software configurations for a network architecture for sensors. The hardware configuration uses a central station and remote stations. The software configuration uses the 'lost station' software algorithm. The presentation profiles a couple current examples of this network architecture in use.

  16. Wireless rechargeable sensor networks

    CERN Document Server

    Yang, Yuanyuan

    2015-01-01

    This SpringerBrief provides a concise guide to applying wireless energy transfer techniques in traditional battery-powered sensor networks. It examines the benefits and challenges of wireless power including efficiency and reliability. The authors build a wireless rechargeable sensor networks from scratch and aim to provide perpetual network operation. Chapters cover a wide range of topics from the collection of energy information and recharge scheduling to joint design with typical sensing applications such as data gathering. Problems are approached using a natural combination of probability

  17. First-passage phenomena in hierarchical networks

    CERN Document Server

    Tavani, Flavia

    2016-01-01

    In this paper we study Markov processes and related first passage problems on a class of weighted, modular graphs which generalize the Dyson hierarchical model. In these networks, the coupling strength between two nodes depends on their distance and is modulated by a parameter $\\sigma$. We find that, in the thermodynamic limit, ergodicity is lost and the "distant" nodes can not be reached. Moreover, for finite-sized systems, there exists a threshold value for $\\sigma$ such that, when $\\sigma$ is relatively large, the inhomogeneity of the coupling pattern prevails and "distant" nodes are hardly reached. The same analysis is carried on also for generic hierarchical graphs, where interactions are meant to involve $p$-plets ($p>2$) of nodes, finding that ergodicity is still broken in the thermodynamic limit, but no threshold value for $\\sigma$ is evidenced, ultimately due to a slow growth of the network diameter with the size.

  18. Advances in wireless sensors and sensor networks

    CERN Document Server

    Mukhopadhyay, Subhas Chandra; Leung, Henry

    2010-01-01

    Written by experts, this book illustrates and collects recent advances in wireless sensors and sensor networks. It provides clever support for scientists, students and researchers in order to stimulate exchange and discussions for further developments.

  19. Modular sensor network node

    Science.gov (United States)

    Davis, Jesse Harper Zehring; Stark, Jr., Douglas Paul; Kershaw, Christopher Patrick; Kyker, Ronald Dean

    2008-06-10

    A distributed wireless sensor network node is disclosed. The wireless sensor network node includes a plurality of sensor modules coupled to a system bus and configured to sense a parameter. The parameter may be an object, an event or any other parameter. The node collects data representative of the parameter. The node also includes a communication module coupled to the system bus and configured to allow the node to communicate with other nodes. The node also includes a processing module coupled to the system bus and adapted to receive the data from the sensor module and operable to analyze the data. The node also includes a power module connected to the system bus and operable to generate a regulated voltage.

  20. Security Aspects of Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mohd Muntjir

    2013-01-01

    Full Text Available Sensor networks are amassed wireless networks of small, low-cost sensors that collect and propagate environmental data. The emerging field of wireless sensor networks integrates sensing, computation, and communication into a single device. The power of wireless sensor networks verifies in the capability to deploy huge numbers of small nodes that collaborates and configure them. Wireless sensor networks simplify monitoring and handling of physical environments from remote locations with best accuracy. Security protocols associated to sensor network are analyzed in this paper.

  1. Energy Efficient Hierarchical Collaboration Coverage Model in Wireless Sensor Network%WSN中能量有效的分层协作覆盖模型

    Institute of Scientific and Technical Information of China (English)

    杨勇; 夏士雄; 周勇

    2012-01-01

    针对传统网络覆盖模型仅以区域覆盖率作为评价标准,而未考察不同覆盖模型下节点能量有效性问题,在协作覆盖模型的基础上,提出了能量有效的分层协作覆盖模型EEHCCM(energy efficient hierarchical collaboration coverage model),并应用蚁群优化算法进行求解.该模型通过对目标区域进行分层,并优化各个层内的节点数目来实现节点能量的能耗均衡.提出了基于分层协作覆盖模型的启发式因子和全覆盖条件下节点数量的上下限的计算方法.通过Matlab仿真实验,其结果表明,应用EEHCCM模型实现目标区域节点的部署,在同等覆盖能力下,网络的生存时间可以得到较大的提升,与传统的覆盖算法相比,更适用于实际的节点部署.%Since the node's energy dissipation model is not taken in to account in the traditional coverage models, based on the collaboration coverage model, the energy efficient hierarchical collaboration coverage model is proposed, which can evenly balance the energy dissipation among different layers in the target monitor area. This paper solves two specific problems in the ant colony solution. They are a formula of heuristic factor calculating for the model and the upper and lower bounds of node numbers. Simulations in Matlab show that the proposed model is more suitable for practical deployment which can evidently prolong the network lifetime.

  2. Routing Algorithm of Hierarchical Wireless Sensor Network%一种基于分层无线传感器网络的路由算法

    Institute of Scientific and Technical Information of China (English)

    邹瑜; 彭舰; 黎红友

    2012-01-01

    在多跳无线传感器网络中,靠近sink的节点由于需要转发来自外部的数据,其能量消耗速度快于离sink较远的节点,从而导致“能量空洞”的出现.采用分层的网络结构能够有效延迟能量空洞的出现.在分析现有路由算法 的基础上,结合分层的思想,对现有算法的路由算法进行了改进,提出了分层网络中各层环内最佳簇头和成簇概率的计算方法.在路由发现阶段引入了簇头路由指标,用于控制路由簇头接纳的路由数量,从而平衡了环内各个路由簇头的能量消耗.仿真实验结果表明,新的路由算法在网络生存时间、能耗均匀程度方面均优于现有算法.%Cluster-heads closer to the sink are burdened with heavy relay traffic and incline to die early, because the clustesr-heads transmit their data to sink via multi-hop communication. And this phenomenon is known as "energy hole". It wasproved that the architecture of hierarchical network can effectively delay the energy hole problem. Based on the method of the main routing algorithms, the existing routing algorithms was improved in computing the number of optimal cluster-head and the probability of each node being cluster-head, in every annular network. Considering the thought of hierarchy,cluster-head routing quota (CRQ) algorithm was proposed,which can be used to control the accepting numbers of each router,in phrase of routing detecting. Thus,it meets the demand of evenly consuming the ener-gy of each cluster-head located in the same ring. Simulation results demonstrate that the new algorithm is better than existing routing algorithm in the network lifetime and energy consumption.

  3. 水声传感器网络簇头分层通信模式路由算法%Routing Protocol of Hierarchical Cluster-Communication Model in the Underwater Acoustic Sensor Network

    Institute of Scientific and Technical Information of China (English)

    马绅惟; 刘广钟

    2014-01-01

    Routing protocol plays a very important role in underwater acoustic sensor networks. Based on the traditional TEEN protocol, a new routing protocol named HCM-TEEN(Hierarchical Cluster-communication Model on TEEN) has been put forward. The improved algorithm sets a new threshold function on the basis of the process of cluster candidate and the cluster elimination, and then introduces a Hierarchical Cluster-communication model in the period of data transmission to optimize the routing process. The experiment by the Matlab proved that HCM-TEEN performed better than the traditional algorithm on the network lifetime and the network average residual energy.%路由协议在水声传感器网络研究领域中扮演着非常重要的角色。基于传统的TEEN协议路由算法,提出了水声传感器网络中簇头分层通信模式的路由算法(HCM-TEEN)。新算法从簇头候选与淘汰过程入手,设置新的阈值函数。在簇头确定完成后,在数据传输阶段引入簇头分层通信模式,从距离和能量的角度上优化路由选择。通过Matlab仿真实验显示, HCM-TEEN算法与传统的算法相比在网络生命周期和节点平均剩余能量上都更具优越性。

  4. Programming Wireless Sensor Networks

    Science.gov (United States)

    Lopes, Luís; Martins, Francisco; Barros, João

    Sensor networks can be viewed as a collection of tiny, low-cost devices programmed to sense the physical world and that communicate over radio links [12]. The devices are commonly called motes or smart dust [676], in allusion to their computational and sensing capabilities, as well as their increasingly small size.

  5. Ubiquitous Sensor Network for Chemical Sensors

    Institute of Scientific and Technical Information of China (English)

    Wan-Young Chung; Risto Myllylae

    2006-01-01

    Wireless sensor networks have been identified as one of the most important technologies for the 21st century. Recent advances in micro sensor fabrication technology and wireless communication technology enable the practical deployment of large-scale, low-power, inexpensive sensor networks. Such an approach offers an advantage over traditional sensing methods in many ways: large-scale, dense deployment not only extends spatial coverage and achieves higher resolution, but also increases the system's fault-tolerance and robustness. Moreover, the ad-hoc nature of wireless sensor networks makes them even more attractive for military and other risk-associated applications, such as environmental observation and habitat monitoring.

  6. Synchronized Data Aggregation for Wireless Sensor Network

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

    2014-01-01

    Wireless Sensor Networks (WSNs) are used for monitoring and data collection purposes. A key challenge in effective data collection is to schedule and synchronize the activities of the nodes with global clock. This paper proposes the Synchronized Data Aggregation Algorithm (SDA) using spanning tree...... mechanism. It provides network-wide time synchronization for sensor network. In the initial stage algorithm established the hierarchical structure in the network and then perform the pair - wise synchronization. SDA aggregate data with a global time scale throughout the network. The aggregated packets...... are scheduled using TDMA as the MAC layer protocol. Simulation results show that, SDA gives promising result of energy efficiency and delay as compared with state-of-the-art solutions....

  7. HIDEN: Hierarchical decomposition of regulatory networks

    Directory of Open Access Journals (Sweden)

    Gülsoy Günhan

    2012-09-01

    Full Text Available Abstract Background Transcription factors regulate numerous cellular processes by controlling the rate of production of each gene. The regulatory relations are modeled using transcriptional regulatory networks. Recent studies have shown that such networks have an underlying hierarchical organization. We consider the problem of discovering the underlying hierarchy in transcriptional regulatory networks. Results We first transform this problem to a mixed integer programming problem. We then use existing tools to solve the resulting problem. For larger networks this strategy does not work due to rapid increase in running time and space usage. We use divide and conquer strategy for such networks. We use our method to analyze the transcriptional regulatory networks of E. coli, H. sapiens and S. cerevisiae. Conclusions Our experiments demonstrate that: (i Our method gives statistically better results than three existing state of the art methods; (ii Our method is robust against errors in the data and (iii Our method’s performance is not affected by the different topologies in the data.

  8. The hierarchical brain network for face recognition.

    Science.gov (United States)

    Zhen, Zonglei; Fang, Huizhen; Liu, Jia

    2013-01-01

    Numerous functional magnetic resonance imaging (fMRI) studies have identified multiple cortical regions that are involved in face processing in the human brain. However, few studies have characterized the face-processing network as a functioning whole. In this study, we used fMRI to identify face-selective regions in the entire brain and then explore the hierarchical structure of the face-processing network by analyzing functional connectivity among these regions. We identified twenty-five regions mainly in the occipital, temporal and frontal cortex that showed a reliable response selective to faces (versus objects) across participants and across scan sessions. Furthermore, these regions were clustered into three relatively independent sub-networks in a face-recognition task on the basis of the strength of functional connectivity among them. The functionality of the sub-networks likely corresponds to the recognition of individual identity, retrieval of semantic knowledge and representation of emotional information. Interestingly, when the task was switched to object recognition from face recognition, the functional connectivity between the inferior occipital gyrus and the rest of the face-selective regions were significantly reduced, suggesting that this region may serve as an entry node in the face-processing network. In sum, our study provides empirical evidence for cognitive and neural models of face recognition and helps elucidate the neural mechanisms underlying face recognition at the network level.

  9. Distributed sensor networks

    CERN Document Server

    Rubin, Donald B; Carlin, John B; Iyengar, S Sitharama; Brooks, Richard R; University, Clemson

    2014-01-01

    An Overview, S.S. Iyengar, Ankit Tandon, and R.R. BrooksMicrosensor Applications, David ShepherdA Taxonomy of Distributed Sensor Networks, Shivakumar Sastry and S.S. IyengarContrast with Traditional Systems, R.R. BrooksDigital Signal Processing Background, Yu Hen HuImage-Processing Background Lynne Grewe and Ben ShahshahaniObject Detection and Classification, Akbar M. SayeedParameter Estimation David FriedlanderTarget Tracking with Self-Organizing Distributed Sensors R.R. Brooks, C. Griffin, D.S. Friedlander, and J.D. KochCollaborative Signal and Information Processing: AnInformation-Directed Approach Feng Zhao, Jie Liu, Juan Liu, Leonidas Guibas, and James ReichEnvironmental Effects, David C. SwansonDetecting and Counteracting Atmospheric Effects Lynne L. GreweSignal Processing and Propagation for Aeroacoustic Sensor Networks, Richard J. Kozick, Brian M. Sadler, and D. Keith WilsonDistributed Multi-Target Detection in Sensor Networks Xiaoling Wang, Hairong Qi, and Steve BeckFoundations of Data Fusion f...

  10. Hierarchical mutual information for the comparison of hierarchical community structures in complex networks

    CERN Document Server

    Perotti, Juan Ignacio; Caldarelli, Guido

    2015-01-01

    The quest for a quantitative characterization of community and modular structure of complex networks produced a variety of methods and algorithms to classify different networks. However, it is not clear if such methods provide consistent, robust and meaningful results when considering hierarchies as a whole. Part of the problem is the lack of a similarity measure for the comparison of hierarchical community structures. In this work we give a contribution by introducing the {\\it hierarchical mutual information}, which is a generalization of the traditional mutual information, and allows to compare hierarchical partitions and hierarchical community structures. The {\\it normalized} version of the hierarchical mutual information should behave analogously to the traditional normalized mutual information. Here, the correct behavior of the hierarchical mutual information is corroborated on an extensive battery of numerical experiments. The experiments are performed on artificial hierarchies, and on the hierarchical ...

  11. Antiferromagnetic Ising Model in Hierarchical Networks

    Science.gov (United States)

    Cheng, Xiang; Boettcher, Stefan

    2015-03-01

    The Ising antiferromagnet is a convenient model of glassy dynamics. It can introduce geometric frustrations and may give rise to a spin glass phase and glassy relaxation at low temperatures [ 1 ] . We apply the antiferromagnetic Ising model to 3 hierarchical networks which share features of both small world networks and regular lattices. Their recursive and fixed structures make them suitable for exact renormalization group analysis as well as numerical simulations. We first explore the dynamical behaviors using simulated annealing and discover an extremely slow relaxation at low temperatures. Then we employ the Wang-Landau algorithm to investigate the energy landscape and the corresponding equilibrium behaviors for different system sizes. Besides the Monte Carlo methods, renormalization group [ 2 ] is used to study the equilibrium properties in the thermodynamic limit and to compare with the results from simulated annealing and Wang-Landau sampling. Supported through NSF Grant DMR-1207431.

  12. Sensor Networks for Medical Care

    OpenAIRE

    Shnayder, Victor; Chen, Bor-rong; Lorincz, Konrad; Fulford-Jones, Thaddeus R. F.; Welsh, Matt

    2005-01-01

    Sensor networks have the potential to greatly impact many aspects of medical care. By outfitting patients with wireless, wearable vital sign sensors, collecting detailed real-time data on physiological status can be greatly simplified. However, there is a significant gap between existing sensor network systems and the needs of medical care. In particular, medical sensor networks must support multicast routing topologies, node mobility, a wide range of data rates and high degrees of reliabilit...

  13. Wide area sensor network

    Science.gov (United States)

    Mukhopadhyay, Sanjoy; Nix, Tricia; Junker, Robert; Brentano, Josef; Khona, Dhiren

    2006-05-01

    The technical concept for this project has existed since the Chernobyl accident in 1986. A host of Eastern European nations have developed countrywide grid of sensors to monitor airborne radiation. The objective is to build a radiological sensor network for real-time monitoring of environmental radiation levels in order to provide data for warning, and consequentially the assessment of a nuclear event. A network of radiation measuring equipment consisting of gamma, neutron, alpha, and beta counters would be distributed over a large area (preferably on fire station roof tops) and connected by a wireless network to the emergency response center. The networks would be deployed in urban environments and would supply first responders and federal augmentation teams (including those from the U.S. Departments of Energy, Defense, Justice, and Homeland Security) with detailed, accurate information regarding the transport of radioactive environmental contaminants, so the agencies can provide a safe and effective response. A networked sensor capability would be developed, with fixed sensors deployed at key locations and in sufficient numbers, to provide adequate coverage for early warning, and input to post-event emergency response. An overall system description and specification will be provided, including detector characteristics, communication protocols, infrastructure and maintenance requirements, and operation procedures. The system/network can be designed for a specifically identified urban area, or for a general urban area scalable to cities of specified size. Data collected via the network will be transmitted directly to the appropriate emergency response center and shared with multiple agencies via the Internet or an Intranet. The data collected will be managed using commercial off - the - shelf Geographical Information System (GIS). The data will be stored in a database and the GIS software will aid in analysis and management of the data. Unique features of the

  14. Field experiment on a robust hierarchical metropolitan quantum cryptography network

    Institute of Scientific and Technical Information of China (English)

    XU FangXing; CHEN Wei; WANG Shuang; YIN ZhenQiang; ZHANG Yang; LIU Yun; ZHOU Zheng; ZHAO YiBo; LI HongWei; LIU Dong; HAN ZhengFu; GUO GuangCan

    2009-01-01

    these bureaus.The whole implementation including the hierarchical quantum cryptographic communication network links and the corresponding application software shows a big step toward the practical user-oriented network with a high security level.

  15. Connected Dominating Set Based Topology Control in Wireless Sensor Networks

    Science.gov (United States)

    He, Jing

    2012-01-01

    Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network.…

  16. Connected Dominating Set Based Topology Control in Wireless Sensor Networks

    Science.gov (United States)

    He, Jing

    2012-01-01

    Wireless Sensor Networks (WSNs) are now widely used for monitoring and controlling of systems where human intervention is not desirable or possible. Connected Dominating Sets (CDSs) based topology control in WSNs is one kind of hierarchical method to ensure sufficient coverage while reducing redundant connections in a relatively crowded network.…

  17. Automatic Construction of Hierarchical Road Networks

    Science.gov (United States)

    Yang, Weiping

    2016-06-01

    This paper describes an automated method of constructing a hierarchical road network given a single dataset, without the presence of thematic attributes. The method is based on a pattern graph which maintains nodes and paths as junctions and through-traffic roads. The hierarchy is formed incrementally in a top-down fashion for highways, ramps, and major roads directly connected to ramps; and bottom-up for the rest of major and minor roads. Through reasoning and analysis, ramps are identified as unique characteristics for recognizing and assembling high speed roads. The method makes distinctions on the types of ramps by articulating their connection patterns with highways. Major and minor roads will be identified by both quantitative and qualitative analysis of spatial properties and by discovering neighbourhood patterns revealed in the data. The result of the method would enrich data description and support comprehensive queries on sorted exit or entry points on highways and their related roads. The enrichment on road network data is important to a high successful rate of feature matching for road networks and to geospatial data integration.

  18. remote sensor network

    Science.gov (United States)

    von Unold, Georg; Junker, Astrid; Altmann, Thomas

    2016-04-01

    High-throughput (HT) plant phenotyping systems enable the quantitative analysis of a variety of plant features in a fully automated fashion. The comprehensive phenomics infrastructure at IPK comprises three LemnaTec conveyor belt-based (plant-to-sensor) systems for the simultaneous analysis of large numbers of individual plants of different sizes. For monitoring of environmental conditions within the plant growth area and soil conditions in individual pots, highly modular and flexible remote sensing devices are required. We present the architecture of a wireless sensor network implemented in the HT plant phenotyping systems at IPK in the frame of the German Plant Phenotyping Network (DPPN). This system comprises 350 soil monitoring modules, each measuring water content, water matrix potential, temperature and electric conductivity. Furthermore small and large sensor platforms enable the continuous monitoring of environmental parameters such as incident photosynthetic active radiation, total radiation balance, relative humidity and CO2 concentration and more. Finally we present an introduction into data management and maintenance."

  19. Energy Aware Clustering Algorithms for Wireless Sensor Networks

    Science.gov (United States)

    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.

  20. Ultrasensitive non-enzymatic glucose sensor based on three-dimensional network of ZnO-CuO hierarchical nanocomposites by electrospinning

    OpenAIRE

    2014-01-01

    Three-dimensional (3D) porous ZnO–CuO hierarchical nanocomposites (HNCs) nonenzymatic glucose electrodes with different thicknesses were fabricated by coelectrospinning and compared with 3D mixed ZnO/CuO nanowires (NWs) and pure CuO NWs electrodes. The structural characterization revealed that the ZnO–CuO HNCs were composed of the ZnO and CuO mixed NWs trunk (~200 nm), whose outer surface was attached with small CuO nanoparticles (NPs). Moreover, a good synergetic effect between CuO and ZnO w...

  1. Sensor networks for sustainable development

    CERN Document Server

    Ilyas, Mohammad; Alwakeel, Mohammed M; Aggoune, el-Hadi M

    2014-01-01

    ContentsPreface AcknowledgmentsEditorsContributorsAgricultureA Review of Applications of Sensor Networks in Smart AgricultureAhsan AbdullahWireless Sensor Networks with Dynamic Nodes for Water and Crop Health Managementel-Hadi M. Aggoune, Sami S. Alwakeel, Mohammed M. Alwakeel, and Mohammad Ammad-UddinEnvironmentScaling Smart EnvironmentsDiane J. CookLocalization of a Wireless Sensor Network for Environment Monitoring using Maximum Likelihood Estimation with Negative

  2. Underwater Sensor Nodes and Networks

    Directory of Open Access Journals (Sweden)

    Jaime Lloret

    2013-09-01

    Full Text Available Sensor technology has matured enough to be used in any type of environment. The appearance of new physical sensors has increased the range of environmental parameters for gathering data. Because of the huge amount of unexploited resources in the ocean environment, there is a need of new research in the field of sensors and sensor networks. This special issue is focused on collecting recent advances on underwater sensors and underwater sensor networks in order to measure, monitor, surveillance of and control of underwater environments. On the one hand, from the sensor node perspective, we will see works related with the deployment of physical sensors, development of sensor nodes and transceivers for sensor nodes, sensor measurement analysis and several issues such as layer 1 and 2 protocols for underwater communication and sensor localization and positioning systems. On the other hand, from the sensor network perspective, we will see several architectures and protocols for underwater environments and analysis concerning sensor network measurements. Both sides will provide us a complete view of last scientific advances in this research field.

  3. Ultrasensitive non-enzymatic glucose sensor based on three-dimensional network of ZnO-CuO hierarchical nanocomposites by electrospinning

    Science.gov (United States)

    Zhou, Chunyang; Xu, Lin; Song, Jian; Xing, Ruiqing; Xu, Sai; Liu, Dali; Song, Hongwei

    2014-12-01

    Three-dimensional (3D) porous ZnO-CuO hierarchical nanocomposites (HNCs) nonenzymatic glucose electrodes with different thicknesses were fabricated by coelectrospinning and compared with 3D mixed ZnO/CuO nanowires (NWs) and pure CuO NWs electrodes. The structural characterization revealed that the ZnO-CuO HNCs were composed of the ZnO and CuO mixed NWs trunk (~200 nm), whose outer surface was attached with small CuO nanoparticles (NPs). Moreover, a good synergetic effect between CuO and ZnO was confirmed. The nonenzymatic biosensing properties of as prepared 3D porous electrodes based on fluorine doped tin oxide (FTO) were studied and the results indicated that the sensing properties of 3D porous ZnO-CuO HNCs electrodes were significantly improved and depended strongly on the thickness of the HNCs. At an applied potential of + 0.7 V, the optimum ZnO-CuO HNCs electrode presented a high sensitivity of 3066.4 μAmM-1cm-2, the linear range up to 1.6 mM, and low practical detection limit of 0.21 μM. It also showed outstanding long term stability, good reproducibility, excellent selectivity and accurate measurement in real serum sample. The formation of special hierarchical heterojunction and the well-constructed 3D structure were the main reasons for the enhanced nonenzymatic biosensing behavior.

  4. A Wireless Sensor Network Multicast Model Based on Hierarchical Windmill Structure%一种风车形状层次结构的WSN组播模型

    Institute of Scientific and Technical Information of China (English)

    许建真; 李韩芬; 李方菊

    2012-01-01

    A region-oriented and energy-efficient WSN multicast model based on hierarchical windmill structure (HWSM) is put forward here. Firstly, it sets up hierarchical ring-type multicast model and elects one leader from each ring group. Then, all those leaders elected from each ring group compose the upper level ring. Leader adopts the traversal method to deliver data to all the other nodes of the ring group by means of flooding routing method. Simulation results prove that, this model can reduce the energy consumption and improve the data transmission efficiency as well as lengthening the survival time of WSN.%提出一种面向特定区域的高效节能的风车形状层次结构WSN组播模型(HWSM),该模型首先构建层次化风车环状结构,在每个环中选举出一个首节点,构成风车“轴心”,同时选举出来的各个首节点构成上一级风车环状结构.环内节点采用组播方式进行数据分发,由首节点通过辐射路由一次遍历其它所有节点,完成数据传输.仿真实验证明,该模型可降低环内节点的能量消耗,提高数据传输效率,延长网络生存时间.

  5. Hierarchical Network Models for Education Research: Hierarchical Latent Space Models

    Science.gov (United States)

    Sweet, Tracy M.; Thomas, Andrew C.; Junker, Brian W.

    2013-01-01

    Intervention studies in school systems are sometimes aimed not at changing curriculum or classroom technique, but rather at changing the way that teachers, teaching coaches, and administrators in schools work with one another--in short, changing the professional social networks of educators. Current methods of social network analysis are…

  6. Sensor Network Architectures for Monitoring Underwater Pipelines

    OpenAIRE

    Imad Jawhar; Jameela Al-Jaroodi; Nader Mohamed; Liren Zhang

    2011-01-01

    This paper develops and compares different sensor network architecture designs that can be used for monitoring underwater pipeline infrastructures. These architectures are underwater wired sensor networks, underwater acoustic wireless sensor networks, RF (Radio Frequency) wireless sensor networks, integrated wired/acoustic wireless sensor networks, and integrated wired/RF wireless sensor networks. The paper also discusses the reliability challenges and enhancement approaches for these network...

  7. Big Data Processing in Complex Hierarchical Network Systems

    CERN Document Server

    Polishchuk, Olexandr; Tyutyunnyk, Maria; Yadzhak, Mykhailo

    2016-01-01

    This article covers the problem of processing of Big Data that describe process of complex networks and network systems operation. It also introduces the notion of hierarchical network systems combination into associations and conglomerates alongside with complex networks combination into multiplexes. The analysis is provided for methods of global network structures study depending on the purpose of the research. Also the main types of information flows in complex hierarchical network systems being the basic components of associations and conglomerates are covered. Approaches are proposed for creation of efficient computing environments, distributed computations organization and information processing methods parallelization at different levels of system hierarchy.

  8. Object recognition with hierarchical discriminant saliency networks

    Directory of Open Access Journals (Sweden)

    Sunhyoung eHan

    2014-09-01

    Full Text Available The benefits of integrating attention and object recognition are investigated. While attention is frequently modeled as pre-processor for recognition, we investigate the hypothesis that attention is an intrinsic component of recognition and vice-versa. This hypothesis is tested with a recognitionmodel, the hierarchical discriminant saliency network (HDSN, whose layers are top-down saliency detectors, tuned for a visual class according to the principles of discriminant saliency. The HDSN has two possible implementations. In a biologically plausible implementation, all layers comply with the standard neurophysiological model of visual cortex, with sub-layers of simple and complex units that implement a combination of filtering, divisive normalization, pooling, and non-linearities. In a neuralnetwork implementation, all layers are convolutional and implement acombination of filtering, rectification, and pooling. The rectificationis performed with a parametric extension of the now popular rectified linearunits (ReLUs, whose parameters can be tuned for the detection of targetobject classes. This enables a number of functional enhancementsover neural network models that lack a connection to saliency, including optimal feature denoising mechanisms for recognition, modulation ofsaliency responses by the discriminant power of the underlying features,and the ability to detect both feature presence and absence.In either implementation, each layer has a precise statistical interpretation, and all parameters are tuned by statistical learning. Each saliency detection layer learns more discriminant saliency templates than its predecessors and higher layers have larger pooling fields. This enables the HDSN to simultaneously achieve high selectivity totarget object classes and invariance. The resulting performance demonstrates benefits for all the functional enhancements of the HDSN.

  9. Object recognition with hierarchical discriminant saliency networks.

    Science.gov (United States)

    Han, Sunhyoung; Vasconcelos, Nuno

    2014-01-01

    The benefits of integrating attention and object recognition are investigated. While attention is frequently modeled as a pre-processor for recognition, we investigate the hypothesis that attention is an intrinsic component of recognition and vice-versa. This hypothesis is tested with a recognition model, the hierarchical discriminant saliency network (HDSN), whose layers are top-down saliency detectors, tuned for a visual class according to the principles of discriminant saliency. As a model of neural computation, the HDSN has two possible implementations. In a biologically plausible implementation, all layers comply with the standard neurophysiological model of visual cortex, with sub-layers of simple and complex units that implement a combination of filtering, divisive normalization, pooling, and non-linearities. In a convolutional neural network implementation, all layers are convolutional and implement a combination of filtering, rectification, and pooling. The rectification is performed with a parametric extension of the now popular rectified linear units (ReLUs), whose parameters can be tuned for the detection of target object classes. This enables a number of functional enhancements over neural network models that lack a connection to saliency, including optimal feature denoising mechanisms for recognition, modulation of saliency responses by the discriminant power of the underlying features, and the ability to detect both feature presence and absence. In either implementation, each layer has a precise statistical interpretation, and all parameters are tuned by statistical learning. Each saliency detection layer learns more discriminant saliency templates than its predecessors and higher layers have larger pooling fields. This enables the HDSN to simultaneously achieve high selectivity to target object classes and invariance. The performance of the network in saliency and object recognition tasks is compared to those of models from the biological and

  10. Hierarchical security situational element acquisition mechanism in wireless sensor networks%无线传感器网络中层次化安全态势要素获取机制

    Institute of Scientific and Technical Information of China (English)

    李方伟; 汪岩; 朱江; 张海波

    2016-01-01

    In wireless sensor network ,the processing ability of the sensor nodes is poor .And the security situational element acquisition is also a serious problem .Thus ,a hierarchical framework of security situational elements acquisition mechanism was proposed .In this framework ,support vector machine hyper sphere multi classification algorithm was introduced as basic classi‐fier .The non‐negative matrix factorization algorithm was used as the method of attribute reduction .The fuzzy classification algo‐rithm was used to initialize non‐negative matrix factorization ,to avoid the local optimal caused by random initialization of non‐negative matrix factorization .In the sink node ,classification rules and attribute reduction rules were formed by learning .The classification analyses respectively focused on the cluster head and sink node ,which reduced the requirement of the sensor node properties .Attribute reduction was carried out before the data transmission ,reducing communication consumption of data trans‐mission and improving the performance of classifiers .Simulation results show ,the scheme has preferable accuracy on the situa‐tional elements acquisition ,and smaller communication overhead in the process of information transmission .%针对无线传感器网络中感知节点处理能力较差,获取网络安全态势要素困难的问题,提出一种层次化架构态势要素获取机制。在该架构中,采用支持向量机超球体多分类算法作为基分类器,非负矩阵分解算法作为属性约简的方法,采用模糊分类算法初始化该算法,解决随机初始化导致局部最优的缺陷。在汇聚节点完成对分类规则和属性约简规则的学习,分别在簇头和汇聚节点做分类分析,降低对感知节点性能要求。数据传输前进行属性约简,减小数据传输时的通信开销,提高分类器分类性能。仿真结果表明,该方案有较好的态势要素获取准确度和

  11. Road network safety evaluation using Bayesian hierarchical joint model.

    Science.gov (United States)

    Wang, Jie; Huang, Helai

    2016-05-01

    Safety and efficiency are commonly regarded as two significant performance indicators of transportation systems. In practice, road network planning has focused on road capacity and transport efficiency whereas the safety level of a road network has received little attention in the planning stage. This study develops a Bayesian hierarchical joint model for road network safety evaluation to help planners take traffic safety into account when planning a road network. The proposed model establishes relationships between road network risk and micro-level variables related to road entities and traffic volume, as well as socioeconomic, trip generation and network density variables at macro level which are generally used for long term transportation plans. In addition, network spatial correlation between intersections and their connected road segments is also considered in the model. A road network is elaborately selected in order to compare the proposed hierarchical joint model with a previous joint model and a negative binomial model. According to the results of the model comparison, the hierarchical joint model outperforms the joint model and negative binomial model in terms of the goodness-of-fit and predictive performance, which indicates the reasonableness of considering the hierarchical data structure in crash prediction and analysis. Moreover, both random effects at the TAZ level and the spatial correlation between intersections and their adjacent segments are found to be significant, supporting the employment of the hierarchical joint model as an alternative in road-network-level safety modeling as well.

  12. Road Network Selection Based on Road Hierarchical Structure Control

    Directory of Open Access Journals (Sweden)

    HE Haiwei

    2015-04-01

    Full Text Available A new road network selection method based on hierarchical structure is studied. Firstly, road network is built as strokes which are then classified into hierarchical collections according to the criteria of betweenness centrality value (BC value. Secondly, the hierarchical structure of the strokes is enhanced using structural characteristic identification technique. Thirdly, the importance calculation model was established according to the relationships among the hierarchical structure of the strokes. Finally, the importance values of strokes are got supported with the model's hierarchical calculation, and with which the road network is selected. Tests are done to verify the advantage of this method by comparing it with other common stroke-oriented methods using three kinds of typical road network data. Comparision of the results show that this method had few need to semantic data, and could eliminate the negative influence of edge strokes caused by the criteria of BC value well. So, it is better to maintain the global hierarchical structure of road network, and suitable to meet with the selection of various kinds of road network at the same time.

  13. Sensor Management for Tracking in Sensor Networks

    CERN Document Server

    Fuemmeler, Jason A; Veeravalli, Venugopal V

    2010-01-01

    We study the problem of tracking an object moving through a network of wireless sensors. In order to conserve energy, the sensors may be put into a sleep mode with a timer that determines their sleep duration. It is assumed that an asleep sensor cannot be communicated with or woken up, and hence the sleep duration needs to be determined at the time the sensor goes to sleep based on all the information available to the sensor. Having sleeping sensors in the network could result in degraded tracking performance, therefore, there is a tradeoff between energy usage and tracking performance. We design sleeping policies that attempt to optimize this tradeoff and characterize their performance. As an extension to our previous work in this area [1], we consider generalized models for object movement, object sensing, and tracking cost. For discrete state spaces and continuous Gaussian observations, we derive a lower bound on the optimal energy-tracking tradeoff. It is shown that in the low tracking error regime, the g...

  14. Hierarchical graphene-polyaniline nanocomposite films for high-performance flexible electronic gas sensors

    Science.gov (United States)

    Guo, Yunlong; Wang, Ting; Chen, Fanhong; Sun, Xiaoming; Li, Xiaofeng; Yu, Zhongzhen; Wan, Pengbo; Chen, Xiaodong

    2016-06-01

    A hierarchically nanostructured graphene-polyaniline composite film is developed and assembled for a flexible, transparent electronic gas sensor to be integrated into wearable and foldable electronic devices. The hierarchical nanocomposite film is obtained via aniline polymerization in reduced graphene oxide (rGO) solution and simultaneous deposition on flexible PET substrate. The PANI nanoparticles (PPANI) anchored onto rGO surfaces (PPANI/rGO) and the PANI nanofiber (FPANI) are successfully interconnected and deposited onto flexible PET substrates to form hierarchical nanocomposite (PPANI/rGO-FPANI) network films. The assembled flexible, transparent electronic gas sensor exhibits high sensing performance towards NH3 gas concentrations ranging from 100 ppb to 100 ppm, reliable transparency (90.3% at 550 nm) for the PPANI/rGO-FPANI film (6 h sample), fast response/recovery time (36 s/18 s), and robust flexibility without an obvious performance decrease after 1000 bending/extending cycles. The excellent sensing performance could probably be ascribed to the synergetic effects and the relatively high surface area (47.896 m2 g-1) of the PPANI/rGO-FPANI network films, the efficient artificial neural network sensing channels, and the effectively exposed active surfaces. It is expected to hold great promise for developing flexible, cost-effective, and highly sensitive electronic sensors with real-time analysis to be potentially integrated into wearable flexible electronics.A hierarchically nanostructured graphene-polyaniline composite film is developed and assembled for a flexible, transparent electronic gas sensor to be integrated into wearable and foldable electronic devices. The hierarchical nanocomposite film is obtained via aniline polymerization in reduced graphene oxide (rGO) solution and simultaneous deposition on flexible PET substrate. The PANI nanoparticles (PPANI) anchored onto rGO surfaces (PPANI/rGO) and the PANI nanofiber (FPANI) are successfully

  15. An ontology for sensor networks

    Science.gov (United States)

    Compton, Michael; Neuhaus, Holger; Bermudez, Luis; Cox, Simon

    2010-05-01

    Sensors and networks of sensors are important ways of monitoring and digitizing reality. As the number and size of sensor networks grows, so too does the amount of data collected. Users of such networks typically need to discover the sensors and data that fit their needs without necessarily understanding the complexities of the network itself. The burden on users is eased if the network and its data are expressed in terms of concepts familiar to the users and their job functions, rather than in terms of the network or how it was designed. Furthermore, the task of collecting and combining data from multiple sensor networks is made easier if metadata about the data and the networks is stored in a format and conceptual models that is amenable to machine reasoning and inference. While the OGC's (Open Geospatial Consortium) SWE (Sensor Web Enablement) standards provide for the description and access to data and metadata for sensors, they do not provide facilities for abstraction, categorization, and reasoning consistent with standard technologies. Once sensors and networks are described using rich semantics (that is, by using logic to describe the sensors, the domain of interest, and the measurements) then reasoning and classification can be used to analyse and categorise data, relate measurements with similar information content, and manage, query and task sensors. This will enable types of automated processing and logical assurance built on OGC standards. The W3C SSN-XG (Semantic Sensor Networks Incubator Group) is producing a generic ontology to describe sensors, their environment and the measurements they make. The ontology provides definitions for the structure of sensors and observations, leaving the details of the observed domain unspecified. This allows abstract representations of real world entities, which are not observed directly but through their observable qualities. Domain semantics, units of measurement, time and time series, and location and mobility

  16. Neural Mechanisms of Hierarchical Planning in a Virtual Subway Network.

    Science.gov (United States)

    Balaguer, Jan; Spiers, Hugo; Hassabis, Demis; Summerfield, Christopher

    2016-05-18

    Planning allows actions to be structured in pursuit of a future goal. However, in natural environments, planning over multiple possible future states incurs prohibitive computational costs. To represent plans efficiently, states can be clustered hierarchically into "contexts". For example, representing a journey through a subway network as a succession of individual states (stations) is more costly than encoding a sequence of contexts (lines) and context switches (line changes). Here, using functional brain imaging, we asked humans to perform a planning task in a virtual subway network. Behavioral analyses revealed that humans executed a hierarchically organized plan. Brain activity in the dorsomedial prefrontal cortex and premotor cortex scaled with the cost of hierarchical plan representation and unique neural signals in these regions signaled contexts and context switches. These results suggest that humans represent hierarchical plans using a network of caudal prefrontal structures. VIDEO ABSTRACT.

  17. Unified broadcast in sensor networks

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg; Jurdak, Raja; Kusy, Branislav

    2011-01-01

    Complex sensor network applications include multiple services such as collection, dissemination, time synchronization, and failure detection protocols. Many of these protocols require local state maintenance through periodic broadcasts which leads to high control overhead. Recent attempts...

  18. Topological Fidelity in Sensor Networks

    OpenAIRE

    Chintakunta, Harish; Krim, Hamid

    2011-01-01

    Sensor Networks are inherently complex networks, and many of their associated problems require analysis of some of their global characteristics. These are primarily affected by the topology of the network. We present in this paper, a general framework for a topological analysis of a network, and develop distributed algorithms in a generalized combinatorial setting in order to solve two seemingly unrelated problems, 1) Coverage hole detection and Localization and 2) Worm hole attack detection ...

  19. Topological Fidelity in Sensor Networks

    OpenAIRE

    Chintakunta, Harish; Krim, Hamid

    2011-01-01

    Sensor Networks are inherently complex networks, and many of their associated problems require analysis of some of their global characteristics. These are primarily affected by the topology of the network. We present in this paper, a general framework for a topological analysis of a network, and develop distributed algorithms in a generalized combinatorial setting in order to solve two seemingly unrelated problems, 1) Coverage hole detection and Localization and 2) Worm hole attack detection ...

  20. Security in wireless sensor networks

    CERN Document Server

    Oreku, George S

    2016-01-01

    This monograph covers different aspects of sensor network security including new emerging technologies. The authors present a mathematical approach to the topic and give numerous practical examples as well as case studies to illustrate the theory. The target audience primarily comprises experts and practitioners in the field of sensor network security, but the book may also be beneficial for researchers in academia as well as for graduate students.

  1. Sensor Fusion-based Event Detection in Wireless Sensor Networks

    NARCIS (Netherlands)

    Bahrepour, M.; Meratnia, N.; Havinga, P.J.M.

    2009-01-01

    Recently, Wireless Sensor Networks (WSN) community has witnessed an application focus shift. Although, monitoring was the initial application of wireless sensor networks, in-network data processing and (near) real-time actuation capability have made wireless sensor networks suitable candidate for ev

  2. Field Experiment on a Robust Hierarchical Metropolitan Quantum Cryptography Network

    CERN Document Server

    Xu, Fangxing; Wang, Shuang; Yin, Zhenqiang; Zhang, Yang; Liu, Yun; Zhou, Zheng; Zhao, Yibo; Li, Hongwei; Liu, Dong; Han, Zhengfu; Guo, Guangcan

    2009-01-01

    A hierarchical metropolitan quantum cryptography network upon the inner-city commercial telecom fiber cables is reported in this paper. The seven-user network contains a four-node backbone net with one node acting as the subnet gateway, a two-user subnet and a single-fiber access link, which is realized by the Faraday-Michelson Interferometer set-ups. The techniques of the quantum router, optical switch and trusted relay are assembled here to guarantee the feasibility and expandability of the quantum cryptography network. Five nodes of the network are located in the government departments and the secure keys generated by the quantum key distribution network are utilized to encrypt the instant video, sound, text messages and confidential files transmitting between these bureaus. The whole implementation including the hierarchical quantum cryptographic communication network links and corresponding application software shows a big step toward the practical user-oriented network with high security level.

  3. Wireless Sensor Networks for Healthcare Applications

    CERN Document Server

    Dishongh, Terrance J; Kuris, Ben

    2009-01-01

    This unique reference focuses on methods of application, validation and testing based on real deployments of sensor networks in the clinical and home environments. Key topics include healthcare and wireless sensors, sensor network applications, designs of experiments using sensors, data collection and decision making, clinical deployment of wireless sensor networks, contextual awareness medication prompting field trials in homes, social health monitoring, and the future of wireless sensor networks in healthcare.

  4. Medical Sensor Network Infrastructures

    DEFF Research Database (Denmark)

    Andersen, Jacob

    is required, such as taking a blood sample, mailing it to a lab, where it is analysed and the result returned by mail. Due to the continuing size and cost reduction of electronic equipment, future medical sensors will be much smaller, cheaper and often disposable. Furthermore, integration of these sensors...... with the electronic health record (EHR) IT-systems will save a lot of work (and human errors), as the sensor readings will be directly recorded in the patient’s records by the sensors themselves, rather than by a transcription performed by a busy clinician. Although this development has been going on for at least...... a decade, most sensors are still quite big, heavy and difficult to operate, and a lot of research is revolving around minimising the instruments and making them easier to use. Several research experiments have demonstrated the utility of such sensors, but few of these experiments consider security...

  5. Wireless sensor networks architectures and protocols

    CERN Document Server

    Callaway, Jr, Edgar H

    2003-01-01

    Introduction to Wireless Sensor NetworksApplications and MotivationNetwork Performance ObjectivesContributions of this BookOrganization of this BookThe Development of Wireless Sensor NetworksEarly Wireless NetworksWireless Data NetworksWireless Sensor and Related NetworksConclusionThe Physical LayerSome Physical Layer ExamplesA Practical Physical Layer for Wireless Sensor NetworksSimulations and ResultsConclusionThe Data Link LayerMedium Access Control TechniquesThe Mediation DeviceSystem Analysis and SimulationConclusionThe Network LayerSome Network Design ExamplesA Wireless Sensor Network De

  6. Complex Evaluation of Hierarchically-Network Systems

    CERN Document Server

    Polishchuk, Dmytro; Yadzhak, Mykhailo

    2016-01-01

    Methods of complex evaluation based on local, forecasting, aggregated, and interactive evaluation of the state, function quality, and interaction of complex system's objects on the all hierarchical levels is proposed. Examples of analysis of the structural elements of railway transport system are used for illustration of efficiency of proposed approach.

  7. Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Roy Sohini

    2015-09-01

    Full Text Available Wireless Sensor Network (WSN has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC.

  8. Sleep Deprivation Attack Detection in Wireless Sensor Network

    CERN Document Server

    Bhattasali, Tapalina; Sanyal, Sugata; 10.5120/5056-7374 10.5120/5056-7374 10.5120/5056-7374 10.5120/5056-7374

    2012-01-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 ...

  9. Introduction to wireless sensor networks

    CERN Document Server

    Forster, Anna

    2016-01-01

    Explores real-world wireless sensor network development, deployment, and applications. The book begins with an introduction to wireless sensor networks and their fundamental concepts. Hardware components, operating systems, protocols, and algorithms that make up the anatomy of a sensor node are described in chapter two. Properties of wireless communications, medium access protocols, wireless links, and link estimation protocols are described in chapter three and chapter four. Routing basics and metrics, clustering techniques, time synchronization and localization protocols, as well as sensing techniques are introduced in chapter five to nine. The concluding chapter summarizes the learnt methods and shows how to use them to deploy real-world sensor networks in a structured way.

  10. Wireless Sensor Network Based Smart Parking System

    National Research Council Canada - National Science Library

    Jeffrey Joseph; Roshan Gajanan Patil; Skanda Kumar Kaipu Narahari; Yogish Didagi; Jyotsna Bapat; Debabrata Das

    2014-01-01

    ... system. Wireless Sensor Networks are one such class of networks, which meet these criteria. These networks consist of spatially distributed sensor motes which work in a co-operative manner to sense and control the environment...

  11. Modelling hierarchical and modular complex networks: division and independence

    Science.gov (United States)

    Kim, D.-H.; Rodgers, G. J.; Kahng, B.; Kim, D.

    2005-06-01

    We introduce a growing network model which generates both modular and hierarchical structure in a self-organized way. To this end, we modify the Barabási-Albert model into the one evolving under the principles of division and independence as well as growth and preferential attachment (PA). A newly added vertex chooses one of the modules composed of existing vertices, and attaches edges to vertices belonging to that module following the PA rule. When the module size reaches a proper size, the module is divided into two, and a new module is created. The karate club network studied by Zachary is a simple version of the current model. We find that the model can reproduce both modular and hierarchical properties, characterized by the hierarchical clustering function of a vertex with degree k, C(k), being in good agreement with empirical measurements for real-world networks.

  12. Hierarchical Overlapping Clustering of Network Data Using Cut Metrics

    CERN Document Server

    Gama, Fernando; Ribeiro, Alejandro

    2016-01-01

    A novel method to obtain hierarchical and overlapping clusters from network data -i.e., a set of nodes endowed with pairwise dissimilarities- is presented. The introduced method is hierarchical in the sense that it outputs a nested collection of groupings of the node set depending on the resolution or degree of similarity desired, and it is overlapping since it allows nodes to belong to more than one group. Our construction is rooted on the facts that a hierarchical (non-overlapping) clustering of a network can be equivalently represented by a finite ultrametric space and that a convex combination of ultrametrics results in a cut metric. By applying a hierarchical (non-overlapping) clustering method to multiple dithered versions of a given network and then convexly combining the resulting ultrametrics, we obtain a cut metric associated to the network of interest. We then show how to extract a hierarchical overlapping clustering structure from the aforementioned cut metric. Furthermore, the so-called overlappi...

  13. An energy-driven unequal clustering protocol for heterogeneous wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    Due to the limitation of energy resources, energy efficiency is a key issue in wireless sensor networks (WSNs). Clustering is proved to be an important way to realize hierarchical topology control, which can improve the scalability and prolong the lifetime of wireless sensor networks. In this paper, an energy-driven unequal clustering protocol (EDUC) for heterogeneous wireless sensor networks is proposed. EDUC includes an unequal clustering algorithm and an energy-driven adaptive cluster head rotation metho...

  14. Reliability Analysis of Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    JIN Yan; YANG Xiao-zong; WANG Ling

    2005-01-01

    To Integrate the capacity of sensing, communication, computing, and actuating, one of the compelling technological advances of these years has been the appearance of distributed wireless sensor network (DSN) for information gathering tasks. In order to save the energy, multi-hop routing between the sensor nodes and the sink node is necessary because of limited resource. In addition, the unpredictable conditional factors make the sensor nodes unreliable. In this paper, the reliability of routing designed for sensor network and some dependability issues of DSN, such as MTTF(mean time to failure) and the probability of connectivity between the sensor nodes and the sink node are analyzed.Unfortunately, we could not obtain the accurate result for the arbitrary network topology, which is # P-hard problem.And the reliability analysis of restricted topologies clustering-based is given. The method proposed in this paper will show us a constructive idea about how to place energyconstrained sensor nodes in the network efficiently from the prospective of reliability.

  15. Detect overlapping and hierarchical community structure in networks

    CERN Document Server

    Shen, Huawei; Cai, Kai; Hu, Mao-Bin

    2008-01-01

    Clustering and community structure is crucial for many network systems and the related dynamic processes. It has been shown that communities are usually overlapping and hierarchical. However, previous methods investigate these two properties of community structure separately. This paper propose an algorithm (EAGLE) to detect both the overlapping and hierarchical properties of complex community structure together. This algorithm deals with the set of maximal cliques and adopts an agglomerative framework. The quality function of modularity is extended to evaluate the goodness of a cover. The examples of application to real world networks give excellent results.

  16. Hierarchical Routing over Dynamic Wireless Networks

    CERN Document Server

    Tschopp, Dominique; Grossglauser, Matthias

    2009-01-01

    Wireless network topologies change over time and maintaining routes requires frequent updates. Updates are costly in terms of consuming throughput available for data transmission, which is precious in wireless networks. In this paper, we ask whether there exist low-overhead schemes that produce low-stretch routes. This is studied by using the underlying geometric properties of the connectivity graph in wireless networks.

  17. Architecture Aware Key Management Scheme for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mohammed FEHAM

    2012-11-01

    Full Text Available The emergence of wireless networking as well as the development in embedded systems and technologies have given birth to application specific networks called wireless sensor networks WSNs, their flexibility, facility of use and deployment as well as their low cost give them an increasing field of applications. Usually sensors are limited in capacities deployed in a hostile and unpredictable environment, making the security of these networks a challenging task. In this paper we are going to present a key management scheme in which the base station play the role of the secure third party responsible of distributing key and managing security in the network, two versions of this scheme are presented the first one for flat networks and the second one for hierarchical networks in which the cluster head play the key role in all key agreement with the base station.

  18. Tiresias: Online Anomaly Detection for Hierarchical Operational Network Data

    CERN Document Server

    Hong, Chi-Yao; Duffield, Nick; Wang, Jia

    2012-01-01

    Operational network data, management data such as customer care call logs and equipment system logs, is a very important source of information for network operators to detect problems in their networks. Unfortunately, there is lack of efficient tools to automatically track and detect anomalous events on operational data, causing ISP operators to rely on manual inspection of this data. While anomaly detection has been widely studied in the context of network data, operational data presents several new challenges, including the volatility and sparseness of data, and the need to perform fast detection (complicating application of schemes that require offline processing or large/stable data sets to converge). To address these challenges, we propose Tiresias, an automated approach to locating anomalous events on hierarchical operational data. Tiresias leverages the hierarchical structure of operational data to identify high-impact aggregates (e.g., locations in the network, failure modes) likely to be associated w...

  19. Energy efficient sensor network implementations

    Energy Technology Data Exchange (ETDEWEB)

    Frigo, Janette R [Los Alamos National Laboratory; Raby, Eric Y [Los Alamos National Laboratory; Brennan, Sean M [Los Alamos National Laboratory; Kulathumani, Vinod [WEST VIRGINIA UNIV.; Rosten, Ed [CAMBRIDGE UNIV.; Wolinski, Christophe [IRISA; Wagner, Charles [IRISA; Charot, Francois [IRISA

    2009-01-01

    In this paper, we discuss a low power embedded sensor node architecture we are developing for distributed sensor network systems deployed in a natural environment. In particular, we examine the sensor node for energy efficient processing-at-the-sensor. We analyze the following modes of operation; event detection, sleep(wake-up), data acquisition, data processing modes using low power, high performance embedded technology such as specialized embedded DSP processors and a low power FPGAs at the sensing node. We use compute intensive sensor node applications: an acoustic vehicle classifier (frequency domain analysis) and a video license plate identification application (learning algorithm) as a case study. We report performance and total energy usage for our system implementations and discuss the system architecture design trade offs.

  20. Medical Sensor Network Infrastructures

    DEFF Research Database (Denmark)

    Andersen, Jacob

    is required, such as taking a blood sample, mailing it to a lab, where it is analysed and the result returned by mail. Due to the continuing size and cost reduction of electronic equipment, future medical sensors will be much smaller, cheaper and often disposable. Furthermore, integration of these sensors...... a short while. This tension between simple use and security in a low-power clinical environment is the main theme of this dissertation. Un-secure medical equipment will never pass official certification by national health authorities, but on the other hand, experience shows that if using the equipment...

  1. Hierarchicality of trade flow networks reveals complexity of products.

    Science.gov (United States)

    Shi, Peiteng; Zhang, Jiang; Yang, Bo; Luo, Jingfei

    2014-01-01

    With globalization, countries are more connected than before by trading flows, which amounts to at least 36 trillion dollars today. Interestingly, around 30-60 percents of exports consist of intermediate products in global. Therefore, the trade flow network of particular product with high added values can be regarded as value chains. The problem is weather we can discriminate between these products from their unique flow network structure? This paper applies the flow analysis method developed in ecology to 638 trading flow networks of different products. We claim that the allometric scaling exponent η can be used to characterize the degree of hierarchicality of a flow network, i.e., whether the trading products flow on long hierarchical chains. Then, it is pointed out that the flow networks of products with higher added values and complexity like machinary, transport equipment etc. have larger exponents, meaning that their trade flow networks are more hierarchical. As a result, without the extra data like global input-output table, we can identify the product categories with higher complexity, and the relative importance of a country in the global value chain by the trading network solely.

  2. Hierarchicality of trade flow networks reveals complexity of products.

    Directory of Open Access Journals (Sweden)

    Peiteng Shi

    Full Text Available With globalization, countries are more connected than before by trading flows, which amounts to at least 36 trillion dollars today. Interestingly, around 30-60 percents of exports consist of intermediate products in global. Therefore, the trade flow network of particular product with high added values can be regarded as value chains. The problem is weather we can discriminate between these products from their unique flow network structure? This paper applies the flow analysis method developed in ecology to 638 trading flow networks of different products. We claim that the allometric scaling exponent η can be used to characterize the degree of hierarchicality of a flow network, i.e., whether the trading products flow on long hierarchical chains. Then, it is pointed out that the flow networks of products with higher added values and complexity like machinary, transport equipment etc. have larger exponents, meaning that their trade flow networks are more hierarchical. As a result, without the extra data like global input-output table, we can identify the product categories with higher complexity, and the relative importance of a country in the global value chain by the trading network solely.

  3. Hierarchical document categorization using associative networks

    NARCIS (Netherlands)

    Bloom, Niels; Theune, Mariet; de Jong, Franciska M.G.; Klement, E.P.; Borutzky, W.; Fahringer, T.; Hamza, M.H.; Uskov, V.

    Associative networks are a connectionist language model with the ability to handle dynamic data. We used two associative networks to categorize random sets of related Wikipedia articles with only their raw text as input. We then compared the resulting categorization to a gold standard: the manual

  4. Changes of hierarchical network in local and world stock market

    Science.gov (United States)

    Patwary, Enayet Ullah; Lee, Jong Youl; Nobi, Ashadun; Kim, Doo Hwan; Lee, Jae Woo

    2017-10-01

    We consider the cross-correlation coefficients of the daily returns in the local and global stock markets. We generate the minimal spanning tree (MST) using the correlation matrix. We observe that the MSTs change their structure from chain-like networks to star-like networks during periods of market uncertainty. We quantify the measure of the hierarchical network utilizing the value of the hierarchy measured by the hierarchical path. The hierarchy and betweenness centrality characterize the state of the market regarding the impact of crises. During crises, the non-financial company is established as the central node of the MST. However, before the crisis and during stable periods, the financial company is occupying the central node of the MST in the Korean and the U.S. stock markets. The changes in the network structure and the central node are good indicators of an upcoming crisis.

  5. Information Sharing During Crisis Management in Hierarchical vs. Network Teams

    NARCIS (Netherlands)

    Schraagen, J.M.C.; Veld, M.H.I.T.; Koning, L. de

    2010-01-01

    This study examines the differences between hierarchical and network teams in emergency management. A controlled experimental environment was created in which we could study teams that differed in decision rights, availability of information, information sharing, and task division. Thirty-two teams

  6. New Heterogeneous Clustering Protocol for Prolonging Wireless Sensor Networks Lifetime

    Directory of Open Access Journals (Sweden)

    Md. Golam Rashed

    2014-06-01

    Full Text Available Clustering in wireless sensor networks is one of the crucial methods for increasing of network lifetime. The network characteristics of existing classical clustering protocols for wireless sensor network are homogeneous. Clustering protocols fail to maintain the stability of the system, especially when nodes are heterogeneous. We have seen that the behavior of Heterogeneous-Hierarchical Energy Aware Routing Protocol (H-HEARP becomes very unstable once the first node dies, especially in the presence of node heterogeneity. In this paper we assume a new clustering protocol whose network characteristics is heterogeneous for prolonging of network lifetime. The computer simulation results demonstrate that the proposed clustering algorithm outperforms than other clustering algorithms in terms of the time interval before the death of the first node (we refer to as stability period. The simulation results also show the high performance of the proposed clustering algorithm for higher values of extra energy brought by more powerful nodes.

  7. Self-organized Criticality in Hierarchical Brain Network

    Institute of Scientific and Technical Information of China (English)

    YANG Qiu-Ying; ZHANG Ying-Yue; CHEN Tian-Lun

    2008-01-01

    It is shown that the cortical brain network of the macaque displays a hierarchically clustered organization and the neuron network shows small-world properties. Now the two factors will be considered in our model and the dynamical behavior of the model will be studied. We study the characters of the model and find that the distribution of avalanche size of the model follows power-law behavior.

  8. Hierarchical Ring Network Design Using Branch-and-Price

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2005-01-01

    We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed l...... for jointly solving the clustering problem, the metro ring design problem and the routing problem. Computational results are given for networks with up to 36 nodes.......We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed...... link establishment costs and the link capacity costs into account. Hierarchical ring network design problems combines the following optimization problems: Clustering, hub selection, metro ring design, federal ring design and routing problems. In this paper a branch-and-price algorithm is presented...

  9. Topological Fidelity in Sensor Networks

    CERN Document Server

    Chintakunta, Harish

    2011-01-01

    Sensor Networks are inherently complex networks, and many of their associated problems require analysis of some of their global characteristics. These are primarily affected by the topology of the network. We present in this paper, a general framework for a topological analysis of a network, and develop distributed algorithms in a generalized combinatorial setting in order to solve two seemingly unrelated problems, 1) Coverage hole detection and Localization and 2) Worm hole attack detection and Localization. We also note these solutions remain coordinate free as no priori localization information of the nodes is assumed. For the coverage hole problem, we follow a "divide and conquer approach", by strategically dissecting the network so that the overall topology is preserved, while efficiently pursuing the detection and localization of failures. The detection of holes, is enabled by first attributing a combinatorial object called a "Rips Complex" to each network segment, and by subsequently checking the exist...

  10. Learning Contextual Dependence With Convolutional Hierarchical Recurrent Neural Networks

    Science.gov (United States)

    Zuo, Zhen; Shuai, Bing; Wang, Gang; Liu, Xiao; Wang, Xingxing; Wang, Bing; Chen, Yushi

    2016-07-01

    Existing deep convolutional neural networks (CNNs) have shown their great success on image classification. CNNs mainly consist of convolutional and pooling layers, both of which are performed on local image areas without considering the dependencies among different image regions. However, such dependencies are very important for generating explicit image representation. In contrast, recurrent neural networks (RNNs) are well known for their ability of encoding contextual information among sequential data, and they only require a limited number of network parameters. General RNNs can hardly be directly applied on non-sequential data. Thus, we proposed the hierarchical RNNs (HRNNs). In HRNNs, each RNN layer focuses on modeling spatial dependencies among image regions from the same scale but different locations. While the cross RNN scale connections target on modeling scale dependencies among regions from the same location but different scales. Specifically, we propose two recurrent neural network models: 1) hierarchical simple recurrent network (HSRN), which is fast and has low computational cost; and 2) hierarchical long-short term memory recurrent network (HLSTM), which performs better than HSRN with the price of more computational cost. In this manuscript, we integrate CNNs with HRNNs, and develop end-to-end convolutional hierarchical recurrent neural networks (C-HRNNs). C-HRNNs not only make use of the representation power of CNNs, but also efficiently encodes spatial and scale dependencies among different image regions. On four of the most challenging object/scene image classification benchmarks, our C-HRNNs achieve state-of-the-art results on Places 205, SUN 397, MIT indoor, and competitive results on ILSVRC 2012.

  11. Smart Body Sensor Object Networking

    Institute of Scientific and Technical Information of China (English)

    Bhumip Khasnabish

    2014-01-01

    This paper discusses smart body sensor objects (BSOs), including their networking and internetworking. Smartness can be incorpo-rated into BSOs by embedding virtualization, predictive analytics, and proactive computing and communications capabilities. A few use cases including the relevant privacy and protocol requirements are also presented. General usage and deployment eti-quette along with the relevant regulatory implications are then discussed.

  12. Brain rhythms reveal a hierarchical network organization.

    Directory of Open Access Journals (Sweden)

    G Karl Steinke

    2011-10-01

    Full Text Available Recordings of ongoing neural activity with EEG and MEG exhibit oscillations of specific frequencies over a non-oscillatory background. The oscillations appear in the power spectrum as a collection of frequency bands that are evenly spaced on a logarithmic scale, thereby preventing mutual entrainment and cross-talk. Over the last few years, experimental, computational and theoretical studies have made substantial progress on our understanding of the biophysical mechanisms underlying the generation of network oscillations and their interactions, with emphasis on the role of neuronal synchronization. In this paper we ask a very different question. Rather than investigating how brain rhythms emerge, or whether they are necessary for neural function, we focus on what they tell us about functional brain connectivity. We hypothesized that if we were able to construct abstract networks, or "virtual brains", whose dynamics were similar to EEG/MEG recordings, those networks would share structural features among themselves, and also with real brains. Applying mathematical techniques for inverse problems, we have reverse-engineered network architectures that generate characteristic dynamics of actual brains, including spindles and sharp waves, which appear in the power spectrum as frequency bands superimposed on a non-oscillatory background dominated by low frequencies. We show that all reconstructed networks display similar topological features (e.g. structural motifs and dynamics. We have also reverse-engineered putative diseased brains (epileptic and schizophrenic, in which the oscillatory activity is altered in different ways, as reported in clinical studies. These reconstructed networks show consistent alterations of functional connectivity and dynamics. In particular, we show that the complexity of the network, quantified as proposed by Tononi, Sporns and Edelman, is a good indicator of brain fitness, since virtual brains modeling diseased states

  13. Design of Hierarchical Ring Networks Using Branch-and-Price

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2004-01-01

    We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed...... link establishment costs and the link capacity costs into account. The hierarchical two layer ring network design problem is solved in two stages: First the bottom layer, i.e. the metro-rings are designed, implicitly taking into account the capacity cost of the federal-ring. Then the federal......-ring is designed connecting the metro-rings, minimizing fixed link establishment costs of the federal-ring. A branch-and-price algorithm is presented for the design of the bottom layer and it is suggested that existing methods are used for the design of the federal-ring. Computational results are given...

  14. Strongly Resilient Non-Interactive Key Predistribution For Hierarchical Networks

    CERN Document Server

    Chen, Hao

    2010-01-01

    Key establishment is the basic necessary tool in the network security, by which pairs in the network can establish shared keys for protecting their pairwise communications. There have been some key agreement or predistribution schemes with the property that the key can be established without the interaction (\\cite{Blom84,BSHKY92,S97}). Recently the hierarchical cryptography and the key management for hierarchical networks have been active topics(see \\cite{BBG05,GHKRRW08,GS02,HNZI02,HL02,Matt04}. ). Key agreement schemes for hierarchical networks were presented in \\cite{Matt04,GHKRRW08} which is based on the Blom key predistribution scheme(Blom KPS, [1]) and pairing. In this paper we introduce generalized Blom-Blundo et al key predistribution schemes. These generalized Blom-Blundo et al key predistribution schemes have the same security functionality as the Blom-Blundo et al KPS. However different and random these KPSs can be used for various parts of the networks for enhancing the resilience. We also presentk...

  15. An Integrated Intrusion Detection Model of Cluster-Based Wireless Sensor Network

    OpenAIRE

    Xuemei Sun; Bo Yan; Xinzhong Zhang; Chuitian Rong

    2015-01-01

    Considering wireless sensor network characteristics, this paper combines anomaly and mis-use detection and proposes an integrated detection model of cluster-based wireless sensor network, aiming at enhancing detection rate and reducing false rate. Adaboost algorithm with hierarchical structures is used for anomaly detection of sensor nodes, cluster-head nodes and Sink nodes. Cultural-Algorithm and Artificial-Fish-Swarm-Algorithm optimized Back Propagation is applied to mis-use detection of Si...

  16. Mobile Zigbee Sensor Networks

    OpenAIRE

    Anantdeep, Er.; Kaur, Er. Sandeep; Kaur, Er. Balpreet

    2010-01-01

    OPNET Modeler accelerates network R&D and improves product quality through high-fidelity modeling and scalable simulation. It provides a virtual environment for designing protocols and devices, and for testing and demonstrating designs in realistic scenarios prior to production. OPNET Modeler supports 802.15.4 standard and has been used to make a model of PAN. Iterations have been performed by changing the Power of the transmitter and the throughput will has been analyzed to arrive at optimal...

  17. Extending stability through hierarchical clusters in Echo State Networks

    Directory of Open Access Journals (Sweden)

    Sarah Jarvis

    2010-07-01

    Full Text Available Echo State Networks (ESN are reservoir networks that satisfy well-established criteria for stability when constructed as feedforward networks. Recent evidence suggests that stability criteria are altered in the presence of reservoir substructures, such as clusters. Understanding how the reservoir architecture affects stability is thus important for the appropriate design of any ESN. To quantitatively determine the influence of the most relevant network parameters, we analysed the impact of reservoir substructures on stability in hierarchically clustered ESNs (HESN, as they allow a smooth transition from highly structured to increasingly homogeneous reservoirs. Previous studies used the largest eigenvalue of the reservoir connectivity matrix (spectral radius as a predictor for stable network dynamics. Here, we evaluate the impact of clusters, hierarchy and intercluster connectivity on the predictive power of the spectral radius for stability. Both hierarchy and low relative cluster sizes extend the range of spectral radius values, leading to stable networks, while increasing intercluster connectivity decreased maximal spectral radius.

  18. Communication Buses and Protocols for Sensor Networks

    Directory of Open Access Journals (Sweden)

    Andrew Mason

    2002-07-01

    Full Text Available This paper overviews existing digital communication buses which are commonly used in sensor networks, discusses sensor network architectures, and introduces a new sensor bus for low power microsystem applications. The new intra-module multi-element microsystem (IM2 bus is nine-line interface with 8b serial data which implements several advanced features such as power management and plug-n-play while maintaining minimum hardware overhead at the sensor node. Finally, some issues in wireless sensor networking are discussed. The coverage of these issues provides a guideline for choosing the appropriate bus for different sensor network applications.

  19. Environmental Monitoring Using Sensor Networks

    Science.gov (United States)

    Yang, J.; Zhang, C.; Li, X.; Huang, Y.; Fu, S.; Acevedo, M. F.

    2008-12-01

    Environmental observatories, consisting of a variety of sensor systems, computational resources and informatics, are important for us to observe, model, predict, and ultimately help preserve the health of the nature. The commoditization and proliferation of coin-to-palm sized wireless sensors will allow environmental monitoring with unprecedented fine spatial and temporal resolution. Once scattered around, these sensors can identify themselves, locate their positions, describe their functions, and self-organize into a network. They communicate through wireless channel with nearby sensors and transmit data through multi-hop protocols to a gateway, which can forward information to a remote data server. In this project, we describe an environmental observatory called Texas Environmental Observatory (TEO) that incorporates a sensor network system with intertwined wired and wireless sensors. We are enhancing and expanding the existing wired weather stations to include wireless sensor networks (WSNs) and telemetry using solar-powered cellular modems. The new WSNs will monitor soil moisture and support long-term hydrologic modeling. Hydrologic models are helpful in predicting how changes in land cover translate into changes in the stream flow regime. These models require inputs that are difficult to measure over large areas, especially variables related to storm events, such as soil moisture antecedent conditions and rainfall amount and intensity. This will also contribute to improve rainfall estimations from meteorological radar data and enhance hydrological forecasts. Sensor data are transmitted from monitoring site to a Central Data Collection (CDC) Server. We incorporate a GPRS modem for wireless telemetry, a single-board computer (SBC) as Remote Field Gateway (RFG) Server, and a WSN for distributed soil moisture monitoring. The RFG provides effective control, management, and coordination of two independent sensor systems, i.e., a traditional datalogger-based wired

  20. Mobile Zigbee Sensor Networks

    CERN Document Server

    Anantdeep, Er; Kaur, Er Balpreet

    2010-01-01

    OPNET Modeler accelerates network R&D and improves product quality through high-fidelity modeling and scalable simulation. It provides a virtual environment for designing protocols and devices, and for testing and demonstrating designs in realistic scenarios prior to production. OPNET Modeler supports 802.15.4 standard and has been used to make a model of PAN. Iterations have been performed by changing the Power of the transmitter and the throughput will has been analyzed to arrive at optimal values.An energy-efficient wireless home network based on IEEE 802.15.4, a novel architecture has been proposed. In this architecture, all nodes are classified into stationary nodes and mobile nodes according to the functionality of each node. Mobile nodes are usually battery-powered, and therefore need low-power operation. In order to improve power consumption of mobile nodes, effective handover sequence based on MAC broadcast and transmission power control based on LQ (link quality) are employed. Experimental resul...

  1. Distributed Algorithms in Wireless Sensor Networks

    NARCIS (Netherlands)

    Nieberg, Tim; Broersma, Hajo; Faigle, Ulrich; Hurink, Johann; Pickl, Stefan; Woeginger, Gerhard

    2003-01-01

    Wireless sensor networks (WSNs) are an emerging field of research which combines many challenges in distributed computing and network optimization. One important goal is to improve the functional lifetime of the sensor network using energy-efficient distributed algorithms, networking and routing tec

  2. Hierarchical Resource Allocation in Femtocell Networks using Graph Algorithms

    CERN Document Server

    Sadr, Sanam

    2012-01-01

    This paper presents a hierarchical approach to resource allocation in open-access femtocell networks. The major challenge in femtocell networks is interference management which in our system, based on the Long Term Evolution (LTE) standard, translates to which user should be allocated which physical resource block (or fraction thereof) from which femtocell access point (FAP). The globally optimal solution requires integer programming and is mathematically intractable. We propose a hierarchical three-stage solution: first, the load of each FAP is estimated considering the number of users connected to the FAP, their average channel gain and required data rates. Second, based on each FAP's load, the physical resource blocks (PRBs) are allocated to FAPs in a manner that minimizes the interference by coloring the modified interference graph. Finally, the resource allocation is performed at each FAP considering users' instantaneous channel gain. The two major advantages of this suboptimal approach are the significa...

  3. Cooperative robots and sensor networks

    CERN Document Server

    Khelil, Abdelmajid

    2014-01-01

    Mobile robots and Wireless Sensor Networks (WSNs) have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and WSNs have mostly been considered as separate research fields and little work has investigated the marriage between these two technologies. However, these two technologies share several features, enable common cyber-physical applications and provide complementary support to each other.
 The primary objective of book is to provide a reference for cutting-edge studies and research trends pertaining to robotics and sensor networks, and in particular for the coupling between them. The book consists of five chapters. The first chapter presents a cooperation strategy for teams of multiple autonomous vehicles to solve the rendezvous problem. The second chapter is motivated by the need to improve existing solutions that deal with connectivity prediction, and proposed a genetic machine learning approach for link-quality prediction. The third chapter presents an arch...

  4. Networked unattented ground sensors assesment

    Science.gov (United States)

    Bouguereau, Julien; Gattefin, Christian; Dupuy, Gilles

    2003-09-01

    Within the framework of the NATO AC 323 / RTO TG 25 group, relating to advanced concepts of acoustic and seismic technology for military applications, Technical Establishment of Bourges welcomed and organized a joint campaign of experiment intending to demonstrate the interest of a networked unattented ground sensors for vehicles detection and tracking in an area defense context. Having reminded the principle of vehicles tracking, this paper describes the progress of the test campaign and details particularly sensors and participants deployment, the solution of interoperability chosen by the group and the instrumentation used to acquire, network, process and publish in real-time data available during the test: meteorological data, trajectography data and targets detection reports data. Finally, some results of the campaign are presented.

  5. Replanning Using Hierarchical Task Network and Operator-Based Planning

    Science.gov (United States)

    Wang, X.; Chien, S.

    1997-01-01

    In order to scale-up to real-world problems, planning systems must be able to replan in order to deal with changes in problem context. In this paper we describe hierarchical task network and operatorbased re-planning techniques which allow adaptation of a previous plan to account for problems associated with executing plans in real-world domains with uncertainty, concurrency, changing objectives.

  6. Unified broadcast in sensor networks

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg; Jurdak, Raja; Kusy, Branislav

    2011-01-01

    to consolidate these broadcasts focus on piggybacking information into existing services but such tight coupling between protocols limits code reuse and interoperability of applications. We present Unified Broadcast (UB) which combines broadcasts from multiple protocols while maintaining a modular architecture......Complex sensor network applications include multiple services such as collection, dissemination, time synchronization, and failure detection protocols. Many of these protocols require local state maintenance through periodic broadcasts which leads to high control overhead. Recent attempts...

  7. Resilient networking in wireless sensor networks

    CERN Document Server

    Erdene-Ochir, Ochirkhand; Valois, Fabrice; Kountouris, Apostolos

    2010-01-01

    This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focu...

  8. Hierarchical Communication Network Architectures for Offshore Wind Power Farms

    Directory of Open Access Journals (Sweden)

    Mohamed A. Ahmed

    2014-05-01

    Full Text Available Nowadays, large-scale wind power farms (WPFs bring new challenges for both electric systems and communication networks. Communication networks are an essential part of WPFs because they provide real-time control and monitoring of wind turbines from a remote location (local control center. However, different wind turbine applications have different requirements in terms of data volume, latency, bandwidth, QoS, etc. This paper proposes a hierarchical communication network architecture that consist of a turbine area network (TAN, farm area network (FAN, and control area network (CAN for offshore WPFs. The two types of offshore WPFs studied are small-scale WPFs close to the grid and medium-scale WPFs far from the grid. The wind turbines are modelled based on the logical nodes (LN concepts of the IEC 61400-25 standard. To keep pace with current developments in wind turbine technology, the network design takes into account the extension of the LNs for both the wind turbine foundation and meteorological measurements. The proposed hierarchical communication network is based on Switched Ethernet. Servers at the control center are used to store and process the data received from the WPF. The network architecture is modelled and evaluated via OPNET. We investigated the end-to-end (ETE delay for different WPF applications. The results are validated by comparing the amount of generated sensing data with that of received traffic at servers. The network performance is evaluated, analyzed and discussed in view of end-to-end (ETE delay for different link bandwidths.

  9. Data Architecture for Sensor Network

    Directory of Open Access Journals (Sweden)

    Jan Ježek

    2012-03-01

    Full Text Available Fast development of hardware in recent years leads to the high availability of simple sensing devices at minimal cost. As a consequence, there is many of sensor networks nowadays. These networks can continuously produce a large amount of observed data including the location of measurement. Optimal data architecture for such propose is a challenging issue due to its large scale and spatio-temporal nature.  The aim of this paper is to describe data architecture that was used in a particular solution for storage of sensor data. This solution is based on relation data model – concretely PostgreSQL and PostGIS. We will mention out experience from real world projects focused on car monitoring and project targeted on agriculture sensor networks. We will also shortly demonstrate the possibilities of client side API and the potential of other open source libraries that can be used for cartographic visualization (e.g. GeoServer. The main objective is to describe the strength and weakness of usage of relation database system for such propose and to introduce also alternative approaches based on NoSQL concept.

  10. Hybrid architecture for building secure sensor networks

    Science.gov (United States)

    Owens, Ken R., Jr.; Watkins, Steve E.

    2012-04-01

    Sensor networks have various communication and security architectural concerns. Three approaches are defined to address these concerns for sensor networks. The first area is the utilization of new computing architectures that leverage embedded virtualization software on the sensor. Deploying a small, embedded virtualization operating system on the sensor nodes that is designed to communicate to low-cost cloud computing infrastructure in the network is the foundation to delivering low-cost, secure sensor networks. The second area focuses on securing the sensor. Sensor security components include developing an identification scheme, and leveraging authentication algorithms and protocols that address security assurance within the physical, communication network, and application layers. This function will primarily be accomplished through encrypting the communication channel and integrating sensor network firewall and intrusion detection/prevention components to the sensor network architecture. Hence, sensor networks will be able to maintain high levels of security. The third area addresses the real-time and high priority nature of the data that sensor networks collect. This function requires that a quality-of-service (QoS) definition and algorithm be developed for delivering the right data at the right time. A hybrid architecture is proposed that combines software and hardware features to handle network traffic with diverse QoS requirements.

  11. 基于贝叶斯和层次模型的传感器网络节点故障预测研究%Study on fault prognosis of sensor network nodes using Bayesian and hierarchical model

    Institute of Scientific and Technical Information of China (English)

    何永强; 宫玉荣; 朱予聪

    2015-01-01

    提出了运用贝叶斯理论和层次模型对传感器网络节点故障进行预测的方法,结合传感器网络各节点处理信息的时序关系,用定性分析将时间信息融合到节点中分析故障传播机制和故障预测。根据节点的历史信息和当前运行情况,预测和确定节点的故障概率;利用参数学习和概率推理,预测上层节点的故障概率。通过仿真实验并与其他预测方法进行比较分析,验证了该方法的可靠性和精确性,为传感器网络节点的故障预测提供了新的思路和方法。%This paper presents the method for sensor network node failure prediction with the relationship between timing and level using Bayesian model methods. The method combines processing information in each node sensor network and uses qualitative analysis to integrate time information into the node to analyze the fault propagation mechanism and failure prediction. According to the probabili-ty of failure history information of node and the current operating conditions,nodes failure probabilities are forecasted and determined. Using the parameters of learning and probabilistic reasoning,the probability of failure of the upper node is predicted. Through simula-tion analysis and comparative analysis with other forecasting methods,the accuracy and precision of the method for sensor network node failure prediction is verified,providing new ideas and methods for nodes failure detection.

  12. Routing and wavelength assignment in hierarchical WDM networks

    Institute of Scientific and Technical Information of China (English)

    Yiyi LU; Ruxiang JIN; Chen HE

    2008-01-01

    A new routing and wavelength assignment method applied in hierarchical wavelength division multiplexing(WDM)networks is proposed.The algorithm is called offiine band priority algorithm(offiine BPA).The offline BPA targets to maximize the number of waveband paths under the condition of minimum number of wavelengths,and solve the routing and wavelength assignment(RWA)problem with waveband grooming to reduce cost.Based on the circle construction algorithm,waveband priority function is introduced to calculate the RWA problem.Simulation results demonstrate that the proposed algorithm achieves significant cost reduction in WDM network construction.

  13. Hierarchical control based on Hopfield network for nonseparable optimization problems

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    The nonseparable optimization control problem is considered, where the overall objective function is not of an additive form with respect to subsystems. Since there exists the problem that computation is very slow when using iterative algorithms in multiobjective optimization, Hopfield optimization hierarchical network based on IPM is presented to overcome such slow computation difficulty. Asymptotic stability of this Hopfield network is proved and its equilibrium point is the optimal point of the original problem. The simulation shows that the net is effective to deal with the optimization control problem for large-scale nonseparable steady state systems.

  14. A Cluster Based Routing Protocol in Wireless Sensor Network for Energy Consumption

    Directory of Open Access Journals (Sweden)

    M.Shanthi

    2014-01-01

    Full Text Available Wireless sensor network (WSN is a new and fast advancing technology, which is opening up many opportunities in the field of remote sensing and data monitoring. Even though the advances in embedded systems, the energy consumption is still open issue in WSNs. Recently there has been growing interest in the applications of sensor networks. The radio transmission and reception consumes a lot of energy, one of the important issues in wireless sensor network is the inherent limited battery power within network sensor nodes. Since sensors are generally constrained in on-board energy supply, efficient management of the network is crucial in extending the life of the sensor. In addition to maximizing the lifespan of sensor nodes, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to maximize overall network performance. In this paper, the focus is mainly driven over the survey of the hierarchical cluster-based available routings in Wireless Sensor Network for energy consumption. Low-Energy Adaptive Clustering Hierarchy (LEACH protocol is one of the best hierarchical protocols utilizing the probabilistic model to manage the energy consumption of WSN. Simulation results, shows the energy consumption over time of three nodes with distance to the Base Station.

  15. Fixed SMRF Sensor Network Application Concepts

    NARCIS (Netherlands)

    Wit, J.J.M. de; Rossum, W.L. van; Smits, F.M.A.; Theije, P.A.M. de; Monni, S.; Huizing, A.G.

    2010-01-01

    Advantages of scalable multifunction RF (SMRF) sensors and networked operation of sensors are well-known. Some advantages are surveillance persistence, multipath resistance, and interference resistance. The particular benefits of applying multifunction RF sensors in a network still need to be studie

  16. Fixed SMRF Sensor Network Application Concepts

    NARCIS (Netherlands)

    Wit, J.J.M. de; Rossum, W.L. van; Smits, F.M.A.; Theije, P.A.M. de; Monni, S.; Huizing, A.G.

    2010-01-01

    Advantages of scalable multifunction RF (SMRF) sensors and networked operation of sensors are well-known. Some advantages are surveillance persistence, multipath resistance, and interference resistance. The particular benefits of applying multifunction RF sensors in a network still need to be studie

  17. Energy-Harvesting Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Fafoutis, Xenofon; Vuckovic, Dusan; Di Mauro, Alessio

    2012-01-01

    Energy Harvesting comprises a promising solution to one of the key problems faced by battery-powered Wireless Sensor Networks, namely the limited nature of the energy supply (finite battery capacity). By harvesting energy from the surrounding environment, the sensors can have a continuous lifetime...... Sensor Networks with energy harvesting capability....

  18. Hierarchical organization of brain functional network during visual task

    CERN Document Server

    Zhuo, Zhao; Fu, Zhong-Qian; Zhang, Jie

    2011-01-01

    In this paper, the brain functional networks derived from high-resolution synchronous EEG time series during visual task are generated by calculating the phase synchronization among the time series. The hierarchical modular organizations of these networks are systematically investigated by the fast Girvan-Newman algorithm. At the same time, the spatially adjacent electrodes (corresponding to EEG channels) are clustered into functional groups based on anatomical parcellation of brain cortex, and this clustering information are compared to that of the functional network. The results show that the modular architectures of brain functional network are in coincidence with that from the anatomical structures over different levels of hierarchy, which suggests that population of neurons performing the same function excite and inhibit in identical rhythms. The structure-function relationship further reveals that the correlations among EEG time series in the same functional group are much stronger than those in differe...

  19. A Hybrid Structure for Data Aggregation in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Hedieh Sajedi

    2014-01-01

    Full Text Available In recent years, wireless sensor networks have been used for various applications such as environmental monitoring, military and medical applications. A wireless sensor network uses a large number of sensor nodes that continuously collect and send data from a specific region to a base station. Data from sensors are collected from the study area in the common scenario of sensor networks. Afterward, sensed data is sent to the base station. However, neighboring sensors often lead to redundancy of data. Transmission of redundant data to the base station consumes energy and produces traffic, because process is run in a large network. Data aggregation was proposed in order to reduce redundancy in data transformation and traffic. The most popular communication protocol in this field is cluster based data aggregation. Clustering causes energy balance, but sometimes energy consumption is not efficient due to the long distance between cluster heads and base station. In another communication protocol, which is based on a tree construction, because of the short distance between the sensors, energy consumption is low. In this data aggregation approach, since each sensor node is considered as one of the vertices of a tree, the depth of tree is usually high. In this paper, an efficient hierarchical hybrid approach for data aggregation is presented. It reduces energy consumption based on clustering and minimum spanning tree. The benefit of combining clustering and tree structure is reducing the disadvantages of previous structures. The proposed method firstly employs clustering algorithm and then a minimum spanning tree is constructed based on cluster heads. Our proposed method was compared to LEACH which is a well-known data aggregation method in terms of energy consumption and the amount of energy remaining in each sensor network lifetime. Simulation results indicate that our proposed method is more efficient than LEACH algorithm considering energy

  20. Complex networks with scale-free nature and hierarchical modularity

    Science.gov (United States)

    Shekatkar, Snehal M.; Ambika, G.

    2015-09-01

    Generative mechanisms which lead to empirically observed structure of networked systems from diverse fields like biology, technology and social sciences form a very important part of study of complex networks. The structure of many networked systems like biological cell, human society and World Wide Web markedly deviate from that of completely random networks indicating the presence of underlying processes. Often the main process involved in their evolution is the addition of links between existing nodes having a common neighbor. In this context we introduce an important property of the nodes, which we call mediating capacity, that is generic to many networks. This capacity decreases rapidly with increase in degree, making hubs weak mediators of the process. We show that this property of nodes provides an explanation for the simultaneous occurrence of the observed scale-free structure and hierarchical modularity in many networked systems. This also explains the high clustering and small-path length seen in real networks as well as non-zero degree-correlations. Our study also provides insight into the local process which ultimately leads to emergence of preferential attachment and hence is also important in understanding robustness and control of real networks as well as processes happening on real networks.

  1. Integration of RFID and Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    Miodrag; Bolic; Amiya; Nayak; Ivan; Stojmenovi.

    2007-01-01

    Radio Frequency Identification (RFID) and Wireless Sensor Network (WSN) are two important wireless technologies that have wide variety of applications and provide limitless future potentials. However,RFID and sensor networks almost are under development in parallel way. Integration of RFID and wireless sensor networks attracts little attention from research community. This paper first presents a brief introduction on RFID,and then investigates recent research works,new products/patents and applications that integrate RFID with sensor networks. Four types of integration are discussed. They are integrating tags with sensors,integrating tags with wireless sensor nodes,integrating readers with wireless sensor nodes and wire-less devices,and mix of RFID and sensors. New challenges and future works are discussed in the end.

  2. Wireless sensor networks in a maritime environment.

    NARCIS (Netherlands)

    Kavelaars, W.; Maris, M.

    2005-01-01

    In the recent years, there has been a lot of research on sensor networks-and their applications. In particular for monitoring large and potentially hostile areas these networks have proven to be very useful. The technique of land-based sensor networks can be extrapolated to sensing buoys at sea or i

  3. Passive Clustering for Efficient Energy Conservation in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Abderrahim MAIZATE

    2013-02-01

    Full Text Available A wireless sensor network is a set of miniature nodes that consume little energy and route information to a base station. It will enable reliable monitoring of a wide variety of phenomena for civilian, military and medical applications. Almost any sensor network application requires some form of self-organisation to route information. Recent years many protocols for network self-organization and management have been proposed and being implemented. Hierarchical clustering algorithms are very important in increasing the network’s life time. The most important point in this algorithm is cluster head selection and cluster formation because a good clustering guarantees reliability, energy efficiency and load balancing in the network. In this paper, we will use the principles of passive clustering to propose a new mechanism for selecting clusterheads. This mechanism allows the election of an alternate for each cluster head and a dynamic balancing of the role of clusterhead to the alternate when leaving or failure. Thus, it provides several advantages network reliability, stability of clusters and reduces energy consumption among the sensor nodes. Comparison with the existing schemes such as Passive Clustering and GRIDS (Geographically Repulsive Insomnious Distributed Sensors reveals that the mechanism for selecting an alternate for clusterhead nodes, which is the most important factor influencing the clustering performance, can significantly improves the network lifetime.

  4. The art of wireless sensor networks

    CERN Document Server

    2014-01-01

    During the last one and a half decades, wireless sensor networks have witnessed significant growth and tremendous development in both academia and industry.   “The Art of Wireless Sensor Networks: Volume 1: Fundamentals” focuses on the fundamentals concepts in the design, analysis, and implementation of wireless sensor networks. It covers the various layers of the lifecycle of this type of network from the physical layer up to the application layer. Its rationale is that the first volume covers contemporary design issues, tools, and protocols for radio-based two-dimensional terrestrial sensor networks. All the book chapters in this volume include up-to-date research work spanning various classic facets of the physical properties and functional behavior of wireless sensor networks, including physical layer, medium access control, data routing, topology management, mobility management, localization, task management, data management, data gathering, security, middleware, sensor technology, standards, and ...

  5. A NOVEL INTEREST COVERAGE METHOD BASED ON JENSEN-SHANNON DIVERGENCE IN SENSOR NETWORKS

    Institute of Scientific and Technical Information of China (English)

    Wang Yufeng; Wang Wendong

    2007-01-01

    In this paper, the idea of interest coverage is provided to form clusters in sensor network,which mean that the distance among data trends gathered by neighbor sensors is so small that, in some period, those sensors can be clustered, and certain sensor can be used to replace the cluster to form the virtual sensor network topology. In detail, the Jensen-Shannon Divergence (JSD) is used to characterize the distance among different distributions which represent the data trend of sensors.Then, based on JSD, a hierarchical clustering algorithm is provided to form the virtual sensor network topology. Simulation shows that the proposed approach gains more than 50% energy saving than Statistical Aggregation Methods (SAM) which transmitted data gathered by sensor only when the difference among data exceed certain threshold.

  6. Collaborative Clustering for Sensor Networks

    Science.gov (United States)

    Wagstaff. Loro :/; Green Jillian; Lane, Terran

    2011-01-01

    Traditionally, nodes in a sensor network simply collect data and then pass it on to a centralized node that archives, distributes, and possibly analyzes the data. However, analysis at the individual nodes could enable faster detection of anomalies or other interesting events, as well as faster responses such as sending out alerts or increasing the data collection rate. There is an additional opportunity for increased performance if individual nodes can communicate directly with their neighbors. Previously, a method was developed by which machine learning classification algorithms could collaborate to achieve high performance autonomously (without requiring human intervention). This method worked for supervised learning algorithms, in which labeled data is used to train models. The learners collaborated by exchanging labels describing the data. The new advance enables clustering algorithms, which do not use labeled data, to also collaborate. This is achieved by defining a new language for collaboration that uses pair-wise constraints to encode useful information for other learners. These constraints specify that two items must, or cannot, be placed into the same cluster. Previous work has shown that clustering with these constraints (in isolation) already improves performance. In the problem formulation, each learner resides at a different node in the sensor network and makes observations (collects data) independently of the other learners. Each learner clusters its data and then selects a pair of items about which it is uncertain and uses them to query its neighbors. The resulting feedback (a must and cannot constraint from each neighbor) is combined by the learner into a consensus constraint, and it then reclusters its data while incorporating the new constraint. A strategy was also proposed for cleaning the resulting constraint sets, which may contain conflicting constraints; this improves performance significantly. This approach has been applied to collaborative

  7. A secure multipath routing protocol for hierarchical wireless sensor networks%分簇无线传感器网络安全多路径路由协议

    Institute of Scientific and Technical Information of China (English)

    白恩健; 葛华勇; 杨阳

    2012-01-01

    Multipath routing cannot effectively resist security attacks against the network layer by a malicious node in wireless sensor networks. Combining multipath routing with node reliability evaluation, a secure multipath routing protocol was presented based on a reliability node. The trust value was obtained from the direct and indirect trust u-sing the weighted average method. The direct trust value of the nodes was obtained successfully from the factor of the rate of the forwarding packets and the rate of packet retransmission, and the indirect trust value of a node was obtained from the trust of neighboring nodes in the assessment node. The credit value was only created and exchanged among the cluster heads in order to reduce network overhead. Measured by the node reliability of the next hop node, secure multipalh routing was established by computing the number of multipaths to achieve the desired security requirements. Simulation results show that the protocol performs well in balancing energy consumption, ensuring the routing safety, and prolonging the network lifetime in wireless sensor networks.%针对多路径路由难以有效抵御恶意节点对无线传感器网络网络层的安全攻击,将多路径路由与节点可信度评价进行有效结合,以节点的转发数据包成功率和包重传率作为直接信任指标,邻居节点对评价节点的信任作为间接信任指标,提出一种基于可信节点的安全多路径路由协议.为降低网络开销,只对簇头节点进行可信度评价,并利用节点信任值衡量下一跳节点的可靠性,计算能达到期望安全性要求的多路径数目,进行信任多路径路由的建立.仿真结果表明:该协议能够有效地均衡路由能耗,延长网络生存周期,保障无线传感器网络的路由安全.

  8. Doubly Optimal Secure Multicasting: Hierarchical Hybrid Communication Network : Disaster Relief

    CERN Document Server

    Garimella, Rama Murthy; Singhal, Deepti

    2011-01-01

    Recently, the world has witnessed the increasing occurrence of disasters, some of natural origin and others caused by man. The intensity of the phenomenon that cause such disasters, the frequency in which they occur, the number of people affected and the material damage caused by them have been growing substantially. Disasters are defined as natural, technological, and human-initiated events that disrupt the normal functioning of the economy and society on a large scale. Areas where disasters have occurred bring many dangers to rescue teams and the communication network infrastructure is usually destroyed. To manage these hazards, different wireless technologies can be launched in the area of disaster. This paper discusses the innovative wireless technologies for Disaster Management. Specifically, issues related to the design of Hierarchical Hybrid Communication Network (arising in the communication network for disaster relief) are discussed.

  9. Hierarchical modular granular neural networks with fuzzy aggregation

    CERN Document Server

    Sanchez, Daniela

    2016-01-01

    In this book, a new method for hybrid intelligent systems is proposed. The proposed method is based on a granular computing approach applied in two levels. The techniques used and combined in the proposed method are modular neural networks (MNNs) with a Granular Computing (GrC) approach, thus resulting in a new concept of MNNs; modular granular neural networks (MGNNs). In addition fuzzy logic (FL) and hierarchical genetic algorithms (HGAs) are techniques used in this research work to improve results. These techniques are chosen because in other works have demonstrated to be a good option, and in the case of MNNs and HGAs, these techniques allow to improve the results obtained than with their conventional versions; respectively artificial neural networks and genetic algorithms.

  10. Contemporary Developments in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sangeeta Mittal

    2012-04-01

    Full Text Available Wireless Sensor Networks (WSN since their inception, a decade ago, have grown well in research and implementation. In this work the developments in WSNs are reported in three sub areas of wireless sensor networks that is, wireless sensor node (hardware and software, Communication & Networking issues in WSNs and application areas. WSNs are characterized by huge data hence research work in aggregation & mining is also discussed. Contemporary issues of integration of WSNs with other prevalent networks, sensor enabled smartness and role of artificial intelligence methods is elaborated. Insight into future directions & research avenues in all the above areas is provided

  11. Mechanisms for Prolonging Network Lifetime in Wireless Sensor Networks

    Science.gov (United States)

    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…

  12. Retrieval capabilities of hierarchical networks: from Dyson to Hopfield.

    Science.gov (United States)

    Agliari, Elena; Barra, Adriano; Galluzzi, Andrea; Guerra, Francesco; Tantari, Daniele; Tavani, Flavia

    2015-01-16

    We consider statistical-mechanics models for spin systems built on hierarchical structures, which provide a simple example of non-mean-field framework. We show that the coupling decay with spin distance can give rise to peculiar features and phase diagrams much richer than their mean-field counterpart. In particular, we consider the Dyson model, mimicking ferromagnetism in lattices, and we prove the existence of a number of metastabilities, beyond the ordered state, which become stable in the thermodynamic limit. Such a feature is retained when the hierarchical structure is coupled with the Hebb rule for learning, hence mimicking the modular architecture of neurons, and gives rise to an associative network able to perform single pattern retrieval as well as multiple-pattern retrieval, depending crucially on the external stimuli and on the rate of interaction decay with distance; however, those emergent multitasking features reduce the network capacity with respect to the mean-field counterpart. The analysis is accomplished through statistical mechanics, Markov chain theory, signal-to-noise ratio technique, and numerical simulations in full consistency. Our results shed light on the biological complexity shown by real networks, and suggest future directions for understanding more realistic models.

  13. Category theoretic analysis of hierarchical protein materials and social networks.

    Directory of Open Access Journals (Sweden)

    David I Spivak

    Full Text Available Materials in biology span all the scales from Angstroms to meters and typically consist of complex hierarchical assemblies of simple building blocks. Here we describe an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs. An olog is like a "concept web" or "semantic network" except that it follows a rigorous mathematical formulation based on category theory. This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other olog. We consider simple cases of beta-helical and amyloid-like protein filaments subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties. We also construct a representation of a social network in which people send text-messages to their nearest neighbors and act as a team to perform a task. We show that the olog for the protein and the olog for the social network feature identical category-theoretic representations, and we proceed to precisely explicate the analogy or isomorphism between them. The examples presented here demonstrate that the intrinsic nature of a complex system, which in particular includes a precise relationship between structure and function at different hierarchical levels, can be effectively represented by an olog. This, in turn, allows for comparative studies between disparate materials or fields of application, and results in novel approaches to derive functionality in the design of de novo hierarchical systems. We discuss opportunities and challenges associated with the description of complex biological materials by using ologs as a powerful tool for analysis and design in the context of materiomics, and we present the potential impact of this approach for engineering, life sciences, and medicine.

  14. Mobility-aware Hybrid Synchronization for Wireless Sensor Network

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

    2015-01-01

    Random mobility of node causes the frequent changes in the network dynamics causing the increased cost in terms of energy and bandwidth. It needs the additional efforts to synchronize the activities of nodes during data collection and transmission in Wireless Sensor Networks (WSNs). A key challenge...... in maintaining the effective data collection and transmission is to schedule and synchronize the activities of the nodes with the global clock. This paper proposes the Mobility-aware Hybrid Synchronization Algorithm (MHS) which works on the formation of cluster based on spanning tree mechanism (SPT). Nodes used...... for formation of the network have random mobility and heterogeneous in terms of energy with static sink. The nodes in the cluster and cluster heads in the network are synchronized with the notion of global time scale. In the initial stage, the algorithm establishes the hierarchical structure of the network...

  15. Bandwidth Efficient Hybrid Synchronization for Wireless Sensor Network

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

    2015-01-01

    Data collection and transmission are the fundamental operations of Wireless Sensor Networks (WSNs). A key challenge in effective data collection and transmission is to schedule and synchronize the activities of the nodes with the global clock. This paper proposes the Bandwidth Efficient Hybrid...... Synchronization Data Aggregation Algorithm (BESDA) using spanning tree mechanism (SPT). It uses static sink and mobile nodes in the network. BESDA considers the synchronization of a local clock of node with global clock of the network. In the initial stage algorithm established the hierarchical structure...... in the network and then perform the pair-wise synchronization. With the mobility of node, the structure frequently changes causing an increase in energy consumption. To mitigate the problem BESDA aggregate data with the notion of a global timescale throughout the network and schedule based time-division multiple...

  16. Sensor Activation and Radius Adaptation (SARA) in Heterogeneous Sensor Networks

    CERN Document Server

    Bartolini, Novella; la Porta, Thomas; Petrioli, Chiara; Silvestri, Simone

    2010-01-01

    In this paper we address the problem of prolonging the lifetime of wireless sensor networks (WSNs) deployed to monitor an area of interest. In this scenario, a helpful approach is to reduce coverage redundancy and therefore the energy expenditure due to coverage. We introduce the first algorithm which reduces coverage redundancy by means of Sensor Activation and sensing Radius Adaptation (SARA)in a general applicative scenario with two classes of devices: sensors that can adapt their sensing range (adjustable sensors) and sensors that cannot (fixed sensors). In particular, SARA activates only a subset of all the available sensors and reduces the sensing range of the adjustable sensors that have been activated. In doing so, SARA also takes possible heterogeneous coverage capabilities of sensors belonging to the same class into account. It specifically addresses device heterogeneity by modeling the coverage problem in the Laguerre geometry through Voronoi-Laguerre diagrams. SARA executes quickly and is guarante...

  17. A New Efficient Key Management Protocol for Wireless Sensor and Actor Networks

    CERN Document Server

    Lee, Yunho

    2009-01-01

    Research on sensor networks has become much more active and is currently being applied to many different fields. However since sensor networks are limited to only collecting and reporting information regarding a certain event, and requires human intervention with that given information, it is often difficult to react to an event or situation immediately and proactively. To overcome this kind of limitation, Wireless Sensor and Actor Networks (WSANs) with immediate-response actor nodes have been proposed which adds greater mobility and activity to the existing sensor networks. Although WSANs share many common grounds with sensor networks, it is difficult to apply existing security technologies due to the fact that WSANs contain actor nodes that are resource-independent and mobile. Therefore, this research seeks to demonstrate ways to provide security, integrity, and authentication services for WSANs secure operation, by separating networks into hierarchical structure by each node's abilities and provides differ...

  18. Intelligent sensor networks the integration of sensor networks, signal processing and machine learning

    CERN Document Server

    Hu, Fei

    2012-01-01

    Although governments worldwide have invested significantly in intelligent sensor network research and applications, few books cover intelligent sensor networks from a machine learning and signal processing perspective. Filling this void, Intelligent Sensor Networks: The Integration of Sensor Networks, Signal Processing and Machine Learning focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on the world-class research of award-winning authors, the book provides a firm grounding in the fundamentals of intelligent sensor networks, incl

  19. Wireless Sensor Networks TestBed: ASNTbed

    CSIR Research Space (South Africa)

    Dludla, AG

    2013-05-01

    Full Text Available Wireless sensor networks (WSNs) have been used in different types of applications and deployed within various environments. Simulation tools are essential for studying WSNs, especially for exploring large-scale networks. However, WSN testbeds...

  20. Genomic analysis of the hierarchical structure of regulatory networks

    Science.gov (United States)

    Yu, Haiyuan; Gerstein, Mark

    2006-01-01

    A fundamental question in biology is how the cell uses transcription factors (TFs) to coordinate the expression of thousands of genes in response to various stimuli. The relationships between TFs and their target genes can be modeled in terms of directed regulatory networks. These relationships, in turn, can be readily compared with commonplace “chain-of-command” structures in social networks, which have characteristic hierarchical layouts. Here, we develop algorithms for identifying generalized hierarchies (allowing for various loop structures) and use these approaches to illuminate extensive pyramid-shaped hierarchical structures existing in the regulatory networks of representative prokaryotes (Escherichia coli) and eukaryotes (Saccharomyces cerevisiae), with most TFs at the bottom levels and only a few master TFs on top. These masters are situated near the center of the protein–protein interaction network, a different type of network from the regulatory one, and they receive most of the input for the whole regulatory hierarchy through protein interactions. Moreover, they have maximal influence over other genes, in terms of affecting expression-level changes. Surprisingly, however, TFs at the bottom of the regulatory hierarchy are more essential to the viability of the cell. Finally, one might think master TFs achieve their wide influence through directly regulating many targets, but TFs with most direct targets are in the middle of the hierarchy. We find, in fact, that these midlevel TFs are “control bottlenecks” in the hierarchy, and this great degree of control for “middle managers” has parallels in efficient social structures in various corporate and governmental settings. PMID:17003135

  1. Research of Intrusion Detection System in Wireless Sensor Network Based on Adaboost with a Hierarchical Structure%分级结构Adaboost算法在无线传感器网络入侵检测中的应用研究

    Institute of Scientific and Technical Information of China (English)

    杨晓元; 胡志鹏; 魏立线

    2012-01-01

    传统网络中的入侵检测方法运算复杂,不适用于资源受限的无线传感器网络,提出了一种分级结构的Adaboost入侵检测算法,通过增大权重变化量、寻找最优分类器等方法,提高了检测的准确性与及时性;采用二叉树结构解决了检测的多分类问题;提出了入侵检测系统数据采集传输协议,解决了因分级结构带来的通信开销增大的问题;文中还讨论了无线传感器网络入侵检测系统性能的评价标准.理论分析和仿真实验表明,该方法具有较高的准确性和及时性;数据采集传输协议可以有效地减少检测节点的能耗,适用于各种入侵检测算法.%Due to the limited energy and computing ability in wireless sensor networks, almost all traditional intrusion detection schemes cannot be applied efficiently. This paper proposes a hierarchical Adaboost intrusion detection algorithm that improved the accuracy and timeliness of detection by enlarging weight variation and seeking optimum grader. A binary tree is adopted to solve the multiple classification problem of detection. The data acquisition and transmission protocol for the intrusion detective system has been put forward, and thus solved the problem of excessive communications cost resulting from the hierarchical structure. Besides,the standards for evaluating the performance of wireless sensor network intrusion detect system are also proposed in this paper. Theory analysis and simulation results show that the proposed scheme is of high accuracy and timeliness. Data acquisition transfer protocol can be efficiently cutting down the consuming energy of detection nodes,it can be use of in different wireless sensor networks.

  2. Sybil attack in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Abirami.K

    2013-04-01

    Full Text Available Wireless network is very susceptible to different types of attack. The main attack is Sybil attack, which allows forming other attacks on the network. Security is very important to the wireless network. In wireless sensor network, to verify node identities by cryptographic authentication but this is not easy because sensor node which contains limited resources. Therefore the current research is going on how to handling the situation of different traffic levels and transmission power for security.

  3. [A medical image semantic modeling based on hierarchical Bayesian networks].

    Science.gov (United States)

    Lin, Chunyi; Ma, Lihong; Yin, Junxun; Chen, Jianyu

    2009-04-01

    A semantic modeling approach for medical image semantic retrieval based on hierarchical Bayesian networks was proposed, in allusion to characters of medical images. It used GMM (Gaussian mixture models) to map low-level image features into object semantics with probabilities, then it captured high-level semantics through fusing these object semantics using a Bayesian network, so that it built a multi-layer medical image semantic model, aiming to enable automatic image annotation and semantic retrieval by using various keywords at different semantic levels. As for the validity of this method, we have built a multi-level semantic model from a small set of astrocytoma MRI (magnetic resonance imaging) samples, in order to extract semantics of astrocytoma in malignant degree. Experiment results show that this is a superior approach.

  4. Spatially Resolved Monitoring of Drying of Hierarchical Porous Organic Networks.

    Science.gov (United States)

    Velasco, Manuel Isaac; Silletta, Emilia V; Gomez, Cesar G; Strumia, Miriam C; Stapf, Siegfried; Monti, Gustavo Alberto; Mattea, Carlos; Acosta, Rodolfo H

    2016-03-01

    Evaporation kinetics of water confined in hierarchal polymeric porous media is studied by low field nuclear magnetic resonance (NMR). Systems synthesized with various degrees of cross-linker density render networks with similar pore sizes but different response when soaked with water. Polymeric networks with low percentage of cross-linker can undergo swelling, which affects the porosity as well as the drying kinetics. The drying process is monitored macroscopically by single-sided NMR, with spatial resolution of 100 μm, while microscopic information is obtained by measurements of spin-spin relaxation times (T2). Transition from a funicular to a pendular regime, where hydraulic connectivity is lost and the capillary flow cannot compensate for the surface evaporation, can be observed from inspection of the water content in different sample layers. Relaxation measurements indicate that even when the larger pore structures are depleted of water, capillary flow occurs through smaller voids.

  5. Architecture of the parallel hierarchical network for fast image recognition

    Science.gov (United States)

    Timchenko, Leonid; Wójcik, Waldemar; Kokriatskaia, Natalia; Kutaev, Yuriy; Ivasyuk, Igor; Kotyra, Andrzej; Smailova, Saule

    2016-09-01

    Multistage integration of visual information in the brain allows humans to respond quickly to most significant stimuli while maintaining their ability to recognize small details in the image. Implementation of this principle in technical systems can lead to more efficient processing procedures. The multistage approach to image processing includes main types of cortical multistage convergence. The input images are mapped into a flexible hierarchy that reflects complexity of image data. Procedures of the temporal image decomposition and hierarchy formation are described in mathematical expressions. The multistage system highlights spatial regularities, which are passed through a number of transformational levels to generate a coded representation of the image that encapsulates a structure on different hierarchical levels in the image. At each processing stage a single output result is computed to allow a quick response of the system. The result is presented as an activity pattern, which can be compared with previously computed patterns on the basis of the closest match. With regard to the forecasting method, its idea lies in the following. In the results synchronization block, network-processed data arrive to the database where a sample of most correlated data is drawn using service parameters of the parallel-hierarchical network.

  6. Wearable Sensor Networks for Motion Capture

    OpenAIRE

    Dennis Arsenault; Anthony Whitehead

    2015-01-01

    This work presents the development of a full body sensor-based motion tracking system that functions through wearable inertial sensors. The system is comprised of a total of ten wearable sensors and maps the player's motions to an on-screen character in real-time. A hierarchical skeletal model was implemented that allows players to navigate and interact with the virtual world without the need of a hand-held controller. To demonstrate the capabilities of the system, a simple virtual reality ga...

  7. Mathematical theories of distributed sensor networks

    CERN Document Server

    Iyengar, Sitharama S; Balakrishnan, N

    2014-01-01

    Mathematical Theory of Distributed Sensor Networks demonstrates how mathematical theories can be used to provide distributed sensor modeling and to solve important problems such as coverage hole detection and repair. The book introduces the mathematical and computational structure by discussing what they are, their applications and how they differ from traditional systems. The text also explains how mathematics are utilized to provide efficient techniques implementing effective coverage, deployment, transmission, data processing, signal processing, and data protection within distributed sensor networks. Finally, the authors discuss some important challenges facing mathematics to get more incite to the multidisciplinary area of distributed sensor networks.

  8. Wireless Sensor Networks: Opportunities and Challenges

    Directory of Open Access Journals (Sweden)

    Matthew N. O. Sadiku

    2014-01-01

    Full Text Available The popularity of cell phones, laptops, PDAs and intelligent electronics has made computing devices to become cheaper and more pervasive in daily life. The desire for connectivity among these devices has caused an exponential growth in wireless communication. Wireless sensor networks (WSNs provide an example of this phenomenon. WSNs belong to the general family of sensor networks that employ distributed sensors to collect information on entities of interest. This paper provides a brief introduction to wireless sensor networks. It addresses the opportunities and challenges of WSNs

  9. GSMNet: A Hierarchical Graph Model for Moving Objects in Networks

    Directory of Open Access Journals (Sweden)

    Hengcai Zhang

    2017-03-01

    Full Text Available Existing data models for moving objects in networks are often limited by flexibly controlling the granularity of representing networks and the cost of location updates and do not encompass semantic information, such as traffic states, traffic restrictions and social relationships. In this paper, we aim to fill the gap of traditional network-constrained models and propose a hierarchical graph model called the Geo-Social-Moving model for moving objects in Networks (GSMNet that adopts four graph structures, RouteGraph, SegmentGraph, ObjectGraph and MoveGraph, to represent the underlying networks, trajectories and semantic information in an integrated manner. The bulk of user-defined data types and corresponding operators is proposed to handle moving objects and answer a new class of queries supporting three kinds of conditions: spatial, temporal and semantic information. Then, we develop a prototype system with the native graph database system Neo4Jto implement the proposed GSMNet model. In the experiment, we conduct the performance evaluation using simulated trajectories generated from the BerlinMOD (Berlin Moving Objects Database benchmark and compare with the mature MOD system Secondo. The results of 17 benchmark queries demonstrate that our proposed GSMNet model has strong potential to reduce time-consuming table join operations an d shows remarkable advantages with regard to representing semantic information and controlling the cost of location updates.

  10. Sleep Deprivation Attack Detection in Wireless Sensor Network

    Science.gov (United States)

    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.

  11. Noncommutative Lightweight Signcryption for Wireless Sensor Networks

    OpenAIRE

    Lize Gu; Yun Pan; Mianxiong Dong; Kaoru Ota

    2013-01-01

    Key management techniques for secure wireless-sensor-networks-based applications must minimally incorporate confidentiality, authenticity, integrity, scalability, and flexibility. Signcryption is the proper primitive to do this. However, existing signcryption schemes are heavyweight and not suitable for resource-limited sensors. In this paper, we at first propose a braid-based signcryption scheme and then develop a key establishment protocol for wireless sensor networks. From the complexity v...

  12. Cooperative robots and sensor networks 2014

    CERN Document Server

    Khelil, Abdelmajid

    2014-01-01

    This book is the second volume on Cooperative Robots and Sensor Networks. The primary objective of this book is to provide an up-to-date reference for cutting-edge studies and research trends related to mobile robots and wireless sensor networks, and in particular for the coupling between them. Indeed, mobile robots and wireless sensor networks have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and wireless sensor networks have mostly been considered as separate research fields and little work has investigated the marriage between these two technologies. However, these two technologies share several features, enable common cyber-physical applications and provide complementary support to each other. The book consists of ten chapters, organized into four parts. The first part of the book presents three chapters related to localization of mobile robots using wireless sensor networks. Two chapters presented new solutions based Extended Kalman Filter and Particle Fi...

  13. On computer vision in wireless sensor networks.

    Energy Technology Data Exchange (ETDEWEB)

    Berry, Nina M.; Ko, Teresa H.

    2004-09-01

    Wireless sensor networks allow detailed sensing of otherwise unknown and inaccessible environments. While it would be beneficial to include cameras in a wireless sensor network because images are so rich in information, the power cost of transmitting an image across the wireless network can dramatically shorten the lifespan of the sensor nodes. This paper describe a new paradigm for the incorporation of imaging into wireless networks. Rather than focusing on transmitting images across the network, we show how an image can be processed locally for key features using simple detectors. Contrasted with traditional event detection systems that trigger an image capture, this enables a new class of sensors which uses a low power imaging sensor to detect a variety of visual cues. Sharing these features among relevant nodes cues specific actions to better provide information about the environment. We report on various existing techniques developed for traditional computer vision research which can aid in this work.

  14. Energy optimization in mobile sensor networks

    Science.gov (United States)

    Yu, Shengwei

    Mobile sensor networks are considered to consist of a network of mobile robots, each of which has computation, communication and sensing capabilities. Energy efficiency is a critical issue in mobile sensor networks, especially when mobility (i.e., locomotion control), routing (i.e., communications) and sensing are unique characteristics of mobile robots for energy optimization. This thesis focuses on the problem of energy optimization of mobile robotic sensor networks, and the research results can be extended to energy optimization of a network of mobile robots that monitors the environment, or a team of mobile robots that transports materials from stations to stations in a manufacturing environment. On the energy optimization of mobile robotic sensor networks, our research focuses on the investigation and development of distributed optimization algorithms to exploit the mobility of robotic sensor nodes for network lifetime maximization. In particular, the thesis studies these five problems: 1. Network-lifetime maximization by controlling positions of networked mobile sensor robots based on local information with distributed optimization algorithms; 2. Lifetime maximization of mobile sensor networks with energy harvesting modules; 3. Lifetime maximization using joint design of mobility and routing; 4. Optimal control for network energy minimization; 5. Network lifetime maximization in mobile visual sensor networks. In addressing the first problem, we consider only the mobility strategies of the robotic relay nodes in a mobile sensor network in order to maximize its network lifetime. By using variable substitutions, the original problem is converted into a convex problem, and a variant of the sub-gradient method for saddle-point computation is developed for solving this problem. An optimal solution is obtained by the method. Computer simulations show that mobility of robotic sensors can significantly prolong the lifetime of the whole robotic sensor network while

  15. Time-domain fiber loop ringdown sensor and sensor network

    Science.gov (United States)

    Kaya, Malik

    Optical fibers have been mostly used in fiber optic communications, imaging optics, sensing technology, etc. Fiber optic sensors have gained increasing attention for scientific and structural health monitoring (SHM) applications. In this study, fiber loop ringdown (FLRD) sensors were fabricated for scientific, SHM, and sensor networking applications. FLRD biosensors were fabricated for both bulk refractive index (RI)- and surface RI-based DNA sensing and one type of bacteria sensing. Furthermore, the effect of glucose oxidase (GOD) immobilization at the sensor head on sensor performance was evaluated for both glucose and synthetic urine solutions with glucose concentration between 0.1% and 10%. Detection sensitivities of the glucose sensors were achieved as low as 0.05%. For chemical sensing, heavy water, ranging from 97% to 10%, and several elemental solutions were monitored by using the FLRD chemical sensors. Bulk index-based FLRD sensing showed that trace elements can be detected in deionized water. For physical sensing, water and cracking sensors were fabricated and embedded into concrete. A partially-etched single-mode fiber (SMF) was embedded into a concrete bar for water monitoring while a bare SMF without any treatment was directly embedded into another concrete bar for monitoring cracks. Furthermore, detection sensitivities of water and crack sensors were investigated as 10 ml water and 0.5 mm surface crack width, respectively. Additionally fiber loop ringdown-fiber Bragg grating temperature sensors were developed in the laboratory; two sensor units for water, crack, and temperature sensing were deployed into a concrete cube in a US Department of Energy test bed (Miami, FL). Multi-sensor applications in a real concrete structure were accomplished by testing the six FLRD sensors. As a final stage, a sensor network was assembled by multiplexing two or three FLRD sensors in series and parallel. Additionally, two FLRD sensors were combined in series and

  16. Security Threats in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sushma

    2011-05-01

    Full Text Available Wireless Sensor Network (WSN is an emergingtechnology that shows great promise for variousfuturistic applications both for mass public andmilitary. The sensing technology combined withprocessing power and wireless communication makesit lucrative for being exploited in abundance in future.Wireless sensor networks are characterized byseverely constrained computational and energy resources, and an ad hoc operational environment. Wireless sensor networks (WSN are currently receiving significant attention due to their unlimitedpotential. However, it is still very early in the lifetime of such systems and many research challenges exist. This paper studies the security aspects of these networks.

  17. Geodetic sensor systems and sensor networks: positioning and applications

    NARCIS (Netherlands)

    Verhagen, S.; Grejner-Brzezinska, D.; Retscher, G.; Santos, M.; Ding, X.; Gao, Y.; Jin, S.

    2009-01-01

    This contribution focuses on geodetic sensor systems and sensor networks for positioning and applications. The key problems in this area will be addressed together with an overview of applications. Global Navigation Satellite Systems (GNSS) and other geodetic techniques play a central role in many a

  18. Geodetic sensor systems and sensor networks: positioning and applications

    NARCIS (Netherlands)

    Verhagen, S.; Grejner-Brzezinska, D.; Retscher, G.; Santos, M.; Ding, X.; Gao, Y.; Jin, S.

    2009-01-01

    This contribution focuses on geodetic sensor systems and sensor networks for positioning and applications. The key problems in this area will be addressed together with an overview of applications. Global Navigation Satellite Systems (GNSS) and other geodetic techniques play a central role in many

  19. Extending lifetime of wireless sensor networks using multi-sensor data fusion

    Indian Academy of Sciences (India)

    SOUMITRA DAS; S BARANI; SANJEEV WAGH; S S SONAVANE

    2017-07-01

    In this paper a multi-sensor data fusion approach for wireless sensor network based on bayesian methods and ant colony optimization techniques has been proposed. In this method, each node is equipped with multiple sensors (i.e., temperature and humidity). Use of more than one sensor provides additional information about the environmental conditions. The data fusion approach based on the competitive-type hierarchical processing is considered for experimentation. Initially the data are collected by the sensors placed in the sensing fields and then the data fusion probabilities are computed on the sensed data. In this proposed methodology, the collected temperature tand humidity data are processed by multi-sensor data fusion techniques, which help in decreasing the energy consumption as well as communication cost by fusing the redundant data. The multipledata fusion process improves the reliability and accuracy of the sensed information and simultaneously saves energy, which was our primary objective. The proposed algorithms were simulated using Matlab. The executions of proposed arnd low-energy adaptive clustering hierarchy algorithms were carried out and the results show that the proposed algorithms could efficiently reduce the use of energy and were able to save more energy, thus increasing the overall network lifetime.

  20. A hierarchical network modeling method for railway tunnels safety assessment

    Science.gov (United States)

    Zhou, Jin; Xu, Weixiang; Guo, Xin; Liu, Xumin

    2017-02-01

    Using network theory to model risk-related knowledge on accidents is regarded as potential very helpful in risk management. A large amount of defects detection data for railway tunnels is collected in autumn every year in China. It is extremely important to discover the regularities knowledge in database. In this paper, based on network theories and by using data mining techniques, a new method is proposed for mining risk-related regularities to support risk management in railway tunnel projects. A hierarchical network (HN) model which takes into account the tunnel structures, tunnel defects, potential failures and accidents is established. An improved Apriori algorithm is designed to rapidly and effectively mine correlations between tunnel structures and tunnel defects. Then an algorithm is presented in order to mine the risk-related regularities table (RRT) from the frequent patterns. At last, a safety assessment method is proposed by consideration of actual defects and possible risks of defects gained from the RRT. This method cannot only generate the quantitative risk results but also reveal the key defects and critical risks of defects. This paper is further development on accident causation network modeling methods which can provide guidance for specific maintenance measure.

  1. FUZZY LOGIC BASED ENERGY EFFICIENT PROTOCOL IN WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    Zhan Wei Siew

    2012-12-01

    Full Text Available Wireless sensor networks (WSNs have been vastly developed due to the advances in microelectromechanical systems (MEMS using WSN to study and monitor the environments towards climates changes. In environmental monitoring, sensors are randomly deployed over the interest area to periodically sense the physical environments for a few months or even a year. Therefore, to prolong the network lifetime with limited battery capacity becomes a challenging issue. Low energy adaptive cluster hierarchical (LEACH is the common clustering protocol that aim to reduce the energy consumption by rotating the heavy workload cluster heads (CHs. The CHs election in LEACH is based on probability model which will lead to inefficient in energy consumption due to least desired CHs location in the network. In WSNs, the CHs location can directly influence the network energy consumption and further affect the network lifetime. In this paper, factors which will affect the network lifetime will be presented and the demonstration of fuzzy logic based CH selection conducted in base station (BS will also be carried out. To select suitable CHs that will prolong the network first node dies (FND round and consistent throughput to the BS, energy level and distance to the BS are selected as fuzzy inputs.

  2. Sensor agnostics for networked MAV applications

    Science.gov (United States)

    Mitra, Atindra K.; Gates, Miguel; Barber, Chris; Goodwin, Thomas; Selmic, Rastko; Ordonez, Raul; Sekman, Ali; Malkani, Mohan

    2010-04-01

    A number of potential advantages associated with a new concept denoted as Sensor Agnostic Networks are discussed. For this particular paper, the primary focus is on integrated wireless networks that contain one or more MAVs (Micro Unmanned Aerial Vehicle). The development and presentation includes several approaches to analysis and design of Sensor Agnostic Networks based on the assumption of canonically structured architectures that are comprised of lowcost wireless sensor node technologies. A logical development is provided that motivates the potential adaptation of distributed low-cost sensor networks that leverage state-of-the-art wireless technologies and are specifically designed with pre-determined hooks, or facets, in-place that allow for quick and efficient sensor swaps between cost-low RF Sensors, EO Sensors, and Chem/Bio Sensors. All of the sample design synthesis procedures provided within this paper conform to the structural low-cost electronic wireless network architectural constraints adopted for our new approach to generalized sensing applications via the conscious integration of Sensor Agnostic capabilities.

  3. Hierarchical Interference Mitigation for Massive MIMO Cellular Networks

    Science.gov (United States)

    Liu, An; Lau, Vincent

    2014-09-01

    We propose a hierarchical interference mitigation scheme for massive MIMO cellular networks. The MIMO precoder at each base station (BS) is partitioned into an inner precoder and an outer precoder. The inner precoder controls the intra-cell interference and is adaptive to local channel state information (CSI) at each BS (CSIT). The outer precoder controls the inter-cell interference and is adaptive to channel statistics. Such hierarchical precoding structure reduces the number of pilot symbols required for CSI estimation in massive MIMO downlink and is robust to the backhaul latency. We study joint optimization of the outer precoders, the user selection, and the power allocation to maximize a general concave utility which has no closed-form expression. We first apply random matrix theory to obtain an approximated problem with closed-form objective. We show that the solution of the approximated problem is asymptotically optimal with respect to the original problem as the number of antennas per BS grows large. Then using the hidden convexity of the problem, we propose an iterative algorithm to find the optimal solution for the approximated problem. We also obtain a low complexity algorithm with provable convergence. Simulations show that the proposed design has significant gain over various state-of-the-art baselines.

  4. Sensor Networks in the Low Lands

    Directory of Open Access Journals (Sweden)

    Dennis J.A. Bijwaard

    2010-09-01

    Full Text Available This paper provides an overview of scientific and industrial developments of the last decade in the area of sensor networks in The Netherlands (Low Lands. The goal is to highlight areas in which the Netherlands has made most contributions and is currently a dominant player in the field of sensor networks. On the one hand, motivations, addressed topics, and initiatives taken in this period are presented, while on the other hand, special emphasis is given to identifying current and future trends and formulating a vision for the coming five to ten years. The presented overview and trend analysis clearly show that Dutch research and industrial efforts, in line with recent worldwide developments in the field of sensor technology, present a clear shift from sensor node platforms, operating systems, communication, networking, and data management aspects of the sensor networks to reasoning/cognition, control, and actuation.

  5. Community Air Sensor Network (CAIRSENSE) project ...

    Science.gov (United States)

    Advances in air pollution sensor technology have enabled the development of small and low cost systems to measure outdoor air pollution. The deployment of a large number of sensors across a small geographic area would have potential benefits to supplement traditional monitoring networks with additional geographic and temporal measurement resolution, if the data quality were sufficient. To understand the capability of emerging air sensor technology, the Community Air Sensor Network (CAIRSENSE) project deployed low cost, continuous and commercially-available air pollution sensors at a regulatory air monitoring site and as a local sensor network over a surrounding ~2 km area in Southeastern U.S. Co-location of sensors measuring oxides of nitrogen, ozone, carbon monoxide, sulfur dioxide, and particles revealed highly variable performance, both in terms of comparison to a reference monitor as well as whether multiple identical sensors reproduced the same signal. Multiple ozone, nitrogen dioxide, and carbon monoxide sensors revealed low to very high correlation with a reference monitor, with Pearson sample correlation coefficient (r) ranging from 0.39 to 0.97, -0.25 to 0.76, -0.40 to 0.82, respectively. The only sulfur dioxide sensor tested revealed no correlation (r 0.5), step-wise multiple linear regression was performed to determine if ambient temperature, relative humidity (RH), or age of the sensor in sampling days could be used in a correction algorihm to im

  6. Hierarchical self-organization of cytoskeletal active networks

    CERN Document Server

    Gordon, Daniel; Keasar, Chen; Farago, Oded

    2012-01-01

    The structural reorganization of the actin cytoskeleton is facilitated through the action of motor proteins that crosslink the actin filaments and transport them relative to each other. Here, we present a combined experimental-computational study that probes the dynamic evolution of mixtures of actin filaments and clusters of myosin motors. While on small spatial and temporal scales the system behaves in a very noisy manner, on larger scales it evolves into several well distinct patterns such as bundles, asters, and networks. These patterns are characterized by junctions with high connectivity, whose formation is possible due to the organization of the motors in "oligoclusters" (intermediate-size aggregates). The simulations reveal that the self-organization process proceeds through a series of hierarchical steps, starting from local microscopic moves and ranging up to the macroscopic large scales where the steady-state structures are formed. Our results shed light into the mechanisms involved in processes li...

  7. Learning Probabilistic Hierarchical Task Networks to Capture User Preferences

    CERN Document Server

    Li, Nan; Kambhampati, Subbarao; Yoon, Sungwook

    2010-01-01

    We propose automatically learning probabilistic Hierarchical Task Networks (pHTNs) in order to capture a user's preferences on plans, by observing only the user's behavior. HTNs are a common choice of representation for a variety of purposes in planning, including work on learning in planning. Our contributions are (a) learning structure and (b) representing preferences. In contrast, prior work employing HTNs considers learning method preconditions (instead of structure) and representing domain physics or search control knowledge (rather than preferences). Initially we will assume that the observed distribution of plans is an accurate representation of user preference, and then generalize to the situation where feasibility constraints frequently prevent the execution of preferred plans. In order to learn a distribution on plans we adapt an Expectation-Maximization (EM) technique from the discipline of (probabilistic) grammar induction, taking the perspective of task reductions as productions in a context-free...

  8. Topology Optimisation of Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Thike Aye Min

    2016-01-01

    Full Text Available Wireless sensor networks are widely used in a variety of fields including industrial environments. In case of a clustered network the location of cluster head affects the reliability of the network operation. Finding of the optimum location of the cluster head, therefore, is critical for the design of a network. This paper discusses the optimisation approach, based on the brute force algorithm, in the context of topology optimisation of a cluster structure centralised wireless sensor network. Two examples are given to verify the approach that demonstrate the implementation of the brute force algorithm to find an optimum location of the cluster head.

  9. A Wireless Sensor Network Air Pollution Monitoring System

    Directory of Open Access Journals (Sweden)

    Kavi K. Khedo

    2010-05-01

    Full Text Available Sensor networks are currently an active research area mainly due to the potential of their applications. Inthis paper we investigate the use of Wireless Sensor Networks (WSN for air pollution monitoring inMauritius. With the fast growing industrial activities on the island, the problem of air pollution isbecoming a major concern for the health of the population. We proposed an innovative system namedWireless Sensor Network Air Pollution Monitoring System (WAPMS to monitor air pollution inMauritius through the use of wireless sensors deployed in huge numbers around the island. The proposedsystem makes use of an Air Quality Index (AQI which is presently not available in Mauritius. In order toimprove the efficiency of WAPMS, we have designed and implemented a new data aggregation algorithmnamed Recursive Converging Quartiles (RCQ. The algorithm is used to merge data to eliminateduplicates, filter out invalid readings and summarise them into a simpler form which significantly reducethe amount of data to be transmitted to the sink and thus saving energy. For better power management weused a hierarchical routing protocol in WAPMS and caused the motes to sleep during idle time.

  10. Bluetooth and Sensor Networks : A Reality Check

    DEFF Research Database (Denmark)

    Leopold, Martin; Bonnet, Philippe

    2003-01-01

    The current generation of sensor nodes rely on commodity components. The choice of the radio is particularly important as it impacts not only energy consumption but also software design (e.g., network self-assembly, multihop routing and in-network processing). Bluetooth is one of the most popular...... commodity radios for wireless devices. As a representative of the frequency hopping spread spectrum radios, it is a natural alternative to broadcast radios in the context of sensor networks. The question is whether Bluetooth can be a viable alternative in practice. In this paper, we report our experience...... using Bluetooth for the sensor network regime. We describe our tiny Bluetooth stack that allows TinyOS applications to run on Bluetooth-based sensor nodes, we present a multihop network assembly procedure that leverages Bluetooth's device discovery protocol, and we discuss how Bluetooth favorably...

  11. Bluetooth and sensor networks: a reality check

    DEFF Research Database (Denmark)

    Leopold, Martin; Dydensborg, Mads; Bonnet, Philippe

    2003-01-01

    The current generation of sensor nodes rely on commodity components. The choice of the radio is particularly important as it impacts not only energy consumption but also software design (e.g., network self-assembly, multihop routing and in-network processing). Bluetooth is one of the most popular...... commodity radios for wireless devices. As a representative of the frequency hopping spread spectrum radios, it is a natural alternative to broadcast radios in the context of sensor networks. The question is whether Bluetooth can be a viable alternative in practice. In this paper, we report our experience...... using Bluetooth for the sensor network regime. We describe our tiny Bluetooth stack that allows TinyOS applications to run on Bluetooth-based sensor nodes, we present a multihop network assembly procedure that leverages Bluetooth's device discovery protocol, and we discuss how Bluetooth favorably...

  12. Bluetooth and sensor networks: a reality check

    DEFF Research Database (Denmark)

    Leopold, Martin; Dydensborg, Mads; Bonnet, Philippe

    2003-01-01

    commodity radios for wireless devices. As a representative of the frequency hopping spread spectrum radios, it is a natural alternative to broadcast radios in the context of sensor networks. The question is whether Bluetooth can be a viable alternative in practice. In this paper, we report our experience......The current generation of sensor nodes rely on commodity components. The choice of the radio is particularly important as it impacts not only energy consumption but also software design (e.g., network self-assembly, multihop routing and in-network processing). Bluetooth is one of the most popular...... using Bluetooth for the sensor network regime. We describe our tiny Bluetooth stack that allows TinyOS applications to run on Bluetooth-based sensor nodes, we present a multihop network assembly procedure that leverages Bluetooth's device discovery protocol, and we discuss how Bluetooth favorably...

  13. A self-managing fault management mechanism for wireless sensor networks

    CERN Document Server

    Asim, Muhammad; Merabti, Madjid

    2010-01-01

    A sensor network can be described as a collection of sensor nodes which co-ordinate with each other to perform some specific function. These sensor nodes are mainly in large numbers and are densely deployed either inside the phenomenon or very close to it. They can be used for various application areas (e.g. health, military, home). Failures are inevitable in wireless sensor networks due to inhospitable environment and unattended deployment. Therefore, it is necessary that network failures are detected in advance and appropriate measures are taken to sustain network operation. We previously proposed a cellular approach for fault detection and recovery. In this paper we extend the cellular approach and propose a new fault management mechanism to deal with fault detection and recovery. We propose a hierarchical structure to properly distribute fault management tasks among sensor nodes by introducing more 'self-managing' functions. The proposed failure detection and recovery algorithm has been compared with some...

  14. Hierarchical Linear Models for Energy Prediction using Inertial Sensors: A Comparative Study for Treadmill Walking.

    Science.gov (United States)

    Vathsangam, Harshvardhan; Emken, B Adar; Schroeder, E Todd; Spruijt-Metz, Donna; Sukhatme, Gaurav S

    2013-12-01

    Walking is a commonly available activity to maintain a healthy lifestyle. Accurately tracking and measuring calories expended during walking can improve user feedback and intervention measures. Inertial sensors are a promising measurement tool to achieve this purpose. An important aspect in mapping inertial sensor data to energy expenditure is the question of normalizing across physiological parameters. Common approaches such as weight scaling require validation for each new population. An alternative is to use a hierarchical approach to model subject-specific parameters at one level and cross-subject parameters connected by physiological variables at a higher level. In this paper, we evaluate an inertial sensor-based hierarchical model to measure energy expenditure across a target population. We first determine the optimal movement and physiological features set to represent data. Periodicity based features are more accurate (phierarchical model with a subject-specific regression model and weight exponent scaled models. Subject-specific models perform significantly better (pmodels at all exponent scales whereas the hierarchical model performed worse than both. However, using an informed prior from the hierarchical model produces similar errors to using a subject-specific model with large amounts of training data (phierarchical modeling is a promising technique for generalized prediction energy expenditure prediction across a target population in a clinical setting.

  15. Topology Optimization for Urban Traffic Sensor Network

    Institute of Scientific and Technical Information of China (English)

    HU Jianming; SONG Jingyan; ZHANG Mingchen; KANG Xiaojing

    2008-01-01

    This paper presents an optimized topology for urban traffic sensor networks. Small world theory is used to improve the performance of the wireless communication system with a heterogeneous transmission model and an optimal transmission radius. Furthermore, a series of simulations based on the actual road network around the 2nd Ring Road in Beijing demonstrate the practicability of constructing artificial "small worlds". Moreover, the particle swarm optimization method is used to calculate the globally best distribution of the nodes with the large radius. The methods proposed in this paper will be helpful to the sensor nodes deployment of the new urban traffic sensor networks.

  16. Wireless sensor networks distributed consensus estimation

    CERN Document Server

    Chen, Cailian; Guan, Xinping

    2014-01-01

    This SpringerBrief evaluates the cooperative effort of sensor nodes to accomplish high-level tasks with sensing, data processing and communication. The metrics of network-wide convergence, unbiasedness, consistency and optimality are discussed through network topology, distributed estimation algorithms and consensus strategy. Systematic analysis reveals that proper deployment of sensor nodes and a small number of low-cost relays (without sensing function) can speed up the information fusion and thus improve the estimation capability of wireless sensor networks (WSNs). This brief also investiga

  17. Extension of Pairwise Broadcast Clock Synchronization for Multicluster Sensor Networks

    Directory of Open Access Journals (Sweden)

    Bruce W. Suter

    2008-01-01

    Full Text Available Time synchronization is crucial for wireless sensor networks (WSNs in performing a number of fundamental operations such as data coordination, power management, security, and localization. The Pairwise Broadcast Synchronization (PBS protocol was recently proposed to minimize the number of timing messages required for global network synchronization, which enables the design of highly energy-efficient WSNs. However, PBS requires all nodes in the network to lie within the communication ranges of two leader nodes, a condition which might not be available in some applications. This paper proposes an extension of PBS to the more general class of sensor networks. Based on the hierarchical structure of the network, an energy-efficient pair selection algorithm is proposed to select the best pairwise synchronization sequence to reduce the overall energy consumption. It is shown that in a multicluster networking environment, PBS requires a far less number of timing messages than other well-known synchronization protocols and incurs no loss in synchronization accuracy. Moreover, the proposed scheme presents significant energy savings for densely deployed WSNs.

  18. Application for Measurement in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Miroslav MAHDAL

    2009-06-01

    Full Text Available This paper deals with wireless sensor networks, which are based on IEEE 802.15.4 standard. The development kit from Jennic company was used for wireless measuring of values and for creation of sensor network. For this purposes the sensor boards with wireless modules with marking JN5139 were used. These boards provide sensors (sensor of temperature, relative humidity and light sensor but also another interface, which helps to develop applications. Modules are programmed in Integrated Development Environment (IDE, which integrates C function library and C++ compiler and linker. The visualization application was created for monitoring of wireless sensor network. There is the possibility of local and wireless measurement. For creation of this application the SCADA/HMI system, Control Web 5 was used. This SCADA/HMI system enables to communicate with all wireless modules through base station (network's coordinator. The application also enables initialisation and network setting the any wireless module communicating with the base station. The advantage is the remote configuration and control of network. The application also enables the gathering, converting, viewing and archiving of incoming data from particular modules.

  19. A Sentinel Sensor Network for Hydrogen Sensing

    Directory of Open Access Journals (Sweden)

    Andrew J. Mason

    2003-02-01

    Full Text Available A wireless sensor network is presented for in-situ monitoring of atmospheric hydrogen concentration. The hydrogen sensor network consists of multiple sensor nodes, equipped with titania nanotube hydrogen sensors, distributed throughout the area of interest; each node is both sensor, and data-relay station that enables extended wide area monitoring without a consequent increase of node power and thus node size. The hydrogen sensor is fabricated from a sheet of highly ordered titania nanotubes, made by anodization of a titanium thick film, to which platinum electrodes are connected. The electrical resistance of the hydrogen sensor varies from 245 Ω at 500 ppm hydrogen, to 10.23 kΩ at 0 ppm hydrogen (pure nitrogen environment. The measured resistance is converted to voltage, 0.049 V at 500 ppm to 2.046 V at 0 ppm, by interface circuitry. The microcontroller of the sensor node digitizes the voltage and transmits the digital information, using intermediate nodes as relays, to a host node that downloads measurement data to a computer for display. This paper describes the design and operation of the sensor network, the titania nanotube hydrogen sensors with an apparent low level resolution of approximately 0.05 ppm, and their integration in one widely useful device.

  20. Sensor Validation using Bayesian Networks

    Data.gov (United States)

    National Aeronautics and Space Administration — One of NASA’s key mission requirements is robust state estimation. Sensing, using a wide range of sensors and sensor fusion approaches, plays a central role in...

  1. Reputation-Based Secure Sensor Localization in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jingsha He

    2014-01-01

    Full Text Available Location information of sensor nodes in wireless sensor networks (WSNs is very important, for it makes information that is collected and reported by the sensor nodes spatially meaningful for applications. Since most current sensor localization schemes rely on location information that is provided by beacon nodes for the regular sensor nodes to locate themselves, the accuracy of localization depends on the accuracy of location information from the beacon nodes. Therefore, the security and reliability of the beacon nodes become critical in the localization of regular sensor nodes. In this paper, we propose a reputation-based security scheme for sensor localization to improve the security and the accuracy of sensor localization in hostile or untrusted environments. In our proposed scheme, the reputation of each beacon node is evaluated based on a reputation evaluation model so that regular sensor nodes can get credible location information from highly reputable beacon nodes to accomplish localization. We also perform a set of simulation experiments to demonstrate the effectiveness of the proposed reputation-based security scheme. And our simulation results show that the proposed security scheme can enhance the security and, hence, improve the accuracy of sensor localization in hostile or untrusted environments.

  2. Establishing trust in decentralized smart sensor networks

    Science.gov (United States)

    Vagts, H.; Cosar, T.; Beyerer, J.

    2011-06-01

    Smart sensors can gather all kind of information and process it. Cameras are still dominating and smart cameras can offer services for face recognition or person tracking. Operators are building collaborations to cover a larger area, to save costs and to add more and different sensors. Cryptographic methods may achieve integrity and confidentiality between operators, but not trust. Even if a partner or one of his sensors is authenticated, no statements can be made about the quality of the sensor data. Hence, trust must be established between the partners and their sensors. Trust can be built based on past experience. A reputation system collects opinions of operators about the behavior of sensors and calculates trust based on these opinions. Many reputation systems have been proposed, e.g., for authentication of files in peer-topeer networks. This work presents a new reputation system, which is designed to calculate the trustworthiness of smart sensors and smart sensor systems. A new trust model, including functions to calculate and update trust on past experiences, is proposed. When fusing information of multiple sensors, it cannot always be reconstructed, which information led to a bad result. Hence, an approach for fair rating is shown. The proposed system has been realized in a Service-Oriented Architecture for easy integration in existing smart sensor systems, e.g., smart surveillance systems. The model itself can be used in every decentralized heterogeneous smart sensor network.

  3. Facile Fabrication of Multi-hierarchical Porous Polyaniline Composite as Pressure Sensor and Gas Sensor with Adjustable Sensitivity

    Science.gov (United States)

    He, Xiao-Xiao; Li, Jin-Tao; Jia, Xian-Sheng; Tong, Lu; Wang, Xiao-Xiong; Zhang, Jun; Zheng, Jie; Ning, Xin; Long, Yun-Ze

    2017-08-01

    A multi-hierarchical porous polyaniline (PANI) composite which could be used in good performance pressure sensor and adjustable sensitivity gas sensor has been fabricated by a facile in situ polymerization. Commercial grade sponge was utilized as a template scaffold to deposit PANI via in situ polymerization. With abundant interconnected pores throughout the whole structure, the sponge provided sufficient surface for the growth of PANI nanobranches. The flexible porous structure helped the composite to show high performance in pressure detection with fast response and favorable recoverability and gas detection with adjustable sensitivity. The sensing mechanism of the PANI/sponge-based flexible sensor has also been discussed. The results indicate that this work provides a feasible approach to fabricate efficient sensors with advantages of low cost, facile preparation, and easy signal collection.

  4. Graphical Model Theory for Wireless Sensor Networks

    Energy Technology Data Exchange (ETDEWEB)

    Davis, William B.

    2002-12-08

    Information processing in sensor networks, with many small processors, demands a theory of computation that allows the minimization of processing effort, and the distribution of this effort throughout the network. Graphical model theory provides a probabilistic theory of computation that explicitly addresses complexity and decentralization for optimizing network computation. The junction tree algorithm, for decentralized inference on graphical probability models, can be instantiated in a variety of applications useful for wireless sensor networks, including: sensor validation and fusion; data compression and channel coding; expert systems, with decentralized data structures, and efficient local queries; pattern classification, and machine learning. Graphical models for these applications are sketched, and a model of dynamic sensor validation and fusion is presented in more depth, to illustrate the junction tree algorithm.

  5. Registration Cost Performance Analysis of a Hierarchical Mobile Internet Protocol Network

    Institute of Scientific and Technical Information of China (English)

    XU Kai; JI Hong; YUE Guang-xin

    2004-01-01

    On the basis of introducing principles for hierarchical mobile Internet protocol networks, the registration cost performance in this network model is analyzed in detail. Furthermore, the functional relationship is also established in the paper among registration cost, hierarchical level number and the maximum handover time for gateway foreign agent regional registration. At last, the registration cost of the hierarchical mobile Internet protocol network is compared with that of the traditional mobile Internet protocol. Theoretic analysis and computer simulation results show that the hierarchical level number and the maximum handover times can both affect the registration cost importantly, when suitable values of which are chosen, the hierarchical network can significantly improve the registration performance compared with the traditional mobile IP.

  6. Hierarchical Real-time Network Traffic Classification Based on ECOC

    Directory of Open Access Journals (Sweden)

    Yaou Zhao

    2013-09-01

    Full Text Available Classification of network traffic is basic and essential for manynetwork researches and managements. With the rapid development ofpeer-to-peer (P2P application using dynamic port disguisingtechniques and encryption to avoid detection, port-based and simplepayload-based network traffic classification methods were diminished.An alternative method based on statistics and machine learning hadattracted researchers' attention in recent years. However, most ofthe proposed algorithms were off-line and usually used a single classifier.In this paper a new hierarchical real-time model was proposed which comprised of a three tuple (source ip, destination ip and destination portlook up table(TT-LUT part and layered milestone part. TT-LUT was used to quickly classify short flows whichneed not to pass the layered milestone part, and milestones in layered milestone partcould classify the other flows in real-time with the real-time feature selection and statistics.Every milestone was a ECOC(Error-Correcting Output Codes based model which was usedto improve classification performance. Experiments showed that the proposedmodel can improve the efficiency of real-time to 80%, and themulti-class classification accuracy encouragingly to 91.4% on the datasets which had been captured from the backbone router in our campus through a week.

  7. Category theoretic analysis of hierarchical protein materials and social networks

    CERN Document Server

    Spivak, David I; Buehler, Markus J

    2011-01-01

    Materials in biology span all the scales from Angstroms to meters and typically consist of complex hierarchical assemblies of simple building blocks. Here we review an application of category theory to describe structural and resulting functional properties of biological protein materials by developing so-called ologs. An olog is like a "concept web" or "semantic network" except that it follows a rigorous mathematical formulation based on category theory. This key difference ensures that an olog is unambiguous, highly adaptable to evolution and change, and suitable for sharing concepts with other ologs. We consider a simple example of an alpha-helical and an amyloid-like protein filament subjected to axial extension and develop an olog representation of their structural and resulting mechanical properties. We also construct a representation of a social network in which people send text-messages to their nearest neighbors and act as a team to perform a task. We show that the olog for the protein and the olog f...

  8. Flexible Sensor Network Reprogramming for Logistics

    NARCIS (Netherlands)

    Evers, L.; Havinga, P.J.M.; Kuper, J.

    2007-01-01

    Besides the currently realized applications, Wireless Sensor Networks can be put to use in logistics processes. However, doing so requires a level of flexibility and safety not provided by the current WSN software platforms. This paper discusses a logistics scenario, and presents SensorScheme, a run

  9. Ultra-wideband radar sensors and networks

    Science.gov (United States)

    Leach, Jr., Richard R; Nekoogar, Faranak; Haugen, Peter C

    2013-08-06

    Ultra wideband radar motion sensors strategically placed in an area of interest communicate with a wireless ad hoc network to provide remote area surveillance. Swept range impulse radar and a heart and respiration monitor combined with the motion sensor further improves discrimination.

  10. Sensor Networks in the Low Lands

    NARCIS (Netherlands)

    Meratnia, Nirvana; Zwaag, van der Berend Jan; Dijk, van Hylke W.; Bijwaard, Dennis J.A.; Havinga, Paul J.M.

    2010-01-01

    This paper provides an overview of scientific and industrial developments of the last decade in the area of sensor networks in The Netherlands (Low Lands). The goal is to highlight areas in which the Netherlands has made most contributions and is currently a dominant player in the field of sensor ne

  11. Lifetime Analysis of Reliable Wireless Sensor Networks

    NARCIS (Netherlands)

    Baydere, S.; Safkan, Y.; Durmaz Incel, O.

    2005-01-01

    A wireless sensor network is comprised of a large number of battery-limited sensor nodes communicating with unreliable radio links. The nodes are deployed in an ad hoc fashion and a reverse multicast tree is formed in the target domain. The sink node disseminates a query and collects responses from

  12. Current Trends in Wireless Sensor Network Design

    OpenAIRE

    Neha Jain; Agrawal, Dharma P.

    2005-01-01

    The self-organizing nature of sensor networks, their autonomous operation and potential architectural alternatives make them suitable for different data-centric applications. Their wider acceptance seems to be rising on the horizon. In this article, we present an overview of the current state of the art in the field of wireless sensor networks. We also present various open research issues and provide an insight about the latest developments that need to be explored in greater depth that could...

  13. Sensor Network Design for Nonlinear Processes

    Institute of Scientific and Technical Information of China (English)

    李博; 陈丙珍

    2003-01-01

    This paper presents a method to design a cost-optimal nonredundant sensor network to observe all variables in a general nonlinear process. A mixed integer linear programming model was used to minimize the cost with data classification to check the observability of all unmeasured variables. This work is a starting point for designing sensor networks for general nonlinear processes based on various criteria, such as reliability and accuracy.

  14. The use of Wireless Sensor Network for increasing airport security

    Directory of Open Access Journals (Sweden)

    Jakub Kraus

    2013-11-01

    Full Text Available This article focuses on the use of wireless sensor networks for airport security, respectively using sensor networks as a replacement or add-on to existing security measures. The article describes the sensor network and its possible application to various airport objects and financial analysis of the perimeter security with wireless sensor network.

  15. Artificial intelligence based event detection in wireless sensor networks

    NARCIS (Netherlands)

    Bahrepour, M.

    2013-01-01

    Wireless sensor networks (WSNs) are composed of large number of small, inexpensive devices, called sensor nodes, which are equipped with sensing, processing, and communication capabilities. While traditional applications of wireless sensor networks focused on periodic monitoring, the focus of more

  16. Ocean current mapping using networked distributed sensors

    Science.gov (United States)

    Huang, Chen-Fen; Yang, T. C.; Liu, Jin-Yuan; Burchfield, Tom; Schindall, Jeff

    2012-11-01

    Distributed underwater sensors are expected to provide environmental (oceanographic) monitoring over large areas. As fabrication technology advances, low cost sensors will be available for many applications. The sensors communicate to each other and are networked using acoustic communications. This paper proposes a method for ocean current tomography using distributed networked sensors and presents preliminary experimental results by this approach. Conventional acoustic tomography uses the acoustic sensors distributed on the periphery of an area of interest. Environmental reconstruction requires solving a challenging high dimensional inverse problem, typically requiring substantial computational effort. Given distributed sensors, currents can be constructed locally based on data from neighboring sensors. It is shown using simulated data that results obtained by the proposed method are similar to those obtained by a conventional tomographic method based on peripheral sensors. In addition, one finds that the distributed sensors consume much less energy than that by the conventional tomographic approach. An acoustic communication and networking experiment was conducted near the Sizihwan Bay in Kaohsiung, Taiwan, in May 2011. The communication signals are analyzed to measure currents as a function of space and time. The procedure is simple and can be implemented in real-time using in-buoy processing.

  17. Network Management Framework for Wireless Sensor Networks

    Science.gov (United States)

    Kim, Jaewoo; Jeon, Hahnearl; Lee, Jaiyong

    Network Management is the process of managing, monitoring, and controlling the network. Conventional network management was based on wired network which is heavy and unsuitable for resource constrained WSNs. WSNs can have large scale network and it is impossible to manage each node individually. Also, polling mechanism of Simple Network Management Protocol (SNMP) impose heavy management traffic overhead. Since management messages consume resources of WSNs, it can affect the performance of the network. Therefore, it is necessary for WSNs to perform energy efficient network management. In this paper, we will propose network management framework. We will introduce cluster-based network management architecture, and classify the Management Information Base (MIB) according to their characteristics. Then, we will define management messages and message exchange operation for each kind of MIB. The analysis result of the management overhead indicates that the proposed framework can reduce management traffic compared to polling mechanism.

  18. Handbook of sensor networks compact wireless and wired sensing systems

    CERN Document Server

    Ilyas, Mohammad

    2004-01-01

    INTRODUCTION Opportunities and Challenges in Wireless Sensor Networks, M. Haenggi, Next Generation Technologies to Enable Sensor Networks, J. I.  Goodman, A. I. Reuther, and D. R. Martinez Sensor Networks Management, L. B. Ruiz, J. M. Nogueira, and A. A. F. Loureiro Models for Programmability in Sensor Networks, A. Boulis Miniaturizing Sensor Networks with MEMS, Brett Warneke A Taxonomy of Routing Techniques in Wireless Sensor Networks, J. N. Al-Karaki and A. E. Kamal Artificial Perceptual Systems, A. Loutfi, M. Lindquist, and P. Wide APPLICATIONS Sensor Network Architecture and Appl

  19. Low-Power Wireless Sensor Network Infrastructures

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg

    environments and communication primitives in wireless sensor network and traditional network development are closing. However, fundamental differences in wireless technology and energy constraints are still to be considered at the lower levels of the software stack. To fulfill energy requirements hardware......Advancements in wireless communication and electronics improving form factor and hardware capabilities has expanded the applicability of wireless sensor networks. Despite these advancements, devices are still limited in terms of energy which creates the need for duty-cycling and low-power protocols......, and network management which enables construction of low-power wireless sensor network applications. More specifically, these services are designed with the extreme low-power scenarios of the SensoByg project in mind and are implemented as follows. First, low-power communication is implemented with Auto...

  20. A Survey on Wireless Sensor Network Security

    CERN Document Server

    Sen, Jaydip

    2010-01-01

    Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed nature of these networks and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. This problem is more critical if the network is deployed for some mission-critical applications such as in a tactical battlefield. Random failure of nodes is also very likely in real-life deployment scenarios. Due to resource constraints in the sensor nodes, traditional security mechanisms with large overhead of computation and communication are infeasible in WSNs. Security in sensor networks is, therefore, a particularly challenging task. This paper discusses the current state of the art in security mechanisms for WSNs. Various types of attacks are discussed and their countermeasures presented. A brief discussion on the future direction of research in WSN security is also included.

  1. Spectral characterization of hierarchical network modularity and limits of modularity detection.

    Directory of Open Access Journals (Sweden)

    Somwrita Sarkar

    Full Text Available Many real world networks are reported to have hierarchically modular organization. However, there exists no algorithm-independent metric to characterize hierarchical modularity in a complex system. The main results of the paper are a set of methods to address this problem. First, classical results from random matrix theory are used to derive the spectrum of a typical stochastic block model hierarchical modular network form. Second, it is shown that hierarchical modularity can be fingerprinted using the spectrum of its largest eigenvalues and gaps between clusters of closely spaced eigenvalues that are well separated from the bulk distribution of eigenvalues around the origin. Third, some well-known results on fingerprinting non-hierarchical modularity in networks automatically follow as special cases, threreby unifying these previously fragmented results. Finally, using these spectral results, it is found that the limits of detection of modularity can be empirically established by studying the mean values of the largest eigenvalues and the limits of the bulk distribution of eigenvalues for an ensemble of networks. It is shown that even when modularity and hierarchical modularity are present in a weak form in the network, they are impossible to detect, because some of the leading eigenvalues fall within the bulk distribution. This provides a threshold for the detection of modularity. Eigenvalue distributions of some technological, social, and biological networks are studied, and the implications of detecting hierarchical modularity in real world networks are discussed.

  2. Hierarchical Structure, Disassortativity and Information Measures of the US Flight Network

    Institute of Scientific and Technical Information of China (English)

    WANG Ru; CAI Xu

    2005-01-01

    @@ We investigate the mixing structure of directed and evolutionary US flight network. It is shown that such a network is a hierarchical network, with average assortativity coefficient -0.37. Application of the informationbased method that can give the same result provides a way to explore the structure of complex networks.

  3. Wireless sensor networks in a maritime environment

    Science.gov (United States)

    Kavelaars, W.; Maris, M.

    2005-10-01

    In the recent years, there has been a lot of research on sensor networks and their applications. In particular for monitoring large and potentially hostile areas these networks have proven to be very useful. The technique of land-based sensor networks can be extrapolated to sensing buoys at sea or in harbors. This is a novel and intriguing addition to existing maritime monitoring systems. At TNO, much research effort has gone into developing sensor networks. In this paper, the TNOdes sensor network is presented. Its practical employability is demonstrated in a surveillance application deploying 50 nodes. The system is capable of tracking persons in a field, as would be the situation around a military compound. A camera-system is triggered by the sensors and zooms into the detected moving objects. It is described how this system could be modified to create a wireless buoys network. Typical applications of a wireless (and potentially mobile) buoy network are bay-area surveillance, mine detection, identification and ship protection.

  4. Secure adaptive topology control for wireless ad-hoc sensor networks.

    Science.gov (United States)

    Hsueh, Ching-Tsung; Li, Yu-Wei; Wen, Chih-Yu; Ouyang, Yen-Chieh

    2010-01-01

    This paper presents a secure decentralized clustering algorithm for wireless ad-hoc sensor networks. The algorithm operates without a centralized controller, operates asynchronously, and does not require that the location of the sensors be known a priori. Based on the cluster-based topology, secure hierarchical communication protocols and dynamic quarantine strategies are introduced to defend against spam attacks, since this type of attacks can exhaust the energy of sensor nodes and will shorten the lifetime of a sensor network drastically. By adjusting the threshold of infected percentage of the cluster coverage, our scheme can dynamically coordinate the proportion of the quarantine region and adaptively achieve the cluster control and the neighborhood control of attacks. Simulation results show that the proposed approach is feasible and cost effective for wireless sensor networks.

  5. Planning and Scheduling for Environmental Sensor Networks

    Science.gov (United States)

    Frank, J. D.

    2005-12-01

    Environmental Sensor Networks are a new way of monitoring the environment. They comprise autonomous sensor nodes in the environment that record real-time data, which is retrieved, analyzed, integrated with other data sets (e.g. satellite images, GIS, process models) and ultimately lead to scientific discoveries. Sensor networks must operate within time and resource constraints. Sensors have limited onboard memory, energy, computational power, communications windows and communications bandwidth. The value of data will depend on when, where and how it was collected, how detailed the data is, how long it takes to integrate the data, and how important the data was to the original scientific question. Planning and scheduling of sensor networks is necessary for effective, safe operations in the face of these constraints. For example, power bus limitations may preclude sensors from simultaneously collecting data and communicating without damaging the sensor; planners and schedulers can ensure these operations are ordered so that they do not happen simultaneously. Planning and scheduling can also ensure best use of the sensor network to maximize the value of collected science data. For example, if data is best recorded using a particular camera angle but it is costly in time and energy to achieve this, planners and schedulers can search for times when time and energy are available to achieve the optimal camera angle. Planning and scheduling can handle uncertainty in the problem specification; planners can be re-run when new information is made available, or can generate plans that include contingencies. For example, if bad weather may prevent the collection of data, a contingent plan can check lighting conditions and turn off data collection to save resources if lighting is not ideal. Both mobile and immobile sensors can benefit from planning and scheduling. For example, data collection on otherwise passive sensors can be halted to preserve limited power and memory

  6. Resolution of Singularities Introduced by Hierarchical Structure in Deep Neural Networks.

    Science.gov (United States)

    Nitta, Tohru

    2016-06-30

    We present a theoretical analysis of singular points of artificial deep neural networks, resulting in providing deep neural network models having no critical points introduced by a hierarchical structure. It is considered that such deep neural network models have good nature for gradient-based optimization. First, we show that there exist a large number of critical points introduced by a hierarchical structure in deep neural networks as straight lines, depending on the number of hidden layers and the number of hidden neurons. Second, we derive a sufficient condition for deep neural networks having no critical points introduced by a hierarchical structure, which can be applied to general deep neural networks. It is also shown that the existence of critical points introduced by a hierarchical structure is determined by the rank and the regularity of weight matrices for a specific class of deep neural networks. Finally, two kinds of implementation methods of the sufficient conditions to have no critical points are provided. One is a learning algorithm that can avoid critical points introduced by the hierarchical structure during learning (called avoidant learning algorithm). The other is a neural network that does not have some critical points introduced by the hierarchical structure as an inherent property (called avoidant neural network).

  7. DATA-CENTRIC ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS: A SURVEY

    Directory of Open Access Journals (Sweden)

    Raj Kumar Mondal

    2015-11-01

    Full Text Available This survey paper is more focused and can serve those who like to overall concept about all data centric routing for wireless sensor networks. To the best of our knowledge, our paper is the first work to make a classification of routing protocols in sensor networks. Sensor networks are classified by considering several architectural factors such as network dynamics, data aggregations, node capabilities and the data delivery model. Such classification is helpful for a designer to select the appropriate infrastructure for his/her application. Our work is a dedicated study of different data centric routing protocol. Wireless sensor network (WSN consists of small and low-cost sensor nodes with capability of sensing various types of physical and environmental conditions, data processing and wireless communication. Routing in sensor networks is very challenging, due to several characteristics that distinguish them from contemporary communication and wireless ad-hoc networks. Many new goal and data-oriented algorithms have been proposed for the problem of routing data in sensor networks. Most routing protocols can be classified as data-centric, hierarchical and location-based. Data-centric protocols are query-based and depend on the naming of desired data and also do some aggregation and reduction of data in order to save energy. Hierarchical protocols aim at clustering the nodes. Location-based protocols utilize the position information to relay the data to the desired regions. In this paper, we give a survey of data-centric routing protocols for Wireless Sensor Network and compare their strengths and limitations. We also highlight the advantages and performance issues of each routing technique.

  8. DATA-CENTRIC ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS: A SURVEY

    Directory of Open Access Journals (Sweden)

    Raj Kumar Mondal

    2014-02-01

    Full Text Available This survey paper is more focused and can serve those who like to overall concept about all data centric routing for wireless sensor networks. To the best of our knowledge, our paper is the first work to make a classification of routing protocols in sensor networks. Sensor networks are classified by considering several architectural factors such as network dynamics, data aggregations, node capabilities and the data delivery model. Such classification is helpful for a designer to select the appropriate infrastructure for his/her application. Our work is a dedicated study of different data centric routing protocol. Wireless sensor network (WSN consists of small and low-cost sensor nodes with capability of sensing various types of physical and environmental conditions, data processing and wireless communication . Routing in sensor networks is very challenging, due to several characteristics that distinguish them from contemporary communication and wireless ad-hoc networks. Many new goal and data-oriented algorithms have been proposed for the problem of routing data in sensor networks. Most routing protocols can be classified as data-centric, hierarchical and location-based. Data-centric protocols are query-based and depend on the naming of desired data and also do some aggregation and reduction of data in order to save energy. Hierarchical protocols aim at clustering the nodes. Location-based protocols utilize the position information to relay the data to the desired regions. In this paper, we give a survey of data-centric routing protocols for Wireless Sensor Network and compare their strengths and limitations. We also highlight the advantages and performance issues of each routing technique.

  9. JSC Wireless Sensor Network Update

    Science.gov (United States)

    Wagner, Robert

    2010-01-01

    Sensor nodes composed of three basic components... radio module: COTS radio module implementing standardized WSN protocol; treated as WSN modem by main board main board: contains application processor (TI MSP430 microcontroller), memory, power supply; responsible for sensor data acquisition, pre-processing, and task scheduling; re-used in every application with growing library of embedded C code sensor card: contains application-specific sensors, data conditioning hardware, and any advanced hardware not built into main board (DSPs, faster A/D, etc.); requires (re-) development for each application.

  10. Curvature of Indoor Sensor Network: Clustering Coefficient

    Directory of Open Access Journals (Sweden)

    2009-03-01

    Full Text Available We investigate the geometric properties of the communication graph in realistic low-power wireless networks. In particular, we explore the concept of the curvature of a wireless network via the clustering coefficient. Clustering coefficient analysis is a computationally simplified, semilocal approach, which nevertheless captures such a large-scale feature as congestion in the underlying network. The clustering coefficient concept is applied to three cases of indoor sensor networks, under varying thresholds on the link packet reception rate (PRR. A transition from positive curvature (“meshed” network to negative curvature (“core concentric” network is observed by increasing the threshold. Even though this paper deals with network curvature per se, we nevertheless expand on the underlying congestion motivation, propose several new concepts (network inertia and centroid, and finally we argue that greedy routing on a virtual positively curved network achieves load balancing on the physical network.

  11. Wireless Sensor Network for Wearable Physiological Monitoring

    Directory of Open Access Journals (Sweden)

    P. S. Pandian

    2008-05-01

    Full Text Available Wearable physiological monitoring system consists of an array of sensors embedded into the fabric of the wearer to continuously monitor the physiological parameters and transmit wireless to a remote monitoring station. At the remote monitoring station the data is correlated to study the overall health status of the wearer. In the conventional wearable physiological monitoring system, the sensors are integrated at specific locations on the vest and are interconnected to the wearable data acquisition hardware by wires woven into the fabric. The drawbacks associated with these systems are the cables woven in the fabric pickup noise such as power line interference and signals from nearby radiating sources and thereby corrupting the physiological signals. Also repositioning the sensors in the fabric is difficult once integrated. The problems can be overcome by the use of physiological sensors with miniaturized electronics to condition, process, digitize and wireless transmission integrated into the single module. These sensors are strategically placed at various locations on the vest. Number of sensors integrated into the fabric form a network (Personal Area Network and interacts with the human system to acquire and transmit the physiological data to a wearable data acquisition system. The wearable data acquisition hardware collects the data from various sensors and transmits the processed data to the remote monitoring station. The paper discusses wireless sensor network and its application to wearable physiological monitoring and its applications. Also the problems associated with conventional wearable physiological monitoring are discussed.

  12. Wearable Sensor Networks for Motion Capture

    Directory of Open Access Journals (Sweden)

    Dennis Arsenault

    2015-08-01

    Full Text Available This work presents the development of a full body sensor-based motion tracking system that functions through wearable inertial sensors. The system is comprised of a total of ten wearable sensors and maps the player's motions to an on-screen character in real-time. A hierarchical skeletal model was implemented that allows players to navigate and interact with the virtual world without the need of a hand-held controller. To demonstrate the capabilities of the system, a simple virtual reality game was created. As a wearable system, the ability for the users to engage in activities while not being tied to a camera system, or being forced indoors presents a significant opportunity for mobile entertainment, augmented reality and interactive systems that use the body as a significant form of input. This paper outlines the key developments necessary to implement such a system.

  13. Fault Reconnaissance Agent for Sensor Networks

    Directory of Open Access Journals (Sweden)

    Elhadi M. Shakshuki

    2010-01-01

    Full Text Available One of the key prerequisite for a scalable, effective and efficient sensor network is the utilization of low-cost, low-overhead and high-resilient fault-inference techniques. To this end, we propose an intelligent agent system with a problem solving capability to address the issue of fault inference in sensor network environments. The intelligent agent system is designed and implemented at base-station side. The core of the agent system – problem solver – implements a fault-detection inference engine which harnesses Expectation Maximization (EM algorithm to estimate fault probabilities of sensor nodes. To validate the correctness and effectiveness of the intelligent agent system, a set of experiments in a wireless sensor testbed are conducted. The experimental results show that our intelligent agent system is able to precisely estimate the fault probability of sensor nodes.

  14. A Tool for Fast Development of Modular and Hierarchic Neural Network-based Systems

    Directory of Open Access Journals (Sweden)

    Francisco Reinaldo

    2006-08-01

    Full Text Available This paper presents PyramidNet tool as a fast and easy way to develop Modular and Hierarchic Neural Network-based Systems. This tool facilitates the fast emergence of autonomous behaviors in agents because it uses a hierarchic and modular control methodology of heterogeneous learning modules: the pyramid. Using the graphical resources of PyramidNet the user is able to specify a behavior system even having little understanding of artificial neural networks. Experimental tests have shown that a very significant speedup is attained in the development of modular and hierarchic neural network-based systems by using this tool.

  15. Hierarchical graph-based segmentation for extracting road networks from high-resolution satellite images

    Science.gov (United States)

    Alshehhi, Rasha; Marpu, Prashanth Reddy

    2017-04-01

    Extraction of road networks in urban areas from remotely sensed imagery plays an important role in many urban applications (e.g. road navigation, geometric correction of urban remote sensing images, updating geographic information systems, etc.). It is normally difficult to accurately differentiate road from its background due to the complex geometry of the buildings and the acquisition geometry of the sensor. In this paper, we present a new method for extracting roads from high-resolution imagery based on hierarchical graph-based image segmentation. The proposed method consists of: 1. Extracting features (e.g., using Gabor and morphological filtering) to enhance the contrast between road and non-road pixels, 2. Graph-based segmentation consisting of (i) Constructing a graph representation of the image based on initial segmentation and (ii) Hierarchical merging and splitting of image segments based on color and shape features, and 3. Post-processing to remove irregularities in the extracted road segments. Experiments are conducted on three challenging datasets of high-resolution images to demonstrate the proposed method and compare with other similar approaches. The results demonstrate the validity and superior performance of the proposed method for road extraction in urban areas.

  16. Securing Wireless Sensor Networks: Security Architectures

    Directory of Open Access Journals (Sweden)

    David Boyle

    2008-01-01

    Full Text Available Wireless sensor networking remains one of the most exciting and challenging research domains of our time. As technology progresses, so do the capabilities of sensor networks. Limited only by what can be technologically sensed, it is envisaged that wireless sensor networks will play an important part in our daily lives in the foreseeable future. Privy to many types of sensitive information, both sensed and disseminated, there is a critical need for security in a number of applications related to this technology. Resulting from the continuous debate over the most effective means of securing wireless sensor networks, this paper considers a number of the security architectures employed, and proposed, to date, with this goal in sight. They are presented such that the various characteristics of each protocol are easily identifiable to potential network designers, allowing a more informed decision to be made when implementing a security protocol for their intended application. Authentication is the primary focus, as the most malicious attacks on a network are the work of imposters, such as DOS attacks, packet insertion etc. Authentication can be defined as a security mechanism, whereby, the identity of a node in the network can be identified as a valid node of the network. Subsequently, data authenticity can be achieved; once the integrity of the message sender/receiver has been established.

  17. Bridge monitoring using heterogeneous wireless sensor network

    Science.gov (United States)

    Haran, Shivan; Kher, Shubhalaxmi; Mehndiratta, Vandana

    2010-03-01

    Wireless sensor networks (WSN) are proving to be a good fit where real time monitoring of multiple physical parameters is required. In many applications such as structural health monitoring, patient data monitoring, traffic accident monitoring and analysis, sensor networks may involve interface with conventional P2P systems and it is challenging to handle heterogeneous network systems. Heterogeneous deployments will become increasingly prevalent as it allows for systems to seamlessly integrate and interoperate especially when it comes to applications involving monitoring of large infrastructures. Such networks may have wireless sensor network overlaid on a conventional computer network to pick up data from one distant location and carry out the analysis after relaying it over to another distant location. This paper discusses monitoring of bridges using WSN. As a test bed, a heterogeneous network of WSN and conventional P2P together with a combination of sensing devices (including vibration and strain) is to be used on a bridge model. Issues related to condition assessment of the bridge for situations including faults, overloads, etc., as well as analysis of network and system performance will be discussed. When conducted under controlled conditions, this is an important step towards fine tuning the monitoring system for recommendation of permanent mounting of sensors and collecting data that can help in the development of new methods for inspection and evaluation of bridges. The proposed model, design, and issues therein will be discussed, along with its implementation and results.

  18. A simulation model for the lifetime of wireless sensor networks

    CERN Document Server

    Elleithy, Abdelrahman

    2012-01-01

    In this paper we present a model for the lifetime of wireless sensor networks. The model takes into consideration several parameters such as the total number of sensors, network size, percentage of sink nodes, location of sensors, the mobility of sensors, and power consumption. A definition of the life time of the network based on three different criteria is introduced; percentage of available power to total power, percentage of alive sensors to total sensors, and percentage of alive sink sensors to total sink sensors. A Matlab based simulator is developed for the introduced model. A number of wireless sensor networks scenarios are presented and discussed.

  19. Sensor Deployment for Network-like Environments

    CERN Document Server

    Greco, Luca; Piccoli, Benedetto

    2010-01-01

    This paper considers the problem of optimally deploying omnidirectional sensors, with potentially limited sensing radius, in a network-like environment. This model provides a compact and effective description of complex environments as well as a proper representation of road or river networks. We present a two-step procedure based on a discrete-time gradient ascent algorithm to find a local optimum for this problem. The first step performs a coarse optimization where sensors are allowed to move in the plane, to vary their sensing radius and to make use of a reduced model of the environment called collapsed network. It is made up of a finite discrete set of points, barycenters, produced by collapsing network edges. Sensors can be also clustered to reduce the complexity of this phase. The sensors' positions found in the first step are then projected on the network and used in the second finer optimization, where sensors are constrained to move only on the network. The second step can be performed on-line, in a ...

  20. Model-driven SOA for sensor networks

    Science.gov (United States)

    Ibbotson, John; Gibson, Christopher; Geyik, Sahin; Szymanski, Boleslaw K.; Mott, David; Braines, David; Klapiscak, Tom; Bergamaschi, Flavio

    2011-06-01

    Our previous work has explored the application of enterprise middleware techniques at the edge of the network to address the challenges of delivering complex sensor network solutions over heterogeneous communications infrastructures. In this paper, we develop this approach further into a practicable, semantically rich, model-based design and analysis approach that considers the sensor network and its contained services as a service-oriented architecture. The proposed model enables a systematic approach to service composition, analysis (using domain-specific techniques), and deployment. It also enables cross intelligence domain integration to simplify intelligence gathering, allowing users to express queries in structured natural language (Controlled English).

  1. Analyzing Multimode Wireless Sensor Networks Using the Network Calculus

    Directory of Open Access Journals (Sweden)

    Xi Jin

    2015-01-01

    Full Text Available The network calculus is a powerful tool to analyze the performance of wireless sensor networks. But the original network calculus can only model the single-mode wireless sensor network. In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. There are two combined methods A-MM and N-MM. The method A-MM models the whole network as a multimode component, and the method N-MM models each node as a multimode component. We prove that the maximum delay bound computed by the method A-MM is tighter than or equal to that computed by the method N-MM. Experiments show that our proposed methods can significantly decrease the analytical delay bound comparing with the separate flow analysis method. For the large-scale wireless sensor network with 32 thousands of sensor nodes, our proposed methods can decrease about 70% of the analytical delay bound.

  2. SO2 Emissions in China - Their Network and Hierarchical Structures

    Science.gov (United States)

    Yan, Shaomin; Wu, Guang

    2017-04-01

    SO2 emissions lead to various harmful effects on environment and human health. The SO2 emission in China has significant contribution to the global SO2 emission, so it is necessary to employ various methods to study SO2 emissions in China with great details in order to lay the foundation for policymaking to improve environmental conditions in China. Network analysis is used to analyze the SO2 emissions from power generation, industrial, residential and transportation sectors in China for 2008 and 2010, which are recently available from 1744 ground surface monitoring stations. The results show that the SO2 emissions from power generation sector were highly individualized as small-sized clusters, the SO2 emissions from industrial sector underwent an integration process with a large cluster contained 1674 places covering all industrial areas in China, the SO2 emissions from residential sector was not impacted by time, and the SO2 emissions from transportation sector underwent significant integration. Hierarchical structure is obtained by further combining SO2 emissions from all four sectors and is potentially useful to find out similar patterns of SO2 emissions, which can provide information on understanding the mechanisms of SO2 pollution and on designing different environmental measure to combat SO2 emissions.

  3. Hierarchical Artificial Bee Colony Algorithm for RFID Network Planning Optimization

    Directory of Open Access Journals (Sweden)

    Lianbo Ma

    2014-01-01

    Full Text Available This paper presents a novel optimization algorithm, namely, hierarchical artificial bee colony optimization, called HABC, to tackle the radio frequency identification network planning (RNP problem. In the proposed multilevel model, the higher-level species can be aggregated by the subpopulations from lower level. In the bottom level, each subpopulation employing the canonical ABC method searches the part-dimensional optimum in parallel, which can be constructed into a complete solution for the upper level. At the same time, the comprehensive learning method with crossover and mutation operators is applied to enhance the global search ability between species. Experiments are conducted on a set of 10 benchmark optimization problems. The results demonstrate that the proposed HABC obtains remarkable performance on most chosen benchmark functions when compared to several successful swarm intelligence and evolutionary algorithms. Then HABC is used for solving the real-world RNP problem on two instances with different scales. Simulation results show that the proposed algorithm is superior for solving RNP, in terms of optimization accuracy and computation robustness.

  4. Wireless Sensor Networks for Ambient Assisted Living

    Directory of Open Access Journals (Sweden)

    Raúl Aquino-Santos

    2013-11-01

    Full Text Available This paper introduces wireless sensor networks for Ambient Assisted Living as a proof of concept. Our workgroup has developed an arrhythmia detection algorithm that we evaluate in a closed space using a wireless sensor network to relay the information collected to where the information can be registered, monitored and analyzed to support medical decisions by healthcare providers. The prototype we developed is then evaluated using the TelosB platform. The proposed architecture considers very specific restrictions regarding the use of wireless sensor networks in clinical situations. The seamless integration of the system architecture enables both mobile node and network configuration, thus providing the versatile and robust characteristics necessary for real-time applications in medical situations. Likewise, this system architecture efficiently permits the different components of our proposed platform to interact efficiently within the parameters of this study.

  5. Adaptive computational resource allocation for sensor networks

    Institute of Scientific and Technical Information of China (English)

    WANG Dian-hong; FEI E; YAN Yu-jie

    2008-01-01

    To efficiently utilize the limited computational resource in real-time sensor networks, this paper focu-ses on the challenge of computational resource allocation in sensor networks and provides a solution with the method of economies. It designs a mieroeconomic system in which the applications distribute their computational resource consumption across sensor networks by virtue of mobile agent. Further, it proposes the market-based computational resource allocation policy named MCRA which satisfies the uniform consumption of computational energy in network and the optimal division of the single computational capacity for multiple tasks. The simula-tion in the scenario of target tracing demonstrates that MCRA realizes an efficient allocation of computational re-sources according to the priority of tasks, achieves the superior allocation performance and equilibrium perform-ance compared to traditional allocation policies, and ultimately prolongs the system lifetime.

  6. Low-Power Wireless Sensor Network Infrastructures

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg

    , and network management which enables construction of low-power wireless sensor network applications. More specifically, these services are designed with the extreme low-power scenarios of the SensoByg project in mind and are implemented as follows. First, low-power communication is implemented with Auto......Advancements in wireless communication and electronics improving form factor and hardware capabilities has expanded the applicability of wireless sensor networks. Despite these advancements, devices are still limited in terms of energy which creates the need for duty-cycling and low-power protocols...... in order to achieve the wanted lifetimes. Through more than a decade of wireless sensor network research, progress towards realizing wanted lifetimes have been made and wireless standards for packet formatting and routing have been proposed. With standards in place, the wide-span between programming...

  7. Secure Routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Soumyashree Sahoo

    2012-01-01

    Full Text Available Wireless sensor networks is the new concept in the field of networks consists of small, large number of sensing nodes which is having the sensing, computational and transmission power. Due to lack of tamper-resistant infrastructure and the insecure nature of wireless communication channels, these networks are vulnerable to internal and external attacks. Key Management is a major challenge to achieve security in wireless sensor networks. Key management includes the process of key setup, the initial distribution of keys and keys revocation. To provide security and proper routing or communication should be encrypted and authenticated. It is not easy to achieve secure key establishment without public key cryptography. In this thesis, some key management schemes have been purposed which will be valuable for secure routing between different sensor nodes.

  8. Automatic decision support in heterogeneous sensor networks

    Science.gov (United States)

    Kozma, Robert; Tanigawa, Timothy; Furxhi, Orges; Consul, Sergi

    2012-06-01

    There is a need to model complementary aspects of various data channels in distributed sensor networks in order to provide efficient tools of decision support in rapidly changing, dynamic real life scenarios. Our aim is to develop an autonomous cyber-sensing system that supports decision support based on the integration of information from diverse sensory channels. Target scenarios include dismounts performing various peaceful and/or potentially malicious activities. The studied test bed includes Ku band high bandwidth radar for high resolution range data and K band low bandwidth radar for high Doppler resolution data. We embed the physical sensor network in cyber network domain to achieve robust and resilient operation in adversary conditions. We demonstrate the operation of the integrated sensor system using artificial neural networks for the classification of human activities.

  9. Neural network-based sensor signal accelerator.

    Energy Technology Data Exchange (ETDEWEB)

    Vogt, M. C.

    2000-10-16

    A strategy has been developed to computationally accelerate the response time of a generic electronic sensor. The strategy can be deployed as an algorithm in a control system or as a physical interface (on an embedded microcontroller) between a slower responding external sensor and a higher-speed control system. Optional code implementations are available to adjust algorithm performance when computational capability is limited. In one option, the actual sensor signal can be sampled at the slower rate with adaptive linear neural networks predicting the sensor's future output and interpolating intermediate synthetic output values. In another option, a synchronized collection of predictors sequentially controls the corresponding synthetic output voltage. Error is adaptively corrected in both options. The core strategy has been demonstrated with automotive oxygen sensor data. A prototype interface device is under construction. The response speed increase afforded by this strategy could greatly offset the cost of developing a replacement sensor with a faster physical response time.

  10. Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems

    CERN Document Server

    Rosvall, M

    2010-01-01

    To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation that reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between compression and pattern detection; by compressing a description of a random walker as a proxy for real flow on a network, we find regularities in the network that induce this system-wide flow. Finding the shortest multilevel description of the random walker therefore gives us the best hierarchical clustering of the network, the optimal number of levels and modular partition at each level, with respect to the dynamics on the network. With a novel search algorithm, we extract and illustrate the rich multilevel organization of several large social and biological networks. For example, from the global air traffic network we uncover countries and continents, and from the pattern of scientific communication we reveal more than 100 scientific fields organized in four major disciplines:...

  11. ENERGY EFFICIENCY AND ROUTING IN SENSOR NETWORKS

    DEFF Research Database (Denmark)

    Cetin, Bilge Kartal

    for dierent network parameters is de- veloped by considering a duty-cycling mechanism in the network. Upper bound on network lifetime is sought by considering idle and sleep mode energy consumption as well as energy consumption in transmission and reception for sensor networks. The solution of the developed...... optimization problems gives an analytical benchmark for designing of maximum lifetime routing algorithms by giving the most energy balanced trac allocation between the possible routes in the network by considering a duty-cycling mechanism. Lastly, an energy ecient routing protocol is proposed and evaluated...

  12. Target Coverage in Wireless Sensor Networks with Probabilistic Sensors.

    Science.gov (United States)

    Shan, Anxing; Xu, Xianghua; Cheng, Zongmao

    2016-08-27

    Sensing coverage is a fundamental problem in wireless sensor networks (WSNs), which has attracted considerable attention. Conventional research on this topic focuses on the 0/1 coverage model, which is only a coarse approximation to the practical sensing model. In this paper, we study the target coverage problem, where the objective is to find the least number of sensor nodes in randomly-deployed WSNs based on the probabilistic sensing model. We analyze the joint detection probability of target with multiple sensors. Based on the theoretical analysis of the detection probability, we formulate the minimum ϵ-detection coverage problem. We prove that the minimum ϵ-detection coverage problem is NP-hard and present an approximation algorithm called the Probabilistic Sensor Coverage Algorithm (PSCA) with provable approximation ratios. To evaluate our design, we analyze the performance of PSCA theoretically and also perform extensive simulations to demonstrate the effectiveness of our proposed algorithm.

  13. Multiple dynamical time-scales in networks with hierarchically nested modular organization

    Indian Academy of Sciences (India)

    Sitabhra Sinha; Swarup Poria

    2011-11-01

    Many natural and engineered complex networks have intricate mesoscopic organization, e.g., the clustering of the constituent nodes into several communities or modules. Often, such modularity is manifested at several different hierarchical levels, where the clusters defined at one level appear as elementary entities at the next higher level. Using a simple model of a hierarchical modular network, we show that such a topological structure gives rise to characteristic time-scale separation between dynamics occurring at different levels of the hierarchy. This generalizes our earlier result for simple modular networks, where fast intramodular and slow intermodular processes were clearly distinguished. Investigating the process of synchronization of oscillators in a hierarchical modular network, we show the existence of as many distinct time-scales as there are hierarchical levels in the system. This suggests a possible functional role of such mesoscopic organization principle in natural systems, viz., in the dynamical separation of events occurring at different spatial scales.

  14. Loss Performance Modeling for Hierarchical Heterogeneous Wireless Networks With Speed-Sensitive Call Admission Control

    DEFF Research Database (Denmark)

    Huang, Qian; Huang, Yue-Cai; Ko, King-Tim;

    2011-01-01

    dimensioning and planning. This paper investigates the computationally efficient loss performance modeling for multiservice in hierarchical heterogeneous wireless networks. A speed-sensitive call admission control (CAC) scheme is considered in our model to assign overflowed calls to appropriate tiers...

  15. Optical network of silicon micromachined sensors

    Science.gov (United States)

    Wilson, Mark L.; Burns, David W.; Zook, J. David

    1996-03-01

    The Honeywell Technology Center, in collaboration with the University of Wisconsin and the Mobil Corporation, and under funding from this ARPA sponsored program, are developing a new type of `hybrid' micromachined silicon/fiber optic sensor that utilizes the best attributes of each technology. Fiber optics provide a noise free method to read out the sensor without electrical power required at the measurement point. Micromachined silicon sensor techniques provide a method to design many different types of sensors such as temperature, pressure, acceleration, or magnetic field strength and report the sensor data using FDM methods. Our polysilicon resonant microbeam structures have a built in Fabry-Perot interferometer that offers significant advantages over other configurations described in the literature. Because the interferometer is an integral part of the structure, the placement of the fiber becomes non- critical, and packaging issues become considerably simpler. The interferometer spacing are determined by the thin-film fabrication processes and therefore can be extremely well controlled. The main advantage, however, is the integral vacuum cavity that ensures high Q values. Testing results have demonstrated relaxed alignment tolerances in packaging these devices, with an excellent Signal to Noise Ratio. Networks of 16 or more sensors are currently being developed. STORM (Strain Transduction by Optomechanical Resonant Microbeams) sensors can also provide functionality and self calibration information which can be used to improve the overall system reliability. Details of the sensor and network design, as well as test results, are presented.

  16. Autonomous vision networking: miniature wireless sensor networks with imaging technology

    Science.gov (United States)

    Messinger, Gioia; Goldberg, Giora

    2006-09-01

    The recent emergence of integrated PicoRadio technology, the rise of low power, low cost, System-On-Chip (SOC) CMOS imagers, coupled with the fast evolution of networking protocols and digital signal processing (DSP), created a unique opportunity to achieve the goal of deploying large-scale, low cost, intelligent, ultra-low power distributed wireless sensor networks for the visualization of the environment. Of all sensors, vision is the most desired, but its applications in distributed sensor networks have been elusive so far. Not any more. The practicality and viability of ultra-low power vision networking has been proven and its applications are countless, from security, and chemical analysis to industrial monitoring, asset tracking and visual recognition, vision networking represents a truly disruptive technology applicable to many industries. The presentation discusses some of the critical components and technologies necessary to make these networks and products affordable and ubiquitous - specifically PicoRadios, CMOS imagers, imaging DSP, networking and overall wireless sensor network (WSN) system concepts. The paradigm shift, from large, centralized and expensive sensor platforms, to small, low cost, distributed, sensor networks, is possible due to the emergence and convergence of a few innovative technologies. Avaak has developed a vision network that is aided by other sensors such as motion, acoustic and magnetic, and plans to deploy it for use in military and commercial applications. In comparison to other sensors, imagers produce large data files that require pre-processing and a certain level of compression before these are transmitted to a network server, in order to minimize the load on the network. Some of the most innovative chemical detectors currently in development are based on sensors that change color or pattern in the presence of the desired analytes. These changes are easily recorded and analyzed by a CMOS imager and an on-board DSP processor

  17. A Distributed Network Mobility Management Scheme for Hierarchical Mobile IPv6 Networks

    Science.gov (United States)

    Kawano, Keita; Kinoshita, Kazuhiko; Yamai, Nariyoshi

    Route optimization for network mobility is a key technique for providing a node in a mobile network (Mobile Network Node or MNN) with high quality broadband communications. Many schemes adding route optimization function to Network Mobility (NEMO) Basic Support protocol, the standardized network mobility management protocol from the IETF nemo working group, have already been proposed in recent years. One such scheme, a scheme using Hierarchical Mobile IPv6 (HMIPv6) aims to overcome micromobility management issues as well by applying a mechanism based on HMIPv6. The traditional scheme, however, suffers from a significant number of signaling messages as the number of MNNs and/or the number of their Correspondent Nodes (CNs) increase, because many messages notifying the MNNs' Home Agents (HAMNNs) and the CNs of the mobile network's movement are generated simultaneously each time the mobile network moves to the domain of another micromobility management router (Mobility Anchor Point or MAP). This paper proposes a scheme to overcome this problem. Our scheme reduces the number of signaling messages generated at the same time by managing the mobility of MNNs using multiple MAPs distributed within a network for load sharing. The results of simulation experiments show that our scheme works efficiently compared to the traditional scheme when a mobile network has many MNNs and/or these MNNs communicate with many CNs.

  18. A COMPARATIVE STUDY IN WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    Hasan Al-Refai

    2014-02-01

    Full Text Available Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation, communication, and sensing abilities, in a battery-powered sensor network, energy and communication bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the application in order to minimize the resources consumed and extend the life of the network. In this paper, we introduce a comparative study in different routing algorithms that propose vital solutions to the most important issues that should be taken into account when designing wireless network which are reliability, lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will introduce their algorithms and discuss how did they propose to solve such of these challenges and finally we will do some evaluation to each approach.

  19. IPTV traffic management using topology-based hierarchical scheduling in Carrier Ethernet transport networks

    DEFF Research Database (Denmark)

    Yu, Hao; Yan, Ying; Berger, Michael Stubert

    2009-01-01

    of Service (QoS) provisioning abilities, which guarantee end-to-end performances of voice, video and data traffic delivered over networks. This paper introduces a topology-based hierarchical scheduler scheme, which controls the incoming traffic at the edge of the network based on the network topology...

  20. ANALYSIS OF SECURITY THREATS IN WIRELESS SENSOR NETWORK

    National Research Council Canada - National Science Library

    Sahabul Alam; Debashis De

    2014-01-01

    .... The inclusion of wireless communication technology also incurs various types of security threats due to unattended installation of sensor nodes as sensor networks may interact with sensitive data...

  1. Secure Localization and Tracking in Sensor Networks

    Science.gov (United States)

    2008-01-01

    To my parents, Yurng-Der Chang and Shiu-Mei Lee iii Biography Chih-Chieh Geoff Chang was born and raised in a beautiful resort town, Hualien, Taiwan...manufacturing and application needs. Currently, companies like Arch Rock, Crossbow, Dust Networks, Millennial Net, and Moteiv offer various types of sensor...activate one sensor node to make the measurement. This is the beauty of target tracking algorithms. Armed with the known models in (3.1) and (3.2), and

  2. Location Privacy Issues in Wireless Sensor Networks

    Science.gov (United States)

    Kůr, Jiří; Stetsko, Andriy

    We discuss location privacy issues in wireless sensor networks. We consider sensor nodes with more responsible roles and the need to protect locations of such nodes. Available countermeasures against various types of traffic analysis attacks are examined and their problems are identified. We do not propose new traffic analysis resistance technique. Instead, we draw attention to blanks in current situation and identify several open questions, which should be answered in order to ensure location privacy of nodes.

  3. Security Threats in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Giannetsos, Athanasios

    2011-01-01

    intrusions forms an important part of an integrated approach to network security. In this work, we start by considering the problem of cooperative intrusion detection in WSNs and develop a lightweight ID system, called LIDeA, which follows an intelligent agent-based architecture. We show how such a system....... Security and privacy are rapidly replacing performance as the first and foremost concern in many sensor networking scenarios. While security prevention is important, it cannot guarantee that attacks will not be launched and that, once launched, they will not be successful. Therefore, detection of malicious...... networks are. Motivated by this unexplored security aspect, we investigate a new set of memory related vulnerabilities for sensor embedded devices that, if exploited, can lead to the execution of software-based attacks. We demonstrate how to execute malware on wireless sensor nodes that are based...

  4. Time Synchronization for Mobile Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ying Guo

    2013-01-01

    Full Text Available Time synchronization is very crucial for the implementation of energy constricted underwater wireless sensor networks (UWSN. The purpose of this paper is to present a time synchronization algorithm which is suitable to UWSN. Although several time synchronization protocols have been developed, most of them tend to break down when implemented on mobile underwater sensor networks. In this paper, we analyze the effect of node mobility, and propose a Mobile Counteracted Time Synchronization approach, called “Mc-Sync”, which is a novel time synchronization scheme for mobile underwater acoustic sensor networks. It makes use of two mobile reference nodes to counteract the effect of node mobility. We also analyze and design the optimized trajectories of the two mobile reference nodes in underwater environment. We show through analysis and simulation that Mc-Sync provides much better performance than existing schemes.

  5. Smart Sensor Network System For Environment Monitoring

    Directory of Open Access Journals (Sweden)

    Javed Ali Baloch

    2012-07-01

    Full Text Available SSN (Smart Sensor Network systems could be used to monitor buildings with modern infrastructure, plant sites with chemical pollution, horticulture, natural habitat, wastewater management and modern transport system. To sense attributes of phenomena and make decisions on the basis of the sensed value is the primary goal of such systems. In this paper a Smart Spatially aware sensor system is presented. A smart system, which could continuously monitor the network to observe the functionality and trigger, alerts to the base station if a change in the system occurs and provide feedback periodically, on demand or even continuously depending on the nature of the application. The results of the simulation trials presented in this paper exhibit the performance of a Smart Spatially Aware Sensor Networks.

  6. Optical networks for wideband sensor array

    Science.gov (United States)

    Sheng, Lin Horng

    2011-12-01

    This thesis presents the realization of novel systems for optical sensing networks with an array of long-period grating (LPG) sensors. As a launching point of the thesis, the motivation to implement optical sensing network in precisely catering LPG sensors is presented. It highlights the flexibility of the sensing network to act as the foundation in order to boost the application of the various LPG sensor design in biological and chemical sensing. After the thorough study on the various optical sensing networks, sub-carrier multiplexing (SCM) and optical time division multiplexing (OTDM) schemes are adopted in conjunction with tunable laser source (TLS) to facilitate simultaneous interrogation of the LPG sensors array. In fact, these systems are distinct to have the capability to accommodate wideband optical sensors. Specifically, the LPG sensors which is in 20nm bandwidth are identified to operate in these systems. The working principles of the systems are comprehensively elucidated in this thesis. It highlights the mathematical approach to quantify the experimental setup of the optical sensing network. Additionally, the system components of the designs are identified and methodically characterized so that the components well operate in the designed environment. A mockup has been setup to demonstrate the application in sensing of various liquid indices and analyse the response of the LPG sensors in order to evaluate the performance of the systems. Eventually, the resemblance of the demultiplexed spectral response to the pristine spectral response are quantified to have excellent agreement. Finally, the promising result consistency of the systems is verified through repeatability test.

  7. Operating systems and network protocols for wireless sensor networks.

    Science.gov (United States)

    Dutta, Prabal; Dunkels, Adam

    2012-01-13

    Sensor network protocols exist to satisfy the communication needs of diverse applications, including data collection, event detection, target tracking and control. Network protocols to enable these services are constrained by the extreme resource scarcity of sensor nodes-including energy, computing, communications and storage-which must be carefully managed and multiplexed by the operating system. These challenges have led to new protocols and operating systems that are efficient in their energy consumption, careful in their computational needs and miserly in their memory footprints, all while discovering neighbours, forming networks, delivering data and correcting failures.

  8. Decentralized system identification using stochastic subspace identification for wireless sensor networks.

    Science.gov (United States)

    Cho, Soojin; Park, Jong-Woong; Sim, Sung-Han

    2015-04-08

    Wireless sensor networks (WSNs) facilitate a new paradigm to structural identification and monitoring for civil infrastructure. Conventional structural monitoring systems based on wired sensors and centralized data acquisition systems are costly for installation as well as maintenance. WSNs have emerged as a technology that can overcome such difficulties, making deployment of a dense array of sensors on large civil structures both feasible and economical. However, as opposed to wired sensor networks in which centralized data acquisition and processing is common practice, WSNs require decentralized computing algorithms to reduce data transmission due to the limitation associated with wireless communication. In this paper, the stochastic subspace identification (SSI) technique is selected for system identification, and SSI-based decentralized system identification (SDSI) is proposed to be implemented in a WSN composed of Imote2 wireless sensors that measure acceleration. The SDSI is tightly scheduled in the hierarchical WSN, and its performance is experimentally verified in a laboratory test using a 5-story shear building model.

  9. Double Barrier Coverage in Dense Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    Cheng-Dong Jiang; Guo-Liang Chen

    2008-01-01

    When a sensor network is deployed to detect objects penetrating a protected region, it is not necessary to have every point in the deployment region covered by a sensor. It is enough if the penetrating objects are detected at some point in their trajectory. If a sensor network guarantees that every penetrating object will be detected by two distinct sensors at the same time somewhere in this area, we say that the network provides double barrier coverage (DBC). In this paper, we propose a new planar structure of Sparse Delaunay Triangulation (SparseDT), and prove some elaborate attributes of it. We develop theoretical foundations for double barrier coverage, and propose efficient algorithms with NS2 simulator using which one can activate the necessary sensors to guarantee double barrier coverage while the other sensors go to sleep. The upper and lower bounds of number of active nodes are determined, and we show that high-speed target will be detected efficiently with this configuration.

  10. Lifetime Prolonging Algorithms for Underwater Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    GUO Zhong-wen; LI Zhi-wei; YU Lei

    2006-01-01

    Underwater acoustic modem technology has attained a level of maturity to support underwater acoustic sensor networks (UASNs) which are generally formed by acoustically connected sensor nodes and a surface station providing a link to an on-shore control center. While many applications require long-term monitoring of the deployment area, the battery-powered network nodes limit the lifetime of UASNs. Therefore, designing a UASN that minimizes the power consumption while maximizing lifetime becomes a very difficult task. In this paper, a method is proposed to determine the optimum number of clusters through combining an application-specific protocol architecture and underwater acoustic communication model so as to reduce the energy dissipation of UASNs. Deploying more sensor nodes which work alternately is another way to prolong the lifetime of UASNs. An algorithm is presented for selecting sensor nodes and putting them into operation in each round, ensuring the monitoring to the whole given area. The present results show that the algorithm can help prolong system lifetime remarkably when it is applied to other conventional approaches for sensor networks under the condition that the sensor node density is high.

  11. ENERGY OPTIMISATION SCHEMES FOR WIRELESS SENSOR NETWORK

    Directory of Open Access Journals (Sweden)

    Vivekanand Jha

    2012-05-01

    Full Text Available A sensor network is composed of a large number of sensor nodes, which are densely deployed either inside the phenomenon or very close to it. Sensor nodes have sensing, processing and transmitting capability . They however have limited energy and measures need to be taken to make op- timum usage of their energy and save them from task of only receiving and transmitting data without processing. Various techniques for energy utilization optimisation have been proposed Ma jor players are however clustering and relay node placement. In the research related to relay node placement, it has been proposed to deploy some relay nodes such that the sensors can transmit the sensed data to a nearby relay node, which in turn delivers the data to the base stations. In general, the relay node placement problems aim to meet certain connectivity and/or survivabil- ity requirements of the network by deploying a minimum number of relay nodes. The other approach is grouping sensor nodes into clusters with each cluster having a cluster head (CH. The CH nodes aggregate the data and transmit them to the base station (BS. These two approaches has been widely adopted by the research community to satisfy the scala- bility objective and generally achieve high energy efficiency and prolong network lifetime in large-scale WSN environments and hence are discussed here along with single hop and multi hop characteristic of sensor node.

  12. From Simple to Smart: The Development of Sensor Network

    Institute of Scientific and Technical Information of China (English)

    Ping Liu; Xunxiang Huang; Feng Liu; Lianghua Zhang

    2006-01-01

    Sensor networks have come a long way since the first point-to-point analog system. Rapid development of industrial applications imposes more challenges on traditional sensors and sensor networks. And World Wide Web browsers and object-oriented programming techniques are also helping shaping the next generation of sensor networks. As a trend, smart sensor networks are getting more attention in industrial areas for the values they can bring into us. The IEEE 1451 family of smart sensor interface standards tends to resolve the issues and problems associated with the proliferation and the heterogeneity of sensor networks. The evolution and current state of the art of sensor networks is captured in this article, where the characteristics of their generations are discussed under the networking technologies. It is also pointed out that the challenges sensor networks will face and intends of this field.

  13. Dynamic Coverage of Mobile Sensor Networks

    CERN Document Server

    Liu, Benyuan; Nain, Philippe; Towsley, Don

    2011-01-01

    In this paper we study the dynamic aspects of the coverage of a mobile sensor network resulting from continuous movement of sensors. As sensors move around, initially uncovered locations are likely to be covered at a later time. A larger area is covered as time continues, and intruders that might never be detected in a stationary sensor network can now be detected by moving sensors. However, this improvement in coverage is achieved at the cost that a location is covered only part of the time, alternating between covered and not covered. We characterize area coverage at specific time instants and during time intervals, as well as the time durations that a location is covered and uncovered. We further characterize the time it takes to detect a randomly located intruder. For mobile intruders, we take a game theoretic approach and derive optimal mobility strategies for both sensors and intruders. Our results show that sensor mobility brings about unique dynamic coverage properties not present in a stationary sens...

  14. Querying moving objects detected by sensor networks

    CERN Document Server

    Bestehorn, Markus

    2012-01-01

    Declarative query interfaces to Sensor Networks (SN) have become a commodity. These interfaces allow access to SN deployed for collecting data using relational queries. However, SN are not confined to data collection, but may track object movement, e.g., wildlife observation or traffic monitoring. While rational approaches are well suited for data collection, research on ""Moving Object Databases"" (MOD) has shown that relational operators are unsuitable to express information needs on object movement, i.e., spatio-temporal queries. ""Querying Moving Objects Detected by Sensor Networks"" studi

  15. Stochastic Congestion Control in Wireless Sensor Networks

    Science.gov (United States)

    Kim, Hyung Seok; Lee, Seok; Kim, Namhoon

    In this paper, an effective congestion control algorithm is proposed to increase the end-to-end delivery success ratio of upstream traffic by reduction of buffer drop probabilities and their deviation in wireless sensor networks. According to the queue length of parent and child nodes, each child node chooses one of the parents as the next hop to the sink and controls the delay before transmission begins. It balances traffics among parents and mitigates congestion based on congestion level of a node. Simulation results show that the proposed algorithm reduces buffer drop probabilities and their deviation and increases the end-to-end delivery success ratio in wireless sensor networks.

  16. NEURON: Enabling Autonomicity in Wireless Sensor Networks

    Science.gov (United States)

    Zafeiropoulos, Anastasios; Gouvas, Panagiotis; Liakopoulos, Athanassios; Mentzas, Gregoris; Mitrou, Nikolas

    2010-01-01

    Future Wireless Sensor Networks (WSNs) will be ubiquitous, large-scale networks interconnected with the existing IP infrastructure. Autonomic functionalities have to be designed in order to reduce the complexity of their operation and management, and support the dissemination of knowledge within a WSN. In this paper a novel protocol for energy efficient deployment, clustering and routing in WSNs is proposed that focuses on the incorporation of autonomic functionalities in the existing approaches. The design of the protocol facilitates the design of innovative applications and services that are based on overlay topologies created through cooperation among the sensor nodes. PMID:22399931

  17. NEURON: Enabling Autonomicity in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Anastasios Zafeiropoulos

    2010-05-01

    Full Text Available Future Wireless Sensor Networks (WSNs will be ubiquitous, large-scale networks interconnected with the existing IP infrastructure. Autonomic functionalities have to be designed in order to reduce the complexity of their operation and management, and support the dissemination of knowledge within a WSN. In this paper a novel protocol for energy efficient deployment, clustering and routing in WSNs is proposed that focuses on the incorporation of autonomic functionalities in the existing approaches. The design of the protocol facilitates the design of innovative applications and services that are based on overlay topologies created through cooperation among the sensor nodes.

  18. Data Dissemination in Wireless Sensor Networks with Network Coding

    Directory of Open Access Journals (Sweden)

    Xiumin Wang

    2010-01-01

    Full Text Available In wireless sensor networks (WSNs, it is often necessary to update the software running on sensors, which requires reliable dissemination of large data objects to each sensor with energy efficiency. During data dissemination, due to sleep scheduling designed for energy efficiency, some sensors may not receive some packets at some time slots. In the meantime, due to the unreliability of wireless communication, a sensor may not successfully receive a packet even when it is in the active mode. Thus, retransmission of such packets to those sensors is necessary, which consumes more energy and increases the delay of data dissemination cycle. In this paper, we propose a network coding-based approach in data dissemination such that data dissemination can be accomplished at the earliest time. Thus, less energy is consumed and the delay can be decreased. The impact of packet loss probability and the sleep probability of sensors on the network coding gain is analyzed. A threshold is also given to decide whether the current sleep scheduling is effective on energy saving in data dissemination process or not. Simulation results demonstrate the effectiveness and scalability of the proposed work.

  19. Energy Consumption in Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    JIN Yan; WANG Ling; YANG Xiao-zong; WEN Dong-xin

    2007-01-01

    Wireless sensor networks (WSNs) can be used to collect surrounding data by multi-hop. As sensor networks have the constrained and not rechargeable energy resource, energy efficiency is an important design issue for its topology. In this paper, the energy consumption issue under the different topology is studied. We derive the exact mathematical expression of energy consumption for the fiat and clustering scheme, respectively. Then the energy consumptions of different schemes are compared. By the comparison, multi-level clustering scheme is more energy efficient in large scale networks. Simulation results demonstrate that our analysis is correct from the view of prolonging the large-scale network lifetime and achieving more power reductions.

  20. EMMNet: sensor networking for electricity meter monitoring.

    Science.gov (United States)

    Lin, Zhi-Ting; Zheng, Jie; Ji, Yu-Sheng; Zhao, Bao-Hua; Qu, Yu-Gui; Huang, Xu-Dong; Jiang, Xiu-Fang

    2010-01-01

    Smart sensors are emerging as a promising technology for a large number of application domains. This paper presents a collection of requirements and guidelines that serve as a basis for a general smart sensor architecture to monitor electricity meters. It also presents an electricity meter monitoring network, named EMMNet, comprised of data collectors, data concentrators, hand-held devices, a centralized server, and clients. EMMNet provides long-distance communication capabilities, which make it suitable suitable for complex urban environments. In addition, the operational cost of EMMNet is low, compared with other existing remote meter monitoring systems based on GPRS. A new dynamic tree protocol based on the application requirements which can significantly improve the reliability of the network is also proposed. We are currently conducting tests on five networks and investigating network problems for further improvements. Evaluation results indicate that EMMNet enhances the efficiency and accuracy in the reading, recording, and calibration of electricity meters.

  1. An Evolutionary Mobility Aware Multi-Objective Hybrid Routing Algorithm for Heterogeneous Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

    Researchers have faced numerous challenges while designing WSNs and protocols in many applications such as object tracking in military, detection of disastrous events, environment and health monitoring etc. Amongst all sustaining connectivity and capitalizing on the network lifetime is a serious...... deliberation. To tackle these two problems, Mobile Wireless Sensor Networks (MWSNs) is a better choice. In MWSN, Sensor nodes move freely to a target area without the need for any special infrastructure. Due to mobility, the routing process in MWSN has become more complicated as connections in the network can...... change dynamically. In this paper, the authors put forward an Evolutionary Mobility aware multi-objective hybrid Routing Protocol for heterogeneous wireless sensor networks (EMRP). EMRP uses two-level hierarchical clustering. EMRP selects the optimal path from source to sink using multiple metrics...

  2. Optimizing Retransmission Threshold in Wireless Sensor Networks.

    Science.gov (United States)

    Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang

    2016-05-10

    The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is O n Δ · max 1 ≤ i ≤ n { u i } , where u i is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based ( 1 + p m i n ) -approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O ( 1 ) -approximation algorithm with time complexity O ( 1 ) is proposed. Experimental results show that the proposed algorithms have better performance.

  3. Hierarchical Route Optimization By Using Memetic Algorithm In A Mobile Networks

    Directory of Open Access Journals (Sweden)

    K .K. Gautam

    2011-02-01

    Full Text Available The networks Mobility (NEMO Protocol is a way of managing the mobility of an entire network, and mobile internet protocol is the basic solution for networks Mobility. A hierarchical route optimization system for mobile network is proposed to solve management of hierarchical route optimization problems. In present paper we study hierarchical Route Optimization scheme using memetic algorithm(HROSMA The concept of optimization- finding the extreme of a function that maps candidate ‘solution’ to scalar values of ‘quality’ – is an extremely general and useful idea. For solving this problem, we use a few salient adaptations, and we also extend HROSMA perform routing between the mobile networks.

  4. Target Tracking In Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sunita Gola

    2012-09-01

    Full Text Available The problem being tackled here relates to the problem of target tracking in wireless sensor networks. It is a specific problem in localization. Localization primarily refers to the detection of spatial coordinates of a node or an object. Target tracking deals with finding spatial coordinates of a moving object and being able to track its movements. In the tracking scheme illustrated, sensors are deployed in a triangular fashion in a hexagonal mesh such that the hexagon is divided into a number of equilateral triangles. The technique used for detection is the trilateration technique in which intersection of three circles is used to determine the object location. While the object is being tracked by three sensors, distance to it from a fourth sensor is also being calculated simultaneously. The difference is that closest three sensors detect at a frequency of one second while the fourth sensor detects the object location at twice the frequency. Using the distance information from the fourth sensor and a simple mathematical technique, location of object ispredicted for every half second as well. The key thing to note is that the forth sensor node is not used for detection but only for estimation of the object at half second intervals and hence does not utilize much power. Using this technique, tracking capability of the system is increased.

  5. Real-Time Sensor-Actuator Networks

    OpenAIRE

    Sastry, Shivakumar; S. S. Iyengar

    2005-01-01

    Emerging technologies offer new paradigms for computation, control, collaboration, and communication. To realize the full potential of these technologies in industry, defense, and homeland security applications, it is necessary to exploit the real-time distributed computing capabilities of sensor-actuator networks. To reliably design and develop such networks, it is necessary to develop deeper insight into the underlying model for real-time computation and the infrastructure at the node level...

  6. Underwater sensor networks: applications, advances and challenges.

    Science.gov (United States)

    Heidemann, John; Stojanovic, Milica; Zorzi, Michele

    2012-01-13

    This paper examines the main approaches and challenges in the design and implementation of underwater wireless sensor networks. We summarize key applications and the main phenomena related to acoustic propagation, and discuss how they affect the design and operation of communication systems and networking protocols at various layers. We also provide an overview of communications hardware, testbeds and simulation tools available to the research community.

  7. Wireless Sensor Networks for High Fidelity Sampling

    Science.gov (United States)

    2007-07-20

    Seismological Laboratory underground seismometer calibration vault. Testing showed that the SiliconDesigns 1221L devices have a noise floor of 32µG...wireless sensor networks. In SIGCOMM 2006, Pisa, Italy , August 2006. [74] Luigi Rizzo. Effective erasure codes for reliable computer communication proto...Proceedings of the seventh annual international conference on Mobile computing and networking, Rome, Italy , July 2001. [86] Alec Woo, Terence Tong, and

  8. Toward controlling perturbations in robotic sensor networks

    Science.gov (United States)

    Banerjee, Ashis G.; Majumder, Saikat R.

    2014-06-01

    Robotic sensor networks (RSNs), which consist of networks of sensors placed on mobile robots, are being increasingly used for environment monitoring applications. In particular, a lot of work has been done on simultaneous localization and mapping of the robots, and optimal sensor placement for environment state estimation1. The deployment of RSNs, however, remains challenging in harsh environments where the RSNs have to deal with significant perturbations in the forms of wind gusts, turbulent water flows, sand storms, or blizzards that disrupt inter-robot communication and individual robot stability. Hence, there is a need to be able to control such perturbations and bring the networks to desirable states with stable nodes (robots) and minimal operational performance (environment sensing). Recent work has demonstrated the feasibility of controlling the non-linear dynamics in other communication networks like emergency management systems and power grids by introducing compensatory perturbations to restore network stability and operation2. In this paper, we develop a computational framework to investigate the usefulness of this approach for RSNs in marine environments. Preliminary analysis shows promising performance and identifies bounds on the original perturbations within which it is possible to control the networks.

  9. Distributed estimation of sensors position in underwater wireless sensor network

    Science.gov (United States)

    Zandi, Rahman; Kamarei, Mahmoud; Amiri, Hadi

    2016-05-01

    In this paper, a localisation method for determining the position of fixed sensor nodes in an underwater wireless sensor network (UWSN) is introduced. In this simple and range-free scheme, the node localisation is achieved by utilising an autonomous underwater vehicle (AUV) that transverses through the network deployment area, and that periodically emits a message block via four directional acoustic beams. A message block contains the actual known AUV position as well as a directional dependent marker that allows a node to identify the respective transmit beam. The beams form a fixed angle with the AUV body. If a node passively receives message blocks, it could calculate the arithmetic mean of the coordinates existing in each messages sequence, to find coordinates at two different time instants via two different successive beams. The node position can be derived from the two computed positions of the AUV. The major advantage of the proposed localisation algorithm is that it is silent, which leads to energy efficiency for sensor nodes. The proposed method does not require any synchronisation among the nodes owing to being silent. Simulation results, using MATLAB, demonstrated that the proposed method had better performance than other similar AUV-based localisation methods in terms of the rates of well-localised sensor nodes and positional root mean square error.

  10. Autonomic Context-Aware Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Nídia G. S. Campos

    2015-01-01

    Full Text Available Autonomic Computing allows systems like wireless sensor networks (WSN to self-manage computing resources in order to extend their autonomy as much as possible. In addition, contextualization tasks can fuse two or more different sensor data into a more meaningful information. Since these tasks usually run in a single centralized context server (e.g., sink node, the massive volume of data generated by the wireless sensors can lead to a huge information overload in such server. Here we propose DAIM, a distributed autonomic inference machine distributed which allows the sensor nodes to do self-management and contextualization tasks based on fuzzy logic. We have evaluated DAIM in a real sensor network taking into account other inference machines. Experimental results illustrate that DAIM is an energy-efficient contextualization method for WSN, reducing 48.8% of the number of messages sent to the context servers while saving 19.5% of the total amount of energy spent in the network.

  11. Design of intelligent multinode Sensor networking

    Directory of Open Access Journals (Sweden)

    Mr. N.Suresh kumar

    2010-05-01

    Full Text Available The paper deals with the self configured intelligent sensor networking. The individual sensors are acting on the body or an object to measure different parameters. Although the sensors are measuring parameters accurately, but they are failed to act depending on different situations. For example a robot is moving on a surface can take decision to turn left or right when an obstacle come across. But the same robots take wrong decision when the obstacle is not static. The robot can wait till the obstacle passed away fromits way. But the robot still follows the traditional way, which is turning left or turn. In this case the robot is failed to take correct decision depending on the situation. If we consider other example such as traditional automatic water supply to plants orcrops, the system supplies the water at regular intervals of time with accurate quantity. But the system takes same decisions in all seasons irrespective of the soil type and crop type. In oursystem we are proposing a Wireless Distributing sensor system design which is able to take wise decisions as a farmer. A farmer can understands how much water the soil needs and at what time itneed to apply. In our work, we are developing, (1 Home Area Networking (2software supporting above functions; (3 Wireless Sensor Networking.

  12. A New Proposed Clustering Method for Energy Efficient Routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sara Nasirian

    2017-04-01

    Full Text Available Wireless Sensor Networks, have found plenty of applications, nowadays. Due to the presence of tiny and restricted batteries in these little sensors, deployment of a power-efficient routing protocol is a must. Between all the already-proposed routing protocols, the hierarchical ones are more efficient in energy conservation than flat routing protocols. In order to decrease energy consumption and increase the network lifetime, we proposed a new hierarchical routing protocol, by dividing the network area to sectors and two levels and choosing Cluster Heads from the lower level, which is more near to the Base Station. In order to minimize the reverse flow of the data from BS, we use a tree structure in each sector. In addition, the frontier between two levels can be moved during network lifetime and having dead nodes. The results of simulations show that our proposed TSBC protocol outperforms LEACH, Multi-Hop LEACH and many other conventional routing protocols in energy conservation and in network lifetime. One of the most important properties of our scheme that can distinguish it from any other scheme is reverse flow from BS cancellation or at least deduction. The special formula, which is used in our protocol for CH selection, in order to prevent battery depletion in a special spot, can also be adapted to any other hierarchical clustering protocols to achieve higher energy-efficiency. It is still noteworthy to mention that thanks to devising special measures we highly prevent fragmentation occurrence in routing process in the network.

  13. Enhanced Distributed Dynamic Skyline Query for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Khandakar Ahmed

    2016-02-01

    Full Text Available Dynamic skyline query is one of the most popular and significant variants of skyline query in the field of multi-criteria decision-making. However, designing a distributed dynamic skyline query possesses greater challenge, especially for the distributed data centric storage within wireless sensor networks (WSNs. In this paper, a novel Enhanced Distributed Dynamic Skyline (EDDS approach is proposed and implemented in Disk Based Data Centric Storage (DBDCS architecture. DBDCS is an adaptation of magnetic disk storage platter consisting tracks and sectors. In DBDCS, the disc track and sector analogy is used to map data locations. A distance based indexing method is used for storing and querying multi-dimensional similar data. EDDS applies a threshold based hierarchical approach, which uses temporal correlation among sectors and sector segments to calculate a dynamic skyline. The efficiency and effectiveness of EDDS has been evaluated in terms of latency, energy consumption and accuracy through a simulation model developed in Castalia.

  14. A Wireless Sensor Network For Soil Monitoring

    Science.gov (United States)

    Szlavecz, K.; Cogan, J.; Musaloiu-Elefteri, R.; Small, S.; Terzis, A.; Szalay, A.

    2005-12-01

    The most spatially complex stratum of a terrestrial ecosystem is its soil. Among the major challenges of studying the soil ecosystem are the diversity and the cryptic nature of biota, and the enormous heterogeneity of the soil substrate. Often this patchiness drives spatial distribution of soil organisms, yet our knowledge on the spatio-temporal patterns of soil conditions is limited. To monitor the environmental conditions at biologically meaningful spatial scales we have developed and deployed a wireless sensor network of thirty nodes. Each node is based on a MICAz mote connected to a custom-built sensor suite that includes a Watermark soil moisture sensor, an Irrometer soil temperature sensor, and sensors capable of recording ambient temperature and light intensity. To assess CO2 production at the ground level a subset of the nodes is equipped with Telaire 6004 CO2 sensor. We developed the software running on the motes from scratch, using the TinyOS development environment. Each mote collects measurements every minute, and stores them persistently in a non-volatile memory. The decision to store data locally at each node enables us to reliably retrieve the data in the face of network losses and premature node failures due to power depletion. Collected measurements are retrieved over the wireless network through a PC-class computer acting as a gateway between the sensor network and the Internet. Considering that motes are battery powered, the largest obstacle hindering long-term sensor network deployments is power consumption. To address this problem, our software powers down sensors between sampling cycles and turns off the radio (the most energy prohibitive mote component) when not in use. By doing so we were able to increase node lifetime by a factor of ten. We collected field data over several weeks. The data was ingested into a SQL Server database, which provides data access through a .NET web services interface. The database provides functions for spatial

  15. Cognitive Radio-Based Vehicular Ad Hoc and Sensor Networks

    National Research Council Canada - National Science Library

    Jalil Piran, Mohammad; Cho, Yongwoo; Yun, Jihyeok; Ali, Amjad; Suh, Doug Young

    2014-01-01

    ... the spectrum scarcity issue. We have already proposed vehicular ad hoc and sensor networks (VASNET) as a new networking paradigm for vehicular communication by utilizing wireless sensor nodes in two mobile and stationary modes...

  16. Applications of Wireless Sensor Network in Smart Grid

    National Research Council Canada - National Science Library

    Huijun Xu

    2013-01-01

    .... In this paper, we firstly analyzed the characteristics and structures of the smart grid and wireless sensor network, then brought out the applications of wireless sensor network in the smart grid...

  17. Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems.

    Directory of Open Access Journals (Sweden)

    Martin Rosvall

    Full Text Available To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation, which reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between compression and pattern detection; by compressing a description of a random walker as a proxy for real flow on a network, we find regularities in the network that induce this system-wide flow. Finding the shortest multilevel description of the random walker therefore gives us the best hierarchical clustering of the network--the optimal number of levels and modular partition at each level--with respect to the dynamics on the network. With a novel search algorithm, we extract and illustrate the rich multilevel organization of several large social and biological networks. For example, from the global air traffic network we uncover countries and continents, and from the pattern of scientific communication we reveal more than 100 scientific fields organized in four major disciplines: life sciences, physical sciences, ecology and earth sciences, and social sciences. In general, we find shallow hierarchical structures in globally interconnected systems, such as neural networks, and rich multilevel organizations in systems with highly separated regions, such as road networks.

  18. Problem solving for wireless sensor networks

    CERN Document Server

    Garcia-Hernando, Ana-Belen; Lopez-Navarro, Juan-Manuel; Prayati, Aggeliki; Redondo-Lopez, Luis

    2008-01-01

    Wireless Sensor Networks (WSN) is an area of huge research interest, attracting substantial attention from industry and academia for its enormous potential and its inherent challenges. This reader-friendly text delivers a comprehensive review of the developments related to the important technological issues in WSN.

  19. Sensor Network Localization with Imprecise Distances

    NARCIS (Netherlands)

    Cao, M.; Morse, A.S.; Anderson, B.D.O.

    2006-01-01

    An approach to formulate geometric relations among distances between nodes as equality constraints is introduced in this paper to study the localization problem with imprecise distance information in sensor networks. These constraints can be further used to formulate optimization problems for distan

  20. Cross-platform wireless sensor network development

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg; Kusy, Branislav

    -source development environment that takes a holistic approach to implementing sensor network applications. Users build applications using a drag-and-drop visual programming language Open Blocks, a language that Google selected for its App Inventor for Android. Tinylnventor uses cross-platform programming concepts...

  1. Optimizing Key Updates in Sensor Networks

    DEFF Research Database (Denmark)

    Yuksel, Ender; Nielson, Hanne Riis; Nielson, Flemming

    2011-01-01

    Sensor networks offer the advantages of simple and low–resource communication. Nevertheless, security is of particular importance in many cases such as when sensitive data is communicated or tamper-resistance is required. Updating the security keys is one of the key points in security, which rest...

  2. Benchmarking Block Ciphers for Wireless Sensor Networks

    NARCIS (Netherlands)

    Law, Y.W.; Doumen, J.M.; Hartel, P.H.

    2004-01-01

    Choosing the most storage- and energy-efficient block cipher specifically for wireless sensor networks (WSNs) is not as straightforward as it seems. To our knowledge so far, there is no systematic evaluation framework for the purpose. We have identified the candidates of block ciphers suitable for W

  3. Benchmarking Block Ciphers for Wireless Sensor Networks

    NARCIS (Netherlands)

    Law, Y.W.; Doumen, J.M.; Hartel, Pieter H.

    2004-01-01

    Choosing the most storage- and energy-efficient block cipher specifically for wireless sensor networks (WSNs) is not as straightforward as it seems. To our knowledge so far, there is no systematic evaluation framework for the purpose. We have identified the candidates of block ciphers suitable for

  4. Wireless sensor networks dynamic runtime configuration

    NARCIS (Netherlands)

    Dulman, S.O.; Hofmeijer, T.J.; Havinga, Paul J.M.

    2004-01-01

    Current Wireless Sensor Networks (WSN) use fixed layered architectures, that can be modified only at compile time. Using a non-layered architecture, which allows dynamic loading of modules and automatic reconfiguration to adapt to the surrounding environment was believed to be too resource consuming

  5. Cross-platform wireless sensor network development

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg; Kusy, Branislav

    -source development environment that takes a holistic approach to implementing sensor network applications. Users build applications using a drag-and-drop visual programming language Open Blocks, a language that Google selected for its App Inventor for Android. Tinylnventor uses cross-platform programming concepts...

  6. Clock Synchronization for Multihop Wireless Sensor Networks

    Science.gov (United States)

    Solis Robles, Roberto

    2009-01-01

    In wireless sensor networks, more so generally than in other types of distributed systems, clock synchronization is crucial since by having this service available, several applications such as media access protocols, object tracking, or data fusion, would improve their performance. In this dissertation, we propose a set of algorithms to achieve…

  7. Understanding and managing large sensor networks

    Directory of Open Access Journals (Sweden)

    D. D. Ediriweera

    2010-04-01

    Full Text Available The water supply industry is trialing a range of sensor network designs for monitoring distributed infrastructure. The paper investigates the performance of such a sensor system deployed to monitor a water distribution network. The study reveals up to one fifth of the data intended to be collected either to be missing or erroneous. Findings reinforce the importance of in-depth design consideration of all aspects of large scale sensor systems, and the necessity for expertise on every detail of the system, or access to a rule set which embeds this knowledge allowing non-specialists to make near optimal choices. First steps towards defining such a rule set is presented here with supporting evidence.

  8. Identifying time-delayed gene regulatory networks via an evolvable hierarchical recurrent neural network.

    Science.gov (United States)

    Kordmahalleh, Mina Moradi; Sefidmazgi, Mohammad Gorji; Harrison, Scott H; Homaifar, Abdollah

    2017-01-01

    The modeling of genetic interactions within a cell is crucial for a basic understanding of physiology and for applied areas such as drug design. Interactions in gene regulatory networks (GRNs) include effects of transcription factors, repressors, small metabolites, and microRNA species. In addition, the effects of regulatory interactions are not always simultaneous, but can occur after a finite time delay, or as a combined outcome of simultaneous and time delayed interactions. Powerful biotechnologies have been rapidly and successfully measuring levels of genetic expression to illuminate different states of biological systems. This has led to an ensuing challenge to improve the identification of specific regulatory mechanisms through regulatory network reconstructions. Solutions to this challenge will ultimately help to spur forward efforts based on the usage of regulatory network reconstructions in systems biology applications. We have developed a hierarchical recurrent neural network (HRNN) that identifies time-delayed gene interactions using time-course data. A customized genetic algorithm (GA) was used to optimize hierarchical connectivity of regulatory genes and a target gene. The proposed design provides a non-fully connected network with the flexibility of using recurrent connections inside the network. These features and the non-linearity of the HRNN facilitate the process of identifying temporal patterns of a GRN. Our HRNN method was implemented with the Python language. It was first evaluated on simulated data representing linear and nonlinear time-delayed gene-gene interaction models across a range of network sizes and variances of noise. We then further demonstrated the capability of our method in reconstructing GRNs of the Saccharomyces cerevisiae synthetic network for in vivo benchmarking of reverse-engineering and modeling approaches (IRMA). We compared the performance of our method to TD-ARACNE, HCC-CLINDE, TSNI and ebdbNet across different network

  9. Sensor data security level estimation scheme for wireless sensor networks.

    Science.gov (United States)

    Ramos, Alex; Filho, Raimir Holanda

    2015-01-19

    Due to their increasing dissemination, wireless sensor networks (WSNs) have become the target of more and more sophisticated attacks, even capable of circumventing both attack detection and prevention mechanisms. This may cause WSN users, who totally trust these security mechanisms, to think that a sensor reading is secure, even when an adversary has corrupted it. For that reason, a scheme capable of estimating the security level (SL) that these mechanisms provide to sensor data is needed, so that users can be aware of the actual security state of this data and can make better decisions on its use. However, existing security estimation schemes proposed for WSNs fully ignore detection mechanisms and analyze solely the security provided by prevention mechanisms. In this context, this work presents the sensor data security estimator (SDSE), a new comprehensive security estimation scheme for WSNs. SDSE is designed for estimating the sensor data security level based on security metrics that analyze both attack prevention and detection mechanisms. In order to validate our proposed scheme, we have carried out extensive simulations that show the high accuracy of SDSE estimates.

  10. Sensor Data Security Level Estimation Scheme for Wireless Sensor Networks

    Science.gov (United States)

    Ramos, Alex; Filho, Raimir Holanda

    2015-01-01

    Due to their increasing dissemination, wireless sensor networks (WSNs) have become the target of more and more sophisticated attacks, even capable of circumventing both attack detection and prevention mechanisms. This may cause WSN users, who totally trust these security mechanisms, to think that a sensor reading is secure, even when an adversary has corrupted it. For that reason, a scheme capable of estimating the security level (SL) that these mechanisms provide to sensor data is needed, so that users can be aware of the actual security state of this data and can make better decisions on its use. However, existing security estimation schemes proposed for WSNs fully ignore detection mechanisms and analyze solely the security provided by prevention mechanisms. In this context, this work presents the sensor data security estimator (SDSE), a new comprehensive security estimation scheme for WSNs. SDSE is designed for estimating the sensor data security level based on security metrics that analyze both attack prevention and detection mechanisms. In order to validate our proposed scheme, we have carried out extensive simulations that show the high accuracy of SDSE estimates. PMID:25608215

  11. Wireless multimedia sensor networks on reconfigurable hardware information reduction techniques

    CERN Document Server

    Ang, Li-minn; Chew, Li Wern; Yeong, Lee Seng; Chia, Wai Chong

    2013-01-01

    Traditional wireless sensor networks (WSNs) capture scalar data such as temperature, vibration, pressure, or humidity. Motivated by the success of WSNs and also with the emergence of new technology in the form of low-cost image sensors, researchers have proposed combining image and audio sensors with WSNs to form wireless multimedia sensor networks (WMSNs).

  12. Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

    Science.gov (United States)

    Yu, Chao

    2013-01-01

    In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…

  13. Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

    Science.gov (United States)

    Yu, Chao

    2013-01-01

    In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…

  14. Intruder Activity Analysis under Unreliable Sensor Networks

    Energy Technology Data Exchange (ETDEWEB)

    Tae-Sic Yoo; Humberto E. Garcia

    2007-09-01

    This paper addresses the problem of counting intruder activities within a monitored domain by a sensor network. The deployed sensors are unreliable. We characterize imperfect sensors with misdetection and false-alarm probabilities. We model intruder activities with Markov Chains. A set of Hidden Markov Models (HMM) models the imperfect sensors and intruder activities to be monitored. A novel sequential change detection/isolation algorithm is developed to detect and isolate a change from an HMM representing no intruder activity to another HMM representing some intruder activities. Procedures for estimating the entry time and the trace of intruder activities are developed. A domain monitoring example is given to illustrate the presented concepts and computational procedures.

  15. Failure Filtrations for Fenced Sensor Networks

    CERN Document Server

    Munch, Elizabeth; Harer, John

    2011-01-01

    In this paper we consider the question of sensor network coverage for a 2-dimensional domain. We seek to compute the probability that a set of sensors fails to cover given only non-metric, local (who is talking to whom) information and a probability distribution of failure of each node. This builds on the work of de Silva and Ghrist who analyzed this problem in the deterministic situation. We first show that a it is part of a slightly larger class of problems which is #P-complete, and thus fast algorithms likely do not exist unless P$=$NP. We then give a deterministic algorithm which is feasible in the case of a small set of sensors, and give a dynamic algorithm for an arbitrary set of sensors failing over time which utilizes a new criterion for coverage based on the one proposed by de Silva and Ghrist. These algorithms build on the theory of topological persistence.

  16. Survey on Opportunistic Networks in Delay Tolerant Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Koushik.C.P

    2016-02-01

    Full Text Available Delay Tolerant Network is an emerging research field in Mobile sensor network. It use forwarding technique to transmit the message from source to destination, there is no complete path between sources to destination. Due to mobility of nodes there is frequent change in node paten and difficult to find the path, there is chance that message keep on forwarded inside the network. In this paper we made detail survey on Opportunistic Routing Protocol in mobile network, and in that node getting the message form neighbor node and moving away from Sink. We proposed a technique in Gradient based Routing Protocol to solve node moving away from sink with message.

  17. Heterogeneous LEACH Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Nishi Sharma

    2013-07-01

    Full Text Available Wireless Sensor Networks are networks of large number of tiny, battery powered sensor nodes having limited on-board storage, processing, and radio capabilities. Nodes sense and send their reports toward a processing center which is called base station. Since this transmission and reception process consumes lots of energy as compare to data processing, Designing protocols and applications for such networks has to be energy aware in order to prolong the lifetime of the network. Generally, real life applications deal with such Heterogeneity rather than Homogeneity. In this paper, a protocol is proposed, which is heterogeneous in energy. We analyze the basic distributed clustering routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy, which is a homogeneous system, and then we study the impact of heterogeneity in energy of nodes to prolong the life time of WSN. Simulation results using MATLAB shows that the proposed Leach-heterogeneous system significantly reduces energy consumption and increase the total lifetime of the wireless sensor network.

  18. Coevolution of Information Processing and Topology in Hierarchical Adaptive Random Boolean Networks

    CERN Document Server

    Gorski, Piotr J; Holyst, Janusz A

    2015-01-01

    Random Boolean networks (RBNs) are frequently employed for modelling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive RBN (HARBN) as a system consisting of distinct adaptive RBNs - subnetworks - connected by a set of permanent interlinks. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. We investigate mean node information, mean edge information as well as a mean node degree as functions of model parameters and demonstrate HARBN's ability to describe complex hierarchical systems.

  19. LONG-TERM MONITORING SENSOR NETWORK

    Energy Technology Data Exchange (ETDEWEB)

    Stephen P. Farrington; John W. Haas; Neal Van Wyck

    2003-10-16

    Long-term monitoring (LTM) associated with subsurface contamination sites is a key element of Long Term Stewardship and Legacy Management across the Department of Energy (DOE) complex. However, both within the DOE and elsewhere, LTM is an expensive endeavor, often exceeding the costs of the remediation phase of a clean-up project. The primary contributors to LTM costs are associated with labor. Sample collection, storage, preparation, analysis, and reporting can add a significant financial burden to project expense when extended over many years. Development of unattended, in situ monitoring networks capable of providing quantitative data satisfactory to regulatory concerns has the potential to significantly reduce LTM costs. But survival and dependable operation in a difficult environment is a common obstacle to widespread use across the DOE complex or elsewhere. Deploying almost any sensor in the subsurface for extended periods of time will expose it to chemical and microbial degradation. Over the time-scales required for in situ LTM, even the most advanced sensor systems may be rendered useless. Frequent replacement or servicing (cleaning) of sensors is expensive and labor intensive, offsetting most, if not all, of the cost savings realized with unattended, in situ sensors. To enable facile, remote monitoring of contaminants and other subsurface parameters over prolonged periods, Applied Research Associates, Inc has been working to develop an advanced LTM sensor network consisting of three key elements: (1) an anti-fouling sensor chamber that can accommodate a variety of chemical and physical measurement devices based on electrochemical, optical and other techniques; (2) two rapid, cost effective, and gentle means of emplacing sensor packages either at precise locations directly in the subsurface or in pre-existing monitoring wells; and (3) a web browser-based data acquisition and control system (WebDACS) utilizing field-networked microprocessor-controlled smart

  20. Hack Recognition In Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    B. Srinivasulu

    2014-09-01

    Full Text Available A wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a ―cut‖. In this article we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that allows like every node to detect when the connectivity to a specially designated node has been lost, and one or more nodes (that are connected to the special node after the cut to detect the occurrence of the cut. The algorithm is distributed and asynchronous: every node needs to communicate with only those nodes that are within its communication range. The algorithm is based on the iterative computation of a fictitious ―electrical potential‖ of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network.

  1. Prolonging sensor networks lifetime using convex clusters

    Directory of Open Access Journals (Sweden)

    Payam Salehi

    2013-11-01

    Full Text Available Reducing the energy consumption of nodes in sensor networks and prolonging the network life time has been proposed as one of the most important challenges facing researchers in the field of sensor networks. Therefore, designing an energy-aware protocol to gather data from network level and transmitting it to sink is placed on the agenda at this paper. After presenting an analysis of the processes of clustering in sensory networks and investigating the effect of sending interval on the amount of energy consumption, We have shown that if the use of convex static casters be done such as all the communications within the cluster with the sending distance less than the optimal threshold, it Will help to increase the lifetime of nodes. also have shown that if we create a virtual backbone between cluster heads to transfer far cluster heads data from sink to sink , will has a significant impact on increasing the network lifetime. For this reason, a detailed discussion on how to determine the size of clusters and partitioning of the network environment to them is presented in Chapter 4.Simulation results show considerable improvement of the proposed algorithm.

  2. Sustained Activity in Hierarchical Modular Neural Networks: Self-Organized Criticality and Oscillations

    Science.gov (United States)

    Wang, Sheng-Jun; Hilgetag, Claus C.; Zhou, Changsong

    2010-01-01

    Cerebral cortical brain networks possess a number of conspicuous features of structure and dynamics. First, these networks have an intricate, non-random organization. In particular, they are structured in a hierarchical modular fashion, from large-scale regions of the whole brain, via cortical areas and area subcompartments organized as structural and functional maps to cortical columns, and finally circuits made up of individual neurons. Second, the networks display self-organized sustained activity, which is persistent in the absence of external stimuli. At the systems level, such activity is characterized by complex rhythmical oscillations over a broadband background, while at the cellular level, neuronal discharges have been observed to display avalanches, indicating that cortical networks are at the state of self-organized criticality (SOC). We explored the relationship between hierarchical neural network organization and sustained dynamics using large-scale network modeling. Previously, it was shown that sparse random networks with balanced excitation and inhibition can sustain neural activity without external stimulation. We found that a hierarchical modular architecture can generate sustained activity better than random networks. Moreover, the system can simultaneously support rhythmical oscillations and SOC, which are not present in the respective random networks. The mechanism underlying the sustained activity is that each dense module cannot sustain activity on its own, but displays SOC in the presence of weak perturbations. Therefore, the hierarchical modular networks provide the coupling among subsystems with SOC. These results imply that the hierarchical modular architecture of cortical networks plays an important role in shaping the ongoing spontaneous activity of the brain, potentially allowing the system to take advantage of both the sensitivity of critical states and the predictability and timing of oscillations for efficient information

  3. Sustained activity in hierarchical modular neural networks: self-organized criticality and oscillations

    Directory of Open Access Journals (Sweden)

    Sheng-Jun Wang

    2011-06-01

    Full Text Available Cerebral cortical brain networks possess a number of conspicuous features of structure and dynamics. First, these networks have an intricate, non-random organization. They are structured in a hierarchical modular fashion, from large-scale regions of the whole brain, via cortical areas and area subcompartments organized as structural and functional maps to cortical columns, and finally circuits made up of individual neurons. Second, the networks display self-organized sustained activity, which is persistent in the absence of external stimuli. At the systems level, such activity is characterized by complex rhythmical oscillations over a broadband background, while at the cellular level, neuronal discharges have been observed to display avalanches, indicating that cortical networks are at the state of self-organized criticality. We explored the relationship between hierarchical neural network organization and sustained dynamics using large-scale network modeling. It was shown that sparse random networks with balanced excitation and inhibition can sustain neural activity without external stimulation. We find that a hierarchical modular architecture can generate sustained activity better than random networks. Moreover, the system can simultaneously support rhythmical oscillations and self-organized criticality, which are not present in the respective random networks. The underlying mechanism is that each dense module cannot sustain activity on its own, but displays self-organized criticality in the presence of weak perturbations. The hierarchical modular networks provide the coupling among subsystems with self-organized criticality. These results imply that the hierarchical modular architecture of cortical networks plays an important role in shaping the ongoing spontaneous activity of the brain, potentially allowing the system to take advantage of both the sensitivityof critical state and predictability and timing of oscillations for efficient

  4. Sustained activity in hierarchical modular neural networks: self-organized criticality and oscillations.

    Science.gov (United States)

    Wang, Sheng-Jun; Hilgetag, Claus C; Zhou, Changsong

    2011-01-01

    Cerebral cortical brain networks possess a number of conspicuous features of structure and dynamics. First, these networks have an intricate, non-random organization. In particular, they are structured in a hierarchical modular fashion, from large-scale regions of the whole brain, via cortical areas and area subcompartments organized as structural and functional maps to cortical columns, and finally circuits made up of individual neurons. Second, the networks display self-organized sustained activity, which is persistent in the absence of external stimuli. At the systems level, such activity is characterized by complex rhythmical oscillations over a broadband background, while at the cellular level, neuronal discharges have been observed to display avalanches, indicating that cortical networks are at the state of self-organized criticality (SOC). We explored the relationship between hierarchical neural network organization and sustained dynamics using large-scale network modeling. Previously, it was shown that sparse random networks with balanced excitation and inhibition can sustain neural activity without external stimulation. We found that a hierarchical modular architecture can generate sustained activity better than random networks. Moreover, the system can simultaneously support rhythmical oscillations and SOC, which are not present in the respective random networks. The mechanism underlying the sustained activity is that each dense module cannot sustain activity on its own, but displays SOC in the presence of weak perturbations. Therefore, the hierarchical modular networks provide the coupling among subsystems with SOC. These results imply that the hierarchical modular architecture of cortical networks plays an important role in shaping the ongoing spontaneous activity of the brain, potentially allowing the system to take advantage of both the sensitivity of critical states and the predictability and timing of oscillations for efficient information

  5. Approach to sensor node calibration for efficient localisation in wireless sensor networks in realistic scenarios

    CSIR Research Space (South Africa)

    Mwila, MK

    2014-06-01

    Full Text Available Conference on Ambient Systems, Networks and Technologies (ANT-2014) Approach to Sensor Node Calibration for Efficient Localisation in Wireless Sensor Networks in Realistic Scenarios Martin K. Mwilaa, Karim Djouanib, Anish Kurienc,∗ a...

  6. A Network Coding Based Routing Protocol for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xin Guan

    2012-04-01

    Full Text Available 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.

  7. A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks

    Science.gov (United States)

    Li, Changle; Zhang, Hanxiao; Hao, Binbin; Li, Jiandong

    2011-01-01

    With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner

  8. A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jiandong Li

    2011-03-01

    Full Text Available With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation

  9. Coalescence for Mobile Sensor Networks

    OpenAIRE

    Poduri, Sameera; Sukhatme, Gaurav S.

    2007-01-01

    Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time for a worst-case scenario where the robots do not have any knowledge about the environment or positions of other robots and perform independent, memory less search. Using the random direction mobility model, we show that coalescence time has an exponential distribution which is a function of the number of robots, speed...

  10. Tracking Objects with Networked Scattered Directional Sensors

    Directory of Open Access Journals (Sweden)

    P. R. Kumar

    2007-12-01

    Full Text Available We study the problem of object tracking using highly directional sensors—sensors whose field of vision is a line or a line segment. A network of such sensors monitors a certain region of the plane. Sporadically, objects moving in straight lines and at a constant speed cross the region. A sensor detects an object when it crosses its line of sight, and records the time of the detection. No distance or angle measurements are available. The task of the sensors is to estimate the directions and speeds of the objects, and the sensor lines, which are unknown a priori. This estimation problem involves the minimization of a highly nonconvex cost function. To overcome this difficulty, we introduce an algorithm, which we call “adaptive basis algorithm.” This algorithm is divided into three phases: in the first phase, the algorithm is initialized using data from six sensors and four objects; in the second phase, the estimates are updated as data from more sensors and objects are incorporated. The third phase is an optional coordinated transformation. The estimation is done in an “ad-hoc” coordinate system, which we call “adaptive coordinate system.” When more information is available, for example, the location of six sensors, the estimates can be transformed to the “real-world” coordinate system. This constitutes the third phase.

  11. Optimal Energy Aware Clustering in Sensor Networks

    Directory of Open Access Journals (Sweden)

    Majid Sarrafzadeh

    2002-07-01

    Full Text Available Sensor networks is among the fastest growing technologies that have the potential of changing our lives drastically. These collaborative, dynamic and distributed computing and communicating systems will be self organizing. They will have capabilities of distributing a task among themselves for efficient computation. There are many challenges in implementation of such systems: energy dissipation and clustering being one of them. In order to maintain a certain degree of service quality and a reasonable system lifetime, energy needs to be optimized at every stage of system operation. Sensor node clustering is another very important optimization problem. Nodes that are clustered together will easily be able to communicate with each other. Considering energy as an optimization parameter while clustering is imperative. In this paper we study the theoretical aspects of the clustering problem in sensor networks with application to energy optimization. We illustrate an optimal algorithm for clustering the sensor nodes such that each cluster (which has a master is balanced and the total distance between sensor nodes and master nodes is minimized. Balancing the clusters is needed for evenly distributing the load on all master nodes. Minimizing the total distance helps in reducing the communication overhead and hence the energy dissipation. This problem (which we call balanced k-clustering is modeled as a mincost flow problem which can be solved optimally using existing techniques.

  12. Track classification within wireless sensor network

    Science.gov (United States)

    Doumerc, Robin; Pannetier, Benjamin; Moras, Julien; Dezert, Jean; Canevet, Loic

    2017-05-01

    In this paper, we present our study on track classification by taking into account environmental information and target estimated states. The tracker uses several motion model adapted to different target dynamics (pedestrian, ground vehicle and SUAV, i.e. small unmanned aerial vehicle) and works in centralized architecture. The main idea is to explore both: classification given by heterogeneous sensors and classification obtained with our fusion module. The fusion module, presented in his paper, provides a class on each track according to track location, velocity and associated uncertainty. To model the likelihood on each class, a fuzzy approach is used considering constraints on target capability to move in the environment. Then the evidential reasoning approach based on Dempster-Shafer Theory (DST) is used to perform a time integration of this classifier output. The fusion rules are tested and compared on real data obtained with our wireless sensor network.In order to handle realistic ground target tracking scenarios, we use an autonomous smart computer deposited in the surveillance area. After the calibration step of the heterogeneous sensor network, our system is able to handle real data from a wireless ground sensor network. The performance of this system is evaluated in a real exercise for intelligence operation ("hunter hunt" scenario).

  13. Dynamic Localization Schemes in Malicious Sensor Networks

    Directory of Open Access Journals (Sweden)

    Kaiqi Xiong

    2009-10-01

    Full Text Available Wireless sensor networks (WSN have recently shown many potential military and civilian applications, especially those used in hostile environments where malicious adversaries can be present. The accuracy of location information is critical for such applications. It is impractical to have a GPS device on each sensor in WSN due to costs. Most of the existing location discovery schemes can only be used in the trusted environment. Recent research has addressed security issues in sensor network localization, but to the best of our knowledge, none have completely solved the secure localization problem. In this paper, we propose novel schemes for secure dynamic localization in sensor networks. These proposed schemes can tolerate up to 50% of beacon nodes being malicious, and they have linear computation time with respect to the number of reference nodes. Our security analysis has showed that our schemes are applicable and resilient to attacks from adversaries. We have further conducted simulations to analyze and compare the performance of these schemes, and to indicate when each should be used. The efficiencies of each method shows why we needed to propose multiple methods.

  14. Wireless sensor networks principles, design and applications

    CERN Document Server

    Yang, Shuang-Hua

    2014-01-01

    Wireless Sensor Networks presents the latest practical solutions to the design issues presented in wireless-sensor-network-based systems. Novel features of the text, distributed throughout, include workable solutions, demonstration systems and case studies of the design and application of wireless sensor networks (WSNs) based on the first-hand research and development experience of the author, and the chapters on real applications: building fire safety protection; smart home automation; and logistics resource management. Case studies and applications illustrate the practical perspectives of: ·         sensor node design; ·         embedded software design; ·         routing algorithms; ·         sink node positioning; ·         co-existence with other wireless systems; ·         data fusion; ·         security; ·         indoor location tracking; ·         integrating with radio-frequency identification; and ·         In...

  15. Autonomous management of a recursive area hierarchy for large scale wireless sensor networks using multiple parents

    Energy Technology Data Exchange (ETDEWEB)

    Cree, Johnathan Vee [Washington State Univ., Pullman, WA (United States); Delgado-Frias, Jose [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

    2016-03-01

    Large scale wireless sensor networks have been proposed for applications ranging from anomaly detection in an environment to vehicle tracking. Many of these applications require the networks to be distributed across a large geographic area while supporting three to five year network lifetimes. In order to support these requirements large scale wireless sensor networks of duty-cycled devices need a method of efficient and effective autonomous configuration/maintenance. This method should gracefully handle the synchronization tasks duty-cycled networks. Further, an effective configuration solution needs to recognize that in-network data aggregation and analysis presents significant benefits to wireless sensor network and should configure the network in a way such that said higher level functions benefit from the logically imposed structure. NOA, the proposed configuration and maintenance protocol, provides a multi-parent hierarchical logical structure for the network that reduces the synchronization workload. It also provides higher level functions with significant inherent benefits such as but not limited to: removing network divisions that are created by single-parent hierarchies, guarantees for when data will be compared in the hierarchy, and redundancies for communication as well as in-network data aggregation/analysis/storage.

  16. Wireless sensor networks and ecological monitoring

    CERN Document Server

    Jiang, Joe-Air

    2013-01-01

    This book presents the state of the art technologies and solutions to tackle the critical challenges faced by the building and development of the WSN and ecological monitoring system but also potential impact on society at social, medical and technological level. This book is dedicated to Sensing systems for Sensors, Wireless Sensor Networks and Ecological Monitoring. The book aims at Master and PhD degree students, researchers, practitioners, especially WSN engineers involved with ecological monitoring. The book will provide an opportunity of a dedicated and a deep approach in order to improve their knowledge in this specific field.  

  17. Mobile cluster rekeying in tracking sensor network

    Institute of Scientific and Technical Information of China (English)

    WANG Jia-hao; QING Zhi-guang; GENG Ji; LI Zhi-jun

    2006-01-01

    The wireless sensor network has a broad application in target tracking and locating, and is especially fit for military detection or guard. By arranging the sensor nodes around the target, this article establishes a tracking cluster which can follow the target logically, process data on the target and report to the sink node,thus achieving the tracking function. To improve the security, this article proposes a mobile cluster rekeying protocol (MCRP) to manage the tracking cluster's season key. It is based on a random key predistribution algorithm (RKP), which is composed of a multi-path reinforcement scheme, a q-composition scheme and a oneway cryptographic hash function.

  18. Energy Efficient MAC for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Pekka KOSKELA

    2010-10-01

    Full Text Available This paper considers an overlay solution for asynchronous Medium Access Control (MAC protocols in a duty-cycled wireless sensor network (WSN. The solution extends sleeping times and corrects time drift when the sampling rate is low. The sleeping time is adjusted according to the requisite data sampling rate and the delay requirements of the prevailing application. This and the time drift correction considerably reduced idle listening and thus also decreased power consumption. When the power consumption is reduced, the life of wireless sensor nodes extends.

  19. Real-time Human Activity Recognition using a Body Sensor Network

    DEFF Research Database (Denmark)

    Wang, Liang; Gu, Tao; Chen, Hanhua

    2010-01-01

    . In this model, we first use a fast, lightweight template matching algorithm to detect gestures at the sensor node level, and then use a discriminative pattern based real-time algorithm to recognize high-level activities at the portable device level. We evaluate our algorithms over a real-world dataset....... The results show that the proposed system not only achieves good performance (an average precision of 94.9%, an average recall of 82.5%, and an average real-time delay of 5.7 seconds), but also significantly reduces the network communication cost by 60.2%.......Real-time activity recognition using body sensor networks is an important and challenging task and it has many potential applications. In this paper, we propose a realtime, hierarchical model to recognize both simple gestures and complex activities using a wireless body sensor network...

  20. Key Management in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ismail Mansour

    2015-09-01

    Full Text Available Wireless sensor networks are a challenging field of research when it comes to security issues. Using low cost sensor nodes with limited resources makes it difficult for cryptographic algorithms to function without impacting energy consumption and latency. In this paper, we focus on key management issues in multi-hop wireless sensor networks. These networks are easy to attack due to the open nature of the wireless medium. Intruders could try to penetrate the network, capture nodes or take control over particular nodes. In this context, it is important to revoke and renew keys that might be learned by malicious nodes. We propose several secure protocols for key revocation and key renewal based on symmetric encryption and elliptic curve cryptography. All protocols are secure, but have different security levels. Each proposed protocol is formally proven and analyzed using Scyther, an automatic verification tool for cryptographic protocols. For efficiency comparison sake, we implemented all protocols on real testbeds using TelosB motes and discussed their performances.

  1. Gas Main Sensor and Communications Network System

    Energy Technology Data Exchange (ETDEWEB)

    Hagen Schempf

    2006-05-31

    Automatika, Inc. was contracted by the Department of Energy (DOE) and with co-funding from the Northeast Gas Association (NGA), to develop an in-pipe natural gas prototype measurement and wireless communications system for assessing and monitoring distribution networks. This projected was completed in April 2006, and culminated in the installation of more than 2 dozen GasNet nodes in both low- and high-pressure cast-iron and steel mains owned by multiple utilities in the northeastern US. Utilities are currently logging data (off-line) and monitoring data in real time from single and multiple networked sensors over cellular networks and collecting data using wireless bluetooth PDA systems. The system was designed to be modular, using in-pipe sensor-wands capable of measuring, flow, pressure, temperature, water-content and vibration. Internal antennae allowed for the use of the pipe-internals as a waveguide for setting up a sensor network to collect data from multiple nodes simultaneously. Sensor nodes were designed to be installed with low- and no-blow techniques and tools. Using a multi-drop bus technique with a custom protocol, all electronics were designed to be buriable and allow for on-board data-collection (SD-card), wireless relaying and cellular network forwarding. Installation options afforded by the design included direct-burial and external polemounted variants. Power was provided by one or more batteries, direct AC-power (Class I Div.2) and solar-array. The utilities are currently in a data-collection phase and intend to use the collected (and processed) data to make capital improvement decisions, compare it to Stoner model predictions and evaluate the use of such a system for future expansion, technology-improvement and commercialization starting later in 2006.

  2. Survey of Security Technologies on Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Qiuwei Yang

    2015-01-01

    Full Text Available Because of their low cost and adaptability, wireless sensor networks are widely used in civil, military, and commercial fields and other fields. However, since the sensor node in the calculation of the capacity, battery capacity, and storage capacity are restricted by the limitations and inherent characteristics of the sensor networks, compared to traditional networks, which makes wireless sensor networks face more security threats. This paper summarized research progress of sensor network security issues as three aspects, key management, authentication, and secure routing, analyzed and commented on these results advantages and disadvantages and pointed out the future direction of the hot research field.

  3. A survey on routing in wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    XIAO Renyi; WU Guozheng

    2007-01-01

    One of the most important issues in wireless sensor networks is data delivery service between sensors and the data collection unit (called sink ). Although sensor networks and mobile ad hoc networks are similar to some extent, they are radically distinct in many aspects. Sensor networks have many unique features, making them more challenging and need further research efforts. The existing routing protocols for sensor networks can be classified as indicator-based and indicator-free. In this survey, we make a comparative study of these protocols. Open issues and research directions are pointed out as guidelines for our future work.

  4. Analysis of k-Coverage in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Rasmi Ranjan Patra

    2011-09-01

    Full Text Available Recently, a concept of wireless sensor networks has attracted much attention due to its wide-range of potential applications. Wireless sensor networks also pose a number of challenging optimization problems. One of the fundamental problems in sensor networks is the coverage problem, which reflects the quality of service that can be provided by a particular sensor network. The coverage concept is depending from several points of view due to a variety of sensors and a wide-range of their applications. One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine the degree of coverage of a sensor network, which is covered by at least k sensors, where k is a predefined value. The sensing ranges of sensors can be same or different. Performance evaluation of our protocol indicates that degree of coverage of wireless sensor networks can be determined within small period of time. Therefore energy consumption of the sensor networks can be minimized.

  5. Exact and Approximate Inference in Associative Hierarchical Networks using Graph Cuts

    CERN Document Server

    Russell, Chris; Kohli, Pushmeet; Torr, Philip H S

    2012-01-01

    Markov Networks are widely used through out computer vision and machine learning. An important subclass are the Associative Markov Networks which are used in a wide variety of applications. For these networks a good approximate minimum cost solution can be found efficiently using graph cut based move making algorithms such as alpha- expansion. Recently a related model has been proposed, the associative hierarchical net- work, which provides a natural generalisation of the Associative Markov Network for higher order cliques (i.e. clique size greater than two). This method provides a good model for object class segmentation problem in com- puter vision. Within this paper we briefly describe the associative hierarchical network and provide a computationally efficient method for ap- proximate inference based on graph cuts. Our method performs well for networks con- taining hundreds of thousand of variables, and higher order potentials are defined over cliques containing tens of thousands of vari- ables. Due to th...

  6. The Griffiths Phase on Hierarchical Modular Networks with Small-world Edges

    CERN Document Server

    Li, Shanshan

    2016-01-01

    The Griffiths phase has been proposed to induce a stretched critical regime that facilitates self organizing of brain networks for optimal function. This phase stems from the intrinsic structural heterogeneity of brain networks, such as the hierarchical modular structure. In this work, we extend this concept to modified hierarchical networks with small-world connections based on Hanoi networks [1]. Through extensive simulations, we identify the essential role played by the exponential distribution of the inter-moduli connectivity probability across hierarchies on the emergence of the Griffiths phase in this network. Additionally, the spectral analysis on the adjacency matrix of the relevant networks [2] shows that a localized principle eigenvector is not necessarily the fingerprint of the Griffiths phase.

  7. Distributed query processing in flash-based sensor networks

    Institute of Scientific and Technical Information of China (English)

    Jianliang XU; Xueyan TANG; Wang-Chien LEE

    2008-01-01

    Wireless sensor networks are used in a large array of applications to capture,collect,and analyze physical environmental data.Many existing sensor systems instruct sensor nodes to report their measurements to central repositories outside the network,which is expensive in energy cost.Recent technological advances in flash memory have given rise to the development of storagecentric sensor networks,where sensor nodes are equipped with high-capacity flash memory storage such that sensor data can b.e stored and managed inside the network to reduce expensive communication.This novel architecture calls for new data management techniques to fully exploit distributed in-network data storage.This paper describes some of our research on distributed query processing in such flash-based sensor networks.Of particular interests are the issues that arise in the design of storage management and indexing structures combining sensor system workload and read/write/erase characteristics of flash memory.

  8. NEW METHOD TO ESTIMATE SCALING OF POWER-LAW DEGREE DISTRIBUTION AND HIERARCHICAL NETWORKS

    Institute of Scientific and Technical Information of China (English)

    YANG Bo; DUAN Wen-qi; CHEN Zhong

    2006-01-01

    A new method and corresponding numerical procedure are introduced to estimate scaling exponents of power-law degree distribution and hierarchical clustering func tion for complex networks. This method can overcome the biased and inaccurate faults of graphical linear fitting methods commonly used in current network research. Furthermore, it is verified to have higher goodness-of-fit than graphical methods by comparing the KS (Kolmogorov-Smirnov) test statistics for 10 CNN (Connecting Nearest-Neighbor)networks.

  9. Intrusion Detection in Wireless Body Sensor Networks

    Directory of Open Access Journals (Sweden)

    Nadya El MOUSSAID

    2017-01-01

    Full Text Available The recent advances in electronic and robotics industry have enabled the manufacturing of sensors capable of measuring a set of application-oriented parameters and transmit them back to the base station for analysis purposes. These sensors are widely used in many applications including the healthcare systems forming though a Wireless Body Sensor Networks. The medical data must be highly secured and possible intrusion has to be fully detected to proceed with the prevention phase. In this paper, we propose a new intrusion superframe schema for 802.15.6 standard to detect the cloning attack. The results proved the efficiency of our technique in detecting this type of attack based on 802.15.6 parameters performances coupled with frequency switching at the radio model.

  10. Tritium-powered radiation sensor network

    Science.gov (United States)

    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.

  11. Lifetime of Sensor Network by Exploiting Heterogeneity- A Survey

    Directory of Open Access Journals (Sweden)

    Ritesh Kumar Singh

    2014-07-01

    Full Text Available Wireless sensor networks (WSN are emerging in various fields. A large number of sensors in these applications are unattended and work autonomously. Lifetime is an important parameter which is critical for different algorithms for data transfer. Moreover it is responsible for the throughput and the failure of the network. Heterogeneous wireless sensor network, on top of clustering technique, has evolved as the major parameter to increase the lifetime of the Sensor network, data transfer, energy consumption and the scalability of the sensor network. This paper surveys the different clustering algorithm and dependencies for heterogeneous wireless sensor network. This paper is for scholars to gain sufficient knowledge of wireless sensor network (WSN, its important characteristics, and performance metrics with factors responsible for a WSN system. It can help a scholar to start a quick research by understanding all the respective parameters and energy oriented strategies in WSN.

  12. Wireless Sensor Network Handles Image Data

    Science.gov (United States)

    2008-01-01

    To relay data from remote locations for NASA s Earth sciences research, Goddard Space Flight Center contributed to the development of "microservers" (wireless sensor network nodes), which are now used commercially as a quick and affordable means to capture and distribute geographical information, including rich sets of aerial and street-level imagery. NASA began this work out of a necessity for real-time recovery of remote sensor data. These microservers work much like a wireless office network, relaying information between devices. The key difference, however, is that instead of linking workstations within one office, the interconnected microservers operate miles away from one another. This attribute traces back to the technology s original use: The microservers were originally designed for seismology on remote glaciers and ice streams in Alaska, Greenland, and Antarctica-acquiring, storing, and relaying data wirelessly between ground sensors. The microservers boast three key attributes. First, a researcher in the field can establish a "managed network" of microservers and rapidly see the data streams (recovered wirelessly) on a field computer. This rapid feedback permits the researcher to reconfigure the network for different purposes over the course of a field campaign. Second, through careful power management, the microservers can dwell unsupervised in the field for up to 2 years, collecting tremendous amounts of data at a research location. The third attribute is the exciting potential to deploy a microserver network that works in synchrony with robotic explorers (e.g., providing ground truth validation for satellites, supporting rovers as they traverse the local environment). Managed networks of remote microservers that relay data unsupervised for up to 2 years can drastically reduce the costs of field instrumentation and data rec

  13. An energy efficient clustering routing algorithm for wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    LI Li; DONG Shu-song; WEN Xiang-ming

    2006-01-01

    This article proposes an energy efficient clustering routing (EECR) algorithm for wireless sensor network. The algorithm can divide a sensor network into a few clusters and select a cluster head base on weight value that leads to more uniform energy dissipation evenly among all sensor nodes.Simulations and results show that the algorithm can save overall energy consumption and extend the lifetime of the wireless sensor network.

  14. Modular networks with hierarchical organization: The dynamical implications of complex structure

    Indian Academy of Sciences (India)

    Raj Kumar Pan; Sitabhra Sinha

    2008-08-01

    Several networks occurring in real life have modular structures that are arranged in a hierarchical fashion. In this paper, we have proposed a model for such networks, using a stochastic generation method. Using this model we show that, the scaling relation between the clustering and degree of the nodes is not a necessary property of hierarchical modular networks, as had previously been suggested on the basis of a deterministically constructed model. We also look at dynamics on such networks, in particular, the stability of equilibria of network dynamics and of synchronized activity in the network. For both of these, we find that, increasing modularity or the number of hierarchical levels tends to increase the probability of instability. As both hierarchy and modularity are seen in natural systems, which necessarily have to be robust against environmental fluctuations, we conclude that additional constraints are necessary for the emergence of hierarchical structure, similar to the occurrence of modularity through multi-constraint optimization as shown by us previously.

  15. Networked Computing in Wireless Sensor Networks for Structural Health Monitoring

    CERN Document Server

    Jindal, Apoorva

    2010-01-01

    This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discussion concrete we will focus on sensor networks used for structural health monitoring. Within this context, the heaviest computation is to determine the singular value decomposition (SVD) to extract mode shapes (eigenvectors) of a structure. Compared to collecting raw vibration data and performing SVD at a central location, computing SVD within the network can result in significantly lower energy consumption and delay. Using recent results on decomposing SVD, a well-known centralized operation, into components, we seek to determine a near-optimal communication structure that enables the distribution of this computation and the reassembly of the final results, with the objective of minimizing energy consumption subject to a computational delay constraint. We show that this reduces to a generalized clustering problem; a cluster forms a unit on w...

  16. Achieving network level privacy in Wireless Sensor Networks.

    Science.gov (United States)

    Shaikh, Riaz Ahmed; Jameel, Hassan; d'Auriol, Brian J; Lee, Heejo; Lee, Sungyoung; Song, Young-Jae

    2010-01-01

    Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.

  17. Achieving Network Level Privacy in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sungyoung Lee

    2010-02-01

    Full Text Available Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power, sensor networks (e.g., mobility and topology and QoS issues (e.g., packet reach-ability and timeliness. In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.

  18. SITRUS: Semantic Infrastructure for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Kalil A. Bispo

    2015-10-01

    Full Text Available 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.

  19. Application of Wireless Sensor Networks to Automobiles

    Science.gov (United States)

    Tavares, Jorge; Velez, Fernando J.; Ferro, João M.

    2008-01-01

    Some applications of Wireless Sensor Networks (WSNs) to the automobile are identified, and the use of Crossbow MICAz motes operating at 2.4 GHz is considered together with TinyOS support. These WSNs are conceived in order to measure, process and supply to the user diverse types of information during an automobile journey. Examples are acceleration and fuel consumption, identification of incorrect tire pressure, verification of illumination, and evaluation of the vital signals of the driver. A brief survey on WSNs concepts is presented, as well as the way the wireless sensor network itself was developed. Calibration curves were produced which allowed for obtaining luminous intensity and temperature values in the appropriate units. Aspects of the definition of the architecture and the choice/implementation of the protocols are identified. Security aspects are also addressed.

  20. Suppressing Redundancy in Wireless Sensor Network Traffic

    Science.gov (United States)

    Abe, Rey; Honiden, Shinichi

    Redundancy suppression is a network traffic compression technique that, by caching recurring transmission contents at receiving nodes, avoids repeatedly sending duplicate data. Existing implementations require abundant memory both to analyze recent traffic for redundancy and to maintain the cache. Wireless sensor nodes at the same time cannot provide such resources due to hardware constraints. The diversity of protocols and traffic patterns in sensor networks furthermore makes the frequencies and proportions of redundancy in traffic unpredictable. The common practice of narrowing down search parameters based on characteristics of representative packet traces when dissecting data for redundancy thus becomes inappropriate. Such difficulties made us devise a novel protocol that conducts a probabilistic traffic analysis to identify and cache only the subset of redundant transfers that yields most traffic savings. We verified this approach to perform close enough to a solution built on exhaustive analysis and unconstrained caching to be practicable.

  1. SITRUS: Semantic Infrastructure for Wireless Sensor Networks.

    Science.gov (United States)

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

    2015-10-29

    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.

  2. A Scalable Clustering Algorithm in Dense Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jianbo Li

    2011-03-01

    Full Text Available Clustering offers a kind of hierarchical organization to provide scalability and basic performance guarantee by partitioning the network into disjoint groups of nodes. In this paper a scalable and energy efficient clustering algorithm is proposed under dense mobile sensor networks scenario. In the initial cluster formation phase, our proposed scheme features a simple execution process with polynomial time complexity, and eliminates the “frozen time” requirement by introducing some GPS-capable mobile nodes to act as cluster heads. In the following cluster maintenance stage, the maintenance of clusters is asynchronously and event driven so as to thoroughly eliminate the “ripple effect” brought by node mobility. As a result local changes in a cluster need not be seen and updated by the entire network, thus bringing greatly reduced communication overheads and being well suitable for the high mobility environment. Extensive simulations have been conducted and the simulation results reveal that our proposed algorithm successfully achieves its target at incurring much less clustering overheads as well as maintaining much more stable cluster structure, as compared to HCC(High Connectivity Clustering  algorithm

  3. An Improved Wireless Sensor Network Routing Algorithm

    Institute of Scientific and Technical Information of China (English)

    Shengmei Luo; Xue Li; Yiai Jin; Zhixin Sun

    2015-01-01

    High performance with low power consumption is an essential factor in wireless sensor networks (WSN). In order to address the issue on the lifetime and the consumption of nodes in WSNs, an improved ad hoc on⁃demand distance vector rout⁃ing (IAODV) algorithm is proposed based on AODV and LAR protocols. This algorithm is a modified on⁃demand routing al⁃gorithm that limits data forwarding in the searching domain, and then chooses the route on basis of hop count and power consumption. The simulation results show that the algorithm can effectively reduce power consumption as well as prolong the network lifetime.

  4. A novel mathematical model for coverage in wireless sensor network

    Institute of Scientific and Technical Information of China (English)

    YAN Zhen-ya; ZHENG Bao-yu

    2006-01-01

    Coverage problem is one of the fundamental issues in the design of wireless sensor network, which has a great impact on the performance of sensor network. In this article,coverage problem was investigated using a mathematical model named Birth-death process. In this model, sensor nodes joining into networks at every period of time is considered as the rebirth of network and the quitting of sensor nodes from the networks is considered as the death of the network. In the end, an analytical solution is used to investigate the appropriate rate to meet the coverage requirement.

  5. Deterministic Secure Positioning in Wireless Sensor Networks

    CERN Document Server

    Delaët, Sylvie; Rokicki, Mariusz; Tixeuil, Sébastien

    2007-01-01

    Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location and distance information in order to fake their actual location. In this paper we propose a general distributed deterministic protocol for accurate identification of faking sensors in a WSN. Our scheme does \\emph{not} rely on a subset of \\emph{trusted} nodes that are not allowed to misbehave and are known to every node in the network. Thus, any subset of nodes is allowed to try faking its position. As in previous approaches, our protocol is based on distance evaluation techniques developed for WSN. On the positive side, we show that when the received signal strength (RSS) technique is used, our protocol handles at most $\\lfloor \\frac{n}{2} \\rfloor-2$ faking sensors. Also, when the time of flight (ToF) technique is used, our protocol manages at most $\\lfloor \\frac{n}{2} \\rfloor...

  6. Scaleable wireless web-enabled sensor networks

    Science.gov (United States)

    Townsend, Christopher P.; Hamel, Michael J.; Sonntag, Peter A.; Trutor, B.; Arms, Steven W.

    2002-06-01

    Our goal was to develop a long life, low cost, scalable wireless sensing network, which collects and distributes data from a wide variety of sensors over the internet. Time division multiple access was employed with RF transmitter nodes (each w/unique16 bit address) to communicate digital data to a single receiver (range 1/3 mile). One thousand five channel nodes can communicate to one receiver (30 minute update). Current draw (sleep) is 20 microamps, allowing 5 year battery life w/one 3.6 volt Li-Ion AA size battery. The network nodes include sensor excitation (AC or DC), multiplexer, instrumentation amplifier, 16 bit A/D converter, microprocessor, and RF link. They are compatible with thermocouples, strain gauges, load/torque transducers, inductive/capacitive sensors. The receiver (418 MHz) includes a single board computer (SBC) with Ethernet capability, internet file transfer protocols (XML/HTML), and data storage. The receiver detects data from specific nodes, performs error checking, records the data. The web server interrogates the SBC (from Microsoft's Internet Explorer or Netscape's Navigator) to distribute data. This system can collect data from thousands of remote sensors on a smart structure, and be shared by an unlimited number of users.

  7. Body sensor networks for ubiquitous healthcare

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    Body sensor networks provide a platform for ubiquitous healthcare, driving the diagnosis in hospital static environment to the daily life dynamic context. We realized the importance of sensing of activities, which is not only a dimension of human health but also important context information for diagnosis based on the physiologic data. This paper presents our ubiquitous healthcare system, uCare. It consists of uCare devices and a server system. Currently, the uCare system is designed for cardiovascular dise...

  8. Developing a new wireless sensor network platform and its application in precision agriculture.

    Science.gov (United States)

    Aquino-Santos, Raúl; González-Potes, Apolinar; Edwards-Block, Arthur; Virgen-Ortiz, Raúl Alejandro

    2011-01-01

    Wireless sensor networks are gaining greater attention from the research community and industrial professionals because these small pieces of "smart dust" offer great advantages due to their small size, low power consumption, easy integration and support for "green" applications. Green applications are considered a hot topic in intelligent environments, ubiquitous and pervasive computing. This work evaluates a new wireless sensor network platform and its application in precision agriculture, including its embedded operating system and its routing algorithm. To validate the technological platform and the embedded operating system, two different routing strategies were compared: hierarchical and flat. Both of these routing algorithms were tested in a small-scale network applied to a watermelon field. However, we strongly believe that this technological platform can be also applied to precision agriculture because it incorporates a modified version of LORA-CBF, a wireless location-based routing algorithm that uses cluster-based flooding. Cluster-based flooding addresses the scalability concerns of wireless sensor networks, while the modified LORA-CBF routing algorithm includes a metric to monitor residual battery energy. Furthermore, results show that the modified version of LORA-CBF functions well with both the flat and hierarchical algorithms, although it functions better with the flat algorithm in a small-scale agricultural network.

  9. Developing a New Wireless Sensor Network Platform and Its Application in Precision Agriculture

    Directory of Open Access Journals (Sweden)

    Raúl Alejandro Virgen-Ortiz

    2011-01-01

    Full Text Available Wireless sensor networks are gaining greater attention from the research community and industrial professionals because these small pieces of “smart dust” offer great advantages due to their small size, low power consumption, easy integration and support for “green” applications. Green applications are considered a hot topic in intelligent environments, ubiquitous and pervasive computing. This work evaluates a new wireless sensor network platform and its application in precision agriculture, including its embedded operating system and its routing algorithm. To validate the technological platform and the embedded operating system, two different routing strategies were compared: hierarchical and flat. Both of these routing algorithms were tested in a small-scale network applied to a watermelon field. However, we strongly believe that this technological platform can be also applied to precision agriculture because it incorporates a modified version of LORA-CBF, a wireless location-based routing algorithm that uses cluster-based flooding. Cluster-based flooding addresses the scalability concerns of wireless sensor networks, while the modified LORA-CBF routing algorithm includes a metric to monitor residual battery energy. Furthermore, results show that the modified version of LORA-CBF functions well with both the flat and hierarchical algorithms, although it functions better with the flat algorithm in a small-scale agricultural network.

  10. Impact of reduced scale free network on wireless sensor network

    Science.gov (United States)

    Keshri, Neha; Gupta, Anurag; Mishra, Bimal Kumar

    2016-12-01

    In heterogeneous wireless sensor network (WSN) each data-packet traverses through multiple hops over restricted communication range before it reaches the sink. The amount of energy required to transmit a data-packet is directly proportional to the number of hops. To balance the energy costs across the entire network and to enhance the robustness in order to improve the lifetime of WSN becomes a key issue of researchers. Due to high dimensionality of an epidemic model of WSN over a general scale free network, it is quite difficult to have close study of network dynamics. To overcome this complexity, we simplify a general scale free network by partitioning all of its motes into two classes: higher-degree motes and lower-degree motes, and equating the degrees of all higher-degree motes with lower-degree motes, yielding a reduced scale free network. We develop an epidemic model of WSN based on reduced scale free network. The existence of unique positive equilibrium is determined with some restrictions. Stability of the system is proved. Furthermore, simulation results show improvements made in this paper have made the entire network have a better robustness to the network failure and the balanced energy costs. This reduced model based on scale free network theory proves more applicable to the research of WSN.

  11. Key handling in wireless sensor networks

    Energy Technology Data Exchange (ETDEWEB)

    Li, Y; Newe, T [Optical Fibre Sensors Research Centre, Department of Electronic and Computer Engineering, University of Limerick, Limerick (Ireland)

    2007-07-15

    With the rapid growth of Wireless Sensor Networks (WSNs), many advanced application areas have received significant attention. However, security will be an important factor for their full adoption. Wireless sensor nodes pose unique challenges and as such traditional security protocols, used in traditional networks cannot be applied directly. Some new protocols have been published recently with the goal of providing both privacy of data and authentication of sensor nodes for WSNs. Such protocols can employ private-key and/or public key cryptographic algorithms. Public key algorithms hold the promise of simplifying the network infrastructure required to provide security services such as: privacy, authentication and non-repudiation, while symmetric algorithms require less processing power on the lower power wireless node. In this paper a selection of key establishment/agreement protocols are reviewed and they are broadly divided into two categories: group key agreement protocols and pair-wise key establishment protocols. A summary of the capabilities and security related services provided by each protocol is provided.

  12. Cooperative distributed target tracking algorithm in mobile wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    The paper proposes a cooperative distributed target tracking algorithm in mobile wireless sensor networks.There are two main components in the algorithm:distributed sensor-target assignment and sensor motion control.In the key idea of the sensor-target assignment,sensors are considered as autonomous agents and the defined objective function of each sensor concentrates on two fundamental factors:the tracking accuracy and the tracking cost.Compared with the centralized algorithm and the noncooperative distrib...

  13. Adaptive Sensor Activity Scheduling in Distributed Sensor Networks: A Statistical Mechanics Approach

    OpenAIRE

    Abhishek Srivastav; Asok Ray; Shashi Phoha

    2009-01-01

    This article presents an algorithm for adaptive sensor activity scheduling (A-SAS) in distributed sensor networks to enable detection and dynamic footprint tracking of spatial-temporal events. The sensor network is modeled as a Markov random field on a graph, where concepts of Statistical Mechanics are employed to stochastically activate the sensor nodes. Using an Ising-like formulation, the sleep and wake modes of a sensor node are modeled as spins with ferromagnetic neighborhood interaction...

  14. LWT Based Sensor Node Signal Processing in Vehicle Surveillance Distributed Sensor Network

    Science.gov (United States)

    Cha, Daehyun; Hwang, Chansik

    Previous vehicle surveillance researches on distributed sensor network focused on overcoming power limitation and communication bandwidth constraints in sensor node. In spite of this constraints, vehicle surveillance sensor node must have signal compression, feature extraction, target localization, noise cancellation and collaborative signal processing with low computation and communication energy dissipation. In this paper, we introduce an algorithm for light-weight wireless sensor node signal processing based on lifting scheme wavelet analysis feature extraction in distributed sensor network.

  15. Application of growing hierarchical SOM for visualisation of network forensics traffic data.

    Science.gov (United States)

    Palomo, E J; North, J; Elizondo, D; Luque, R M; Watson, T

    2012-08-01

    Digital investigation methods are becoming more and more important due to the proliferation of digital crimes and crimes involving digital evidence. Network forensics is a research area that gathers evidence by collecting and analysing network traffic data logs. This analysis can be a difficult process, especially because of the high variability of these attacks and large amount of data. Therefore, software tools that can help with these digital investigations are in great demand. In this paper, a novel approach to analysing and visualising network traffic data based on growing hierarchical self-organising maps (GHSOM) is presented. The self-organising map (SOM) has been shown to be successful for the analysis of highly-dimensional input data in data mining applications as well as for data visualisation in a more intuitive and understandable manner. However, the SOM has some problems related to its static topology and its inability to represent hierarchical relationships in the input data. The GHSOM tries to overcome these limitations by generating a hierarchical architecture that is automatically determined according to the input data and reflects the inherent hierarchical relationships among them. Moreover, the proposed GHSOM has been modified to correctly treat the qualitative features that are present in the traffic data in addition to the quantitative features. Experimental results show that this approach can be very useful for a better understanding of network traffic data, making it easier to search for evidence of attacks or anomalous behaviour in a network environment. Copyright © 2012 Elsevier Ltd. All rights reserved.

  16. An Efficient Multitask Scheduling Model for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Hongsheng Yin

    2014-01-01

    Full Text Available The sensor nodes of multitask wireless network are constrained in performance-driven computation. Theoretical studies on the data processing model of wireless sensor nodes suggest satisfying the requirements of high qualities of service (QoS of multiple application networks, thus improving the efficiency of network. In this paper, we present the priority based data processing model for multitask sensor nodes in the architecture of multitask wireless sensor network. The proposed model is deduced with the M/M/1 queuing model based on the queuing theory where the average delay of data packets passing by sensor nodes is estimated. The model is validated with the real data from the Huoerxinhe Coal Mine. By applying the proposed priority based data processing model in the multitask wireless sensor network, the average delay of data packets in a sensor nodes is reduced nearly to 50%. The simulation results show that the proposed model can improve the throughput of network efficiently.

  17. Distributed Service Discovery for Heterogeneous Wireless Sensor Networks

    NARCIS (Netherlands)

    Marin-Perianu, R.S.; Scholten, J.; Havinga, P.J.M.

    2006-01-01

    Service discovery in heterogeneous Wireless Sensor Networks is a challenging research objective, due to the inherent limitations of sensor nodes and their extensive and dense deployment. The protocols proposed for ad hoc networks are too heavy for sensor environments. This paper presents a resourcea

  18. Artificial intelligence based event detection in wireless sensor networks

    NARCIS (Netherlands)

    Bahrepour, Majid

    2013-01-01

    Wireless sensor networks (WSNs) are composed of large number of small, inexpensive devices, called sensor nodes, which are equipped with sensing, processing, and communication capabilities. While traditional applications of wireless sensor networks focused on periodic monitoring, the focus of more r

  19. System-level Modeling of Wireless Integrated Sensor Networks

    DEFF Research Database (Denmark)

    Virk, Kashif M.; Hansen, Knud; Madsen, Jan

    2005-01-01

    Wireless integrated sensor networks have emerged as a promising infrastructure for a new generation of monitoring and tracking applications. In order to efficiently utilize the extremely limited resources of wireless sensor nodes, accurate modeling of the key aspects of wireless sensor networks i...

  20. EESA Algorithm in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Pei Zhang

    2014-04-01

    Full Text Available Since there are many problems of traditional extended clustering algorithm in wireless sensor network like short extended time, over energy consumption, too many deviated position the of cluster head nodes and so on, this paper proposes the EESA algorithm. The algorithm makes many improvements on the way of dividing clusters, strategy of electing the cluster head and construction method of data relay path, the two aspects of inter-cluster energy balance and energy balance among the cluster are taken into account at the same time. Detailed simulation results are taken in this thesis to compare network lifetime, average residual energy, energy consumption standard deviation of cluster head node and changes of average remaining energy between the EESA algorithm and ACT algorithm, EECA algorithm and MR-LEACH algorithm; the simulation results show that: the proposed algorithm reduces the load of hot regional cluster head, balances the energy consumption of the entire network nodes and extends the networks lifetime of wireless sensor

  1. Survey on Routing Protocols for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Aman Sharma

    2012-02-01

    Full Text Available Different routing protocol perform different role in the underwater sensor network. All routing perform each and specific task into underwater sensor network which responsible for networking problems issue that is why this is the latest way of research. Routing term derived from “route” that means a path a way that perform different terms in underwater sensor network problem related issue. The best part is today many routing protocol are present in the underwater wireless sensor network. Some different attributes comes underwater wireless sensor network like likes high bit error rates, limited band-width, 3D deployment and high propagation delay. This paper is referring to as helpful for giving brief overview about each and every protocol and responsible for entire underwater wireless sensor network

  2. Three-dimensional ocean sensor networks: A survey

    Science.gov (United States)

    Wang, Yu; Liu, Yingjian; Guo, Zhongwen

    2012-12-01

    The past decade has seen a growing interest in ocean sensor networks because of their wide applications in marine research, oceanography, ocean monitoring, offshore exploration, and defense or homeland security. Ocean sensor networks are generally formed with various ocean sensors, autonomous underwater vehicles, surface stations, and research vessels. To make ocean sensor network applications viable, efficient communication among all devices and components is crucial. Due to the unique characteristics of underwater acoustic channels and the complex deployment environment in three dimensional (3D) ocean spaces, new efficient and reliable communication and networking protocols are needed in design of ocean sensor networks. In this paper, we aim to provide an overview of the most recent advances in network design principles for 3D ocean sensor networks, with focuses on deployment, localization, topology design, and position-based routing in 3D ocean spaces.

  3. Three-Dimensional Ocean Sensor Networks: A Survey

    Institute of Scientific and Technical Information of China (English)

    WANG Yu; LIU Yingjian; GUO Zhongwen

    2012-01-01

    The past decade has seen a growing interest in ocean sensor networks because of their wide applications in marine research,oceanography,ocean monitoring,offshore exploration,and defense or homeland security.Ocean sensor networks are generally formed with various ocean sensors,autonomous underwater vehicles,surface stations,and research vessels.To make ocean sensor network applications viable,efficient communication among all devices and components is crucial.Due to the unique characteristics of underwater acoustic channels and the complex deployment environment in three dimensional (3D) ocean spaces,new efficient and reliable communication and networking protocols are needed in design of ocean sensor networks.In this paper,we aim to provide an overview of the most recent advances in network design principles for 3D ocean sensor networks,with focuses on deployment,localization,topology design,and position-based routing in 3D ocean spaces.

  4. A Hierarchical Approach to Persistent Scatterer Network Construction and Deformation Time Series Estimation

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2014-12-01

    Full Text Available This paper presents a hierarchical approach to network construction and time series estimation in persistent scatterer interferometry (PSI for deformation analysis using the time series of high-resolution satellite SAR images. To balance between computational efficiency and solution accuracy, a dividing and conquering algorithm (i.e., two levels of PS networking and solution is proposed for extracting deformation rates of a study area. The algorithm has been tested using 40 high-resolution TerraSAR-X images collected between 2009 and 2010 over Tianjin in China for subsidence analysis, and validated by using the ground-based leveling measurements. The experimental results indicate that the hierarchical approach can remarkably reduce computing time and memory requirements, and the subsidence measurements derived from the hierarchical solution are in good agreement with the leveling data.

  5. Ultra wideband technology for wireless sensor networks

    Science.gov (United States)

    Wang, Yue; Xiong, Weiming

    2011-08-01

    Wireless sensor networks (WSNs) have emerged as an important method for planetary surface exploration. To investigate the optimized wireless technology for WSNs, we summarized the key requirements of WSNs and justified ultra wideband (UWB) technology by comparing with other competitive wireless technologies. We also analyzed network topologies as well as physical and MAC layer designs of IEEE 802.15.4a standard, which adopted impulse radio UWB (IR-UWB) technology. Our analysis showed that IR-UWB-based 802.15.4a standard could enable robust communication, precise ranging, and heterogeneous networking for WSNs applications. The result of our present work implies that UWB-based WSNs can be applied to future planetary surface exploration.

  6. Development of Time Synchronized Wireless Sensor Network

    Science.gov (United States)

    Uchimura, Yutaka; Takahashi, Motoichi; Nasu, Tadashi

    Network based wireless sensing has become an important area of research and various new applications for remote sensing are expected to emerge. One of the promising applications is structural health monitoring of building or civil engineering structure and it often requires vibration measurement. For the vibration measurement via wireless network, time synchronization is indispensable. In this paper, we introduce a newly developed time synchronized wireless sensor network system. The system employs IEEE 802.11 standard based TSF counter and sends the measured data with the counter value. It enables consistency on common clock among different wireless nodes. We describe the accuracy evaluation by simulation studies when the size of nodes increased. The hardware and software specifications of the developed wireless sensing system are shown. The experiments were conducted in a three-street reinforced concrete building and results showed the system performs more than sufficiently.

  7. An efficient architecture for the integration of sensor and actuator networks into the future internet

    Science.gov (United States)

    Schneider, J.; Klein, A.; Mannweiler, C.; Schotten, H. D.

    2011-08-01

    In the future, sensors will enable a large variety of new services in different domains. Important application areas are service adaptations in fixed and mobile environments, ambient assisted living, home automation, traffic management, as well as management of smart grids. All these applications will share a common property, the usage of networked sensors and actuators. To ensure an efficient deployment of such sensor-actuator networks, concepts and frameworks for managing and distributing sensor data as well as for triggering actuators need to be developed. In this paper, we present an architecture for integrating sensors and actuators into the future Internet. In our concept, all sensors and actuators are connected via gateways to the Internet, that will be used as comprehensive transport medium. Additionally, an entity is needed for registering all sensors and actuators, and managing sensor data requests. We decided to use a hierarchical structure, comparable to the Domain Name Service. This approach realizes a cost-efficient architecture disposing of "plug and play" capabilities and accounting for privacy issues.

  8. Time synchronization in ad-hoc wireless sensor networks

    Science.gov (United States)

    Sharma, Nishant

    2013-06-01

    Advances in micro-electronics and developments in the various technologies have given birth to this era of wireless sensor networks. A sensor network is the one which provides information about the surrounding environment by sensing it and clock synchronization in wireless sensor networks plays a vital role to maintain the integrity of entire network. In this paper two major low energy consumption clock synchronization algorithms, Reference Broadcast Synchronization (RBS) and Timing-Sync Protocol for Sensor Networks (TPSN) are simulated, which result in high level of accuracy, reliability, handles substantially greater node densities, supports mobility, and hence perform well under all possible conditions.

  9. Detecting Hidden Hierarchy of Non Hierarchical Terrorist Networks

    DEFF Research Database (Denmark)

    Memon, Nasrullah

    to analyze terrorist networks and prioritize their targets. Applying recently introduced mathematical methods for constructing the hidden hierarchy of "nonhierarchical" terrorist networks; we present case studies of the terrorist attacks occurred / planned in the past, in order to identify hidden hierarchy...

  10. A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes

    Science.gov (United States)

    Craveirinha, José; Girão-Silva, Rita; Clímaco, João; Martins, Lúcia

    This work presents a model for multiobjective routing in MPLS networks formulated within a hierarchical network-wide optimization framework, with two classes of services, namely QoS and Best Effort (BE) services. The routing model uses alternative routing and hierarchical optimization with two optimization levels, including fairness objectives. Another feature of the model is the use of an approximate stochastic representation of the traffic flows in the network, based on the concept of effective bandwidth. The theoretical foundations of a heuristic strategy for finding “good” compromise solutions to the very complex bi-level routing optimization problem, based on a conjecture concerning the definition of marginal implied costs for QoS flows and BE flows, will be described. The main features of a first version of this heuristic based on a bi-objective shortest path model and some preliminary results for a benchmark network will also be revealed.

  11. Sensors on speaking terms: Schedule-based medium access control protocols for wireless sensor networks

    NARCIS (Netherlands)

    van Hoesel, L.F.W.

    2007-01-01

    Wireless sensor networks make the previously unobservable, observable. The basic idea behind these networks is straightforward: all wires are cut in traditional sensing systems and the sensors are equipped with batteries and radio's to virtually restore the cut wires. The resulting sensors can be pl

  12. Sensors on speaking terms : schedule-based medium access control protocols for wireless sensor networks

    NARCIS (Netherlands)

    Hoesel, van Lodewijk Frans Willem

    2007-01-01

    Wireless sensor networks make the previously unobservable, observable. The basic idea behind these networks is straightforward: all wires are cut in traditional sensing systems and the sensors are equipped with batteries and radio’s to virtually restore the cut wires. The resulting sensors can be pl

  13. Effective Hierarchical Routing Algorithm for Large-scale Wireless Mobile Networks

    Directory of Open Access Journals (Sweden)

    Guofeng Yan

    2014-02-01

    Full Text Available The growing interest in wireless mobile network techniques has resulted in many routing protocol proposals. The unpredictable motion and the unreliable behavior of mobile nodes is one of the key issues in wireless mobile network. Virtual mobile node (VMN consists of robust virtual nodes that are both predictable and reliable. Based on VMN, in this paper, we present a hierarchical routing algorithm, i.e., EHRA-WAVE, for large-scale wireless mobile networks. By using mobile WAVE technology, a routing path can be found rapidly between VMNs without accurate topology information. We introduce the routing algorithm and the implementation issues of the proposed EHRA-WAVE routing algorithm. Finally, we evaluate the performance of EHRA-WAVE through experiments, and compare the performance on VMN failure and message delivery ratio using hierarchical and non-hierarchical routing methods. However, due to the large amounts WAVE flooding, EHRAWAVE results in too large load which would impede the application of the EHRA-WAVE algorithm. Therefore, the further routing protocol focuses on minimizing the number of WAVE using hierarchical structures in large-scale wireless mobile networks

  14. Bottom-up GGM algorithm for constructing multiple layered hierarchical gene regulatory networks

    Science.gov (United States)

    Multilayered hierarchical gene regulatory networks (ML-hGRNs) are very important for understanding genetics regulation of biological pathways. However, there are currently no computational algorithms available for directly building ML-hGRNs that regulate biological pathways. A bottom-up graphic Gaus...

  15. A Novel Hierarchical Semi-centralized Telemedicine Network Architecture Proposition for Bangladesh

    DEFF Research Database (Denmark)

    Choudhury, Samiul; Peterson, Carrie Beth; Kyriazakos, Sofoklis

    2011-01-01

    where there are extreme paucities of efficient healthcare professionals and equipments, specifically in the rural areas. In this paper a novel, hierarchical and semi-centralized telemedicine network architecture has been proposed holisti-cally focusing on the rural underdeveloped areas of Bangladesh...... of Bangladesh. Finally, some features and services associated with the model have also been proposed which are pragmatic and easily implementable....

  16. Cross-Layer Protocol Combining Tree Routing and TDMA Slotting in Wireless Sensor Networks

    Science.gov (United States)

    Bai, Ronggang; Ji, Yusheng; Lin, Zhiting; Wang, Qinghua; Zhou, Xiaofang; Qu, Yugui; Zhao, Baohua

    Being different from other networks, the load and direction of data traffic for wireless sensor networks are rather predictable. The relationships between nodes are cooperative rather than competitive. These features allow the design approach of a protocol stack to be able to use the cross-layer interactive way instead of a hierarchical structure. The proposed cross-layer protocol CLWSN optimizes the channel allocation in the MAC layer using the information from the routing tables, reduces the conflicting set, and improves the throughput. Simulations revealed that it outperforms SMAC and MINA in terms of delay and energy consumption.

  17. Virtualization in Wireless Sensor Network: Challenges and Opportunities

    Directory of Open Access Journals (Sweden)

    Md. Motaharul Islam

    2012-03-01

    Full Text Available Wireless Sensor Networks (WSNs are gaining importance for their broad range of commercial applications such as in home automation, health-care and industrial automation. In these applications multi-vendor and heterogeneous sensor nodes are deployed. Due to strict administrative control over the WSN domains, communication barrier, conflicting goal & economic interest of different vendors of sensor node in WSN make it difficult to introduce a large scale federated WSN. By allowing heterogeneous wireless sensor networks to coexist on a shared physical substrate, virtualization in sensor network may provide flexibility, promote diversity, ensure security and increase manageability. This paper surveys the novel approach of using the large scale federated WSN resources in a sensor virtualization environment. In this paper we propose sensor virtualization architecture and focus on the challenges and opportunities of research in the field of sensor network virtualization as well as to illustrate a picture of current researches in this field.

  18. a survey of security vulnerabilities in wireless sensor networks

    African Journals Online (AJOL)

    user

    Sensor networks offer a powerful combination of distributed sensing, computing and communications. They lend ... These tiny sensor nodes, consisting of sensing, data ... base station (or gateway) which in turn sends it to the user as shown in ...

  19. Low-power Radar for Wireless Sensor Networks

    NARCIS (Netherlands)

    Ditzel, M.; Elferink, F.H.

    2006-01-01

    Abstract—This paper presents the results of a short study on the feasibility of radars as the primary means of sensing in ad-hoc wireless sensor networks. Radar offers distinct advantages over others means of sensing, normally found in this kind of networks. The sensor networks being considered cons

  20. An Efficient Management System for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mei-Yu Lee

    2010-12-01

    Full Text Available Wireless sensor networks have garnered considerable attention recently. Networks typically have many sensor nodes, and are used in commercial, medical, scientific, and military applications for sensing and monitoring the physical world. Many researchers have attempted to improve wireless sensor network management efficiency. A Simple Network Management Protocol (SNMP-based sensor network management system was developed that is a convenient and effective way for managers to monitor and control sensor network operations. This paper proposes a novel WSNManagement system that can show the connections stated of relationships among sensor nodes and can be used for monitoring, collecting, and analyzing information obtained by wireless sensor networks. The proposed network management system uses collected information for system configuration. The function of performance analysis facilitates convenient management of sensors. Experimental results show that the proposed method enhances the alive rate of an overall sensor node system, reduces the packet lost rate by roughly 5%, and reduces delay time by roughly 0.2 seconds. Performance analysis demonstrates that the proposed system is effective for wireless sensor network management.

  1. An efficient management system for wireless sensor networks.

    Science.gov (United States)

    Ma, Yi-Wei; Chen, Jiann-Liang; Huang, Yueh-Min; Lee, Mei-Yu

    2010-01-01

    Wireless sensor networks have garnered considerable attention recently. Networks typically have many sensor nodes, and are used in commercial, medical, scientific, and military applications for sensing and monitoring the physical world. Many researchers have attempted to improve wireless sensor network management efficiency. A Simple Network Management Protocol (SNMP)-based sensor network management system was developed that is a convenient and effective way for managers to monitor and control sensor network operations. This paper proposes a novel WSNManagement system that can show the connections stated of relationships among sensor nodes and can be used for monitoring, collecting, and analyzing information obtained by wireless sensor networks. The proposed network management system uses collected information for system configuration. The function of performance analysis facilitates convenient management of sensors. Experimental results show that the proposed method enhances the alive rate of an overall sensor node system, reduces the packet lost rate by roughly 5%, and reduces delay time by roughly 0.2 seconds. Performance analysis demonstrates that the proposed system is effective for wireless sensor network management.

  2. The exact Laplacian spectrum for the Dyson hierarchical network

    CERN Document Server

    Agliari, Elena

    2016-01-01

    We consider the Dyson hierarchical graph $\\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\\sigma \\in (1/2, 1]$. Exploiting the deterministic recursivity through which $\\mathcal{G}$ is built, we are able to derive explicitly the whole set of the eigenvalues and the eigenvectors for its Laplacian matrix. Given that the Laplacian operator is intrinsically implied in the analysis of dynamic processes (e.g., random walks) occurring on the graph, as well as in the investigation of the dynamical properties of connected structures themselves (e.g., vibrational structures and the relaxation modes), this result allows addressing analytically a large class of problems. In particular, as examples of applications, we study the random walk and the continuous-time quantum walk embedded in $\\mathcal{G}$, and the relaxation times of a polymer whose structure is described by $\\mathcal{G}$.

  3. The exact Laplacian spectrum for the Dyson hierarchical network

    Science.gov (United States)

    Agliari, Elena; Tavani, Flavia

    2017-01-01

    We consider the Dyson hierarchical graph , that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter σ ∈ (1/2, 1]. Exploiting the deterministic recursivity through which is built, we are able to derive explicitly the whole set of the eigenvalues and the eigenvectors for its Laplacian matrix. Given that the Laplacian operator is intrinsically implied in the analysis of dynamic processes (e.g., random walks) occurring on the graph, as well as in the investigation of the dynamical properties of connected structures themselves (e.g., vibrational structures and relaxation modes), this result allows addressing analytically a large class of problems. In particular, as examples of applications, we study the random walk and the continuous-time quantum walk embedded in , the relaxation times of a polymer whose structure is described by , and the community structure of in terms of modularity measures.

  4. Cluster based hierarchical resource searching model in P2P network

    Institute of Scientific and Technical Information of China (English)

    Yang Ruijuan; Liu Jian; Tian Jingwen

    2007-01-01

    For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer (P2P) network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network,auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.

  5. Avalanche transmission and critical behaviour in load-bearing hierarchical networks

    Indian Academy of Sciences (India)

    Ajay Deep Kachhvah; Neelima Gupte

    2011-11-01

    The strength and stability properties of hierarchical load-bearing networks and their strengthened variants have been discussed in a recent work. Here, we study the avalanche time distributions on these load-bearing networks. The avalanche time distributions of the V-lattice, a unique realization of the networks, show power-law behaviour when tested with certain fractions of its trunk weights. All other avalanche distributions show Gaussian peaked behaviour. Thus the V-lattice is the critical case of the network. We discuss the implications of this result.

  6. Internal representation of hierarchical sequences involves the default network

    Directory of Open Access Journals (Sweden)

    Rogers Baxter P

    2010-04-01

    Full Text Available Abstract Background The default network is a set of brain regions that exhibit a reduction in BOLD response during attention-demanding cognitive tasks, and distinctive patterns of functional connectivity that typically include anti-correlations with a fronto-parietal network involved in attention, working memory, and executive control. The function of the default network regions has been attributed to introspection, self-awareness, and theory of mind judgments, and some of its regions are involved in episodic memory processes. Results Using the method of psycho-physiological interactions, we studied the functional connectivity of several regions in a fronto-parietal network involved in a paired image discrimination task involving transitive inference. Some image pairs were derived from an implicit underlying sequence A>B>C>D>E, and some were independent (F>G, H>J, etc. Functional connectivity between the fronto-parietal regions and the default network regions depended on the presence of the underlying sequence relating the images. When subjects viewed learned and novel pairs from the sequence, connectivity between these two networks was higher than when subjects viewed learned and novel pairs from the independent sets. Conclusions These results suggest that default network regions were involved in maintaining the internal model that subserved discrimination of image pairs derived from the implicit sequence, and contributed to introspective access of an internal sequence model built during training. The default network may not be a unified entity with a specific function, but rather may interact with other functional networks in task-dependent ways.

  7. Ubiquitous Mobile Awareness from Sensor Networks

    Science.gov (United States)

    Kanter, Theo; Pettersson, Stefan; Forsström, Stefan; Kardeby, Victor; Österberg, Patrik

    Users require applications and services to be available everywhere, enabling them to focus on what is important to them. Therefore, context information (e.g., spatial data, user preferences, available connectivity and devices, etc.) has to be accessible to applications that run in end systems close to users. In response to this, we present a novel architecture for ubiquitous sensing and sharing of context in mobile services and applications. The architecture offers distributed storage of context derived from sensor networks wirelessly attached to mobile phones and other devices. The architecture also handles frequent updates of sensor information and is interoperable with presence in 3G mobile systems, thus enabling ubiquitous sensing applications. We demonstrate these concepts and the principle operation in a sample ubiquitous Mobile Awareness service.

  8. Wireless Sensor Networks Formation: Approaches and Techniques

    Directory of Open Access Journals (Sweden)

    Miriam Carlos-Mancilla

    2016-01-01

    Full Text Available Nowadays, wireless sensor networks (WSNs emerge as an active research area in which challenging topics involve energy consumption, routing algorithms, selection of sensors location according to a given premise, robustness, efficiency, and so forth. Despite the open problems in WSNs, there are already a high number of applications available. In all cases for the design of any application, one of the main objectives is to keep the WSN alive and functional as long as possible. A key factor in this is the way the network is formed. This survey presents most recent formation techniques and mechanisms for the WSNs. In this paper, the reviewed works are classified into distributed and centralized techniques. The analysis is focused on whether a single or multiple sinks are employed, nodes are static or mobile, the formation is event detection based or not, and network backbone is formed or not. We focus on recent works and present a discussion of their advantages and drawbacks. Finally, the paper overviews a series of open issues which drive further research in the area.

  9. Simultaneity Analysis In A Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Malović Miodrag

    2015-06-01

    Full Text Available An original wireless sensor network for vibration measurements was designed. Its primary purpose is modal analysis of vibrations of large structures. A number of experiments have been performed to evaluate the system, with special emphasis on the influence of different effects on simultaneity of data acquired from remote nodes, which is essential for modal analysis. One of the issues is that quartz crystal oscillators, which provide time reading on the devices, are optimized for use in the room temperature and exhibit significant frequency variations if operated outside the 20–30°C range. Although much research was performed to optimize algorithms of synchronization in wireless networks, the subject of temperature fluctuations was not investigated and discussed in proportion to its significance. This paper describes methods used to evaluate data simultaneity and some algorithms suitable for its improvement in small to intermediate size ad-hoc wireless sensor networks exposed to varying temperatures often present in on-site civil engineering measurements.

  10. Cognitive Radio Wireless Sensor Networks: Applications, Challenges and Research Trends

    Directory of Open Access Journals (Sweden)

    Gyanendra Prasad Joshi

    2013-08-01

    Full Text Available A cognitive radio wireless sensor network is one of the candidate areas where cognitive techniques can be used for opportunistic spectrum access. Research in this area is still in its infancy, but it is progressing rapidly. The aim of this study is to classify the existing literature of this fast emerging application area of cognitive radio wireless sensor networks, highlight the key research that has already been undertaken, and indicate open problems. This paper describes the advantages of cognitive radio wireless sensor networks, the difference between ad hoc cognitive radio networks, wireless sensor networks, and cognitive radio wireless sensor networks, potential application areas of cognitive radio wireless sensor networks, challenges and research trend in cognitive radio wireless sensor networks. The sensing schemes suited for cognitive radio wireless sensor networks scenarios are discussed with an emphasis on cooperation and spectrum access methods that ensure the availability of the required QoS. Finally, this paper lists several open research challenges aimed at drawing the attention of the readers toward the important issues that need to be addressed before the vision of completely autonomous cognitive radio wireless sensor networks can be realized.

  11. Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

    Directory of Open Access Journals (Sweden)

    Marjan Radi

    2012-01-01

    Full Text Available A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

  12. Cognitive radio wireless sensor networks: applications, challenges and research trends.

    Science.gov (United States)

    Joshi, Gyanendra Prasad; Nam, Seung Yeob; Kim, Sung Won

    2013-08-22

    A cognitive radio wireless sensor network is one of the candidate areas where cognitive techniques can be used for opportunistic spectrum access. Research in this area is still in its infancy, but it is progressing rapidly. The aim of this study is to classify the existing literature of this fast emerging application area of cognitive radio wireless sensor networks, highlight the key research that has already been undertaken, and indicate open problems. This paper describes the advantages of cognitive radio wireless sensor networks, the difference between ad hoc cognitive radio networks, wireless sensor networks, and cognitive radio wireless sensor networks, potential application areas of cognitive radio wireless sensor networks, challenges and research trend in cognitive radio wireless sensor networks. The sensing schemes suited for cognitive radio wireless sensor networks scenarios are discussed with an emphasis on cooperation and spectrum access methods that ensure the availability of the required QoS. Finally, this paper lists several open research challenges aimed at drawing the attention of the readers toward the important issues that need to be addressed before the vision of completely autonomous cognitive radio wireless sensor networks can be realized.

  13. Multipath routing in wireless sensor networks: survey and research challenges.

    Science.gov (United States)

    Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

  14. 7th China Conference on Wireless Sensor Networks

    CERN Document Server

    Cui, Li; Guo, Zhongwen

    2014-01-01

    Advanced Technologies in Ad Hoc and Sensor Networks collects selected papers from the 7th China Conference on Wireless Sensor Networks (CWSN2013) held in Qingdao, October 17-19, 2013. The book features state-of-the-art studies on Sensor Networks in China with the theme of “Advances in wireless sensor networks of China”. The selected works can help promote development of sensor network technology towards interconnectivity, resource sharing, flexibility and high efficiency. Researchers and engineers in the field of sensor networks can benefit from the book. Xue Wang is a professor at Tsinghua University; Li Cui is a professor at Institute of Computing Technology, Chinese Academy of Sciences; Zhongwen Guo is a professor at Ocean University of China.

  15. A Review on Sensor Network Issues and Robotics

    Directory of Open Access Journals (Sweden)

    Ji Hyoung Ryu

    2015-01-01

    Full Text Available The interaction of distributed robotics and wireless sensor networks has led to the creation of mobile sensor networks. There has been an increasing interest in building mobile sensor networks and they are the favored class of WSNs in which mobility plays a key role in the execution of an application. More and more researches focus on development of mobile wireless sensor networks (MWSNs due to its favorable advantages and applications. In WSNs robotics can play a crucial role, and integrating static nodes with mobile robots enhances the capabilities of both types of devices and enables new applications. In this paper we present an overview on mobile sensor networks in robotics and vice versa and robotic sensor network applications.

  16. Multilevel hierarchical kernel spectral clustering for real-life large scale complex networks.

    Directory of Open Access Journals (Sweden)

    Raghvendra Mall

    Full Text Available Kernel spectral clustering corresponds to a weighted kernel principal component analysis problem in a constrained optimization framework. The primal formulation leads to an eigen-decomposition of a centered Laplacian matrix at the dual level. The dual formulation allows to build a model on a representative subgraph of the large scale network in the training phase and the model parameters are estimated in the validation stage. The KSC model has a powerful out-of-sample extension property which allows cluster affiliation for the unseen nodes of the big data network. In this paper we exploit the structure of the projections in the eigenspace during the validation stage to automatically determine a set of increasing distance thresholds. We use these distance thresholds in the test phase to obtain multiple levels of hierarchy for the large scale network. The hierarchical structure in the network is determined in a bottom-up fashion. We empirically showcase that real-world networks have multilevel hierarchical organization which cannot be detected efficiently by several state-of-the-art large scale hierarchical community detection techniques like the Louvain, OSLOM and Infomap methods. We show that a major advantage of our proposed approach is the ability to locate good quality clusters at both the finer and coarser levels of hierarchy using internal cluster quality metrics on 7 real-life networks.

  17. Trimethylamine Sensors Based on Au-Modified Hierarchical Porous Single-Crystalline ZnO Nanosheets

    Directory of Open Access Journals (Sweden)

    Fanli Meng

    2017-06-01

    Full Text Available It is of great significance for dynamic monitoring of foods in storage or during the transportation process through on-line detecting trimethylamine (TMA. Here, TMA were sensitively detected by Au-modified hierarchical porous single-crystalline ZnO nanosheets (HPSCZNs-based sensors. The HPSCZNs were synthesized through a one-pot wet-chemical method followed by an annealing treatment. Polyethyleneimine (PEI was used to modify the surface of the HPSCZNs, and then the PEI-modified samples were mixed with Au nanoparticles (NPs sol solution. Electrostatic interactions drive Au nanoparticles loading onto the surface of the HPSCZNs. The Au-modified HPSCZNs were characterized by X-ray diffraction (XRD, scanning electron microscopy (SEM, transmission electron microscopy (TEM and energy dispersive spectrum (EDS, respectively. The results show that Au-modified HPSCZNs-based sensors exhibit a high response to TMA. The linear range is from 10 to 300 ppb; while the detection limit is 10 ppb, which is the lowest value to our knowledge.

  18. A Flexible and Efficient Key Distribution Scheme for Renewable Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    An-Ni Shen

    2009-01-01

    Full Text Available Many applications of wireless sensor network require secure data communications, especially in a hostile environment. In order to protect the sensitive data and the sensor readings, secret keys should be used to encrypt the exchanged messages between communicating nodes. Traditional asymmetric key cryptosystems are infeasible in WSN due to its low capacity at each senor node. In this paper, we propose a new key distribution scheme for hierarchical WSNs with renewable network devices. Compared to some of the existing schemes, our key establishment methods possess the following features that are particularly beneficial to the resource-constrained large-scale WSNs: (1 robustness to the node capture attack, (2 flexibility for adding new network devices, (3 scalability in terms of storage cost, and (4 low communication overhead.

  19. Industrial wireless sensor networks applications, protocols, and standards

    CERN Document Server

    Güngör, V Çagri

    2013-01-01

    The collaborative nature of industrial wireless sensor networks (IWSNs) brings several advantages over traditional wired industrial monitoring and control systems, including self-organization, rapid deployment, flexibility, and inherent intelligent processing. In this regard, IWSNs play a vital role in creating more reliable, efficient, and productive industrial systems, thus improving companies' competitiveness in the marketplace. Industrial Wireless Sensor Networks: Applications, Protocols, and Standards examines the current state of the art in industrial wireless sensor networks and outline

  20. Susceptibility of sensor networks to intentional electromagnetic interference

    OpenAIRE

    Delsing, Jerker; Ekman, Jonas; Johansson, Jonny; Sundberg, Sofia; Bäckström, Mats; Nilsson, T.

    2006-01-01

    It is reasonable to think that sensor networks might be part of society critical systems in the future. Therefor this paper discusses and shows the vulnerabilities of sensor networks to intentional electromagnetic interference (IEMI). Principle ways of sensor network IEMI is addressed and followed by a discussion on schemes for protection. Experimental results for both in-band and exband interference from low- and high- level sources is reported. It is obvious that more emphasis has to be put...

  1. Key Predistribution Schemes for Distributed Sensor Networks

    CERN Document Server

    Bose, Mausumi; Mukerjee, Rahul

    2011-01-01

    Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and this makes the method quite flexible. We also obtain explicit algebraic expressions for the metrics for local connectivity and resiliency. These schemes are quite efficient with regard to connectivity and resiliency and at the same time they allow a straightforward shared-key discovery.

  2. BABY MONITORING SYSTEM USING WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    G. Rajesh

    2014-09-01

    Full Text Available Sudden Infant Death Syndrome (SIDS is marked by the sudden death of an infant during sleep that is not predicted by the medical history and remains unexplained even after thorough forensic autopsy and detailed death investigation. In this we developed a system that provides solutions for the above problems by making the crib smart using the wireless sensor networks (WSN and smart phones. The system provides visual monitoring service through live video, alert services by crib fencing and awakens alert, monitoring services by temperature reading and light intensity reading, vaccine reminder and weight monitoring.

  3. Wireless sensor networks from theory to applications

    CERN Document Server

    El Emary, Ibrahiem M M

    2013-01-01

    Although there are many books available on WSNs, most are low-level, introductory books. The few available for advanced readers fail to convey the breadth of knowledge required for those aiming to develop next-generation solutions for WSNs. Filling this void, Wireless Sensor Networks: From Theory to Applications supplies comprehensive coverage of WSNs. In order to provide the wide-ranging guidance required, the book brings together the contributions of domain experts working in the various subfields of WSNs worldwide. This edited volume examines recent advances in WSN technologies and consider

  4. Wireless sensors networks MAC protocols analysis

    CERN Document Server

    Chaari, Lamia

    2010-01-01

    Wireless sensors networks performance are strictly related to the medium access mechanism. An effective one, require non-conventional paradigms for protocol design due to several constraints. An adequate equilibrium between communication improvement and data processing capabilities must be accomplished. To achieve low power operation, several MAC protocols already proposed for WSN. The aim of this paper is to survey and to analyze the most energy efficient MAC protocol in order to categorize them and to compare their performances. Furthermore we have implemented some of WSN MAC protocol under OMNET++ with the purpose to evaluate their performances.

  5. Energy Efficiency in Underwater Sensor Networks: a Research Review

    Directory of Open Access Journals (Sweden)

    V. Kanakaris

    2010-01-01

    Full Text Available In an energy-constrained underwater system environment it is very important to find ways to improve the life expectancy ofthe sensors. Compared to the sensors of a terrestrial Ad Hoc Wireless Sensor Network (WSN, underwater sensors cannotuse solar energy to recharge the batteries, and it is difficult to replace the batteries in the sensors. This paper reviews theresearch progress made to date in the area of energy consumption in underwater sensor networks (UWSN and suggestsfurther research that needs to be carried out in order to increase the energy efficiency of the UWSN system.

  6. Underwater Electromagnetic Sensor Networks, Part II: Localization and Network Simulations

    Directory of Open Access Journals (Sweden)

    Javier Zazo

    2016-12-01

    Full Text Available In the first part of the paper, we modeled and characterized the underwater radio channel in shallowwaters. In the second part,we analyze the application requirements for an underwaterwireless sensor network (U-WSN operating in the same environment and perform detailed simulations. We consider two localization applications, namely self-localization and navigation aid, and propose algorithms that work well under the specific constraints associated with U-WSN, namely low connectivity, low data rates and high packet loss probability. We propose an algorithm where the sensor nodes collaboratively estimate their unknown positions in the network using a low number of anchor nodes and distance measurements from the underwater channel. Once the network has been self-located, we consider a node estimating its position for underwater navigation communicating with neighboring nodes. We also propose a communication system and simulate the whole electromagnetic U-WSN in the Castalia simulator to evaluate the network performance, including propagation impairments (e.g., noise, interference, radio parameters (e.g., modulation scheme, bandwidth, transmit power, hardware limitations (e.g., clock drift, transmission buffer and complete MAC and routing protocols. We also explain the changes that have to be done to Castalia in order to perform the simulations. In addition, we propose a parametric model of the communication channel that matches well with the results from the first part of this paper. Finally, we provide simulation results for some illustrative scenarios.

  7. Underwater Electromagnetic Sensor Networks, Part II: Localization and Network Simulations.

    Science.gov (United States)

    Zazo, Javier; Macua, Sergio Valcarcel; Zazo, Santiago; Pérez, Marina; Pérez-Álvarez, Iván; Jiménez, Eugenio; Cardona, Laura; Brito, Joaquín Hernández; Quevedo, Eduardo

    2016-12-17

    In the first part of the paper, we modeled and characterized the underwater radio channel in shallowwaters. In the second part,we analyze the application requirements for an underwaterwireless sensor network (U-WSN) operating in the same environment and perform detailed simulations. We consider two localization applications, namely self-localization and navigation aid, and propose algorithms that work well under the specific constraints associated with U-WSN, namely low connectivity, low data rates and high packet loss probability. We propose an algorithm where the sensor nodes collaboratively estimate their unknown positions in the network using a low number of anchor nodes and distance measurements from the underwater channel. Once the network has been self-located, we consider a node estimating its position for underwater navigation communicating with neighboring nodes. We also propose a communication system and simulate the whole electromagnetic U-WSN in the Castalia simulator to evaluate the network performance, including propagation impairments (e.g., noise, interference), radio parameters (e.g., modulation scheme, bandwidth, transmit power), hardware limitations (e.g., clock drift, transmission buffer) and complete MAC and routing protocols. We also explain the changes that have to be done to Castalia in order to perform the simulations. In addition, we propose a parametric model of the communication channel that matches well with the results from the first part of this paper. Finally, we provide simulation results for some illustrative scenarios.

  8. Underwater Electromagnetic Sensor Networks, Part II: Localization and Network Simulations

    Science.gov (United States)

    Zazo, Javier; Valcarcel Macua, Sergio; Zazo, Santiago; Pérez, Marina; Pérez-Álvarez, Iván; Jiménez, Eugenio; Cardona, Laura; Brito, Joaquín Hernández; Quevedo, Eduardo

    2016-01-01

    In the first part of the paper, we modeled and characterized the underwater radio channel in shallow waters. In the second part, we analyze the application requirements for an underwater wireless sensor network (U-WSN) operating in the same environment and perform detailed simulations. We consider two localization applications, namely self-localization and navigation aid, and propose algorithms that work well under the specific constraints associated with U-WSN, namely low connectivity, low data rates and high packet loss probability. We propose an algorithm where the sensor nodes collaboratively estimate their unknown positions in the network using a low number of anchor nodes and distance measurements from the underwater channel. Once the network has been self-located, we consider a node estimating its position for underwater navigation communicating with neighboring nodes. We also propose a communication system and simulate the whole electromagnetic U-WSN in the Castalia simulator to evaluate the network performance, including propagation impairments (e.g., noise, interference), radio parameters (e.g., modulation scheme, bandwidth, transmit power), hardware limitations (e.g., clock drift, transmission buffer) and complete MAC and routing protocols. We also explain the changes that have to be done to Castalia in order to perform the simulations. In addition, we propose a parametric model of the communication channel that matches well with the results from the first part of this paper. Finally, we provide simulation results for some illustrative scenarios. PMID:27999309

  9. LinkMind: link optimization in swarming mobile sensor networks.

    Science.gov (United States)

    Ngo, Trung Dung

    2011-01-01

    A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

  10. LinkMind: Link Optimization in Swarming Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Trung Dung Ngo

    2011-08-01

    Full Text Available A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

  11. Novel Framework for Data Collection in Wireless Sensor Networks Using Flying Sensors

    DEFF Research Database (Denmark)

    Mathur, Prateek; Nielsen, Rasmus Hjorth; Prasad, Neeli R.

    2014-01-01

    This paper proposes a novel framework for data collection from a sensor network using flying sensor nodes. Efficient data communication within the network is a necessity as sensor nodes are usually energy constrained. The proposed framework utilizes the various entities forming the network...... for a different utility compared to their usual role in sensor networks. Use of flying sensor nodes is usually considered for conventional purpose of sensing and monitoring. Flying sensing nodes are usually utilized collectively in the form of an aerial sensor network, they are not expected to function as a data...... collection entity, as proposed in this framework. Similarly, cluster heads (CHs) are usually expected to transfer the aggregated data to an adjoining CH or to the base station (BS) directly. In the proposed framework the CH transfers data directly to the flying sensor node, averting the need for energy...

  12. Protocols for Wireless Sensor Networks and Its Security

    Directory of Open Access Journals (Sweden)

    Dr. Adil Jamil Zaru

    2016-12-01

    Full Text Available This paper proposes a protocol for Wireless Sensor Networks and its security which are characterized by severely constrained computational and energy resources, and an ad hoc operational environment. The paper first introduces sensor networks, and discusses security issues and goals along with security problems, threats, and risks in sensor networks. It describes crippling attacks against all of them and suggests countermeasures and design considerations. It gives a brief introduction of proposed security protocol SPINS whose building blocks are SNEP and μTESLA which overcome all the important security threats and problems and achieves security goals like data confidentiality, freshness, authentication in order to provide a secure Wireless Sensor Network.

  13. Clustering in Wireless Sensor Networks- A Survey

    Directory of Open Access Journals (Sweden)

    Sukhkirandeep Kaur

    2016-06-01

    Full Text Available Increased demand of Wireless Sensor Networks (WSN in various applications has made it a hot research area. Several challenges imposed which include energy conservation, scalability, limited network resources etc. with energy conservation being the most important. Clustering improves the energy efficiency by making high power nodes as cluster heads (CHs which reduces the chance of energy depletion of nodes. Scalability, fault tolerance, data aggregation, energy efficiency are some of the main objectives of clustering. This paper discusses various challenges associated with clustering and different methods or techniques developed to overcome these challenges. Various clustering approaches have been summarized and few prominent Quality of service (QoS based clustering routing protocols for WSN have been identified. Comparison of these approaches and protocols is discussed based on some parameters.

  14. Node Clustering for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sania Bhatti

    2012-01-01

    Full Text Available Recent years have witnessed considerable growth in the development and deployment of clustering methods which are not only used to maintain network resources but also increases the reliability of the WSNs (Wireless Sensor Network and the facts manifest by the wide range of clustering solutions. Node clustering by selecting key parameters to tackle the dynamic behaviour of resource constraint WSN is a challenging issue. This paper highlights the recent progress which has been carried out pertaining to the development of clustering solutions for the WSNs. The paper presents classification of node clustering methods and their comparison based on the objectives, clustering criteria and methodology. In addition, the potential open issues which need to be considered for future work are high lighted.

  15. Hierarchical Synchrony of Phase Oscillators in Modular Networks

    CERN Document Server

    Skardal, Per Sebastian

    2011-01-01

    We study synchronization of sinusoidally coupled phase oscillators on networks with modular structure and a large number of oscillators in each community. Of particular interest is the hierarchy of local and global synchrony, i.e., synchrony within and between communities, respectively. Using the recent ansatz of Ott and Antonsen, we find that the degree of local synchrony can be determined from a set of coupled low-dimensional equations. If the number of communities in the network is large, a low-dimensional description of global synchrony can be also found. Using these results, we study bifurcations between different types of synchrony. We find that, depending on the relative strength of local and global coupling, the transition to synchrony in the network can be mediated by local or global effects.

  16. Identifying overlapping and hierarchical thematic structures in networks of scholarly papers: a comparison of three approaches.

    Science.gov (United States)

    Havemann, Frank; Gläser, Jochen; Heinz, Michael; Struck, Alexander

    2012-01-01

    The aim of this paper is to introduce and assess three algorithms for the identification of overlapping thematic structures in networks of papers. We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles, abstracts, and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three predefined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields.

  17. Identifying overlapping and hierarchical thematic structures in networks of scholarly papers: a comparison of three approaches.

    Directory of Open Access Journals (Sweden)

    Frank Havemann

    Full Text Available The aim of this paper is to introduce and assess three algorithms for the identification of overlapping thematic structures in networks of papers. We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles, abstracts, and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three predefined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields.

  18. Hierarchical network architectures of carbon fiber paper supported cobalt oxide nanonet for high-capacity pseudocapacitors.

    Science.gov (United States)

    Yang, Lei; Cheng, Shuang; Ding, Yong; Zhu, Xingbao; Wang, Zhong Lin; Liu, Meilin

    2012-01-11

    We present a high-capacity pseudocapacitor based on a hierarchical network architecture consisting of Co(3)O(4) nanowire network (nanonet) coated on a carbon fiber paper. With this tailored architecture, the electrode shows ideal capacitive behavior (rectangular shape of cyclic voltammograms) and large specific capacitance (1124 F/g) at high charge/discharge rate (25.34 A/g), still retaining ~94% of the capacitance at a much lower rate of 0.25 A/g. The much-improved capacity, rate capability, and cycling stability may be attributed to the unique hierarchical network structures, which improves electron/ion transport, enhances the kinetics of redox reactions, and facilitates facile stress relaxation during cycling.

  19. A CDMA Based Scalable Hierarchical Architecture for Network-On-Chip

    Directory of Open Access Journals (Sweden)

    Mohamed A. Abd El Ghany

    2012-09-01

    Full Text Available A Scalable hierarchical architecture based Code-Division Multiple Access (CDMA is proposed for high performance Network-on-Chip (NoC. This hierarchical architecture provides the integration of a large number of IPs in a single on-chip system. The network encoding and decoding schemes for CDMA transmission are provided. The proposed CDMA NoC architecture is compared to the conventional architecture in terms of latency, area and power dissipation. The overall area required to implement the proposed CDMA NoC design is reduced by 24.2%. The design decreases the latency of the network by 40%. The total power consumption required to achieve the proposed design is also decreased by 25%.

  20. Scaling of the Average Receiving Time on a Family of Weighted Hierarchical Networks

    Science.gov (United States)

    Sun, Yu; Dai, Meifeng; Sun, Yanqiu; Shao, Shuxiang

    2016-08-01

    In this paper, based on the un-weight hierarchical networks, a family of weighted hierarchical networks are introduced, the weight factor is denoted by r. The weighted hierarchical networks depend on the number of nodes in complete bipartite graph, denoted by n1, n2 and n = n1 + n2. Assume that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the weight of edge linking them. We deduce the analytical expression of the average receiving time (ART). The obtained remarkable results display two conditions. In the large network, when nr > n1n2, the ART grows as a power-law function of the network size |V (Gk)| with the exponent, represented by θ =logn( nr n1n2 ), 0 < θ < 1. This means that the smaller the value of θ, the more efficient the process of receiving information. When nr ≤ n1n2, the ART grows with increasing order |V (Gk)| as logn|V (Gk)| or (logn|V (Gk)|)2.

  1. Decentralized Sensor Fusion for Ubiquitous Networking Robotics in Urban Areas

    Science.gov (United States)

    Sanfeliu, Alberto; Andrade-Cetto, Juan; Barbosa, Marco; Bowden, Richard; Capitán, Jesús; Corominas, Andreu; Gilbert, Andrew; Illingworth, John; Merino, Luis; Mirats, Josep M.; Moreno, Plínio; Ollero, Aníbal; Sequeira, João; Spaan, Matthijs T.J.

    2010-01-01

    In this article we explain the architecture for the environment and sensors that has been built for the European project URUS (Ubiquitous Networking Robotics in Urban Sites), a project whose objective is to develop an adaptable network robot architecture for cooperation between network robots and human beings and/or the environment in urban areas. The project goal is to deploy a team of robots in an urban area to give a set of services to a user community. This paper addresses the sensor architecture devised for URUS and the type of robots and sensors used, including environment sensors and sensors onboard the robots. Furthermore, we also explain how sensor fusion takes place to achieve urban outdoor execution of robotic services. Finally some results of the project related to the sensor network are highlighted. PMID:22294927

  2. Decentralized Sensor Fusion for Ubiquitous Networking Robotics in Urban Areas

    Directory of Open Access Journals (Sweden)

    Aníbal Ollero

    2010-03-01

    Full Text Available In this article we explain the architecture for the environment and sensors that has been built for the European project URUS (Ubiquitous Networking Robotics in Urban Sites, a project whose objective is to develop an adaptable network robot architecture for cooperation between network robots and human beings and/or the environment in urban areas. The project goal is to deploy a team of robots in an urban area to give a set of services to a user community. This paper addresses the sensor architecture devised for URUS and the type of robots and sensors used, including environment sensors and sensors onboard the robots. Furthermore, we also explain how sensor fusion takes place to achieve urban outdoor execution of robotic services. Finally some results of the project related to the sensor network are highlighted.

  3. Green Modulation in Proactive Wireless Sensor Networks

    CERN Document Server

    Abouei, Jamshid; Pasupathy, Subbarayan

    2009-01-01

    Due to unique characteristics of sensor nodes, choosing energy-efficient modulation scheme with low-complexity implementation (refereed to as green modulation) is a critical factor in the physical layer of Wireless Sensor Networks (WSNs). This paper presents (to the best of our knowledge) the first in-depth analysis of energy efficiency of various modulation schemes using realistic models in IEEE 802.15.4 standard and present state-of-the art technology, to find the best scheme in a proactive WSN over Rayleigh and Rician flat-fading channel models with path-loss. For this purpose, we describe the system model according to a pre-determined time-based process in practical sensor nodes. The present analysis also includes the effect of bandwidth and active mode duration on energy efficiency of popular modulation designs in the pass-band and Ultra-WideBand (UWB) categories. Experimental results show that among various pass-band and UWB modulation schemes, Non-Coherent M-ary Frequency Shift Keying (NC-MFSK) with sm...

  4. EMPLOYING SENSOR NETWORK TO GUIDE FIREFIGHTERS IN DANGEROUS AREA

    DEFF Research Database (Denmark)

    Koohi, Hamidreza; Nadernejad, Ehsan; Fathi, Mahmoud

    2010-01-01

    itself against possible changes. The protocol developed, will integrate the artificial potential field of the sensors with the information of the intended place of moving firefighter so that it guides the firefighter step by step through the sensor network by choosing the safest path in dangerous zones......In this paper, we intend to focus on the sensor network applications in firefighting. A distributed algorithm is developed for the sensor network to guide firefighters through a burning area. The sensor network models the danger of the area under coverage as obstacles, and has the property to adapt....... This protocol is simulated by Visual-Sense and the simulation results are available. Keyword: Firefighter, Sensor Network, Potential Field, Area’s Danger, Navigation...

  5. GAS MAIN SENSOR AND COMMUNICATIONS NETWORK SYSTEM

    Energy Technology Data Exchange (ETDEWEB)

    Hagen Schempf, Ph.D.

    2003-02-27

    Automatika, Inc. was contracted by the Department of Energy (DOE) and with co-funding from the New York Gas Group (NYGAS), to develop an in-pipe natural gas prototype measurement and wireless communications system for assessing and monitoring distribution networks. A prototype system was built for low-pressure cast-iron mains and tested in a spider- and serial-network configuration in a live network in Long Island with the support of Keyspan Energy, Inc. The prototype unit combined sensors capable of monitoring pressure, flow, humidity, temperature and vibration, which were sampled and combined in data-packages in an in-pipe master-slave architecture to collect data from a distributed spider-arrangement, and in a master-repeater-slave configuration in serial or ladder-network arrangements. It was found that the system was capable of performing all data-sampling and collection as expected, yielding interesting results as to flow-dynamics and vibration-detection. Wireless in-pipe communications were shown to be feasible and valuable data was collected in order to determine how to improve on range and data-quality in the future.

  6. Sleep Control Game for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sang Hoon Lee

    2016-01-01

    Full Text Available In wireless sensor networks (WSNs, each node controls its sleep to reduce energy consumption without sacrificing message latency. In this paper we apply the game theory, which is a powerful tool that explains how each individual acts for his or her own economic benefit, to analyze the optimal sleep schedule for sensor nodes. We redefine this sleep control game as a modified version of the Prisoner’s Dilemma. In the sleep control game, each node decides whether or not it wakes up for the cycle. Payoff functions of the sleep control game consider the expected traffic volume, network conditions, and the expected packet delay. According to the payoff function, each node selects the best wake-up strategy that may minimize the energy consumption and maintain the latency performance. To investigate the performance of our algorithm, we apply the sleep control game to X-MAC, which is one of the recent WSN MAC protocols. Our detailed packet level simulations confirm that the proposed algorithm can effectively reduce the energy consumption by removing unnecessary wake-up operations without loss of the latency performance.

  7. Fast notification architecture for wireless sensor networks

    Science.gov (United States)

    Lee, Dong-Hahk

    2013-03-01

    In an emergency, since it is vital to transmit the message to the users immediately after analysing the data to prevent disaster, this article presents the deployment of a fast notification architecture for a wireless sensor network. The sensor nodes of the proposed architecture can monitor an emergency situation periodically and transmit the sensing data, immediately to the sink node. We decide on the grade of fire situation according to the decision rule using the sensing values of temperature, CO, smoke density and temperature increasing rate. On the other hand, to estimate the grade of air pollution, the sensing data, such as dust, formaldehyde, NO2, CO2, is applied to the given knowledge model. Since the sink node in the architecture has a ZigBee interface, it can transmit the alert messages in real time according to analysed results received from the host server to the terminals equipped with a SIM card-type ZigBee module. Also, the host server notifies the situation to the registered users who have cellular phone through short message service server of the cellular network. Thus, the proposed architecture can adapt an emergency situation dynamically compared to the conventional architecture using video processing. In the testbed, after generating air pollution and fire data, the terminal receives the message in less than 3 s. In the test results, this system can also be applied to buildings and public areas where many people gather together, to prevent unexpected disasters in urban settings.

  8. Cooperative Jamming for Physical Layer Security in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Rohokale, Vandana M.; Prasad, Neeli R.; Prasad, Ramjee

    2012-01-01

    Interference is generally considered as the redundant and unwanted occurrence in wireless communication. This work proposes a novel cooperative jamming mechanism for scalable networks like Wireless Sensor Networks (WSNs) which makes use of friendly interference to confuse the eavesdropper...

  9. Synchronization in heterogeneous FitzHugh-Nagumo networks with hierarchical architecture

    Science.gov (United States)

    Plotnikov, S. A.; Lehnert, J.; Fradkov, A. L.; Schöll, E.

    2016-07-01

    We study synchronization in heterogeneous FitzHugh-Nagumo networks. It is well known that heterogeneities in the nodes hinder synchronization when becoming too large. Here we develop a controller to counteract the impact of these heterogeneities. We first analyze the stability of the equilibrium point in a ring network of heterogeneous nodes. We then derive a sufficient condition for synchronization in the absence of control. Based on these results we derive the controller providing synchronization for parameter values where synchronization without control is absent. We demonstrate our results in networks with different topologies. Particular attention is given to hierarchical (fractal) topologies, which are relevant for the architecture of the brain.

  10. Hierarchical micro-mobility management in high-speed multihop access networks

    Institute of Scientific and Technical Information of China (English)

    TANG Bi-hua; MA Xiao-lei; LIU Yuan-an; GAO Jin-chun

    2006-01-01

    This article integrates the hierarchical micro-mobility management and the high-speed multihop access networks (HMAN), to accomplish the smooth handover between different access routers. The proposed soft handover scheme in the high-speed HMAN can solve the micro-mobility management problem in the access network. This article also proposes the hybrid access router (AR) advertisement scheme and AR selection algorithm, which uses the time delay and stable route to the AR as the gateway selection parameters. By simulation, the proposed micro-mobility management scheme can achieve high packet delivery fraction and improve the lifetime of network.

  11. Topology of the correlation networks among major currencies using hierarchical structure methods

    Science.gov (United States)

    Keskin, Mustafa; Deviren, Bayram; Kocakaplan, Yusuf

    2011-02-01

    We studied the topology of correlation networks among 34 major currencies using the concept of a minimal spanning tree and hierarchical tree for the full years of 2007-2008 when major economic turbulence occurred. We used the USD (US Dollar) and the TL (Turkish Lira) as numeraires in which the USD was the major currency and the TL was the minor currency. We derived a hierarchical organization and constructed minimal spanning trees (MSTs) and hierarchical trees (HTs) for the full years of 2007, 2008 and for the 2007-2008 period. We performed a technique to associate a value of reliability to the links of MSTs and HTs by using bootstrap replicas of data. We also used the average linkage cluster analysis for obtaining the hierarchical trees in the case of the TL as the numeraire. These trees are useful tools for understanding and detecting the global structure, taxonomy and hierarchy in financial data. We illustrated how the minimal spanning trees and their related hierarchical trees developed over a period of time. From these trees we identified different clusters of currencies according to their proximity and economic ties. The clustered structure of the currencies and the key currency in each cluster were obtained and we found that the clusters matched nicely with the geographical regions of corresponding countries in the world such as Asia or Europe. As expected the key currencies were generally those showing major economic activity.

  12. Mapping the hierarchical layout of the structural network of the macaque prefrontal cortex.

    Science.gov (United States)

    Goulas, Alexandros; Uylings, Harry B M; Stiers, Peter

    2014-05-01

    A consensus on the prefrontal cortex (PFC) holds that it is pivotal for flexible behavior and the integration of the cognitive, affective, and motivational domains. Certain models have been put forth and a dominant model postulates a hierarchical anterior-posterior gradient. The structural connectivity principles of this model dictate that increasingly anterior PFC regions exhibit more efferent connections toward posterior ones than vice versa. Such hierarchical asymmetry principles are thought to pertain to the macaque PFC. Additionally, the laminar patterns of the connectivity of PFC regions can be used for defining hierarchies. In the current study, we formally tested the asymmetry-based hierarchical principles of the anterior-posterior model by employing an exhaustive dataset on macaque PFC connectivity and tools from network science. On the one hand, the asymmetry-based principles and predictions of the hierarchical anterior-posterior model were not confirmed. The wiring of the macaque PFC does not fully correspond to the principles of the model, and its asymmetry-based hierarchical layout does not follow a strict anterior-posterior gradient. On the other hand, our results suggest that the laminar-based hierarchy seems a more tenable working hypothesis for models advocating an anterior-posterior gradient. Our results can inform models of the human PFC.

  13. Sleeping of a Complex Brain Networks with Hierarchical Organization

    Institute of Scientific and Technical Information of China (English)

    ZHANG Ying-Yue; YANG Qiu-Ying; CHEN Tian-Lun

    2009-01-01

    The dynamical behavior in the cortical brain network of macaque is studied by modeling each cortical area with a subnetwork of interacting excitable neurons. We characterize the system by studying how to perform the transition, which is now topology-dependent, from the active state to that with no activity. This could be a naive model for the wakening and sleeping of a brain-like system, i.e., a multi-component system with two different dynamical behavior.

  14. Hierarchical brain networks active in approach and avoidance goal pursuit

    Directory of Open Access Journals (Sweden)

    Jeffrey Martin Spielberg

    2013-06-01

    Full Text Available Effective approach/avoidance goal pursuit is critical for attaining long-term health and well-being. Research on the neural correlates of key goal pursuit processes (e.g., motivation has long been of interest, with lateralization in prefrontal cortex being a particularly fruitful target of investigation. However, this literature has often been limited by a lack of spatial specificity and has not delineated the precise aspects of approach/avoidance motivation involved. Additionally, the relationships among brain regions (i.e., network connectivity vital to goal pursuit remain largely unexplored. Specificity in location, process, and network relationship is vital for moving beyond gross characterizations of function and identifying the precise cortical mechanisms involved in motivation. The present paper integrates research using more spatially specific methodologies (e.g., functional magnetic resonance imaging with the rich psychological literature on approach/avoidance to propose an integrative network model that takes advantage of the strengths of each of these literatures.

  15. Frontoparietal Connectivity and Hierarchical Structure of the Brain’s Functional Network during Sleep

    Directory of Open Access Journals (Sweden)

    Victor I Spoormaker

    2012-05-01

    Full Text Available Frontal and parietal regions are associated with some of the most complex cognitive functions, and several frontoparietal resting-state networks can be observed in wakefulness. We used functional magnetic resonance imaging (fMRI data acquired in polysomnographically validated wakefulness, light sleep and slow-wave sleep to examine the hierarchical structure of a low-frequency functional brain network, and to examine whether frontoparietal connectivity would disintegrate in sleep. Whole-brain analyses with hierarchical cluster analysis on predefined atlases were performed, as well as regression of inferior parietal lobules seeds against all voxels in the brain, and an evaluation of the integrity of voxel time-courses in subcortical regions-of-interest. We observed that frontoparietal functional connectivity disintegrated in sleep stage 1 and was absent in deeper sleep stages. Slow-wave sleep was characterized by strong hierarchical clustering of local submodules. Frontoparietal connectivity between inferior parietal lobules and superior medial and right frontal gyrus was lower in sleep stages than in wakefulness. Moreover, thalamus voxels showed maintained integrity in sleep stage 1, making intrathalamic desynchronization an unlikely source of reduced thalamocortical connectivity in this sleep stage. Our data suggest a transition from a globally integrated functional brain network in wakefulness to a disintegrated network consisting of local submodules in slow-wave sleep, in which frontoparietal inter-modular nodes may play a crucial role, possibly in combination with the thalamus.

  16. Wireless sensor and ad hoc networks under diversified network scenarios

    CERN Document Server

    Sarkar, Subir Kumar

    2012-01-01

    Due to significant advantages, including convenience, efficiency and cost-effectiveness, the implementation and use of wireless ad hoc and sensor networks have gained steep growth in recent years. This timely book presents the current state-of-the-art in these popular technologies, providing you with expert guidance for your projects in the field. You find broad-ranging coverage of important concepts and methods, definitions of key terminology, and a look at the direction of future research. Supported with nearly 150 illustrations, the book discusses a variety of critical topics, from topology

  17. On the Feasibility of Wireless Multimedia Sensor Networks over IEEE 802.15.5 Mesh Topologies.

    Science.gov (United States)

    Garcia-Sanchez, Antonio-Javier; Losilla, Fernando; Rodenas-Herraiz, David; Cruz-Martinez, Felipe; Garcia-Sanchez, Felipe

    2016-05-05

    Wireless Multimedia Sensor Networks (WMSNs) are a special type of Wireless Sensor Network (WSN) where large amounts of multimedia data are transmitted over networks composed of low power devices. Hierarchical routing protocols typically used in WSNs for multi-path communication tend to overload nodes located within radio communication range of the data collection unit or data sink. The battery life of these nodes is therefore reduced considerably, requiring frequent battery replacement work to extend the operational life of the WSN system. In a wireless sensor network with mesh topology, any node may act as a forwarder node, thereby enabling multiple routing paths toward any other node or collection unit. In addition, mesh topologies have proven advantages, such as data transmission reliability, network robustness against node failures, and potential reduction in energy consumption. This work studies the feasibility of implementing WMSNs in mesh topologies and their limitations by means of exhaustive computer simulation experiments. To this end, a module developed for the Synchronous Energy Saving (SES) mode of the IEEE 802.15.5 mesh standard has been integrated with multimedia tools to thoroughly test video sequences encoded using H.264 in mesh networks.

  18. Distributed Information Compression for Target Tracking in Cluster-Based Wireless Sensor Networks.

    Science.gov (United States)

    Liao, Shi-Kuan; Lai, Kai-Jay; Tsai, Hsiao-Ping; Wen, Chih-Yu

    2016-06-22

    Target tracking is a critical wireless sensor application, which involves signal and information processing technologies. In conventional target position estimation methods, an estimate is usually demonstrated by an average target position. In contrast, this work proposes a distributed information compression method to describe the measurement uncertainty of tracking problems in cluster-based wireless sensor networks. The leader-based information processing scheme is applied to perform target positioning and energy conservation. A two-level hierarchical network topology is adopted for energy-efficient target tracking with information compression. A Level 1 network architecture is a cluster-based network topology for managing network operations. A Level 2 network architecture is an event-based and leader-based topology, utilizing the concept of information compression to process the estimates of sensor nodes. The simulation results show that compared to conventional schemes, the proposed data processing scheme has a balanced system performance in terms of tracking accuracy, data size for transmission and energy consumption.

  19. Robust Forecasting for Energy Efficiency of Wireless Multimedia Sensor Networks

    Directory of Open Access Journals (Sweden)

    Dao-Wei Bi

    2007-11-01

    Full Text Available An important criterion of wireless sensor network is the energy efficiency inspecified applications. In this wireless multimedia sensor network, the observations arederived from acoustic sensors. Focused on the energy problem of target tracking, this paperproposes a robust forecasting method to enhance the energy efficiency of wirelessmultimedia sensor networks. Target motion information is acquired by acoustic sensornodes while a distributed network with honeycomb configuration is constructed. Thereby,target localization is performed by multiple sensor nodes collaboratively through acousticsignal processing. A novel method, combining autoregressive moving average (ARMAmodel and radial basis function networks (RBFNs, is exploited to perform robust targetposition forecasting during target tracking. Then sensor nodes around the target areawakened according to the forecasted target position. With committee decision of sensornodes, target localization is performed in a distributed manner and the uncertainty ofdetection is reduced. Moreover, a sensor-to-observer routing approach of the honeycombmesh network is investigated to solve the data reporting considering the residual energy ofsensor nodes. Target localization and forecasting are implemented in experiments.Meanwhile, sensor node awakening and dynamic routing are evaluated. Experimentalresults verify that energy efficiency of wireless multimedia sensor network is enhanced bythe proposed target tracking method.

  20. Resource Discovery in Activity-Based Sensor Networks

    DEFF Research Database (Denmark)

    Bucur, Doina; Bardram, Jakob

    This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level concept of computational activities (as logical bundles of data and resources) to give sensors in Activity-Based Sensor Networ...