Low Latency MAC Protocol in Wireless Sensor Networks Using Timing Offset
NASA Astrophysics Data System (ADS)
Choi, Seung Sik
This paper proposes a low latency MAC protocol that can be used in sensor networks. To extend the lifetime of sensor nodes, the conventional solution is to synchronize active/sleep periods of all sensor nodes. However, due to these synchronized sensor nodes, packets in the intermediate nodes must wait until the next node wakes up before it can forward a packet. This induces a large delay in sensor nodes. To solve this latency problem, a clustered sensor network which uses two types of sensor nodes and layered architecture is considered. Clustered heads in each cluster are synchronized with different timing offsets to reduce the sleep delay. Using this concept, the latency problem can be solved and more efficient power usage can be obtained.
Moraes, Celso; Myung, Sunghee; Lee, Sangkeum; Har, Dongsoo
2017-01-10
Provision of energy to wireless sensor networks is crucial for their sustainable operation. Sensor nodes are typically equipped with batteries as their operating energy sources. However, when the sensor nodes are sited in almost inaccessible locations, replacing their batteries incurs high maintenance cost. Under such conditions, wireless charging of sensor nodes by a mobile charger with an antenna can be an efficient solution. When charging distributed sensor nodes, a directional antenna, rather than an omnidirectional antenna, is more energy-efficient because of smaller proportion of off-target radiation. In addition, for densely distributed sensor nodes, it can be more effective for some undercharged sensor nodes to harvest energy from neighboring overcharged sensor nodes than from the remote mobile charger, because this reduces the pathloss of charging signal due to smaller distances. In this paper, we propose a hybrid charging scheme that combines charging by a mobile charger with a directional antenna, and energy trading, e.g., transferring and harvesting, between neighboring sensor nodes. The proposed scheme is compared with other charging scheme. Simulations demonstrate that the hybrid charging scheme with a directional antenna achieves a significant reduction in the total charging time required for all sensor nodes to reach a target energy level.
Moraes, Celso; Myung, Sunghee; Lee, Sangkeum; Har, Dongsoo
2017-01-01
Provision of energy to wireless sensor networks is crucial for their sustainable operation. Sensor nodes are typically equipped with batteries as their operating energy sources. However, when the sensor nodes are sited in almost inaccessible locations, replacing their batteries incurs high maintenance cost. Under such conditions, wireless charging of sensor nodes by a mobile charger with an antenna can be an efficient solution. When charging distributed sensor nodes, a directional antenna, rather than an omnidirectional antenna, is more energy-efficient because of smaller proportion of off-target radiation. In addition, for densely distributed sensor nodes, it can be more effective for some undercharged sensor nodes to harvest energy from neighboring overcharged sensor nodes than from the remote mobile charger, because this reduces the pathloss of charging signal due to smaller distances. In this paper, we propose a hybrid charging scheme that combines charging by a mobile charger with a directional antenna, and energy trading, e.g., transferring and harvesting, between neighboring sensor nodes. The proposed scheme is compared with other charging scheme. Simulations demonstrate that the hybrid charging scheme with a directional antenna achieves a significant reduction in the total charging time required for all sensor nodes to reach a target energy level. PMID:28075372
DE-Sync: A Doppler-Enhanced Time Synchronization for Mobile Underwater Sensor Networks.
Zhou, Feng; Wang, Qi; Nie, DongHu; Qiao, Gang
2018-05-25
Time synchronization is the foundation of cooperative work among nodes of underwater sensor networks; it takes a critical role in the research and application of underwater sensor networks. Although numerous time synchronization protocols have been proposed for terrestrial wireless sensor networks, they cannot be directly applied to underwater sensor networks. This is because most of them typically assume that the propagation delay among sensor nodes is negligible, which is not the case in underwater sensor networks. Time synchronization is mainly affected by a long propagation delay among sensor nodes due to the low propagation speed of acoustic signals. Furthermore, sensor nodes in underwater tend to experience some degree of mobility due to wind or ocean current, or some other nodes are on self-propelled vehicles, such as autonomous underwater vehicles (AUVs). In this paper, we propose a Doppler-enhanced time synchronization scheme for mobile underwater sensor networks, called DE-Sync. Our new scheme considers the effect of the clock skew during the process of estimating the Doppler scale factor and directly substitutes the Doppler scale factor into linear regression to achieve the estimation of the clock skew and offset. Simulation results show that DE-Sync outperforms existing time synchronization protocols in both accuracy and energy efficiency.
Alanazi, Adwan; Elleithy, Khaled
2016-09-07
Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The nodes in WMSNs are either static or mobile. Thus, the node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND) paradigm. The OHND consists of three phases: hidden node detection, message exchange, and location detection. These three phases aim to maximize the multimedia node coverage, and improve energy efficiency, hidden node detection capacity, and packet delivery ratio. OHND helps multimedia sensor nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous node- continuous neighbor discovery process in order to handle the mobility of the nodes. We implement our proposed algorithms by using a network simulator (NS2). The simulation results demonstrate that nodes are capable of maintaining direct coverage and detecting hidden nodes in order to maximize coverage and multimedia node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches.
Alanazi, Adwan; Elleithy, Khaled
2016-01-01
Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The nodes in WMSNs are either static or mobile. Thus, the node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND) paradigm. The OHND consists of three phases: hidden node detection, message exchange, and location detection. These three phases aim to maximize the multimedia node coverage, and improve energy efficiency, hidden node detection capacity, and packet delivery ratio. OHND helps multimedia sensor nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous node– continuous neighbor discovery process in order to handle the mobility of the nodes. We implement our proposed algorithms by using a network simulator (NS2). The simulation results demonstrate that nodes are capable of maintaining direct coverage and detecting hidden nodes in order to maximize coverage and multimedia node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches. PMID:27618048
Study on the effect of sink moving trajectory on wireless sensor networks
NASA Astrophysics Data System (ADS)
Zhong, Peijun; Ruan, Feng
2018-03-01
Wireless sensor networks are developing very fast in recent years, due to their wide potential applications. However there exists the so-called hot spot problem, namely the nodes close to static sink node tend to die earlier than other nodes since they have heavier burden to forward. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we make extensive experimental simulations for circular sensor network, with one mobile sink moving along different radius circumference. The whole network is divided into several clusters and there is one cluster head (CH) inside each cluster. The ordinary sensors communicate with CH and CHs construct a chain until the sink node. Simulation results show that the best network performance appears when sink moves along 0.25 R in terms of network lifetime.
Salim, Shelly; Moh, Sangman; Choi, Dongmin; Chung, Ilyong
2014-08-11
A cognitive radio sensor network (CRSN) is a wireless sensor network whose sensor nodes are equipped with cognitive radio capability. Clustering is one of the most challenging issues in CRSNs, as all sensor nodes, including the cluster head, have to use the same frequency band in order to form a cluster. However, due to the nature of heterogeneous channels in cognitive radio, it is difficult for sensor nodes to find a cluster head. This paper proposes a novel energy-efficient and compact clustering scheme named clustering with temporary support nodes (CENTRE). CENTRE efficiently achieves a compact cluster formation by adopting two-phase cluster formation with fixed duration. By introducing a novel concept of temporary support nodes to improve the cluster formation, the proposed scheme enables sensor nodes in a network to find a cluster head efficiently. The performance study shows that not only is the clustering process efficient and compact but it also results in remarkable energy savings that prolong the overall network lifetime. In addition, the proposed scheme decreases both the clustering overhead and the average distance between cluster heads and their members.
Salim, Shelly; Moh, Sangman; Choi, Dongmin; Chung, Ilyong
2014-01-01
A cognitive radio sensor network (CRSN) is a wireless sensor network whose sensor nodes are equipped with cognitive radio capability. Clustering is one of the most challenging issues in CRSNs, as all sensor nodes, including the cluster head, have to use the same frequency band in order to form a cluster. However, due to the nature of heterogeneous channels in cognitive radio, it is difficult for sensor nodes to find a cluster head. This paper proposes a novel energy-efficient and compact clustering scheme named clustering with temporary support nodes (CENTRE). CENTRE efficiently achieves a compact cluster formation by adopting two-phase cluster formation with fixed duration. By introducing a novel concept of temporary support nodes to improve the cluster formation, the proposed scheme enables sensor nodes in a network to find a cluster head efficiently. The performance study shows that not only is the clustering process efficient and compact but it also results in remarkable energy savings that prolong the overall network lifetime. In addition, the proposed scheme decreases both the clustering overhead and the average distance between cluster heads and their members. PMID:25116905
A Survey on Node Clustering in Cognitive Radio Wireless Sensor Networks.
Joshi, Gyanendra Prasad; Kim, Sung Won
2016-09-10
Cognitive radio wireless sensor networks (CR-WSNs) have attracted a great deal of attention recently due to the emerging spectrum scarcity issue. This work attempts to provide a detailed analysis of the role of node clustering in CR-WSNs. We outline the objectives, requirements, and advantages of node clustering in CR-WSNs. We describe how a CR-WSN with node clustering differs from conventional wireless sensor networks, and we discuss its characteristics, architecture, and topologies. We survey the existing clustering algorithms and compare their objectives and features. We suggest how clustering issues and challenges can be handled.
Development of GaN-based microchemical sensor nodes
NASA Technical Reports Server (NTRS)
Prokopuk, Nicholas; Son, Kyung-Ah; George, Thomas; Moon, Jeong S.
2005-01-01
Sensors based III-N technology are gaining significant interest due to their potential for monolithic integration of RF transceivers and light sources and the capability of high temperature operations. We are developing a GaN-based micro chemical sensor node for remote detection of chemical toxins, and present electrical responses of AlGaN/GaN HEMT (High Electron Mobility Transistor) sensors to chemical toxins as well as other common gases.
Node-to-node field calibration of wireless distributed air pollution sensor network.
Kizel, Fadi; Etzion, Yael; Shafran-Nathan, Rakefet; Levy, Ilan; Fishbain, Barak; Bartonova, Alena; Broday, David M
2018-02-01
Low-cost air quality sensors offer high-resolution spatiotemporal measurements that can be used for air resources management and exposure estimation. Yet, such sensors require frequent calibration to provide reliable data, since even after a laboratory calibration they might not report correct values when they are deployed in the field, due to interference with other pollutants, as a result of sensitivity to environmental conditions and due to sensor aging and drift. Field calibration has been suggested as a means for overcoming these limitations, with the common strategy involving periodical collocations of the sensors at an air quality monitoring station. However, the cost and complexity involved in relocating numerous sensor nodes back and forth, and the loss of data during the repeated calibration periods make this strategy inefficient. This work examines an alternative approach, a node-to-node (N2N) calibration, where only one sensor in each chain is directly calibrated against the reference measurements and the rest of the sensors are calibrated sequentially one against the other while they are deployed and collocated in pairs. The calibration can be performed multiple times as a routine procedure. This procedure minimizes the total number of sensor relocations, and enables calibration while simultaneously collecting data at the deployment sites. We studied N2N chain calibration and the propagation of the calibration error analytically, computationally and experimentally. The in-situ N2N calibration is shown to be generic and applicable for different pollutants, sensing technologies, sensor platforms, chain lengths, and sensor order within the chain. In particular, we show that chain calibration of three nodes, each calibrated for a week, propagate calibration errors that are similar to those found in direct field calibration. Hence, N2N calibration is shown to be suitable for calibration of distributed sensor networks. Copyright © 2017 Elsevier Ltd. All rights reserved.
Foo Kune, Denis [Saint Paul, MN; Mahadevan, Karthikeyan [Mountain View, CA
2011-01-25
A recursive verification protocol to reduce the time variance due to delays in the network by putting the subject node at most one hop from the verifier node provides for an efficient manner to test wireless sensor nodes. Since the software signatures are time based, recursive testing will give a much cleaner signal for positive verification of the software running on any one node in the sensor network. In this protocol, the main verifier checks its neighbor, who in turn checks its neighbor, and continuing this process until all nodes have been verified. This ensures minimum time delays for the software verification. Should a node fail the test, the software verification downstream is halted until an alternative path (one not including the failed node) is found. Utilizing techniques well known in the art, having a node tested twice, or not at all, can be avoided.
Solar micro-power system for self-powered wireless sensor nodes
NASA Astrophysics Data System (ADS)
He, Yongtai; Li, Yangqiu; Liu, Lihui; Wang, Lei
2008-10-01
In self-powered wireless sensor nodes, the efficiency for environmental energy harvesting, storage and management determines the lifetime and environmental adaptability of the sensor nodes. However, the method of improving output efficiency for traditional photovoltaic power generation is not suitable for a solar micro-power system due to the special requirements for its application. This paper presents a solar micro-power system designed for a solar self-powered wireless sensor node. The Maximum Power Point Tracking (MPPT) of solar cells and energy storage are realized by the hybrid energy storage structure and "window" control. Meanwhile, the mathematical model of energy harvesting, storing and management is formulated. In the novel system, the output conversion efficiency of solar cells is 12%.
Development of GaN-based micro chemical sensor nodes
NASA Technical Reports Server (NTRS)
Son, Kyung-ah; Prokopuk, Nicholas; George, Thomas; Moon, Jeong S.
2005-01-01
Sensors based on III-N technology are gaining significant interest due to their potential for monolithic integration of RF transceivers and light sources and the capability of high temperature operations. We are developing a GaN-based micro chemical sensor node for remote detection of chemical toxins, and present electrical responses of AlGaN/GaN HEMT (High Electron Mobility Transistor) sensors to chemical toxins as well as other common gases.
A comparative study of wireless sensor networks and their routing protocols.
Bhattacharyya, Debnath; Kim, Tai-hoon; Pal, Subhajit
2010-01-01
Recent developments in the area of micro-sensor devices have accelerated advances in the sensor networks field leading to many new protocols specifically designed for wireless sensor networks (WSNs). Wireless sensor networks with hundreds to thousands of sensor nodes can gather information from an unattended location and transmit the gathered data to a particular user, depending on the application. These sensor nodes have some constraints due to their limited energy, storage capacity and computing power. Data are routed from one node to other using different routing protocols. There are a number of routing protocols for wireless sensor networks. In this review article, we discuss the architecture of wireless sensor networks. Further, we categorize the routing protocols according to some key factors and summarize their mode of operation. Finally, we provide a comparative study on these various protocols.
IJA: an efficient algorithm for query processing in sensor networks.
Lee, Hyun Chang; Lee, Young Jae; Lim, Ji Hyang; Kim, Dong Hwa
2011-01-01
One of main features in sensor networks is the function that processes real time state information after gathering needed data from many domains. The component technologies consisting of each node called a sensor node that are including physical sensors, processors, actuators and power have advanced significantly over the last decade. Thanks to the advanced technology, over time sensor networks have been adopted in an all-round industry sensing physical phenomenon. However, sensor nodes in sensor networks are considerably constrained because with their energy and memory resources they have a very limited ability to process any information compared to conventional computer systems. Thus query processing over the nodes should be constrained because of their limitations. Due to the problems, the join operations in sensor networks are typically processed in a distributed manner over a set of nodes and have been studied. By way of example while simple queries, such as select and aggregate queries, in sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. Therefore, in this paper, we propose and describe an Incremental Join Algorithm (IJA) in Sensor Networks to reduce the overhead caused by moving a join pair to the final join node or to minimize the communication cost that is the main consumer of the battery when processing the distributed queries in sensor networks environments. At the same time, the simulation result shows that the proposed IJA algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join algorithm.
IJA: An Efficient Algorithm for Query Processing in Sensor Networks
Lee, Hyun Chang; Lee, Young Jae; Lim, Ji Hyang; Kim, Dong Hwa
2011-01-01
One of main features in sensor networks is the function that processes real time state information after gathering needed data from many domains. The component technologies consisting of each node called a sensor node that are including physical sensors, processors, actuators and power have advanced significantly over the last decade. Thanks to the advanced technology, over time sensor networks have been adopted in an all-round industry sensing physical phenomenon. However, sensor nodes in sensor networks are considerably constrained because with their energy and memory resources they have a very limited ability to process any information compared to conventional computer systems. Thus query processing over the nodes should be constrained because of their limitations. Due to the problems, the join operations in sensor networks are typically processed in a distributed manner over a set of nodes and have been studied. By way of example while simple queries, such as select and aggregate queries, in sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. Therefore, in this paper, we propose and describe an Incremental Join Algorithm (IJA) in Sensor Networks to reduce the overhead caused by moving a join pair to the final join node or to minimize the communication cost that is the main consumer of the battery when processing the distributed queries in sensor networks environments. At the same time, the simulation result shows that the proposed IJA algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join algorithm. PMID:22319375
Landslide and Flood Warning System Prototypes based on Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Hloupis, George; Stavrakas, Ilias; Triantis, Dimos
2010-05-01
Wireless sensor networks (WSNs) are one of the emerging areas that received great attention during the last few years. This is mainly due to the fact that WSNs have provided scientists with the capability of developing real-time monitoring systems equipped with sensors based on Micro-Electro-Mechanical Systems (MEMS). WSNs have great potential for many applications in environmental monitoring since the sensor nodes that comprised from can host several MEMS sensors (such as temperature, humidity, inertial, pressure, strain-gauge) and transducers (such as position, velocity, acceleration, vibration). The resulting devices are small and inexpensive but with limited memory and computing resources. Each sensor node contains a sensing module which along with an RF transceiver. The communication is broadcast-based since the network topology can change rapidly due to node failures [1]. Sensor nodes can transmit their measurements to central servers through gateway nodes without any processing or they make preliminary calculations locally in order to produce results that will be sent to central servers [2]. Based on the above characteristics, two prototypes using WSNs are presented in this paper: A Landslide detection system and a Flood warning system. Both systems sent their data to central processing server where the core of processing routines exists. Transmission is made using Zigbee and IEEE 802.11b protocol but is capable to use VSAT communication also. Landslide detection system uses structured network topology. Each measuring node comprises of a columnar module that is half buried to the area under investigation. Each sensing module contains a geophone, an inclinometer and a set of strain gauges. Data transmitted to central processing server where possible landslide evolution is monitored. Flood detection system uses unstructured network topology since the failure rate of sensor nodes is expected higher. Each sensing module contains a custom water level sensor (based on plastic optical fiber). Data transmitted directly to server where the early warning algorithms monitor the water level variations in real time. Both sensor nodes use power harvesting techniques in order to extend their battery life as much as possible. [1] Yick J.; Mukherjee, B.; Ghosal, D. Wireless sensor network survey. Comput. Netw. 2008, 52, 2292-2330. [2] Garcia, M.; Bri, D.; Boronat, F.; Lloret, J. A new neighbor selection strategy for group-based wireless sensor networks, In The Fourth International Conference on Networking and Services (ICNS 2008), Gosier, Guadalupe, March 16-21, 2008.
Application of nodes with multiple orthogonal sensors in moving light vehicles study
NASA Astrophysics Data System (ADS)
Ekimov, Alexander
2012-06-01
A sensor node having two types of sensors: sound and seismic units was used for signal collection in a test with different moving light vehicles on a gravel road in a quiet area. An analysis of signals from the node at low frequencies (less than 100 Hz) shows the possibility of tested vehicles detection at long distance. The sound signals for the vehicle motion were detected above the lowest frequencies of 15-20 Hz only while the seismic signals had the maxima in that frequency band. Another test was conducted on the ground to find the common vibrations of a light vehicle and the ground due to vehicle passby in frequencies below 100 Hz. For this signal collection the same sensor node was used. An additional 3-x accelerometer was installed in the vehicle cabin above the transmission. For start time synchronization of recorded signals from the node on the ground and 3-x accelerometer in the vehicle cabin a radio channel was used. Results for this test revealed the vehicle vibrations due to motion were detected on the ground with all three components of the 3-axes geophone for the test track entire distance.
McGarry, Scott; Knight, Chris
2012-01-01
Wireless sensor networks are becoming increasingly more common as a means to sense, measure, record and transmit data for scientific and engineering evaluation, remotely and autonomously. Usually, remotely located sensor nodes are powered by batteries which are recharged by solar or wind energy harvesters. Sometimes nodes are located in areas where these forms of energy harvesting are not possible due to local conditions, such as under the canopy of a forest. This article outlines the design and testing of a device capable of harvesting energy from tree movement, and shows the device powering a wireless sensor node continuously. The device uses the force and displacement of the movement of a tree trunk (of a 6 m tall tree) to drive an electromagnetic generator that recharges a nickel metal hydride battery. The battery stores the energy from which a ∼0.5 mW wireless sensor node is powered continuously. This demonstrated method of energy harvesting may allow the placement and powering of nodes in locations previously not possible.
Iwata, Masanari; Tang, Suhua; Obana, Sadao
2018-01-01
In large-scale wireless sensor networks (WSNs), nodes close to sink nodes consume energy more quickly than other nodes due to packet forwarding. A mobile sink is a good solution to this issue, although it causes two new problems to nodes: (i) overhead of updating routing information; and (ii) increased operating time due to aperiodic query. To solve these problems, this paper proposes an energy-efficient data collection method, Sink-based Centralized transmission Scheduling (SC-Sched), by integrating asymmetric communication and wake-up radio. Specifically, each node is equipped with a low-power wake-up receiver. The sink node determines transmission scheduling, and transmits a wake-up message using a large transmission power, directly activating a pair of nodes simultaneously which will communicate with a normal transmission power. This paper further investigates how to deal with frame loss caused by fading and how to mitigate the impact of the wake-up latency of communication modules. Simulation evaluations confirm that using multiple channels effectively reduces data collection time and SC-Sched works well with a mobile sink. Compared with the conventional duty-cycling method, SC-Sched greatly reduces total energy consumption and improves the network lifetime by 7.47 times in a WSN with 4 data collection points and 300 sensor nodes. PMID:29642397
An Efficient Distributed Coverage Hole Detection Protocol for Wireless Sensor Networks.
Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin
2016-03-17
In wireless sensor networks (WSNs), certain areas of the monitoring region may have coverage holes and serious coverage overlapping due to the random deployment of sensors. The failure of electronic components, software bugs and destructive agents could lead to the random death of the nodes. Sensors may be dead due to exhaustion of battery power, which may cause the network to be uncovered and disconnected. Based on the deployment nature of the nodes in remote or hostile environments, such as a battlefield or desert, it is impossible to recharge or replace the battery. However, the data gathered by the sensors are highly essential for the analysis, and therefore, the collaborative detection of coverage holes has strategic importance in WSNs. In this paper, distributed coverage hole detection algorithms are designed, where nodes can collaborate to detect the coverage holes autonomously. The performance evaluation of our protocols suggests that our protocols outperform in terms of hole detection time, limited power consumption and control packet overhead to detect holes as compared to other similar protocols.
Wireless and Powerless Sensing Node System Developed for Monitoring Motors.
Lee, Dasheng
2008-08-27
Reliability and maintainability of tooling systems can be improved through condition monitoring of motors. However, it is difficult to deploy sensor nodes due to the harsh environment of industrial plants. Sensor cables are easily damaged, which renders the monitoring system deployed to assure the machine's reliability itself unreliable. A wireless and powerless sensing node integrated with a MEMS (Micro Electro-Mechanical System) sensor, a signal processor, a communication module, and a self-powered generator was developed in this study for implementation of an easily mounted network sensor for monitoring motors. A specially designed communication module transmits a sequence of electromagnetic (EM) pulses in response to the sensor signals. The EM pulses can penetrate through the machine's metal case and delivers signals from the sensor inside the motor to the external data acquisition center. By using induction power, which is generated by the motor's shaft rotation, the sensor node is self-sustaining; therefore, no power line is required. A monitoring system, equipped with novel sensing nodes, was constructed to test its performance. The test results illustrate that, the novel sensing node developed in this study can effectively enhance the reliability of the motor monitoring system and it is expected to be a valuable technology, which will be available to the plant for implementation in a reliable motor management program.
Wireless and Powerless Sensing Node System Developed for Monitoring Motors
Lee, Dasheng
2008-01-01
Reliability and maintainability of tooling systems can be improved through condition monitoring of motors. However, it is difficult to deploy sensor nodes due to the harsh environment of industrial plants. Sensor cables are easily damaged, which renders the monitoring system deployed to assure the machine's reliability itself unreliable. A wireless and powerless sensing node integrated with a MEMS (Micro Electro-Mechanical System) sensor, a signal processor, a communication module, and a self-powered generator was developed in this study for implementation of an easily mounted network sensor for monitoring motors. A specially designed communication module transmits a sequence of electromagnetic (EM) pulses in response to the sensor signals. The EM pulses can penetrate through the machine's metal case and delivers signals from the sensor inside the motor to the external data acquisition center. By using induction power, which is generated by the motor's shaft rotation, the sensor node is self-sustaining; therefore, no power line is required. A monitoring system, equipped with novel sensing nodes, was constructed to test its performance. The test results illustrate that, the novel sensing node developed in this study can effectively enhance the reliability of the motor monitoring system and it is expected to be a valuable technology, which will be available to the plant for implementation in a reliable motor management program. PMID:27873798
NASA Astrophysics Data System (ADS)
Wang, Zi; Pakzad, Shamim; Cheng, Liang
2012-04-01
In recent years, wireless sensor network (WSN), as a powerful tool, has been widely applied to structural health monitoring (SHM) due to its low cost of deployment. Several commercial hardware platforms of wireless sensor networks (WSN) have been developed and used for structural monitoring applications [1,2]. A typical design of a node includes a sensor board and a mote connected to it. Sensing units, analog filters and analog-to-digital converters (ADCs) are integrated on the sensor board and the mote consists of a microcontroller and a wireless transceiver. Generally, there are a set of sensor boards compatible with the same model of mote and the selection of the sensor board depends on the specific applications. A WSN system based on this node lacks the capability of interrupting its scheduled task to start a higher priority task. This shortcoming is rooted in the hardware architecture of the node. The proposed sandwich-node architecture is designed to remedy the shortcomings of the existing one for task preemption. A sandwich node is composed of a sensor board and two motes. The first mote is dedicated to managing the sensor board and processing acquired data. The second mote controls the first mote via commands. A prototype has been implemented using Imote2 and verified by an emulation in which one mote is triggered by a remote base station and then preempts the running task at the other mote for handling an emergency event.
A Hybrid DV-Hop Algorithm Using RSSI for Localization in Large-Scale Wireless Sensor Networks.
Cheikhrouhou, Omar; M Bhatti, Ghulam; Alroobaea, Roobaea
2018-05-08
With the increasing realization of the Internet-of-Things (IoT) and rapid proliferation of wireless sensor networks (WSN), estimating the location of wireless sensor nodes is emerging as an important issue. Traditional ranging based localization algorithms use triangulation for estimating the physical location of only those wireless nodes that are within one-hop distance from the anchor nodes. Multi-hop localization algorithms, on the other hand, aim at localizing the wireless nodes that can physically be residing at multiple hops away from anchor nodes. These latter algorithms have attracted a growing interest from research community due to the smaller number of required anchor nodes. One such algorithm, known as DV-Hop (Distance Vector Hop), has gained popularity due to its simplicity and lower cost. However, DV-Hop suffers from reduced accuracy due to the fact that it exploits only the network topology (i.e., number of hops to anchors) rather than the distances between pairs of nodes. In this paper, we propose an enhanced DV-Hop localization algorithm that also uses the RSSI values associated with links between one-hop neighbors. Moreover, we exploit already localized nodes by promoting them to become additional anchor nodes. Our simulations have shown that the proposed algorithm significantly outperforms the original DV-Hop localization algorithm and two of its recently published variants, namely RSSI Auxiliary Ranging and the Selective 3-Anchor DV-hop algorithm. More precisely, in some scenarios, the proposed algorithm improves the localization accuracy by almost 95%, 90% and 70% as compared to the basic DV-Hop, Selective 3-Anchor, and RSSI DV-Hop algorithms, respectively.
Mobile Wireless Sensor Networks for Advanced Soil Sensing and Ecosystem Monitoring
NASA Astrophysics Data System (ADS)
Mollenhauer, Hannes; Schima, Robert; Remmler, Paul; Mollenhauer, Olaf; Hutschenreuther, Tino; Toepfer, Hannes; Dietrich, Peter; Bumberger, Jan
2015-04-01
For an adequate characterization of ecosystems it is necessary to detect individual processes with suitable monitoring strategies and methods. Due to the natural complexity of all environmental compartments, single point or temporally and spatially fixed measurements are mostly insufficient for an adequate representation. The application of mobile wireless sensor networks for soil and atmosphere sensing offers significant benefits, due to the simple adjustment of the sensor distribution, the sensor types and the sample rate (e.g. by using optimization approaches or event triggering modes) to the local test conditions. This can be essential for the monitoring of heterogeneous and dynamic environmental systems and processes. One significant advantage in the application of mobile ad-hoc wireless sensor networks is their self-organizing behavior. Thus, the network autonomously initializes and optimizes itself. Due to the localization via satellite a major reduction in installation and operation costs and time is generated. In addition, single point measurements with a sensor are significantly improved by measuring at several optimized points continuously. Since performing analog and digital signal processing and computation in the sensor nodes close to the sensors a significant reduction of the data to be transmitted can be achieved which leads to a better energy management of nodes. Furthermore, the miniaturization of the nodes and energy harvesting are current topics under investigation. First results of field measurements are given to present the potentials and limitations of this application in environmental science. In particular, collected in-situ data with numerous specific soil and atmosphere parameters per sensor node (more than 25) recorded over several days illustrates the high performance of this system for advanced soil sensing and soil-atmosphere interaction monitoring. Moreover, investigations of biotic and abiotic process interactions and optimization of sensor positioning for measuring soil moisture are scopes of this work and initial results of these issues will be presented.
Exploiting node mobility for energy optimization in wireless sensor networks
NASA Astrophysics Data System (ADS)
El-Moukaddem, Fatme Mohammad
Wireless Sensor Networks (WSNs) have become increasingly available for data-intensive applications such as micro-climate monitoring, precision agriculture, and audio/video surveillance. A key challenge faced by data-intensive WSNs is to transmit the sheer amount of data generated within an application's lifetime to the base station despite the fact that sensor nodes have limited power supplies such as batteries or small solar panels. The availability of numerous low-cost robotic units (e.g. Robomote and Khepera) has made it possible to construct sensor networks consisting of mobile sensor nodes. It has been shown that the controlled mobility offered by mobile sensors can be exploited to improve the energy efficiency of a network. In this thesis, we propose schemes that use mobile sensor nodes to reduce the energy consumption of data-intensive WSNs. Our approaches differ from previous work in two main aspects. First, our approaches do not require complex motion planning of mobile nodes, and hence can be implemented on a number of low-cost mobile sensor platforms. Second, we integrate the energy consumption due to both mobility and wireless communications into a holistic optimization framework. We consider three problems arising from the limited energy in the sensor nodes. In the first problem, the network consists of mostly static nodes and contains only a few mobile nodes. In the second and third problems, we assume essentially that all nodes in the WSN are mobile. We first study a new problem called max-data mobile relay configuration (MMRC ) that finds the positions of a set of mobile sensors, referred to as relays, that maximize the total amount of data gathered by the network during its lifetime. We show that the MMRC problem is surprisingly complex even for a trivial network topology due to the joint consideration of the energy consumption of both wireless communication and mechanical locomotion. We present optimal MMRC algorithms and practical distributed implementations for several important network topologies and applications. Second, we consider the problem of minimizing the total energy consumption of a network. We design an iterative algorithm that improves a given configuration by relocating nodes to new positions. We show that this algorithm converges to the optimal configuration for the given transmission routes. Moreover, we propose an efficient distributed implementation that does not require explicit synchronization. Finally, we consider the problem of maximizing the lifetime of the network. We propose an approach that exploits the mobility of the nodes to balance the energy consumption throughout the network. We develop efficient algorithms for single and multiple round approaches. For all three problems, we evaluate the efficiency of our algorithms through simulations. Our simulation results based on realistic energy models obtained from existing mobile and static sensor platforms show that our approaches significantly improve the network's performance and outperform existing approaches.
An Efficient Distributed Coverage Hole Detection Protocol for Wireless Sensor Networks
Kumar Sahoo, Prasan; Chiang, Ming-Jer; Wu, Shih-Lin
2016-01-01
In wireless sensor networks (WSNs), certain areas of the monitoring region may have coverage holes and serious coverage overlapping due to the random deployment of sensors. The failure of electronic components, software bugs and destructive agents could lead to the random death of the nodes. Sensors may be dead due to exhaustion of battery power, which may cause the network to be uncovered and disconnected. Based on the deployment nature of the nodes in remote or hostile environments, such as a battlefield or desert, it is impossible to recharge or replace the battery. However, the data gathered by the sensors are highly essential for the analysis, and therefore, the collaborative detection of coverage holes has strategic importance in WSNs. In this paper, distributed coverage hole detection algorithms are designed, where nodes can collaborate to detect the coverage holes autonomously. The performance evaluation of our protocols suggests that our protocols outperform in terms of hole detection time, limited power consumption and control packet overhead to detect holes as compared to other similar protocols. PMID:26999143
Teng, Rui; Leibnitz, Kenji; Miura, Ryu
2013-01-01
An essential application of wireless sensor networks is to successfully respond to user queries. Query packet losses occur in the query dissemination due to wireless communication problems such as interference, multipath fading, packet collisions, etc. The losses of query messages at sensor nodes result in the failure of sensor nodes reporting the requested data. Hence, the reliable and successful dissemination of query messages to sensor nodes is a non-trivial problem. The target of this paper is to enable highly successful query delivery to sensor nodes by localized and energy-efficient discovery, and recovery of query losses. We adopt local and collective cooperation among sensor nodes to increase the success rate of distributed discoveries and recoveries. To enable the scalability in the operations of discoveries and recoveries, we employ a distributed name resolution mechanism at each sensor node to allow sensor nodes to self-detect the correlated queries and query losses, and then efficiently locally respond to the query losses. We prove that the collective discovery of query losses has a high impact on the success of query dissemination and reveal that scalability can be achieved by using the proposed approach. We further study the novel features of the cooperation and competition in the collective recovery at PHY and MAC layers, and show that the appropriate number of detectors can achieve optimal successful recovery rate. We evaluate the proposed approach with both mathematical analyses and computer simulations. The proposed approach enables a high rate of successful delivery of query messages and it results in short route lengths to recover from query losses. The proposed approach is scalable and operates in a fully distributed manner. PMID:23748172
A survey on bio inspired meta heuristic based clustering protocols for wireless sensor networks
NASA Astrophysics Data System (ADS)
Datta, A.; Nandakumar, S.
2017-11-01
Recent studies have shown that utilizing a mobile sink to harvest and carry data from a Wireless Sensor Network (WSN) can improve network operational efficiency as well as maintain uniform energy consumption by the sensor nodes in the network. Due to Sink mobility, the path between two sensor nodes continuously changes and this has a profound effect on the operational longevity of the network and a need arises for a protocol which utilizes minimal resources in maintaining routes between the mobile sink and the sensor nodes. Swarm Intelligence based techniques inspired by the foraging behavior of ants, termites and honey bees can be artificially simulated and utilized to solve real wireless network problems. The author presents a brief survey on various bio inspired swarm intelligence based protocols used in routing data in wireless sensor networks while outlining their general principle and operation.
Fuzzy-Logic Based Distributed Energy-Efficient Clustering Algorithm for Wireless Sensor Networks.
Zhang, Ying; Wang, Jun; Han, Dezhi; Wu, Huafeng; Zhou, Rundong
2017-07-03
Due to the high-energy efficiency and scalability, the clustering routing algorithm has been widely used in wireless sensor networks (WSNs). In order to gather information more efficiently, each sensor node transmits data to its Cluster Head (CH) to which it belongs, by multi-hop communication. However, the multi-hop communication in the cluster brings the problem of excessive energy consumption of the relay nodes which are closer to the CH. These nodes' energy will be consumed more quickly than the farther nodes, which brings the negative influence on load balance for the whole networks. Therefore, we propose an energy-efficient distributed clustering algorithm based on fuzzy approach with non-uniform distribution (EEDCF). During CHs' election, we take nodes' energies, nodes' degree and neighbor nodes' residual energies into consideration as the input parameters. In addition, we take advantage of Takagi, Sugeno and Kang (TSK) fuzzy model instead of traditional method as our inference system to guarantee the quantitative analysis more reasonable. In our scheme, each sensor node calculates the probability of being as CH with the help of fuzzy inference system in a distributed way. The experimental results indicate EEDCF algorithm is better than some current representative methods in aspects of data transmission, energy consumption and lifetime of networks.
Energy Harvesting Hybrid Acoustic-Optical Underwater Wireless Sensor Networks Localization.
Saeed, Nasir; Celik, Abdulkadir; Al-Naffouri, Tareq Y; Alouini, Mohamed-Slim
2017-12-26
Underwater wireless technologies demand to transmit at higher data rate for ocean exploration. Currently, large coverage is achieved by acoustic sensor networks with low data rate, high cost, high latency, high power consumption, and negative impact on marine mammals. Meanwhile, optical communication for underwater networks has the advantage of the higher data rate albeit for limited communication distances. Moreover, energy consumption is another major problem for underwater sensor networks, due to limited battery power and difficulty in replacing or recharging the battery of a sensor node. The ultimate solution to this problem is to add energy harvesting capability to the acoustic-optical sensor nodes. Localization of underwater sensor networks is of utmost importance because the data collected from underwater sensor nodes is useful only if the location of the nodes is known. Therefore, a novel localization technique for energy harvesting hybrid acoustic-optical underwater wireless sensor networks (AO-UWSNs) is proposed. AO-UWSN employs optical communication for higher data rate at a short transmission distance and employs acoustic communication for low data rate and long transmission distance. A hybrid received signal strength (RSS) based localization technique is proposed to localize the nodes in AO-UWSNs. The proposed technique combines the noisy RSS based measurements from acoustic communication and optical communication and estimates the final locations of acoustic-optical sensor nodes. A weighted multiple observations paradigm is proposed for hybrid estimated distances to suppress the noisy observations and give more importance to the accurate observations. Furthermore, the closed form solution for Cramer-Rao lower bound (CRLB) is derived for localization accuracy of the proposed technique.
Energy Harvesting Hybrid Acoustic-Optical Underwater Wireless Sensor Networks Localization
Saeed, Nasir; Celik, Abdulkadir; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim
2017-01-01
Underwater wireless technologies demand to transmit at higher data rate for ocean exploration. Currently, large coverage is achieved by acoustic sensor networks with low data rate, high cost, high latency, high power consumption, and negative impact on marine mammals. Meanwhile, optical communication for underwater networks has the advantage of the higher data rate albeit for limited communication distances. Moreover, energy consumption is another major problem for underwater sensor networks, due to limited battery power and difficulty in replacing or recharging the battery of a sensor node. The ultimate solution to this problem is to add energy harvesting capability to the acoustic-optical sensor nodes. Localization of underwater sensor networks is of utmost importance because the data collected from underwater sensor nodes is useful only if the location of the nodes is known. Therefore, a novel localization technique for energy harvesting hybrid acoustic-optical underwater wireless sensor networks (AO-UWSNs) is proposed. AO-UWSN employs optical communication for higher data rate at a short transmission distance and employs acoustic communication for low data rate and long transmission distance. A hybrid received signal strength (RSS) based localization technique is proposed to localize the nodes in AO-UWSNs. The proposed technique combines the noisy RSS based measurements from acoustic communication and optical communication and estimates the final locations of acoustic-optical sensor nodes. A weighted multiple observations paradigm is proposed for hybrid estimated distances to suppress the noisy observations and give more importance to the accurate observations. Furthermore, the closed form solution for Cramer-Rao lower bound (CRLB) is derived for localization accuracy of the proposed technique. PMID:29278405
A Survey on Virtualization of Wireless Sensor Networks
Islam, Md. Motaharul; Hassan, Mohammad Mehedi; Lee, Ga-Won; Huh, Eui-Nam
2012-01-01
Wireless Sensor Networks (WSNs) are gaining tremendous importance thanks to their broad range of commercial applications such as in smart 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 specific WSN domains, communication barriers, conflicting goals and the economic interests of different WSN sensor node vendors, it is difficult to introduce a large scale federated WSN. By allowing heterogeneous sensor nodes in WSNs to coexist on a shared physical sensor substrate, virtualization in sensor network may provide flexibility, cost effective solutions, 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. Our focus in this paper is to introduce a few design goals, the challenges and opportunities of research in the field of sensor network virtualization as well as to illustrate a current status of research in this field. This paper also presents a wide array of state-of-the art projects related to sensor network virtualization. PMID:22438759
A survey on virtualization of Wireless Sensor Networks.
Islam, Md Motaharul; Hassan, Mohammad Mehedi; Lee, Ga-Won; Huh, Eui-Nam
2012-01-01
Wireless Sensor Networks (WSNs) are gaining tremendous importance thanks to their broad range of commercial applications such as in smart 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 specific WSN domains, communication barriers, conflicting goals and the economic interests of different WSN sensor node vendors, it is difficult to introduce a large scale federated WSN. By allowing heterogeneous sensor nodes in WSNs to coexist on a shared physical sensor substrate, virtualization in sensor network may provide flexibility, cost effective solutions, 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. Our focus in this paper is to introduce a few design goals, the challenges and opportunities of research in the field of sensor network virtualization as well as to illustrate a current status of research in this field. This paper also presents a wide array of state-of-the art projects related to sensor network virtualization.
A Distance-based Energy Aware Routing algorithm for wireless sensor networks.
Wang, Jin; Kim, Jeong-Uk; Shu, Lei; Niu, Yu; Lee, Sungyoung
2010-01-01
Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs) since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation and location tracking etc. However, many of them aim to minimize parameters like total energy consumption, latency etc., which cause hotspot nodes and partitioned network due to the overuse of certain nodes. In this paper, a Distance-based Energy Aware Routing (DEAR) algorithm is proposed to ensure energy efficiency and energy balancing based on theoretical analysis of different energy and traffic models. During the routing process, we consider individual distance as the primary parameter in order to adjust and equalize the energy consumption among involved sensors. The residual energy is also considered as a secondary factor. In this way, all the intermediate nodes will consume their energy at similar rate, which maximizes network lifetime. Simulation results show that the DEAR algorithm can reduce and balance the energy consumption for all sensor nodes so network lifetime is greatly prolonged compared to other routing algorithms.
Zhang, Ying; Wang, Jun; Hao, Guan
2018-01-08
With the development of autonomous unmanned intelligent systems, such as the unmanned boats, unmanned planes and autonomous underwater vehicles, studies on Wireless Sensor-Actor Networks (WSANs) have attracted more attention. Network connectivity algorithms play an important role in data exchange, collaborative detection and information fusion. Due to the harsh application environment, abnormal nodes often appear, and the network connectivity will be prone to be lost. Network self-healing mechanisms have become critical for these systems. In order to decrease the movement overhead of the sensor-actor nodes, an autonomous connectivity restoration algorithm based on finite state machine is proposed. The idea is to identify whether a node is a critical node by using a finite state machine, and update the connected dominating set in a timely way. If an abnormal node is a critical node, the nearest non-critical node will be relocated to replace the abnormal node. In the case of multiple node abnormality, a regional network restoration algorithm is introduced. It is designed to reduce the overhead of node movements while restoration happens. Simulation results indicate the proposed algorithm has better performance on the total moving distance and the number of total relocated nodes compared with some other representative restoration algorithms.
Zhang, Ying; Wang, Jun; Hao, Guan
2018-01-01
With the development of autonomous unmanned intelligent systems, such as the unmanned boats, unmanned planes and autonomous underwater vehicles, studies on Wireless Sensor-Actor Networks (WSANs) have attracted more attention. Network connectivity algorithms play an important role in data exchange, collaborative detection and information fusion. Due to the harsh application environment, abnormal nodes often appear, and the network connectivity will be prone to be lost. Network self-healing mechanisms have become critical for these systems. In order to decrease the movement overhead of the sensor-actor nodes, an autonomous connectivity restoration algorithm based on finite state machine is proposed. The idea is to identify whether a node is a critical node by using a finite state machine, and update the connected dominating set in a timely way. If an abnormal node is a critical node, the nearest non-critical node will be relocated to replace the abnormal node. In the case of multiple node abnormality, a regional network restoration algorithm is introduced. It is designed to reduce the overhead of node movements while restoration happens. Simulation results indicate the proposed algorithm has better performance on the total moving distance and the number of total relocated nodes compared with some other representative restoration algorithms. PMID:29316702
Information-based self-organization of sensor nodes of a sensor network
Ko, Teresa H [Castro Valley, CA; Berry, Nina M [Tracy, CA
2011-09-20
A sensor node detects a plurality of information-based events. The sensor node determines whether at least one other sensor node is an information neighbor of the sensor node based on at least a portion of the plurality of information-based events. The information neighbor has an overlapping field of view with the sensor node. The sensor node sends at least one communication to the at least one other sensor node that is an information neighbor of the sensor node in response to at least one information-based event of the plurality of information-based events.
UAV-Assisted Dynamic Clustering of Wireless Sensor Networks for Crop Health Monitoring
Ammad Uddin, Mohammad; Mansour, Ali; Le Jeune, Denis; Ayaz, Mohammad; Aggoune, el-Hadi M.
2018-01-01
In this study, a crop health monitoring system is developed by using state of the art technologies including wireless sensors and Unmanned Aerial Vehicles (UAVs). Conventionally data is collected from sensor nodes either by fixed base stations or mobile sinks. Mobile sinks are considered a better choice nowadays due to their improved network coverage and energy utilization. Usually, the mobile sink is used in two ways: either it goes for random walk to find the scattered nodes and collect data, or follows a pre-defined path established by the ground network/clusters. Neither of these options is suitable in our scenario due to the factors like dynamic data collection, the strict targeted area required to be scanned, unavailability of a large number of nodes, dynamic path of the UAV, and most importantly, none of these are known in advance. The contribution of this paper is the formation of dynamic runtime clusters of field sensors by considering the above mentioned factors. Furthermore a mechanism (Bayesian classifier) is defined to select best node as cluster head. The proposed system is validated through simulation results, lab and infield experiments using concept devices. The obtained results are encouraging, especially in terms of deployment time, energy, efficiency, throughput and ease of use. PMID:29439496
UAV-Assisted Dynamic Clustering of Wireless Sensor Networks for Crop Health Monitoring.
Uddin, Mohammad Ammad; Mansour, Ali; Jeune, Denis Le; Ayaz, Mohammad; Aggoune, El-Hadi M
2018-02-11
In this study, a crop health monitoring system is developed by using state of the art technologies including wireless sensors and Unmanned Aerial Vehicles (UAVs). Conventionally data is collected from sensor nodes either by fixed base stations or mobile sinks. Mobile sinks are considered a better choice nowadays due to their improved network coverage and energy utilization. Usually, the mobile sink is used in two ways: either it goes for random walk to find the scattered nodes and collect data, or follows a pre-defined path established by the ground network/clusters. Neither of these options is suitable in our scenario due to the factors like dynamic data collection, the strict targeted area required to be scanned, unavailability of a large number of nodes, dynamic path of the UAV, and most importantly, none of these are known in advance. The contribution of this paper is the formation of dynamic runtime clusters of field sensors by considering the above mentioned factors. Furthermore a mechanism (Bayesian classifier) is defined to select best node as cluster head. The proposed system is validated through simulation results, lab and infield experiments using concept devices. The obtained results are encouraging, especially in terms of deployment time, energy, efficiency, throughput and ease of use.
Wan, Jan; Xiong, Naixue; Zhang, Wei; Zhang, Qinchao; Wan, Zheng
2012-01-01
The reliability of wireless sensor networks (WSNs) can be greatly affected by failures of sensor nodes due to energy exhaustion or the influence of brutal external environment conditions. Such failures seriously affect the data persistence and collection efficiency. Strategies based on network coding technology for WSNs such as LTCDS can improve the data persistence without mass redundancy. However, due to the bad intermediate performance of LTCDS, a serious ‘cliff effect’ may appear during the decoding period, and source data are hard to recover from sink nodes before sufficient encoded packets are collected. In this paper, the influence of coding degree distribution strategy on the ‘cliff effect’ is observed and the prioritized data storage and dissemination algorithm PLTD-ALPHA is presented to achieve better data persistence and recovering performance. With PLTD-ALPHA, the data in sensor network nodes present a trend that their degree distribution increases along with the degree level predefined, and the persistent data packets can be submitted to the sink node according to its degree in order. Finally, the performance of PLTD-ALPHA is evaluated and experiment results show that PLTD-ALPHA can greatly improve the data collection performance and decoding efficiency, while data persistence is not notably affected. PMID:23235451
Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks.
Lee, JeongCheol; Park, HoSung; Kang, SeokYoon; Kim, Ki-Il
2015-06-05
Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols.
Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks
Lee, JeongCheol; Park, HoSung; Kang, SeokYoon; Kim, Ki-Il
2015-01-01
Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols. PMID:26057037
Bioinspired principles for large-scale networked sensor systems: an overview.
Jacobsen, Rune Hylsberg; Zhang, Qi; Toftegaard, Thomas Skjødeberg
2011-01-01
Biology has often been used as a source of inspiration in computer science and engineering. Bioinspired principles have found their way into network node design and research due to the appealing analogies between biological systems and large networks of small sensors. This paper provides an overview of bioinspired principles and methods such as swarm intelligence, natural time synchronization, artificial immune system and intercellular information exchange applicable for sensor network design. Bioinspired principles and methods are discussed in the context of routing, clustering, time synchronization, optimal node deployment, localization and security and privacy.
Ding, Xu; Shi, Lei; Han, Jianghong; Lu, Jingting
2016-01-28
Wireless sensor networks deployed in coal mines could help companies provide workers working in coal mines with more qualified working conditions. With the underground information collected by sensor nodes at hand, the underground working conditions could be evaluated more precisely. However, sensor nodes may tend to malfunction due to their limited energy supply. In this paper, we study the cross-layer optimization problem for wireless rechargeable sensor networks implemented in coal mines, of which the energy could be replenished through the newly-brewed wireless energy transfer technique. The main results of this article are two-fold: firstly, we obtain the optimal relay nodes' placement according to the minimum overall energy consumption criterion through the Lagrange dual problem and KKT conditions; secondly, the optimal strategies for recharging locomotives and wireless sensor networks are acquired by solving a cross-layer optimization problem. The cyclic nature of these strategies is also manifested through simulations in this paper.
A Tree Based Self-routing Scheme for Mobility Support in Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Kim, Young-Duk; Yang, Yeon-Mo; Kang, Won-Seok; Kim, Jin-Wook; An, Jinung
Recently, WSNs (Wireless Sensor Networks) with mobile robot is a growing technology that offer efficient communication services for anytime and anywhere applications. However, the tiny sensor node has very limited network resources due to its low battery power, low data rate, node mobility, and channel interference constraint between neighbors. Thus, in this paper, we proposed a tree based self-routing protocol for autonomous mobile robots based on beacon mode and implemented in real test-bed environments. The proposed scheme offers beacon based real-time scheduling for reliable association process between parent and child nodes. In addition, it supports smooth handover procedure by reducing flooding overhead of control packets. Throughout the performance evaluation by using a real test-bed system and simulation, we illustrate that our proposed scheme demonstrates promising performance for wireless sensor networks with mobile robots.
Muhammed, Dalhatu; Anisi, Mohammad Hossein; Zareei, Mahdi; Vargas-Rosales, Cesar; Khan, Anwar
2018-02-01
Exploring and monitoring the underwater world using underwater sensors is drawing a lot of attention these days. In this field cooperation between acoustic sensor nodes has been a critical problem due to the challenging features such as acoustic channel failure (sound signal), long propagation delay of acoustic signal, limited bandwidth and loss of connectivity. There are several proposed methods to improve cooperation between the nodes by incorporating information/game theory in the node's cooperation. However, there is a need to classify the existing works and demonstrate their performance in addressing the cooperation issue. In this paper, we have conducted a review to investigate various factors affecting cooperation in underwater acoustic sensor networks. We study various cooperation techniques used for underwater acoustic sensor networks from different perspectives, with a concentration on communication reliability, energy consumption, and security and present a taxonomy for underwater cooperation. Moreover, we further review how the game theory can be applied to make the nodes cooperate with each other. We further analyze different cooperative game methods, where their performance on different metrics is compared. Finally, open issues and future research direction in underwater acoustic sensor networks are highlighted.
In-network processing of joins in wireless sensor networks.
Kang, Hyunchul
2013-03-11
The join or correlated filtering of sensor readings is one of the fundamental query operations in wireless sensor networks (WSNs). Although the join in centralized or distributed databases is a well-researched problem, join processing in WSNs has quite different characteristics and is much more difficult to perform due to the lack of statistics on sensor readings and the resource constraints of sensor nodes. Since data transmission is orders of magnitude more costly than processing at a sensor node, in-network processing of joins is essential. In this paper, the state-of-the-art techniques for join implementation in WSNs are surveyed. The requirements and challenges, join types, and components of join implementation are described. The open issues for further research are identified.
In-Network Processing of Joins in Wireless Sensor Networks
Kang, Hyunchul
2013-01-01
The join or correlated filtering of sensor readings is one of the fundamental query operations in wireless sensor networks (WSNs). Although the join in centralized or distributed databases is a well-researched problem, join processing in WSNs has quite different characteristics and is much more difficult to perform due to the lack of statistics on sensor readings and the resource constraints of sensor nodes. Since data transmission is orders of magnitude more costly than processing at a sensor node, in-network processing of joins is essential. In this paper, the state-of-the-art techniques for join implementation in WSNs are surveyed. The requirements and challenges, join types, and components of join implementation are described. The open issues for further research are identified. PMID:23478603
Energy Harvesting Chip and the Chip Based Power Supply Development for a Wireless Sensor Network.
Lee, Dasheng
2008-12-02
In this study, an energy harvesting chip was developed to scavenge energy from artificial light to charge a wireless sensor node. The chip core is a miniature transformer with a nano-ferrofluid magnetic core. The chip embedded transformer can convert harvested energy from its solar cell to variable voltage output for driving multiple loads. This chip system yields a simple, small, and more importantly, a battery-less power supply solution. The sensor node is equipped with multiple sensors that can be enabled by the energy harvesting power supply to collect information about the human body comfort degree. Compared with lab instruments, the nodes with temperature, humidity and photosensors driven by harvested energy had variation coefficient measurement precision of less than 6% deviation under low environmental light of 240 lux. The thermal comfort was affected by the air speed. A flow sensor equipped on the sensor node was used to detect airflow speed. Due to its high power consumption, this sensor node provided 15% less accuracy than the instruments, but it still can meet the requirement of analysis for predicted mean votes (PMV) measurement. The energy harvesting wireless sensor network (WSN) was deployed in a 24-hour convenience store to detect thermal comfort degree from the air conditioning control. During one year operation, the sensor network powered by the energy harvesting chip retained normal functions to collect the PMV index of the store. According to the one month statistics of communication status, the packet loss rate (PLR) is 2.3%, which is as good as the presented results of those WSNs powered by battery. Referring to the electric power records, almost 54% energy can be saved by the feedback control of an energy harvesting sensor network. These results illustrate that, scavenging energy not only creates a reliable power source for electronic devices, such as wireless sensor nodes, but can also be an energy source by building an energy efficient program.
Energy Harvesting Chip and the Chip Based Power Supply Development for a Wireless Sensor Network
Lee, Dasheng
2008-01-01
In this study, an energy harvesting chip was developed to scavenge energy from artificial light to charge a wireless sensor node. The chip core is a miniature transformer with a nano-ferrofluid magnetic core. The chip embedded transformer can convert harvested energy from its solar cell to variable voltage output for driving multiple loads. This chip system yields a simple, small, and more importantly, a battery-less power supply solution. The sensor node is equipped with multiple sensors that can be enabled by the energy harvesting power supply to collect information about the human body comfort degree. Compared with lab instruments, the nodes with temperature, humidity and photosensors driven by harvested energy had variation coefficient measurement precision of less than 6% deviation under low environmental light of 240 lux. The thermal comfort was affected by the air speed. A flow sensor equipped on the sensor node was used to detect airflow speed. Due to its high power consumption, this sensor node provided 15% less accuracy than the instruments, but it still can meet the requirement of analysis for predicted mean votes (PMV) measurement. The energy harvesting wireless sensor network (WSN) was deployed in a 24-hour convenience store to detect thermal comfort degree from the air conditioning control. During one year operation, the sensor network powered by the energy harvesting chip retained normal functions to collect the PMV index of the store. According to the one month statistics of communication status, the packet loss rate (PLR) is 2.3%, which is as good as the presented results of those WSNs powered by battery. Referring to the electric power records, almost 54% energy can be saved by the feedback control of an energy harvesting sensor network. These results illustrate that, scavenging energy not only creates a reliable power source for electronic devices, such as wireless sensor nodes, but can also be an energy source by building an energy efficient program. PMID:27873953
A New Approach to Design Autonomous Wireless Sensor Node Based on RF Energy Harvesting System.
Mouapi, Alex; Hakem, Nadir
2018-01-05
Energy Harvesting techniques are increasingly seen as the solution for freeing the wireless sensor nodes from their battery dependency. However, it remains evident that network performance features, such as network size, packet length, and duty cycle, are influenced by the sum of recovered energy. This paper proposes a new approach to defining the specifications of a stand-alone wireless node based on a Radio-frequency Energy Harvesting System (REHS). To achieve adequate performance regarding the range of the Wireless Sensor Network (WSN), techniques for minimizing the energy consumed by the sensor node are combined with methods for optimizing the performance of the REHS. For more rigor in the design of the autonomous node, a comprehensive energy model of the node in a wireless network is established. For an equitable distribution of network charges between the different nodes that compose it, the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is used for this purpose. The model considers five energy-consumption sources, most of which are ignored in recently used models. By using the hardware parameters of commercial off-the-shelf components (Mica2 Motes and CC2520 of Texas Instruments), the energy requirement of a sensor node is quantified. A miniature REHS based on a judicious choice of rectifying diodes is then designed and developed to achieve optimal performance in the Industrial Scientific and Medical (ISM) band centralized at 2.45 GHz . Due to the mismatch between the REHS and the antenna, a band pass filter is designed to reduce reflection losses. A gradient method search is used to optimize the output characteristics of the adapted REHS. At 1 mW of input RF power, the REHS provides an output DC power of 0.57 mW and a comparison with the energy requirement of the node allows the Base Station (BS) to be located at 310 m from the wireless nodes when the Wireless Sensor Network (WSN) has 100 nodes evenly spread over an area of 300 × 300 m 2 and when each round lasts 10 min . The result shows that the range of the autonomous WSN increases when the controlled physical phenomenon varies very slowly. Having taken into account all the dissipation sources coexisting in a sensor node and using actual measurements of an REHS, this work provides the guidelines for the design of autonomous nodes based on REHS.
Low-Latency and Energy-Efficient Data Preservation Mechanism in Low-Duty-Cycle Sensor Networks.
Jiang, Chan; Li, Tao-Shen; Liang, Jun-Bin; Wu, Heng
2017-05-06
Similar to traditional wireless sensor networks (WSN), the nodes only have limited memory and energy in low-duty-cycle sensor networks (LDC-WSN). However, different from WSN, the nodes in LDC-WSN often sleep most of their time to preserve their energies. The sleeping feature causes serious data transmission delay. However, each source node that has sensed data needs to quickly disseminate its data to other nodes in the network for redundant storage. Otherwise, data would be lost due to its source node possibly being destroyed by outer forces in a harsh environment. The quick dissemination requirement produces a contradiction with the sleeping delay in the network. How to quickly disseminate all the source data to all the nodes with limited memory in the network for effective preservation is a challenging issue. In this paper, a low-latency and energy-efficient data preservation mechanism in LDC-WSN is proposed. The mechanism is totally distributed. The data can be disseminated to the network with low latency by using a revised probabilistic broadcasting mechanism, and then stored by the nodes with LT (Luby Transform) codes, which are a famous rateless erasure code. After the process of data dissemination and storage completes, some nodes may die due to being destroyed by outer forces. If a mobile sink enters the network at any time and from any place to collect the data, it can recover all of the source data by visiting a small portion of survived nodes in the network. Theoretical analyses and simulation results show that our mechanism outperforms existing mechanisms in the performances of data dissemination delay and energy efficiency.
Automatic Multi-sensor Data Quality Checking and Event Detection for Environmental Sensing
NASA Astrophysics Data System (ADS)
LIU, Q.; Zhang, Y.; Zhao, Y.; Gao, D.; Gallaher, D. W.; Lv, Q.; Shang, L.
2017-12-01
With the advances in sensing technologies, large-scale environmental sensing infrastructures are pervasively deployed to continuously collect data for various research and application fields, such as air quality study and weather condition monitoring. In such infrastructures, many sensor nodes are distributed in a specific area and each individual sensor node is capable of measuring several parameters (e.g., humidity, temperature, and pressure), providing massive data for natural event detection and analysis. However, due to the dynamics of the ambient environment, sensor data can be contaminated by errors or noise. Thus, data quality is still a primary concern for scientists before drawing any reliable scientific conclusions. To help researchers identify potential data quality issues and detect meaningful natural events, this work proposes a novel algorithm to automatically identify and rank anomalous time windows from multiple sensor data streams. More specifically, (1) the algorithm adaptively learns the characteristics of normal evolving time series and (2) models the spatial-temporal relationship among multiple sensor nodes to infer the anomaly likelihood of a time series window for a particular parameter in a sensor node. Case studies using different data sets are presented and the experimental results demonstrate that the proposed algorithm can effectively identify anomalous time windows, which may resulted from data quality issues and natural events.
A Two-Phase Coverage-Enhancing Algorithm for Hybrid Wireless Sensor Networks.
Zhang, Qingguo; Fok, Mable P
2017-01-09
Providing field coverage is a key task in many sensor network applications. In certain scenarios, the sensor field may have coverage holes due to random initial deployment of sensors; thus, the desired level of coverage cannot be achieved. A hybrid wireless sensor network is a cost-effective solution to this problem, which is achieved by repositioning a portion of the mobile sensors in the network to meet the network coverage requirement. This paper investigates how to redeploy mobile sensor nodes to improve network coverage in hybrid wireless sensor networks. We propose a two-phase coverage-enhancing algorithm for hybrid wireless sensor networks. In phase one, we use a differential evolution algorithm to compute the candidate's target positions in the mobile sensor nodes that could potentially improve coverage. In the second phase, we use an optimization scheme on the candidate's target positions calculated from phase one to reduce the accumulated potential moving distance of mobile sensors, such that the exact mobile sensor nodes that need to be moved as well as their final target positions can be determined. Experimental results show that the proposed algorithm provided significant improvement in terms of area coverage rate, average moving distance, area coverage-distance rate and the number of moved mobile sensors, when compare with other approaches.
A Two-Phase Coverage-Enhancing Algorithm for Hybrid Wireless Sensor Networks
Zhang, Qingguo; Fok, Mable P.
2017-01-01
Providing field coverage is a key task in many sensor network applications. In certain scenarios, the sensor field may have coverage holes due to random initial deployment of sensors; thus, the desired level of coverage cannot be achieved. A hybrid wireless sensor network is a cost-effective solution to this problem, which is achieved by repositioning a portion of the mobile sensors in the network to meet the network coverage requirement. This paper investigates how to redeploy mobile sensor nodes to improve network coverage in hybrid wireless sensor networks. We propose a two-phase coverage-enhancing algorithm for hybrid wireless sensor networks. In phase one, we use a differential evolution algorithm to compute the candidate’s target positions in the mobile sensor nodes that could potentially improve coverage. In the second phase, we use an optimization scheme on the candidate’s target positions calculated from phase one to reduce the accumulated potential moving distance of mobile sensors, such that the exact mobile sensor nodes that need to be moved as well as their final target positions can be determined. Experimental results show that the proposed algorithm provided significant improvement in terms of area coverage rate, average moving distance, area coverage–distance rate and the number of moved mobile sensors, when compare with other approaches. PMID:28075365
Kim, Jeehyeong; Karim, Nzabanita Abdoul; Cho, Sunghyun
2017-01-01
Device-to-Device (D2D) communication technology has become a key factor in wireless sensor networks to form autonomous communication links among sensor nodes. Many research results for D2D have been presented to resolve different technical issues of D2D. Nevertheless, the previous works have not resolved the shortage of data rate and limited coverage of wireless sensor networks. Due to bandwidth shortages and limited communication coverage, 3rd Generation Partnership Project (3GPP) has introduced a new Device-to-Device (D2D) communication technique underlying cellular networks, which can improve spectral efficiencies by enabling the direct communication of devices in proximity without passing through enhanced-NodeB (eNB). However, to enable D2D communication in a cellular network presents a challenge with regard to radio resource management since D2D links reuse the uplink radio resources of cellular users and it can cause interference to the receiving channels of D2D user equipment (DUE). In this paper, a hybrid mechanism is proposed that uses Fractional Frequency Reuse (FFR) and Almost Blank Sub-frame (ABS) schemes to handle inter-cell interference caused by cellular user equipments (CUEs) to D2D receivers (DUE-Rxs), reusing the same resources at the cell edge area. In our case, DUE-Rxs are considered as victim nodes and CUEs as aggressor nodes, since our primary target is to minimize inter-cell interference in order to increase the signal to interference and noise ratio (SINR) of the target DUE-Rx at the cell edge area. The numerical results show that the interference level of the target D2D receiver (DUE-Rx) decreases significantly compared to the conventional FFR at the cell edge. In addition, the system throughput of the proposed scheme can be increased up to 60% compared to the conventional FFR. PMID:28489064
Kim, Jeehyeong; Karim, Nzabanita Abdoul; Cho, Sunghyun
2017-05-10
Device-to-Device (D2D) communication technology has become a key factor in wireless sensor networks to form autonomous communication links among sensor nodes. Many research results for D2D have been presented to resolve different technical issues of D2D. Nevertheless, the previous works have not resolved the shortage of data rate and limited coverage of wireless sensor networks. Due to bandwidth shortages and limited communication coverage, 3rd Generation Partnership Project (3GPP) has introduced a new Device-to-Device (D2D) communication technique underlying cellular networks, which can improve spectral efficiencies by enabling the direct communication of devices in proximity without passing through enhanced-NodeB (eNB). However, to enable D2D communication in a cellular network presents a challenge with regard to radio resource management since D2D links reuse the uplink radio resources of cellular users and it can cause interference to the receiving channels of D2D user equipment (DUE). In this paper, a hybrid mechanism is proposed that uses Fractional Frequency Reuse (FFR) and Almost Blank Sub-frame (ABS) schemes to handle inter-cell interference caused by cellular user equipments (CUEs) to D2D receivers (DUE-Rxs), reusing the same resources at the cell edge area. In our case, DUE-Rxs are considered as victim nodes and CUEs as aggressor nodes, since our primary target is to minimize inter-cell interference in order to increase the signal to interference and noise ratio (SINR) of the target DUE-Rx at the cell edge area. The numerical results show that the interference level of the target D2D receiver (DUE-Rx) decreases significantly compared to the conventional FFR at the cell edge. In addition, the system throughput of the proposed scheme can be increased up to 60% compared to the conventional FFR.
A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore
Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.
Yoon, Ikjune; Kim, Hyeok; Noh, Dong Kun
2017-01-01
A node in a solar-powered wireless sensor network (WSN) collects energy when the sun shines and stores it in a battery or capacitor for use when no solar power is available, in particular at night. In our scheme, each tiny node in a WSN periodically determines its energy budget, which takes into account its residual energy, and its likely acquisition and consumption. If it expects to acquire more energy than it can store, the data which has it has sensed is aggregated with data from other nodes, compressed, and transmitted. Otherwise, the node continues to sense data, but turns off its wireless communication to reduce energy consumption. We compared several schemes by simulation. Our scheme reduced the number of nodes forced to black out due to lack of energy so that more data arrives at the sink node. PMID:28555010
Yoon, Ikjune; Kim, Hyeok; Noh, Dong Kun
2017-05-27
A node in a solar-powered wireless sensor network (WSN) collects energy when the sun shines and stores it in a battery or capacitor for use when no solar power is available, in particular at night. In our scheme, each tiny node in a WSN periodically determines its energy budget, which takes into account its residual energy, and its likely acquisition and consumption. If it expects to acquire more energy than it can store, the data which has it has sensed is aggregated with data from other nodes, compressed, and transmitted. Otherwise, the node continues to sense data, but turns off its wireless communication to reduce energy consumption. We compared several schemes by simulation. Our scheme reduced the number of nodes forced to black out due to lack of energy so that more data arrives at the sink node.
Seo, Jaewan; Kim, Moonseong; Hur, In; Choi, Wook; Choo, Hyunseung
2010-01-01
Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT) scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.
Bioinspired Principles for Large-Scale Networked Sensor Systems: An Overview
Jacobsen, Rune Hylsberg; Zhang, Qi; Toftegaard, Thomas Skjødeberg
2011-01-01
Biology has often been used as a source of inspiration in computer science and engineering. Bioinspired principles have found their way into network node design and research due to the appealing analogies between biological systems and large networks of small sensors. This paper provides an overview of bioinspired principles and methods such as swarm intelligence, natural time synchronization, artificial immune system and intercellular information exchange applicable for sensor network design. Bioinspired principles and methods are discussed in the context of routing, clustering, time synchronization, optimal node deployment, localization and security and privacy. PMID:22163841
Cross-layer design for intrusion detection and data security in wireless ad hoc sensor networks
NASA Astrophysics Data System (ADS)
Hortos, William S.
2007-09-01
A wireless ad hoc sensor network is a configuration for area surveillance that affords rapid, flexible deployment in arbitrary threat environments. There is no infrastructure support and sensor nodes communicate with each other only when they are in transmission range. The nodes are severely resource-constrained, with limited processing, memory and power capacities and must operate cooperatively to fulfill a common mission in typically unattended modes. In a wireless sensor network (WSN), each sensor at a node can observe locally some underlying physical phenomenon and sends a quantized version of the observation to sink (destination) nodes via wireless links. Since the wireless medium can be easily eavesdropped, links can be compromised by intrusion attacks from nodes that may mount denial-of-service attacks or insert spurious information into routing packets, leading to routing loops, long timeouts, impersonation, and node exhaustion. A cross-layer design based on protocol-layer interactions is proposed for detection and identification of various intrusion attacks on WSN operation. A feature set is formed from selected cross-layer parameters of the WSN protocol to detect and identify security threats due to intrusion attacks. A separate protocol is not constructed from the cross-layer design; instead, security attributes and quantified trust levels at and among nodes established during data exchanges complement customary WSN metrics of energy usage, reliability, route availability, and end-to-end quality-of-service (QoS) provisioning. Statistical pattern recognition algorithms are applied that use observed feature-set patterns observed during network operations, viewed as security audit logs. These algorithms provide the "best" network global performance in the presence of various intrusion attacks. A set of mobile (software) agents distributed at the nodes implement the algorithms, by moving among the layers involved in the network response at each active node and trust neighborhood, collecting parametric information and executing assigned decision tasks. The communications overhead due to security mechanisms and the latency in network response are thus minimized by reducing the need to move large amounts of audit data through resource-limited nodes and by locating detection/identification programs closer to audit data. If network partitioning occurs due to uncoordinated node exhaustion, data compromise or other effects of the attacks, the mobile agents can continue to operate, thereby increasing fault tolerance in the network response to intrusions. Since the mobile agents behave like an ant colony in securing the WSN, published ant colony optimization (ACO) routines and other evolutionary algorithms are adapted to protect network security, using data at and through nodes to create audit records to detect and respond to denial-of-service attacks. Performance evaluations of algorithms are performed by simulation of a few intrusion attacks, such as black hole, flooding, Sybil and others, to validate the ability of the cross-layer algorithms to enable WSNs to survive the attacks. Results are compared for the different algorithms.
Wen, Tzai-Hung; Jiang, Joe-Air; Sun, Chih-Hong; Juang, Jehn-Yih; Lin, Tzu-Shiang
2013-01-01
Air pollution has become a severe environmental problem due to urbanization and heavy traffic. Monitoring street-level air quality is an important issue, but most official monitoring stations are installed to monitor large-scale air quality conditions, and their limited spatial resolution cannot reflect the detailed variations in air quality that may be induced by traffic jams. By deploying wireless sensors on crossroads and main roads, this study established a pilot framework for a wireless sensor network (WSN)-based real-time monitoring system to understand street-level spatial-temporal changes of carbon monoxide (CO) in urban settings. The system consists of two major components. The first component is the deployment of wireless sensors. We deployed 44 sensor nodes, 40 transmitter nodes and four gateway nodes in this study. Each sensor node includes a signal processing module, a CO sensor and a wireless communication module. In order to capture realistic human exposure to traffic pollutants, all sensors were deployed at a height of 1.5 m on lampposts and traffic signs. The study area covers a total length of 1.5 km of Keelung Road in Taipei City. The other component is a map-based monitoring platform for sensor data visualization and manipulation in time and space. Using intensive real-time street-level monitoring framework, we compared the spatial-temporal patterns of air pollution in different time periods. Our results capture four CO concentration peaks throughout the day at the location, which was located along an arterial and nearby traffic sign. The hourly average could reach 5.3 ppm from 5:00 pm to 7:00 pm due to the traffic congestion. The proposed WSN-based framework captures detailed ground information and potential risk of human exposure to traffic-related air pollution. It also provides street-level insights into real-time monitoring for further early warning of air pollution and urban environmental management. PMID:24287859
Wen, Tzai-Hung; Jiang, Joe-Air; Sun, Chih-Hong; Juang, Jehn-Yih; Lin, Tzu-Shiang
2013-11-27
Air pollution has become a severe environmental problem due to urbanization and heavy traffic. Monitoring street-level air quality is an important issue, but most official monitoring stations are installed to monitor large-scale air quality conditions, and their limited spatial resolution cannot reflect the detailed variations in air quality that may be induced by traffic jams. By deploying wireless sensors on crossroads and main roads, this study established a pilot framework for a wireless sensor network (WSN)-based real-time monitoring system to understand street-level spatial-temporal changes of carbon monoxide (CO) in urban settings. The system consists of two major components. The first component is the deployment of wireless sensors. We deployed 44 sensor nodes, 40 transmitter nodes and four gateway nodes in this study. Each sensor node includes a signal processing module, a CO sensor and a wireless communication module. In order to capture realistic human exposure to traffic pollutants, all sensors were deployed at a height of 1.5 m on lampposts and traffic signs. The study area covers a total length of 1.5 km of Keelung Road in Taipei City. The other component is a map-based monitoring platform for sensor data visualization and manipulation in time and space. Using intensive real-time street-level monitoring framework, we compared the spatial-temporal patterns of air pollution in different time periods. Our results capture four CO concentration peaks throughout the day at the location, which was located along an arterial and nearby traffic sign. The hourly average could reach 5.3 ppm from 5:00 pm to 7:00 pm due to the traffic congestion. The proposed WSN-based framework captures detailed ground information and potential risk of human exposure to traffic-related air pollution. It also provides street-level insights into real-time monitoring for further early warning of air pollution and urban environmental management.
A Wireless MEMS-Based Inclinometer Sensor Node for Structural Health Monitoring
Ha, Dae Woong; Park, Hyo Seon; Choi, Se Woon; Kim, Yousok
2013-01-01
This paper proposes a wireless inclinometer sensor node for structural health monitoring (SHM) that can be applied to civil engineering and building structures subjected to various loadings. The inclinometer used in this study employs a method for calculating the tilt based on the difference between the static acceleration and the acceleration due to gravity, using a micro-electro-mechanical system (MEMS)-based accelerometer. A wireless sensor node was developed through which tilt measurement data are wirelessly transmitted to a monitoring server. This node consists of a slave node that uses a short-distance wireless communication system (RF 2.4 GHz) and a master node that uses a long-distance telecommunication system (code division multiple access—CDMA). The communication distance limitation, which is recognized as an important issue in wireless monitoring systems, has been resolved via these two wireless communication components. The reliability of the proposed wireless inclinometer sensor node was verified experimentally by comparing the values measured by the inclinometer and subsequently transferred to the monitoring server via wired and wireless transfer methods to permit a performance evaluation of the wireless communication sensor nodes. The experimental results indicated that the two systems (wired and wireless transfer systems) yielded almost identical values at a tilt angle greater than 1°, and a uniform difference was observed at a tilt angle less than 0.42° (approximately 0.0032° corresponding to 0.76% of the tilt angle, 0.42°) regardless of the tilt size. This result was deemed to be within the allowable range of measurement error in SHM. Thus, the wireless transfer system proposed in this study was experimentally verified for practical application in a structural health monitoring system. PMID:24287533
Distributed Peer-to-Peer Target Tracking in Wireless Sensor Networks
Wang, Xue; Wang, Sheng; Bi, Dao-Wei; Ma, Jun-Jie
2007-01-01
Target tracking is usually a challenging application for wireless sensor networks (WSNs) because it is always computation-intensive and requires real-time processing. This paper proposes a practical target tracking system based on the auto regressive moving average (ARMA) model in a distributed peer-to-peer (P2P) signal processing framework. In the proposed framework, wireless sensor nodes act as peers that perform target detection, feature extraction, classification and tracking, whereas target localization requires the collaboration between wireless sensor nodes for improving the accuracy and robustness. For carrying out target tracking under the constraints imposed by the limited capabilities of the wireless sensor nodes, some practically feasible algorithms, such as the ARMA model and the 2-D integer lifting wavelet transform, are adopted in single wireless sensor nodes due to their outstanding performance and light computational burden. Furthermore, a progressive multi-view localization algorithm is proposed in distributed P2P signal processing framework considering the tradeoff between the accuracy and energy consumption. Finally, a real world target tracking experiment is illustrated. Results from experimental implementations have demonstrated that the proposed target tracking system based on a distributed P2P signal processing framework can make efficient use of scarce energy and communication resources and achieve target tracking successfully.
NASA Astrophysics Data System (ADS)
Liu, Peipei; Yang, Suyoung; Lim, Hyung Jin; Park, Hyung Chul; Ko, In Chang; Sohn, Hoon
2014-03-01
Fatigue crack is one of the main culprits for the failure of metallic structures. Recently, it has been shown that nonlinear wave modulation spectroscopy (NWMS) is effective in detecting nonlinear mechanisms produced by fatigue crack. In this study, an active wireless sensor node for fatigue crack detection is developed based on NWMS. Using PZT transducers attached to a target structure, ultrasonic waves at two distinctive frequencies are generated, and their modulation due to fatigue crack formation is detected using another PZT transducer. Furthermore, a reference-free NWMS algorithm is developed so that fatigue crack can be detected without relying on history data of the structure with minimal parameter adjustment by the end users. The algorithm is embedded into FPGA, and the diagnosis is transmitted to a base station using a commercial wireless communication system. The whole design of the sensor node is fulfilled in a low power working strategy. Finally, an experimental verification has been performed using aluminum plate specimens to show the feasibility of the developed active wireless NWMS sensor node.
Adaptive Connectivity Restoration from Node Failure(s) in Wireless Sensor Networks
Wang, Huaiyuan; Ding, Xu; Huang, Cheng; Wu, Xiaobei
2016-01-01
Recently, there is a growing interest in the applications of wireless sensor networks (WSNs). A set of sensor nodes is deployed in order to collectively survey an area of interest and/or perform specific surveillance tasks in some of the applications, such as battlefield reconnaissance. Due to the harsh deployment environments and limited energy supply, nodes may fail, which impacts the connectivity of the whole network. Since a single node failure (cut-vertex) will destroy the connectivity and divide the network into disjoint blocks, most of the existing studies focus on the problem of single node failure. However, the failure of multiple nodes would be a disaster to the whole network and must be repaired effectively. Only few studies are proposed to handle the problem of multiple cut-vertex failures, which is a special case of multiple node failures. Therefore, this paper proposes a comprehensive solution to address the problems of node failure (single and multiple). Collaborative Single Node Failure Restoration algorithm (CSFR) is presented to solve the problem of single node failure only with cooperative communication, but CSFR-M, which is the extension of CSFR, handles the single node failure problem more effectively with node motion. Moreover, Collaborative Connectivity Restoration Algorithm (CCRA) is proposed on the basis of cooperative communication and node maneuverability to restore network connectivity after multiple nodes fail. CSFR-M and CCRA are reactive methods that initiate the connectivity restoration after detecting the node failure(s). In order to further minimize the energy dissipation, CCRA opts to simplify the recovery process by gridding. Moreover, the distance that an individual node needs to travel during recovery is reduced by choosing the nearest suitable candidates. Finally, extensive simulations validate the performance of CSFR, CSFR-M and CCRA. PMID:27690030
Ding, Chao; Yang, Lijun; Wu, Meng
2017-01-01
Due to the unattended nature and poor security guarantee of the wireless sensor networks (WSNs), adversaries can easily make replicas of compromised nodes, and place them throughout the network to launch various types of attacks. Such an attack is dangerous because it enables the adversaries to control large numbers of nodes and extend the damage of attacks to most of the network with quite limited cost. To stop the node replica attack, we propose a location similarity-based detection scheme using deployment knowledge. Compared with prior solutions, our scheme provides extra functionalities that prevent replicas from generating false location claims without deploying resource-consuming localization techniques on the resource-constraint sensor nodes. We evaluate the security performance of our proposal under different attack strategies through heuristic analysis, and show that our scheme achieves secure and robust replica detection by increasing the cost of node replication. Additionally, we evaluate the impact of network environment on the proposed scheme through theoretic analysis and simulation experiments, and indicate that our scheme achieves effectiveness and efficiency with substantially lower communication, computational, and storage overhead than prior works under different situations and attack strategies. PMID:28098846
Ding, Chao; Yang, Lijun; Wu, Meng
2017-01-15
Due to the unattended nature and poor security guarantee of the wireless sensor networks (WSNs), adversaries can easily make replicas of compromised nodes, and place them throughout the network to launch various types of attacks. Such an attack is dangerous because it enables the adversaries to control large numbers of nodes and extend the damage of attacks to most of the network with quite limited cost. To stop the node replica attack, we propose a location similarity-based detection scheme using deployment knowledge. Compared with prior solutions, our scheme provides extra functionalities that prevent replicas from generating false location claims without deploying resource-consuming localization techniques on the resource-constraint sensor nodes. We evaluate the security performance of our proposal under different attack strategies through heuristic analysis, and show that our scheme achieves secure and robust replica detection by increasing the cost of node replication. Additionally, we evaluate the impact of network environment on the proposed scheme through theoretic analysis and simulation experiments, and indicate that our scheme achieves effectiveness and efficiency with substantially lower communication, computational, and storage overhead than prior works under different situations and attack strategies.
A New Approach to Design Autonomous Wireless Sensor Node Based on RF Energy Harvesting System
Hakem, Nadir
2018-01-01
Energy Harvesting techniques are increasingly seen as the solution for freeing the wireless sensor nodes from their battery dependency. However, it remains evident that network performance features, such as network size, packet length, and duty cycle, are influenced by the sum of recovered energy. This paper proposes a new approach to defining the specifications of a stand-alone wireless node based on a Radio-frequency Energy Harvesting System (REHS). To achieve adequate performance regarding the range of the Wireless Sensor Network (WSN), techniques for minimizing the energy consumed by the sensor node are combined with methods for optimizing the performance of the REHS. For more rigor in the design of the autonomous node, a comprehensive energy model of the node in a wireless network is established. For an equitable distribution of network charges between the different nodes that compose it, the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is used for this purpose. The model considers five energy-consumption sources, most of which are ignored in recently used models. By using the hardware parameters of commercial off-the-shelf components (Mica2 Motes and CC2520 of Texas Instruments), the energy requirement of a sensor node is quantified. A miniature REHS based on a judicious choice of rectifying diodes is then designed and developed to achieve optimal performance in the Industrial Scientific and Medical (ISM) band centralized at 2.45 GHz. Due to the mismatch between the REHS and the antenna, a band pass filter is designed to reduce reflection losses. A gradient method search is used to optimize the output characteristics of the adapted REHS. At 1 mW of input RF power, the REHS provides an output DC power of 0.57 mW and a comparison with the energy requirement of the node allows the Base Station (BS) to be located at 310 m from the wireless nodes when the Wireless Sensor Network (WSN) has 100 nodes evenly spread over an area of 300 × 300 m2 and when each round lasts 10 min. The result shows that the range of the autonomous WSN increases when the controlled physical phenomenon varies very slowly. Having taken into account all the dissipation sources coexisting in a sensor node and using actual measurements of an REHS, this work provides the guidelines for the design of autonomous nodes based on REHS. PMID:29304002
Reputation-Based Secure Sensor Localization in Wireless Sensor Networks
He, Jingsha; Xu, Jing; Zhu, Xingye; Zhang, Yuqiang; Zhang, Ting; Fu, Wanqing
2014-01-01
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. PMID:24982940
Classification between Failed Nodes and Left Nodes in Mobile Asset Tracking Systems †
Kim, Kwangsoo; Jin, Jae-Yeon; Jin, Seong-il
2016-01-01
Medical asset tracking systems track a medical device with a mobile node and determine its status as either in or out, because it can leave a monitoring area. Due to a failed node, this system may decide that a mobile asset is outside the area, even though it is within the area. In this paper, an efficient classification method is proposed to separate mobile nodes disconnected from a wireless sensor network between nodes with faults and a node that actually has left the monitoring region. The proposed scheme uses two trends extracted from the neighboring nodes of a disconnected mobile node. First is the trend in a series of the neighbor counts; the second is that of the ratios of the boundary nodes included in the neighbors. Based on such trends, the proposed method separates failed nodes from mobile nodes that are disconnected from a wireless sensor network without failures. The proposed method is evaluated using both real data generated from a medical asset tracking system and also using simulations with the network simulator (ns-2). The experimental results show that the proposed method correctly differentiates between failed nodes and nodes that are no longer in the monitoring region, including the cases that the conventional methods fail to detect. PMID:26901200
Towards the development of tamper-resistant, ground-based mobile sensor nodes
NASA Astrophysics Data System (ADS)
Mascarenas, David; Stull, Christopher; Farrar, Charles
2011-11-01
Mobile sensor nodes hold great potential for collecting field data using fewer resources than human operators would require and potentially requiring fewer sensors than a fixed-position sensor array. It would be very beneficial to allow these mobile sensor nodes to operate unattended with a minimum of human intervention. In order to allow mobile sensor nodes to operate unattended in a field environment, it is imperative that they be capable of identifying and responding to external agents that may attempt to tamper with, damage or steal the mobile sensor nodes, while still performing their data collection mission. Potentially hostile external agents could include animals, other mobile sensor nodes, or humans. This work will focus on developing control policies to help enable a mobile sensor node to identify and avoid capture by a hostile un-mounted human. The work is developed in a simulation environment, and demonstrated using a non-holonomic, ground-based mobile sensor node. This work will be a preliminary step toward ensuring the cyber-physical security of ground-based mobile sensor nodes that operate unattended in potentially unfriendly environments.
Distributed adaptive diagnosis of sensor faults using structural response data
NASA Astrophysics Data System (ADS)
Dragos, Kosmas; Smarsly, Kay
2016-10-01
The reliability and consistency of wireless structural health monitoring (SHM) systems can be compromised by sensor faults, leading to miscalibrations, corrupted data, or even data loss. Several research approaches towards fault diagnosis, referred to as ‘analytical redundancy’, have been proposed that analyze the correlations between different sensor outputs. In wireless SHM, most analytical redundancy approaches require centralized data storage on a server for data analysis, while other approaches exploit the on-board computing capabilities of wireless sensor nodes, analyzing the raw sensor data directly on board. However, using raw sensor data poses an operational constraint due to the limited power resources of wireless sensor nodes. In this paper, a new distributed autonomous approach towards sensor fault diagnosis based on processed structural response data is presented. The inherent correlations among Fourier amplitudes of acceleration response data, at peaks corresponding to the eigenfrequencies of the structure, are used for diagnosis of abnormal sensor outputs at a given structural condition. Representing an entirely data-driven analytical redundancy approach that does not require any a priori knowledge of the monitored structure or of the SHM system, artificial neural networks (ANN) are embedded into the sensor nodes enabling cooperative fault diagnosis in a fully decentralized manner. The distributed analytical redundancy approach is implemented into a wireless SHM system and validated in laboratory experiments, demonstrating the ability of wireless sensor nodes to self-diagnose sensor faults accurately and efficiently with minimal data traffic. Besides enabling distributed autonomous fault diagnosis, the embedded ANNs are able to adapt to the actual condition of the structure, thus ensuring accurate and efficient fault diagnosis even in case of structural changes.
Secure data aggregation in wireless sensor networks using homomorphic encryption
NASA Astrophysics Data System (ADS)
Kumar, Manish; Verma, Shekhar; Lata, Kusum
2015-04-01
In a Wireless Sensor Network (WSN), aggregation exploits the correlation between spatially and temporally proximate sensor data to reduce the total data volume to be transmitted to the sink. Mobile agents (MAs) fit into this paradigm, and data can be aggregated and collected by an MA from different sensor nodes using context specific codes. The MA-based data collection suffers due to large size of a typical WSN and is prone to security problems. In this article, homomorphic encryption in a clustered WSN has been proposed for secure and efficient data collection using MAs. The nodes keep encrypted data that are given to an MA for data aggregation tasks. The MA performs all the data aggregation operations upon encrypted data as it migrates between nodes in a tree-like structure in which the nodes are leafs and the cluster head is the root of the tree. It returns and deposits the encrypted aggregated data to the cluster head after traversing through all the intra cluster nodes over a shortest path route. The homomorphic encryption and aggregation processing in encrypted domain makes the data collection process secure. Simulation results confirm the effectiveness of the proposed secure data aggregation mechanism. In addition to security, MA-based mechanism leads to lesser delay and bandwidth requirements.
Jeon, Hyeonjae; Park, Kwangjin; Hwang, Dae-Joon; Choo, Hyunseung
2009-01-01
Sensor nodes transmit the sensed information to the sink through wireless sensor networks (WSNs). They have limited power, computational capacities and memory. Portable wireless devices are increasing in popularity. Mechanisms that allow information to be efficiently obtained through mobile WSNs are of significant interest. However, a mobile sink introduces many challenges to data dissemination in large WSNs. For example, it is important to efficiently identify the locations of mobile sinks and disseminate information from multi-source nodes to the multi-mobile sinks. In particular, a stationary dissemination path may no longer be effective in mobile sink applications, due to sink mobility. In this paper, we propose a Sink-oriented Dynamic Location Service (SDLS) approach to handle sink mobility. In SDLS, we propose an Eight-Direction Anchor (EDA) system that acts as a location service server. EDA prevents intensive energy consumption at the border sensor nodes and thus provides energy balancing to all the sensor nodes. Then we propose a Location-based Shortest Relay (LSR) that efficiently forwards (or relays) data from a source node to a sink with minimal delay path. Our results demonstrate that SDLS not only provides an efficient and scalable location service, but also reduces the average data communication overhead in scenarios with multiple and moving sinks and sources.
Cousins, A.; Balalis, G. L.; Thompson, S. K.; Forero Morales, D.; Mohtar, A.; Wedding, A. B.; Thierry, B.
2015-01-01
Using magnetic tunnelling junction sensors, a novel magnetometer probe for the identification of the sentinel lymph node using magnetic tracers was developed. Probe performance was characterised in vitro and validated in a preclinical swine model. Compared to conventional gamma probes, the magnetometer probe showed excellent spatial resolution of 4.0 mm, and the potential to detect as few as 5 μg of magnetic tracer. Due to the high sensitivity of the magnetometer, all first-tier nodes were identified in the preclinical experiments, and there were no instances of false positive or false negative detection. Furthermore, these preliminary data encourage the application of the magnetometer probe for use in more complex lymphatic environments, such as in gastrointestinal cancers, where the sentinel node is often in close proximity to other non-sentinel nodes, and high spatial resolution detection is required. PMID:26038833
Secure Sensor Semantic Web and Information Fusion
2014-06-25
data acquired and transmitted by wireless sensor networks (WSNs). In a WSN, due to a need for robustness of monitoring and low cost of the nodes...3 S. Ozdemir and Y. Xiao, “Secure data aggregation in wireless sensor networks : A comprehensive overview...Elisa Bertino, and Somesh Jha: Secure data aggregation technique for wireless sensor networks in the presence of collusion attacks. To appear in
ERIC Educational Resources Information Center
McNeal, McKenzie, III.
2012-01-01
Current networking architectures and communication protocols used for Wireless Sensor Networks (WSNs) have been designed to be energy efficient, low latency, and long network lifetime. One major issue that must be addressed is the security in data communication. Due to the limited capabilities of low cost and small sized sensor nodes, designing…
Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks
Mahjoub, Reem K.; Elleithy, Khaled
2017-01-01
The actor nodes are the spine of wireless sensor and actor networks (WSANs) that collaborate to perform a specific task in an unverified and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power consumption of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. Therefore, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). In this paper, we propose an Efficient Actor Recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of a Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balancing the network performance. The packets are handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets; either from actor or sensor. This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for a longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, the proposed algorithms were tested using OMNET++ simulation. PMID:28420102
Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks.
Mahjoub, Reem K; Elleithy, Khaled
2017-04-14
The actor nodes are the spine of wireless sensor and actor networks (WSANs) that collaborate to perform a specific task in an unverified and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power consumption of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. Therefore, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). In this paper, we propose an Efficient Actor Recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of a Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balancing the network performance. The packets are handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets; either from actor or sensor. This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for a longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, the proposed algorithms were tested using OMNET++ simulation.
Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue
2018-01-01
One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C/2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C/2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi’s model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments. PMID:29401668
Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue
2018-02-03
One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C /2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C /2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi's model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments.
Energy efficient mechanisms for high-performance Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Alsaify, Baha'adnan
2009-12-01
Due to recent advances in microelectronics, the development of low cost, small, and energy efficient devices became possible. Those advances led to the birth of the Wireless Sensor Networks (WSNs). WSNs consist of a large set of sensor nodes equipped with communication capabilities, scattered in the area to monitor. Researchers focus on several aspects of WSNs. Such aspects include the quality of service the WSNs provide (data delivery delay, accuracy of data, etc...), the scalability of the network to contain thousands of sensor nodes (the terms node and sensor node are being used interchangeably), the robustness of the network (allowing the network to work even if a certain percentage of nodes fails), and making the energy consumption in the network as low as possible to prolong the network's lifetime. In this thesis, we present an approach that can be applied to the sensing devices that are scattered in an area for Sensor Networks. This work will use the well-known approach of using a awaking scheduling to extend the network's lifespan. We designed a scheduling algorithm that will reduce the delay's upper bound the reported data will experience, while at the same time keeps the advantages that are offered by the use of the awaking scheduling -- the energy consumption reduction which will lead to the increase in the network's lifetime. The wakeup scheduling is based on the location of the node relative to its neighbors and its distance from the Base Station (the terms Base Station and sink are being used interchangeably). We apply the proposed method to a set of simulated nodes using the "ONE Simulator". We test the performance of this approach with three other approaches -- Direct Routing technique, the well known LEACH algorithm, and a multi-parent scheduling algorithm. We demonstrate a good improvement on the network's quality of service and a reduction of the consumed energy.
Multi-Layer Approach for the Detection of Selective Forwarding Attacks
Alajmi, Naser; Elleithy, Khaled
2015-01-01
Security breaches are a major threat in wireless sensor networks (WSNs). WSNs are increasingly used due to their broad range of important applications in both military and civilian domains. WSNs are prone to several types of security attacks. Sensor nodes have limited capacities and are often deployed in dangerous locations; therefore, they are vulnerable to different types of attacks, including wormhole, sinkhole, and selective forwarding attacks. Security attacks are classified as data traffic and routing attacks. These security attacks could affect the most significant applications of WSNs, namely, military surveillance, traffic monitoring, and healthcare. Therefore, there are different approaches to detecting security attacks on the network layer in WSNs. Reliability, energy efficiency, and scalability are strong constraints on sensor nodes that affect the security of WSNs. Because sensor nodes have limited capabilities in most of these areas, selective forwarding attacks cannot be easily detected in networks. In this paper, we propose an approach to selective forwarding detection (SFD). The approach has three layers: MAC pool IDs, rule-based processing, and anomaly detection. It maintains the safety of data transmission between a source node and base station while detecting selective forwarding attacks. Furthermore, the approach is reliable, energy efficient, and scalable. PMID:26610499
Multi-Layer Approach for the Detection of Selective Forwarding Attacks.
Alajmi, Naser; Elleithy, Khaled
2015-11-19
Security breaches are a major threat in wireless sensor networks (WSNs). WSNs are increasingly used due to their broad range of important applications in both military and civilian domains. WSNs are prone to several types of security attacks. Sensor nodes have limited capacities and are often deployed in dangerous locations; therefore, they are vulnerable to different types of attacks, including wormhole, sinkhole, and selective forwarding attacks. Security attacks are classified as data traffic and routing attacks. These security attacks could affect the most significant applications of WSNs, namely, military surveillance, traffic monitoring, and healthcare. Therefore, there are different approaches to detecting security attacks on the network layer in WSNs. Reliability, energy efficiency, and scalability are strong constraints on sensor nodes that affect the security of WSNs. Because sensor nodes have limited capabilities in most of these areas, selective forwarding attacks cannot be easily detected in networks. In this paper, we propose an approach to selective forwarding detection (SFD). The approach has three layers: MAC pool IDs, rule-based processing, and anomaly detection. It maintains the safety of data transmission between a source node and base station while detecting selective forwarding attacks. Furthermore, the approach is reliable, energy efficient, and scalable.
Khan, Muhammad Khurram; Alghathbar, Khaled
2010-01-01
User authentication in wireless sensor networks (WSN) is a critical security issue due to their unattended and hostile deployment in the field. Since sensor nodes are equipped with limited computing power, storage, and communication modules; authenticating remote users in such resource-constrained environments is a paramount security concern. Recently, M.L. Das proposed a two-factor user authentication scheme in WSNs and claimed that his scheme is secure against different kinds of attack. However, in this paper, we show that the M.L. Das-scheme has some critical security pitfalls and cannot be recommended for real applications. We point out that in his scheme: users cannot change/update their passwords, it does not provide mutual authentication between gateway node and sensor node, and is vulnerable to gateway node bypassing attack and privileged-insider attack. To overcome the inherent security weaknesses of the M.L. Das-scheme, we propose improvements and security patches that attempt to fix the susceptibilities of his scheme. The proposed security improvements can be incorporated in the M.L. Das-scheme for achieving a more secure and robust two-factor user authentication in WSNs.
Davis, Jesse Harper Zehring [Berkeley, CA; Stark, Jr., Douglas Paul; Kershaw, Christopher Patrick [Hayward, CA; Kyker, Ronald Dean [Livermore, CA
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.
Compression in wearable sensor nodes: impacts of node topology.
Imtiaz, Syed Anas; Casson, Alexander J; Rodriguez-Villegas, Esther
2014-04-01
Wearable sensor nodes monitoring the human body must operate autonomously for very long periods of time. Online and low-power data compression embedded within the sensor node is therefore essential to minimize data storage/transmission overheads. This paper presents a low-power MSP430 compressive sensing implementation for providing such compression, focusing particularly on the impact of the sensor node architecture on the compression performance. Compression power performance is compared for four different sensor nodes incorporating different strategies for wireless transmission/on-sensor-node local storage of data. The results demonstrate that the compressive sensing used must be designed differently depending on the underlying node topology, and that the compression strategy should not be guided only by signal processing considerations. We also provide a practical overview of state-of-the-art sensor node topologies. Wireless transmission of data is often preferred as it offers increased flexibility during use, but in general at the cost of increased power consumption. We demonstrate that wireless sensor nodes can highly benefit from the use of compressive sensing and now can achieve power consumptions comparable to, or better than, the use of local memory.
Lifetime Maximization via Hole Alleviation in IoT Enabling Heterogeneous Wireless Sensor Networks.
Wadud, Zahid; Javaid, Nadeem; Khan, Muhammad Awais; Alrajeh, Nabil; Alabed, Mohamad Souheil; Guizani, Nadra
2017-07-21
In Internet of Things (IoT) enabled Wireless Sensor Networks (WSNs), there are two major factors which degrade the performance of the network. One is the void hole which occurs in a particular region due to unavailability of forwarder nodes. The other is the presence of energy hole which occurs due to imbalanced data traffic load on intermediate nodes. Therefore, an optimum transmission strategy is required to maximize the network lifespan via hole alleviation. In this regard, we propose a heterogeneous network solution that is capable to balance energy dissipation among network nodes. In addition, the divide and conquer approach is exploited to evenly distribute number of transmissions over various network areas. An efficient forwarder node selection is performed to alleviate coverage and energy holes. Linear optimization is performed to validate the effectiveness of our proposed work in term of energy minimization. Furthermore, simulations are conducted to show that our claims are well grounded. Results show the superiority of our work as compared to the baseline scheme in terms of energy consumption and network lifetime.
Lifetime Maximization via Hole Alleviation in IoT Enabling Heterogeneous Wireless Sensor Networks
Wadud, Zahid; Khan, Muhammad Awais; Alrajeh, Nabil; Alabed, Mohamad Souheil; Guizani, Nadra
2017-01-01
In Internet of Things (IoT) enabled Wireless Sensor Networks (WSNs), there are two major factors which degrade the performance of the network. One is the void hole which occurs in a particular region due to unavailability of forwarder nodes. The other is the presence of energy hole which occurs due to imbalanced data traffic load on intermediate nodes. Therefore, an optimum transmission strategy is required to maximize the network lifespan via hole alleviation. In this regard, we propose a heterogeneous network solution that is capable to balance energy dissipation among network nodes. In addition, the divide and conquer approach is exploited to evenly distribute number of transmissions over various network areas. An efficient forwarder node selection is performed to alleviate coverage and energy holes. Linear optimization is performed to validate the effectiveness of our proposed work in term of energy minimization. Furthermore, simulations are conducted to show that our claims are well grounded. Results show the superiority of our work as compared to the baseline scheme in terms of energy consumption and network lifetime. PMID:28753990
Muhammed, Dalhatu; Anisi, Mohammad Hossein; Vargas-Rosales, Cesar; Khan, Anwar
2018-01-01
Exploring and monitoring the underwater world using underwater sensors is drawing a lot of attention these days. In this field cooperation between acoustic sensor nodes has been a critical problem due to the challenging features such as acoustic channel failure (sound signal), long propagation delay of acoustic signal, limited bandwidth and loss of connectivity. There are several proposed methods to improve cooperation between the nodes by incorporating information/game theory in the node’s cooperation. However, there is a need to classify the existing works and demonstrate their performance in addressing the cooperation issue. In this paper, we have conducted a review to investigate various factors affecting cooperation in underwater acoustic sensor networks. We study various cooperation techniques used for underwater acoustic sensor networks from different perspectives, with a concentration on communication reliability, energy consumption, and security and present a taxonomy for underwater cooperation. Moreover, we further review how the game theory can be applied to make the nodes cooperate with each other. We further analyze different cooperative game methods, where their performance on different metrics is compared. Finally, open issues and future research direction in underwater acoustic sensor networks are highlighted. PMID:29389874
Development of a Wireless Network of Temperature Sensors for Yellowstone National Park (USA)
NASA Astrophysics Data System (ADS)
Munday, D. A.; Hutter, T.; Minolli, M.; Obraczka, K.; Manduchi, R.; Petersen, S.; Lowenstern, J. B.; Heasler, H.
2007-12-01
Temperature sensors deployed at Yellowstone clearly document that thermal features can vary in temperature on a variety of timescales and show regional correlations unrelated to meteorological variables such as air temperature. Yellowstone National Park (YNP) staff currently measures temperatures at over 40 thermal features and streams within the park, utilizing USGS stream gaging stations and portable data loggers deployed in geyser basins. The latter measure temperature every 1 to 15 minutes, and the data are physically downloaded after about 30 days. Installation of a wireless sensor network would: 1) save considerable time and effort in data retrieval, 2) minimize lost data due to equipment failure, and 3) provide a means to monitor thermal perturbations in near-real time. To meet this need, we developed a wireless sensor network capable of in-situ monitoring of air and water temperature. Temperature sensors are dispersed as nodes that communicate among themselves and through relays to a single base-station linked to the Internet. The small, weatherproof sensors operate unattended for over six months at temperatures as low as -40°C. Each uses an ultra-low-power Texas Instruments' MSP430 microcontroller and an SD card as mass storage. They are powered by 15Ah, 3.6 v, inert Li-ion batteries and transmit data via 900MHz radio modules with a 1-km range. The initial prototype consists of 4 nodes, and is designed to scale with additional nodes for finer spatial resolution and broader coverage. Temperature measurements are asynchronous from node to node, with intervals as frequent as 30 seconds. Data are stored internally to withstand temporary communication failures; underlying intelligent software is capable of re-routing data through alternative nodes to the base station and a MySQL data archiving system. We also developed a Google-Maps-based, front-end that displays the data, recent trends and sensor locations. The system was tested in the Santa Cruz Mountains and will be used at Yellowstone National Park during Fall 2007.
Bio-Inspired Stretchable Absolute Pressure Sensor Network
Guo, Yue; Li, Yu-Hung; Guo, Zhiqiang; Kim, Kyunglok; Chang, Fu-Kuo; Wang, Shan X.
2016-01-01
A bio-inspired absolute pressure sensor network has been developed. Absolute pressure sensors, distributed on multiple silicon islands, are connected as a network by stretchable polyimide wires. This sensor network, made on a 4’’ wafer, has 77 nodes and can be mounted on various curved surfaces to cover an area up to 0.64 m × 0.64 m, which is 100 times larger than its original size. Due to Micro Electro-Mechanical system (MEMS) surface micromachining technology, ultrathin sensing nodes can be realized with thicknesses of less than 100 µm. Additionally, good linearity and high sensitivity (~14 mV/V/bar) have been achieved. Since the MEMS sensor process has also been well integrated with a flexible polymer substrate process, the entire sensor network can be fabricated in a time-efficient and cost-effective manner. Moreover, an accurate pressure contour can be obtained from the sensor network. Therefore, this absolute pressure sensor network holds significant promise for smart vehicle applications, especially for unmanned aerial vehicles. PMID:26729134
Analytical network process based optimum cluster head selection in wireless sensor network.
Farman, Haleem; Javed, Huma; Jan, Bilal; Ahmad, Jamil; Ali, Shaukat; Khalil, Falak Naz; Khan, Murad
2017-01-01
Wireless Sensor Networks (WSNs) are becoming ubiquitous in everyday life due to their applications in weather forecasting, surveillance, implantable sensors for health monitoring and other plethora of applications. WSN is equipped with hundreds and thousands of small sensor nodes. As the size of a sensor node decreases, critical issues such as limited energy, computation time and limited memory become even more highlighted. In such a case, network lifetime mainly depends on efficient use of available resources. Organizing nearby nodes into clusters make it convenient to efficiently manage each cluster as well as the overall network. In this paper, we extend our previous work of grid-based hybrid network deployment approach, in which merge and split technique has been proposed to construct network topology. Constructing topology through our proposed technique, in this paper we have used analytical network process (ANP) model for cluster head selection in WSN. Five distinct parameters: distance from nodes (DistNode), residual energy level (REL), distance from centroid (DistCent), number of times the node has been selected as cluster head (TCH) and merged node (MN) are considered for CH selection. The problem of CH selection based on these parameters is tackled as a multi criteria decision system, for which ANP method is used for optimum cluster head selection. Main contribution of this work is to check the applicability of ANP model for cluster head selection in WSN. In addition, sensitivity analysis is carried out to check the stability of alternatives (available candidate nodes) and their ranking for different scenarios. The simulation results show that the proposed method outperforms existing energy efficient clustering protocols in terms of optimum CH selection and minimizing CH reselection process that results in extending overall network lifetime. This paper analyzes that ANP method used for CH selection with better understanding of the dependencies of different components involved in the evaluation process.
Analytical network process based optimum cluster head selection in wireless sensor network
Javed, Huma; Jan, Bilal; Ahmad, Jamil; Ali, Shaukat; Khalil, Falak Naz; Khan, Murad
2017-01-01
Wireless Sensor Networks (WSNs) are becoming ubiquitous in everyday life due to their applications in weather forecasting, surveillance, implantable sensors for health monitoring and other plethora of applications. WSN is equipped with hundreds and thousands of small sensor nodes. As the size of a sensor node decreases, critical issues such as limited energy, computation time and limited memory become even more highlighted. In such a case, network lifetime mainly depends on efficient use of available resources. Organizing nearby nodes into clusters make it convenient to efficiently manage each cluster as well as the overall network. In this paper, we extend our previous work of grid-based hybrid network deployment approach, in which merge and split technique has been proposed to construct network topology. Constructing topology through our proposed technique, in this paper we have used analytical network process (ANP) model for cluster head selection in WSN. Five distinct parameters: distance from nodes (DistNode), residual energy level (REL), distance from centroid (DistCent), number of times the node has been selected as cluster head (TCH) and merged node (MN) are considered for CH selection. The problem of CH selection based on these parameters is tackled as a multi criteria decision system, for which ANP method is used for optimum cluster head selection. Main contribution of this work is to check the applicability of ANP model for cluster head selection in WSN. In addition, sensitivity analysis is carried out to check the stability of alternatives (available candidate nodes) and their ranking for different scenarios. The simulation results show that the proposed method outperforms existing energy efficient clustering protocols in terms of optimum CH selection and minimizing CH reselection process that results in extending overall network lifetime. This paper analyzes that ANP method used for CH selection with better understanding of the dependencies of different components involved in the evaluation process. PMID:28719616
Bluetooth-based wireless sensor networks
NASA Astrophysics Data System (ADS)
You, Ke; Liu, Rui Qiang
2007-11-01
In this work a Bluetooth-based wireless sensor network is proposed. In this bluetooth-based wireless sensor networks, information-driven star topology and energy-saved mode are used, through which a blue master node can control more than seven slave node, the energy of each sensor node is reduced and secure management of each sensor node is improved.
Reconfigurable routing protocol for free space optical sensor networks.
Xie, Rong; Yang, Won-Hyuk; Kim, Young-Chon
2012-01-01
Recently, free space optical sensor networks (FSOSNs), which are based on free space optics (FSO) instead of radio frequency (RF), have gained increasing visibility over traditional wireless sensor networks (WSNs) due to their advantages such as larger capacity, higher security, and lower cost. However, the performance of FSOSNs is restricted to the requirement of a direct line-of-sight (LOS) path between a sender and a receiver pair. Once a node dies of energy depletion, the network would probably suffer from a dramatic decrease of connectivity, resulting in a huge loss of data packets. Thus, this paper proposes a reconfigurable routing protocol (RRP) to overcome this problem by dynamically reconfiguring the network virtual topology. The RRP works in three phases: (1) virtual topology construction, (2) routing establishment, and (3) reconfigurable routing. When data transmission begins, the data packets are first routed through the shortest hop paths. Then a reconfiguration is initiated by the node whose residual energy falls below a threshold. Nodes affected by this dying node are classified into two types, namely maintenance nodes and adjustment nodes, and they are reconfigured according to the types. An energy model is designed to evaluate the performance of RRP through OPNET simulation. Our simulation results indicate that the RRP achieves better performance compared with the simple-link protocol and a direct reconfiguration scheme in terms of connectivity, network lifetime, packet delivery ratio and the number of living nodes.
Performance Optimization of Priority Assisted CSMA/CA Mechanism of 802.15.6 under Saturation Regime
Shakir, Mustafa; Rehman, Obaid Ur; Rahim, Mudassir; Alrajeh, Nabil; Khan, Zahoor Ali; Khan, Mahmood Ashraf; Niaz, Iftikhar Azim; Javaid, Nadeem
2016-01-01
Due to the recent development in the field of Wireless Sensor Networks (WSNs), the Wireless Body Area Networks (WBANs) have become a major area of interest for the developers and researchers. Human body exhibits postural mobility due to which distance variation occurs and the status of connections amongst sensors change time to time. One of the major requirements of WBAN is to prolong the network lifetime without compromising on other performance measures, i.e., delay, throughput and bandwidth efficiency. Node prioritization is one of the possible solutions to obtain optimum performance in WBAN. IEEE 802.15.6 CSMA/CA standard splits the nodes with different user priorities based on Contention Window (CW) size. Smaller CW size is assigned to higher priority nodes. This standard helps to reduce delay, however, it is not energy efficient. In this paper, we propose a hybrid node prioritization scheme based on IEEE 802.15.6 CSMA/CA to reduce energy consumption and maximize network lifetime. In this scheme, optimum performance is achieved by node prioritization based on CW size as well as power in respective user priority. Our proposed scheme reduces the average back off time for channel access due to CW based prioritization. Additionally, power based prioritization for a respective user priority helps to minimize required number of retransmissions. Furthermore, we also compare our scheme with IEEE 802.15.6 CSMA/CA standard (CW assisted node prioritization) and power assisted node prioritization under postural mobility in WBAN. Mathematical expressions are derived to determine the accurate analytical model for throughput, delay, bandwidth efficiency, energy consumption and life time for each node prioritization scheme. With the intention of analytical model validation, we have performed the simulations in OMNET++/MIXIM framework. Analytical and simulation results show that our proposed hybrid node prioritization scheme outperforms other node prioritization schemes in terms of average network delay, average throughput, average bandwidth efficiency and network lifetime. PMID:27598167
An Energy-Efficient Approach to Enhance Virtual Sensors Provisioning in Sensor Clouds Environments
Filho, Raimir Holanda; Rabêlo, Ricardo de Andrade L.; de Carvalho, Carlos Giovanni N.; Mendes, Douglas Lopes de S.; Costa, Valney da Gama
2018-01-01
Virtual sensors provisioning is a central issue for sensors cloud middleware since it is responsible for selecting physical nodes, usually from Wireless Sensor Networks (WSN) of different owners, to handle user’s queries or applications. Recent works perform provisioning by clustering sensor nodes based on the correlation measurements and then selecting as few nodes as possible to preserve WSN energy. However, such works consider only homogeneous nodes (same set of sensors). Therefore, those works are not entirely appropriate for sensor clouds, which in most cases comprises heterogeneous sensor nodes. In this paper, we propose ACxSIMv2, an approach to enhance the provisioning task by considering heterogeneous environments. Two main algorithms form ACxSIMv2. The first one, ACASIMv1, creates multi-dimensional clusters of sensor nodes, taking into account the measurements correlations instead of the physical distance between nodes like most works on literature. Then, the second algorithm, ACOSIMv2, based on an Ant Colony Optimization system, selects an optimal set of sensors nodes from to respond user’s queries while attending all parameters and preserving the overall energy consumption. Results from initial experiments show that the approach reduces significantly the sensor cloud energy consumption compared to traditional works, providing a solution to be considered in sensor cloud scenarios. PMID:29495406
An Energy-Efficient Approach to Enhance Virtual Sensors Provisioning in Sensor Clouds Environments.
Lemos, Marcus Vinícius de S; Filho, Raimir Holanda; Rabêlo, Ricardo de Andrade L; de Carvalho, Carlos Giovanni N; Mendes, Douglas Lopes de S; Costa, Valney da Gama
2018-02-26
Virtual sensors provisioning is a central issue for sensors cloud middleware since it is responsible for selecting physical nodes, usually from Wireless Sensor Networks (WSN) of different owners, to handle user's queries or applications. Recent works perform provisioning by clustering sensor nodes based on the correlation measurements and then selecting as few nodes as possible to preserve WSN energy. However, such works consider only homogeneous nodes (same set of sensors). Therefore, those works are not entirely appropriate for sensor clouds, which in most cases comprises heterogeneous sensor nodes. In this paper, we propose ACxSIMv2, an approach to enhance the provisioning task by considering heterogeneous environments. Two main algorithms form ACxSIMv2. The first one, ACASIMv1, creates multi-dimensional clusters of sensor nodes, taking into account the measurements correlations instead of the physical distance between nodes like most works on literature. Then, the second algorithm, ACOSIMv2, based on an Ant Colony Optimization system, selects an optimal set of sensors nodes from to respond user's queries while attending all parameters and preserving the overall energy consumption. Results from initial experiments show that the approach reduces significantly the sensor cloud energy consumption compared to traditional works, providing a solution to be considered in sensor cloud scenarios.
AURP: An AUV-Aided Underwater Routing Protocol for Underwater Acoustic Sensor Networks
Yoon, Seokhoon; Azad, Abul K.; Oh, Hoon; Kim, Sunghwan
2012-01-01
Deploying a multi-hop underwater acoustic sensor network (UASN) in a large area brings about new challenges in reliable data transmissions and survivability of network due to the limited underwater communication range/bandwidth and the limited energy of underwater sensor nodes. In order to address those challenges and achieve the objectives of maximization of data delivery ratio and minimization of energy consumption of underwater sensor nodes, this paper proposes a new underwater routing scheme, namely AURP (AUV-aided underwater routing protocol), which uses not only heterogeneous acoustic communication channels but also controlled mobility of multiple autonomous underwater vehicles (AUVs). In AURP, the total data transmissions are minimized by using AUVs as relay nodes, which collect sensed data from gateway nodes and then forward to the sink. Moreover, controlled mobility of AUVs makes it possible to apply a short-range high data rate underwater channel for transmissions of a large amount of data. To the best to our knowledge, this work is the first attempt to employ multiple AUVs as relay nodes in a multi-hop UASN to improve the network performance in terms of data delivery ratio and energy consumption. Simulations, which are incorporated with a realistic underwater acoustic communication channel model, are carried out to evaluate the performance of the proposed scheme, and the results indicate that a high delivery ratio and low energy consumption can be achieved. PMID:22438740
AURP: an AUV-aided underwater routing protocol for underwater acoustic sensor networks.
Yoon, Seokhoon; Azad, Abul K; Oh, Hoon; Kim, Sunghwan
2012-01-01
Deploying a multi-hop underwater acoustic sensor network (UASN) in a large area brings about new challenges in reliable data transmissions and survivability of network due to the limited underwater communication range/bandwidth and the limited energy of underwater sensor nodes. In order to address those challenges and achieve the objectives of maximization of data delivery ratio and minimization of energy consumption of underwater sensor nodes, this paper proposes a new underwater routing scheme, namely AURP (AUV-aided underwater routing protocol), which uses not only heterogeneous acoustic communication channels but also controlled mobility of multiple autonomous underwater vehicles (AUVs). In AURP, the total data transmissions are minimized by using AUVs as relay nodes, which collect sensed data from gateway nodes and then forward to the sink. Moreover, controlled mobility of AUVs makes it possible to apply a short-range high data rate underwater channel for transmissions of a large amount of data. To the best to our knowledge, this work is the first attempt to employ multiple AUVs as relay nodes in a multi-hop UASN to improve the network performance in terms of data delivery ratio and energy consumption. Simulations, which are incorporated with a realistic underwater acoustic communication channel model, are carried out to evaluate the performance of the proposed scheme, and the results indicate that a high delivery ratio and low energy consumption can be achieved.
Development of an LSI for Tactile Sensor Systems on the Whole-Body of Robots
NASA Astrophysics Data System (ADS)
Muroyama, Masanori; Makihata, Mitsutoshi; Nakano, Yoshihiro; Matsuzaki, Sakae; Yamada, Hitoshi; Yamaguchi, Ui; Nakayama, Takahiro; Nonomura, Yutaka; Fujiyoshi, Motohiro; Tanaka, Shuji; Esashi, Masayoshi
We have developed a network type tactile sensor system, which realizes high-density tactile sensors on the whole-body of nursing and communication robots. The system consists of three kinds of nodes: host, relay and sensor nodes. Roles of the sensor node are to sense forces and, to encode the sensing data and to transmit the encoded data on serial channels by interruption handling. Relay nodes and host deal with a number of the encoded sensing data from the sensor nodes. A sensor node consists of a capacitive MEMS force sensor and a signal processing/transmission LSI. In this paper, details of an LSI for the sensor node are described. We designed experimental sensor node LSI chips by a commercial 0.18µm standard CMOS process. The 0.18µm LSIs were supplied in wafer level for MEMS post-process. The LSI chip area is 2.4mm × 2.4mm, which includes logic, CF converter and memory circuits. The maximum clock frequency of the chip with a large capacitive load is 10MHz. Measured power consumption at 10MHz clock is 2.23mW. Experimental results indicate that size, response time, sensor sensitivity and power consumption are all enough for practical tactile sensor systems.
Wireless Sensor Node for Autonomous Monitoring and Alerts in Remote Environments
NASA Technical Reports Server (NTRS)
Panangadan, Anand V. (Inventor); Monacos, Steve P. (Inventor)
2015-01-01
A method, apparatus, system, and computer program products provides personal alert and tracking capabilities using one or more nodes. Each node includes radio transceiver chips operating at different frequency ranges, a power amplifier, sensors, a display, and embedded software. The chips enable the node to operate as either a mobile sensor node or a relay base station node while providing a long distance relay link between nodes. The power amplifier enables a line-of-sight communication between the one or more nodes. The sensors provide a GPS signal, temperature, and accelerometer information (used to trigger an alert condition). The embedded software captures and processes the sensor information, provides a multi-hop packet routing protocol to relay the sensor information to and receive alert information from a command center, and to display the alert information on the display.
LWT Based Sensor Node Signal Processing in Vehicle Surveillance Distributed Sensor Network
NASA Astrophysics Data System (ADS)
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.
Secure anonymous mutual authentication for star two-tier wireless body area networks.
Ibrahim, Maged Hamada; Kumari, Saru; Das, Ashok Kumar; Wazid, Mohammad; Odelu, Vanga
2016-10-01
Mutual authentication is a very important service that must be established between sensor nodes in wireless body area network (WBAN) to ensure the originality and integrity of the patient's data sent by sensors distributed on different parts of the body. However, mutual authentication service is not enough. An adversary can benefit from monitoring the traffic and knowing which sensor is in transmission of patient's data. Observing the traffic (even without disclosing the context) and knowing its origin, it can reveal to the adversary information about the patient's medical conditions. Therefore, anonymity of the communicating sensors is an important service as well. Few works have been conducted in the area of mutual authentication among sensor nodes in WBAN. However, none of them has considered anonymity among body sensor nodes. Up to our knowledge, our protocol is the first attempt to consider this service in a two-tier WBAN. We propose a new secure protocol to realize anonymous mutual authentication and confidential transmission for star two-tier WBAN topology. The proposed protocol uses simple cryptographic primitives. We prove the security of the proposed protocol using the widely-accepted Burrows-Abadi-Needham (BAN) logic, and also through rigorous informal security analysis. In addition, to demonstrate the practicality of our protocol, we evaluate it using NS-2 simulator. BAN logic and informal security analysis prove that our proposed protocol achieves the necessary security requirements and goals of an authentication service. The simulation results show the impact on the various network parameters, such as end-to-end delay and throughput. The nodes in the network require to store few hundred bits. Nodes require to perform very few hash invocations, which are computationally very efficient. The communication cost of the proposed protocol is few hundred bits in one round of communication. Due to the low computation cost, the energy consumed by the nodes is also low. Our proposed protocol is a lightweight anonymous mutually authentication protocol to mutually authenticate the sensor nodes with the controller node (hub) in a star two-tier WBAN topology. Results show that our protocol proves efficiency over previously proposed protocols and at the same time, achieves the necessary security requirements for a secure anonymous mutual authentication scheme. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.
Authentication and Key Establishment in Dynamic Wireless Sensor Networks
Qiu, Ying; Zhou, Jianying; Baek, Joonsang; Lopez, Javier
2010-01-01
When a sensor node roams within a very large and distributed wireless sensor network, which consists of numerous sensor nodes, its routing path and neighborhood keep changing. In order to provide a high level of security in this environment, the moving sensor node needs to be authenticated to new neighboring nodes and a key established for secure communication. The paper proposes an efficient and scalable protocol to establish and update the authentication key in a dynamic wireless sensor network environment. The protocol guarantees that two sensor nodes share at least one key with probability 1 (100%) with less memory and energy cost, while not causing considerable communication overhead. PMID:22319321
Automated Construction of Node Software Using Attributes in a Ubiquitous Sensor Network Environment
Lee, Woojin; Kim, Juil; Kang, JangMook
2010-01-01
In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric—the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment. PMID:22163678
Automated construction of node software using attributes in a ubiquitous sensor network environment.
Lee, Woojin; Kim, Juil; Kang, JangMook
2010-01-01
In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric-the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment.
Inferring Human Activity Recognition with Ambient Sound on Wireless Sensor Nodes.
Salomons, Etto L; Havinga, Paul J M; van Leeuwen, Henk
2016-09-27
A wireless sensor network that consists of nodes with a sound sensor can be used to obtain context awareness in home environments. However, the limited processing power of wireless nodes offers a challenge when extracting features from the signal, and subsequently, classifying the source. Although multiple papers can be found on different methods of sound classification, none of these are aimed at limited hardware or take the efficiency of the algorithms into account. In this paper, we compare and evaluate several classification methods on a real sensor platform using different feature types and classifiers, in order to find an approach that results in a good classifier that can run on limited hardware. To be as realistic as possible, we trained our classifiers using sound waves from many different sources. We conclude that despite the fact that the classifiers are often of low quality due to the highly restricted hardware resources, sufficient performance can be achieved when (1) the window length for our classifiers is increased, and (2) if we apply a two-step approach that uses a refined classification after a global classification has been performed.
Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network
Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.
2015-01-01
Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead. PMID:26426701
Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.
Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N
2015-01-01
Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.
Distributed cluster management techniques for unattended ground sensor networks
NASA Astrophysics Data System (ADS)
Essawy, Magdi A.; Stelzig, Chad A.; Bevington, James E.; Minor, Sharon
2005-05-01
Smart Sensor Networks are becoming important target detection and tracking tools. The challenging problems in such networks include the sensor fusion, data management and communication schemes. This work discusses techniques used to distribute sensor management and multi-target tracking responsibilities across an ad hoc, self-healing cluster of sensor nodes. Although miniaturized computing resources possess the ability to host complex tracking and data fusion algorithms, there still exist inherent bandwidth constraints on the RF channel. Therefore, special attention is placed on the reduction of node-to-node communications within the cluster by minimizing unsolicited messaging, and distributing the sensor fusion and tracking tasks onto local portions of the network. Several challenging problems are addressed in this work including track initialization and conflict resolution, track ownership handling, and communication control optimization. Emphasis is also placed on increasing the overall robustness of the sensor cluster through independent decision capabilities on all sensor nodes. Track initiation is performed using collaborative sensing within a neighborhood of sensor nodes, allowing each node to independently determine if initial track ownership should be assumed. This autonomous track initiation prevents the formation of duplicate tracks while eliminating the need for a central "management" node to assign tracking responsibilities. Track update is performed as an ownership node requests sensor reports from neighboring nodes based on track error covariance and the neighboring nodes geo-positional location. Track ownership is periodically recomputed using propagated track states to determine which sensing node provides the desired coverage characteristics. High fidelity multi-target simulation results are presented, indicating the distribution of sensor management and tracking capabilities to not only reduce communication bandwidth consumption, but to also simplify multi-target tracking within the cluster.
Energy efficient sensor scheduling with a mobile sink node for the target tracking application.
Maheswararajah, Suhinthan; Halgamuge, Saman; Premaratne, Malin
2009-01-01
Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the sensor nodes whilst avoiding measurement losses. Since transmitting data over a long distance consumes a significant amount of energy, a mobile sink node collects the measurements and transmits them to the base station. We assume that the default transmission range of the activated sensor node is limited and it can be increased to maximum range only if the mobile sink node is out-side the default transmission range. Moreover, the active sensor node can be changed after a certain time period. The problem is to select an optimal sensor sequence which minimizes the total energy consumed by the sensor nodes. In this paper, we consider two different problems depend on the mobile sink node's path. First, we assume that the mobile sink node's position is known for the entire time horizon and use the dynamic programming technique to solve the problem. Second, the position of the sink node is varied over time according to a known Markov chain, and the problem is solved by stochastic dynamic programming. We also present sub-optimal methods to solve our problem. A numerical example is presented in order to discuss the proposed methods' performance.
Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application
Maheswararajah, Suhinthan; Halgamuge, Saman; Premaratne, Malin
2009-01-01
Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the sensor nodes whilst avoiding measurement losses. Since transmitting data over a long distance consumes a significant amount of energy, a mobile sink node collects the measurements and transmits them to the base station. We assume that the default transmission range of the activated sensor node is limited and it can be increased to maximum range only if the mobile sink node is out-side the default transmission range. Moreover, the active sensor node can be changed after a certain time period. The problem is to select an optimal sensor sequence which minimizes the total energy consumed by the sensor nodes. In this paper, we consider two different problems depend on the mobile sink node's path. First, we assume that the mobile sink node's position is known for the entire time horizon and use the dynamic programming technique to solve the problem. Second, the position of the sink node is varied over time according to a known Markov chain, and the problem is solved by stochastic dynamic programming. We also present sub-optimal methods to solve our problem. A numerical example is presented in order to discuss the proposed methods' performance PMID:22399934
Congestion Prediction Modeling for Quality of Service Improvement in Wireless Sensor Networks
Lee, Ga-Won; Lee, Sung-Young; Huh, Eui-Nam
2014-01-01
Information technology (IT) is pushing ahead with drastic reforms of modern life for improvement of human welfare. Objects constitute “Information Networks” through smart, self-regulated information gathering that also recognizes and controls current information states in Wireless Sensor Networks (WSNs). Information observed from sensor networks in real-time is used to increase quality of life (QoL) in various industries and daily life. One of the key challenges of the WSNs is how to achieve lossless data transmission. Although nowadays sensor nodes have enhanced capacities, it is hard to assure lossless and reliable end-to-end data transmission in WSNs due to the unstable wireless links and low hard ware resources to satisfy high quality of service (QoS) requirements. We propose a node and path traffic prediction model to predict and minimize the congestion. This solution includes prediction of packet generation due to network congestion from both periodic and event data generation. Simulation using NS-2 and Matlab is used to demonstrate the effectiveness of the proposed solution. PMID:24784035
Le, Duc Van; Oh, Hoon; Yoon, Seokhoon
2013-07-05
In a practical deployment, mobile sensor network (MSN) suffers from a low performance due to high node mobility, time-varying wireless channel properties, and obstacles between communicating nodes. In order to tackle the problem of low network performance and provide a desired end-to-end data transfer quality, in this paper we propose a novel ad hoc routing and relaying architecture, namely RoCoMAR (Robots' Controllable Mobility Aided Routing) that uses robotic nodes' controllable mobility. RoCoMAR repeatedly performs link reinforcement process with the objective of maximizing the network throughput, in which the link with the lowest quality on the path is identified and replaced with high quality links by placing a robotic node as a relay at an optimal position. The robotic node resigns as a relay if the objective is achieved or no more gain can be obtained with a new relay. Once placed as a relay, the robotic node performs adaptive link maintenance by adjusting its position according to the movements of regular nodes. The simulation results show that RoCoMAR outperforms existing ad hoc routing protocols for MSN in terms of network throughput and end-to-end delay.
Van Le, Duc; Oh, Hoon; Yoon, Seokhoon
2013-01-01
In a practical deployment, mobile sensor network (MSN) suffers from a low performance due to high node mobility, time-varying wireless channel properties, and obstacles between communicating nodes. In order to tackle the problem of low network performance and provide a desired end-to-end data transfer quality, in this paper we propose a novel ad hoc routing and relaying architecture, namely RoCoMAR (Robots' Controllable Mobility Aided Routing) that uses robotic nodes' controllable mobility. RoCoMAR repeatedly performs link reinforcement process with the objective of maximizing the network throughput, in which the link with the lowest quality on the path is identified and replaced with high quality links by placing a robotic node as a relay at an optimal position. The robotic node resigns as a relay if the objective is achieved or no more gain can be obtained with a new relay. Once placed as a relay, the robotic node performs adaptive link maintenance by adjusting its position according to the movements of regular nodes. The simulation results show that RoCoMAR outperforms existing ad hoc routing protocols for MSN in terms of network throughput and end-to-end delay. PMID:23881134
Ding, Xu; Shi, Lei; Han, Jianghong; Lu, Jingting
2016-01-01
Wireless sensor networks deployed in coal mines could help companies provide workers working in coal mines with more qualified working conditions. With the underground information collected by sensor nodes at hand, the underground working conditions could be evaluated more precisely. However, sensor nodes may tend to malfunction due to their limited energy supply. In this paper, we study the cross-layer optimization problem for wireless rechargeable sensor networks implemented in coal mines, of which the energy could be replenished through the newly-brewed wireless energy transfer technique. The main results of this article are two-fold: firstly, we obtain the optimal relay nodes’ placement according to the minimum overall energy consumption criterion through the Lagrange dual problem and KKT conditions; secondly, the optimal strategies for recharging locomotives and wireless sensor networks are acquired by solving a cross-layer optimization problem. The cyclic nature of these strategies is also manifested through simulations in this paper. PMID:26828500
Energy-aware scheduling of surveillance in wireless multimedia sensor networks.
Wang, Xue; Wang, Sheng; Ma, Junjie; Sun, Xinyao
2010-01-01
Wireless sensor networks involve a large number of sensor nodes with limited energy supply, which impacts the behavior of their application. In wireless multimedia sensor networks, sensor nodes are equipped with audio and visual information collection modules. Multimedia contents are ubiquitously retrieved in surveillance applications. To solve the energy problems during target surveillance with wireless multimedia sensor networks, an energy-aware sensor scheduling method is proposed in this paper. Sensor nodes which acquire acoustic signals are deployed randomly in the sensing fields. Target localization is based on the signal energy feature provided by multiple sensor nodes, employing particle swarm optimization (PSO). During the target surveillance procedure, sensor nodes are adaptively grouped in a totally distributed manner. Specially, the target motion information is extracted by a forecasting algorithm, which is based on the hidden Markov model (HMM). The forecasting results are utilized to awaken sensor node in the vicinity of future target position. According to the two properties, signal energy feature and residual energy, the sensor nodes decide whether to participate in target detection separately with a fuzzy control approach. Meanwhile, the local routing scheme of data transmission towards the observer is discussed. Experimental results demonstrate the efficiency of energy-aware scheduling of surveillance in wireless multimedia sensor network, where significant energy saving is achieved by the sensor awakening approach and data transmission paths are calculated with low computational complexity.
Addressing Data Veracity in Big Data Applications
DOE Office of Scientific and Technical Information (OSTI.GOV)
Aman, Saima; Chelmis, Charalampos; Prasanna, Viktor
Big data applications such as in smart electric grids, transportation, and remote environment monitoring involve geographically dispersed sensors that periodically send back information to central nodes. In many cases, data from sensors is not available at central nodes at a frequency that is required for real-time modeling and decision-making. This may be due to physical limitations of the transmission networks, or due to consumers limiting frequent transmission of data from sensors located at their premises for security and privacy concerns. Such scenarios lead to partial data problem and raise the issue of data veracity in big data applications. We describemore » a novel solution to the problem of making short term predictions (up to a few hours ahead) in absence of real-time data from sensors in Smart Grid. A key implication of our work is that by using real-time data from only a small subset of influential sensors, we are able to make predictions for all sensors. We thus reduce the communication complexity involved in transmitting sensory data in Smart Grids. We use real-world electricity consumption data from smart meters to empirically demonstrate the usefulness of our method. Our dataset consists of data collected at 15-min intervals from 170 smart meters in the USC Microgrid for 7 years, totaling 41,697,600 data points.« less
Guimarães, Dayan Adionel; Sakai, Lucas Jun; Alberti, Antonio Marcos; de Souza, Rausley Adriano Amaral
2016-09-20
In this paper, a simple and flexible method for increasing the lifetime of fixed or mobile wireless sensor networks is proposed. Based on past residual energy information reported by the sensor nodes, the sink node or another central node dynamically optimizes the communication activity levels of the sensor nodes to save energy without sacrificing the data throughput. The activity levels are defined to represent portions of time or time-frequency slots in a frame, during which the sensor nodes are scheduled to communicate with the sink node to report sensory measurements. Besides node mobility, it is considered that sensors' batteries may be recharged via a wireless power transmission or equivalent energy harvesting scheme, bringing to the optimization problem an even more dynamic character. We report large increased lifetimes over the non-optimized network and comparable or even larger lifetime improvements with respect to an idealized greedy algorithm that uses both the real-time channel state and the residual energy information.
Mi, Shichao; Han, Hui; Chen, Cailian; Yan, Jian; Guan, Xinping
2016-02-19
Heterogeneous wireless sensor networks (HWSNs) can achieve more tasks and prolong the network lifetime. However, they are vulnerable to attacks from the environment or malicious nodes. This paper is concerned with the issues of a consensus secure scheme in HWSNs consisting of two types of sensor nodes. Sensor nodes (SNs) have more computation power, while relay nodes (RNs) with low power can only transmit information for sensor nodes. To address the security issues of distributed estimation in HWSNs, we apply the heterogeneity of responsibilities between the two types of sensors and then propose a parameter adjusted-based consensus scheme (PACS) to mitigate the effect of the malicious node. Finally, the convergence property is proven to be guaranteed, and the simulation results validate the effectiveness and efficiency of PACS.
Energy Efficient Real-Time Scheduling Using DPM on Mobile Sensors with a Uniform Multi-Cores
Kim, Youngmin; Lee, Chan-Gun
2017-01-01
In wireless sensor networks (WSNs), sensor nodes are deployed for collecting and analyzing data. These nodes use limited energy batteries for easy deployment and low cost. The use of limited energy batteries is closely related to the lifetime of the sensor nodes when using wireless sensor networks. Efficient-energy management is important to extending the lifetime of the sensor nodes. Most effort for improving power efficiency in tiny sensor nodes has focused mainly on reducing the power consumed during data transmission. However, recent emergence of sensor nodes equipped with multi-cores strongly requires attention to be given to the problem of reducing power consumption in multi-cores. In this paper, we propose an energy efficient scheduling method for sensor nodes supporting a uniform multi-cores. We extend the proposed T-Ler plane based scheduling for global optimal scheduling of a uniform multi-cores and multi-processors to enable power management using dynamic power management. In the proposed approach, processor selection for a scheduling and mapping method between the tasks and processors is proposed to efficiently utilize dynamic power management. Experiments show the effectiveness of the proposed approach compared to other existing methods. PMID:29240695
Energy-Efficient Implementation of ECDH Key Exchange for Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Lederer, Christian; Mader, Roland; Koschuch, Manuel; Großschädl, Johann; Szekely, Alexander; Tillich, Stefan
Wireless Sensor Networks (WSNs) are playing a vital role in an ever-growing number of applications ranging from environmental surveillance over medical monitoring to home automation. Since WSNs are often deployed in unattended or even hostile environments, they can be subject to various malicious attacks, including the manipulation and capture of nodes. The establishment of a shared secret key between two or more individual nodes is one of the most important security services needed to guarantee the proper functioning of a sensor network. Despite some recent advances in this field, the efficient implementation of cryptographic key establishment for WSNs remains a challenge due to the resource constraints of small sensor nodes such as the MICAz mote. In this paper we present a lightweight implementation of the elliptic curve Diffie-Hellman (ECDH) key exchange for ZigBee-compliant sensor nodes equipped with an ATmega128 processor running the TinyOS operating system. Our implementation uses a 192-bit prime field specified by the NIST as underlying algebraic structure and requires only 5.20 ·106 clock cycles to compute a scalar multiplication if the base point is fixed and known a priori. A scalar multiplication using a random base point takes about 12.33 ·106 cycles. Our results show that a full ECDH key exchange between two MICAz motes consumes an energy of 57.33 mJ (including radio communication), which is significantly better than most previously reported ECDH implementations on comparable platforms.
Joint Optimal Placement and Energy Allocation of Underwater Sensors in a Tree Topology
2014-03-10
underwater acoustic sensor nodes with respect to the capacity of the wireless links between the... underwater acoustic sensor nodes with respect to the capacity of the wireless links between the nodes. We assumed that the energy consumption of...nodes’ optimal placements. We achieve the optimal placement of the underwater acoustic sensor nodes with respect to the capacity of the wireless
Method and system for monitoring environmental conditions
Kulesz, James J [Oak Ridge, TN; Lee, Ronald W [Oak Ridge, TN
2010-11-16
A system for detecting the occurrence of anomalies includes a plurality of spaced apart nodes, with each node having adjacent nodes, each of the nodes having one or more sensors associated with the node and capable of detecting anomalies, and each of the nodes having a controller connected to the sensors associated with the node. The system also includes communication links between adjacent nodes, whereby the nodes form a network. At least one software agent is capable of changing the operation of at least one of the controllers in response to the detection of an anomaly by a sensor.
Protru: Leveraging Provenance to Enhance Network Trust in a Wireless Sensor Network
ERIC Educational Resources Information Center
Dogan, Gulustan
2013-01-01
Trust can be an important component of wireless sensor networks for believability of the produced data and historical value is a crucial asset in deciding trust of the data. A node's trust can change over time after its initial deployment due to various reasons such as energy loss, environmental conditions or exhausting sources. Provenance can…
A network coding based routing protocol for underwater sensor networks.
Wu, Huayang; Chen, Min; Guan, Xin
2012-01-01
Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime.
A Network Coding Based Routing Protocol for Underwater Sensor Networks
Wu, Huayang; Chen, Min; Guan, Xin
2012-01-01
Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime. PMID:22666045
A Low-Power Sensor Network for Long Duration Monitoring in Deep Caves
NASA Astrophysics Data System (ADS)
Silva, A.; Johnson, I.; Bick, T.; Winclechter, C.; Jorgensen, A. M.; Teare, S. W.; Arechiga, R. O.
2010-12-01
Monitoring deep and inaccessible caves is important and challenging for a variety of reasons. It is of interest to study caves environments for understanding cave ecosystems, and human impact on the ecosystems. Caves may also hold clues to past climate changes. Cave instrumentation must however carry out its job with minimal human intervention and without disturbing the fragile environment. This requires unobtrusive and autonomous instrumentation. Earth-bound caves can also serve as analogs for caves on other planets and act as testbeds for autonomous sensor networks. Here we report on a project to design and implement a low-power, ad-hoc, wireless sensor network for monitoring caves and similar environments. The implemented network is composed of individual nodes which consist of a sensor, processing unit, memory, transceiver and a power source. Data collected at these nodes is transmitted through a wireless ZigBee network to a central data collection point from which the researcher may transfer collected data to a laptop for further analysis. The project accomplished a node design with a physical footprint of 2 inches long by 3 inches wide. The design is based on the EZMSP430-RF2480, a Zigbee hardware base offered by Texas Instruments. Five functioning nodes have been constructed at very low cost and tested. Due to the use of an external analog-to-digital converter the design was able to achieve a 16-bit resolution. The operational time achieved by the prototype was calculated to be approximately 80 days of autonomous operation while sampling once per minute. Each node is able to support and record data from up to four different sensors.
Estimation of distributed Fermat-point location for wireless sensor networking.
Huang, Po-Hsian; Chen, Jiann-Liang; Larosa, Yanuarius Teofilus; Chiang, Tsui-Lien
2011-01-01
This work presents a localization scheme for use in wireless sensor networks (WSNs) that is based on a proposed connectivity-based RF localization strategy called the distributed Fermat-point location estimation algorithm (DFPLE). DFPLE applies triangle area of location estimation formed by intersections of three neighboring beacon nodes. The Fermat point is determined as the shortest path from three vertices of the triangle. The area of estimated location then refined using Fermat point to achieve minimum error in estimating sensor nodes location. DFPLE solves problems of large errors and poor performance encountered by localization schemes that are based on a bounding box algorithm. Performance analysis of a 200-node development environment reveals that, when the number of sensor nodes is below 150, the mean error decreases rapidly as the node density increases, and when the number of sensor nodes exceeds 170, the mean error remains below 1% as the node density increases. Second, when the number of beacon nodes is less than 60, normal nodes lack sufficient beacon nodes to enable their locations to be estimated. However, the mean error changes slightly as the number of beacon nodes increases above 60. Simulation results revealed that the proposed algorithm for estimating sensor positions is more accurate than existing algorithms, and improves upon conventional bounding box strategies.
NASA Astrophysics Data System (ADS)
Hortos, William S.
2008-04-01
Proposed distributed wavelet-based algorithms are a means to compress sensor data received at the nodes forming a wireless sensor network (WSN) by exchanging information between neighboring sensor nodes. Local collaboration among nodes compacts the measurements, yielding a reduced fused set with equivalent information at far fewer nodes. Nodes may be equipped with multiple sensor types, each capable of sensing distinct phenomena: thermal, humidity, chemical, voltage, or image signals with low or no frequency content as well as audio, seismic or video signals within defined frequency ranges. Compression of the multi-source data through wavelet-based methods, distributed at active nodes, reduces downstream processing and storage requirements along the paths to sink nodes; it also enables noise suppression and more energy-efficient query routing within the WSN. Targets are first detected by the multiple sensors; then wavelet compression and data fusion are applied to the target returns, followed by feature extraction from the reduced data; feature data are input to target recognition/classification routines; targets are tracked during their sojourns through the area monitored by the WSN. Algorithms to perform these tasks are implemented in a distributed manner, based on a partition of the WSN into clusters of nodes. In this work, a scheme of collaborative processing is applied for hierarchical data aggregation and decorrelation, based on the sensor data itself and any redundant information, enabled by a distributed, in-cluster wavelet transform with lifting that allows multiple levels of resolution. The wavelet-based compression algorithm significantly decreases RF bandwidth and other resource use in target processing tasks. Following wavelet compression, features are extracted. The objective of feature extraction is to maximize the probabilities of correct target classification based on multi-source sensor measurements, while minimizing the resource expenditures at participating nodes. Therefore, the feature-extraction method based on the Haar DWT is presented that employs a maximum-entropy measure to determine significant wavelet coefficients. Features are formed by calculating the energy of coefficients grouped around the competing clusters. A DWT-based feature extraction algorithm used for vehicle classification in WSNs can be enhanced by an added rule for selecting the optimal number of resolution levels to improve the correct classification rate and reduce energy consumption expended in local algorithm computations. Published field trial data for vehicular ground targets, measured with multiple sensor types, are used to evaluate the wavelet-assisted algorithms. Extracted features are used in established target recognition routines, e.g., the Bayesian minimum-error-rate classifier, to compare the effects on the classification performance of the wavelet compression. Simulations of feature sets and recognition routines at different resolution levels in target scenarios indicate the impact on classification rates, while formulas are provided to estimate reduction in resource use due to distributed compression.
Assessing the Effects of Multi-Node Sensor Network Configurations on the Operational Tempo
2014-09-01
receiver, nP is the noise power of the receiver, and iL is the implementation loss of the receiver due to hardware manufacturing. The received...13. ABSTRACT (maximum 200 words) The LPISimNet software tool provides the capability to quantify the performance of sensor network configurations by...INTENTIONALLY LEFT BLANK v ABSTRACT The LPISimNet software tool provides the capability to quantify the performance of sensor network configurations
NASA Astrophysics Data System (ADS)
Dayananda, Karanam Ravichandran; Straub, Jeremy
2017-05-01
This paper proposes a new hybrid algorithm for security, which incorporates both distributed and hierarchal approaches. It uses a mobile data collector (MDC) to collect information in order to save energy of sensor nodes in a wireless sensor network (WSN) as, in most networks, these sensor nodes have limited energy. Wireless sensor networks are prone to security problems because, among other things, it is possible to use a rogue sensor node to eavesdrop on or alter the information being transmitted. To prevent this, this paper introduces a security algorithm for MDC-based WSNs. A key use of this algorithm is to protect the confidentiality of the information sent by the sensor nodes. The sensor nodes are deployed in a random fashion and form group structures called clusters. Each cluster has a cluster head. The cluster head collects data from the other nodes using the time-division multiple access protocol. The sensor nodes send their data to the cluster head for transmission to the base station node for further processing. The MDC acts as an intermediate node between the cluster head and base station. The MDC, using its dynamic acyclic graph path, collects the data from the cluster head and sends it to base station. This approach is useful for applications including warfighting, intelligent building and medicine. To assess the proposed system, the paper presents a comparison of its performance with other approaches and algorithms that can be used for similar purposes.
Game Theory Meets Wireless Sensor Networks Security Requirements and Threats Mitigation: A Survey.
Abdalzaher, Mohamed S; Seddik, Karim; Elsabrouty, Maha; Muta, Osamu; Furukawa, Hiroshi; Abdel-Rahman, Adel
2016-06-29
We present a study of using game theory for protecting wireless sensor networks (WSNs) from selfish behavior or malicious nodes. Due to scalability, low complexity and disseminated nature of WSNs, malicious attacks can be modeled effectively using game theory. In this study, we survey the different game-theoretic defense strategies for WSNs. We present a taxonomy of the game theory approaches based on the nature of the attack, whether it is caused by an external attacker or it is the result of an internal node acting selfishly or maliciously. We also present a general trust model using game theory for decision making. We, finally, identify the significant role of evolutionary games for WSNs security against intelligent attacks; then, we list several prospect applications of game theory to enhance the data trustworthiness and node cooperation in different WSNs.
Evaluating reliability of WSN with sleep/wake-up interfering nodes
NASA Astrophysics Data System (ADS)
Distefano, Salvatore
2013-10-01
A wireless sensor network (WSN) (singular and plural of acronyms are spelled the same) is a distributed system composed of autonomous sensor nodes wireless connected and randomly scattered into a geographical area to cooperatively monitor physical or environmental conditions. Adequate techniques and strategies are required to manage a WSN so that it works properly, observing specific quantities and metrics to evaluate the WSN operational conditions. Among them, one of the most important is the reliability. Considering a WSN as a system composed of sensor nodes the system reliability approach can be applied, thus expressing the WSN reliability in terms of its nodes' reliability. More specifically, since often standby power management policies are applied at node level and interferences among nodes may arise, a WSN can be considered as a dynamic system. In this article we therefore consider the WSN reliability evaluation problem from the dynamic system reliability perspective. Static-structural interactions are specified by the WSN topology. Sleep/wake-up standby policies and interferences due to wireless communications can be instead considered as dynamic aspects. Thus, in order to represent and to evaluate the WSN reliability, we use dynamic reliability block diagrams and Petri nets. The proposed technique allows to overcome the limits of Markov models when considering non-linear discharge processes, since they cannot adequately represent the aging processes. In order to demonstrate the effectiveness of the technique, we investigate some specific WSN network topologies, providing guidelines for their representation and evaluation.
Broday, David M
2017-10-02
The evaluation of the effects of air pollution on public health and human-wellbeing requires reliable data. Standard air quality monitoring stations provide accurate measurements of airborne pollutant levels, but, due to their sparse distribution, they cannot capture accurately the spatial variability of air pollutant concentrations within cities. Dedicated in-depth field campaigns have dense spatial coverage of the measurements but are held for relatively short time periods. Hence, their representativeness is limited. Moreover, the oftentimes integrated measurements represent time-averaged records. Recent advances in communication and sensor technologies enable the deployment of dense grids of Wireless Distributed Environmental Sensor Networks for air quality monitoring, yet their capability to capture urban-scale spatiotemporal pollutant patterns has not been thoroughly examined to date. Here, we summarize our studies on the practicalities of using data streams from sensor nodes for air quality measurement and the required methods to tune the results to different stakeholders and applications. We summarize the results from eight cities across Europe, five sensor technologies-three stationary (with one tested also while moving) and two personal sensor platforms, and eight ambient pollutants. Overall, few sensors showed an exceptional and consistent performance, which can shed light on the fine spatiotemporal urban variability of pollutant concentrations. Stationary sensor nodes were more reliable than personal nodes. In general, the sensor measurements tend to suffer from the interference of various environmental factors and require frequent calibrations. This calls for the development of suitable field calibration procedures, and several such in situ field calibrations are presented.
2017-01-01
The evaluation of the effects of air pollution on public health and human-wellbeing requires reliable data. Standard air quality monitoring stations provide accurate measurements of airborne pollutant levels, but, due to their sparse distribution, they cannot capture accurately the spatial variability of air pollutant concentrations within cities. Dedicated in-depth field campaigns have dense spatial coverage of the measurements but are held for relatively short time periods. Hence, their representativeness is limited. Moreover, the oftentimes integrated measurements represent time-averaged records. Recent advances in communication and sensor technologies enable the deployment of dense grids of Wireless Distributed Environmental Sensor Networks for air quality monitoring, yet their capability to capture urban-scale spatiotemporal pollutant patterns has not been thoroughly examined to date. Here, we summarize our studies on the practicalities of using data streams from sensor nodes for air quality measurement and the required methods to tune the results to different stakeholders and applications. We summarize the results from eight cities across Europe, five sensor technologies-three stationary (with one tested also while moving) and two personal sensor platforms, and eight ambient pollutants. Overall, few sensors showed an exceptional and consistent performance, which can shed light on the fine spatiotemporal urban variability of pollutant concentrations. Stationary sensor nodes were more reliable than personal nodes. In general, the sensor measurements tend to suffer from the interference of various environmental factors and require frequent calibrations. This calls for the development of suitable field calibration procedures, and several such in situ field calibrations are presented. PMID:28974042
Rodríguez-Molina, Jesús; Martínez, José-Fernán; Castillejo, Pedro; López, Lourdes
2013-01-01
Wireless Sensor Networks (WSNs) are spearheading the efforts taken to build and deploy systems aiming to accomplish the ultimate objectives of the Internet of Things. Due to the sensors WSNs nodes are provided with, and to their ubiquity and pervasive capabilities, these networks become extremely suitable for many applications that so-called conventional cabled or wireless networks are unable to handle. One of these still underdeveloped applications is monitoring physical parameters on a person. This is an especially interesting application regarding their age or activity, for any detected hazardous parameter can be notified not only to the monitored person as a warning, but also to any third party that may be helpful under critical circumstances, such as relatives or healthcare centers. We propose a system built to monitor a sportsman/woman during a workout session or performing a sport-related indoor activity. Sensors have been deployed by means of several nodes acting as the nodes of a WSN, along with a semantic middleware development used for hardware complexity abstraction purposes. The data extracted from the environment, combined with the information obtained from the user, will compose the basis of the services that can be obtained. PMID:23385405
Rodríguez-Molina, Jesús; Martínez, José-Fernán; Castillejo, Pedro; López, Lourdes
2013-01-31
Wireless Sensor Networks (WSNs) are spearheading the efforts taken to build and deploy systems aiming to accomplish the ultimate objectives of the Internet of Things. Due to the sensors WSNs nodes are provided with, and to their ubiquity and pervasive capabilities, these networks become extremely suitable for many applications that so-called conventional cabled or wireless networks are unable to handle. One of these still underdeveloped applications is monitoring physical parameters on a person. This is an especially interesting application regarding their age or activity, for any detected hazardous parameter can be notified not only to the monitored person as a warning, but also to any third party that may be helpful under critical circumstances, such as relatives or healthcare centers. We propose a system built to monitor a sportsman/woman during a workout session or performing a sport-related indoor activity. Sensors have been deployed by means of several nodes acting as the nodes of a WSN, along with a semantic middleware development used for hardware complexity abstraction purposes. The data extracted from the environment, combined with the information obtained from the user, will compose the basis of the services that can be obtained.
Providing Self-Healing Ability for Wireless Sensor Node by Using Reconfigurable Hardware
Yuan, Shenfang; Qiu, Lei; Gao, Shang; Tong, Yao; Yang, Weiwei
2012-01-01
Wireless sensor networks (WSNs) have received tremendous attention over the past ten years. In engineering applications of WSNs, a number of sensor nodes are usually spread across some specific geographical area. Some of these nodes have to work in harsh environments. Dependability of the Wireless Sensor Network (WSN) is very important for its successful applications in the engineering area. In ordinary research, when a node has a failure, it is usually discarded and the network is reorganized to ensure the normal operation of the WSN. Using appropriate WSN re-organization methods, though the sensor networks can be reorganized, this causes additional maintenance costs and sometimes still decreases the function of the networks. In those situations where the sensor networks cannot be reorganized, the performance of the whole WSN will surely be degraded. In order to ensure the reliable and low cost operation of WSNs, a method to develop a wireless sensor node with self-healing ability based on reconfigurable hardware is proposed in this paper. Two self-healing WSN node realization paradigms based on reconfigurable hardware are presented, including a redundancy-based self-healing paradigm and a whole FPAA/FPGA based self-healing paradigm. The nodes designed with the self-healing ability can dynamically change their node configurations to repair the nodes' hardware failures. To demonstrate these two paradigms, a strain sensor node is adopted as an illustration to show the concepts. Two strain WSN sensor nodes with self-healing ability are developed respectively according to the proposed self-healing paradigms. Evaluation experiments on self-healing ability and power consumption are performed. Experimental results show that the developed nodes can self-diagnose the failures and recover to a normal state automatically. The research presented can improve the robustness of WSNs and reduce the maintenance cost of WSNs in engineering applications. PMID:23202176
Design of nodes for embedded and ultra low-power wireless sensor networks
NASA Astrophysics Data System (ADS)
Xu, Jun; You, Bo; Cui, Juan; Ma, Jing; Li, Xin
2008-10-01
Sensor network integrates sensor technology, MEMS (Micro-Electro-Mechanical system) technology, embedded computing, wireless communication technology and distributed information management technology. It is of great value to use it where human is quite difficult to reach. Power consumption and size are the most important consideration when nodes are designed for distributed WSN (wireless sensor networks). Consequently, it is of great importance to decrease the size of a node, reduce its power consumption and extend its life in network. WSN nodes have been designed using JN5121-Z01-M01 module produced by jennic company and IEEE 802.15.4/ZigBee technology. Its new features include support for CPU sleep modes and a long-term ultra low power sleep mode for the entire node. In low power configuration the node resembles existing small low power nodes. An embedded temperature sensor node has been developed to verify and explore our architecture. The experiment results indicate that the WSN has the characteristic of high reliability, good stability and ultra low power consumption.
Guimarães, Dayan Adionel; Sakai, Lucas Jun; Alberti, Antonio Marcos; de Souza, Rausley Adriano Amaral
2016-01-01
In this paper, a simple and flexible method for increasing the lifetime of fixed or mobile wireless sensor networks is proposed. Based on past residual energy information reported by the sensor nodes, the sink node or another central node dynamically optimizes the communication activity levels of the sensor nodes to save energy without sacrificing the data throughput. The activity levels are defined to represent portions of time or time-frequency slots in a frame, during which the sensor nodes are scheduled to communicate with the sink node to report sensory measurements. Besides node mobility, it is considered that sensors’ batteries may be recharged via a wireless power transmission or equivalent energy harvesting scheme, bringing to the optimization problem an even more dynamic character. We report large increased lifetimes over the non-optimized network and comparable or even larger lifetime improvements with respect to an idealized greedy algorithm that uses both the real-time channel state and the residual energy information. PMID:27657075
Distributed Transforms for Efficient Data Gathering in Sensor Networks
NASA Technical Reports Server (NTRS)
Ortega, Antonio (Inventor); Shen, Godwin (Inventor); Narang, Sunil K. (Inventor); Perez-Trufero, Javier (Inventor)
2014-01-01
Devices, systems, and techniques for data collecting network such as wireless sensors are disclosed. A described technique includes detecting one or more remote nodes included in the wireless sensor network using a local power level that controls a radio range of the local node. The technique includes transmitting a local outdegree. The local outdegree can be based on a quantity of the one or more remote nodes. The technique includes receiving one or more remote outdegrees from the one or more remote nodes. The technique includes determining a local node type of the local node based on detecting a node type of the one or more remote nodes, using the one or more remote outdegrees, and using the local outdegree. The technique includes adjusting characteristics, including an energy usage characteristic and a data compression characteristic, of the wireless sensor network by selectively modifying the local power level and selectively changing the local node type.
Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch.
Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang
2016-01-19
Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture.
Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch
Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang
2016-01-01
Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture. PMID:26797616
Energy scavenging for long-term deployable wireless sensor networks.
Mathúna, Cian O; O'Donnell, Terence; Martinez-Catala, Rafael V; Rohan, James; O'Flynn, Brendan
2008-05-15
The coming decade will see the rapid emergence of low cost, intelligent, wireless sensors and their widespread deployment throughout our environment. While wearable systems will operate over communications ranges of less than a meter, building management systems will operate with inter-node communications ranges of the order of meters to tens of meters and remote environmental monitoring systems will require communications systems and associated energy systems that will allow reliable operation over kilometers. Autonomous power should allow wireless sensor nodes to operate in a "deploy and forget" mode. The use of rechargeable battery technology is problematic due to battery lifetime issues related to node power budget, battery self-discharge, number of recharge cycles and long-term environmental impact. Duty cycling of wireless sensor nodes with long "SLEEP" times minimises energy usage. A case study of a multi-sensor, wireless, building management system operating using the Zigbee protocol demonstrates that, even with a 1 min cycle time for an 864 ms "ACTIVE" mode, the sensor module is already in SLEEP mode for almost 99% of the time. For a 20-min cycle time, the energy utilisation in SLEEP mode exceeds the ACTIVE mode energy by almost a factor of three and thus dominates the module energy utilisation thereby providing the ultimate limit to the power system lifetime. Energy harvesting techniques can deliver energy densities of 7.5 mW/cm(2) from outdoor solar, 100 microW/cm(2) from indoor lighting, 100 microW/cm(3) from vibrational energy and 60 microW/cm(2) from thermal energy typically found in a building environment. A truly autonomous, "deploy and forget" battery-less system can be achieved by scaling the energy harvesting system to provide all the system energy needs. In the building management case study discussed, for duty cycles of less than 0.07% (i.e. in ACTIVE mode for 0.864 s every 20 min), energy harvester device dimensions of approximately 2 cm on a side would be sufficient to supply the complete wireless sensor node energy. Key research challenges to be addressed to deliver future, remote, wireless, chemo-biosensing systems include the development of low cost, low-power sensors, miniaturised fluidic transport systems, anti-bio-fouling sensor surfaces, sensor calibration, reliable and robust system packaging, as well as associated energy delivery systems and energy budget management.
Tang, Kea-Tiong; Li, Cheng-Han; Chiu, Shih-Wen
2011-01-01
This study developed an electronic-nose sensor node based on a polymer-coated surface acoustic wave (SAW) sensor array. The sensor node comprised an SAW sensor array, a frequency readout circuit, and an Octopus II wireless module. The sensor array was fabricated on a large K2 128° YX LiNbO3 sensing substrate. On the surface of this substrate, an interdigital transducer (IDT) was produced with a Cr/Au film as its metallic structure. A mixed-mode frequency readout application specific integrated circuit (ASIC) was fabricated using a TSMC 0.18 μm process. The ASIC output was connected to a wireless module to transmit sensor data to a base station for data storage and analysis. This sensor node is applicable for wireless sensor network (WSN) applications. PMID:22163865
Tang, Kea-Tiong; Li, Cheng-Han; Chiu, Shih-Wen
2011-01-01
This study developed an electronic-nose sensor node based on a polymer-coated surface acoustic wave (SAW) sensor array. The sensor node comprised an SAW sensor array, a frequency readout circuit, and an Octopus II wireless module. The sensor array was fabricated on a large K(2) 128° YX LiNbO3 sensing substrate. On the surface of this substrate, an interdigital transducer (IDT) was produced with a Cr/Au film as its metallic structure. A mixed-mode frequency readout application specific integrated circuit (ASIC) was fabricated using a TSMC 0.18 μm process. The ASIC output was connected to a wireless module to transmit sensor data to a base station for data storage and analysis. This sensor node is applicable for wireless sensor network (WSN) applications.
Underwater Sensor Nodes and Networks
Lloret, Jaime
2013-01-01
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. PMID:24013489
I-DWRL: Improved Dual Wireless Radio Localization Using Magnetometer.
Aziz, Abdul; Kumar, Ramesh; Joe, Inwhee
2017-11-15
In the dual wireless radio localization (DWRL) technique each sensor node is equipped with two ultra-wide band (UWB) radios; the distance between the two radios is a few tens of centimeters. For localization, the DWRL technique must use at least two pre-localized nodes to fully localize an unlocalized node. Moreover, in the DWRL technique it is also not possible for two sensor nodes to properly communicate location information unless each of the four UWB radios of two communicating sensor nodes cannot approach the remaining three radios. In this paper, we propose an improved DWRL (I-DWRL) algorithm along with mounting a magnetometer sensor on one of the UWB radios of all sensor nodes. This addition of a magnetometer helps to improve DWRL algorithm such that only one localized sensor node is required for the localization of an unlocalized sensor node, and localization can also be achieved even when some of the four radios of two nodes are unable to communicate with the remaining three radios. The results show that with the use of a magnetometer a greater number of nodes can be localized with a smaller transmission range, less energy and a shorter period of time. In comparison with the conventional DWRL algorithm, our I-DWRL not only maintains the localization error but also requires around half of semi-localizations, 60% of the time, 70% of the energy and a shorter communication range to fully localize an entire network. Moreover, I-DWRL can even localize more nodes while transmission range is not sufficient for DWRL algorithm.
I-DWRL: Improved Dual Wireless Radio Localization Using Magnetometer
Aziz, Abdul; Kumar, Ramesh; Joe, Inwhee
2017-01-01
In the dual wireless radio localization (DWRL) technique each sensor node is equipped with two ultra-wide band (UWB) radios; the distance between the two radios is a few tens of centimeters. For localization, the DWRL technique must use at least two pre-localized nodes to fully localize an unlocalized node. Moreover, in the DWRL technique it is also not possible for two sensor nodes to properly communicate location information unless each of the four UWB radios of two communicating sensor nodes cannot approach the remaining three radios. In this paper, we propose an improved DWRL (I-DWRL) algorithm along with mounting a magnetometer sensor on one of the UWB radios of all sensor nodes. This addition of a magnetometer helps to improve DWRL algorithm such that only one localized sensor node is required for the localization of an unlocalized sensor node, and localization can also be achieved even when some of the four radios of two nodes are unable to communicate with the remaining three radios. The results show that with the use of a magnetometer a greater number of nodes can be localized with a smaller transmission range, less energy and a shorter period of time. In comparison with the conventional DWRL algorithm, our I-DWRL not only maintains the localization error but also requires around half of semi-localizations, 60% of the time, 70% of the energy and a shorter communication range to fully localize an entire network. Moreover, I-DWRL can even localize more nodes while transmission range is not sufficient for DWRL algorithm. PMID:29140291
An Efficient Interactive Model for On-Demand Sensing-As-A-Servicesof Sensor-Cloud
Dinh, Thanh; Kim, Younghan
2016-01-01
This paper proposes an efficient interactive model for the sensor-cloud to enable the sensor-cloud to efficiently provide on-demand sensing services for multiple applications with different requirements at the same time. The interactive model is designed for both the cloud and sensor nodes to optimize the resource consumption of physical sensors, as well as the bandwidth consumption of sensing traffic. In the model, the sensor-cloud plays a key role in aggregating application requests to minimize the workloads required for constrained physical nodes while guaranteeing that the requirements of all applications are satisfied. Physical sensor nodes perform their sensing under the guidance of the sensor-cloud. Based on the interactions with the sensor-cloud, physical sensor nodes adapt their scheduling accordingly to minimize their energy consumption. Comprehensive experimental results show that our proposed system achieves a significant improvement in terms of the energy consumption of physical sensors, the bandwidth consumption from the sink node to the sensor-cloud, the packet delivery latency, reliability and scalability, compared to current approaches. Based on the obtained results, we discuss the economical benefits and how the proposed system enables a win-win model in the sensor-cloud. PMID:27367689
An Efficient Interactive Model for On-Demand Sensing-As-A-Servicesof Sensor-Cloud.
Dinh, Thanh; Kim, Younghan
2016-06-28
This paper proposes an efficient interactive model for the sensor-cloud to enable the sensor-cloud to efficiently provide on-demand sensing services for multiple applications with different requirements at the same time. The interactive model is designed for both the cloud and sensor nodes to optimize the resource consumption of physical sensors, as well as the bandwidth consumption of sensing traffic. In the model, the sensor-cloud plays a key role in aggregating application requests to minimize the workloads required for constrained physical nodes while guaranteeing that the requirements of all applications are satisfied. Physical sensor nodes perform their sensing under the guidance of the sensor-cloud. Based on the interactions with the sensor-cloud, physical sensor nodes adapt their scheduling accordingly to minimize their energy consumption. Comprehensive experimental results show that our proposed system achieves a significant improvement in terms of the energy consumption of physical sensors, the bandwidth consumption from the sink node to the sensor-cloud, the packet delivery latency, reliability and scalability, compared to current approaches. Based on the obtained results, we discuss the economical benefits and how the proposed system enables a win-win model in the sensor-cloud.
Zhang, Ying; Liang, Jixing; Jiang, Shengming; Chen, Wei
2016-01-01
Due to their special environment, Underwater Wireless Sensor Networks (UWSNs) are usually deployed over a large sea area and the nodes are usually floating. This results in a lower beacon node distribution density, a longer time for localization, and more energy consumption. Currently most of the localization algorithms in this field do not pay enough consideration on the mobility of the nodes. In this paper, by analyzing the mobility patterns of water near the seashore, a localization method for UWSNs based on a Mobility Prediction and a Particle Swarm Optimization algorithm (MP-PSO) is proposed. In this method, the range-based PSO algorithm is used to locate the beacon nodes, and their velocities can be calculated. The velocity of an unknown node is calculated by using the spatial correlation of underwater object’s mobility, and then their locations can be predicted. The range-based PSO algorithm may cause considerable energy consumption and its computation complexity is a little bit high, nevertheless the number of beacon nodes is relatively smaller, so the calculation for the large number of unknown nodes is succinct, and this method can obviously decrease the energy consumption and time cost of localizing these mobile nodes. The simulation results indicate that this method has higher localization accuracy and better localization coverage rate compared with some other widely used localization methods in this field. PMID:26861348
Flexible wearable sensor nodes with solar energy harvesting.
Taiyang Wu; Arefin, Md Shamsul; Redoute, Jean-Michel; Yuce, Mehmet Rasit
2017-07-01
Wearable sensor nodes have gained a lot of attention during the past few years as they can monitor and record people's physical parameters in real time. Wearable sensor nodes can promote healthy lifestyles and prevent the occurrence of potential illness or injuries. This paper presents a flexible wearable sensor system powered by an efficient solar energy harvesting technique. It can measure the subject's heartbeats using a photoplethysmography (PPG) sensor and perform activity monitoring using an accelerometer. The solar energy harvester adopts an output current based maximum power point tracking (MPPT) algorithm, which controls the solar panel to operate within its high output power range. The power consumption of the flexible sensor nodes has been investigated under different operation conditions. Experimental results demonstrate that wearable sensor nodes can work for more than 12 hours when they are powered by the solar energy harvester for 3 hours in the bright sunlight.
Magnetic sensor nodes for enhanced situational awareness in urban settings
NASA Astrophysics Data System (ADS)
Trammell, Hoke; Shelby, Richard; Mathis, Kevin; Dalichaouch, Yacine; Kumar, Sankaran
2005-05-01
Military forces conducting urban operations are in need of non-line-of-sight sensor technologies for enhanced situational awareness. Disposable sensors ought to be able to detect and track targets through walls and within rooms in a building and relay that information in real-time to the soldier. We have recently developed magnetic sensor nodes aimed towards low cost, small size, low power consumption, and wireless communication. The current design uses a three-axis thin-film magnetoresistive sensor for low bandwidth B-field monitoring of magnetic targets such as vehicles and weapons carried by personnel. These sensor nodes are battery operated and use IEEE 802.15.4 communication link for control and data transmission. Power consumption during signal acquisition and communication is approximately 300 mW per channel. We will present and discuss node array performance, future node development and sensor fusion concepts.
Digital seismo-acoustic signal processing aboard a wireless sensor platform
NASA Astrophysics Data System (ADS)
Marcillo, O.; Johnson, J. B.; Lorincz, K.; Werner-Allen, G.; Welsh, M.
2006-12-01
We are developing a low power, low-cost wireless sensor array to conduct real-time signal processing of earthquakes at active volcanoes. The sensor array, which integrates data from both seismic and acoustic sensors, is based on Moteiv TMote Sky wireless sensor nodes (www.moteiv.com). The nodes feature a Texas Instruments MSP430 microcontroller, 48 Kbytes of program memory, 10 Kbytes of static RAM, 1 Mbyte of external flash memory, and a 2.4-GHz Chipcon CC2420 IEEE 802.15.4 radio. The TMote Sky is programmed in TinyOS. Basic signal processing occurs on an array of three peripheral sensor nodes. These nodes are tied into a dedicated GPS receiver node, which is focused on time synchronization, and a central communications node, which handles data integration and additional processing. The sensor nodes incorporate dual 12-bit digitizers sampling a seismic sensor and a pressure transducer at 100 samples per second. The wireless capabilities of the system allow flexible array geometry, with a maximum aperture of 200m. We have already developed the digital signal processing routines on board the Moteiv Tmote sensor nodes. The developed routines accomplish Real-time Seismic-Amplitude Measurement (RSAM), Seismic Spectral- Amplitude Measurement (SSAM), and a user-configured Short Term Averaging / Long Term Averaging (STA LTA ratio), which is used to calculate first arrivals. The processed data from individual nodes are transmitted back to a central node, where additional processing may be performed. Such processing will include back azimuth determination and other wave field analyses. Future on-board signal processing will focus on event characterization utilizing pattern recognition and spectral characterization. The processed data is intended as low bandwidth information which can be transmitted periodically and at low cost through satellite telemetry to a web server. The processing is limited by the computational capabilities (RAM, ROM) of the nodes. Nevertheless, we envision this product to be a useful tool for assessing the state of unrest at remote volcanoes.
IMHRP: Improved Multi-Hop Routing Protocol for Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Huang, Jianhua; Ruan, Danwei; Hong, Yadong; Zhao, Ziming; Zheng, Hong
2017-10-01
Wireless sensor network (WSN) is a self-organizing system formed by a large number of low-cost sensor nodes through wireless communication. Sensor nodes collect environmental information and transmit it to the base station (BS). Sensor nodes usually have very limited battery energy. The batteries cannot be charged or replaced. Therefore, it is necessary to design an energy efficient routing protocol to maximize the network lifetime. This paper presents an improved multi-hop routing protocol (IMHRP) for homogeneous networks. In the IMHRP protocol, based on the distances to the BS, the CH nodes are divided into internal CH nodes and external CH nodes. The set-up phase of the protocol is based on the LEACH protocol and the minimum distance between CH nodes are limited to a special constant distance, so a more uniform distribution of CH nodes is achieved. In the steady-state phase, the routes of different CH nodes are created on the basis of the distances between the CH nodes. The energy efficiency of communication can be maximized. The simulation results show that the proposed algorithm can more effectively reduce the energy consumption of each round and prolong the network lifetime compared with LEACH protocol and MHT protocol.
Nogami, Hirofumi; Arai, Shozo; Okada, Hironao; Zhan, Lan; Itoh, Toshihiro
2017-01-01
Monitoring rumen conditions in cows is important because a dysfunctional rumen system may cause death. Sub-acute ruminal acidosis (SARA) is a typical disease in cows, and is characterized by repeated periods of low ruminal pH. SARA is regarded as a trigger for rumen atony, rumenitis, and abomasal displacement, which may cause death. In previous studies, rumen conditions were evaluated by wireless sensor nodes with pH measurement capability. The primary advantage of the pH sensor is its ability to continuously measure ruminal pH. However, these sensor nodes have short lifetimes since they are limited by the finite volume of the internal liquid of the reference electrode. Mimicking rumen atony, we attempt to evaluate the rumen condition using wireless sensor nodes with three-axis accelerometers. The theoretical life span of such sensor nodes depends mainly on the transmission frequency of acceleration data and the size of the battery, and the proposed sensor nodes are 30.0 mm in diameter and 70.0 mm in length and have a life span of over 600 days. Using the sensor nodes, we compare the rumen motility of the force transducer measurement with the three-axis accelerometer data. As a result, we can detect discriminative movement of rumen atony. PMID:28346374
Nogami, Hirofumi; Arai, Shozo; Okada, Hironao; Zhan, Lan; Itoh, Toshihiro
2017-03-27
Monitoring rumen conditions in cows is important because a dysfunctional rumen system may cause death. Sub-acute ruminal acidosis (SARA) is a typical disease in cows, and is characterized by repeated periods of low ruminal pH. SARA is regarded as a trigger for rumen atony, rumenitis, and abomasal displacement, which may cause death. In previous studies, rumen conditions were evaluated by wireless sensor nodes with pH measurement capability. The primary advantage of the pH sensor is its ability to continuously measure ruminal pH. However, these sensor nodes have short lifetimes since they are limited by the finite volume of the internal liquid of the reference electrode. Mimicking rumen atony, we attempt to evaluate the rumen condition using wireless sensor nodes with three-axis accelerometers. The theoretical life span of such sensor nodes depends mainly on the transmission frequency of acceleration data and the size of the battery, and the proposed sensor nodes are 30.0 mm in diameter and 70.0 mm in length and have a life span of over 600 days. Using the sensor nodes, we compare the rumen motility of the force transducer measurement with the three-axis accelerometer data. As a result, we can detect discriminative movement of rumen atony.
Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo
2013-10-02
Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase.
Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo
2013-01-01
Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase. PMID:24152920
Wireless Sensor Networks - Node Localization for Various Industry Problems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Derr, Kurt; Manic, Milos
Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothingmore » (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.« less
Wireless Sensor Networks - Node Localization for Various Industry Problems
Derr, Kurt; Manic, Milos
2015-06-01
Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothingmore » (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.« less
Using LOTOS for Formalizing Wireless Sensor Network Applications
Rosa, Nelson Souto; Cunha, Paulo Roberto Freire
2007-01-01
The number of wireless sensor network (WSN) applications is rapidly increasing and becoming an integral part of sensor nodes. These applications have been widely developed on TinyOS operating system using the nesC programming language. However, due to the tight integration to physical world, limited node power and resources (CPU and memory) and complexity of combining components into an application, to build such applications is not a trivial task. In this context, we present an approach for treating with this complexity adopting a formal description technique, namely LOTOS, for formalising the WSN applications ‘behaviour. The formalisation has three main benefits: better understanding on how the application actually works, checking of desired properties of the application's behaviour, and simulation facilities. In order to illustrate the proposed approach, we apply it to two nesC traditional applications, namely BLink and Sense.
2017-03-01
A Low- Power Wireless Image Sensor Node with Noise-Robust Moving Object Detection and a Region-of-Interest Based Rate Controller Jong Hwan Ko...Atlanta, GA 30332 USA Contact Author Email: jonghwan.ko@gatech.edu Abstract: This paper presents a low- power wireless image sensor node for...present a low- power wireless image sensor node with a noise-robust moving object detection and region-of-interest based rate controller [Fig. 1]. The
Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges
Radi, Marjan; Dezfouli, Behnam; Bakar, Kamalrulnizam Abu; 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. PMID:22368490
Multipath routing in wireless sensor networks: survey and research challenges.
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.
Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility
Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios
2016-01-01
Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. PMID:27007373
Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility.
Akbar, Mariam; Javaid, Nadeem; Khan, Ayesha Hussain; Imran, Muhammad; Shoaib, Muhammad; Vasilakos, Athanasios
2016-03-19
Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability.
Game Theory Meets Wireless Sensor Networks Security Requirements and Threats Mitigation: A Survey
Abdalzaher, Mohamed S.; Seddik, Karim; Elsabrouty, Maha; Muta, Osamu; Furukawa, Hiroshi; Abdel-Rahman, Adel
2016-01-01
We present a study of using game theory for protecting wireless sensor networks (WSNs) from selfish behavior or malicious nodes. Due to scalability, low complexity and disseminated nature of WSNs, malicious attacks can be modeled effectively using game theory. In this study, we survey the different game-theoretic defense strategies for WSNs. We present a taxonomy of the game theory approaches based on the nature of the attack, whether it is caused by an external attacker or it is the result of an internal node acting selfishly or maliciously. We also present a general trust model using game theory for decision making. We, finally, identify the significant role of evolutionary games for WSNs security against intelligent attacks; then, we list several prospect applications of game theory to enhance the data trustworthiness and node cooperation in different WSNs. PMID:27367700
Energy-Efficient BOP-Based Beacon Transmission Scheduling in Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Kim, Eui-Jik; Youm, Sungkwan; Choi, Hyo-Hyun
Many applications in wireless sensor networks (WSNs) require the energy efficiency and scalability. Although IEEE 802.15.4/Zigbee which is being considered as general technology for WSNs enables the low duty-cycling with time synchronization of all the nodes in network, it still suffer from its low scalability due to the beacon frame collision. Recently, various algorithms to resolve this problem are proposed. However, their manners to implement are somewhat ambiguous and the degradation of energy/communication efficiency is serious by the additional overhead. This paper describes an Energy-efficient BOP-based Beacon transmission Scheduling (EBBS) algorithm. EBBS is the centralized approach, in which a resource-sufficient node called as Topology Management Center (TMC) allocates the time slots to transmit a beacon frame to the nodes and manages the active/sleep schedules of them. We also propose EBBS with Adaptive BOPL (EBBS-AB), to adjust the duration to transmit beacon frames in every beacon interval, adaptively. Simulation results show that by using the proposed algorithm, the energy efficiency and the throughput of whole network can be significantly improved. EBBS-AB is also more effective for the network performance when the nodes are uniformly deployed on the sensor field rather than the case of random topologies.
Cluster-based adaptive power control protocol using Hidden Markov Model for Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Vinutha, C. B.; Nalini, N.; Nagaraja, M.
2017-06-01
This paper presents strategies for an efficient and dynamic transmission power control technique, in order to reduce packet drop and hence energy consumption of power-hungry sensor nodes operated in highly non-linear channel conditions of Wireless Sensor Networks. Besides, we also focus to prolong network lifetime and scalability by designing cluster-based network structure. Specifically we consider weight-based clustering approach wherein, minimum significant node is chosen as Cluster Head (CH) which is computed stemmed from the factors distance, remaining residual battery power and received signal strength (RSS). Further, transmission power control schemes to fit into dynamic channel conditions are meticulously implemented using Hidden Markov Model (HMM) where probability transition matrix is formulated based on the observed RSS measurements. Typically, CH estimates initial transmission power of its cluster members (CMs) from RSS using HMM and broadcast this value to its CMs for initialising their power value. Further, if CH finds that there are variations in link quality and RSS of the CMs, it again re-computes and optimises the transmission power level of the nodes using HMM to avoid packet loss due noise interference. We have demonstrated our simulation results to prove that our technique efficiently controls the power levels of sensing nodes to save significant quantity of energy for different sized network.
Video sensor architecture for surveillance applications.
Sánchez, Jordi; Benet, Ginés; Simó, José E
2012-01-01
This paper introduces a flexible hardware and software architecture for a smart video sensor. This sensor has been applied in a video surveillance application where some of these video sensors are deployed, constituting the sensory nodes of a distributed surveillance system. In this system, a video sensor node processes images locally in order to extract objects of interest, and classify them. The sensor node reports the processing results to other nodes in the cloud (a user or higher level software) in the form of an XML description. The hardware architecture of each sensor node has been developed using two DSP processors and an FPGA that controls, in a flexible way, the interconnection among processors and the image data flow. The developed node software is based on pluggable components and runs on a provided execution run-time. Some basic and application-specific software components have been developed, in particular: acquisition, segmentation, labeling, tracking, classification and feature extraction. Preliminary results demonstrate that the system can achieve up to 7.5 frames per second in the worst case, and the true positive rates in the classification of objects are better than 80%.
Video Sensor Architecture for Surveillance Applications
Sánchez, Jordi; Benet, Ginés; Simó, José E.
2012-01-01
This paper introduces a flexible hardware and software architecture for a smart video sensor. This sensor has been applied in a video surveillance application where some of these video sensors are deployed, constituting the sensory nodes of a distributed surveillance system. In this system, a video sensor node processes images locally in order to extract objects of interest, and classify them. The sensor node reports the processing results to other nodes in the cloud (a user or higher level software) in the form of an XML description. The hardware architecture of each sensor node has been developed using two DSP processors and an FPGA that controls, in a flexible way, the interconnection among processors and the image data flow. The developed node software is based on pluggable components and runs on a provided execution run-time. Some basic and application-specific software components have been developed, in particular: acquisition, segmentation, labeling, tracking, classification and feature extraction. Preliminary results demonstrate that the system can achieve up to 7.5 frames per second in the worst case, and the true positive rates in the classification of objects are better than 80%. PMID:22438723
NASA Technical Reports Server (NTRS)
Halyo, Nesim; Choi, Sang H.; Chrisman, Dan A., Jr.; Samms, Richard W.
1987-01-01
Dynamic models and computer simulations were developed for the radiometric sensors utilized in the Earth Radiation Budget Experiment (ERBE). The models were developed to understand performance, improve measurement accuracy by updating model parameters and provide the constants needed for the count conversion algorithms. Model simulations were compared with the sensor's actual responses demonstrated in the ground and inflight calibrations. The models consider thermal and radiative exchange effects, surface specularity, spectral dependence of a filter, radiative interactions among an enclosure's nodes, partial specular and diffuse enclosure surface characteristics and steady-state and transient sensor responses. Relatively few sensor nodes were chosen for the models since there is an accuracy tradeoff between increasing the number of nodes and approximating parameters such as the sensor's size, material properties, geometry, and enclosure surface characteristics. Given that the temperature gradients within a node and between nodes are small enough, approximating with only a few nodes does not jeopardize the accuracy required to perform the parameter estimates and error analyses.
Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng
2016-01-01
In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network. PMID:27754405
Shi, Binbin; Wei, Wei; Wang, Yihuai; Shu, Wanneng
2016-10-14
In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network.
Time Series Analysis for Spatial Node Selection in Environment Monitoring Sensor Networks
Bhandari, Siddhartha; Jurdak, Raja; Kusy, Branislav
2017-01-01
Wireless sensor networks are widely used in environmental monitoring. The number of sensor nodes to be deployed will vary depending on the desired spatio-temporal resolution. Selecting an optimal number, position and sampling rate for an array of sensor nodes in environmental monitoring is a challenging question. Most of the current solutions are either theoretical or simulation-based where the problems are tackled using random field theory, computational geometry or computer simulations, limiting their specificity to a given sensor deployment. Using an empirical dataset from a mine rehabilitation monitoring sensor network, this work proposes a data-driven approach where co-integrated time series analysis is used to select the number of sensors from a short-term deployment of a larger set of potential node positions. Analyses conducted on temperature time series show 75% of sensors are co-integrated. Using only 25% of the original nodes can generate a complete dataset within a 0.5 °C average error bound. Our data-driven approach to sensor position selection is applicable for spatiotemporal monitoring of spatially correlated environmental parameters to minimize deployment cost without compromising data resolution. PMID:29271880
An Integrated Intrusion Detection Model of Cluster-Based Wireless Sensor Network
Sun, Xuemei; Yan, Bo; Zhang, Xinzhong; Rong, Chuitian
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 Sink node. Plenty of simulation demonstrates that this integrated model has a strong performance of intrusion detection. PMID:26447696
An Integrated Intrusion Detection Model of Cluster-Based Wireless Sensor Network.
Sun, Xuemei; Yan, Bo; Zhang, Xinzhong; Rong, Chuitian
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 Sink node. Plenty of simulation demonstrates that this integrated model has a strong performance of intrusion detection.
Distributed estimation of sensors position in underwater wireless sensor network
NASA Astrophysics Data System (ADS)
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.
A Novel Deployment Scheme Based on Three-Dimensional Coverage Model for Wireless Sensor Networks
Xiao, Fu; Yang, Yang; Wang, Ruchuan; Sun, Lijuan
2014-01-01
Coverage pattern and deployment strategy are directly related to the optimum allocation of limited resources for wireless sensor networks, such as energy of nodes, communication bandwidth, and computing power, and quality improvement is largely determined by these for wireless sensor networks. A three-dimensional coverage pattern and deployment scheme are proposed in this paper. Firstly, by analyzing the regular polyhedron models in three-dimensional scene, a coverage pattern based on cuboids is proposed, and then relationship between coverage and sensor nodes' radius is deduced; also the minimum number of sensor nodes to maintain network area's full coverage is calculated. At last, sensor nodes are deployed according to the coverage pattern after the monitor area is subdivided into finite 3D grid. Experimental results show that, compared with traditional random method, sensor nodes number is reduced effectively while coverage rate of monitor area is ensured using our coverage pattern and deterministic deployment scheme. PMID:25045747
NASA Astrophysics Data System (ADS)
Kerkez, B.; Rice, R.; Glaser, S. D.; Bales, R. C.; Saksa, P. C.
2010-12-01
A 100-node wireless sensor network (WSN) was designed for the purpose of monitoring snow depth in two watersheds, spanning 3 km2 in the American River basin, in the central Sierra Nevada of California. The network will be deployed as a prototype project that will become a core element of a larger water information system for the Sierra Nevada. The site conditions range from mid-elevation forested areas to sub-alpine terrain with light forest cover. Extreme temperature and humidity fluctuations, along with heavy rain and snowfall events, create particularly challenging conditions for wireless communications. We show how statistics gathered from a previously deployed 60-node WSN, located in the Southern Sierra Critical Zone Observatory, were used to inform design. We adapted robust network hardware, manufactured by Dust Networks for highly demanding industrial monitoring, and added linear amplifiers to the radios to improve transmission distances. We also designed a custom data-logging board to interface the WSN hardware with snow-depth sensors. Due to the large distance between sensing locations, and complexity of terrain, we analyzed network statistics to select the location of repeater nodes, to create a redundant and reliable mesh. This optimized network topology will maximize transmission distances, while ensuring power-efficient network operations throughout harsh winter conditions. At least 30 of the 100 nodes will actively sense snow depth, while the remainder will act as sensor-ready repeaters in the mesh. Data from a previously conducted snow survey was used to create a Gaussian Process model of snow depth; variance estimates produced by this model were used to suggest near-optimal locations for snow-depth sensors to measure the variability across a 1 km2 grid. We compare the locations selected by the sensor placement algorithm to those made through expert opinion, and offer explanations for differences resulting from each approach.
From Micro to Nano: The Evolution of Wireless Sensor-Based Health Care.
Sarkar, Subhadeep; Misra, Sudip
2016-01-01
Over the past decade, embedded systems and microelectromechanical systems have evolved in a radical way, redefining our standard of living and enhancing the quality of life. Health care, among various other fields, has benefited vastly from this technological development. The concept of using sensors for health care purposes originated in the late 1980s when sensors were developed to measure certain physiological parameters associated with the human body. In traditional sensor nodes, the signal sources are mostly different environmental phenomena (such as temperature, vibration, and luminosity) or man-made events (such as intrusion and mobile target tracking), whereas in case of the physiological sensors, the signal source is living human tissue. These sensor nodes, as their primary sensing element, have a diaphragm that converts pressure into displacement. This displacement, in turn, is subsequently transformed into an electrical signal. The concept of wireless physiological sensor nodes, however, gained popularity in the mid-2000s, with the sensed data from the nodes transmitted to the hub via a wireless medium. The network formed by this heterogeneous set of wireless body sensor nodes is termed a wireless body-area network (WBAN). Each WBAN is essentially a composition of multiple wireless body sensor nodes and a single hub. The hub is primarily responsible for acquisition of the raw sensed data from all the component sensor nodes and first-level aggregation of the data before transmitting the aggregated data for further analysis to a remote data acquisition center. Here, we outline the evolution of WBANs in the context of modern health care and its convergence with nanotechnology.
Khan, Anwar; Ahmedy, Ismail; Anisi, Mohammad Hossein; Javaid, Nadeem; Ali, Ihsan; Khan, Nawsher; Alsaqer, Mohammed; Mahmood, Hasan
2018-01-09
Interference and energy holes formation in underwater wireless sensor networks (UWSNs) threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM) routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay.
Active Low Intrusion Hybrid Monitor for Wireless Sensor Networks
Navia, Marlon; Campelo, Jose C.; Bonastre, Alberto; Ors, Rafael; Capella, Juan V.; Serrano, Juan J.
2015-01-01
Several systems have been proposed to monitor wireless sensor networks (WSN). These systems may be active (causing a high degree of intrusion) or passive (low observability inside the nodes). This paper presents the implementation of an active hybrid (hardware and software) monitor with low intrusion. It is based on the addition to the sensor node of a monitor node (hardware part) which, through a standard interface, is able to receive the monitoring information sent by a piece of software executed in the sensor node. The intrusion on time, code, and energy caused in the sensor nodes by the monitor is evaluated as a function of data size and the interface used. Then different interfaces, commonly available in sensor nodes, are evaluated: serial transmission (USART), serial peripheral interface (SPI), and parallel. The proposed hybrid monitor provides highly detailed information, barely disturbed by the measurement tool (interference), about the behavior of the WSN that may be used to evaluate many properties such as performance, dependability, security, etc. Monitor nodes are self-powered and may be removed after the monitoring campaign to be reused in other campaigns and/or WSNs. No other hardware-independent monitoring platforms with such low interference have been found in the literature. PMID:26393604
Khan, Anwar; Anisi, Mohammad Hossein; Javaid, Nadeem; Khan, Nawsher; Alsaqer, Mohammed; Mahmood, Hasan
2018-01-01
Interference and energy holes formation in underwater wireless sensor networks (UWSNs) threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM) routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay. PMID:29315247
Enhancing the Reliability of Head Nodes in Underwater Sensor Networks
Min, Hong; Cho, Yookun; Heo, Junyoung
2012-01-01
Underwater environments are quite different from terrestrial environments in terms of the communication media and operating conditions associated with those environments. In underwater sensor networks, the probability of node failure is high because sensor nodes are deployed in harsher environments than ground-based networks. The sensor nodes are surrounded by salt water and moved around by waves and currents. Many studies have focused on underwater communication environments in an effort to improve the data transmission throughput. In this paper, we present a checkpointing scheme for the head nodes to quickly recover from a head node failure. Experimental results show that the proposed scheme enhances the reliability of the networks and makes them more efficient in terms of energy consumption and the recovery latency compared to the previous scheme without checkpointing. PMID:22438707
Trust index based fault tolerant multiple event localization algorithm for WSNs.
Xu, Xianghua; Gao, Xueyong; Wan, Jian; Xiong, Naixue
2011-01-01
This paper investigates the use of wireless sensor networks for multiple event source localization using binary information from the sensor nodes. The events could continually emit signals whose strength is attenuated inversely proportional to the distance from the source. In this context, faults occur due to various reasons and are manifested when a node reports a wrong decision. In order to reduce the impact of node faults on the accuracy of multiple event localization, we introduce a trust index model to evaluate the fidelity of information which the nodes report and use in the event detection process, and propose the Trust Index based Subtract on Negative Add on Positive (TISNAP) localization algorithm, which reduces the impact of faulty nodes on the event localization by decreasing their trust index, to improve the accuracy of event localization and performance of fault tolerance for multiple event source localization. The algorithm includes three phases: first, the sink identifies the cluster nodes to determine the number of events occurred in the entire region by analyzing the binary data reported by all nodes; then, it constructs the likelihood matrix related to the cluster nodes and estimates the location of all events according to the alarmed status and trust index of the nodes around the cluster nodes. Finally, the sink updates the trust index of all nodes according to the fidelity of their information in the previous reporting cycle. The algorithm improves the accuracy of localization and performance of fault tolerance in multiple event source localization. The experiment results show that when the probability of node fault is close to 50%, the algorithm can still accurately determine the number of the events and have better accuracy of localization compared with other algorithms.
Trust Index Based Fault Tolerant Multiple Event Localization Algorithm for WSNs
Xu, Xianghua; Gao, Xueyong; Wan, Jian; Xiong, Naixue
2011-01-01
This paper investigates the use of wireless sensor networks for multiple event source localization using binary information from the sensor nodes. The events could continually emit signals whose strength is attenuated inversely proportional to the distance from the source. In this context, faults occur due to various reasons and are manifested when a node reports a wrong decision. In order to reduce the impact of node faults on the accuracy of multiple event localization, we introduce a trust index model to evaluate the fidelity of information which the nodes report and use in the event detection process, and propose the Trust Index based Subtract on Negative Add on Positive (TISNAP) localization algorithm, which reduces the impact of faulty nodes on the event localization by decreasing their trust index, to improve the accuracy of event localization and performance of fault tolerance for multiple event source localization. The algorithm includes three phases: first, the sink identifies the cluster nodes to determine the number of events occurred in the entire region by analyzing the binary data reported by all nodes; then, it constructs the likelihood matrix related to the cluster nodes and estimates the location of all events according to the alarmed status and trust index of the nodes around the cluster nodes. Finally, the sink updates the trust index of all nodes according to the fidelity of their information in the previous reporting cycle. The algorithm improves the accuracy of localization and performance of fault tolerance in multiple event source localization. The experiment results show that when the probability of node fault is close to 50%, the algorithm can still accurately determine the number of the events and have better accuracy of localization compared with other algorithms. PMID:22163972
Yu, Shidi; Liu, Xiao; Liu, Anfeng; Xiong, Naixue; Cai, Zhiping; Wang, Tian
2018-05-10
Due to the Software Defined Network (SDN) technology, Wireless Sensor Networks (WSNs) are getting wider application prospects for sensor nodes that can get new functions after updating program codes. The issue of disseminating program codes to every node in the network with minimum delay and energy consumption have been formulated and investigated in the literature. The minimum-transmission broadcast (MTB) problem, which aims to reduce broadcast redundancy, has been well studied in WSNs where the broadcast radius is assumed to be fixed in the whole network. In this paper, an Adaption Broadcast Radius-based Code Dissemination (ABRCD) scheme is proposed to reduce delay and improve energy efficiency in duty cycle-based WSNs. In the ABCRD scheme, a larger broadcast radius is set in areas with more energy left, generating more optimized performance than previous schemes. Thus: (1) with a larger broadcast radius, program codes can reach the edge of network from the source in fewer hops, decreasing the number of broadcasts and at the same time, delay. (2) As the ABRCD scheme adopts a larger broadcast radius for some nodes, program codes can be transmitted to more nodes in one broadcast transmission, diminishing the number of broadcasts. (3) The larger radius in the ABRCD scheme causes more energy consumption of some transmitting nodes, but radius enlarging is only conducted in areas with an energy surplus, and energy consumption in the hot-spots can be reduced instead due to some nodes transmitting data directly to sink without forwarding by nodes in the original hot-spot, thus energy consumption can almost reach a balance and network lifetime can be prolonged. The proposed ABRCD scheme first assigns a broadcast radius, which doesn’t affect the network lifetime, to nodes having different distance to the code source, then provides an algorithm to construct a broadcast backbone. In the end, a comprehensive performance analysis and simulation result shows that the proposed ABRCD scheme shows better performance in different broadcast situations. Compared to previous schemes, the transmission delay is reduced by 41.11~78.42%, the number of broadcasts is reduced by 36.18~94.27% and the energy utilization ratio is improved up to 583.42%, while the network lifetime can be prolonged up to 274.99%.
An Adaption Broadcast Radius-Based Code Dissemination Scheme for Low Energy Wireless Sensor Networks
Yu, Shidi; Liu, Xiao; Cai, Zhiping; Wang, Tian
2018-01-01
Due to the Software Defined Network (SDN) technology, Wireless Sensor Networks (WSNs) are getting wider application prospects for sensor nodes that can get new functions after updating program codes. The issue of disseminating program codes to every node in the network with minimum delay and energy consumption have been formulated and investigated in the literature. The minimum-transmission broadcast (MTB) problem, which aims to reduce broadcast redundancy, has been well studied in WSNs where the broadcast radius is assumed to be fixed in the whole network. In this paper, an Adaption Broadcast Radius-based Code Dissemination (ABRCD) scheme is proposed to reduce delay and improve energy efficiency in duty cycle-based WSNs. In the ABCRD scheme, a larger broadcast radius is set in areas with more energy left, generating more optimized performance than previous schemes. Thus: (1) with a larger broadcast radius, program codes can reach the edge of network from the source in fewer hops, decreasing the number of broadcasts and at the same time, delay. (2) As the ABRCD scheme adopts a larger broadcast radius for some nodes, program codes can be transmitted to more nodes in one broadcast transmission, diminishing the number of broadcasts. (3) The larger radius in the ABRCD scheme causes more energy consumption of some transmitting nodes, but radius enlarging is only conducted in areas with an energy surplus, and energy consumption in the hot-spots can be reduced instead due to some nodes transmitting data directly to sink without forwarding by nodes in the original hot-spot, thus energy consumption can almost reach a balance and network lifetime can be prolonged. The proposed ABRCD scheme first assigns a broadcast radius, which doesn’t affect the network lifetime, to nodes having different distance to the code source, then provides an algorithm to construct a broadcast backbone. In the end, a comprehensive performance analysis and simulation result shows that the proposed ABRCD scheme shows better performance in different broadcast situations. Compared to previous schemes, the transmission delay is reduced by 41.11~78.42%, the number of broadcasts is reduced by 36.18~94.27% and the energy utilization ratio is improved up to 583.42%, while the network lifetime can be prolonged up to 274.99%. PMID:29748525
Energy efficient sensor network implementations
DOE Office of Scientific and Technical Information (OSTI.GOV)
Frigo, Janette R; Raby, Eric Y; Brennan, Sean M
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.more » We report performance and total energy usage for our system implementations and discuss the system architecture design trade offs.« less
Empowering smartphone users with sensor node for air quality measurement
NASA Astrophysics Data System (ADS)
Oletic, Dinko; Bilas, Vedran
2013-06-01
We present an architecture of a sensor node developed for use with smartphones for participatory sensing of air quality in urban environments. Our solution features inexpensive metal-oxide semiconductor gas sensors (MOX) for measurement of CO, O3, NO2 and VOC, along with sensors for ambient temperature and humidity. We focus on our design of sensor interface consisting of power-regulated heater temperature control, and the design of resistance sensing circuit. Accuracy of the sensor interface is characterized. Power consumption of the sensor node is analysed. Preliminary data obtained from the CO gas sensors in laboratory conditions and during the outdoor field-test is shown.
A self-optimizing scheme for energy balanced routing in Wireless Sensor Networks using SensorAnt.
Shamsan Saleh, Ahmed M; Ali, Borhanuddin Mohd; Rasid, Mohd Fadlee A; Ismail, Alyani
2012-01-01
Planning of energy-efficient protocols is critical for Wireless Sensor Networks (WSNs) because of the constraints on the sensor nodes' energy. The routing protocol should be able to provide uniform power dissipation during transmission to the sink node. In this paper, we present a self-optimization scheme for WSNs which is able to utilize and optimize the sensor nodes' resources, especially the batteries, to achieve balanced energy consumption across all sensor nodes. This method is based on the Ant Colony Optimization (ACO) metaheuristic which is adopted to enhance the paths with the best quality function. The assessment of this function depends on multi-criteria metrics such as the minimum residual battery power, hop count and average energy of both route and network. This method also distributes the traffic load of sensor nodes throughout the WSN leading to reduced energy usage, extended network life time and reduced packet loss. Simulation results show that our scheme performs much better than the Energy Efficient Ant-Based Routing (EEABR) in terms of energy consumption, balancing and efficiency.
An Energy Centric Cluster-Based Routing Protocol for Wireless Sensor Networks.
Hosen, A S M Sanwar; Cho, Gi Hwan
2018-05-11
Clustering is an effective way to prolong the lifetime of a wireless sensor network (WSN). The common approach is to elect cluster heads to take routing and controlling duty, and to periodically rotate each cluster head's role to distribute energy consumption among nodes. However, a significant amount of energy dissipates due to control messages overhead, which results in a shorter network lifetime. This paper proposes an energy-centric cluster-based routing mechanism in WSNs. To begin with, cluster heads are elected based on the higher ranks of the nodes. The rank is defined by residual energy and average distance from the member nodes. With the role of data aggregation and data forwarding, a cluster head acts as a caretaker for cluster-head election in the next round, where the ranks' information are piggybacked along with the local data sending during intra-cluster communication. This reduces the number of control messages for the cluster-head election as well as the cluster formation in detail. Simulation results show that our proposed protocol saves the energy consumption among nodes and achieves a significant improvement in the network lifetime.
An Energy Centric Cluster-Based Routing Protocol for Wireless Sensor Networks
Hosen, A. S. M. Sanwar; Cho, Gi Hwan
2018-01-01
Clustering is an effective way to prolong the lifetime of a wireless sensor network (WSN). The common approach is to elect cluster heads to take routing and controlling duty, and to periodically rotate each cluster head’s role to distribute energy consumption among nodes. However, a significant amount of energy dissipates due to control messages overhead, which results in a shorter network lifetime. This paper proposes an energy-centric cluster-based routing mechanism in WSNs. To begin with, cluster heads are elected based on the higher ranks of the nodes. The rank is defined by residual energy and average distance from the member nodes. With the role of data aggregation and data forwarding, a cluster head acts as a caretaker for cluster-head election in the next round, where the ranks’ information are piggybacked along with the local data sending during intra-cluster communication. This reduces the number of control messages for the cluster-head election as well as the cluster formation in detail. Simulation results show that our proposed protocol saves the energy consumption among nodes and achieves a significant improvement in the network lifetime. PMID:29751663
A Trustworthy Key Generation Prototype Based on DDR3 PUF for Wireless Sensor Networks
Liu, Wenchao; Zhang, Zhenhua; Li, Miaoxin; Liu, Zhenglin
2014-01-01
Secret key leakage in wireless sensor networks (WSNs) is a high security risk especially when sensor nodes are deployed in hostile environment and physically accessible to attackers. With nowadays semi/fully-invasive attack techniques attackers can directly derive the cryptographic key from non-volatile memory (NVM) storage. Physically Unclonable Function (PUF) is a promising technology to resist node capture attacks, and it also provides a low cost and tamper-resistant key provisioning solution. In this paper, we designed a PUF based on double-data-rate SDRAM Type 3 (DDR3) memory by exploring its memory decay characteristics. We also described a prototype of 128-bit key generation based on DDR3 PUF with integrated fuzzy extractor. Due to the wide adoption of DDR3 memory in WSN, our proposed DDR3 PUF technology with high security levels and no required hardware changes is suitable for a wide range of WSN applications. PMID:24984058
Jiang, Joe-Air; Chuang, Cheng-Long; Lin, Tzu-Shiang; Chen, Chia-Pang; Hung, Chih-Hung; Wang, Jiing-Yi; Liu, Chang-Wang; Lai, Tzu-Yun
2010-01-01
In recent years, various received signal strength (RSS)-based localization estimation approaches for wireless sensor networks (WSNs) have been proposed. RSS-based localization is regarded as a low-cost solution for many location-aware applications in WSNs. In previous studies, the radiation patterns of all sensor nodes are assumed to be spherical, which is an oversimplification of the radio propagation model in practical applications. In this study, we present an RSS-based cooperative localization method that estimates unknown coordinates of sensor nodes in a network. Arrangement of two external low-cost omnidirectional dipole antennas is developed by using the distance-power gradient model. A modified robust regression is also proposed to determine the relative azimuth and distance between a sensor node and a fixed reference node. In addition, a cooperative localization scheme that incorporates estimations from multiple fixed reference nodes is presented to improve the accuracy of the localization. The proposed method is tested via computer-based analysis and field test. Experimental results demonstrate that the proposed low-cost method is a useful solution for localizing sensor nodes in unknown or changing environments.
Sánchez-Álvarez, David; Rodríguez-Pérez, Francisco-Javier
2018-01-01
In this paper, we present a work based on the computational load distribution among the homogeneous nodes and the Hub/Sink of Wireless Sensor Networks (WSNs). The main contribution of the paper is an early decision support framework helping WSN designers to take decisions about computational load distribution for those WSNs where power consumption is a key issue (when we refer to “framework” in this work, we are considering it as a support tool to make decisions where the executive judgment can be included along with the set of mathematical tools of the WSN designer; this work shows the need to include the load distribution as an integral component of the WSN system for making early decisions regarding energy consumption). The framework takes advantage of the idea that balancing sensors nodes and Hub/Sink computational load can lead to improved energy consumption for the whole or at least the battery-powered nodes of the WSN. The approach is not trivial and it takes into account related issues such as the required data distribution, nodes, and Hub/Sink connectivity and availability due to their connectivity features and duty-cycle. For a practical demonstration, the proposed framework is applied to an agriculture case study, a sector very relevant in our region. In this kind of rural context, distances, low costs due to vegetable selling prices and the lack of continuous power supplies may lead to viable or inviable sensing solutions for the farmers. The proposed framework systematize and facilitates WSN designers the required complex calculations taking into account the most relevant variables regarding power consumption, avoiding full/partial/prototype implementations, and measurements of different computational load distribution potential solutions for a specific WSN. PMID:29570645
Directed Diffusion Modelling for Tesso Nilo National Parks Case Study
NASA Astrophysics Data System (ADS)
Yasri, Indra; Safrianti, Ery
2018-01-01
— Directed Diffusion (DD has ability to achieve energy efficiency in Wireless Sensor Network (WSN). This paper proposes Directed Diffusion (DD) modelling for Tesso Nilo National Parks (TNNP) case study. There are 4 stages of scenarios involved in this modelling. It’s started by appointing of sampling area through GPS coordinate. The sampling area is determined by optimization processes from 500m x 500m up to 1000m x 1000m with 100m increment in between. The next stage is sensor node placement. Sensor node is distributed in sampling area with three different quantities i.e. 20 nodes, 30 nodes and 40 nodes. One of those quantities is choose as an optimized sensor node placement. The third stage is to implement all scenarios in stages 1 and stages 2 on DD modelling. In the last stage, the evaluation process to achieve most energy efficient in the combination of optimized sampling area and optimized sensor node placement on Direct Diffusion (DD) routing protocol. The result shows combination between sampling area 500m x 500m and 20 nodes able to achieve energy efficient to support a forest preventive fire system at Tesso Nilo National Parks.
Delay-tolerant mobile network protocol for rice field monitoring using wireless sensor networks
NASA Astrophysics Data System (ADS)
Guitton, Alexandre; Andres, Frédéric; Cardoso, Jarbas Lopes; Kawtrakul, Asanee; Barbin, Silvio E.
2015-10-01
The monitoring of rice fields can improve productivity by helping farmers throughout the rice cultivation cycle, on various issues: when to harvest, when to treat the crops against disease, when to increase the water level, how to share observations and decisions made in a collaborative way, etc. In this paper, we propose an architecture to monitor a rice field by a wireless sensor network. Our architecture is based on static sensor nodes forming a disconnected network, and mobile nodes communicating with the sensor nodes in a delay-tolerant manner. The data collected by the static sensor nodes are transmitted to mobile nodes, which in turn transmit them to a gateway, connected to a database, for further analysis. We focus on the related architecture, as well as on the energy-efficient protocols intended to perform the data collection.
An agenda-based routing protocol in delay tolerant mobile sensor networks.
Wang, Xiao-Min; Zhu, Jin-Qi; Liu, Ming; Gong, Hai-Gang
2010-01-01
Routing in delay tolerant mobile sensor networks (DTMSNs) is challenging due to the networks' intermittent connectivity. Most existing routing protocols for DTMSNs use simplistic random mobility models for algorithm design and performance evaluation. In the real world, however, due to the unique characteristics of human mobility, currently existing random mobility models may not work well in environments where mobile sensor units are carried (such as DTMSNs). Taking a person's social activities into consideration, in this paper, we seek to improve DTMSN routing in terms of social structure and propose an agenda based routing protocol (ARP). In ARP, humans are classified based on their agendas and data transmission is made according to sensor nodes' transmission rankings. The effectiveness of ARP is demonstrated through comprehensive simulation studies.
Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks.
Li, Xing; Chen, Dexin; Li, Chunyan; Wang, Liangmin
2015-07-03
With the rapid development of wireless communication technology, sensor technology, information acquisition and processing technology, sensor networks will finally have a deep influence on all aspects of people's lives. The battery resources of sensor nodes should be managed efficiently in order to prolong network lifetime in large-scale wireless sensor networks (LWSNs). Data aggregation represents an important method to remove redundancy as well as unnecessary data transmission and hence cut down the energy used in communication. As sensor nodes are deployed in hostile environments, the security of the sensitive information such as confidentiality and integrity should be considered. This paper proposes Fully homomorphic Encryption based Secure data Aggregation (FESA) in LWSNs which can protect end-to-end data confidentiality and support arbitrary aggregation operations over encrypted data. In addition, by utilizing message authentication codes (MACs), this scheme can also verify data integrity during data aggregation and forwarding processes so that false data can be detected as early as possible. Although the FHE increase the computation overhead due to its large public key size, simulation results show that it is implementable in LWSNs and performs well. Compared with other protocols, the transmitted data and network overhead are reduced in our scheme.
Multiport Circular Polarized RFID-Tag Antenna for UHF Sensor Applications.
Zaid, Jamal; Abdulhadi, Abdulhadi; Kesavan, Arun; Belaizi, Yassin; Denidni, Tayeb A
2017-07-05
A circular polarized patch antenna for UHF RFID tag-based sensor applications is presented, with the circular polarization (CP) generated by a new antenna shape, an asymmetric stars shaped slotted microstrip patch antenna (CP-ASSSMP). Four stars etched on the patch allow the antenna's size to be reduced by close to 20%. The proposed antenna is matched with two RFID chips via inductive-loop matching. The first chip is connected to a resistive sensor and acts as a sensor node, and the second is used as a reference node. The proposed antenna is used for two targets, serving as both reference and sensor simultaneously, thereby eliminating the need for a second antenna. Its reader can read the RFID chips at any orientation of the tag due to the CP. The measured reading range is about 25 m with mismatch polarization. The operating frequency band is 902-929 MHz for the two ports, which is covered by the US RFID band, and the axial-ratio bandwidth is about 7 MHz. In addition, the reader can also detect temperature, based on the minimum difference in the power required by the reference and sensor.
Multiport Circular Polarized RFID-Tag Antenna for UHF Sensor Applications
Zaid, Jamal; Abdulhadi, Abdulhadi; Kesavan, Arun; Belaizi, Yassin; Denidni, Tayeb A.
2017-01-01
A circular polarized patch antenna for UHF RFID tag-based sensor applications is presented, with the circular polarization (CP) generated by a new antenna shape, an asymmetric stars shaped slotted microstrip patch antenna (CP-ASSSMP). Four stars etched on the patch allow the antenna’s size to be reduced by close to 20%. The proposed antenna is matched with two RFID chips via inductive-loop matching. The first chip is connected to a resistive sensor and acts as a sensor node, and the second is used as a reference node. The proposed antenna is used for two targets, serving as both reference and sensor simultaneously, thereby eliminating the need for a second antenna. Its reader can read the RFID chips at any orientation of the tag due to the CP. The measured reading range is about 25 m with mismatch polarization. The operating frequency band is 902–929 MHz for the two ports, which is covered by the US RFID band, and the axial-ratio bandwidth is about 7 MHz. In addition, the reader can also detect temperature, based on the minimum difference in the power required by the reference and sensor. PMID:28678178
Wireless sensor node for detection of freight train derailment
NASA Astrophysics Data System (ADS)
Costa, Andrea; Milani, Damiano; Resta, Ferruccio; Tomasini, Gisella
2016-04-01
The target of the research activity presented in this paper is to design, to realize and to test an autonomous sensor node able to measure the accelerations in correspondence of the axle box of a freight train. The final goal of the sensor is to identify the derailment conditions by observing the variations in the spectra of the box accelerations, around the frequencies associated to the wheel revolution and its multiples. The sensor node embeds an accelerometer, a microprocessor, a transmission system, a piezoelectric bimorph energy harvester and an integrated circuit for managing the power distribution to each component of the node. In particular, a mechanical filter to be applied to the node was specifically designed to increment the energy recovered by the harvester and to filter out the high frequency components of the axle-box acceleration, allowing the use of a more sensitive accelerometer. The harvesting system was setup by means of laboratory tests carried out with an electromechanical shaker and the sensor node was finally tested through field tests on freight trains.
Parasuraman, Ramviyas; Fabry, Thomas; Molinari, Luca; Kershaw, Keith; Di Castro, Mario; Masi, Alessandro; Ferre, Manuel
2014-12-12
The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS). When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities), there is a possibility that some electronic components may fail randomly (due to radiation effects), which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the "server-relay-client" framework that uses (multiple) relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO) algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide redundant networking abilities. We use pre-processing techniques, such as exponential moving averaging and spatial averaging filters on the RSS data for smoothing. We apply a receiver spatial diversity concept and employ a position controller on the relay node using a stochastic gradient ascent method for self-positioning the relay node to achieve the RSS balancing task. The effectiveness of the proposed solution is validated by extensive simulations and field experiments in CERN facilities. For the field trials, we used a youBot mobile robot platform as the relay node, and two stand-alone Raspberry Pi computers as the client and server nodes. The algorithm has been proven to be robust to noise in the radio signals and to work effectively even under non-line-of-sight conditions.
Parasuraman, Ramviyas; Fabry, Thomas; Molinari, Luca; Kershaw, Keith; Di Castro, Mario; Masi, Alessandro; Ferre, Manuel
2014-01-01
The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS). When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities), there is a possibility that some electronic components may fail randomly (due to radiation effects), which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the “server-relay-client” framework that uses (multiple) relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO) algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide redundant networking abilities. We use pre-processing techniques, such as exponential moving averaging and spatial averaging filters on the RSS data for smoothing. We apply a receiver spatial diversity concept and employ a position controller on the relay node using a stochastic gradient ascent method for self-positioning the relay node to achieve the RSS balancing task. The effectiveness of the proposed solution is validated by extensive simulations and field experiments in CERN facilities. For the field trials, we used a youBot mobile robot platform as the relay node, and two stand-alone Raspberry Pi computers as the client and server nodes. The algorithm has been proven to be robust to noise in the radio signals and to work effectively even under non-line-of-sight conditions. PMID:25615734
Localization with a mobile beacon in underwater acoustic sensor networks.
Lee, Sangho; Kim, Kiseon
2012-01-01
Localization is one of the most important issues associated with underwater acoustic sensor networks, especially when sensor nodes are randomly deployed. Given that it is difficult to deploy beacon nodes at predetermined locations, localization schemes with a mobile beacon on the sea surface or along the planned path are inherently convenient, accurate, and energy-efficient. In this paper, we propose a new range-free Localization with a Mobile Beacon (LoMoB). The mobile beacon periodically broadcasts a beacon message containing its location. Sensor nodes are individually localized by passively receiving the beacon messages without inter-node communications. For location estimation, a set of potential locations are obtained as candidates for a node's location and then the node's location is determined through the weighted mean of all the potential locations with the weights computed based on residuals.
Localization with a Mobile Beacon in Underwater Acoustic Sensor Networks
Lee, Sangho; Kim, Kiseon
2012-01-01
Localization is one of the most important issues associated with underwater acoustic sensor networks, especially when sensor nodes are randomly deployed. Given that it is difficult to deploy beacon nodes at predetermined locations, localization schemes with a mobile beacon on the sea surface or along the planned path are inherently convenient, accurate, and energy-efficient. In this paper, we propose a new range-free Localization with a Mobile Beacon (LoMoB). The mobile beacon periodically broadcasts a beacon message containing its location. Sensor nodes are individually localized by passively receiving the beacon messages without inter-node communications. For location estimation, a set of potential locations are obtained as candidates for a node's location and then the node's location is determined through the weighted mean of all the potential locations with the weights computed based on residuals. PMID:22778597
Reconfigurable wireless monitoring systems for bridges: validation on the Yeondae Bridge
NASA Astrophysics Data System (ADS)
Kim, Junhee; Lynch, Jerome P.; Zonta, Daniele; Lee, Jong-Jae; Yun, Chung-Bang
2009-03-01
The installation of a structural monitoring system on a medium- to large-span bridge can be a challenging undertaking due to high system costs and time consuming installations. However, these historical challenges can be eliminated by using wireless sensors as the primary building block of a structural monitoring system. Wireless sensors are low-cost data acquisition nodes that utilize wireless communication to transfer data from the sensor to the data repository. Another advantageous characteristic of wireless sensors is their ability to be easily removed and reinstalled in another sensor location on the same structure; this installation modularity is highlighted in this study. Wireless sensor nodes designed for structural monitoring applications are installed on the 180 m long Yeondae Bridge (Korea) to measure the dynamic response of the bridge to controlled truck loading. To attain a high nodal density with a small number (20) of wireless sensors, the wireless sensor network is installed three times with each installation concentrating sensors in one portion of the bridge. Using forced and free vibration response data from the three installations, the modal properties of the bridge are accurately identified. Intentional nodal overlapping of the three different sensor installations allows mode shapes from each installation to be stitched together into global mode shapes. Specifically, modal properties of the Yeondae Bridge are derived off-line using frequency domain decomposition (FDD) modal analysis methods.
Wake-up transceivers for structural health monitoring of bridges
NASA Astrophysics Data System (ADS)
Kumberg, T.; Kokert, J.; Younesi, V.; Koenig, S.; Reindl, L. M.
2016-04-01
In this article we present a wireless sensor network to monitor the structural health of a large-scale highway bridge in Germany. The wireless sensor network consists of several sensor nodes that use wake-up receivers to realize latency free and low-power communication. The sensor nodes are either equipped with very accurate tilt sensor developed by Northrop Grumman LITEF GmbH or with a Novatel OEM615 GNSS receiver. Relay nodes are required to forward measurement data to a base station located on the bridge. The base station is a gateway that transmits the local measurement data to a remote server where it can be further analyzed and processed. Further on, we present an energy harvesting system to supply the energy demanding GNSS sensor nodes to realize long term monitoring.
NASA Astrophysics Data System (ADS)
Mascarenas, David D. L.; Flynn, Eric; Lin, Kaisen; Farinholt, Kevin; Park, Gyuhae; Gupta, Rajesh; Todd, Michael; Farrar, Charles
2008-03-01
A major challenge impeding the deployment of wireless sensor networks for structural health monitoring (SHM) is developing means to supply power to the sensor nodes in a cost-effective manner. In this work an initial test of a roving-host wireless sensor network was performed on a bridge near Truth or Consequences, NM in August of 2007. The roving-host wireless sensor network features a radio controlled helicopter responsible for wirelessly delivering energy to sensor nodes on an "as-needed" basis. In addition, the helicopter also serves as a central data repository and processing center for the information collected by the sensor network. The sensor nodes used on the bridge were developed for measuring the peak displacement of the bridge, as well as measuring the preload of some of the bolted joints in the bridge. These sensors and sensor nodes were specifically designed to be able to operate from energy supplied wirelessly from the helicopter. The ultimate goal of this research is to ease the requirement for battery power supplies in wireless sensor networks.
Underwater Sensor Network Redeployment Algorithm Based on Wolf Search
Jiang, Peng; Feng, Yang; Wu, Feng
2016-01-01
This study addresses the optimization of node redeployment coverage in underwater wireless sensor networks. Given that nodes could easily become invalid under a poor environment and the large scale of underwater wireless sensor networks, an underwater sensor network redeployment algorithm was developed based on wolf search. This study is to apply the wolf search algorithm combined with crowded degree control in the deployment of underwater wireless sensor networks. The proposed algorithm uses nodes to ensure coverage of the events, and it avoids the prematurity of the nodes. The algorithm has good coverage effects. In addition, considering that obstacles exist in the underwater environment, nodes are prevented from being invalid by imitating the mechanism of avoiding predators. Thus, the energy consumption of the network is reduced. Comparative analysis shows that the algorithm is simple and effective in wireless sensor network deployment. Compared with the optimized artificial fish swarm algorithm, the proposed algorithm exhibits advantages in network coverage, energy conservation, and obstacle avoidance. PMID:27775659
Optimal Deployment of Sensor Nodes Based on Performance Surface of Underwater Acoustic Communication
Choi, Jee Woong
2017-01-01
The underwater acoustic sensor network (UWASN) is a system that exchanges data between numerous sensor nodes deployed in the sea. The UWASN uses an underwater acoustic communication technique to exchange data. Therefore, it is important to design a robust system that will function even in severely fluctuating underwater communication conditions, along with variations in the ocean environment. In this paper, a new algorithm to find the optimal deployment positions of underwater sensor nodes is proposed. The algorithm uses the communication performance surface, which is a map showing the underwater acoustic communication performance of a targeted area. A virtual force-particle swarm optimization algorithm is then used as an optimization technique to find the optimal deployment positions of the sensor nodes, using the performance surface information to estimate the communication radii of the sensor nodes in each generation. The algorithm is evaluated by comparing simulation results between two different seasons (summer and winter) for an area located off the eastern coast of Korea as the selected targeted area. PMID:29053569
Distributed processing method for arbitrary view generation in camera sensor network
NASA Astrophysics Data System (ADS)
Tehrani, Mehrdad P.; Fujii, Toshiaki; Tanimoto, Masayuki
2003-05-01
Camera sensor network as a new advent of technology is a network that each sensor node can capture video signals, process and communicate them with other nodes. The processing task in this network is to generate arbitrary view, which can be requested from central node or user. To avoid unnecessary communication between nodes in camera sensor network and speed up the processing time, we have distributed the processing tasks between nodes. In this method, each sensor node processes part of interpolation algorithm to generate the interpolated image with local communication between nodes. The processing task in camera sensor network is ray-space interpolation, which is an object independent method and based on MSE minimization by using adaptive filtering. Two methods were proposed for distributing processing tasks, which are Fully Image Shared Decentralized Processing (FIS-DP), and Partially Image Shared Decentralized Processing (PIS-DP), to share image data locally. Comparison of the proposed methods with Centralized Processing (CP) method shows that PIS-DP has the highest processing speed after FIS-DP, and CP has the lowest processing speed. Communication rate of CP and PIS-DP is almost same and better than FIS-DP. So, PIS-DP is recommended because of its better performance than CP and FIS-DP.
A Wind Energy Powered Wireless Temperature Sensor Node
Zhang, Chuang; He, Xue-Feng; Li, Si-Yu; Cheng, Yao-Qing; Rao, Yang
2015-01-01
A wireless temperature sensor node composed of a piezoelectric wind energy harvester, a temperature sensor, a microcontroller, a power management circuit and a wireless transmitting module was developed. The wind-induced vibration energy harvester with a cuboid chamber of 62 mm × 19.6 mm × 10 mm converts ambient wind energy into electrical energy to power the sensor node. A TMP102 temperature sensor and the MSP430 microcontroller are used to measure the temperature. The power management module consists of LTC3588-1 and LT3009 units. The measured temperature is transmitted by the nRF24l01 transceiver. Experimental results show that the critical wind speed of the harvester was about 5.4 m/s and the output power of the harvester was about 1.59 mW for the electrical load of 20 kΩ at wind speed of 11.2 m/s, which was sufficient to power the wireless sensor node to measure and transmit the temperature every 13 s. When the wind speed increased from 6 m/s to 11.5 m/s, the self-powered wireless sensor node worked normally. PMID:25734649
A wind energy powered wireless temperature sensor node.
Zhang, Chuang; He, Xue-Feng; Li, Si-Yu; Cheng, Yao-Qing; Rao, Yang
2015-02-27
A wireless temperature sensor node composed of a piezoelectric wind energy harvester, a temperature sensor, a microcontroller, a power management circuit and a wireless transmitting module was developed. The wind-induced vibration energy harvester with a cuboid chamber of 62 mm × 19.6 mm × 10 mm converts ambient wind energy into electrical energy to power the sensor node. A TMP102 temperature sensor and the MSP430 microcontroller are used to measure the temperature. The power management module consists of LTC3588-1 and LT3009 units. The measured temperature is transmitted by the nRF24l01 transceiver. Experimental results show that the critical wind speed of the harvester was about 5.4 m/s and the output power of the harvester was about 1.59 mW for the electrical load of 20 kΩ at wind speed of 11.2 m/s, which was sufficient to power the wireless sensor node to measure and transmit the temperature every 13 s. When the wind speed increased from 6 m/s to 11.5 m/s, the self-powered wireless sensor node worked normally.
Autonomous solutions for powering wireless sensor nodes in rivers
NASA Astrophysics Data System (ADS)
Kamenar, E.; Maćešić, S.; Gregov, G.; Blažević, D.; Zelenika, S.; Marković, K.; Glažar, V.
2015-05-01
There is an evident need for monitoring pollutants and/or other conditions in river flows via wireless sensor networks. In a typical wireless sensor network topography, a series of sensor nodes is to be deployed in the environment, all wirelessly connected to each other and/or their gateways. Each sensor node is composed of active electronic devices that have to be constantly powered. In general, batteries can be used for this purpose, but problems may occur when they have to be replaced. In the case of large networks, when sensor nodes can be placed in hardly accessible locations, energy harvesting can thus be a viable powering solution. The possibility to use three different small-scale river flow energy harvesting principles is hence thoroughly studied in this work: a miniaturized underwater turbine, a so-called `piezoelectric eel' and a hybrid turbine solution coupled with a rigid piezoelectric beam. The first two concepts are then validated experimentally in laboratory as well as in real river conditions. The concept of the miniaturised hydro-generator is finally embedded into the actual wireless sensor node system and its functionality is confirmed.
A Mobile Sensor Network System for Monitoring of Unfriendly Environments.
Song, Guangming; Zhou, Yaoxin; Ding, Fei; Song, Aiguo
2008-11-14
Observing microclimate changes is one of the most popular applications of wireless sensor networks. However, some target environments are often too dangerous or inaccessible to humans or large robots and there are many challenges for deploying and maintaining wireless sensor networks in those unfriendly environments. This paper presents a mobile sensor network system for solving this problem. The system architecture, the mobile node design, the basic behaviors and advanced network capabilities have been investigated respectively. A wheel-based robotic node architecture is proposed here that can add controlled mobility to wireless sensor networks. A testbed including some prototype nodes has also been created for validating the basic functions of the proposed mobile sensor network system. Motion performance tests have been done to get the positioning errors and power consumption model of the mobile nodes. Results of the autonomous deployment experiment show that the mobile nodes can be distributed evenly into the previously unknown environments. It provides powerful support for network deployment and maintenance and can ensure that the sensor network will work properly in unfriendly environments.
A new range-free localisation in wireless sensor networks using support vector machine
NASA Astrophysics Data System (ADS)
Wang, Zengfeng; Zhang, Hao; Lu, Tingting; Sun, Yujuan; Liu, Xing
2018-02-01
Location information of sensor nodes is of vital importance for most applications in wireless sensor networks (WSNs). This paper proposes a new range-free localisation algorithm using support vector machine (SVM) and polar coordinate system (PCS), LSVM-PCS. In LSVM-PCS, two sets of classes are first constructed based on sensor nodes' polar coordinates. Using the boundaries of the defined classes, the operation region of WSN field is partitioned into a finite number of polar grids. Each sensor node can be localised into one of the polar grids by executing two localisation algorithms that are developed on the basis of SVM classification. The centre of the resident polar grid is then estimated as the location of the sensor node. In addition, a two-hop mass-spring optimisation (THMSO) is also proposed to further improve the localisation accuracy of LSVM-PCS. In THMSO, both neighbourhood information and non-neighbourhood information are used to refine the sensor node location. The results obtained verify that the proposed algorithm provides a significant improvement over existing localisation methods.
On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model
Bagula, Antoine; Castelli, Lorenzo; Zennaro, Marco
2015-01-01
Smart parking is a typical IoT application that can benefit from advances in sensor, actuator and RFID technologies to provide many services to its users and parking owners of a smart city. This paper considers a smart parking infrastructure where sensors are laid down on the parking spots to detect car presence and RFID readers are embedded into parking gates to identify cars and help in the billing of the smart parking. Both types of devices are endowed with wired and wireless communication capabilities for reporting to a gateway where the situation recognition is performed. The sensor devices are tasked to play one of the three roles: (1) slave sensor nodes located on the parking spot to detect car presence/absence; (2) master nodes located at one of the edges of a parking lot to detect presence and collect the sensor readings from the slave nodes; and (3) repeater sensor nodes, also called “anchor” nodes, located strategically at specific locations in the parking lot to increase the coverage and connectivity of the wireless sensor network. While slave and master nodes are placed based on geographic constraints, the optimal placement of the relay/anchor sensor nodes in smart parking is an important parameter upon which the cost and efficiency of the parking system depends. We formulate the optimal placement of sensors in smart parking as an integer linear programming multi-objective problem optimizing the sensor network engineering efficiency in terms of coverage and lifetime maximization, as well as its economic gain in terms of the number of sensors deployed for a specific coverage and lifetime. We propose an exact solution to the node placement problem using single-step and two-step solutions implemented in the Mosel language based on the Xpress-MPsuite of libraries. Experimental results reveal the relative efficiency of the single-step compared to the two-step model on different performance parameters. These results are consolidated by simulation results, which reveal that our solution outperforms a random placement in terms of both energy consumption, delay and throughput achieved by a smart parking network. PMID:26134104
On the Design of Smart Parking Networks in the Smart Cities: An Optimal Sensor Placement Model.
Bagula, Antoine; Castelli, Lorenzo; Zennaro, Marco
2015-06-30
Smart parking is a typical IoT application that can benefit from advances in sensor, actuator and RFID technologies to provide many services to its users and parking owners of a smart city. This paper considers a smart parking infrastructure where sensors are laid down on the parking spots to detect car presence and RFID readers are embedded into parking gates to identify cars and help in the billing of the smart parking. Both types of devices are endowed with wired and wireless communication capabilities for reporting to a gateway where the situation recognition is performed. The sensor devices are tasked to play one of the three roles: (1) slave sensor nodes located on the parking spot to detect car presence/absence; (2) master nodes located at one of the edges of a parking lot to detect presence and collect the sensor readings from the slave nodes; and (3) repeater sensor nodes, also called "anchor" nodes, located strategically at specific locations in the parking lot to increase the coverage and connectivity of the wireless sensor network. While slave and master nodes are placed based on geographic constraints, the optimal placement of the relay/anchor sensor nodes in smart parking is an important parameter upon which the cost and efficiency of the parking system depends. We formulate the optimal placement of sensors in smart parking as an integer linear programming multi-objective problem optimizing the sensor network engineering efficiency in terms of coverage and lifetime maximization, as well as its economic gain in terms of the number of sensors deployed for a specific coverage and lifetime. We propose an exact solution to the node placement problem using single-step and two-step solutions implemented in the Mosel language based on the Xpress-MPsuite of libraries. Experimental results reveal the relative efficiency of the single-step compared to the two-step model on different performance parameters. These results are consolidated by simulation results, which reveal that our solution outperforms a random placement in terms of both energy consumption, delay and throughput achieved by a smart parking network.
A low-noise low-power EEG acquisition node for scalable brain-machine interfaces
NASA Astrophysics Data System (ADS)
Sullivan, Thomas J.; Deiss, Stephen R.; Cauwenberghs, Gert; Jung, Tzyy-Ping
2007-05-01
Electroencephalograph (EEG) recording systems offer a versatile, noninvasive window on the brain's spatio-temporal activity for many neuroscience and clinical applications. Our research aims at improving the spatial resolution and mobility of EEG recording by reducing the form factor, power drain and signal fanout of the EEG acquisition node in a scalable sensor array architecture. We present such a node integrated onto a dimesized circuit board that contains a sensor's complete signal processing front-end, including amplifier, filters, and analog-to-digital conversion. A daisy-chain configuration between boards with bit-serial output reduces the wiring needed. The circuit's low power consumption of 423 μW supports EEG systems with hundreds of electrodes to operate from small batteries for many hours. Coupling between the bit-serial output and the highly sensitive analog input due to dense integration of analog and digital functions on the circuit board results in a deterministic noise component in the output, larger than the intrinsic sensor and circuit noise. With software correction of this noise contribution, the system achieves an input-referred noise of 0.277 μVrms in the signal band of 1 to 100 Hz, comparable to the best medical-grade systems in use. A chain of seven nodes using EEG dry electrodes created in micro-electrical-mechanical system (MEMS) technology is demonstrated in a real-world setting.
SOUNET: Self-Organized Underwater Wireless Sensor Network.
Kim, Hee-Won; Cho, Ho-Shin
2017-02-02
In this paper, we propose an underwater wireless sensor network (UWSN) named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the timevarying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR), and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment.
SOUNET: Self-Organized Underwater Wireless Sensor Network
Kim, Hee-won; Cho, Ho-Shin
2017-01-01
In this paper, we propose an underwater wireless sensor network (UWSN) named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the time-varying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR), and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment. PMID:28157164
Luo, Hanjiang; Guo, Zhongwen; Wu, Kaishun; Hong, Feng; Feng, Yuan
2009-01-01
Underwater acoustic sensor networks (UWA-SNs) are envisioned to perform monitoring tasks over the large portion of the world covered by oceans. Due to economics and the large area of the ocean, UWA-SNs are mainly sparsely deployed networks nowadays. The limited battery resources is a big challenge for the deployment of such long-term sensor networks. Unbalanced battery energy consumption will lead to early energy depletion of nodes, which partitions the whole networks and impairs the integrity of the monitoring datasets or even results in the collapse of the entire networks. On the contrary, balanced energy dissipation of nodes can prolong the lifetime of such networks. In this paper, we focus on the energy balance dissipation problem of two types of sparsely deployed UWA-SNs: underwater moored monitoring systems and sparsely deployed two-dimensional UWA-SNs. We first analyze the reasons of unbalanced energy consumption in such networks, then we propose two energy balanced strategies to maximize the lifetime of networks both in shallow and deep water. Finally, we evaluate our methods by simulations and the results show that the two strategies can achieve balanced energy consumption per node while at the same time prolong the networks lifetime. PMID:22399970
NASA Astrophysics Data System (ADS)
Lee, Songjun; Na, Doosu; Koo, Bonmin
Wireless sensor networks with a star network topology are commonly applied for health monitoring systems. To determine the condition of a patient, sensor nodes are attached to the body to transmit the data to a coordinator. However, this process is inefficient because the coordinator is always communicating with each sensor node resulting in a data processing workload for the coordinator that becomes much greater than that of the sensor nodes. In this paper, a method is proposed to reduce the number of data transmissions from the sensor nodes to the coordinator by establishing a threshold for data from the biological signals to ensure that only relevant information is transmitted. This results in a dramatic reduction in power consumption throughout the entire network.
Energy-Efficient ZigBee-Based Wireless Sensor Network for Track Bicycle Performance Monitoring
Gharghan, Sadik K.; Nordin, Rosdiadee; Ismail, Mahamod
2014-01-01
In a wireless sensor network (WSN), saving power is a vital requirement. In this paper, a simple point-to-point bike WSN was considered. The data of bike parameters, speed and cadence, were monitored and transmitted via a wireless communication based on the ZigBee protocol. Since the bike parameters are monitored and transmitted on every bike wheel rotation, this means the sensor node does not sleep for a long time, causing power consumption to rise. Therefore, a newly proposed algorithm, known as the Redundancy and Converged Data (RCD) algorithm, was implemented for this application to put the sensor node into sleep mode while maintaining the performance measurements. This is achieved by minimizing the data packets transmitted as much as possible and fusing the data of speed and cadence by utilizing the correlation measurements between them to minimize the number of sensor nodes in the network to one node, which results in reduced power consumption, cost, and size, in addition to simpler hardware implementation. Execution of the proposed RCD algorithm shows that this approach can reduce the current consumption to 1.69 mA, and save 95% of the sensor node energy. Also, the comparison results with different wireless standard technologies demonstrate minimal current consumption in the sensor node. PMID:25153141
Energy-efficient ZigBee-based wireless sensor network for track bicycle performance monitoring.
Gharghan, Sadik K; Nordin, Rosdiadee; Ismail, Mahamod
2014-08-22
In a wireless sensor network (WSN), saving power is a vital requirement. In this paper, a simple point-to-point bike WSN was considered. The data of bike parameters, speed and cadence, were monitored and transmitted via a wireless communication based on the ZigBee protocol. Since the bike parameters are monitored and transmitted on every bike wheel rotation, this means the sensor node does not sleep for a long time, causing power consumption to rise. Therefore, a newly proposed algorithm, known as the Redundancy and Converged Data (RCD) algorithm, was implemented for this application to put the sensor node into sleep mode while maintaining the performance measurements. This is achieved by minimizing the data packets transmitted as much as possible and fusing the data of speed and cadence by utilizing the correlation measurements between them to minimize the number of sensor nodes in the network to one node, which results in reduced power consumption, cost, and size, in addition to simpler hardware implementation. Execution of the proposed RCD algorithm shows that this approach can reduce the current consumption to 1.69 mA, and save 95% of the sensor node energy. Also, the comparison results with different wireless standard technologies demonstrate minimal current consumption in the sensor node.
Modelling the Energy Efficient Sensor Nodes for Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Dahiya, R.; Arora, A. K.; Singh, V. R.
2015-09-01
Energy is an important requirement of wireless sensor networks for better performance. A widely employed energy-saving technique is to place nodes in sleep mode, corresponding to low-power consumption as well as to reduce operational capabilities. In this paper, Markov model of a sensor network is developed. The node is considered to enter a sleep mode. This model is used to investigate the system performance in terms of energy consumption, network capacity and data delivery delay.
Monitoring urban air quality using a high-density network of low-cost sensor nodes in Oslo, Norway.
NASA Astrophysics Data System (ADS)
Castell, Nuria; Schneider, Philipp; Vogt, Matthias; Dauge, Franck R.; Lahoz, William; Bartonova, Alena
2017-04-01
Urban air quality represents a major public health burden and is a long-standing concern to citizens. Air pollution is associated with a range of diseases, symptoms and conditions that impair health and quality of life. In Oslo, traffic, especially exhaust from heavy-duty and private diesel vehicles and dust resuspension from studded tyres, together with wood burning in winter, are the main sources of pollution. Norway, as part of the European Economic Area, is obliged to comply with the European air quality regulations and ensure clean air. Despite this, Oslo has exceeded both the NO2 and PM10 thresholds for health protection defined in the Directive 2008/50/EC. The air quality in the Oslo area is continuously monitored in 12 compliance monitoring stations. These stations provide reliable and accurate data but their density is too low to provide a detailed spatial distribution of air quality. The emergence of low-cost nodes enables observations at high spatial resolution, providing the opportunity to enhance existing monitoring systems. However, the data generated by these nodes is significantly less accurate and precise than the data provided by reference equipment. We have conducted an evaluation of low-cost nodes to monitor NO2 and PM10, comparing the data collected with low-cost nodes against CEN (European Standardization Organization) reference analysers. During January and March 2016, a network of 24 nodes was deployed in Oslo. During January, high NO2 levels were observed for several days in a row coinciding with the formation of a thermal inversion. During March, we observed an episode with high PM10 levels due to road dust resuspension. Our results show that there is a major technical challenge associated with current commercial low-cost sensors, regarding the sensor robustness and measurement repeatability. Despite this, low-cost sensor nodes are able to reproduce the NO2 and PM10 variability. The data from the sensors was employed to generate detailed NO2 and PM10 air quality maps using a data fusion technique. This way we were able to offer localized air quality information for the city of Oslo. The outlook for commercial low-cost sensors is promising, and our results show that currently some sensors are already capable of providing coarse information about air quality, indicating if the air quality is good, moderate or if the air is heavily polluted. This type of information could be suitable for applications that aim to raise awareness, or engage the community by monitoring local air quality, as such applications do not require the same accuracy as scientific or regulatory monitoring.
Collaborative Localization Algorithms for Wireless Sensor Networks with Reduced Localization Error
Sahoo, Prasan Kumar; Hwang, I-Shyan
2011-01-01
Localization is an important research issue in Wireless Sensor Networks (WSNs). Though Global Positioning System (GPS) can be used to locate the position of the sensors, unfortunately it is limited to outdoor applications and is costly and power consuming. In order to find location of sensor nodes without help of GPS, collaboration among nodes is highly essential so that localization can be accomplished efficiently. In this paper, novel localization algorithms are proposed to find out possible location information of the normal nodes in a collaborative manner for an outdoor environment with help of few beacons and anchor nodes. In our localization scheme, at most three beacon nodes should be collaborated to find out the accurate location information of any normal node. Besides, analytical methods are designed to calculate and reduce the localization error using probability distribution function. Performance evaluation of our algorithm shows that there is a tradeoff between deployed number of beacon nodes and localization error, and average localization time of the network can be increased with increase in the number of normal nodes deployed over a region. PMID:22163738
On Prolonging Network Lifetime through Load-Similar Node Deployment in Wireless Sensor Networks
Li, Qiao-Qin; Gong, Haigang; Liu, Ming; Yang, Mei; Zheng, Jun
2011-01-01
This paper is focused on the study of the energy hole problem in the Progressive Multi-hop Rotational Clustered (PMRC)-structure, a highly scalable wireless sensor network (WSN) architecture. Based on an analysis on the traffic load distribution in PMRC-based WSNs, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to address the energy hole problem in PMRC-based WSNs. In this strategy, sensor nodes are deployed in the network area according to the load distribution. That is, more nodes shall be deployed in the range where the average load is higher, and then the loads among different areas in the sensor network tend to be balanced. Simulation results demonstrate that the load-similar node distribution strategy prolongs network lifetime and reduces the average packet latency in comparison with existing nonuniform node distribution and uniform node distribution strategies. Note that, besides the PMRC structure, the analysis model and the proposed load-similar node distribution strategy are also applicable to other multi-hop WSN structures. PMID:22163809
Hybrid wireless sensor network for rescue site monitoring after earthquake
NASA Astrophysics Data System (ADS)
Wang, Rui; Wang, Shuo; Tang, Chong; Zhao, Xiaoguang; Hu, Weijian; Tan, Min; Gao, Bowei
2016-07-01
This paper addresses the design of a low-cost, low-complexity, and rapidly deployable wireless sensor network (WSN) for rescue site monitoring after earthquakes. The system structure of the hybrid WSN is described. Specifically, the proposed hybrid WSN consists of two kinds of wireless nodes, i.e., the monitor node and the sensor node. Then the mechanism and the system configuration of the wireless nodes are detailed. A transmission control protocol (TCP)-based request-response scheme is proposed to allow several monitor nodes to communicate with the monitoring center. UDP-based image transmission algorithms with fast recovery have been developed to meet the requirements of in-time delivery of on-site monitor images. In addition, the monitor node contains a ZigBee module that used to communicate with the sensor nodes, which are designed with small dimensions to monitor the environment by sensing different physical properties in narrow spaces. By building a WSN using these wireless nodes, the monitoring center can display real-time monitor images of the monitoring area and visualize all collected sensor data on geographic information systems. In the end, field experiments were performed at the Training Base of Emergency Seismic Rescue Troops of China and the experimental results demonstrate the feasibility and effectiveness of the monitor system.
Moving target tracking through distributed clustering in directional sensor networks.
Enayet, Asma; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif
2014-12-18
The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works.
Moving Target Tracking through Distributed Clustering in Directional Sensor Networks
Enayet, Asma; Razzaque, Md. Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif
2014-01-01
The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works. PMID:25529205
Event Coverage Detection and Event Source Determination in Underwater Wireless Sensor Networks.
Zhou, Zhangbing; Xing, Riliang; Duan, Yucong; Zhu, Yueqin; Xiang, Jianming
2015-12-15
With the advent of the Internet of Underwater Things, smart things are deployed in the ocean space and establish underwater wireless sensor networks for the monitoring of vast and dynamic underwater environments. When events are found to have possibly occurred, accurate event coverage should be detected, and potential event sources should be determined for the enactment of prompt and proper responses. To address this challenge, a technique that detects event coverage and determines event sources is developed in this article. Specifically, the occurrence of possible events corresponds to a set of neighboring sensor nodes whose sensory data may deviate from a normal sensing range in a collective fashion. An appropriate sensor node is selected as the relay node for gathering and routing sensory data to sink node(s). When sensory data are collected at sink node(s), the event coverage is detected and represented as a weighted graph, where the vertices in this graph correspond to sensor nodes and the weight specified upon the edges reflects the extent of sensory data deviating from a normal sensing range. Event sources are determined, which correspond to the barycenters in this graph. The results of the experiments show that our technique is more energy efficient, especially when the network topology is relatively steady.
Event Coverage Detection and Event Source Determination in Underwater Wireless Sensor Networks
Zhou, Zhangbing; Xing, Riliang; Duan, Yucong; Zhu, Yueqin; Xiang, Jianming
2015-01-01
With the advent of the Internet of Underwater Things, smart things are deployed in the ocean space and establish underwater wireless sensor networks for the monitoring of vast and dynamic underwater environments. When events are found to have possibly occurred, accurate event coverage should be detected, and potential event sources should be determined for the enactment of prompt and proper responses. To address this challenge, a technique that detects event coverage and determines event sources is developed in this article. Specifically, the occurrence of possible events corresponds to a set of neighboring sensor nodes whose sensory data may deviate from a normal sensing range in a collective fashion. An appropriate sensor node is selected as the relay node for gathering and routing sensory data to sink node(s). When sensory data are collected at sink node(s), the event coverage is detected and represented as a weighted graph, where the vertices in this graph correspond to sensor nodes and the weight specified upon the edges reflects the extent of sensory data deviating from a normal sensing range. Event sources are determined, which correspond to the barycenters in this graph. The results of the experiments show that our technique is more energy efficient, especially when the network topology is relatively steady. PMID:26694394
Coverage-guaranteed sensor node deployment strategies for wireless sensor networks.
Fan, Gaojuan; Wang, Ruchuan; Huang, Haiping; Sun, Lijuan; Sha, Chao
2010-01-01
Deployment quality and cost are two conflicting aspects in wireless sensor networks. Random deployment, where the monitored field is covered by randomly and uniformly deployed sensor nodes, is an appropriate approach for large-scale network applications. However, their successful applications depend considerably on the deployment quality that uses the minimum number of sensors to achieve a desired coverage. Currently, the number of sensors required to meet the desired coverage is based on asymptotic analysis, which cannot meet deployment quality due to coverage overestimation in real applications. In this paper, we first investigate the coverage overestimation and address the challenge of designing coverage-guaranteed deployment strategies. To overcome this problem, we propose two deployment strategies, namely, the Expected-area Coverage Deployment (ECD) and BOundary Assistant Deployment (BOAD). The deployment quality of the two strategies is analyzed mathematically. Under the analysis, a lower bound on the number of deployed sensor nodes is given to satisfy the desired deployment quality. We justify the correctness of our analysis through rigorous proof, and validate the effectiveness of the two strategies through extensive simulation experiments. The simulation results show that both strategies alleviate the coverage overestimation significantly. In addition, we also evaluate two proposed strategies in the context of target detection application. The comparison results demonstrate that if the target appears at the boundary of monitored region in a given random deployment, the average intrusion distance of BOAD is considerably shorter than that of ECD with the same desired deployment quality. In contrast, ECD has better performance in terms of the average intrusion distance when the invasion of intruder is from the inside of monitored region.
Bleda, Andrés L; Jara, Antonio J; Maestre, Rafael; Santa, Guadalupe; Gómez Skarmeta, Antonio F
2012-01-01
The extensions of the environment with the integration of sensing systems in any space, in conjunction with ubiquitous computing are enabling the so-called Smart Space Sensor Networks. This new generation of networks are offering full connectivity with any object, through the Internet of Things (IoT) and/or the Web, i.e., the Web of Things. These connectivity capabilities are making it feasible to sense the behaviours of people at home and act accordingly. These sensing systems must be integrated within typical elements found at home such as furniture. For that reason, this work considers furniture as an interesting element for the transparent location of sensors. Furniture is a ubiquitous object, i.e., it can be found everywhere at home or the office, and it can integrate and hide the sensors of a network. This work addresses the lack of an exhaustive study of the effect of furniture on signal losses. In addition an easy-to-use tool for estimating the robustness of the communication channel among the sensor nodes and gateways is proposed. Specifically, the losses in a sensor network signal due to the materials found within the communication link are evaluated. Then, this work proposes a software tool that gathers the obtained results and is capable of evaluating the impact of a given set of materials on the communications. This tool also provides a mechanism to optimize the sensor network deployments during the definition of smart spaces. Specifically, it provides information such as: maximum distances between sensor nodes, most suitable type of furniture to integrate sensors, or battery life of sensor nodes. This tool has been validated empirically in the lab, and it is currently being used by several enterprise partners of the Technological Centre of Furniture and Wood in the southeast of Spain.
Bleda, Andrés L.; Jara, Antonio J.; Maestre, Rafael; Santa, Guadalupe; Gómez Skarmeta, Antonio F.
2012-01-01
The extensions of the environment with the integration of sensing systems in any space, in conjunction with ubiquitous computing are enabling the so-called Smart Space Sensor Networks. This new generation of networks are offering full connectivity with any object, through the Internet of Things (IoT) and/or the Web, i.e., the Web of Things. These connectivity capabilities are making it feasible to sense the behaviours of people at home and act accordingly. These sensing systems must be integrated within typical elements found at home such as furniture. For that reason, this work considers furniture as an interesting element for the transparent location of sensors. Furniture is a ubiquitous object, i.e., it can be found everywhere at home or the office, and it can integrate and hide the sensors of a network. This work addresses the lack of an exhaustive study of the effect of furniture on signal losses. In addition an easy-to-use tool for estimating the robustness of the communication channel among the sensor nodes and gateways is proposed. Specifically, the losses in a sensor network signal due to the materials found within the communication link are evaluated. Then, this work proposes a software tool that gathers the obtained results and is capable of evaluating the impact of a given set of materials on the communications. This tool also provides a mechanism to optimize the sensor network deployments during the definition of smart spaces. Specifically, it provides information such as: maximum distances between sensor nodes, most suitable type of furniture to integrate sensors, or battery life of sensor nodes. This tool has been validated empirically in the lab, and it is currently being used by several enterprise partners of the Technological Centre of Furniture and Wood in the southeast of Spain. PMID:22778653
Multi-hop routing mechanism for reliable sensor computing.
Chen, Jiann-Liang; Ma, Yi-Wei; Lai, Chia-Ping; Hu, Chia-Cheng; Huang, Yueh-Min
2009-01-01
Current research on routing in wireless sensor computing concentrates on increasing the service lifetime, enabling scalability for large number of sensors and supporting fault tolerance for battery exhaustion and broken nodes. A sensor node is naturally exposed to various sources of unreliable communication channels and node failures. Sensor nodes have many failure modes, and each failure degrades the network performance. This work develops a novel mechanism, called Reliable Routing Mechanism (RRM), based on a hybrid cluster-based routing protocol to specify the best reliable routing path for sensor computing. Table-driven intra-cluster routing and on-demand inter-cluster routing are combined by changing the relationship between clusters for sensor computing. Applying a reliable routing mechanism in sensor computing can improve routing reliability, maintain low packet loss, minimize management overhead and save energy consumption. Simulation results indicate that the reliability of the proposed RRM mechanism is around 25% higher than that of the Dynamic Source Routing (DSR) and ad hoc On-demand Distance Vector routing (AODV) mechanisms.
Wang, Na; Zeng, Jiwen
2017-03-17
Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been thoroughly addressed and one of the most important challenges is protecting the source locations of the valuable packages. In this paper, we design an all-direction random routing algorithm (ARR) for source-location protecting against parasitic sensor networks. For each package, the routing process of ARR is divided into three stages, i.e., selecting a proper agent node, delivering the package to the agent node from the source node, and sending it to the final destination from the agent node. In ARR, the agent nodes are randomly chosen in all directions by the source nodes using only local decisions, rather than knowing the whole topology of the networks. ARR can control the distributions of the routing paths in a very flexible way and it can guarantee that the routing paths with the same source and destination are totally different from each other. Therefore, it is extremely difficult for the parasitic sensor nodes to trace the packages back to the source nodes. Simulation results illustrate that ARR perfectly confuses the parasitic nodes and obviously outperforms traditional routing-based schemes in protecting source-location privacy, with a marginal increase in the communication overhead and energy consumption. In addition, ARR also requires much less energy than the cloud-based source-location privacy protection schemes.
Prediction-based Dynamic Energy Management in Wireless Sensor Networks
Wang, Xue; Ma, Jun-Jie; Wang, Sheng; Bi, Dao-Wei
2007-01-01
Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.
Distributed Sensor Fusion for Scalar Field Mapping Using Mobile Sensor Networks.
La, Hung Manh; Sheng, Weihua
2013-04-01
In this paper, autonomous mobile sensor networks are deployed to measure a scalar field and build its map. We develop a novel method for multiple mobile sensor nodes to build this map using noisy sensor measurements. Our method consists of two parts. First, we develop a distributed sensor fusion algorithm by integrating two different distributed consensus filters to achieve cooperative sensing among sensor nodes. This fusion algorithm has two phases. In the first phase, the weighted average consensus filter is developed, which allows each sensor node to find an estimate of the value of the scalar field at each time step. In the second phase, the average consensus filter is used to allow each sensor node to find a confidence of the estimate at each time step. The final estimate of the value of the scalar field is iteratively updated during the movement of the mobile sensors via weighted average. Second, we develop the distributed flocking-control algorithm to drive the mobile sensors to form a network and track the virtual leader moving along the field when only a small subset of the mobile sensors know the information of the leader. Experimental results are provided to demonstrate our proposed algorithms.
An efficient coordination protocol for wireless sensor networks
NASA Astrophysics Data System (ADS)
Paruchuri, Vamsi; Durresi, Arjan; Durresi, Mimoza; Barolli, Leonard
2005-10-01
Backbones infrastructures in wireless sensor networks reduce the communication overhead and energy consumption. In this paper, we present BackBone Routing (BBR), a fully distributed protocol for construction and rotation of backbone networks. BBR reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Another key feature of BBR is its energy balancing nature by distributing the role of being Backbone Node among all the nodes. BBR builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Improvement in system lifetime due to BBR increases as the ratio of idle-to-sleep energy consumption increases, and increases as the density of the network increases. Our experiments show that BBR is more efficient in saving energy and extending network life without deteriorating network performance when compared with geographical shortest path routing.
A high-efficiency self-powered wireless sensor node for monitoring concerning vibratory events
NASA Astrophysics Data System (ADS)
Xu, Dacheng; Li, Suiqiong; Li, Mengyang; Xie, Danpeng; Dong, Chuan; Li, Xinxin
2017-09-01
This paper presents a self-powered wireless alarming sensor node (SWASN), which was designed to monitor the occurrence of concerning vibratory events. The major components of the sensor node include a vibration-threshold-triggered energy harvester (VTTEH) that powers the sensor node, a dual threshold voltage control circuit (DTVCC) for power management and a radio frequency (RF) signal transmitting module. The VTTEH generates significant electric energy only when the input vibration reaches certain amplitude. Thus, the VTTEH serves as both the power source and the vibration-event-sensing element for the sensor node. The DTVCC was specifically designed to utilize the limited power supply from the VTTEH to operate the sensor node. Constructed with only voltage detectors and MOSFETs, the DTVCC achieved low power consumption, which was 65% lower compared with the power management circuit designed in our previous work. Meanwhile, a RF transmit circuit was constructed based on the commercially available CC1110-F32 wireless transceiver chip and a compact planar antenna was designed to improve the signal transmission distance. The sensor node was fabricated and was characterized both in the laboratory and in the field. Experimental results showed that the SWASN could automatically send out alarming signals when the simulated concerning event occurred. The waiting time between two consecutive transmission periods is less than 125 s and the transmission distance can reach 1.31 km. The SWASN will have broad applications in field surveillances.
A Two-Phase Time Synchronization-Free Localization Algorithm for Underwater Sensor Networks.
Luo, Junhai; Fan, Liying
2017-03-30
Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assistance. Sensor nodes location in UWSNs is an especially relevant topic. Global Positioning System (GPS) information is not suitable for use in UWSNs because of the underwater propagation problems. Hence, some localization algorithms based on the precise time synchronization between sensor nodes that have been proposed for UWSNs are not feasible. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme based on the Particle Swarm Optimization (PSO) algorithm to obtain the coordinates of the unknown sensor nodes. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence, in this algorithm, we use a small number of mobile beacons to help obtain the location information without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA achieved by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.
A Two-Phase Time Synchronization-Free Localization Algorithm for Underwater Sensor Networks
Luo, Junhai; Fan, Liying
2017-01-01
Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assistance. Sensor nodes location in UWSNs is an especially relevant topic. Global Positioning System (GPS) information is not suitable for use in UWSNs because of the underwater propagation problems. Hence, some localization algorithms based on the precise time synchronization between sensor nodes that have been proposed for UWSNs are not feasible. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme based on the Particle Swarm Optimization (PSO) algorithm to obtain the coordinates of the unknown sensor nodes. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence, in this algorithm, we use a small number of mobile beacons to help obtain the location information without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA achieved by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization. PMID:28358342
Campbell, Carlene E-A; Khan, Shafiullah; Singh, Dhananjay; Loo, Kok-Keong
2011-01-01
The next generation surveillance and multimedia systems will become increasingly deployed as wireless sensor networks in order to monitor parks, public places and for business usage. The convergence of data and telecommunication over IP-based networks has paved the way for wireless networks. Functions are becoming more intertwined by the compelling force of innovation and technology. For example, many closed-circuit TV premises surveillance systems now rely on transmitting their images and data over IP networks instead of standalone video circuits. These systems will increase their reliability in the future on wireless networks and on IEEE 802.11 networks. However, due to limited non-overlapping channels, delay, and congestion there will be problems at sink nodes. In this paper we provide necessary conditions to verify the feasibility of round robin technique in these networks at the sink nodes by using a technique to regulate multi-radio multichannel assignment. We demonstrate through simulations that dynamic channel assignment scheme using multi-radio, and multichannel configuration at a single sink node can perform close to optimal on the average while multiple sink node assignment also performs well. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives.
Multi-Channel Multi-Radio Using 802.11 Based Media Access for Sink Nodes in Wireless Sensor Networks
Campbell, Carlene E.-A.; Khan, Shafiullah; Singh, Dhananjay; Loo, Kok-Keong
2011-01-01
The next generation surveillance and multimedia systems will become increasingly deployed as wireless sensor networks in order to monitor parks, public places and for business usage. The convergence of data and telecommunication over IP-based networks has paved the way for wireless networks. Functions are becoming more intertwined by the compelling force of innovation and technology. For example, many closed-circuit TV premises surveillance systems now rely on transmitting their images and data over IP networks instead of standalone video circuits. These systems will increase their reliability in the future on wireless networks and on IEEE 802.11 networks. However, due to limited non-overlapping channels, delay, and congestion there will be problems at sink nodes. In this paper we provide necessary conditions to verify the feasibility of round robin technique in these networks at the sink nodes by using a technique to regulate multi-radio multichannel assignment. We demonstrate through simulations that dynamic channel assignment scheme using multi-radio, and multichannel configuration at a single sink node can perform close to optimal on the average while multiple sink node assignment also performs well. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives. PMID:22163883
Pipelining in structural health monitoring wireless sensor network
NASA Astrophysics Data System (ADS)
Li, Xu; Dorvash, Siavash; Cheng, Liang; Pakzad, Shamim
2010-04-01
Application of wireless sensor network (WSN) for structural health monitoring (SHM), is becoming widespread due to its implementation ease and economic advantage over traditional sensor networks. Beside advantages that have made wireless network preferable, there are some concerns regarding their performance in some applications. In long-span Bridge monitoring the need to transfer data over long distance causes some challenges in design of WSN platforms. Due to the geometry of bridge structures, using multi-hop data transfer between remote nodes and base station is essential. This paper focuses on the performances of pipelining algorithms. We summarize several prevent pipelining approaches, discuss their performances, and propose a new pipelining algorithm, which gives consideration to both boosting of channel usage and the simplicity in deployment.
NASA Astrophysics Data System (ADS)
Okada, Hironao; Kobayashi, Takeshi; Masuda, Takashi; Itoh, Toshihiro
2009-07-01
We describe a low power consumption wireless sensor node designed for monitoring the conditions of animals, especially of chickens. The node detects variations in 24-h behavior patterns by acquiring the number of the movement of an animal whose acceleration exceeds a threshold measured in per unit time. Wireless sensor nodes when operated intermittently are likely to miss necessary data during their sleep mode state and waste the power in the case of acquiring useless data. We design the node worked only when required acceleration is detected using a piezoelectric accelerometer and a comparator for wake-up source of micro controller unit.
Mechanisms for Prolonging Network Lifetime in Wireless Sensor Networks
ERIC Educational Resources Information Center
Yang, Yinying
2010-01-01
Sensors are used to monitor and control the physical environment. A Wireless Sensor Network (WSN) is composed of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it [18][5]. Sensor nodes measure various parameters of the environment and transmit data collected to one or more sinks, using…
Performance and analysis of MAC protocols based on application
NASA Astrophysics Data System (ADS)
Yadav, Ravi; Daniel, A. K.
2018-04-01
Wireless Sensor Network is one of the rapid emerging technology in recent decades. It covers large application area as civilian and military. Wireless Sensor Network primary consists of sensor nodes having low-power, low cost and multifunctional activities to collaborates and communicates via wireless medium. The deployment of sensor nodes are adhoc in nature, so sensor nodes are auto organize themselves in such a way to communicate with each other. The characteristics make more challenging areas on WSNs. This paper gives overview about characteristics of WSNs, Architecture and Contention Based MAC protocol. The paper present analysis of various protocol based on performance.
Coded Cooperation for Multiway Relaying in Wireless Sensor Networks †
Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar
2015-01-01
Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels. PMID:26131675
Dynamic Reconfiguration of Security Policies in Wireless Sensor Networks
Pinto, Mónica; Gámez, Nadia; Fuentes, Lidia; Amor, Mercedes; Horcas, José Miguel; Ayala, Inmaculada
2015-01-01
Providing security and privacy to wireless sensor nodes (WSNs) is very challenging, due to the heterogeneity of sensor nodes and their limited capabilities in terms of energy, processing power and memory. The applications for these systems run in a myriad of sensors with different low-level programming abstractions, limited capabilities and different routing protocols. This means that applications for WSNs need mechanisms for self-adaptation and for self-protection based on the dynamic adaptation of the algorithms used to provide security. Dynamic software product lines (DSPLs) allow managing both variability and dynamic software adaptation, so they can be considered a key technology in successfully developing self-protected WSN applications. In this paper, we propose a self-protection solution for WSNs based on the combination of the INTER-TRUST security framework (a solution for the dynamic negotiation and deployment of security policies) and the FamiWare middleware (a DSPL approach to automatically configure and reconfigure instances of a middleware for WSNs). We evaluate our approach using a case study from the intelligent transportation system domain. PMID:25746093
Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.
Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar
2015-06-29
Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.
Automatic Earth observation data service based on reusable geo-processing workflow
NASA Astrophysics Data System (ADS)
Chen, Nengcheng; Di, Liping; Gong, Jianya; Yu, Genong; Min, Min
2008-12-01
A common Sensor Web data service framework for Geo-Processing Workflow (GPW) is presented as part of the NASA Sensor Web project. This framework consists of a data service node, a data processing node, a data presentation node, a Catalogue Service node and BPEL engine. An abstract model designer is used to design the top level GPW model, model instantiation service is used to generate the concrete BPEL, and the BPEL execution engine is adopted. The framework is used to generate several kinds of data: raw data from live sensors, coverage or feature data, geospatial products, or sensor maps. A scenario for an EO-1 Sensor Web data service for fire classification is used to test the feasibility of the proposed framework. The execution time and influences of the service framework are evaluated. The experiments show that this framework can improve the quality of services for sensor data retrieval and processing.
Chung, Youngseok; Choi, Seokjin; Lee, Youngsook; Park, Namje; Won, Dongho
2016-10-07
More security concerns and complicated requirements arise in wireless sensor networks than in wired networks, due to the vulnerability caused by their openness. To address this vulnerability, anonymous authentication is an essential security mechanism for preserving privacy and providing security. Over recent years, various anonymous authentication schemes have been proposed. Most of them reveal both strengths and weaknesses in terms of security and efficiency. Recently, Farash et al. proposed a lightweight anonymous authentication scheme in ubiquitous networks, which remedies the security faults of previous schemes. However, their scheme still suffers from certain weaknesses. In this paper, we prove that Farash et al.'s scheme fails to provide anonymity, authentication, or password replacement. In addition, we propose an enhanced scheme that provides efficiency, as well as anonymity and security. Considering the limited capability of sensor nodes, we utilize only low-cost functions, such as one-way hash functions and bit-wise exclusive-OR operations. The security and lightness of the proposed scheme mean that it can be applied to roaming service in localized domains of wireless sensor networks, to provide anonymous authentication of sensor nodes.
Kalman Filters in Geotechnical Monitoring of Ground Subsidence Using Data from MEMS Sensors
Li, Cheng; Azzam, Rafig; Fernández-Steeger, Tomás M.
2016-01-01
The fast development of wireless sensor networks and MEMS make it possible to set up today real-time wireless geotechnical monitoring. To handle interferences and noises from the output data, Kalman filter can be selected as a method to achieve a more realistic estimate of the observations. In this paper, a one-day wireless measurement using accelerometers and inclinometers was deployed on top of a tunnel section under construction in order to monitor ground subsidence. The normal vectors of the sensors were firstly obtained with the help of rotation matrices, and then be projected to the plane of longitudinal section, by which the dip angles over time would be obtained via a trigonometric function. Finally, a centralized Kalman filter was applied to estimate the tilt angles of the sensor nodes based on the data from the embedded accelerometer and the inclinometer. Comparing the results from two sensor nodes deployed away and on the track respectively, the passing of the tunnel boring machine can be identified from unusual performances. Using this method, the ground settlement due to excavation can be measured and a real-time monitoring of ground subsidence can be realized. PMID:27447630
Chung, Youngseok; Choi, Seokjin; Lee, Youngsook; Park, Namje; Won, Dongho
2016-01-01
More security concerns and complicated requirements arise in wireless sensor networks than in wired networks, due to the vulnerability caused by their openness. To address this vulnerability, anonymous authentication is an essential security mechanism for preserving privacy and providing security. Over recent years, various anonymous authentication schemes have been proposed. Most of them reveal both strengths and weaknesses in terms of security and efficiency. Recently, Farash et al. proposed a lightweight anonymous authentication scheme in ubiquitous networks, which remedies the security faults of previous schemes. However, their scheme still suffers from certain weaknesses. In this paper, we prove that Farash et al.’s scheme fails to provide anonymity, authentication, or password replacement. In addition, we propose an enhanced scheme that provides efficiency, as well as anonymity and security. Considering the limited capability of sensor nodes, we utilize only low-cost functions, such as one-way hash functions and bit-wise exclusive-OR operations. The security and lightness of the proposed scheme mean that it can be applied to roaming service in localized domains of wireless sensor networks, to provide anonymous authentication of sensor nodes. PMID:27739417
Prediction of Sybil attack on WSN using Bayesian network and swarm intelligence
NASA Astrophysics Data System (ADS)
Muraleedharan, Rajani; Ye, Xiang; Osadciw, Lisa Ann
2008-04-01
Security in wireless sensor networks is typically sacrificed or kept minimal due to limited resources such as memory and battery power. Hence, the sensor nodes are prone to Denial-of-service attacks and detecting the threats is crucial in any application. In this paper, the Sybil attack is analyzed and a novel prediction method, combining Bayesian algorithm and Swarm Intelligence (SI) is proposed. Bayesian Networks (BN) is used in representing and reasoning problems, by modeling the elements of uncertainty. The decision from the BN is applied to SI forming an Hybrid Intelligence Scheme (HIS) to re-route the information and disconnecting the malicious nodes in future routes. A performance comparison based on the prediction using HIS vs. Ant System (AS) helps in prioritizing applications where decisions are time-critical.
A solar charge and discharge controller for wireless sensor nodes
NASA Astrophysics Data System (ADS)
Dang, Yibo; Shen, Shu
2018-02-01
Aiming at the energy supply problem that restricts the life of wireless sensor nodes, a solar energy charge and discharge controller suitable for wireless sensor nodes is designed in this paper. A Microcontroller is used as the core of the solar charge and discharge controller. The software of the solar charge and discharge controller adopts the C language to realize the program of the main control module. Firstly, the function of monitoring solar panel voltage and lithium battery voltage are simulated by Protel software, and the charge time is tested in cloudy and overcast outdoor environment. The results of the experiment show that our controller meets the power supply demand of wireless sensor nodes.
Zhang, Chenglin; Yan, Lei; Han, Song; Guan, Xinping
2017-01-01
Target localization, which aims to estimate the location of an unknown target, is one of the key issues in applications of underwater acoustic sensor networks (UASNs). However, the constrained property of an underwater environment, such as restricted communication capacity of sensor nodes and sensing noises, makes target localization a challenging problem. This paper relies on fractional sensor nodes to formulate a support vector learning-based particle filter algorithm for the localization problem in communication-constrained underwater acoustic sensor networks. A node-selection strategy is exploited to pick fractional sensor nodes with short-distance pattern to participate in the sensing process at each time frame. Subsequently, we propose a least-square support vector regression (LSSVR)-based observation function, through which an iterative regression strategy is used to deal with the distorted data caused by sensing noises, to improve the observation accuracy. At the same time, we integrate the observation to formulate the likelihood function, which effectively update the weights of particles. Thus, the particle effectiveness is enhanced to avoid “particle degeneracy” problem and improve localization accuracy. In order to validate the performance of the proposed localization algorithm, two different noise scenarios are investigated. The simulation results show that the proposed localization algorithm can efficiently improve the localization accuracy. In addition, the node-selection strategy can effectively select the subset of sensor nodes to improve the communication efficiency of the sensor network. PMID:29267252
Li, Xinbin; Zhang, Chenglin; Yan, Lei; Han, Song; Guan, Xinping
2017-12-21
Target localization, which aims to estimate the location of an unknown target, is one of the key issues in applications of underwater acoustic sensor networks (UASNs). However, the constrained property of an underwater environment, such as restricted communication capacity of sensor nodes and sensing noises, makes target localization a challenging problem. This paper relies on fractional sensor nodes to formulate a support vector learning-based particle filter algorithm for the localization problem in communication-constrained underwater acoustic sensor networks. A node-selection strategy is exploited to pick fractional sensor nodes with short-distance pattern to participate in the sensing process at each time frame. Subsequently, we propose a least-square support vector regression (LSSVR)-based observation function, through which an iterative regression strategy is used to deal with the distorted data caused by sensing noises, to improve the observation accuracy. At the same time, we integrate the observation to formulate the likelihood function, which effectively update the weights of particles. Thus, the particle effectiveness is enhanced to avoid "particle degeneracy" problem and improve localization accuracy. In order to validate the performance of the proposed localization algorithm, two different noise scenarios are investigated. The simulation results show that the proposed localization algorithm can efficiently improve the localization accuracy. In addition, the node-selection strategy can effectively select the subset of sensor nodes to improve the communication efficiency of the sensor network.
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.
A Game Theoretic Approach for Balancing Energy Consumption in Clustered Wireless Sensor Networks.
Yang, Liu; Lu, Yinzhi; Xiong, Lian; Tao, Yang; Zhong, Yuanchang
2017-11-17
Clustering is an effective topology control method in wireless sensor networks (WSNs), since it can enhance the network lifetime and scalability. To prolong the network lifetime in clustered WSNs, an efficient cluster head (CH) optimization policy is essential to distribute the energy among sensor nodes. Recently, game theory has been introduced to model clustering. Each sensor node is considered as a rational and selfish player which will play a clustering game with an equilibrium strategy. Then it decides whether to act as the CH according to this strategy for a tradeoff between providing required services and energy conservation. However, how to get the equilibrium strategy while maximizing the payoff of sensor nodes has rarely been addressed to date. In this paper, we present a game theoretic approach for balancing energy consumption in clustered WSNs. With our novel payoff function, realistic sensor behaviors can be captured well. The energy heterogeneity of nodes is considered by incorporating a penalty mechanism in the payoff function, so the nodes with more energy will compete for CHs more actively. We have obtained the Nash equilibrium (NE) strategy of the clustering game through convex optimization. Specifically, each sensor node can achieve its own maximal payoff when it makes the decision according to this strategy. Through plenty of simulations, our proposed game theoretic clustering is proved to have a good energy balancing performance and consequently the network lifetime is greatly enhanced.
An ultra-low power wireless sensor network for bicycle torque performance measurements.
Gharghan, Sadik K; Nordin, Rosdiadee; Ismail, Mahamod
2015-05-21
In this paper, we propose an energy-efficient transmission technique known as the sleep/wake algorithm for a bicycle torque sensor node. This paper aims to highlight the trade-off between energy efficiency and the communication range between the cyclist and coach. Two experiments were conducted. The first experiment utilised the Zigbee protocol (XBee S2), and the second experiment used the Advanced and Adaptive Network Technology (ANT) protocol based on the Nordic nRF24L01 radio transceiver chip. The current consumption of ANT was measured, simulated and compared with a torque sensor node that uses the XBee S2 protocol. In addition, an analytical model was derived to correlate the sensor node average current consumption with a crank arm cadence. The sensor node achieved 98% power savings for ANT relative to ZigBee when they were compared alone, and the power savings amounted to 30% when all components of the sensor node are considered. The achievable communication range was 65 and 50 m for ZigBee and ANT, respectively, during measurement on an outdoor cycling track (i.e., velodrome). The conclusions indicate that the ANT protocol is more suitable for use in a torque sensor node when power consumption is a crucial demand, whereas the ZigBee protocol is more convenient in ensuring data communication between cyclist and coach.
An Ultra-Low Power Wireless Sensor Network for Bicycle Torque Performance Measurements
Gharghan, Sadik K.; Nordin, Rosdiadee; Ismail, Mahamod
2015-01-01
In this paper, we propose an energy-efficient transmission technique known as the sleep/wake algorithm for a bicycle torque sensor node. This paper aims to highlight the trade-off between energy efficiency and the communication range between the cyclist and coach. Two experiments were conducted. The first experiment utilised the Zigbee protocol (XBee S2), and the second experiment used the Advanced and Adaptive Network Technology (ANT) protocol based on the Nordic nRF24L01 radio transceiver chip. The current consumption of ANT was measured, simulated and compared with a torque sensor node that uses the XBee S2 protocol. In addition, an analytical model was derived to correlate the sensor node average current consumption with a crank arm cadence. The sensor node achieved 98% power savings for ANT relative to ZigBee when they were compared alone, and the power savings amounted to 30% when all components of the sensor node are considered. The achievable communication range was 65 and 50 m for ZigBee and ANT, respectively, during measurement on an outdoor cycling track (i.e., velodrome). The conclusions indicate that the ANT protocol is more suitable for use in a torque sensor node when power consumption is a crucial demand, whereas the ZigBee protocol is more convenient in ensuring data communication between cyclist and coach. PMID:26007728
A wireless laser displacement sensor node for structural health monitoring.
Park, Hyo Seon; Kim, Jong Moon; Choi, Se Woon; Kim, Yousok
2013-09-30
This study describes a wireless laser displacement sensor node that measures displacement as a representative damage index for structural health monitoring (SHM). The proposed measurement system consists of a laser displacement sensor (LDS) and a customized wireless sensor node. Wireless communication is enabled by a sensor node that consists of a sensor module, a code division multiple access (CDMA) communication module, a processor, and a power module. An LDS with a long measurement distance is chosen to increase field applicability. For a wireless sensor node driven by a battery, we use a power control module with a low-power processor, which facilitates switching between the sleep and active modes, thus maximizing the power consumption efficiency during non-measurement and non-transfer periods. The CDMA mode is also used to overcome the limitation of communication distance, which is a challenge for wireless sensor networks and wireless communication. To evaluate the reliability and field applicability of the proposed wireless displacement measurement system, the system is tested onsite to obtain the required vertical displacement measurements during the construction of mega-trusses and an edge truss, which are the primary structural members in a large-scale irregular building currently under construction. The measurement values confirm the validity of the proposed wireless displacement measurement system and its potential for use in safety evaluations of structural elements.
Sleep Deprivation Attack Detection in Wireless Sensor Network
NASA Astrophysics Data System (ADS)
Bhattasali, Tapalina; Chaki, Rituparna; Sanyal, Sugata
2012-02-01
Deployment of sensor network in hostile environment makes it mainly vulnerable to battery drainage attacks because it is impossible to recharge or replace the battery power of sensor nodes. Among different types of security threats, low power sensor nodes are immensely affected by the attacks which cause random drainage of the energy level of sensors, leading to death of the nodes. The most dangerous type of attack in this category is sleep deprivation, where target of the intruder is to maximize the power consumption of sensor nodes, so that their lifetime is minimized. Most of the existing works on sleep deprivation attack detection involve a lot of overhead, leading to poor throughput. The need of the day is to design a model for detecting intrusions accurately in an energy efficient manner. This paper proposes a hierarchical framework based on distributed collaborative mechanism for detecting sleep deprivation torture in wireless sensor network efficiently. Proposed model uses anomaly detection technique in two steps to reduce the probability of false intrusion.
FuGeF: A Resource Bound Secure Forwarding Protocol for Wireless Sensor Networks
Umar, Idris Abubakar; Mohd Hanapi, Zurina; Sali, A.; Zulkarnain, Zuriati A.
2016-01-01
Resource bound security solutions have facilitated the mitigation of spatio-temporal attacks by altering protocol semantics to provide minimal security while maintaining an acceptable level of performance. The Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol for Wireless Sensor Network (WSN) has been proposed to achieve a minimal selection of malicious nodes by introducing a dynamic collection window period to the protocol’s semantics. However, its selection scheme suffers substantial packet losses due to the utilization of a single distance based parameter for node selection. In this paper, we propose a Fuzzy-based Geographic Forwarding protocol (FuGeF) to minimize packet loss, while maintaining performance. The FuGeF utilizes a new form of dynamism and introduces three selection parameters: remaining energy, connectivity cost, and progressive distance, as well as a Fuzzy Logic System (FLS) for node selection. These introduced mechanisms ensure the appropriate selection of a non-malicious node. Extensive simulation experiments have been conducted to evaluate the performance of the proposed FuGeF protocol as compared to DWSIGF variants. The simulation results show that the proposed FuGeF outperforms the two DWSIGF variants (DWSIGF-P and DWSIGF-R) in terms of packet delivery. PMID:27338411
FuGeF: A Resource Bound Secure Forwarding Protocol for Wireless Sensor Networks.
Umar, Idris Abubakar; Mohd Hanapi, Zurina; Sali, A; Zulkarnain, Zuriati A
2016-06-22
Resource bound security solutions have facilitated the mitigation of spatio-temporal attacks by altering protocol semantics to provide minimal security while maintaining an acceptable level of performance. The Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol for Wireless Sensor Network (WSN) has been proposed to achieve a minimal selection of malicious nodes by introducing a dynamic collection window period to the protocol's semantics. However, its selection scheme suffers substantial packet losses due to the utilization of a single distance based parameter for node selection. In this paper, we propose a Fuzzy-based Geographic Forwarding protocol (FuGeF) to minimize packet loss, while maintaining performance. The FuGeF utilizes a new form of dynamism and introduces three selection parameters: remaining energy, connectivity cost, and progressive distance, as well as a Fuzzy Logic System (FLS) for node selection. These introduced mechanisms ensure the appropriate selection of a non-malicious node. Extensive simulation experiments have been conducted to evaluate the performance of the proposed FuGeF protocol as compared to DWSIGF variants. The simulation results show that the proposed FuGeF outperforms the two DWSIGF variants (DWSIGF-P and DWSIGF-R) in terms of packet delivery.
Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco
2017-01-01
The use of Wireless Sensor Network (WSN) technologies is an attractive option to support wide-scale monitoring applications, such as the ones that can be found in precision agriculture, environmental monitoring and industrial automation. The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable topology to build wide-scale WSNs. Despite some of its known advantages, including timing synchronisation and duty-cycle operation, cluster-tree networks may suffer from severe network congestion problems due to the convergecast pattern of its communication traffic. Therefore, the careful adjustment of transmission opportunities (superframe durations) allocated to the cluster-heads is an important research issue. This paper proposes a set of proportional Superframe Duration Allocation (SDA) schemes, based on well-defined protocol and timing models, and on the message load imposed by child nodes (Load-SDA scheme), or by number of descendant nodes (Nodes-SDA scheme) of each cluster-head. The underlying reasoning is to adequately allocate transmission opportunities (superframe durations) and parametrize buffer sizes, in order to improve the network throughput and avoid typical problems, such as: network congestion, high end-to-end communication delays and discarded messages due to buffer overflows. Simulation assessments show how proposed allocation schemes may clearly improve the operation of wide-scale cluster-tree networks. PMID:28134822
Wang, Na; Zeng, Jiwen
2017-01-01
Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been thoroughly addressed and one of the most important challenges is protecting the source locations of the valuable packages. In this paper, we design an all-direction random routing algorithm (ARR) for source-location protecting against parasitic sensor networks. For each package, the routing process of ARR is divided into three stages, i.e., selecting a proper agent node, delivering the package to the agent node from the source node, and sending it to the final destination from the agent node. In ARR, the agent nodes are randomly chosen in all directions by the source nodes using only local decisions, rather than knowing the whole topology of the networks. ARR can control the distributions of the routing paths in a very flexible way and it can guarantee that the routing paths with the same source and destination are totally different from each other. Therefore, it is extremely difficult for the parasitic sensor nodes to trace the packages back to the source nodes. Simulation results illustrate that ARR perfectly confuses the parasitic nodes and obviously outperforms traditional routing-based schemes in protecting source-location privacy, with a marginal increase in the communication overhead and energy consumption. In addition, ARR also requires much less energy than the cloud-based source-location privacy protection schemes. PMID:28304367
An Obstacle-Tolerant Path Planning Algorithm for Mobile-Anchor-Node-Assisted Localization
Tsai, Rong-Guei
2018-01-01
The location information obtained using a sensor is a critical requirement in wireless sensor networks. Numerous localization schemes have been proposed, among which mobile-anchor-node-assisted localization (MANAL) can reduce costs and overcome environmental constraints. A mobile anchor node (MAN) provides its own location information to assist the localization of sensor nodes. Numerous path planning schemes have been proposed for MANAL, but most scenarios assume the absence of obstacles in the environment. However, in a realistic environment, sensor nodes cannot be located because the obstacles block the path traversed by the MAN, thereby rendering the sensor incapable of receiving sufficient three location information from the MAN. This study proposes the obstacle-tolerant path planning (OTPP) approach to solve the sensor location problem owing to obstacle blockage. OTPP can approximate the optimum beacon point number and path planning, thereby ensuring that all the unknown nodes can receive the three location information from the MAN and reduce the number of MAN broadcast packet times. Experimental results demonstrate that OTPP performs better than Z-curves because it reduces the total number of beacon points utilized and is thus more suitable in an obstacle-present environment. Compared to the Z-curve, OTPP can reduce localization error and improve localization coverage. PMID:29547582
Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks
Li, Xing; Chen, Dexin; Li, Chunyan; Wang, Liangmin
2015-01-01
With the rapid development of wireless communication technology, sensor technology, information acquisition and processing technology, sensor networks will finally have a deep influence on all aspects of people’s lives. The battery resources of sensor nodes should be managed efficiently in order to prolong network lifetime in large-scale wireless sensor networks (LWSNs). Data aggregation represents an important method to remove redundancy as well as unnecessary data transmission and hence cut down the energy used in communication. As sensor nodes are deployed in hostile environments, the security of the sensitive information such as confidentiality and integrity should be considered. This paper proposes Fully homomorphic Encryption based Secure data Aggregation (FESA) in LWSNs which can protect end-to-end data confidentiality and support arbitrary aggregation operations over encrypted data. In addition, by utilizing message authentication codes (MACs), this scheme can also verify data integrity during data aggregation and forwarding processes so that false data can be detected as early as possible. Although the FHE increase the computation overhead due to its large public key size, simulation results show that it is implementable in LWSNs and performs well. Compared with other protocols, the transmitted data and network overhead are reduced in our scheme. PMID:26151208
Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk
2014-08-18
Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.
Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk
2014-01-01
Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption. PMID:25196015
A Distributed Data-Gathering Protocol Using AUV in Underwater Sensor Networks.
Khan, Jawaad Ullah; Cho, Ho-Shin
2015-08-06
In this paper, we propose a distributed data-gathering scheme using an autonomous underwater vehicle (AUV) working as a mobile sink to gather data from a randomly distributed underwater sensor network where sensor nodes are clustered around several cluster headers. Unlike conventional data-gathering schemes where the AUV visits either every node or every cluster header, the proposed scheme allows the AUV to visit some selected nodes named path-nodes in a way that reduces the overall transmission power of the sensor nodes. Monte Carlo simulations are performed to investigate the performance of the proposed scheme compared with several preexisting techniques employing the AUV in terms of total amount of energy consumption, standard deviation of each node's energy consumption, latency to gather data at a sink, and controlling overhead. Simulation results show that the proposed scheme not only reduces the total energy consumption but also distributes the energy consumption more uniformly over the network, thereby increasing the lifetime of the network.
A Low Power IoT Sensor Node Architecture for Waste Management Within Smart Cities Context.
Cerchecci, Matteo; Luti, Francesco; Mecocci, Alessandro; Parrino, Stefano; Peruzzi, Giacomo; Pozzebon, Alessandro
2018-04-21
This paper focuses on the realization of an Internet of Things (IoT) architecture to optimize waste management in the context of Smart Cities. In particular, a novel typology of sensor node based on the use of low cost and low power components is described. This node is provided with a single-chip microcontroller, a sensor able to measure the filling level of trash bins using ultrasounds and a data transmission module based on the LoRa LPWAN (Low Power Wide Area Network) technology. Together with the node, a minimal network architecture was designed, based on a LoRa gateway, with the purpose of testing the IoT node performances. Especially, the paper analyzes in detail the node architecture, focusing on the energy saving technologies and policies, with the purpose of extending the batteries lifetime by reducing power consumption, through hardware and software optimization. Tests on sensor and radio module effectiveness are also presented.
Speedy routing recovery protocol for large failure tolerance in wireless sensor networks.
Lee, Joa-Hyoung; Jung, In-Bum
2010-01-01
Wireless sensor networks are expected to play an increasingly important role in data collection in hazardous areas. However, the physical fragility of a sensor node makes reliable routing in hazardous areas a challenging problem. Because several sensor nodes in a hazardous area could be damaged simultaneously, the network should be able to recover routing after node failures over large areas. Many routing protocols take single-node failure recovery into account, but it is difficult for these protocols to recover the routing after large-scale failures. In this paper, we propose a routing protocol, referred to as ARF (Adaptive routing protocol for fast Recovery from large-scale Failure), to recover a network quickly after failures over large areas. ARF detects failures by counting the packet losses from parent nodes, and upon failure detection, it decreases the routing interval to notify the neighbor nodes of the failure. Our experimental results indicate that ARF could provide recovery from large-area failures quickly with less packets and energy consumption than previous protocols.
A Low Power IoT Sensor Node Architecture for Waste Management Within Smart Cities Context
Cerchecci, Matteo; Luti, Francesco; Mecocci, Alessandro; Parrino, Stefano; Peruzzi, Giacomo
2018-01-01
This paper focuses on the realization of an Internet of Things (IoT) architecture to optimize waste management in the context of Smart Cities. In particular, a novel typology of sensor node based on the use of low cost and low power components is described. This node is provided with a single-chip microcontroller, a sensor able to measure the filling level of trash bins using ultrasounds and a data transmission module based on the LoRa LPWAN (Low Power Wide Area Network) technology. Together with the node, a minimal network architecture was designed, based on a LoRa gateway, with the purpose of testing the IoT node performances. Especially, the paper analyzes in detail the node architecture, focusing on the energy saving technologies and policies, with the purpose of extending the batteries lifetime by reducing power consumption, through hardware and software optimization. Tests on sensor and radio module effectiveness are also presented. PMID:29690552
Wireless sensor network: an aimless gadget or a necessary tool for natural hazards warning systems
NASA Astrophysics Data System (ADS)
Hloupis, George; Stavrakas, Ilias; Triantis, Dimos
2010-05-01
The purpose of the current study is to review the current technical and scientific state of wireless sensor networks (WSNs) with application on natural hazards. WSN have received great attention from the research community in the last few years, mainly due to the theoretical and practical efforts from challenges that led to mature solutions and adoption of standards, such as Bluetooth [2] and ZigBee [3]. Wireless technology solutions allows Micro-ElectroMechanical Systems sensors (MEMS) to be integrated (with all the necessary circuitry) to small wireless capable devices, the nodes. Available MEMS today include pressure, temperature, humidity, inertial and strain-gauge sensors as well as transducers for velocity, acceleration, vibration, flow position and inclination [4]. A WSN is composed by a large number of nodes which are deployed densely adjacent to the area under monitoring. Each node collects data which transmitted to a gateway. The main requirements that WSNs must fulfilled are quite different than those of ad-hoc networks. WSNs have to be self-organized (since the positions of individual nodes are not known in advance), they must present cooperative processing of tasks (where groups of nodes cooperate in order to provide the gathered data to the user), they require security mechanisms that are adaptive to monitoring conditions and all algorithms must be energy optimized. In this paper, the state of the art in hardware, software, algorithms and protocols for WSNs, focused on natural hazards, is surveyed. Architectures for WSNs are investigated along with their advantages and drawbacks. Available research prototypes as well as commercially proposed solutions that can be used for natural hazards monitoring and early warning systems are listed and classified. [1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey, Comput. Networks (Elsevier) 38 (4) (2002) 393-422. [2] Dursch, A.; Yen, D.C.; Shih, D.H. Bluetooth technology: an exploratory study of the analysis and implementation frameworks. Comput. Stand. Interface. 2004, 26, 263-277. [3] Baronti, P.; Pillai, P.; Chook, V.W.C.; Chessa, S.; Gotta, A.; Hu, Y.F. Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards. Comput. Commun. 2007, 30, 1655-1695. [4] Arampatzis, T.; Lygeros, J.; Manesis, S. A survey of applications of wireless sensors and Wireless Sensor Networks. In 2005 IEEE International Symposium on Intelligent Control & 13th Mediterranean Conference on Control and Automation. Limassol, Cyprus, 2005, 1-2, 719-724.
An Authentication Protocol for Future Sensor Networks.
Bilal, Muhammad; Kang, Shin-Gak
2017-04-28
Authentication is one of the essential security services in Wireless Sensor Networks (WSNs) for ensuring secure data sessions. Sensor node authentication ensures the confidentiality and validity of data collected by the sensor node, whereas user authentication guarantees that only legitimate users can access the sensor data. In a mobile WSN, sensor and user nodes move across the network and exchange data with multiple nodes, thus experiencing the authentication process multiple times. The integration of WSNs with Internet of Things (IoT) brings forth a new kind of WSN architecture along with stricter security requirements; for instance, a sensor node or a user node may need to establish multiple concurrent secure data sessions. With concurrent data sessions, the frequency of the re-authentication process increases in proportion to the number of concurrent connections. Moreover, to establish multiple data sessions, it is essential that a protocol participant have the capability of running multiple instances of the protocol run, which makes the security issue even more challenging. The currently available authentication protocols were designed for the autonomous WSN and do not account for the above requirements. Hence, ensuring a lightweight and efficient authentication protocol has become more crucial. In this paper, we present a novel, lightweight and efficient key exchange and authentication protocol suite called the Secure Mobile Sensor Network (SMSN) Authentication Protocol. In the SMSN a mobile node goes through an initial authentication procedure and receives a re-authentication ticket from the base station. Later a mobile node can use this re-authentication ticket when establishing multiple data exchange sessions and/or when moving across the network. This scheme reduces the communication and computational complexity of the authentication process. We proved the strength of our protocol with rigorous security analysis (including formal analysis using the BAN-logic) and simulated the SMSN and previously proposed schemes in an automated protocol verifier tool. Finally, we compared the computational complexity and communication cost against well-known authentication protocols.
An Authentication Protocol for Future Sensor Networks
Bilal, Muhammad; Kang, Shin-Gak
2017-01-01
Authentication is one of the essential security services in Wireless Sensor Networks (WSNs) for ensuring secure data sessions. Sensor node authentication ensures the confidentiality and validity of data collected by the sensor node, whereas user authentication guarantees that only legitimate users can access the sensor data. In a mobile WSN, sensor and user nodes move across the network and exchange data with multiple nodes, thus experiencing the authentication process multiple times. The integration of WSNs with Internet of Things (IoT) brings forth a new kind of WSN architecture along with stricter security requirements; for instance, a sensor node or a user node may need to establish multiple concurrent secure data sessions. With concurrent data sessions, the frequency of the re-authentication process increases in proportion to the number of concurrent connections. Moreover, to establish multiple data sessions, it is essential that a protocol participant have the capability of running multiple instances of the protocol run, which makes the security issue even more challenging. The currently available authentication protocols were designed for the autonomous WSN and do not account for the above requirements. Hence, ensuring a lightweight and efficient authentication protocol has become more crucial. In this paper, we present a novel, lightweight and efficient key exchange and authentication protocol suite called the Secure Mobile Sensor Network (SMSN) Authentication Protocol. In the SMSN a mobile node goes through an initial authentication procedure and receives a re-authentication ticket from the base station. Later a mobile node can use this re-authentication ticket when establishing multiple data exchange sessions and/or when moving across the network. This scheme reduces the communication and computational complexity of the authentication process. We proved the strength of our protocol with rigorous security analysis (including formal analysis using the BAN-logic) and simulated the SMSN and previously proposed schemes in an automated protocol verifier tool. Finally, we compared the computational complexity and communication cost against well-known authentication protocols. PMID:28452937
IEEE-802.15.4-based low-power body sensor node with RF energy harvester.
Tran, Thang Viet; Chung, Wan-Young
2014-01-01
This paper proposes the design and implementation of a low-voltage and low-power body sensor node based on the IEEE 802.15.4 standard to collect electrocardiography (ECG) and photoplethysmography (PPG) signals. To achieve compact size, low supply voltage, and low power consumption, the proposed platform is integrated into a ZigBee mote, which contains a DC-DC booster, a PPG sensor interface module, and an ECG front-end circuit that has ultra-low current consumption. The input voltage of the proposed node is very low and has a wide range, from 0.65 V to 3.3 V. An RF energy harvester is also designed to charge the battery during the working mode or standby mode of the node. The power consumption of the proposed node reaches 14 mW in working mode to prolong the battery lifetime. The software is supported by the nesC language under the TinyOS environment, which enables the proposed node to be easily configured to function as an individual health monitoring node or a node in a wireless body sensor network (BSN). The proposed node is used to set up a wireless BSN that can simultaneously collect ECG and PPG signals and monitor the results on the personal computer.
Feng, Renjian; Xu, Xiaofeng; Zhou, Xiang; Wan, Jiangwen
2011-01-01
For wireless sensor networks (WSNs), many factors, such as mutual interference of wireless links, battlefield applications and nodes exposed to the environment without good physical protection, result in the sensor nodes being more vulnerable to be attacked and compromised. In order to address this network security problem, a novel trust evaluation algorithm defined as NBBTE (Node Behavioral Strategies Banding Belief Theory of the Trust Evaluation Algorithm) is proposed, which integrates the approach of nodes behavioral strategies and modified evidence theory. According to the behaviors of sensor nodes, a variety of trust factors and coefficients related to the network application are established to obtain direct and indirect trust values through calculating weighted average of trust factors. Meanwhile, the fuzzy set method is applied to form the basic input vector of evidence. On this basis, the evidence difference is calculated between the indirect and direct trust values, which link the revised D-S evidence combination rule to finally synthesize integrated trust value of nodes. The simulation results show that NBBTE can effectively identify malicious nodes and reflects the characteristic of trust value that 'hard to acquire and easy to lose'. Furthermore, it is obvious that the proposed scheme has an outstanding advantage in terms of illustrating the real contribution of different nodes to trust evaluation.
A mobile sensing system for structural health monitoring: design and validation
NASA Astrophysics Data System (ADS)
Zhu, Dapeng; Yi, Xiaohua; Wang, Yang; Lee, Kok-Meng; Guo, Jiajie
2010-05-01
This paper describes a new approach using mobile sensor networks for structural health monitoring. Compared with static sensors, mobile sensor networks offer flexible system architectures with adaptive spatial resolutions. The paper first describes the design of a mobile sensing node that is capable of maneuvering on structures built with ferromagnetic materials. The mobile sensing node can also attach/detach an accelerometer onto/from the structural surface. The performance of the prototype mobile sensor network has been validated through laboratory experiments. Two mobile sensing nodes are adopted for navigating on a steel portal frame and providing dense acceleration measurements. Transmissibility function analysis is conducted to identify structural damage using data collected by the mobile sensing nodes. This preliminary work is expected to spawn transformative changes in the use of mobile sensors for future structural health monitoring.
An Overview of Data Routing Approaches for Wireless Sensor Networks
Anisi, Mohammad Hossein; Abdullah, Abdul Hanan; Razak, Shukor Abd; Ngadi, Md. Asri
2012-01-01
Recent years have witnessed a growing interest in deploying large populations of microsensors that collaborate in a distributed manner to gather and process sensory data and deliver them to a sink node through wireless communications systems. Currently, there is a lot of interest in data routing for Wireless Sensor Networks (WSNs) due to their unique challenges compared to conventional routing in wired networks. In WSNs, each data routing approach follows a specific goal (goals) according to the application. Although the general goal of every data routing approach in WSNs is to extend the network lifetime and every approach should be aware of the energy level of the nodes, data routing approaches may focus on one (or some) specific goal(s) depending on the application. Thus, existing approaches can be categorized according to their routing goals. In this paper, the main goals of data routing approaches in sensor networks are described. Then, the best known and most recent data routing approaches in WSNs are classified and studied according to their specific goals. PMID:23443040
Smart sensing surveillance system
NASA Astrophysics Data System (ADS)
Hsu, Charles; Chu, Kai-Dee; O'Looney, James; Blake, Michael; Rutar, Colleen
2010-04-01
Unattended ground sensor (UGS) networks have been widely used in remote battlefield and other tactical applications over the last few decades due to the advances of the digital signal processing. The UGS network can be applied in a variety of areas including border surveillance, special force operations, perimeter and building protection, target acquisition, situational awareness, and force protection. In this paper, a highly-distributed, fault-tolerant, and energyefficient Smart Sensing Surveillance System (S4) is presented to efficiently provide 24/7 and all weather security operation in a situation management environment. The S4 is composed of a number of distributed nodes to collect, process, and disseminate heterogeneous sensor data. Nearly all S4 nodes have passive sensors to provide rapid omnidirectional detection. In addition, Pan- Tilt- Zoom- (PTZ) Electro-Optics EO/IR cameras are integrated to selected nodes to track the objects and capture associated imagery. These S4 camera-connected nodes will provide applicable advanced on-board digital image processing capabilities to detect and track the specific objects. The imaging detection operations include unattended object detection, human feature and behavior detection, and configurable alert triggers, etc. In the S4, all the nodes are connected with a robust, reconfigurable, LPI/LPD (Low Probability of Intercept/ Low Probability of Detect) wireless mesh network using Ultra-wide band (UWB) RF technology, which can provide an ad-hoc, secure mesh network and capability to relay network information, communicate and pass situational awareness and messages. The S4 utilizes a Service Oriented Architecture such that remote applications can interact with the S4 network and use the specific presentation methods. The S4 capabilities and technologies have great potential for both military and civilian applications, enabling highly effective security support tools for improving surveillance activities in densely crowded environments and near perimeters and borders. The S4 is compliant with Open Geospatial Consortium - Sensor Web Enablement (OGC-SWE®) standards. It would be directly applicable to solutions for emergency response personnel, law enforcement, and other homeland security missions, as well as in applications requiring the interoperation of sensor networks with handheld or body-worn interface devices.
NASA Astrophysics Data System (ADS)
Stewart, G.; Popoola, O. A.; Mead, M. I.; McKeating, S. J.; Calleja, M.; Hayes, M.; Baron, R. P.; Saffell, J.; Jones, R.
2012-12-01
In this paper we describe how low-cost, lightweight devices, which incorporate GPS and GPRS facilities and contain electrochemical sensors for carbon monoxide (CO), nitrogen monoxide (NO) and nitrogen dioxide (NO2), have been used to collect data representative of personal exposure to these important urban air pollutants. E.U. legislation has set target levels for gases thought to have adverse impacts on human health, and consequently led to a need for a more informed air pollution control policy. With many sites in the U.K. and in the rest of the E.U. still failing to meet annual targets for NO2, a need to better understand pollutant sources and behaviour has arisen. Moreover, while traditional chemiluminescence techniques provide precise measurements, the instruments are sparsely populated around urban centres and are thus limited in their ability to account for true personal exposure. Through a series of laboratory and field studies, it has been shown that electrochemical sensor nodes, when configured suitably and after post-processing of data, can provide selective, reproducible measurements, and that the devices have appropriate detection limits (at the low parts-per-billion level), as well as fast enough response times, for urban air quality studies. Both mobile nodes and their static analogues have been deployed with different aims. Static nodes have been used in dense networks in both the urban environment and in the grounds of a major international airport, as described in the partner papers of Mead et al and Bright et al. Mobile units are easily deployed in scalable networks for short-term studies on personal exposure; these studies have been carried out in a wide range of locations including Lagos, Kuala-Lumpur, London and Valencia. Data collected by both mobile and static sensor nodes illustrate the insufficiency of the existing infrastructure in accounting for both the spatial and temporal variability in air pollutants due to road traffic emissions, and thus also the potential insufficiency at quantifying the risks to health in the surrounding area. Recent campaigns with mobile sensor nodes have included attempts to probe the differences in personal exposure to gas-phase air pollutants at different heights of breathing zone and between different methods of transport.
Del Campo, Antonio; Cintioni, Lorenzo; Spinsante, Susanna; Gambi, Ennio
2017-01-01
With the introduction of low-power wireless technologies, like Bluetooth Low Energy (BLE), new applications are approaching the home automation, healthcare, fitness, automotive and consumer electronics markets. BLE devices are designed to maximize the battery life, i.e., to run for long time on a single coin-cell battery. In typical application scenarios of home automation and Ambient Assisted Living (AAL), the sensors that monitor relatively unpredictable and rare events should coexist with other sensors that continuously communicate health or environmental parameter measurements. The former usually work in connectionless mode, acting as advertisers, while the latter need a persistent connection, acting as slave nodes. The coexistence of connectionless and connection-oriented networks, that share the same central node, can be required to reduce the number of handling devices, thus keeping the network complexity low and limiting the packet’s traffic congestion. In this paper, the medium access management, operated by the central node, has been modeled, focusing on the scheduling procedure in both connectionless and connection-oriented communication. The models have been merged to provide a tool supporting the configuration design of BLE devices, during the network design phase that precedes the real implementation. The results highlight the suitability of the proposed tool: the ability to set the device parameters to allow us to keep a practical discovery latency for event-driven sensors and avoid undesired overlaps between scheduled scanning and connection phases due to bad management performed by the central node. PMID:28387724
Del Campo, Antonio; Cintioni, Lorenzo; Spinsante, Susanna; Gambi, Ennio
2017-04-07
With the introduction of low-power wireless technologies, like Bluetooth Low Energy (BLE), new applications are approaching the home automation, healthcare, fitness, automotive and consumer electronics markets. BLE devices are designed to maximize the battery life, i.e., to run for long time on a single coin-cell battery. In typical application scenarios of home automation and Ambient Assisted Living (AAL), the sensors that monitor relatively unpredictable and rare events should coexist with other sensors that continuously communicate health or environmental parameter measurements. The former usually work in connectionless mode, acting as advertisers, while the latter need a persistent connection, acting as slave nodes. The coexistence of connectionless and connection-oriented networks, that share the same central node, can be required to reduce the number of handling devices, thus keeping the network complexity low and limiting the packet's traffic congestion. In this paper, the medium access management, operated by the central node, has been modeled, focusing on the scheduling procedure in both connectionless and connection-oriented communication. The models have been merged to provide a tool supporting the configuration design of BLE devices, during the network design phase that precedes the real implementation. The results highlight the suitability of the proposed tool: the ability to set the device parameters to allow us to keep a practical discovery latency for event-driven sensors and avoid undesired overlaps between scheduled scanning and connection phases due to bad management performed by the central node.
Cross-Layer Resource Allocation for Wireless Visual Sensor Networks and Mobile Ad Hoc Networks
2014-10-01
MMD), minimizes the maximum dis- tortion among all nodes of the network, promoting a rather unbiased treatment of the nodes. We employed the Particle...achieve the ideal tradeoff between the transmitted video quality and energy consumption. Each sensor node has a bit rate that can be used for both...Distortion (MMD), minimizes the maximum distortion among all nodes of the network, promoting a rather unbiased treatment of the nodes. For both criteria
Frequency-agile wireless sensor networks
NASA Astrophysics Data System (ADS)
Arms, Steven W.; Townsend, Christopher P.; Churchill, David L.; Hamel, Michael J.; Galbreath, Jacob H.; Mundell, Steven W.
2004-07-01
Our goal was to demonstrate a wireless communications system capable of simultaneous, high speed data communications from a variety of sensors. We have previously reported on the design and application of 2 KHz data logging transceiver nodes, however, only one node may stream data at a time, since all nodes on the network use the same communications frequency. To overcome these limitations, second generation data logging transceivers were developed with software programmable radio frequency (RF) communications. Each node contains on-board memory (2 Mbytes), sensor excitation, instrumentation amplifiers with programmable gains & offsets, multiplexer, 16 bit A/D converter, microcontroller, and frequency agile, bi-directional, frequency shift keyed (FSK) RF serial data link. These systems are capable of continuous data transmission from 26 distinct nodes (902-928 MHz band, 75 kbaud). The system was demonstrated in a compelling structural monitoring application. The National Parks Service requested a means for continual monitoring and recording of sensor data from the Liberty Bell during a move to a new location (Philadelphia, October 2003). Three distinct, frequency agile, wireless sensing nodes were used to detect visible crack shear/opening micromotions, triaxial accelerations, and hairline crack tip strains. The wireless sensors proved to be useful in protecting the Liberty Bell.
Multi-Source Cooperative Data Collection with a Mobile Sink for the Wireless Sensor Network.
Han, Changcai; Yang, Jinsheng
2017-10-30
The multi-source cooperation integrating distributed low-density parity-check codes is investigated to jointly collect data from multiple sensor nodes to the mobile sink in the wireless sensor network. The one-round and two-round cooperative data collection schemes are proposed according to the moving trajectories of the sink node. Specifically, two sparse cooperation models are firstly formed based on geographical locations of sensor source nodes, the impairment of inter-node wireless channels and moving trajectories of the mobile sink. Then, distributed low-density parity-check codes are devised to match the directed graphs and cooperation matrices related with the cooperation models. In the proposed schemes, each source node has quite low complexity attributed to the sparse cooperation and the distributed processing. Simulation results reveal that the proposed cooperative data collection schemes obtain significant bit error rate performance and the two-round cooperation exhibits better performance compared with the one-round scheme. The performance can be further improved when more source nodes participate in the sparse cooperation. For the two-round data collection schemes, the performance is evaluated for the wireless sensor networks with different moving trajectories and the variant data sizes.
Multi-Source Cooperative Data Collection with a Mobile Sink for the Wireless Sensor Network
Han, Changcai; Yang, Jinsheng
2017-01-01
The multi-source cooperation integrating distributed low-density parity-check codes is investigated to jointly collect data from multiple sensor nodes to the mobile sink in the wireless sensor network. The one-round and two-round cooperative data collection schemes are proposed according to the moving trajectories of the sink node. Specifically, two sparse cooperation models are firstly formed based on geographical locations of sensor source nodes, the impairment of inter-node wireless channels and moving trajectories of the mobile sink. Then, distributed low-density parity-check codes are devised to match the directed graphs and cooperation matrices related with the cooperation models. In the proposed schemes, each source node has quite low complexity attributed to the sparse cooperation and the distributed processing. Simulation results reveal that the proposed cooperative data collection schemes obtain significant bit error rate performance and the two-round cooperation exhibits better performance compared with the one-round scheme. The performance can be further improved when more source nodes participate in the sparse cooperation. For the two-round data collection schemes, the performance is evaluated for the wireless sensor networks with different moving trajectories and the variant data sizes. PMID:29084155
The Robustness Analysis of Wireless Sensor Networks under Uncertain Interference
Deng, Changjian
2013-01-01
Based on the complex network theory, robustness analysis of condition monitoring wireless sensor network under uncertain interference is present. In the evolution of the topology of sensor networks, the density weighted algebraic connectivity is taken into account, and the phenomenon of removing and repairing the link and node in the network is discussed. Numerical simulation is conducted to explore algebraic connectivity characteristics and network robustness performance. It is found that nodes density has the effect on algebraic connectivity distribution in the random graph model; high density nodes carry more connections, use more throughputs, and may be more unreliable. Moreover, the results show that, when network should be more error tolerant or robust by repairing nodes or adding new nodes, the network should be better clustered in median and high scale wireless sensor networks and be meshing topology in small scale networks. PMID:24363613
NASA Astrophysics Data System (ADS)
Muhammad, Umar B.; Ezugwu, Absalom E.; Ofem, Paulinus O.; Rajamäki, Jyri; Aderemi, Adewumi O.
2017-06-01
Recently, researchers in the field of wireless sensor networks have resorted to energy harvesting techniques that allows energy to be harvested from the ambient environment to power sensor nodes. Using such Energy harvesting techniques together with proper routing protocols, an Energy Neutral state can be achieved so that sensor nodes can run perpetually. In this paper, we propose an Energy Neutral LEACH routing protocol which is an extension to the traditional LEACH protocol. The goal of the proposed protocol is to use Gateway node in each cluster so as to reduce the data transmission ranges of cluster head nodes. Simulation results show that the proposed routing protocol achieves a higher throughput and ensure the energy neutral status of the entire network.
In-network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection
NASA Astrophysics Data System (ADS)
Albano, Michele; Gao, Jie
In a sensor network of n nodes in which k of them have sensed interesting data, we perform in-network erasure coding such that each node stores a linear combination of all the network data with random coefficients. This scheme greatly improves data resilience to node failures: as long as there are k nodes that survive an attack, all the data produced in the sensor network can be recovered with high probability. The in-network coding storage scheme also improves data collection rate by mobile mules and allows for easy scheduling of data mules.
ESAM: Endocrine inspired Sensor Activation Mechanism for multi-target tracking in WSNs
NASA Astrophysics Data System (ADS)
Adil Mahdi, Omar; Wahab, Ainuddin Wahid Abdul; Idris, Mohd Yamani Idna; Znaid, Ammar Abu; Khan, Suleman; Al-Mayouf, Yusor Rafid Bahar
2016-10-01
Target tracking is a significant application of wireless sensor networks (WSNs) in which deployment of self-organizing and energy efficient algorithms is required. The tracking accuracy increases as more sensor nodes are activated around the target but more energy is consumed. Thus, in this study, we focus on limiting the number of sensors by forming an ad-hoc network that operates autonomously. This will reduce the energy consumption and prolong the sensor network lifetime. In this paper, we propose a fully distributed algorithm, an Endocrine inspired Sensor Activation Mechanism for multi target-tracking (ESAM) which reflecting the properties of real life sensor activation system based on the information circulating principle in the endocrine system of the human body. Sensor nodes in our network are secreting different hormones according to certain rules. The hormone level enables the nodes to regulate an efficient sleep and wake up cycle of nodes to reduce the energy consumption. It is evident from the simulation results that the proposed ESAM in autonomous sensor network exhibits a stable performance without the need of commands from a central controller. Moreover, the proposed ESAM generates more efficient and persistent results as compared to other algorithms for tracking an invading object.
Intelligent self-organization methods for wireless ad hoc sensor networks based on limited resources
NASA Astrophysics Data System (ADS)
Hortos, William S.
2006-05-01
A wireless ad hoc sensor network (WSN) is a configuration for area surveillance that affords rapid, flexible deployment in arbitrary threat environments. There is no infrastructure support and sensor nodes communicate with each other only when they are in transmission range. To a greater degree than the terminals found in mobile ad hoc networks (MANETs) for communications, sensor nodes are resource-constrained, with limited computational processing, bandwidth, memory, and power, and are typically unattended once in operation. Consequently, the level of information exchange among nodes, to support any complex adaptive algorithms to establish network connectivity and optimize throughput, not only deplete those limited resources and creates high overhead in narrowband communications, but also increase network vulnerability to eavesdropping by malicious nodes. Cooperation among nodes, critical to the mission of sensor networks, can thus be disrupted by the inappropriate choice of the method for self-organization. Recent published contributions to the self-configuration of ad hoc sensor networks, e.g., self-organizing mapping and swarm intelligence techniques, have been based on the adaptive control of the cross-layer interactions found in MANET protocols to achieve one or more performance objectives: connectivity, intrusion resistance, power control, throughput, and delay. However, few studies have examined the performance of these algorithms when implemented with the limited resources of WSNs. In this paper, self-organization algorithms for the initiation, operation and maintenance of a network topology from a collection of wireless sensor nodes are proposed that improve the performance metrics significant to WSNs. The intelligent algorithm approach emphasizes low computational complexity, energy efficiency and robust adaptation to change, allowing distributed implementation with the actual limited resources of the cooperative nodes of the network. Extensions of the algorithms from flat topologies to two-tier hierarchies of sensor nodes are presented. Results from a few simulations of the proposed algorithms are compared to the published results of other approaches to sensor network self-organization in common scenarios. The estimated network lifetime and extent under static resource allocations are computed.
Zhang, Gongxuan; Wang, Yongli; Wang, Tianshu
2018-01-01
We study the problem of employing a mobile-sink into a large-scale Event-Driven Wireless Sensor Networks (EWSNs) for the purpose of data harvesting from sensor-nodes. Generally, this employment improves the main weakness of WSNs that is about energy-consumption in battery-driven sensor-nodes. The main motivation of our work is to address challenges which are related to a network’s topology by adopting a mobile-sink that moves in a predefined trajectory in the environment. Since, in this fashion, it is not possible to gather data from sensor-nodes individually, we adopt the approach of defining some of the sensor-nodes as Rendezvous Points (RPs) in the network. We argue that RP-planning in this case is a tradeoff between minimizing the number of RPs while decreasing the number of hops for a sensor-node that needs data transformation to the related RP which leads to minimizing average energy consumption in the network. We address the problem by formulating the challenges and expectations as a Mixed Integer Linear Programming (MILP). Henceforth, by proving the NP-hardness of the problem, we propose three effective and distributed heuristics for RP-planning, identifying sojourn locations, and constructing routing trees. Finally, experimental results prove the effectiveness of our approach. PMID:29734718
Vajdi, Ahmadreza; Zhang, Gongxuan; Zhou, Junlong; Wei, Tongquan; Wang, Yongli; Wang, Tianshu
2018-05-04
We study the problem of employing a mobile-sink into a large-scale Event-Driven Wireless Sensor Networks (EWSNs) for the purpose of data harvesting from sensor-nodes. Generally, this employment improves the main weakness of WSNs that is about energy-consumption in battery-driven sensor-nodes. The main motivation of our work is to address challenges which are related to a network’s topology by adopting a mobile-sink that moves in a predefined trajectory in the environment. Since, in this fashion, it is not possible to gather data from sensor-nodes individually, we adopt the approach of defining some of the sensor-nodes as Rendezvous Points (RPs) in the network. We argue that RP-planning in this case is a tradeoff between minimizing the number of RPs while decreasing the number of hops for a sensor-node that needs data transformation to the related RP which leads to minimizing average energy consumption in the network. We address the problem by formulating the challenges and expectations as a Mixed Integer Linear Programming (MILP). Henceforth, by proving the NP-hardness of the problem, we propose three effective and distributed heuristics for RP-planning, identifying sojourn locations, and constructing routing trees. Finally, experimental results prove the effectiveness of our approach.
NASA Astrophysics Data System (ADS)
Li, Jian; Plotnikov, Yuri; Lin, Wendy W.
2008-02-01
A low power wireless sensor network was developed to monitor the microcrack events in aerospace composites. The microcracks in the composites mostly result from a stress loading or temperature and/or humidity cycles. Generally, a single microcrack is too small to be detected by conventional techniques such as X-ray or ultrasonic C-scan. The whole developed sensor network is aimed to capture the released acoustic signals by the microcracking events in real time. It comprises of a receiving station as well as a series of sensor nodes. Each sensor node includes two acoustic emission transducers as well as two signal amplification and data acquisition channels. Much of our development effort has been focused on reducing the power consumption of each node and improving the detection reliability for each event. Each sensor node is battery-powered and works in a sleep mode most of time. Once a microcrack is initiated in the composite, the acoustic signal triggers the node and wakes it up. The node will then react in several microseconds and digitize the signal. The digitized data is sent to the station wirelessly. The developed wireless sensor network system has been validated with microscopy of microcracked samples after temperature and humidity cycling and has proved to be an effective tool for microcracking detection. Furthermore, our low power consumption design and sophisticated wireless transmission mechanism enables a system with great potential for field structural health monitoring applications.
Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Li, Baoqing; Yuan, Xiaobing
2017-01-01
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. PMID:28753962
A Game Theoretic Approach for Balancing Energy Consumption in Clustered Wireless Sensor Networks
Lu, Yinzhi; Xiong, Lian; Tao, Yang; Zhong, Yuanchang
2017-01-01
Clustering is an effective topology control method in wireless sensor networks (WSNs), since it can enhance the network lifetime and scalability. To prolong the network lifetime in clustered WSNs, an efficient cluster head (CH) optimization policy is essential to distribute the energy among sensor nodes. Recently, game theory has been introduced to model clustering. Each sensor node is considered as a rational and selfish player which will play a clustering game with an equilibrium strategy. Then it decides whether to act as the CH according to this strategy for a tradeoff between providing required services and energy conservation. However, how to get the equilibrium strategy while maximizing the payoff of sensor nodes has rarely been addressed to date. In this paper, we present a game theoretic approach for balancing energy consumption in clustered WSNs. With our novel payoff function, realistic sensor behaviors can be captured well. The energy heterogeneity of nodes is considered by incorporating a penalty mechanism in the payoff function, so the nodes with more energy will compete for CHs more actively. We have obtained the Nash equilibrium (NE) strategy of the clustering game through convex optimization. Specifically, each sensor node can achieve its own maximal payoff when it makes the decision according to this strategy. Through plenty of simulations, our proposed game theoretic clustering is proved to have a good energy balancing performance and consequently the network lifetime is greatly enhanced. PMID:29149075
Field-Based Optimal Placement of Antennas for Body-Worn Wireless Sensors
Januszkiewicz, Łukasz; Di Barba, Paolo; Hausman, Sławomir
2016-01-01
We investigate a case of automated energy-budget-aware optimization of the physical position of nodes (sensors) in a Wireless Body Area Network (WBAN). This problem has not been presented in the literature yet, as opposed to antenna and routing optimization, which are relatively well-addressed. In our research, which was inspired by a safety-critical application for firefighters, the sensor network consists of three nodes located on the human body. The nodes communicate over a radio link operating in the 2.4 GHz or 5.8 GHz ISM frequency band. Two sensors have a fixed location: one on the head (earlobe pulse oximetry) and one on the arm (with accelerometers, temperature and humidity sensors, and a GPS receiver), while the position of the third sensor can be adjusted within a predefined region on the wearer’s chest. The path loss between each node pair strongly depends on the location of the nodes and is difficult to predict without performing a full-wave electromagnetic simulation. Our optimization scheme employs evolutionary computing. The novelty of our approach lies not only in the formulation of the problem but also in linking a fully automated optimization procedure with an electromagnetic simulator and a simplified human body model. This combination turns out to be a computationally effective solution, which, depending on the initial placement, has a potential to improve performance of our example sensor network setup by up to about 20 dB with respect to the path loss between selected nodes. PMID:27196911
Efficient sensor network vehicle classification using peak harmonics of acoustic emissions
NASA Astrophysics Data System (ADS)
William, Peter E.; Hoffman, Michael W.
2008-04-01
An application is proposed for detection and classification of battlefield ground vehicles using the emitted acoustic signal captured at individual sensor nodes of an ad hoc Wireless Sensor Network (WSN). We make use of the harmonic characteristics of the acoustic emissions of battlefield vehicles, in reducing both the computations carried on the sensor node and the transmitted data to the fusion center for reliable and effcient classification of targets. Previous approaches focus on the lower frequency band of the acoustic emissions up to 500Hz; however, we show in the proposed application how effcient discrimination between battlefield vehicles is performed using features extracted from higher frequency bands (50 - 1500Hz). The application shows that selective time domain acoustic features surpass equivalent spectral features. Collaborative signal processing is utilized, such that estimation of certain signal model parameters is carried by the sensor node, in order to reduce the communication between the sensor node and the fusion center, while the remaining model parameters are estimated at the fusion center. The transmitted data from the sensor node to the fusion center ranges from 1 ~ 5% of the sampled acoustic signal at the node. A variety of classification schemes were examined, such as maximum likelihood, vector quantization and artificial neural networks. Evaluation of the proposed application, through processing of an acoustic data set with comparison to previous results, shows that the improvement is not only in the number of computations but also in the detection and false alarm rate as well.
Information Fusion in Ad hoc Wireless Sensor Networks for Aircraft Health Monitoring
NASA Astrophysics Data System (ADS)
Fragoulis, Nikos; Tsagaris, Vassilis; Anastassopoulos, Vassilis
In this paper the use of an ad hoc wireless sensor network for implementing a structural health monitoring system is discussed. The network is consisted of sensors deployed throughout the aircraft. These sensors being in the form of a microelectronic chip and consisted of sensing, data processing and communicating components could be easily embedded in any mechanical aircraft component. The established sensor network, due to its ad hoc nature is easily scalable, allowing adding or removing any number of sensors. The position of the sensor nodes need not necessarily to be engineered or predetermined, giving this way the ability to be deployed in inaccessible points. Information collected from various sensors of different modalities throughout the aircraft is then fused in order to provide a more comprehensive image of the aircraft structural health. Sensor level fusion along with decision quality information is used, in order to enhance detection performance.
Reliability Evaluation for Clustered WSNs under Malware Propagation.
Shen, Shigen; Huang, Longjun; Liu, Jianhua; Champion, Adam C; Yu, Shui; Cao, Qiying
2016-06-10
We consider a clustered wireless sensor network (WSN) under epidemic-malware propagation conditions and solve the problem of how to evaluate its reliability so as to ensure efficient, continuous, and dependable transmission of sensed data from sensor nodes to the sink. Facing the contradiction between malware intention and continuous-time Markov chain (CTMC) randomness, we introduce a strategic game that can predict malware infection in order to model a successful infection as a CTMC state transition. Next, we devise a novel measure to compute the Mean Time to Failure (MTTF) of a sensor node, which represents the reliability of a sensor node continuously performing tasks such as sensing, transmitting, and fusing data. Since clustered WSNs can be regarded as parallel-serial-parallel systems, the reliability of a clustered WSN can be evaluated via classical reliability theory. Numerical results show the influence of parameters such as the true positive rate and the false positive rate on a sensor node's MTTF. Furthermore, we validate the method of reliability evaluation for a clustered WSN according to the number of sensor nodes in a cluster, the number of clusters in a route, and the number of routes in the WSN.
An Ad-hoc Satellite Network to Measure Filamentary Current Structures in the Auroral Zone
NASA Astrophysics Data System (ADS)
Nabong, C.; Fritz, T. A.; Semeter, J. L.
2014-12-01
An ad-hoc cubesat-based satellite network project known as ANDESITE is under development at Boston University. It aims to develop a dense constellation of easy-to-use, rapidly-deployable low-cost wireless sensor nodes in space. The objectives of the project are threefold: 1) Demonstrate viability of satellite based sensor networks by deploying an 8-node miniature sensor network to study the filamentation of the field aligned currents in the auroral zones of the Earth's magnetosphere. 2) Test the scalability of proposed protocols, including localization techniques, tracking, data aggregation, and routing, for a 3 dimensional wireless sensor network using a "flock" of nodes. 3) Construct a 6U Cube-sat running the Android OS as an integrated constellation manager, data mule and sensor node deplorer. This small network of sensor nodes will resolve current densities at different spatial resolutions in the near-Earth magnetosphere using measurements from magnetometers with 1-nT sensitivities and 0.2 nT/√Hz self-noise. Mapping of these currents will provide new constraints for models of auroral particle acceleration, wave-particle interactions, ionospheric destabilization, and other kinetic processes operating in the low-beta plasma of the near Earth magnetosphere.
Dhamodharan, Udaya Suriya Raj Kumar; Vayanaperumal, Rajamani
2015-01-01
Wireless sensor networks are highly indispensable for securing network protection. Highly critical attacks of various kinds have been documented in wireless sensor network till now by many researchers. The Sybil attack is a massive destructive attack against the sensor network where numerous genuine identities with forged identities are used for getting an illegal entry into a network. Discerning the Sybil attack, sinkhole, and wormhole attack while multicasting is a tremendous job in wireless sensor network. Basically a Sybil attack means a node which pretends its identity to other nodes. Communication to an illegal node results in data loss and becomes dangerous in the network. The existing method Random Password Comparison has only a scheme which just verifies the node identities by analyzing the neighbors. A survey was done on a Sybil attack with the objective of resolving this problem. The survey has proposed a combined CAM-PVM (compare and match-position verification method) with MAP (message authentication and passing) for detecting, eliminating, and eventually preventing the entry of Sybil nodes in the network. We propose a scheme of assuring security for wireless sensor network, to deal with attacks of these kinds in unicasting and multicasting.
Dhamodharan, Udaya Suriya Raj Kumar; Vayanaperumal, Rajamani
2015-01-01
Wireless sensor networks are highly indispensable for securing network protection. Highly critical attacks of various kinds have been documented in wireless sensor network till now by many researchers. The Sybil attack is a massive destructive attack against the sensor network where numerous genuine identities with forged identities are used for getting an illegal entry into a network. Discerning the Sybil attack, sinkhole, and wormhole attack while multicasting is a tremendous job in wireless sensor network. Basically a Sybil attack means a node which pretends its identity to other nodes. Communication to an illegal node results in data loss and becomes dangerous in the network. The existing method Random Password Comparison has only a scheme which just verifies the node identities by analyzing the neighbors. A survey was done on a Sybil attack with the objective of resolving this problem. The survey has proposed a combined CAM-PVM (compare and match-position verification method) with MAP (message authentication and passing) for detecting, eliminating, and eventually preventing the entry of Sybil nodes in the network. We propose a scheme of assuring security for wireless sensor network, to deal with attacks of these kinds in unicasting and multicasting. PMID:26236773
A Cluster-Based Architecture to Structure the Topology of Parallel Wireless Sensor Networks
Lloret, Jaime; Garcia, Miguel; Bri, Diana; Diaz, Juan R.
2009-01-01
A wireless sensor network is a self-configuring network of mobile nodes connected by wireless links where the nodes have limited capacity and energy. In many cases, the application environment requires the design of an exclusive network topology for a particular case. Cluster-based network developments and proposals in existence have been designed to build a network for just one type of node, where all nodes can communicate with any other nodes in their coverage area. Let us suppose a set of clusters of sensor nodes where each cluster is formed by different types of nodes (e.g., they could be classified by the sensed parameter using different transmitting interfaces, by the node profile or by the type of device: laptops, PDAs, sensor etc.) and exclusive networks, as virtual networks, are needed with the same type of sensed data, or the same type of devices, or even the same type of profiles. In this paper, we propose an algorithm that is able to structure the topology of different wireless sensor networks to coexist in the same environment. It allows control and management of the topology of each network. The architecture operation and the protocol messages will be described. Measurements from a real test-bench will show that the designed protocol has low bandwidth consumption and also demonstrates the viability and the scalability of the proposed architecture. Our ccluster-based algorithm is compared with other algorithms reported in the literature in terms of architecture and protocol measurements. PMID:22303185
Joint Resource Optimization for Cognitive Sensor Networks with SWIPT-Enabled Relay.
Lu, Weidang; Lin, Yuanrong; Peng, Hong; Nan, Tian; Liu, Xin
2017-09-13
Energy-constrained wireless networks, such as wireless sensor networks (WSNs), are usually powered by fixed energy supplies (e.g., batteries), which limits the operation time of networks. Simultaneous wireless information and power transfer (SWIPT) is a promising technique to prolong the lifetime of energy-constrained wireless networks. This paper investigates the performance of an underlay cognitive sensor network (CSN) with SWIPT-enabled relay node. In the CSN, the amplify-and-forward (AF) relay sensor node harvests energy from the ambient radio-frequency (RF) signals using power splitting-based relaying (PSR) protocol. Then, it helps forward the signal of source sensor node (SSN) to the destination sensor node (DSN) by using the harvested energy. We study the joint resource optimization including the transmit power and power splitting ratio to maximize CSN's achievable rate with the constraint that the interference caused by the CSN to the primary users (PUs) is within the permissible threshold. Simulation results show that the performance of our proposed joint resource optimization can be significantly improved.
Opportunistic Sensor Data Collection with Bluetooth Low Energy
Aguilar, Sergio; Vidal, Rafael; Gomez, Carles
2017-01-01
Bluetooth Low Energy (BLE) has gained very high momentum, as witnessed by its widespread presence in smartphones, wearables and other consumer electronics devices. This fact can be leveraged to carry out opportunistic sensor data collection (OSDC) in scenarios where a sensor node cannot communicate with infrastructure nodes. In such cases, a mobile entity (e.g., a pedestrian or a vehicle) equipped with a BLE-enabled device can collect the data obtained by the sensor node when both are within direct communication range. In this paper, we characterize, both analytically and experimentally, the performance and trade-offs of BLE as a technology for OSDC, for the two main identified approaches, and considering the impact of its most crucial configuration parameters. Results show that a BLE sensor node running on a coin cell battery can achieve a lifetime beyond one year while transferring around 10 Mbit/day, in realistic OSDC scenarios. PMID:28124987
Opportunistic Sensor Data Collection with Bluetooth Low Energy.
Aguilar, Sergio; Vidal, Rafael; Gomez, Carles
2017-01-23
Bluetooth Low Energy (BLE) has gained very high momentum, as witnessed by its widespread presence in smartphones, wearables and other consumer electronics devices. This fact can be leveraged to carry out opportunistic sensor data collection (OSDC) in scenarios where a sensor node cannot communicate with infrastructure nodes. In such cases, a mobile entity (e.g., a pedestrian or a vehicle) equipped with a BLE-enabled device can collect the data obtained by the sensor node when both are within direct communication range. In this paper, we characterize, both analytically and experimentally, the performance and trade-offs of BLE as a technology for OSDC, for the two main identified approaches, and considering the impact of its most crucial configuration parameters. Results show that a BLE sensor node running on a coin cell battery can achieve a lifetime beyond one year while transferring around 10 Mbit/day, in realistic OSDC scenarios.
CMOS: Efficient Clustered Data Monitoring in Sensor Networks
2013-01-01
Tiny and smart sensors enable applications that access a network of hundreds or thousands of sensors. Thus, recently, many researchers have paid attention to wireless sensor networks (WSNs). The limitation of energy is critical since most sensors are battery-powered and it is very difficult to replace batteries in cases that sensor networks are utilized outdoors. Data transmission between sensor nodes needs more energy than computation in a sensor node. In order to reduce the energy consumption of sensors, we present an approximate data gathering technique, called CMOS, based on the Kalman filter. The goal of CMOS is to efficiently obtain the sensor readings within a certain error bound. In our approach, spatially close sensors are grouped as a cluster. Since a cluster header generates approximate readings of member nodes, a user query can be answered efficiently using the cluster headers. In addition, we suggest an energy efficient clustering method to distribute the energy consumption of cluster headers. Our simulation results with synthetic data demonstrate the efficiency and accuracy of our proposed technique. PMID:24459444
CMOS: efficient clustered data monitoring in sensor networks.
Min, Jun-Ki
2013-01-01
Tiny and smart sensors enable applications that access a network of hundreds or thousands of sensors. Thus, recently, many researchers have paid attention to wireless sensor networks (WSNs). The limitation of energy is critical since most sensors are battery-powered and it is very difficult to replace batteries in cases that sensor networks are utilized outdoors. Data transmission between sensor nodes needs more energy than computation in a sensor node. In order to reduce the energy consumption of sensors, we present an approximate data gathering technique, called CMOS, based on the Kalman filter. The goal of CMOS is to efficiently obtain the sensor readings within a certain error bound. In our approach, spatially close sensors are grouped as a cluster. Since a cluster header generates approximate readings of member nodes, a user query can be answered efficiently using the cluster headers. In addition, we suggest an energy efficient clustering method to distribute the energy consumption of cluster headers. Our simulation results with synthetic data demonstrate the efficiency and accuracy of our proposed technique.
An efficient management system for wireless sensor networks.
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.
Simple Random Sampling-Based Probe Station Selection for Fault Detection in Wireless Sensor Networks
Huang, Rimao; Qiu, Xuesong; Rui, Lanlan
2011-01-01
Fault detection for wireless sensor networks (WSNs) has been studied intensively in recent years. Most existing works statically choose the manager nodes as probe stations and probe the network at a fixed frequency. This straightforward solution leads however to several deficiencies. Firstly, by only assigning the fault detection task to the manager node the whole network is out of balance, and this quickly overloads the already heavily burdened manager node, which in turn ultimately shortens the lifetime of the whole network. Secondly, probing with a fixed frequency often generates too much useless network traffic, which results in a waste of the limited network energy. Thirdly, the traditional algorithm for choosing a probing node is too complicated to be used in energy-critical wireless sensor networks. In this paper, we study the distribution characters of the fault nodes in wireless sensor networks, validate the Pareto principle that a small number of clusters contain most of the faults. We then present a Simple Random Sampling-based algorithm to dynamic choose sensor nodes as probe stations. A dynamic adjusting rule for probing frequency is also proposed to reduce the number of useless probing packets. The simulation experiments demonstrate that the algorithm and adjusting rule we present can effectively prolong the lifetime of a wireless sensor network without decreasing the fault detected rate. PMID:22163789
Huang, Rimao; Qiu, Xuesong; Rui, Lanlan
2011-01-01
Fault detection for wireless sensor networks (WSNs) has been studied intensively in recent years. Most existing works statically choose the manager nodes as probe stations and probe the network at a fixed frequency. This straightforward solution leads however to several deficiencies. Firstly, by only assigning the fault detection task to the manager node the whole network is out of balance, and this quickly overloads the already heavily burdened manager node, which in turn ultimately shortens the lifetime of the whole network. Secondly, probing with a fixed frequency often generates too much useless network traffic, which results in a waste of the limited network energy. Thirdly, the traditional algorithm for choosing a probing node is too complicated to be used in energy-critical wireless sensor networks. In this paper, we study the distribution characters of the fault nodes in wireless sensor networks, validate the Pareto principle that a small number of clusters contain most of the faults. We then present a Simple Random Sampling-based algorithm to dynamic choose sensor nodes as probe stations. A dynamic adjusting rule for probing frequency is also proposed to reduce the number of useless probing packets. The simulation experiments demonstrate that the algorithm and adjusting rule we present can effectively prolong the lifetime of a wireless sensor network without decreasing the fault detected rate.
A Distributed Signature Detection Method for Detecting Intrusions in Sensor Systems
Kim, Ilkyu; Oh, Doohwan; Yoon, Myung Kuk; Yi, Kyueun; Ro, Won Woo
2013-01-01
Sensor nodes in wireless sensor networks are easily exposed to open and unprotected regions. A security solution is strongly recommended to prevent networks against malicious attacks. Although many intrusion detection systems have been developed, most systems are difficult to implement for the sensor nodes owing to limited computation resources. To address this problem, we develop a novel distributed network intrusion detection system based on the Wu–Manber algorithm. In the proposed system, the algorithm is divided into two steps; the first step is dedicated to a sensor node, and the second step is assigned to a base station. In addition, the first step is modified to achieve efficient performance under limited computation resources. We conduct evaluations with random string sets and actual intrusion signatures to show the performance improvement of the proposed method. The proposed method achieves a speedup factor of 25.96 and reduces 43.94% of packet transmissions to the base station compared with the previously proposed method. The system achieves efficient utilization of the sensor nodes and provides a structural basis of cooperative systems among the sensors. PMID:23529146
A distributed signature detection method for detecting intrusions in sensor systems.
Kim, Ilkyu; Oh, Doohwan; Yoon, Myung Kuk; Yi, Kyueun; Ro, Won Woo
2013-03-25
Sensor nodes in wireless sensor networks are easily exposed to open and unprotected regions. A security solution is strongly recommended to prevent networks against malicious attacks. Although many intrusion detection systems have been developed, most systems are difficult to implement for the sensor nodes owing to limited computation resources. To address this problem, we develop a novel distributed network intrusion detection system based on the Wu-Manber algorithm. In the proposed system, the algorithm is divided into two steps; the first step is dedicated to a sensor node, and the second step is assigned to a base station. In addition, the first step is modified to achieve efficient performance under limited computation resources. We conduct evaluations with random string sets and actual intrusion signatures to show the performance improvement of the proposed method. The proposed method achieves a speedup factor of 25.96 and reduces 43.94% of packet transmissions to the base station compared with the previously proposed method. The system achieves efficient utilization of the sensor nodes and provides a structural basis of cooperative systems among the sensors.
Air launch wireless sensor nodes (ALSN) for battle damage assessment (BDA)
NASA Astrophysics Data System (ADS)
Back, Jason M.; Beck, Steven D.; Frank, Mark A.; Hoenes, Eric
2006-05-01
This paper summarizes the Defense Threat Reduction Agency (DTRA) sponsored development and demonstration of an Air Launched Sensor Node (ALSN) system designed to fill DTRA's immediate need to support the Global Strike requirement of weapon-borne deliverable sensors for Battle Damage Assessment (BDA). Unattended ground sensors were integrated into a CBU-103 Tactical Munitions Dispenser (TMD), and flight test demonstrated with the 46 th Test Wing at Eglin AFB, FL. The objectives of the ALSN program were to repackage an existing multi-sensor node system to conform to the payload envelope and deployment configuration design; to integrate this payload into the CBU-103 TMD; and to conduct a combined payload flight test demonstration. The final sensor node included multiple sensors a microphone, a geophone, and multiple directional Passive Infrared (PIR) detectors with processing electronics, a low power wireless communications 802.15.4 mesh network, GPS (Global Positioning System), and power integrated into a form-fit BLU-97 munitions deployable package. This paper will present and discuss the flight test, results, and ALSN performance.
Distributed clone detection in static wireless sensor networks: random walk with network division.
Khan, Wazir Zada; Aalsalem, Mohammed Y; Saad, N M
2015-01-01
Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.
Supplying the power requirements to a sensor network using radio frequency power transfer.
Percy, Steven; Knight, Chris; Cooray, Francis; Smart, Ken
2012-01-01
Wireless power transmission is a method of supplying power to small electronic devices when there is no wired connection. One way to increase the range of these systems is to use a directional transmitting antenna, the problem with this approach is that power can only be transmitted through a narrow beam and directly forward, requiring the transmitter to always be aligned with the sensor node position. The work outlined in this article describes the design and testing of an autonomous radio frequency power transfer system that is capable of rotating the base transmitter to track the position of sensor nodes and transferring power to that sensor node. The system's base station monitors the node's energy levels and forms a charge queue to plan charging order and maintain energy levels of the nodes. Results show a radio frequency harvesting circuit with a measured S11 value of -31.5 dB and a conversion efficiency of 39.1%. Simulation and experimentation verified the level of power transfer and efficiency. The results of this work show a small network of three nodes with different storage types powered by a central base node.
An Eccentricity Based Data Routing Protocol with Uniform Node Distribution in 3D WSN.
Hosen, A S M Sanwar; Cho, Gi Hwan; Ra, In-Ho
2017-09-16
Due to nonuniform node distribution, the energy consumption of nodes are imbalanced in clustering-based wireless sensor networks (WSNs). It might have more impact when nodes are deployed in a three-dimensional (3D) environment. In this regard, we propose the eccentricity based data routing (EDR) protocol in a 3D WSN with uniform node distribution. It includes network partitions called 3D subspaces/clusters of equal member nodes, an energy-efficient routing centroid (RC) nodes election and data routing algorithm. The RC nodes election conducts in a quasi-static nature until a certain period unlike the periodic cluster heads election of typical clustering-based routing. It not only reduces the energy consumption of nodes during the election phase, but also in intra-communication. At the same time, the routing algorithm selects a forwarding node in such a way that balances the energy consumption among RC nodes and reduces the number of hops towards the sink. The simulation results validate and ensure the performance supremacy of the EDR protocol compared to existing protocols in terms of various metrics such as steady state and network lifetime in particular. Meanwhile, the results show the EDR is more robust in uniform node distribution compared to nonuniform.
An Eccentricity Based Data Routing Protocol with Uniform Node Distribution in 3D WSN
Hosen, A. S. M. Sanwar; Cho, Gi Hwan; Ra, In-Ho
2017-01-01
Due to nonuniform node distribution, the energy consumption of nodes are imbalanced in clustering-based wireless sensor networks (WSNs). It might have more impact when nodes are deployed in a three-dimensional (3D) environment. In this regard, we propose the eccentricity based data routing (EDR) protocol in a 3D WSN with uniform node distribution. It includes network partitions called 3D subspaces/clusters of equal member nodes, an energy-efficient routing centroid (RC) nodes election and data routing algorithm. The RC nodes election conducts in a quasi-static nature until a certain period unlike the periodic cluster heads election of typical clustering-based routing. It not only reduces the energy consumption of nodes during the election phase, but also in intra-communication. At the same time, the routing algorithm selects a forwarding node in such a way that balances the energy consumption among RC nodes and reduces the number of hops towards the sink. The simulation results validate and ensure the performance supremacy of the EDR protocol compared to existing protocols in terms of various metrics such as steady state and network lifetime in particular. Meanwhile, the results show the EDR is more robust in uniform node distribution compared to nonuniform. PMID:28926958
Development of esMOCA Biomechanic, Motion Capture Instrumentation for Biomechanics Analysis
NASA Astrophysics Data System (ADS)
Arendra, A.; Akhmad, S.
2018-01-01
This study aims to build motion capture instruments using inertial measurement unit sensors to assist in the analysis of biomechanics. Sensors used are accelerometer and gyroscope. Estimation of orientation sensors is done by digital motion processing in each sensor nodes. There are nine sensor nodes attached to the upper limbs. This sensor is connected to the pc via a wireless sensor network. The development of kinematics and inverse dynamamic models of the upper limb is done in simulink simmechanic. The kinematic model receives streaming data of sensor nodes mounted on the limbs. The output of the kinematic model is the pose of each limbs and visualized on display. The dynamic inverse model outputs the reaction force and reaction moment of each joint based on the limb motion input. Model validation in simulink with mathematical model of mechanical analysis showed results that did not differ significantly
NASA Astrophysics Data System (ADS)
Cowell, Martin Andrew
The world already hosts more internet connected devices than people, and that ratio is only increasing. These devices seamlessly integrate with peoples lives to collect rich data and give immediate feedback about complex systems from business, health care, transportation, and security. As every aspect of global economies integrate distributed computing into their industrial systems and these systems benefit from rich datasets. Managing the power demands of these distributed computers will be paramount to ensure the continued operation of these networks, and is elegantly addressed by including local energy harvesting and storage on a per-node basis. By replacing non-rechargeable batteries with energy harvesting, wireless sensor nodes will increase their lifetimes by an order of magnitude. This work investigates the coupling of high power energy storage with energy harvesting technologies to power wireless sensor nodes; with sections covering device manufacturing, system integration, and mathematical modeling. First we consider the energy storage mechanism of supercapacitors and batteries, and identify favorable characteristics in both reservoir types. We then discuss experimental methods used to manufacture high power supercapacitors in our labs. We go on to detail the integration of our fabricated devices with collaborating labs to create functional sensor node demonstrations. With the practical knowledge gained through in-lab manufacturing and system integration, we build mathematical models to aid in device and system design. First, we model the mechanism of energy storage in porous graphene supercapacitors to aid in component architecture optimization. We then model the operation of entire sensor nodes for the purpose of optimally sizing the energy harvesting and energy reservoir components. In consideration of deploying these sensor nodes in real-world environments, we model the operation of our energy harvesting and power management systems subject to spatially and temporally varying energy availability in order to understand sensor node reliability. Looking to the future, we see an opportunity for further research to implement machine learning algorithms to control the energy resources of distributed computing networks.
NASA Astrophysics Data System (ADS)
Pignaton de Freitas, Edison; Heimfarth, Tales; Pereira, Carlos Eduardo; Morado Ferreira, Armando; Rech Wagner, Flávio; Larsson, Tony
2010-04-01
A current trend that is gaining strength in the wireless sensor network area is the use of heterogeneous sensor nodes in one coordinated overall network, needed to fulfill the requirements of sophisticated emerging applications, such as area surveillance systems. One of the main concerns when developing such sensor networks is how to provide coordination among the heterogeneous nodes, in order to enable them to efficiently respond the user needs. This study presents an investigation of strategies to coordinate a set of static sensor nodes on the ground cooperating with wirelessly connected Unmanned Aerial Vehicles (UAVs) carrying a variety of sensors, in order to provide efficient surveillance over an area of interest. The sensor nodes on the ground are set to issue alarms on the occurrence of a given event of interest, e.g. entrance of a non-authorized vehicle in the area, while the UAVs receive the issued alarms and have to decide which of them is the most suitable to handle the issued alarm. A bio-inspired coordination strategy based on the concept of pheromones is presented. As a complement of this strategy, a utility-based decision making approach is proposed.
Throughput Maximization for Sensor-Aided Cognitive Radio Networks with Continuous Energy Arrivals
Nguyen, Thanh-Tung; Koo, Insoo
2015-01-01
We consider a Sensor-Aided Cognitive Radio Network (SACRN) in which sensors capable of harvesting energy are distributed throughout the network to support secondary transmitters for sensing licensed channels in order to improve both energy and spectral efficiency. Harvesting ambient energy is one of the most promising solutions to mitigate energy deficiency, prolong device lifetime, and partly reduce the battery size of devices. So far, many works related to SACRN have considered single secondary users capable of harvesting energy in whole slot as well as short-term throughput. In the paper, we consider two types of energy harvesting sensor nodes (EHSN): Type-I sensor nodes will harvest ambient energy in whole slot duration, whereas type-II sensor nodes will only harvest energy after carrying out spectrum sensing. In the paper, we also investigate long-term throughput in the scheduling window, and formulate the throughput maximization problem by considering energy-neutral operation conditions of type-I and -II sensors and the target detection probability. Through simulations, it is shown that the sensing energy consumption of all sensor nodes can be efficiently managed with the proposed scheme to achieve optimal long-term throughput in the window. PMID:26633393
Resilient Wireless Sensor Networks Using Topology Control: A Review
Huang, Yuanjiang; Martínez, José-Fernán; Sendra, Juana; López, Lourdes
2015-01-01
Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs. PMID:26404272
A Novel Cross-Layer Routing Protocol Based on Network Coding for Underwater Sensor Networks.
Wang, Hao; Wang, Shilian; Bu, Renfei; Zhang, Eryang
2017-08-08
Underwater wireless sensor networks (UWSNs) have attracted increasing attention in recent years because of their numerous applications in ocean monitoring, resource discovery and tactical surveillance. However, the design of reliable and efficient transmission and routing protocols is a challenge due to the low acoustic propagation speed and complex channel environment in UWSNs. In this paper, we propose a novel cross-layer routing protocol based on network coding (NCRP) for UWSNs, which utilizes network coding and cross-layer design to greedily forward data packets to sink nodes efficiently. The proposed NCRP takes full advantages of multicast transmission and decode packets jointly with encoded packets received from multiple potential nodes in the entire network. The transmission power is optimized in our design to extend the life cycle of the network. Moreover, we design a real-time routing maintenance protocol to update the route when detecting inefficient relay nodes. Substantial simulations in underwater environment by Network Simulator 3 (NS-3) show that NCRP significantly improves the network performance in terms of energy consumption, end-to-end delay and packet delivery ratio compared with other routing protocols for UWSNs.
Chen, Yi-Ting; Horng, Mong-Fong; Lo, Chih-Cheng; Chu, Shu-Chuan; Pan, Jeng-Shyang; Liao, Bin-Yih
2013-03-20
Transmission power optimization is the most significant factor in prolonging the lifetime and maintaining the connection quality of wireless sensor networks. Un-optimized transmission power of nodes either interferes with or fails to link neighboring nodes. The optimization of transmission power depends on the expected node degree and node distribution. In this study, an optimization approach to an energy-efficient and full reachability wireless sensor network is proposed. In the proposed approach, an adjustment model of the transmission range with a minimum node degree is proposed that focuses on topology control and optimization of the transmission range according to node degree and node density. The model adjusts the tradeoff between energy efficiency and full reachability to obtain an ideal transmission range. In addition, connectivity and reachability are used as performance indices to evaluate the connection quality of a network. The two indices are compared to demonstrate the practicability of framework through simulation results. Furthermore, the relationship between the indices under the conditions of various node degrees is analyzed to generalize the characteristics of node densities. The research results on the reliability and feasibility of the proposed approach will benefit the future real deployments.
Chen, Yi-Ting; Horng, Mong-Fong; Lo, Chih-Cheng; Chu, Shu-Chuan; Pan, Jeng-Shyang; Liao, Bin-Yih
2013-01-01
Transmission power optimization is the most significant factor in prolonging the lifetime and maintaining the connection quality of wireless sensor networks. Un-optimized transmission power of nodes either interferes with or fails to link neighboring nodes. The optimization of transmission power depends on the expected node degree and node distribution. In this study, an optimization approach to an energy-efficient and full reachability wireless sensor network is proposed. In the proposed approach, an adjustment model of the transmission range with a minimum node degree is proposed that focuses on topology control and optimization of the transmission range according to node degree and node density. The model adjusts the tradeoff between energy efficiency and full reachability to obtain an ideal transmission range. In addition, connectivity and reachability are used as performance indices to evaluate the connection quality of a network. The two indices are compared to demonstrate the practicability of framework through simulation results. Furthermore, the relationship between the indices under the conditions of various node degrees is analyzed to generalize the characteristics of node densities. The research results on the reliability and feasibility of the proposed approach will benefit the future real deployments. PMID:23519351
Xu, Jingjing; Yang, Wei; Zhang, Linyuan; Han, Ruisong; Shao, Xiaotao
2015-01-01
In this paper, a wireless sensor network (WSN) technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA) to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI) arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD) algorithm with particle swarm optimization (PSO), namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER) performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization. PMID:26343660
SEnviro: a sensorized platform proposal using open hardware and open standards.
Trilles, Sergio; Luján, Alejandro; Belmonte, Óscar; Montoliu, Raúl; Torres-Sospedra, Joaquín; Huerta, Joaquín
2015-03-06
The need for constant monitoring of environmental conditions has produced an increase in the development of wireless sensor networks (WSN). The drive towards smart cities has produced the need for smart sensors to be able to monitor what is happening in our cities. This, combined with the decrease in hardware component prices and the increase in the popularity of open hardware, has favored the deployment of sensor networks based on open hardware. The new trends in Internet Protocol (IP) communication between sensor nodes allow sensor access via the Internet, turning them into smart objects (Internet of Things and Web of Things). Currently, WSNs provide data in different formats. There is a lack of communication protocol standardization, which turns into interoperability issues when connecting different sensor networks or even when connecting different sensor nodes within the same network. This work presents a sensorized platform proposal that adheres to the principles of the Internet of Things and theWeb of Things. Wireless sensor nodes were built using open hardware solutions, and communications rely on the HTTP/IP Internet protocols. The Open Geospatial Consortium (OGC) SensorThings API candidate standard was used as a neutral format to avoid interoperability issues. An environmental WSN developed following the proposed architecture was built as a proof of concept. Details on how to build each node and a study regarding energy concerns are presented.
Xu, Jingjing; Yang, Wei; Zhang, Linyuan; Han, Ruisong; Shao, Xiaotao
2015-08-27
In this paper, a wireless sensor network (WSN) technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA) to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI) arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD) algorithm with particle swarm optimization (PSO), namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER) performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization.
SEnviro: A Sensorized Platform Proposal Using Open Hardware and Open Standards
Trilles, Sergio; Luján, Alejandro; Belmonte, Óscar; Montoliu, Raúl; Torres-Sospedra, Joaquín; Huerta, Joaquín
2015-01-01
The need for constant monitoring of environmental conditions has produced an increase in the development of wireless sensor networks (WSN). The drive towards smart cities has produced the need for smart sensors to be able to monitor what is happening in our cities. This, combined with the decrease in hardware component prices and the increase in the popularity of open hardware, has favored the deployment of sensor networks based on open hardware. The new trends in Internet Protocol (IP) communication between sensor nodes allow sensor access via the Internet, turning them into smart objects (Internet of Things and Web of Things). Currently, WSNs provide data in different formats. There is a lack of communication protocol standardization, which turns into interoperability issues when connecting different sensor networks or even when connecting different sensor nodes within the same network. This work presents a sensorized platform proposal that adheres to the principles of the Internet of Things and the Web of Things. Wireless sensor nodes were built using open hardware solutions, and communications rely on the HTTP/IP Internet protocols. The Open Geospatial Consortium (OGC) SensorThings API candidate standard was used as a neutral format to avoid interoperability issues. An environmental WSN developed following the proposed architecture was built as a proof of concept. Details on how to build each node and a study regarding energy concerns are presented. PMID:25756864
Connectivity, Coverage and Placement in Wireless Sensor Networks
Li, Ji; Andrew, Lachlan L.H.; Foh, Chuan Heng; Zukerman, Moshe; Chen, Hsiao-Hwa
2009-01-01
Wireless communication between sensors allows the formation of flexible sensor networks, which can be deployed rapidly over wide or inaccessible areas. However, the need to gather data from all sensors in the network imposes constraints on the distances between sensors. This survey describes the state of the art in techniques for determining the minimum density and optimal locations of relay nodes and ordinary sensors to ensure connectivity, subject to various degrees of uncertainty in the locations of the nodes. PMID:22408474
Defence against Black Hole and Selective Forwarding Attacks for Medical WSNs in the IoT †
Mathur, Avijit; Newe, Thomas; Rao, Muzaffar
2016-01-01
Wireless sensor networks (WSNs) are being used to facilitate monitoring of patients in hospital and home environments. These systems consist of a variety of different components/sensors and many processes like clustering, routing, security, and self-organization. Routing is necessary for medical-based WSNs because it allows remote data delivery and it facilitates network scalability in large hospitals. However, routing entails several problems, mainly due to the open nature of wireless networks, and these need to be addressed. This paper looks at two of the problems that arise due to wireless routing between the nodes and access points of a medical WSN (for IoT use): black hole and selective forwarding (SF) attacks. A solution to the former can readily be provided through the use of cryptographic hashes, while the latter makes use of a neighbourhood watch and threshold-based analysis to detect and correct SF attacks. The scheme proposed here is capable of detecting a selective forwarding attack with over 96% accuracy and successfully identifying the malicious node with 83% accuracy. PMID:26797620
Defence against Black Hole and Selective Forwarding Attacks for Medical WSNs in the IoT.
Mathur, Avijit; Newe, Thomas; Rao, Muzaffar
2016-01-19
Wireless sensor networks (WSNs) are being used to facilitate monitoring of patients in hospital and home environments. These systems consist of a variety of different components/sensors and many processes like clustering, routing, security, and self-organization. Routing is necessary for medical-based WSNs because it allows remote data delivery and it facilitates network scalability in large hospitals. However, routing entails several problems, mainly due to the open nature of wireless networks, and these need to be addressed. This paper looks at two of the problems that arise due to wireless routing between the nodes and access points of a medical WSN (for IoT use): black hole and selective forwarding (SF) attacks. A solution to the former can readily be provided through the use of cryptographic hashes, while the latter makes use of a neighbourhood watch and threshold-based analysis to detect and correct SF attacks. The scheme proposed here is capable of detecting a selective forwarding attack with over 96% accuracy and successfully identifying the malicious node with 83% accuracy.
An Outline of Data Aggregation Security in Heterogeneous Wireless Sensor Networks.
Boubiche, Sabrina; Boubiche, Djallel Eddine; Bilami, Azzedine; Toral-Cruz, Homero
2016-04-12
Data aggregation processes aim to reduce the amount of exchanged data in wireless sensor networks and consequently minimize the packet overhead and optimize energy efficiency. Securing the data aggregation process is a real challenge since the aggregation nodes must access the relayed data to apply the aggregation functions. The data aggregation security problem has been widely addressed in classical homogeneous wireless sensor networks, however, most of the proposed security protocols cannot guarantee a high level of security since the sensor node resources are limited. Heterogeneous wireless sensor networks have recently emerged as a new wireless sensor network category which expands the sensor nodes' resources and capabilities. These new kinds of WSNs have opened new research opportunities where security represents a most attractive area. Indeed, robust and high security level algorithms can be used to secure the data aggregation at the heterogeneous aggregation nodes which is impossible in classical homogeneous WSNs. Contrary to the homogeneous sensor networks, the data aggregation security problem is still not sufficiently covered and the proposed data aggregation security protocols are numberless. To address this recent research area, this paper describes the data aggregation security problem in heterogeneous wireless sensor networks and surveys a few proposed security protocols. A classification and evaluation of the existing protocols is also introduced based on the adopted data aggregation security approach.
Mian, Adnan Noor; Fatima, Mehwish; Khan, Raees; Prakash, Ravi
2014-01-01
Energy efficiency is an important design paradigm in Wireless Sensor Networks (WSNs) and its consumption in dynamic environment is even more critical. Duty cycling of sensor nodes is used to address the energy consumption problem. However, along with advantages, duty cycle aware networks introduce some complexities like synchronization and latency. Due to their inherent characteristics, many traditional routing protocols show low performance in densely deployed WSNs with duty cycle awareness, when sensor nodes are supposed to have high mobility. In this paper we first present a three messages exchange Lightweight Random Walk Routing (LRWR) protocol and then evaluate its performance in WSNs for routing low data rate packets. Through NS-2 based simulations, we examine the LRWR protocol by comparing it with DYMO, a widely used WSN protocol, in both static and dynamic environments with varying duty cycles, assuming the standard IEEE 802.15.4 in lower layers. Results for the three metrics, that is, reliability, end-to-end delay, and energy consumption, show that LRWR protocol outperforms DYMO in scalability, mobility, and robustness, showing this protocol as a suitable choice in low duty cycle and dense WSNs.
Sun, Xingming; Yan, Shuangshuang; Wang, Baowei; Xia, Li; Liu, Qi; Zhang, Hui
2015-01-01
Air temperature (AT) is an extremely vital factor in meteorology, agriculture, military, etc., being used for the prediction of weather disasters, such as drought, flood, frost, etc. Many efforts have been made to monitor the temperature of the atmosphere, like automatic weather stations (AWS). Nevertheless, due to the high cost of specialized AT sensors, they cannot be deployed within a large spatial density. A novel method named the meteorology wireless sensor network relying on a sensing node has been proposed for the purpose of reducing the cost of AT monitoring. However, the temperature sensor on the sensing node can be easily influenced by environmental factors. Previous research has confirmed that there is a close relation between AT and solar radiation (SR). Therefore, this paper presents a method to decrease the error of sensed AT, taking SR into consideration. In this work, we analyzed all of the collected data of AT and SR in May 2014 and found the numerical correspondence between AT error (ATE) and SR. This corresponding relation was used to calculate real-time ATE according to real-time SR and to correct the error of AT in other months. PMID:26213941
Sun, Xingming; Yan, Shuangshuang; Wang, Baowei; Xia, Li; Liu, Qi; Zhang, Hui
2015-07-24
Air temperature (AT) is an extremely vital factor in meteorology, agriculture, military, etc., being used for the prediction of weather disasters, such as drought, flood, frost, etc. Many efforts have been made to monitor the temperature of the atmosphere, like automatic weather stations (AWS). Nevertheless, due to the high cost of specialized AT sensors, they cannot be deployed within a large spatial density. A novel method named the meteorology wireless sensor network relying on a sensing node has been proposed for the purpose of reducing the cost of AT monitoring. However, the temperature sensor on the sensing node can be easily influenced by environmental factors. Previous research has confirmed that there is a close relation between AT and solar radiation (SR). Therefore, this paper presents a method to decrease the error of sensed AT, taking SR into consideration. In this work, we analyzed all of the collected data of AT and SR in May 2014 and found the numerical correspondence between AT error (ATE) and SR. This corresponding relation was used to calculate real-time ATE according to real-time SR and to correct the error of AT in other months.
Development of Light Powered Sensor Networks for Thermal Comfort Measurement
Lee, Dasheng
2008-01-01
Recent technological advances in wireless communications have enabled easy installation of sensor networks with air conditioning equipment control applications. However, the sensor node power supply, through either power lines or battery power, still presents obstacles to the distribution of the sensing systems. In this study, a novel sensor network, powered by the artificial light, was constructed to achieve wireless power transfer and wireless data communications for thermal comfort measurements. The sensing node integrates an IC-based temperature sensor, a radiation thermometer, a relative humidity sensor, a micro machined flow sensor and a microprocessor for predicting mean vote (PMV) calculation. The 935 MHz band RF module was employed for the wireless data communication with a specific protocol based on a special energy beacon enabled mode capable of achieving zero power consumption during the inactive periods of the nodes. A 5W spotlight, with a dual axis tilt platform, can power the distributed nodes over a distance of up to 5 meters. A special algorithm, the maximum entropy method, was developed to estimate the sensing quantity of climate parameters if the communication module did not receive any response from the distributed nodes within a certain time limit. The light-powered sensor networks were able to gather indoor comfort-sensing index levels in good agreement with the comfort-sensing vote (CSV) preferred by a human being and the experimental results within the environment suggested that the sensing system could be used in air conditioning systems to implement a comfort-optimal control strategy. PMID:27873877
A Distributed Data-Gathering Protocol Using AUV in Underwater Sensor Networks
Khan, Jawaad Ullah; Cho, Ho-Shin
2015-01-01
In this paper, we propose a distributed data-gathering scheme using an autonomous underwater vehicle (AUV) working as a mobile sink to gather data from a randomly distributed underwater sensor network where sensor nodes are clustered around several cluster headers. Unlike conventional data-gathering schemes where the AUV visits either every node or every cluster header, the proposed scheme allows the AUV to visit some selected nodes named path-nodes in a way that reduces the overall transmission power of the sensor nodes. Monte Carlo simulations are performed to investigate the performance of the proposed scheme compared with several preexisting techniques employing the AUV in terms of total amount of energy consumption, standard deviation of each node’s energy consumption, latency to gather data at a sink, and controlling overhead. Simulation results show that the proposed scheme not only reduces the total energy consumption but also distributes the energy consumption more uniformly over the network, thereby increasing the lifetime of the network. PMID:26287189
A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks
Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad
2017-01-01
Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole. PMID:28121992
In/Out Status Monitoring in Mobile Asset Tracking with Wireless Sensor Networks
Kim, Kwangsoo; Chung, Chin-Wan
2010-01-01
A mobile asset with a sensor node in a mobile asset tracking system moves around a monitoring area, leaves it, and then returns to the region repeatedly. The system monitors the in/out status of the mobile asset. Due to the continuous movement of the mobile asset, the system may generate an error for the in/out status of the mobile asset. When the mobile asset is inside the region, the system might determine that it is outside, or vice versa. In this paper, we propose a method to detect and correct the incorrect in/out status of the mobile asset. To solve this problem, our approach uses data about the connection state transition and the battery lifetime of the mobile node attached to the mobile asset. The connection state transition is used to classify the mobile node as normal or abnormal. The battery lifetime is used to predict a valid working period for the mobile node. We evaluate our method using real data generated by a medical asset tracking system. The experimental results show that our method, by using the estimated battery life time or by using the invalid connection state, can detect and correct most cases of incorrect in/out statuses generated by the conventional approach. PMID:22319268
A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks.
Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad
2017-01-01
Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole.
In/out status monitoring in mobile asset tracking with wireless sensor networks.
Kim, Kwangsoo; Chung, Chin-Wan
2010-01-01
A mobile asset with a sensor node in a mobile asset tracking system moves around a monitoring area, leaves it, and then returns to the region repeatedly. The system monitors the in/out status of the mobile asset. Due to the continuous movement of the mobile asset, the system may generate an error for the in/out status of the mobile asset. When the mobile asset is inside the region, the system might determine that it is outside, or vice versa. In this paper, we propose a method to detect and correct the incorrect in/out status of the mobile asset. To solve this problem, our approach uses data about the connection state transition and the battery lifetime of the mobile node attached to the mobile asset. The connection state transition is used to classify the mobile node as normal or abnormal. The battery lifetime is used to predict a valid working period for the mobile node. We evaluate our method using real data generated by a medical asset tracking system. The experimental results show that our method, by using the estimated battery life time or by using the invalid connection state, can detect and correct most cases of incorrect in/out statuses generated by the conventional approach.
Addressing practical challenges in utility optimization of mobile wireless sensor networks
NASA Astrophysics Data System (ADS)
Eswaran, Sharanya; Misra, Archan; La Porta, Thomas; Leung, Kin
2008-04-01
This paper examines the practical challenges in the application of the distributed network utility maximization (NUM) framework to the problem of resource allocation and sensor device adaptation in a mission-centric wireless sensor network (WSN) environment. By providing rich (multi-modal), real-time information about a variety of (often inaccessible or hostile) operating environments, sensors such as video, acoustic and short-aperture radar enhance the situational awareness of many battlefield missions. Prior work on the applicability of the NUM framework to mission-centric WSNs has focused on tackling the challenges introduced by i) the definition of an individual mission's utility as a collective function of multiple sensor flows and ii) the dissemination of an individual sensor's data via a multicast tree to multiple consuming missions. However, the practical application and performance of this framework is influenced by several parameters internal to the framework and also by implementation-specific decisions. This is made further complex due to mobile nodes. In this paper, we use discrete-event simulations to study the effects of these parameters on the performance of the protocol in terms of speed of convergence, packet loss, and signaling overhead thereby addressing the challenges posed by wireless interference and node mobility in ad-hoc battlefield scenarios. This study provides better understanding of the issues involved in the practical adaptation of the NUM framework. It also helps identify potential avenues of improvement within the framework and protocol.
Wireless Data-Acquisition System for Testing Rocket Engines
NASA Technical Reports Server (NTRS)
Lin, Chujen; Lonske, Ben; Hou, Yalin; Xu, Yingjiu; Gang, Mei
2007-01-01
A prototype wireless data-acquisition system has been developed as a potential replacement for a wired data-acquisition system heretofore used in testing rocket engines. The traditional use of wires to connect sensors, signal-conditioning circuits, and data acquisition circuitry is time-consuming and prone to error, especially when, as is often the case, many sensors are used in a test. The system includes one master and multiple slave nodes. The master node communicates with a computer via an Ethernet connection. The slave nodes are powered by rechargeable batteries and are packaged in weatherproof enclosures. The master unit and each of the slave units are equipped with a time-modulated ultra-wide-band (TMUWB) radio transceiver, which spreads its RF energy over several gigahertz by transmitting extremely low-power and super-narrow pulses. In this prototype system, each slave node can be connected to as many as six sensors: two sensors can be connected directly to analog-to-digital converters (ADCs) in the slave node and four sensors can be connected indirectly to the ADCs via signal conditioners. The maximum sampling rate for streaming data from any given sensor is about 5 kHz. The bandwidth of one channel of the TM-UWB radio communication system is sufficient to accommodate streaming of data from five slave nodes when they are fully loaded with data collected through all possible sensor connections. TM-UWB radios have a much higher spatial capacity than traditional sinusoidal wave-based radios. Hence, this TM-UWB wireless data-acquisition can be scaled to cover denser sensor setups for rocket engine test stands. Another advantage of TM-UWB radios is that it will not interfere with existing wireless transmission. The maximum radio-communication range between the master node and a slave node for this prototype system is about 50 ft (15 m) when the master and slave transceivers are equipped with small dipole antennas. The range can be increased by changing to larger antennas and/or greater transmission power. The battery life of a slave node ranges from about six hours during operation at full capacity to as long as three days when the system is in a "sleep" mode used to conserve battery charge during times between setup and rocket-engine testing. Batteries can be added to prolong operational lifetimes. The radio transceiver dominates the power consumption.
GaN-based sensor nodes for in situ detection of gases
NASA Technical Reports Server (NTRS)
Son, Kyung-Ah (Inventor); Prokopuk, Nicholas (Inventor); Moon, Jeong-Sun (Inventor)
2008-01-01
A system for detecting chemical/biological substances and a detection method. The system comprises a plurality of sensing units or nodes and a radiofrequency link. Each unit has several sensors with different sensing curves. Each sensor is able to transmit information related to the sensed substance on a specific frequency. The sensors preferably comprise AlGaN/GaN high electron mobility transistors.
NASA Technical Reports Server (NTRS)
Hooker, Stanford B. (Editor); Firestone, Elaine R. (Editor); Gregg, Watson W.
1992-01-01
Due to range safety considerations, the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) ocean color instrument may be required to be launched into a near-noon descending node, as opposed to the ascending node used by the predecessor sensor, the Coastal Zone Color Scanner (CZCS). The relative importance of ascending versus descending near-noon orbits was assessed here to determine if descending node will meet the scientific requirements of SeaWiFS. Analyses focused on ground coverage, local times of coverage, solar and viewing geometries (zenith and azimuth angles), and sun glint. Differences were found in the areas covered by individual orbits, but were not important when taken over a 16 day repeat time. Local time of coverage was also different: for ascending node orbits the Northern Hemisphere was observed in the morning and the Southern Hemisphere in the afternoon, while for descending node orbits the Northern Hemisphere was observed in the afternoon and the Southern in the morning. There were substantial differences in solar azimuth and spacecraft azimuth angles both at equinox and at the Northern Hemisphere summer solstice. Negligible differences in solar and spacecraft zenith angles, relative azimuth angles, and sun glint were obtained at the equinox. However, large differences were found in solar zenith angles, relative azimuths, and sun glint for the solstice. These differences appeared to compensate across the scan, however, an increase in sun glint in descending node over that in ascending node on the western part of the scan was compensated by a decrease on the eastern part of the scan. Thus, no advantage or disadvantage could be conferred upon either ascending node or descending node for noon orbits. Analyses were also performed for ascending and descending node orbits that deviated from a noon equator crossing time. For ascending node, afternoon orbits produced the lowest mean solar zenith angles in the Northern Hemisphere, and morning orbits produced the lowest angles for the Southern Hemisphere. For descending node, morning orbits produced the lowest mean solar zenith angles for the Northern Hemisphere; afternoon orbits produced the lowest angles for the Southern Hemisphere.
An Ultra-low-power Medium Access Control Protocol for Body Sensor Network.
Li, Huaming; Tan, Jindong
2005-01-01
In this paper, a medium access control (MAC) protocol designed for Body Sensor Network (BSN-MAC) is proposed. BSN-MAC is an adaptive, feedback-based and IEEE 802.15.4-compatible MAC protocol. Due to the traffic coupling and sensor diversity characteristics of BSNs, common MAC protocols can not satisfy the unique requirements of the biomedical sensors in BSN. BSN-MAC exploits the feedback information from the deployed sensors to form a closed-loop control of the MAC parameters. A control algorithm is proposed to enable the BSN coordinator to adjust parameters of the IEEE 802.15.4 superframe to achieve both energy efficiency and low latency on energy critical nodes. We evaluate the performance of BSN-MAC using energy efficiency as the primary metric.
NASA Astrophysics Data System (ADS)
Mehne, P.; Lickert, F.; Bäumker, E.; Kroener, M.; Woias, P.
2016-11-01
In this paper we will first present the measurement of temperatures on different positions at a diesel-powered car. As a result, several locations are identified as suitable to implement a wireless sensor node powered by thermal energy harvesting. Based on the data gained a thermoelectric generator (TEG) has been selected, and measurements of energy generation have been performed. Further, a complete energy-autonomous wireless sensor node was designed, including the TEG with its mounting bracket, an electronic power management, and a Bluetooth Low Energy (BLE) sensor node. Based on temperature differences from -10 K up to 75.3 K occurring in test drives, a low power set up was chosen to achieve a system startup time below 10 minutes and to ensure service even under difficult ambient conditions, like high ambient temperatures or a slow movement of the car in stocking traffic. 2 minutes after starting the engine a power about of 10 mW is available from the chosen TEG, and in peak the power exceeds 1 W. In a 50 minute test drive it was possible to generate 650 J of energy. This information was used to develop the complete system, demonstrating the opportunity to deploy energy-autonomous wireless sensor nodes in a car, e.g. for exhaust gas monitoring. The system is used to gather sensor data, like temperature and humidity, and transmits data successfully via BLE to a prepared main node based on a Raspberry Pi.
DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).
Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer
2018-05-12
Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.
DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs)
Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer
2018-01-01
Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime. PMID:29757208
Tien, Nguyen Xuan; Kim, Semog; Rhee, Jong Myung; Park, Sang Yoon
2017-07-25
Fault tolerance has long been a major concern for sensor communications in fault-tolerant cyber physical systems (CPSs). Network failure problems often occur in wireless sensor networks (WSNs) due to various factors such as the insufficient power of sensor nodes, the dislocation of sensor nodes, the unstable state of wireless links, and unpredictable environmental interference. Fault tolerance is thus one of the key requirements for data communications in WSN applications. This paper proposes a novel path redundancy-based algorithm, called dual separate paths (DSP), that provides fault-tolerant communication with the improvement of the network traffic performance for WSN applications, such as fault-tolerant CPSs. The proposed DSP algorithm establishes two separate paths between a source and a destination in a network based on the network topology information. These paths are node-disjoint paths and have optimal path distances. Unicast frames are delivered from the source to the destination in the network through the dual paths, providing fault-tolerant communication and reducing redundant unicast traffic for the network. The DSP algorithm can be applied to wired and wireless networks, such as WSNs, to provide seamless fault-tolerant communication for mission-critical and life-critical applications such as fault-tolerant CPSs. The analyzed and simulated results show that the DSP-based approach not only provides fault-tolerant communication, but also improves network traffic performance. For the case study in this paper, when the DSP algorithm was applied to high-availability seamless redundancy (HSR) networks, the proposed DSP-based approach reduced the network traffic by 80% to 88% compared with the standard HSR protocol, thus improving network traffic performance.
Honey Bee Colonies Remote Monitoring System.
Gil-Lebrero, Sergio; Quiles-Latorre, Francisco Javier; Ortiz-López, Manuel; Sánchez-Ruiz, Víctor; Gámiz-López, Victoria; Luna-Rodríguez, Juan Jesús
2016-12-29
Bees are very important for terrestrial ecosystems and, above all, for the subsistence of many crops, due to their ability to pollinate flowers. Currently, the honey bee populations are decreasing due to colony collapse disorder (CCD). The reasons for CCD are not fully known, and as a result, it is essential to obtain all possible information on the environmental conditions surrounding the beehives. On the other hand, it is important to carry out such information gathering as non-intrusively as possible to avoid modifying the bees' work conditions and to obtain more reliable data. We designed a wireless-sensor networks meet these requirements. We designed a remote monitoring system (called WBee) based on a hierarchical three-level model formed by the wireless node, a local data server, and a cloud data server. WBee is a low-cost, fully scalable, easily deployable system with regard to the number and types of sensors and the number of hives and their geographical distribution. WBee saves the data in each of the levels if there are failures in communication. In addition, the nodes include a backup battery, which allows for further data acquisition and storage in the event of a power outage. Unlike other systems that monitor a single point of a hive, the system we present monitors and stores the temperature and relative humidity of the beehive in three different spots. Additionally, the hive is continuously weighed on a weighing scale. Real-time weight measurement is an innovation in wireless beehive-monitoring systems. We designed an adaptation board to facilitate the connection of the sensors to the node. Through the Internet, researchers and beekeepers can access the cloud data server to find out the condition of their hives in real time.
Honey Bee Colonies Remote Monitoring System
Gil-Lebrero, Sergio; Quiles-Latorre, Francisco Javier; Ortiz-López, Manuel; Sánchez-Ruiz, Víctor; Gámiz-López, Victoria; Luna-Rodríguez, Juan Jesús
2016-01-01
Bees are very important for terrestrial ecosystems and, above all, for the subsistence of many crops, due to their ability to pollinate flowers. Currently, the honey bee populations are decreasing due to colony collapse disorder (CCD). The reasons for CCD are not fully known, and as a result, it is essential to obtain all possible information on the environmental conditions surrounding the beehives. On the other hand, it is important to carry out such information gathering as non-intrusively as possible to avoid modifying the bees’ work conditions and to obtain more reliable data. We designed a wireless-sensor networks meet these requirements. We designed a remote monitoring system (called WBee) based on a hierarchical three-level model formed by the wireless node, a local data server, and a cloud data server. WBee is a low-cost, fully scalable, easily deployable system with regard to the number and types of sensors and the number of hives and their geographical distribution. WBee saves the data in each of the levels if there are failures in communication. In addition, the nodes include a backup battery, which allows for further data acquisition and storage in the event of a power outage. Unlike other systems that monitor a single point of a hive, the system we present monitors and stores the temperature and relative humidity of the beehive in three different spots. Additionally, the hive is continuously weighed on a weighing scale. Real-time weight measurement is an innovation in wireless beehive—monitoring systems. We designed an adaptation board to facilitate the connection of the sensors to the node. Through the Internet, researchers and beekeepers can access the cloud data server to find out the condition of their hives in real time. PMID:28036061
NASA Astrophysics Data System (ADS)
Belapurkar, Rohit K.
Future aircraft engine control systems will be based on a distributed architecture, in which, the sensors and actuators will be connected to the Full Authority Digital Engine Control (FADEC) through an engine area network. Distributed engine control architecture will allow the implementation of advanced, active control techniques along with achieving weight reduction, improvement in performance and lower life cycle cost. The performance of a distributed engine control system is predominantly dependent on the performance of the communication network. Due to the serial data transmission policy, network-induced time delays and sampling jitter are introduced between the sensor/actuator nodes and the distributed FADEC. Communication network faults and transient node failures may result in data dropouts, which may not only degrade the control system performance but may even destabilize the engine control system. Three different architectures for a turbine engine control system based on a distributed framework are presented. A partially distributed control system for a turbo-shaft engine is designed based on ARINC 825 communication protocol. Stability conditions and control design methodology are developed for the proposed partially distributed turbo-shaft engine control system to guarantee the desired performance under the presence of network-induced time delay and random data loss due to transient sensor/actuator failures. A fault tolerant control design methodology is proposed to benefit from the availability of an additional system bandwidth and from the broadcast feature of the data network. It is shown that a reconfigurable fault tolerant control design can help to reduce the performance degradation in presence of node failures. A T-700 turbo-shaft engine model is used to validate the proposed control methodology based on both single input and multiple-input multiple-output control design techniques.
Distributed Clone Detection in Static Wireless Sensor Networks: Random Walk with Network Division
Khan, Wazir Zada; Aalsalem, Mohammed Y.; Saad, N. M.
2015-01-01
Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads. PMID:25992913
Intelligent Data Transfer for Multiple Sensor Networks over a Broad Temperature Range
NASA Technical Reports Server (NTRS)
Krasowski, Michael (Inventor)
2018-01-01
A sensor network may be configured to operate in extreme temperature environments. A sensor may be configured to generate a frequency carrier, and transmit the frequency carrier to a node. The node may be configured to amplitude modulate the frequency carrier, and transmit the amplitude modulated frequency carrier to a receiver.
Synchronous wearable wireless body sensor network composed of autonomous textile nodes.
Vanveerdeghem, Peter; Van Torre, Patrick; Stevens, Christiaan; Knockaert, Jos; Rogier, Hendrik
2014-10-09
A novel, fully-autonomous, wearable, wireless sensor network is presented, where each flexible textile node performs cooperative synchronous acquisition and distributed event detection. Computationally efficient situational-awareness algorithms are implemented on the low-power microcontroller present on each flexible node. The detected events are wirelessly transmitted to a base station, directly, as well as forwarded by other on-body nodes. For each node, a dual-polarized textile patch antenna serves as a platform for the flexible electronic circuitry. Therefore, the system is particularly suitable for comfortable and unobtrusive integration into garments. In the meantime, polarization diversity can be exploited to improve the reliability and energy-efficiency of the wireless transmission. Extensive experiments in realistic conditions have demonstrated that this new autonomous, body-centric, textile-antenna, wireless sensor network is able to correctly detect different operating conditions of a firefighter during an intervention. By relying on four network nodes integrated into the protective garment, this functionality is implemented locally, on the body, and in real time. In addition, the received sensor data are reliably transferred to a central access point at the command post, for more detailed and more comprehensive real-time visualization. This information provides coordinators and commanders with situational awareness of the entire rescue operation. A statistical analysis of measured on-body node-to-node, as well as off-body person-to-person channels is included, confirming the reliability of the communication system.
Synchronous Wearable Wireless Body Sensor Network Composed of Autonomous Textile Nodes
Vanveerdeghem, Peter; Van Torre, Patrick; Stevens, Christiaan; Knockaert, Jos; Rogier, Hendrik
2014-01-01
A novel, fully-autonomous, wearable, wireless sensor network is presented, where each flexible textile node performs cooperative synchronous acquisition and distributed event detection. Computationally efficient situational-awareness algorithms are implemented on the low-power microcontroller present on each flexible node. The detected events are wirelessly transmitted to a base station, directly, as well as forwarded by other on-body nodes. For each node, a dual-polarized textile patch antenna serves as a platform for the flexible electronic circuitry. Therefore, the system is particularly suitable for comfortable and unobtrusive integration into garments. In the meantime, polarization diversity can be exploited to improve the reliability and energy-efficiency of the wireless transmission. Extensive experiments in realistic conditions have demonstrated that this new autonomous, body-centric, textile-antenna, wireless sensor network is able to correctly detect different operating conditions of a firefighter during an intervention. By relying on four network nodes integrated into the protective garment, this functionality is implemented locally, on the body, and in real time. In addition, the received sensor data are reliably transferred to a central access point at the command post, for more detailed and more comprehensive real-time visualization. This information provides coordinators and commanders with situational awareness of the entire rescue operation. A statistical analysis of measured on-body node-to-node, as well as off-body person-to-person channels is included, confirming the reliability of the communication system. PMID:25302808
NASA Astrophysics Data System (ADS)
Dang, Van H.; Wohlgemuth, Sven; Yoshiura, Hiroshi; Nguyen, Thuc D.; Echizen, Isao
Wireless sensor network (WSN) has been one of key technologies for the future with broad applications from the military to everyday life [1,2,3,4,5]. There are two kinds of WSN model models with sensors for sensing data and a sink for receiving and processing queries from users; and models with special additional nodes capable of storing large amounts of data from sensors and processing queries from the sink. Among the latter type, a two-tiered model [6,7] has been widely adopted because of its storage and energy saving benefits for weak sensors, as proved by the advent of commercial storage node products such as Stargate [8] and RISE. However, by concentrating storage in certain nodes, this model becomes more vulnerable to attack. Our novel technique, called zip-histogram, contributes to solving the problems of previous studies [6,7] by protecting the stored data's confidentiality and integrity (including data from the sensor and queries from the sink) against attackers who might target storage nodes in two-tiered WSNs.
Location-Aware Dynamic Session-Key Management for Grid-Based Wireless Sensor Networks
Chen, Chin-Ling; Lin, I-Hsien
2010-01-01
Security is a critical issue for sensor networks used in hostile environments. When wireless sensor nodes in a wireless sensor network are distributed in an insecure hostile environment, the sensor nodes must be protected: a secret key must be used to protect the nodes transmitting messages. If the nodes are not protected and become compromised, many types of attacks against the network may result. Such is the case with existing schemes, which are vulnerable to attacks because they mostly provide a hop-by-hop paradigm, which is insufficient to defend against known attacks. We propose a location-aware dynamic session-key management protocol for grid-based wireless sensor networks. The proposed protocol improves the security of a secret key. The proposed scheme also includes a key that is dynamically updated. This dynamic update can lower the probability of the key being guessed correctly. Thus currently known attacks can be defended. By utilizing the local information, the proposed scheme can also limit the flooding region in order to reduce the energy that is consumed in discovering routing paths. PMID:22163606
Location-aware dynamic session-key management for grid-based Wireless Sensor Networks.
Chen, Chin-Ling; Lin, I-Hsien
2010-01-01
Security is a critical issue for sensor networks used in hostile environments. When wireless sensor nodes in a wireless sensor network are distributed in an insecure hostile environment, the sensor nodes must be protected: a secret key must be used to protect the nodes transmitting messages. If the nodes are not protected and become compromised, many types of attacks against the network may result. Such is the case with existing schemes, which are vulnerable to attacks because they mostly provide a hop-by-hop paradigm, which is insufficient to defend against known attacks. We propose a location-aware dynamic session-key management protocol for grid-based wireless sensor networks. The proposed protocol improves the security of a secret key. The proposed scheme also includes a key that is dynamically updated. This dynamic update can lower the probability of the key being guessed correctly. Thus currently known attacks can be defended. By utilizing the local information, the proposed scheme can also limit the flooding region in order to reduce the energy that is consumed in discovering routing paths.
Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks
NASA Astrophysics Data System (ADS)
Pandremmenou, Katerina; Kondi, Lisimachos P.; Parsopoulos, Konstantinos E.
2011-01-01
In this paper, we propose a scheme for the optimal allocation of power, source coding rate, and channel coding rate for each of the nodes of a wireless Direct Sequence Code Division Multiple Access (DS-CDMA) visual sensor network. The optimization is quality-driven, i.e. the received quality of the video that is transmitted by the nodes is optimized. The scheme takes into account the fact that the sensor nodes may be imaging scenes with varying levels of motion. Nodes that image low-motion scenes will require a lower source coding rate, so they will be able to allocate a greater portion of the total available bit rate to channel coding. Stronger channel coding will mean that such nodes will be able to transmit at lower power. This will both increase battery life and reduce interference to other nodes. Two optimization criteria are considered. One that minimizes the average video distortion of the nodes and one that minimizes the maximum distortion among the nodes. The transmission powers are allowed to take continuous values, whereas the source and channel coding rates can assume only discrete values. Thus, the resulting optimization problem lies in the field of mixed-integer optimization tasks and is solved using Particle Swarm Optimization. Our experimental results show the importance of considering the characteristics of the video sequences when determining the transmission power, source coding rate and channel coding rate for the nodes of the visual sensor network.
Energy Efficient Cluster Based Scheduling Scheme for Wireless Sensor Networks
Srie Vidhya Janani, E.; Ganesh Kumar, P.
2015-01-01
The energy utilization of sensor nodes in large scale wireless sensor network points out the crucial need for scalable and energy efficient clustering protocols. Since sensor nodes usually operate on batteries, the maximum utility of network is greatly dependent on ideal usage of energy leftover in these sensor nodes. In this paper, we propose an Energy Efficient Cluster Based Scheduling Scheme for wireless sensor networks that balances the sensor network lifetime and energy efficiency. In the first phase of our proposed scheme, cluster topology is discovered and cluster head is chosen based on remaining energy level. The cluster head monitors the network energy threshold value to identify the energy drain rate of all its cluster members. In the second phase, scheduling algorithm is presented to allocate time slots to cluster member data packets. Here congestion occurrence is totally avoided. In the third phase, energy consumption model is proposed to maintain maximum residual energy level across the network. Moreover, we also propose a new packet format which is given to all cluster member nodes. The simulation results prove that the proposed scheme greatly contributes to maximum network lifetime, high energy, reduced overhead, and maximum delivery ratio. PMID:26495417
NASA Astrophysics Data System (ADS)
Kesuma, Hendra; Niederkleine, Kris; Schmale, Sebastian; Ahobala, Tejas; Paul, Steffen; Sebald, Johannes
2016-08-01
In this work we design and implement efficient time synchronization/stamping method for Wireless Sensor Network inside the Vehicle Equipment Bay (VEB) of the ARIANE 5. The sensor nodes in the network do not require real time clock (RTC) hardware to store and stamp each measurement data performed by the sensors. There will be only the measurement sequence information, previous time (clock) information, measurement data and its related data protocol information sent back to the Access Point (AP). This lead to less data transmission, less energy and less time required by the sensor nodes to operate and also leads to longer battery life time. The Visible Light Communication (VLC) is used, to provide energy, to synchronize time and to deliver the commands to the sensor nodes in the network. By employing star network topology, a part of solar cell as receiver, the conventional receiver (RF/Infrared) is neglected to reduce amount of hardware and energy consumption. The infrared transmitter on the sensor node is deployed to minimize the electromagnetic interference in the launcher and does not require a complicated circuit in comparison to a RF transmitter.
Strategies for a better performance of RPL under mobility in wireless sensor networks
NASA Astrophysics Data System (ADS)
Latib, Z. A.; Jamil, A.; Alduais, N. A. M.; Abdullah, J.; Audah, L. H. M.; Alias, R.
2017-09-01
A Wireless Sensor Network (WSN) is usually stationary, which the network comprises of static nodes. The increase demand for mobility in various applications such as environmental monitoring, medical, home automation, and military, raises the question how IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) would perform under these mobility applications. This paper aims to understand performance of RPL and come out with strategies for a better performance of RPL in mobility scenarios. Because of this, this paper evaluates the performance of the RPL protocol under three different scenarios: sink and sensor nodes are static, static sink and mobile sensor nodes, and sink and sensor nodes are mobile. The network scenarios are implemented in Cooja simulator. A WSN consists of 25 sensor nodes and one sink node is configured in the simulation environment. The simulation is varied over different packet rates and ContikiMAC's Clear Channel Assessment (CCA) rate. As the performance metric, RPL is evaluated in term of packet delivery ratio (PDR), power consumption and packet rates. The simulation results show RPL provides a poor PDR in the mobility scenarios when compared to the static scenario. In addition, RPL consumes more power and increases duty-cycle rate to support mobility when compared to the static scenario. Based on the findings, we suggest three strategies for a better performance of RPL in mobility scenarios. First, RPL should operates at a lower packet rates when implemented in the mobility scenarios. Second, RPL should be implemented with a higher duty-cycle rate. Lastly, the sink node should be positioned as much as possible in the center of the mobile network.
Lo, Kam W
2017-03-01
When an airborne sound source travels past a stationary ground-based acoustic sensor node in a straight line at constant altitude and constant speed that is not much less than the speed of sound in air, the movement of the source during the propagation of the signal from the source to the sensor node (commonly referred to as the "retardation effect") enables the full set of flight parameters of the source to be estimated by measuring the direction of arrival (DOA) of the signal at the sensor node over a sufficiently long period of time. This paper studies the possibility of using instantaneous frequency (IF) measurements from the sensor node to improve the precision of the flight parameter estimates when the source spectrum contains a harmonic line of constant frequency. A simplified Cramer-Rao lower bound analysis shows that the standard deviations in the estimates of the flight parameters can be reduced when IF measurements are used together with DOA measurements. Two flight parameter estimation algorithms that utilize both IF and DOA measurements are described and their performances are evaluated using both simulated data and real data.
Design and Field Test of a WSN Platform Prototype for Long-Term Environmental Monitoring
Lazarescu, Mihai T.
2015-01-01
Long-term wildfire monitoring using distributed in situ temperature sensors is an accurate, yet demanding environmental monitoring application, which requires long-life, low-maintenance, low-cost sensors and a simple, fast, error-proof deployment procedure. We present in this paper the most important design considerations and optimizations of all elements of a low-cost WSN platform prototype for long-term, low-maintenance pervasive wildfire monitoring, its preparation for a nearly three-month field test, the analysis of the causes of failure during the test and the lessons learned for platform improvement. The main components of the total cost of the platform (nodes, deployment and maintenance) are carefully analyzed and optimized for this application. The gateways are designed to operate with resources that are generally used for sensor nodes, while the requirements and cost of the sensor nodes are significantly lower. We define and test in simulation and in the field experiment a simple, but effective communication protocol for this application. It helps to lower the cost of the nodes and field deployment procedure, while extending the theoretical lifetime of the sensor nodes to over 16 years on a single 1 Ah lithium battery. PMID:25912349
Ubiquitous Green Computing Techniques for High Demand Applications in Smart Environments
Zapater, Marina; Sanchez, Cesar; Ayala, Jose L.; Moya, Jose M.; Risco-Martín, José L.
2012-01-01
Ubiquitous sensor network deployments, such as the ones found in Smart cities and Ambient intelligence applications, require constantly increasing high computational demands in order to process data and offer services to users. The nature of these applications imply the usage of data centers. Research has paid much attention to the energy consumption of the sensor nodes in WSNs infrastructures. However, supercomputing facilities are the ones presenting a higher economic and environmental impact due to their very high power consumption. The latter problem, however, has been disregarded in the field of smart environment services. This paper proposes an energy-minimization workload assignment technique, based on heterogeneity and application-awareness, that redistributes low-demand computational tasks from high-performance facilities to idle nodes with low and medium resources in the WSN infrastructure. These non-optimal allocation policies reduce the energy consumed by the whole infrastructure and the total execution time. PMID:23112621
Multi-mode clustering model for hierarchical wireless sensor networks
NASA Astrophysics Data System (ADS)
Hu, Xiangdong; Li, Yongfu; Xu, Huifen
2017-03-01
The topology management, i.e., clusters maintenance, of wireless sensor networks (WSNs) is still a challenge due to its numerous nodes, diverse application scenarios and limited resources as well as complex dynamics. To address this issue, a multi-mode clustering model (M2 CM) is proposed to maintain the clusters for hierarchical WSNs in this study. In particular, unlike the traditional time-trigger model based on the whole-network and periodic style, the M2 CM is proposed based on the local and event-trigger operations. In addition, an adaptive local maintenance algorithm is designed for the broken clusters in the WSNs using the spatial-temporal demand changes accordingly. Numerical experiments are performed using the NS2 network simulation platform. Results validate the effectiveness of the proposed model with respect to the network maintenance costs, node energy consumption and transmitted data as well as the network lifetime.
Ubiquitous green computing techniques for high demand applications in Smart environments.
Zapater, Marina; Sanchez, Cesar; Ayala, Jose L; Moya, Jose M; Risco-Martín, José L
2012-01-01
Ubiquitous sensor network deployments, such as the ones found in Smart cities and Ambient intelligence applications, require constantly increasing high computational demands in order to process data and offer services to users. The nature of these applications imply the usage of data centers. Research has paid much attention to the energy consumption of the sensor nodes in WSNs infrastructures. However, supercomputing facilities are the ones presenting a higher economic and environmental impact due to their very high power consumption. The latter problem, however, has been disregarded in the field of smart environment services. This paper proposes an energy-minimization workload assignment technique, based on heterogeneity and application-awareness, that redistributes low-demand computational tasks from high-performance facilities to idle nodes with low and medium resources in the WSN infrastructure. These non-optimal allocation policies reduce the energy consumed by the whole infrastructure and the total execution time.
Shang, Fengjun; Jiang, Yi; Xiong, Anping; Su, Wen; He, Li
2016-11-18
With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed. When the unknown node is inside positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is outside positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.
A Study on Wireless Charging for Prolonging the Lifetime of Wireless Sensor Networks.
Tu, Weijian; Xu, Xianghua; Ye, Tingcong; Cheng, Zongmao
2017-07-04
Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node) as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP) to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network.
On the Feasibility of Wireless Multimedia Sensor Networks over IEEE 802.15.5 Mesh Topologies
Garcia-Sanchez, Antonio-Javier; Losilla, Fernando; Rodenas-Herraiz, David; Cruz-Martinez, Felipe; Garcia-Sanchez, Felipe
2016-01-01
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. PMID:27164106
On the Feasibility of Wireless Multimedia Sensor Networks over IEEE 802.15.5 Mesh Topologies.
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.
Capella, Juan V.; Perles, Angel; Bonastre, Alberto; Serrano, Juan J.
2011-01-01
We present a set of novel low power wireless sensor nodes designed for monitoring wooden masterpieces and historical buildings, in order to perform an early detection of pests. Although our previous star-based system configuration has been in operation for more than 13 years, it does not scale well for sensorization of large buildings or when deploying hundreds of nodes. In this paper we demonstrate the feasibility of a cluster-based dynamic-tree hierarchical Wireless Sensor Network (WSN) architecture where realistic assumptions of radio frequency data transmission are applied to cluster construction, and a mix of heterogeneous nodes are used to minimize economic cost of the whole system and maximize power saving of the leaf nodes. Simulation results show that the specialization of a fraction of the nodes by providing better antennas and some energy harvesting techniques can dramatically extend the life of the entire WSN and reduce the cost of the whole system. A demonstration of the proposed architecture with a new routing protocol and applied to termite pest detection has been implemented on a set of new nodes and should last for about 10 years, but it provides better scalability, reliability and deployment properties. PMID:22346630
Capella, Juan V; Perles, Angel; Bonastre, Alberto; Serrano, Juan J
2011-01-01
We present a set of novel low power wireless sensor nodes designed for monitoring wooden masterpieces and historical buildings, in order to perform an early detection of pests. Although our previous star-based system configuration has been in operation for more than 13 years, it does not scale well for sensorization of large buildings or when deploying hundreds of nodes. In this paper we demonstrate the feasibility of a cluster-based dynamic-tree hierarchical Wireless Sensor Network (WSN) architecture where realistic assumptions of radio frequency data transmission are applied to cluster construction, and a mix of heterogeneous nodes are used to minimize economic cost of the whole system and maximize power saving of the leaf nodes. Simulation results show that the specialization of a fraction of the nodes by providing better antennas and some energy harvesting techniques can dramatically extend the life of the entire WSN and reduce the cost of the whole system. A demonstration of the proposed architecture with a new routing protocol and applied to termite pest detection has been implemented on a set of new nodes and should last for about 10 years, but it provides better scalability, reliability and deployment properties.
Performance analysis of cooperative virtual MIMO systems for wireless sensor networks.
Rafique, Zimran; Seet, Boon-Chong; Al-Anbuky, Adnan
2013-05-28
Multi-Input Multi-Output (MIMO) techniques can be used to increase the data rate for a given bit error rate (BER) and transmission power. Due to the small form factor, energy and processing constraints of wireless sensor nodes, a cooperative Virtual MIMO as opposed to True MIMO system architecture is considered more feasible for wireless sensor network (WSN) applications. Virtual MIMO with Vertical-Bell Labs Layered Space-Time (V-BLAST) multiplexing architecture has been recently established to enhance WSN performance. In this paper, we further investigate the impact of different modulation techniques, and analyze for the first time, the performance of a cooperative Virtual MIMO system based on V-BLAST architecture with multi-carrier modulation techniques. Through analytical models and simulations using real hardware and environment settings, both communication and processing energy consumptions, BER, spectral efficiency, and total time delay of multiple cooperative nodes each with single antenna are evaluated. The results show that cooperative Virtual-MIMO with Binary Phase Shift Keying-Wavelet based Orthogonal Frequency Division Multiplexing (BPSK-WOFDM) modulation is a promising solution for future high data-rate and energy-efficient WSNs.
Performance Analysis of Cooperative Virtual MIMO Systems for Wireless Sensor Networks
Rafique, Zimran; Seet, Boon-Chong; Al-Anbuky, Adnan
2013-01-01
Multi-Input Multi-Output (MIMO) techniques can be used to increase the data rate for a given bit error rate (BER) and transmission power. Due to the small form factor, energy and processing constraints of wireless sensor nodes, a cooperative Virtual MIMO as opposed to True MIMO system architecture is considered more feasible for wireless sensor network (WSN) applications. Virtual MIMO with Vertical-Bell Labs Layered Space-Time (V-BLAST) multiplexing architecture has been recently established to enhance WSN performance. In this paper, we further investigate the impact of different modulation techniques, and analyze for the first time, the performance of a cooperative Virtual MIMO system based on V-BLAST architecture with multi-carrier modulation techniques. Through analytical models and simulations using real hardware and environment settings, both communication and processing energy consumptions, BER, spectral efficiency, and total time delay of multiple cooperative nodes each with single antenna are evaluated. The results show that cooperative Virtual-MIMO with Binary Phase Shift Keying-Wavelet based Orthogonal Frequency Division Multiplexing (BPSK-WOFDM) modulation is a promising solution for future high data-rate and energy-efficient WSNs. PMID:23760087
Service-Oriented Node Scheduling Scheme for Wireless Sensor Networks Using Markov Random Field Model
Cheng, Hongju; Su, Zhihuang; Lloret, Jaime; Chen, Guolong
2014-01-01
Future wireless sensor networks are expected to provide various sensing services and energy efficiency is one of the most important criterions. The node scheduling strategy aims to increase network lifetime by selecting a set of sensor nodes to provide the required sensing services in a periodic manner. In this paper, we are concerned with the service-oriented node scheduling problem to provide multiple sensing services while maximizing the network lifetime. We firstly introduce how to model the data correlation for different services by using Markov Random Field (MRF) model. Secondly, we formulate the service-oriented node scheduling issue into three different problems, namely, the multi-service data denoising problem which aims at minimizing the noise level of sensed data, the representative node selection problem concerning with selecting a number of active nodes while determining the services they provide, and the multi-service node scheduling problem which aims at maximizing the network lifetime. Thirdly, we propose a Multi-service Data Denoising (MDD) algorithm, a novel multi-service Representative node Selection and service Determination (RSD) algorithm, and a novel MRF-based Multi-service Node Scheduling (MMNS) scheme to solve the above three problems respectively. Finally, extensive experiments demonstrate that the proposed scheme efficiently extends the network lifetime. PMID:25384005
A Novel Loss Recovery and Tracking Scheme for Maneuvering Target in Hybrid WSNs.
Qian, Hanwang; Fu, Pengcheng; Li, Baoqing; Liu, Jianpo; Yuan, Xiaobing
2018-01-25
Tracking a mobile target, which aims to timely monitor the invasion of specific target, is one of the most prominent applications in wireless sensor networks (WSNs). Traditional tracking methods in WSNs only based on static sensor nodes (SNs) have several critical problems. For example, to void the loss of mobile target, many SNs must be active to track the target in all possible directions, resulting in excessive energy consumption. Additionally, when entering coverage holes in the monitoring area, the mobile target may be missing and then its state is unknown during this period. To tackle these problems, in this paper, a few mobile sensor nodes (MNs) are introduced to cooperate with SNs to form a hybrid WSN due to their stronger abilities and less constrained energy. Then, we propose a valid target tracking scheme for hybrid WSNs to dynamically schedule the MNs and SNs. Moreover, a novel loss recovery mechanism is proposed to find the lost target and recover the tracking with fewer SNs awakened. Furthermore, to improve the robustness and accuracy of the recovery mechanism, an adaptive unscented Kalman filter (AUKF) algorithm is raised to dynamically adjust the process noise covariance. Simulation results demonstrate that our tracking scheme for maneuvering target in hybrid WSNs can not only track the target effectively even if the target is lost but also maintain an excellent accuracy and robustness with fewer activated nodes.
A Novel Loss Recovery and Tracking Scheme for Maneuvering Target in Hybrid WSNs
Liu, Jianpo; Yuan, Xiaobing
2018-01-01
Tracking a mobile target, which aims to timely monitor the invasion of specific target, is one of the most prominent applications in wireless sensor networks (WSNs). Traditional tracking methods in WSNs only based on static sensor nodes (SNs) have several critical problems. For example, to void the loss of mobile target, many SNs must be active to track the target in all possible directions, resulting in excessive energy consumption. Additionally, when entering coverage holes in the monitoring area, the mobile target may be missing and then its state is unknown during this period. To tackle these problems, in this paper, a few mobile sensor nodes (MNs) are introduced to cooperate with SNs to form a hybrid WSN due to their stronger abilities and less constrained energy. Then, we propose a valid target tracking scheme for hybrid WSNs to dynamically schedule the MNs and SNs. Moreover, a novel loss recovery mechanism is proposed to find the lost target and recover the tracking with fewer SNs awakened. Furthermore, to improve the robustness and accuracy of the recovery mechanism, an adaptive unscented Kalman filter (AUKF) algorithm is raised to dynamically adjust the process noise covariance. Simulation results demonstrate that our tracking scheme for maneuvering target in hybrid WSNs can not only track the target effectively even if the target is lost but also maintain an excellent accuracy and robustness with fewer activated nodes. PMID:29370103
Yan, Jing; Li, Xiaolei; Luo, Xiaoyuan; Guan, Xinping
2017-01-01
Due to the lack of a physical line of defense, intrusion detection becomes one of the key issues in applications of underwater wireless sensor networks (UWSNs), especially when the confidentiality has prime importance. However, the resource-constrained property of UWSNs such as sparse deployment and energy constraint makes intrusion detection a challenging issue. This paper considers a virtual-lattice-based approach to the intrusion detection problem in UWSNs. Different from most existing works, the UWSNs consist of two kinds of nodes, i.e., sensor nodes (SNs), which cannot move autonomously, and actuator nodes (ANs), which can move autonomously according to the performance requirement. With the cooperation of SNs and ANs, the intruder detection probability is defined. Then, a virtual lattice-based monitor (VLM) algorithm is proposed to detect the intruder. In order to reduce the redundancy of communication links and improve detection probability, an optimal and coordinative lattice-based monitor patrolling (OCLMP) algorithm is further provided for UWSNs, wherein an equal price search strategy is given for ANs to find the shortest patrolling path. Under VLM and OCLMP algorithms, the detection probabilities are calculated, while the topology connectivity can be guaranteed. Finally, simulation results are presented to show that the proposed method in this paper can improve the detection accuracy and save the energy consumption compared with the conventional methods. PMID:28531127
Optimizing Retransmission Threshold in Wireless Sensor Networks
Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang
2016-01-01
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 OnΔ·max1≤i≤n{ui}, where ui 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+pmin)-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. PMID:27171092
Cooperation among wirelessly connected static and mobile sensor nodes for surveillance applications.
de Freitas, Edison Pignaton; Heimfarth, Tales; Vinel, Alexey; Wagner, Flávio Rech; Pereira, Carlos Eduardo; Larsson, Tony
2013-09-25
This paper presents a bio-inspired networking strategy to support the cooperation between static sensors on the ground and mobile sensors in the air to perform surveillance missions in large areas. The goal of the proposal is to provide low overhead in the communication among sensor nodes, while allocating the mobile sensors to perform sensing activities requested by the static ones. Simulations have shown that the strategy is efficient in maintaining low overhead and achieving the desired coordination.
Analyzing the Effects of UAV Mobility Patterns on Data Collection in Wireless Sensor Networks.
Rashed, Sarmad; Soyturk, Mujdat
2017-02-20
Sensor nodes in a Wireless Sensor Network (WSN) can be dispersed over a remote sensing area (e.g., the regions that are hardly accessed by human beings). In such kinds of networks, datacollectionbecomesoneofthemajorissues. Getting connected to each sensor node and retrieving the information in time introduces new challenges. Mobile sink usage-especially Unmanned Aerial Vehicles (UAVs)-is the most convenient approach to covering the area and accessing each sensor node in such a large-scale WSN. However, the operation of the UAV depends on some parameters, such as endurance time, altitude, speed, radio type in use, and the path. In this paper, we explore various UAV mobility patterns that follow different paths to sweep the operation area in order to seek the best area coverage with the maximum number of covered nodes in the least amount of time needed by the mobile sink. We also introduce a new metric to formulate the tradeoff between maximizing the covered nodes and minimizing the operation time when choosing the appropriate mobility pattern. A realistic simulation environment is used in order to compare and evaluate the performance of the system. We present the performance results for the explored UAV mobility patterns. The results are very useful to present the tradeoff between maximizing the covered nodes and minimizing the operation time to choose the appropriate mobility pattern.
Analyzing the Effects of UAV Mobility Patterns on Data Collection in Wireless Sensor Networks
Rashed, Sarmad; Soyturk, Mujdat
2017-01-01
Sensor nodes in a Wireless Sensor Network (WSN) can be dispersed over a remote sensing area (e.g., the regions that are hardly accessed by human beings). In such kinds of networks, data collection becomes one of the major issues. Getting connected to each sensor node and retrieving the information in time introduces new challenges. Mobile sink usage—especially Unmanned Aerial Vehicles (UAVs)—is the most convenient approach to covering the area and accessing each sensor node in such a large-scale WSN. However, the operation of the UAV depends on some parameters, such as endurance time, altitude, speed, radio type in use, and the path. In this paper, we explore various UAV mobility patterns that follow different paths to sweep the operation area in order to seek the best area coverage with the maximum number of covered nodes in the least amount of time needed by the mobile sink. We also introduce a new metric to formulate the tradeoff between maximizing the covered nodes and minimizing the operation time when choosing the appropriate mobility pattern. A realistic simulation environment is used in order to compare and evaluate the performance of the system. We present the performance results for the explored UAV mobility patterns. The results are very useful to present the tradeoff between maximizing the covered nodes and minimizing the operation time to choose the appropriate mobility pattern. PMID:28230727
CSRQ: Communication-Efficient Secure Range Queries in Two-Tiered Sensor Networks
Dai, Hua; Ye, Qingqun; Yang, Geng; Xu, Jia; He, Ruiliang
2016-01-01
In recent years, we have seen many applications of secure query in two-tiered wireless sensor networks. Storage nodes are responsible for storing data from nearby sensor nodes and answering queries from Sink. It is critical to protect data security from a compromised storage node. In this paper, the Communication-efficient Secure Range Query (CSRQ)—a privacy and integrity preserving range query protocol—is proposed to prevent attackers from gaining information of both data collected by sensor nodes and queries issued by Sink. To preserve privacy and integrity, in addition to employing the encoding mechanisms, a novel data structure called encrypted constraint chain is proposed, which embeds the information of integrity verification. Sink can use this encrypted constraint chain to verify the query result. The performance evaluation shows that CSRQ has lower communication cost than the current range query protocols. PMID:26907293
Physical Layer Secret-Key Generation Scheme for Transportation Security Sensor Network
Yang, Bin; Zhang, Jianfeng
2017-01-01
Wireless Sensor Networks (WSNs) are widely used in different disciplines, including transportation systems, agriculture field environment monitoring, healthcare systems, and industrial monitoring. The security challenge of the wireless communication link between sensor nodes is critical in WSNs. In this paper, we propose a new physical layer secret-key generation scheme for transportation security sensor network. The scheme is based on the cooperation of all the sensor nodes, thus avoiding the key distribution process, which increases the security of the system. Different passive and active attack models are analyzed in this paper. We also prove that when the cooperative node number is large enough, even when the eavesdropper is equipped with multiple antennas, the secret-key is still secure. Numerical results are performed to show the efficiency of the proposed scheme. PMID:28657588
Physical Layer Secret-Key Generation Scheme for Transportation Security Sensor Network.
Yang, Bin; Zhang, Jianfeng
2017-06-28
Wireless Sensor Networks (WSNs) are widely used in different disciplines, including transportation systems, agriculture field environment monitoring, healthcare systems, and industrial monitoring. The security challenge of the wireless communication link between sensor nodes is critical in WSNs. In this paper, we propose a new physical layer secret-key generation scheme for transportation security sensor network. The scheme is based on the cooperation of all the sensor nodes, thus avoiding the key distribution process, which increases the security of the system. Different passive and active attack models are analyzed in this paper. We also prove that when the cooperative node number is large enough, even when the eavesdropper is equipped with multiple antennas, the secret-key is still secure. Numerical results are performed to show the efficiency of the proposed scheme.
Tang, Chengpei; Shokla, Sanesy Kumcr; Modhawar, George; Wang, Qiang
2016-02-19
Collaborative strategies for mobile sensor nodes ensure the efficiency and the robustness of data processing, while limiting the required communication bandwidth. In order to solve the problem of pipeline inspection and oil leakage monitoring, a collaborative weighted mobile sensing scheme is proposed. By adopting a weighted mobile sensing scheme, the adaptive collaborative clustering protocol can realize an even distribution of energy load among the mobile sensor nodes in each round, and make the best use of battery energy. A detailed theoretical analysis and experimental results revealed that the proposed protocol is an energy efficient collaborative strategy such that the sensor nodes can communicate with a fusion center and produce high power gain.
Hung, Le Xuan; Canh, Ngo Trong; Lee, Sungyoung; Lee, Young-Koo; Lee, Heejo
2008-01-01
For many sensor network applications such as military or homeland security, it is essential for users (sinks) to access the sensor network while they are moving. Sink mobility brings new challenges to secure routing in large-scale sensor networks. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. Also, studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. This paper presents an energy-efficient secure routing and key management for mobile sinks in sensor networks, called SCODEplus. It is a significant extension of our previous study in five aspects: (1) Key management scheme and routing protocol are considered during design time to increase security and efficiency; (2) The network topology is organized in a hexagonal plane which supports more efficiency than previous square-grid topology; (3) The key management scheme can eliminate the impacts of node compromise attacks on links between non-compromised nodes; (4) Sensor node deployment is based on Gaussian distribution which is more realistic than uniform distribution; (5) No GPS or like is required to provide sensor node location information. Our security analysis demonstrates that the proposed scheme can defend against common attacks in sensor networks including node compromise attacks, replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Both mathematical and simulation-based performance evaluation show that the SCODEplus significantly reduces the communication overhead, energy consumption, packet delivery latency while it always delivers more than 97 percent of packets successfully. PMID:27873956
Hung, Le Xuan; Canh, Ngo Trong; Lee, Sungyoung; Lee, Young-Koo; Lee, Heejo
2008-12-03
For many sensor network applications such as military or homeland security, it is essential for users (sinks) to access the sensor network while they are moving. Sink mobility brings new challenges to secure routing in large-scale sensor networks. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. Also, studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. This paper presents an energy-efficient secure routing and key management for mobile sinks in sensor networks, called SCODE plus . It is a significant extension of our previous study in five aspects: (1) Key management scheme and routing protocol are considered during design time to increase security and efficiency; (2) The network topology is organized in a hexagonal plane which supports more efficiency than previous square-grid topology; (3) The key management scheme can eliminate the impacts of node compromise attacks on links between non-compromised nodes; (4) Sensor node deployment is based on Gaussian distribution which is more realistic than uniform distribution; (5) No GPS or like is required to provide sensor node location information. Our security analysis demonstrates that the proposed scheme can defend against common attacks in sensor networks including node compromise attacks, replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Both mathematical and simulation-based performance evaluation show that the SCODE plus significantly reduces the communication overhead, energy consumption, packet delivery latency while it always delivers more than 97 percent of packets successfully.
NASA Astrophysics Data System (ADS)
Jiao, Wan; Hagler, Gayle; Williams, Ronald; Sharpe, Robert; Brown, Ryan; Garver, Daniel; Judge, Robert; Caudill, Motria; Rickard, Joshua; Davis, Michael; Weinstock, Lewis; Zimmer-Dauphinee, Susan; Buckley, Ken
2016-11-01
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 the southeastern United States. Collocation 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 the degree to which multiple identical sensors produced 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, and -0.40 to 0.82, respectively. The only sulfur dioxide sensor tested revealed no correlation (r < 0.5) with a reference monitor and erroneously high concentration values. A wide variety of particulate matter (PM) sensors were tested with variable results - some sensors had very high agreement (e.g., r = 0.99) between identical sensors but moderate agreement with a reference PM2.5 monitor (e.g., r = 0.65). For select sensors that had moderate to strong correlation with reference monitors (r > 0.5), step-wise multiple linear regression was performed to determine if ambient temperature, relative humidity (RH), or age of the sensor in number of sampling days could be used in a correction algorithm to improve the agreement. Maximum improvement in agreement with a reference, incorporating all factors, was observed for an NO2 sensor (multiple correlation coefficient R2adj-orig = 0.57, R2adj-final = 0.81); however, other sensors showed no apparent improvement in agreement. A four-node sensor network was successfully able to capture ozone (two nodes) and PM (four nodes) data for an 8-month period of time and show expected diurnal concentration patterns, as well as potential ozone titration due to nearby traffic emissions. Overall, this study demonstrates the performance of emerging air quality sensor technologies in a real-world setting; the variable agreement between sensors and reference monitors indicates that in situ testing of sensors against benchmark monitors should be a critical aspect of all field studies.
Real-Time Performance of a Self-Powered Environmental IoT Sensor Network System.
Wu, Fan; Rüdiger, Christoph; Yuce, Mehmet Rasit
2017-02-01
Wireless sensor networks (WSNs) play an increasingly important role in monitoring applications in many areas. With the emergence of the Internet-of-Things (IoT), many more lowpower sensors will need to be deployed in various environments to collect and monitor data about environmental factors in real time. Providing power supply to these sensor nodes becomes a critical challenge for realizations of IoT applications as sensor nodes are normally battery-powered and have a limited lifetime. This paper proposes a wireless sensor network that is powered by solar energy harvesting. The sensor network monitors the environmental data with low-power sensor electronics and forms a network using multiple XBee wireless modules. A detailed performance analysis of the network system under solar energy harvesting has been presented. The sensor network system and the proposed energy-harvesting techniques are configured to achieve a continuous energy source for the sensor network. The proposed energy-harvesting system has been successfully designed to enable an energy solution in order to keep sensor nodes active and reliable for a whole day. The paper also outlines some of our experiences in real-time implementation of a sensor network system with energy harvesting.
Real-Time Performance of a Self-Powered Environmental IoT Sensor Network System
Wu, Fan; Rüdiger, Christoph; Yuce, Mehmet Rasit
2017-01-01
Wireless sensor networks (WSNs) play an increasingly important role in monitoring applications in many areas. With the emergence of the Internet-of-Things (IoT), many more low-power sensors will need to be deployed in various environments to collect and monitor data about environmental factors in real time. Providing power supply to these sensor nodes becomes a critical challenge for realizations of IoT applications as sensor nodes are normally battery-powered and have a limited lifetime. This paper proposes a wireless sensor network that is powered by solar energy harvesting. The sensor network monitors the environmental data with low-power sensor electronics and forms a network using multiple XBee wireless modules. A detailed performance analysis of the network system under solar energy harvesting has been presented. The sensor network system and the proposed energy-harvesting techniques are configured to achieve a continuous energy source for the sensor network. The proposed energy-harvesting system has been successfully designed to enable an energy solution in order to keep sensor nodes active and reliable for a whole day. The paper also outlines some of our experiences in real-time implementation of a sensor network system with energy harvesting. PMID:28157148
Oh, Hoon; Van Vinh, Phan
2013-01-01
This paper proposes and implements a new TDMA-based MAC protocol for providing timely and reliable delivery of data and command for monitoring and control networks. In this kind of network, sensor nodes are required to sense data from the monitoring environment periodically and then send the data to a sink. The sink determines whether the environment is safe or not by analyzing the acquired data. Sometimes, a command or control message is sent from the sink to a particular node or a group of nodes to execute the services or request further interested data. The proposed MAC protocol enables bidirectional communication, controls active and sleep modes of a sensor node to conserve energy, and addresses the problem of load unbalancing between the nodes near a sink and the other nodes. It can improve reliability of communication significantly while extending network lifetime. These claims are supported by the experimental results. PMID:24084116
Oh, Hoon; Van Vinh, Phan
2013-09-30
This paper proposes and implements a new TDMA-based MAC protocol for providing timely and reliable delivery of data and command for monitoring and control networks. In this kind of network, sensor nodes are required to sense data from the monitoring environment periodically and then send the data to a sink. The sink determines whether the environment is safe or not by analyzing the acquired data. Sometimes, a command or control message is sent from the sink to a particular node or a group of nodes to execute the services or request further interested data. The proposed MAC protocol enables bidirectional communication, controls active and sleep modes of a sensor node to conserve energy, and addresses the problem of load unbalancing between the nodes near a sink and the other nodes. It can improve reliability of communication significantly while extending network lifetime. These claims are supported by the experimental results.
Han, Guangjie; Liu, Li; Jiang, Jinfang; Shu, Lei; Rodrigues, Joel J.P.C.
2016-01-01
Localization is one of the hottest research topics in Underwater Wireless Sensor Networks (UWSNs), since many important applications of UWSNs, e.g., event sensing, target tracking and monitoring, require location information of sensor nodes. Nowadays, a large number of localization algorithms have been proposed for UWSNs. How to improve location accuracy are well studied. However, few of them take location reliability or security into consideration. In this paper, we propose a Collaborative Secure Localization algorithm based on Trust model (CSLT) for UWSNs to ensure location security. Based on the trust model, the secure localization process can be divided into the following five sub-processes: trust evaluation of anchor nodes, initial localization of unknown nodes, trust evaluation of reference nodes, selection of reference node, and secondary localization of unknown node. Simulation results demonstrate that the proposed CSLT algorithm performs better than the compared related works in terms of location security, average localization accuracy and localization ratio. PMID:26891300
Low power sensor network for wireless condition monitoring
NASA Astrophysics Data System (ADS)
Richter, Ch.; Frankenstein, B.; Schubert, L.; Weihnacht, B.; Friedmann, H.; Ebert, C.
2009-03-01
For comprehensive fatigue tests and surveillance of large scale structures, a vibration monitoring system working in the Hz and sub Hz frequency range was realized and tested. The system is based on a wireless sensor network and focuses especially on the realization of a low power measurement, signal processing and communication. Regarding the development, we met the challenge of synchronizing the wireless connected sensor nodes with sufficient accuracy. The sensor nodes ware realized by compact, sensor near signal processing structures containing components for analog preprocessing of acoustic signals, their digitization, algorithms for data reduction and network communication. The core component is a digital micro controller which performs the basic algorithms necessary for the data acquisition synchronization and the filtering. As a first application, the system was installed in a rotor blade of a wind power turbine in order to monitor the Eigen modes over a longer period of time. Currently the sensor nodes are battery powered.
An Enhanced PSO-Based Clustering Energy Optimization Algorithm for Wireless Sensor Network.
Vimalarani, C; Subramanian, R; Sivanandam, S N
2016-01-01
Wireless Sensor Network (WSN) is a network which formed with a maximum number of sensor nodes which are positioned in an application environment to monitor the physical entities in a target area, for example, temperature monitoring environment, water level, monitoring pressure, and health care, and various military applications. Mostly sensor nodes are equipped with self-supported battery power through which they can perform adequate operations and communication among neighboring nodes. Maximizing the lifetime of the Wireless Sensor networks, energy conservation measures are essential for improving the performance of WSNs. This paper proposes an Enhanced PSO-Based Clustering Energy Optimization (EPSO-CEO) algorithm for Wireless Sensor Network in which clustering and clustering head selection are done by using Particle Swarm Optimization (PSO) algorithm with respect to minimizing the power consumption in WSN. The performance metrics are evaluated and results are compared with competitive clustering algorithm to validate the reduction in energy consumption.
Distributed fault detection over sensor networks with Markovian switching topologies
NASA Astrophysics Data System (ADS)
Ge, Xiaohua; Han, Qing-Long
2014-05-01
This paper deals with the distributed fault detection for discrete-time Markov jump linear systems over sensor networks with Markovian switching topologies. The sensors are scatteredly deployed in the sensor field and the fault detectors are physically distributed via a communication network. The system dynamics changes and sensing topology variations are modeled by a discrete-time Markov chain with incomplete mode transition probabilities. Each of these sensor nodes firstly collects measurement outputs from its all underlying neighboring nodes, processes these data in accordance with the Markovian switching topologies, and then transmits the processed data to the remote fault detector node. Network-induced delays and accumulated data packet dropouts are incorporated in the data transmission between the sensor nodes and the distributed fault detector nodes through the communication network. To generate localized residual signals, mode-independent distributed fault detection filters are proposed. By means of the stochastic Lyapunov functional approach, the residual system performance analysis is carried out such that the overall residual system is stochastically stable and the error between each residual signal and the fault signal is made as small as possible. Furthermore, a sufficient condition on the existence of the mode-independent distributed fault detection filters is derived in the simultaneous presence of incomplete mode transition probabilities, Markovian switching topologies, network-induced delays, and accumulated data packed dropouts. Finally, a stirred-tank reactor system is given to show the effectiveness of the developed theoretical results.
Self-localization of wireless sensor networks using self-organizing maps
NASA Astrophysics Data System (ADS)
Ertin, Emre; Priddy, Kevin L.
2005-03-01
Recently there has been a renewed interest in the notion of deploying large numbers of networked sensors for applications ranging from environmental monitoring to surveillance. In a typical scenario a number of sensors are distributed in a region of interest. Each sensor is equipped with sensing, processing and communication capabilities. The information gathered from the sensors can be used to detect, track and classify objects of interest. For a number of locations the sensors location is crucial in interpreting the data collected from those sensors. Scalability requirements dictate sensor nodes that are inexpensive devices without a dedicated localization hardware such as GPS. Therefore the network has to rely on information collected within the network to self-localize. In the literature a number of algorithms has been proposed for network localization which uses measurements informative of range, angle, proximity between nodes. Recent work by Patwari and Hero relies on sensor data without explicit range estimates. The assumption is that the correlation structure in the data is a monotone function of the intersensor distances. In this paper we propose a new method based on unsupervised learning techniques to extract location information from the sensor data itself. We consider a grid consisting of virtual nodes and try to fit grid in the actual sensor network data using the method of self organizing maps. Then known sensor network geometry can be used to rotate and scale the grid to a global coordinate system. Finally, we illustrate how the virtual nodes location information can be used to track a target.
Energy-efficient digital and wireless IC design for wireless smart sensing
NASA Astrophysics Data System (ADS)
Zhou, Jun; Huang, Xiongchuan; Wang, Chao; Tae-Hyoung Kim, Tony; Lian, Yong
2017-10-01
Wireless smart sensing is now widely used in various applications such as health monitoring and structural monitoring. In conventional wireless sensor nodes, significant power is consumed in wirelessly transmitting the raw data. Smart sensing adds local intelligence to the sensor node and reduces the amount of wireless data transmission via on-node digital signal processing. While the total power consumption is reduced compared to conventional wireless sensing, the power consumption of the digital processing becomes as dominant as wireless data transmission. This paper reviews the state-of-the-art energy-efficient digital and wireless IC design techniques for reducing the power consumption of the wireless smart sensor node to prolong battery life and enable self-powered applications.
Energy Options for Wireless Sensor Nodes.
Knight, Chris; Davidson, Joshua; Behrens, Sam
2008-12-08
Reduction in size and power consumption of consumer electronics has opened up many opportunities for low power wireless sensor networks. One of the major challenges is in supporting battery operated devices as the number of nodes in a network grows. The two main alternatives are to utilize higher energy density sources of stored energy, or to generate power at the node from local forms of energy. This paper reviews the state-of-the art technology in the field of both energy storage and energy harvesting for sensor nodes. The options discussed for energy storage include batteries, capacitors, fuel cells, heat engines and betavoltaic systems. The field of energy harvesting is discussed with reference to photovoltaics, temperature gradients, fluid flow, pressure variations and vibration harvesting.
Energy Options for Wireless Sensor Nodes
Knight, Chris; Davidson, Joshua; Behrens, Sam
2008-01-01
Reduction in size and power consumption of consumer electronics has opened up many opportunities for low power wireless sensor networks. One of the major challenges is in supporting battery operated devices as the number of nodes in a network grows. The two main alternatives are to utilize higher energy density sources of stored energy, or to generate power at the node from local forms of energy. This paper reviews the state-of-the art technology in the field of both energy storage and energy harvesting for sensor nodes. The options discussed for energy storage include batteries, capacitors, fuel cells, heat engines and betavoltaic systems. The field of energy harvesting is discussed with reference to photovoltaics, temperature gradients, fluid flow, pressure variations and vibration harvesting. PMID:27873975
A Wireless Sensor Network for Vineyard Monitoring That Uses Image Processing
Lloret, Jaime; Bosch, Ignacio; Sendra, Sandra; Serrano, Arturo
2011-01-01
The first step to detect when a vineyard has any type of deficiency, pest or disease is to observe its stems, its grapes and/or its leaves. To place a sensor in each leaf of every vineyard is obviously not feasible in terms of cost and deployment. We should thus look for new methods to detect these symptoms precisely and economically. In this paper, we present a wireless sensor network where each sensor node takes images from the field and internally uses image processing techniques to detect any unusual status in the leaves. This symptom could be caused by a deficiency, pest, disease or other harmful agent. When it is detected, the sensor node sends a message to a sink node through the wireless sensor network in order to notify the problem to the farmer. The wireless sensor uses the IEEE 802.11 a/b/g/n standard, which allows connections from large distances in open air. This paper describes the wireless sensor network design, the wireless sensor deployment, how the node processes the images in order to monitor the vineyard, and the sensor network traffic obtained from a test bed performed in a flat vineyard in Spain. Although the system is not able to distinguish between deficiency, pest, disease or other harmful agents, a symptoms image database and a neuronal network could be added in order learn from the experience and provide an accurate problem diagnosis. PMID:22163948
A wireless sensor network for vineyard monitoring that uses image processing.
Lloret, Jaime; Bosch, Ignacio; Sendra, Sandra; Serrano, Arturo
2011-01-01
The first step to detect when a vineyard has any type of deficiency, pest or disease is to observe its stems, its grapes and/or its leaves. To place a sensor in each leaf of every vineyard is obviously not feasible in terms of cost and deployment. We should thus look for new methods to detect these symptoms precisely and economically. In this paper, we present a wireless sensor network where each sensor node takes images from the field and internally uses image processing techniques to detect any unusual status in the leaves. This symptom could be caused by a deficiency, pest, disease or other harmful agent. When it is detected, the sensor node sends a message to a sink node through the wireless sensor network in order to notify the problem to the farmer. The wireless sensor uses the IEEE 802.11 a/b/g/n standard, which allows connections from large distances in open air. This paper describes the wireless sensor network design, the wireless sensor deployment, how the node processes the images in order to monitor the vineyard, and the sensor network traffic obtained from a test bed performed in a flat vineyard in Spain. Although the system is not able to distinguish between deficiency, pest, disease or other harmful agents, a symptoms image database and a neuronal network could be added in order learn from the experience and provide an accurate problem diagnosis.
A distributed geo-routing algorithm for wireless sensor networks.
Joshi, Gyanendra Prasad; Kim, Sung Won
2009-01-01
Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In this paper, we propose a void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance. VAA allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forwarding packets using only greedy routing. In VAA, the stuck node upgrades distance unless it finds a next hop node that is closer to the destination than it is. VAA guarantees packet delivery if there is a topologically valid path. Further, it is completely distributed, immediately responds to node failure or topology changes and does not require planarization of the network. NS-2 is used to evaluate the performance and correctness of VAA and we compare its performance to other protocols. Simulations show our proposed algorithm consumes less energy, has an efficient path and substantially less control overheads.
NASA Astrophysics Data System (ADS)
Balpande, Suresh S.; Pande, Rajesh S.
2016-04-01
Internet of Things (IoT) uses MEMS sensor nodes and actuators to sense and control objects through Internet. IOT deploys millions of chemical battery driven sensors at different locations which are not reliable many times because of frequent requirement of charging & battery replacement in case of underground laying, placement at harsh environmental conditions, huge count and difference between demand (24 % per year) and availability (energy density growing rate 8% per year). Energy harvester fabricated on silicon wafers have been widely used in manufacturing MEMS structures. These devices require complex fabrication processes, costly chemicals & clean room. In addition to this silicon wafer based devices are not suitable for curved surfaces like pipes, human bodies, organisms, or other arbitrary surface like clothes, structure surfaces which does not have flat and smooth surface always. Therefore, devices based on rigid silicon wafers are not suitable for these applications. Flexible structures are the key solution for this problems. Energy transduction mechanism generates power from free surrounding vibrations or impact. Sensor nodes application has been purposefully selected due to discrete power requirement at low duty cycle. Such nodes require an average power budget in the range of about 0.1 microwatt to 1 mW over a period of 3-5 seconds. Energy harvester is the best alternate source in contrast with battery for sensor node application. Novel design of Energy Harvester based on cheapest flexible non silicon substrate i.e. cellulose acetate substrate have been modeled, simulated and analyzed on COMSOL multiphysics and fabricated using sol-gel spin coating setup. Single cantilever based harvester generates 60-75 mV peak electric potential at 22Hz frequency and approximately 22 µW power at 1K-Ohm load. Cantilever array can be employed for generating higher voltage by replicating this structure. This work covers design, optimization, fabrication of harvester and schottky diodes based voltage multiplier.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Balpande, Suresh S., E-mail: balpandes@rknec.edu; Pande, Rajesh S.
Internet of Things (IoT) uses MEMS sensor nodes and actuators to sense and control objects through Internet. IOT deploys millions of chemical battery driven sensors at different locations which are not reliable many times because of frequent requirement of charging & battery replacement in case of underground laying, placement at harsh environmental conditions, huge count and difference between demand (24 % per year) and availability (energy density growing rate 8% per year). Energy harvester fabricated on silicon wafers have been widely used in manufacturing MEMS structures. These devices require complex fabrication processes, costly chemicals & clean room. In addition tomore » this silicon wafer based devices are not suitable for curved surfaces like pipes, human bodies, organisms, or other arbitrary surface like clothes, structure surfaces which does not have flat and smooth surface always. Therefore, devices based on rigid silicon wafers are not suitable for these applications. Flexible structures are the key solution for this problems. Energy transduction mechanism generates power from free surrounding vibrations or impact. Sensor nodes application has been purposefully selected due to discrete power requirement at low duty cycle. Such nodes require an average power budget in the range of about 0.1 microwatt to 1 mW over a period of 3-5 seconds. Energy harvester is the best alternate source in contrast with battery for sensor node application. Novel design of Energy Harvester based on cheapest flexible non silicon substrate i.e. cellulose acetate substrate have been modeled, simulated and analyzed on COMSOL multiphysics and fabricated using sol-gel spin coating setup. Single cantilever based harvester generates 60-75 mV peak electric potential at 22Hz frequency and approximately 22 µW power at 1K-Ohm load. Cantilever array can be employed for generating higher voltage by replicating this structure. This work covers design, optimization, fabrication of harvester and schottky diodes based voltage multiplier.« less
Anchor Node Localization for Wireless Sensor Networks Using Video and Compass Information Fusion
Pescaru, Dan; Curiac, Daniel-Ioan
2014-01-01
Distributed sensing, computing and communication capabilities of wireless sensor networks require, in most situations, an efficient node localization procedure. In the case of random deployments in harsh or hostile environments, a general localization process within global coordinates is based on a set of anchor nodes able to determine their own position using GPS receivers. In this paper we propose another anchor node localization technique that can be used when GPS devices cannot accomplish their mission or are considered to be too expensive. This novel technique is based on the fusion of video and compass data acquired by the anchor nodes and is especially suitable for video- or multimedia-based wireless sensor networks. For these types of wireless networks the presence of video cameras is intrinsic, while the presence of digital compasses is also required for identifying the cameras' orientations. PMID:24594614
Design and implementation of smart sensor nodes for wireless disaster monitoring systems
NASA Astrophysics Data System (ADS)
Chen, Yih-Fan; Wu, Wen-Jong; Chen, Chun-Kuang; Wen, Chih-Min; Jin, Ming-Hui; Gau, Chung-Yun; Chang, Chih-Chie; Lee, Chih-Kung
2004-07-01
A newly developed smart sensor node that can monitor the safety of temporary structures such as scaffolds at construction sites is detailed in this paper. The design methodology and its trade-offs, as well as its influence on the optimization of sensor networks, is examined. The potential impact on civil engineering construction sites, environmental and natural disaster pre-warning issues, etc., all of which are foundations of smart sensor nodes and corresponding smart sensor networks, is also presented. To minimize the power requirements in order to achieve a true wireless system both in terms of signal and power, a sensor node was designed by adopting an 8051-based micro-controller, an ISM band RF transceiver, and an auto-balanced strain gage signal conditioner. With the built-in RF transceiver, all measurement data can be transmitted to a local control center for data integrity, security, central monitoring, and full-scale analysis. As a battery is the only well-established power source and there is a strong desire to eliminate the need to install bulky power lines, this system designed includes a battery-powered core with optimal power efficiency. To further extend the service life of the built-in power source, a power control algorithm has been embedded in the microcontroller of each sensor node. The entire system has been verified by experimental tests on full-scale scaffold monitoring. The results show that this system provides a practical method to monitor the structure safety in real time and possesses the potential of reducing maintenance costs significantly. The design of the sensor node, central control station, and the integration of several kinds of wireless communication protocol, all of which are successfully integrated to demonstrate the capabilities of this newly developed system, are detailed. Potential impact to the network topology is briefly examined as well.
Node Depth Adjustment Based Target Tracking in UWSNs Using Improved Harmony Search.
Liu, Meiqin; Zhang, Duo; Zhang, Senlin; Zhang, Qunfei
2017-12-04
Underwater wireless sensor networks (UWSNs) can provide a promising solution to underwater target tracking. Due to the limited computation and bandwidth resources, only a small part of nodes are selected to track the target at each interval. How to improve tracking accuracy with a small number of nodes is a key problem. In recent years, a node depth adjustment system has been developed and applied to issues of network deployment and routing protocol. As far as we know, all existing tracking schemes keep underwater nodes static or moving with water flow, and node depth adjustment has not been utilized for underwater target tracking yet. This paper studies node depth adjustment method for target tracking in UWSNs. Firstly, since a Fisher Information Matrix (FIM) can quantify the estimation accuracy, its relation to node depth is derived as a metric. Secondly, we formulate the node depth adjustment as an optimization problem to determine moving depth of activated node, under the constraint of moving range, the value of FIM is used as objective function, which is aimed to be minimized over moving distance of nodes. Thirdly, to efficiently solve the optimization problem, an improved Harmony Search (HS) algorithm is proposed, in which the generating probability is modified to improve searching speed and accuracy. Finally, simulation results are presented to verify performance of our scheme.
Node Depth Adjustment Based Target Tracking in UWSNs Using Improved Harmony Search
Zhang, Senlin; Zhang, Qunfei
2017-01-01
Underwater wireless sensor networks (UWSNs) can provide a promising solution to underwater target tracking. Due to the limited computation and bandwidth resources, only a small part of nodes are selected to track the target at each interval. How to improve tracking accuracy with a small number of nodes is a key problem. In recent years, a node depth adjustment system has been developed and applied to issues of network deployment and routing protocol. As far as we know, all existing tracking schemes keep underwater nodes static or moving with water flow, and node depth adjustment has not been utilized for underwater target tracking yet. This paper studies node depth adjustment method for target tracking in UWSNs. Firstly, since a Fisher Information Matrix (FIM) can quantify the estimation accuracy, its relation to node depth is derived as a metric. Secondly, we formulate the node depth adjustment as an optimization problem to determine moving depth of activated node, under the constraint of moving range, the value of FIM is used as objective function, which is aimed to be minimized over moving distance of nodes. Thirdly, to efficiently solve the optimization problem, an improved Harmony Search (HS) algorithm is proposed, in which the generating probability is modified to improve searching speed and accuracy. Finally, simulation results are presented to verify performance of our scheme. PMID:29207541
Unpowered wireless ultrasound tomography system
NASA Astrophysics Data System (ADS)
Zahedi, Farshad; Huang, Haiying
2016-04-01
In this paper, an unpowered wireless ultrasound tomography system is presented. The system consists of two subsystems; the wireless interrogation unit (WIU) and three wireless nodes installed on the structure. Each node is designed to work in generation and sensing modes, but operates at a specific microwave frequency. Wireless transmission of the ultrasound signals between the WIU and the wireless nodes is achieved by converting ultrasound signals to microwave signals and vice versa, using a microwave carrier signal. In the generation mode, both a carrier signal and an ultrasound modulated microwave signal are transmitted to the sensor nodes. Only the node whose operating frequency matches the carrier signal will receive these signals and demodulate them to recover the original ultrasound signal. In the sensing mode, a microwave carrier signal with two different frequency components matching the operating frequencies of the sensor nodes is broadcasted by the WIU. The sensor nodes, in turn, receive the corresponding carrier signals, modulate it with the ultrasound sensing signal, and wirelessly transmit the modulated signal back to the WIU. The demodulation of the sensing signals is performed in the WIU using a digital signal processing. Implementing a software receiver significantly reduces the complexity and the cost of the WIU. A wireless ultrasound tomography system is realized by interchanging the carrier frequencies so that the wireless transducers can take turn to serve as the actuator and sensors.
Reliability Evaluation for Clustered WSNs under Malware Propagation
Shen, Shigen; Huang, Longjun; Liu, Jianhua; Champion, Adam C.; Yu, Shui; Cao, Qiying
2016-01-01
We consider a clustered wireless sensor network (WSN) under epidemic-malware propagation conditions and solve the problem of how to evaluate its reliability so as to ensure efficient, continuous, and dependable transmission of sensed data from sensor nodes to the sink. Facing the contradiction between malware intention and continuous-time Markov chain (CTMC) randomness, we introduce a strategic game that can predict malware infection in order to model a successful infection as a CTMC state transition. Next, we devise a novel measure to compute the Mean Time to Failure (MTTF) of a sensor node, which represents the reliability of a sensor node continuously performing tasks such as sensing, transmitting, and fusing data. Since clustered WSNs can be regarded as parallel-serial-parallel systems, the reliability of a clustered WSN can be evaluated via classical reliability theory. Numerical results show the influence of parameters such as the true positive rate and the false positive rate on a sensor node’s MTTF. Furthermore, we validate the method of reliability evaluation for a clustered WSN according to the number of sensor nodes in a cluster, the number of clusters in a route, and the number of routes in the WSN. PMID:27294934
Zhao, Kun; Wang, Zhong Lin; Yang, Ya
2016-09-27
Wireless sensor networks will be responsible for a majority of the fast growth in intelligent systems in the next decade. However, most of the wireless smart sensor nodes require an external power source such as a Li-ion battery, where the labor cost and environmental waste issues of replacing batteries have largely limited the practical applications. Instead of using a Li-ion battery, we report an ultrastable, highly efficient, and superhydrophobic-surface-based triboelectric nanogenerator (TENG) to scavenge wind energy for sustainably powering a wireless smart temperature sensor node. There is no decrease in the output voltage and current of the TENG after continuous working for about 14 h at a wind speed of 12 m/s. Through a power management circuit, the TENG can deliver a constant output voltage of 3.3 V and a pulsed output current of about 100 mA to achieve highly efficient energy storage in a capacitor. A wireless smart temperature sensor node can be sustainably powered by the TENG for sending the real-time temperature data to an iPhone under a working distance of 26 m, demonstrating the feasibility of the self-powered wireless smart sensor networks.
Teng, Rui; Zhang, Bing
2011-01-01
On-demand information retrieval enables users to query and collect up-to-date sensing information from sensor nodes. Since high energy efficiency is required in a sensor network, it is desirable to disseminate query messages with small traffic overhead and to collect sensing data with low energy consumption. However, on-demand query messages are generally forwarded to sensor nodes in network-wide broadcasts, which create large traffic overhead. In addition, since on-demand information retrieval may introduce intermittent and spatial data collections, the construction and maintenance of conventional aggregation structures such as clusters and chains will be at high cost. In this paper, we propose an on-demand information retrieval approach that exploits the name resolution of data queries according to the attribute and location of each sensor node. The proposed approach localises each query dissemination and enable localised data collection with maximised aggregation. To illustrate the effectiveness of the proposed approach, an analytical model that describes the criteria of sink proxy selection is provided. The evaluation results reveal that the proposed scheme significantly reduces energy consumption and improves the balance of energy consumption among sensor nodes by alleviating heavy traffic near the sink.
Ding, Xu; Han, Jianghong; Shi, Lei
2015-01-01
In this paper, the optimal working schemes for wireless sensor networks with multiple base stations and wireless energy transfer devices are proposed. The wireless energy transfer devices also work as data gatherers while charging sensor nodes. The wireless sensor network is firstly divided into sub networks according to the concept of Voronoi diagram. Then, the entire energy replenishing procedure is split into the pre-normal and normal energy replenishing stages. With the objective of maximizing the sojourn time ratio of the wireless energy transfer device, a continuous time optimization problem for the normal energy replenishing cycle is formed according to constraints with which sensor nodes and wireless energy transfer devices should comply. Later on, the continuous time optimization problem is reshaped into a discrete multi-phased optimization problem, which yields the identical optimality. After linearizing it, we obtain a linear programming problem that can be solved efficiently. The working strategies of both sensor nodes and wireless energy transfer devices in the pre-normal replenishing stage are also discussed in this paper. The intensive simulations exhibit the dynamic and cyclic working schemes for the entire energy replenishing procedure. Additionally, a way of eliminating “bottleneck” sensor nodes is also developed in this paper. PMID:25785305
Chung, Yun Won; Hwang, Ho Young
2010-01-01
In sensor network, energy conservation is one of the most critical issues since sensor nodes should perform a sensing task for a long time (e.g., lasting a few years) but the battery of them cannot be replaced in most practical situations. For this purpose, numerous energy conservation schemes have been proposed and duty cycling scheme is considered the most suitable power conservation technique, where sensor nodes alternate between states having different levels of power consumption. In order to analyze the energy consumption of energy conservation scheme based on duty cycling, it is essential to obtain the probability of each state. In this paper, we analytically derive steady state probability of sensor node states, i.e., sleep, listen, and active states, based on traffic characteristics and timer values, i.e., sleep timer, listen timer, and active timer. The effect of traffic characteristics and timer values on the steady state probability and energy consumption is analyzed in detail. Our work can provide sensor network operators guideline for selecting appropriate timer values for efficient energy conservation. The analytical methodology developed in this paper can be extended to other energy conservation schemes based on duty cycling with different sensor node states, without much difficulty. PMID:22219676
Ding, Xu; Han, Jianghong; Shi, Lei
2015-03-16
In this paper, the optimal working schemes for wireless sensor networks with multiple base stations and wireless energy transfer devices are proposed. The wireless energy transfer devices also work as data gatherers while charging sensor nodes. The wireless sensor network is firstly divided into sub networks according to the concept of Voronoi diagram. Then, the entire energy replenishing procedure is split into the pre-normal and normal energy replenishing stages. With the objective of maximizing the sojourn time ratio of the wireless energy transfer device, a continuous time optimization problem for the normal energy replenishing cycle is formed according to constraints with which sensor nodes and wireless energy transfer devices should comply. Later on, the continuous time optimization problem is reshaped into a discrete multi-phased optimization problem, which yields the identical optimality. After linearizing it, we obtain a linear programming problem that can be solved efficiently. The working strategies of both sensor nodes and wireless energy transfer devices in the pre-normal replenishing stage are also discussed in this paper. The intensive simulations exhibit the dynamic and cyclic working schemes for the entire energy replenishing procedure. Additionally, a way of eliminating "bottleneck" sensor nodes is also developed in this paper.
LoWMob: Intra-PAN Mobility Support Schemes for 6LoWPAN
Bag, Gargi; Raza, Muhammad Taqi; Kim, Ki-Hyung; Yoo, Seung-Wha
2009-01-01
Mobility in 6LoWPAN (IPv6 over Low Power Personal Area Networks) is being utilized in realizing many applications where sensor nodes, while moving, sense and transmit the gathered data to a monitoring server. By employing IEEE802.15.4 as a baseline for the link layer technology, 6LoWPAN implies low data rate and low power consumption with periodic sleep and wakeups for sensor nodes, without requiring them to incorporate complex hardware. Also enabling sensor nodes with IPv6 ensures that the sensor data can be accessed anytime and anywhere from the world. Several existing mobility-related schemes like HMIPv6, MIPv6, HAWAII, and Cellular IP require active participation of mobile nodes in the mobility signaling, thus leading to the mobility-related changes in the protocol stack of mobile nodes. In this paper, we present LoWMob, which is a network-based mobility scheme for mobile 6LoWPAN nodes in which the mobility of 6LoWPAN nodes is handled at the network-side. LoWMob ensures multi-hop communication between gateways and mobile nodes with the help of the static nodes within a 6LoWPAN. In order to reduce the signaling overhead of static nodes for supporting mobile nodes, LoWMob proposes a mobility support packet format at the adaptation layer of 6LoWPAN. Also we present a distributed version of LoWMob, named as DLoWMob (or Distributed LoWMob), which employs Mobility Support Points (MSPs) to distribute the traffic concentration at the gateways and to optimize the multi-hop routing path between source and destination nodes in a 6LoWPAN. Moreover, we have also discussed the security considerations for our proposed mobility schemes. The performance of our proposed schemes is evaluated in terms of mobility signaling costs, end-to-end delay, and packet success ratio. PMID:22346730
LoWMob: Intra-PAN Mobility Support Schemes for 6LoWPAN.
Bag, Gargi; Raza, Muhammad Taqi; Kim, Ki-Hyung; Yoo, Seung-Wha
2009-01-01
Mobility in 6LoWPAN (IPv6 over Low Power Personal Area Networks) is being utilized in realizing many applications where sensor nodes, while moving, sense and transmit the gathered data to a monitoring server. By employing IEEE802.15.4 as a baseline for the link layer technology, 6LoWPAN implies low data rate and low power consumption with periodic sleep and wakeups for sensor nodes, without requiring them to incorporate complex hardware. Also enabling sensor nodes with IPv6 ensures that the sensor data can be accessed anytime and anywhere from the world. Several existing mobility-related schemes like HMIPv6, MIPv6, HAWAII, and Cellular IP require active participation of mobile nodes in the mobility signaling, thus leading to the mobility-related changes in the protocol stack of mobile nodes. In this paper, we present LoWMob, which is a network-based mobility scheme for mobile 6LoWPAN nodes in which the mobility of 6LoWPAN nodes is handled at the network-side. LoWMob ensures multi-hop communication between gateways and mobile nodes with the help of the static nodes within a 6LoWPAN. In order to reduce the signaling overhead of static nodes for supporting mobile nodes, LoWMob proposes a mobility support packet format at the adaptation layer of 6LoWPAN. Also we present a distributed version of LoWMob, named as DLoWMob (or Distributed LoWMob), which employs Mobility Support Points (MSPs) to distribute the traffic concentration at the gateways and to optimize the multi-hop routing path between source and destination nodes in a 6LoWPAN. Moreover, we have also discussed the security considerations for our proposed mobility schemes. The performance of our proposed schemes is evaluated in terms of mobility signaling costs, end-to-end delay, and packet success ratio.
Routing in Mobile Wireless Sensor Networks: A Leader-Based Approach.
Burgos, Unai; Amozarrain, Ugaitz; Gómez-Calzado, Carlos; Lafuente, Alberto
2017-07-07
This paper presents a leader-based approach to routing in Mobile Wireless Sensor Networks (MWSN). Using local information from neighbour nodes, a leader election mechanism maintains a spanning tree in order to provide the necessary adaptations for efficient routing upon the connectivity changes resulting from the mobility of sensors or sink nodes. We present two protocols following the leader election approach, which have been implemented using Castalia and OMNeT++. The protocols have been evaluated, besides other reference MWSN routing protocols, to analyse the impact of network size and node velocity on performance, which has demonstrated the validity of our approach.
Design of a Base Station for MEMS CCR Localization in an Optical Sensor Network
Park, Chan Gook; Jeon, Hyun Cheol; Kim, Hyoun Jin; Kim, Jae Yoon
2014-01-01
This paper introduces a design and implementation of a base station, capable of positioning sensor nodes using an optical scheme. The base station consists of a pulse laser module, optical detectors and beam splitter, which are mounted on a rotation-stage, and a Time to Digital Converter (TDC). The optical pulse signal transmitted to the sensor node with a Corner Cube Retro-reflector (CCR) is reflected to the base station, and the Time of Flight (ToF) data can be obtained from the two detectors. With the angle and flight time data, the position of the sensor node can be calculated. The performance of the system is evaluated by using a commercial CCR. The sensor nodes are placed at different angles from the base station and scanned using the laser. We analyze the node position error caused by the rotation and propose error compensation methods, namely the outlier sample exception and decreasing the confidence factor steadily using the recursive least square (RLS) methods. Based on the commercial CCR results, the MEMS CCR is also tested to demonstrate the compatibility between the base station and the proposed methods. The result shows that the localization performance of the system can be enhanced with the proposed compensation method using the MEMS CCR. PMID:24815681
Design of a base station for MEMS CCR localization in an optical sensor network.
Park, Chan Gook; Jeon, Hyun Cheol; Kim, Hyoun Jin; Kim, Jae Yoon
2014-05-08
This paper introduces a design and implementation of a base station, capable of positioning sensor nodes using an optical scheme. The base station consists of a pulse laser module, optical detectors and beam splitter, which are mounted on a rotation-stage, and a Time to Digital Converter (TDC). The optical pulse signal transmitted to the sensor node with a Corner Cube Retro-reflector (CCR) is reflected to the base station, and the Time of Flight (ToF) data can be obtained from the two detectors. With the angle and flight time data, the position of the sensor node can be calculated. The performance of the system is evaluated by using a commercial CCR. The sensor nodes are placed at different angles from the base station and scanned using the laser. We analyze the node position error caused by the rotation and propose error compensation methods, namely the outlier sample exception and decreasing the confidence factor steadily using the recursive least square (RLS) methods. Based on the commercial CCR results, the MEMS CCR is also tested to demonstrate the compatibility between the base station and the proposed methods. The result shows that the localization performance of the system can be enhanced with the proposed compensation method using the MEMS CCR.
Sensor node for remote monitoring of waterborne disease-causing bacteria.
Kim, Kyukwang; Myung, Hyun
2015-05-05
A sensor node for sampling water and checking for the presence of harmful bacteria such as E. coli in water sources was developed in this research. A chromogenic enzyme substrate assay method was used to easily detect coliform bacteria by monitoring the color change of the sampled water mixed with a reagent. Live webcam image streaming to the web browser of the end user with a Wi-Fi connected sensor node shows the water color changes in real time. The liquid can be manipulated on the web-based user interface, and also can be observed by webcam feeds. Image streaming and web console servers run on an embedded processor with an expansion board. The UART channel of the expansion board is connected to an external Arduino board and a motor driver to control self-priming water pumps to sample the water, mix the reagent, and remove the water sample after the test is completed. The sensor node can repeat water testing until the test reagent is depleted. The authors anticipate that the use of the sensor node developed in this research can decrease the cost and required labor for testing samples in a factory environment and checking the water quality of local water sources in developing countries.
Ghasemzadeh, Hassan; Loseu, Vitali; Jafari, Roozbeh
2010-03-01
Mobile sensor-based systems are emerging as promising platforms for healthcare monitoring. An important goal of these systems is to extract physiological information about the subject wearing the network. Such information can be used for life logging, quality of life measures, fall detection, extraction of contextual information, and many other applications. Data collected by these sensor nodes are overwhelming, and hence, an efficient data processing technique is essential. In this paper, we present a system using inexpensive, off-the-shelf inertial sensor nodes that constructs motion transcripts from biomedical signals and identifies movements by taking collaboration between the nodes into consideration. Transcripts are built of motion primitives and aim to reduce the complexity of the original data. We then label each primitive with a unique symbol and generate a sequence of symbols, known as motion template, representing a particular action. This model leads to a distributed algorithm for action recognition using edit distance with respect to motion templates. The algorithm reduces the number of active nodes during every classification decision. We present our results using data collected from five normal subjects performing transitional movements. The results clearly illustrate the effectiveness of our framework. In particular, we obtain a classification accuracy of 84.13% with only one sensor node involved in the classification process.
Energy-efficient and fast data gathering protocols for indoor wireless sensor networks.
Tümer, Abdullah Erdal; Gündüz, Mesut
2010-01-01
Wireless Sensor Networks have become an important technology with numerous potential applications for the interaction of computers and the physical environment in civilian and military areas. In the routing protocols that are specifically designed for the applications used by sensor networks, the limited available power of the sensor nodes has been taken into consideration in order to extend the lifetime of the networks. In this paper, two protocols based on LEACH and called R-EERP and S-EERP with base and threshold values are presented. R-EERP and S-EERP are two efficient energy aware routing protocols that can be used for some critical applications such as detecting dangerous gases (methane, ammonium, carbon monoxide, etc.) in an indoor environment. In R-EERP, sensor nodes are deployed randomly in a field similar to LEACH. In S-EERP, nodes are deployed sequentially in the rooms of the flats of a multi-story building. In both protocols, nodes forming clusters do not change during a cluster change time, only the cluster heads change. Furthermore, an XOR operation is performed on the collected data in order to prevent the sending of the same data sensed by the nodes close to each other. Simulation results show that our proposed protocols are more energy-efficient than the conventional LEACH protocol.
GPS-Free Localization Algorithm for Wireless Sensor Networks
Wang, Lei; Xu, Qingzheng
2010-01-01
Localization is one of the most fundamental problems in wireless sensor networks, since the locations of the sensor nodes are critical to both network operations and most application level tasks. A GPS-free localization scheme for wireless sensor networks is presented in this paper. First, we develop a standardized clustering-based approach for the local coordinate system formation wherein a multiplication factor is introduced to regulate the number of master and slave nodes and the degree of connectivity among master nodes. Second, using homogeneous coordinates, we derive a transformation matrix between two Cartesian coordinate systems to efficiently merge them into a global coordinate system and effectively overcome the flip ambiguity problem. The algorithm operates asynchronously without a centralized controller; and does not require that the location of the sensors be known a priori. A set of parameter-setting guidelines for the proposed algorithm is derived based on a probability model and the energy requirements are also investigated. A simulation analysis on a specific numerical example is conducted to validate the mathematical analytical results. We also compare the performance of the proposed algorithm under a variety multiplication factor, node density and node communication radius scenario. Experiments show that our algorithm outperforms existing mechanisms in terms of accuracy and convergence time. PMID:22219694
Design of autonomous sensor nodes for remote soil monitoring in tropical banana plantation
NASA Astrophysics Data System (ADS)
Tiausas, Francis Jerome G.; Co, Jerelyn; Macalinao, Marc Joseph M.; Guico, Maria Leonora; Monje, Jose Claro; Oppus, Carlos
2017-09-01
Determining the effect of Fusarium oxysporum f. sp. cubense Tropical Race 4 on various soil parameters is essential in modeling and predicting its occurrence in banana plantations. One way to fulfill this is through a sensor network that will continuously and automatically monitor environmental conditions at suspect locations for an extended period of time. A wireless sensor network was developed specifically for this purpose. This sensor network is capable of measuring soil acidity, moisture, temperature, and conductivity. The designed prototype made use of off-the-shelf Parrot Flower Power soil sensor, pH sensor, Bluno Beetle, battery, and 3D-printed materials, catering specifically to the conditions of tropical banana plantations with consideration for sensor node size, communication, and power. Sensor nodes were tested on both simulated tropical environments and on an actual banana plantation in San Jose, General Santos City, Philippines. Challenges were resolved through iterative design and development of prototypes. Several tests including temperature and weather resilience, and structural stress tests were done to validate the design. Findings showed that the WSN nodes developed for this purpose are resilient to high tropical temperatures for up to 12 hours of continuous exposure, are able to withstand compressive forces of up to 8880.6 N, and can reliably collect data automatically from the area 47.96% of the time at an hourly frequency under actual field conditions.
A Study on Wireless Charging for Prolonging the Lifetime of Wireless Sensor Networks
Tu, Weijian; Xu, Xianghua; Ye, Tingcong; Cheng, Zongmao
2017-01-01
Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node) as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP) to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network. PMID:28677639
Wang, Yishan; Doleschel, Sammy; Wunderlich, Ralf; Heinen, Stefan
2015-03-01
This paper presents a wearable wireless ECG monitoring system based on novel 3-Lead electrode placements for long-term homecare. The experiment for novel 3-Lead electrode placements is carried out, and the results show that the distance between limb electrodes can be significantly reduced. Based on the new electrode position, a small size sensor node, which is powered by a rechargeable battery, is designed to detect, amplify, filter and transmit the ECG signals. The coordinator receives the data and sends it to PC. Finally the signals are displayed on the GUI. In order to control the power consumption of sensor node, a dynamic power adjustment method is applied to automatically adjust the transmission power of the sensor node according to the received signal strength indicator (RSSI), which is related to the distance and obstacle between sensor node and coordinator. The system is evaluated when the user, who wears the sensor, is walking and running. A promising performance is achieved even under body motion. The power consumption can be significantly reduced with this dynamic power adjustment method.
Spatial aggregation query in dynamic geosensor networks
NASA Astrophysics Data System (ADS)
Yi, Baolin; Feng, Dayang; Xiao, Shisong; Zhao, Erdun
2007-11-01
Wireless sensor networks have been widely used for civilian and military applications, such as environmental monitoring and vehicle tracking. In many of these applications, the researches mainly aim at building sensor network based systems to leverage the sensed data to applications. However, the existing works seldom exploited spatial aggregation query considering the dynamic characteristics of sensor networks. In this paper, we investigate how to process spatial aggregation query over dynamic geosensor networks where both the sink node and sensor nodes are mobile and propose several novel improvements on enabling techniques. The mobility of sensors makes the existing routing protocol based on information of fixed framework or the neighborhood infeasible. We present an improved location-based stateless implicit geographic forwarding (IGF) protocol for routing a query toward the area specified by query window, a diameter-based window aggregation query (DWAQ) algorithm for query propagation and data aggregation in the query window, finally considering the location changing of the sink node, we present two schemes to forward the result to the sink node. Simulation results show that the proposed algorithms can improve query latency and query accuracy.
Outage Probability Minimization for Energy Harvesting Cognitive Radio Sensor Networks
Zhang, Fan; Jing, Tao; Huo, Yan; Jiang, Kaiwei
2017-01-01
The incorporation of cognitive radio (CR) capability in wireless sensor networks yields a promising network paradigm known as CR sensor networks (CRSNs), which is able to provide spectrum efficient data communication. However, due to the high energy consumption results from spectrum sensing, as well as subsequent data transmission, the energy supply for the conventional sensor nodes powered by batteries is regarded as a severe bottleneck for sustainable operation. The energy harvesting technique, which gathers energy from the ambient environment, is regarded as a promising solution to perpetually power-up energy-limited devices with a continual source of energy. Therefore, applying the energy harvesting (EH) technique in CRSNs is able to facilitate the self-sustainability of the energy-limited sensors. The primary concern of this study is to design sensing-transmission policies to minimize the long-term outage probability of EH-powered CR sensor nodes. We formulate this problem as an infinite-horizon discounted Markov decision process and propose an ϵ-optimal sensing-transmission (ST) policy through using the value iteration algorithm. ϵ is the error bound between the ST policy and the optimal policy, which can be pre-defined according to the actual need. Moreover, for a special case that the signal-to-noise (SNR) power ratio is sufficiently high, we present an efficient transmission (ET) policy and prove that the ET policy achieves the same performance with the ST policy. Finally, extensive simulations are conducted to evaluate the performance of the proposed policies and the impaction of various network parameters. PMID:28125023
Outage Probability Minimization for Energy Harvesting Cognitive Radio Sensor Networks.
Zhang, Fan; Jing, Tao; Huo, Yan; Jiang, Kaiwei
2017-01-24
The incorporation of cognitive radio (CR) capability in wireless sensor networks yields a promising network paradigm known as CR sensor networks (CRSNs), which is able to provide spectrum efficient data communication. However, due to the high energy consumption results from spectrum sensing, as well as subsequent data transmission, the energy supply for the conventional sensor nodes powered by batteries is regarded as a severe bottleneck for sustainable operation. The energy harvesting technique, which gathers energy from the ambient environment, is regarded as a promising solution to perpetually power-up energy-limited devices with a continual source of energy. Therefore, applying the energy harvesting (EH) technique in CRSNs is able to facilitate the self-sustainability of the energy-limited sensors. The primary concern of this study is to design sensing-transmission policies to minimize the long-term outage probability of EH-powered CR sensor nodes. We formulate this problem as an infinite-horizon discounted Markov decision process and propose an ϵ -optimal sensing-transmission (ST) policy through using the value iteration algorithm. ϵ is the error bound between the ST policy and the optimal policy, which can be pre-defined according to the actual need. Moreover, for a special case that the signal-to-noise (SNR) power ratio is sufficiently high, we present an efficient transmission (ET) policy and prove that the ET policy achieves the same performance with the ST policy. Finally, extensive simulations are conducted to evaluate the performance of the proposed policies and the impaction of various network parameters.
A Novel Cross-Layer Routing Protocol Based on Network Coding for Underwater Sensor Networks
Wang, Hao; Wang, Shilian; Bu, Renfei; Zhang, Eryang
2017-01-01
Underwater wireless sensor networks (UWSNs) have attracted increasing attention in recent years because of their numerous applications in ocean monitoring, resource discovery and tactical surveillance. However, the design of reliable and efficient transmission and routing protocols is a challenge due to the low acoustic propagation speed and complex channel environment in UWSNs. In this paper, we propose a novel cross-layer routing protocol based on network coding (NCRP) for UWSNs, which utilizes network coding and cross-layer design to greedily forward data packets to sink nodes efficiently. The proposed NCRP takes full advantages of multicast transmission and decode packets jointly with encoded packets received from multiple potential nodes in the entire network. The transmission power is optimized in our design to extend the life cycle of the network. Moreover, we design a real-time routing maintenance protocol to update the route when detecting inefficient relay nodes. Substantial simulations in underwater environment by Network Simulator 3 (NS-3) show that NCRP significantly improves the network performance in terms of energy consumption, end-to-end delay and packet delivery ratio compared with other routing protocols for UWSNs. PMID:28786915
A two-tiered self-powered wireless monitoring system architecture for bridge health management
NASA Astrophysics Data System (ADS)
Kurata, Masahiro; Lynch, Jerome P.; Galchev, Tzeno; Flynn, Michael; Hipley, Patrick; Jacob, Vince; van der Linden, Gwendolyn; Mortazawi, Amir; Najafi, Khalil; Peterson, Rebecca L.; Sheng, Li-Hong; Sylvester, Dennis; Thometz, Edward
2010-04-01
Bridges are an important societal resource used to carry vehicular traffic within a transportation network. As such, the economic impact of the failure of a bridge is high; the recent failure of the I-35W Bridge in Minnesota (2007) serves as a poignant example. Structural health monitoring (SHM) systems can be adopted to detect and quantify structural degradation and damage in an affordable and real-time manner. This paper presents a detailed overview of a multi-tiered architecture for the design of a low power wireless monitoring system for large and complex infrastructure systems. The monitoring system architecture employs two wireless sensor nodes, each with unique functional features and varying power demand. At the lowest tier of the system architecture is the ultra-low power Phoenix wireless sensor node whose design has been optimized to draw minimal power during standby. These ultra low-power nodes are configured to communicate their measurements to a more functionally-rich wireless sensor node residing on the second-tier of the monitoring system architecture. While the Narada wireless sensor node offers more memory, greater processing power and longer communication ranges, it also consumes more power during operation. Radio frequency (RF) and mechanical vibration power harvesting is integrated with the wireless sensor nodes to allow them to operate freely for long periods of time (e.g., years). Elements of the proposed two-tiered monitoring system architecture are validated upon an operational long-span suspension bridge.
Routing Protocols in Wireless Sensor Networks
Villalba, Luis Javier García; Orozco, Ana Lucila Sandoval; Cabrera, Alicia Triviño; Abbas, Cláudia Jacy Barenco
2009-01-01
The applications of wireless sensor networks comprise a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a review of the main routing protocols proposed for wireless sensor networks. Additionally, the paper includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless sensor networks. PMID:22291515
Tang, Chengpei; Shokla, Sanesy Kumcr; Modhawar, George; Wang, Qiang
2016-01-01
Collaborative strategies for mobile sensor nodes ensure the efficiency and the robustness of data processing, while limiting the required communication bandwidth. In order to solve the problem of pipeline inspection and oil leakage monitoring, a collaborative weighted mobile sensing scheme is proposed. By adopting a weighted mobile sensing scheme, the adaptive collaborative clustering protocol can realize an even distribution of energy load among the mobile sensor nodes in each round, and make the best use of battery energy. A detailed theoretical analysis and experimental results revealed that the proposed protocol is an energy efficient collaborative strategy such that the sensor nodes can communicate with a fusion center and produce high power gain. PMID:26907285
Routing protocols in wireless sensor networks.
Villalba, Luis Javier García; Orozco, Ana Lucila Sandoval; Cabrera, Alicia Triviño; Abbas, Cláudia Jacy Barenco
2009-01-01
The applications of wireless sensor networks comprise a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a review of the main routing protocols proposed for wireless sensor networks. Additionally, the paper includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless sensor networks.
Semantic Visualization of Wireless Sensor Networks for Elderly Monitoring
NASA Astrophysics Data System (ADS)
Stocklöw, Carsten; Kamieth, Felix
In the area of Ambient Intelligence, Wireless Sensor Networks are commonly used for user monitoring purposes like health monitoring and user localization. Existing work on visualization of wireless sensor networks focuses mainly on displaying individual nodes and logical, graph-based topologies. This way, the relation to the real-world deployment is lost. This paper presents a novel approach for visualization of wireless sensor networks and interaction with complex services on the nodes. The environment is realized as a 3D model, and multiple nodes, that are worn by a single individual, are grouped together to allow an intuitive interface for end users. We describe application examples and show that our approach allows easier access to network information and functionality by comparing it with existing solutions.
A QoS-guaranteed coverage precedence routing algorithm for wireless sensor networks.
Jiang, Joe-Air; Lin, Tzu-Shiang; Chuang, Cheng-Long; Chen, Chia-Pang; Sun, Chin-Hong; Juang, Jehn-Yih; Lin, Jiun-Chuan; Liang, Wei-Wen
2011-01-01
For mission-critical applications of wireless sensor networks (WSNs) involving extensive battlefield surveillance, medical healthcare, etc., it is crucial to have low-power, new protocols, methodologies and structures for transferring data and information in a network with full sensing coverage capability for an extended working period. The upmost mission is to ensure that the network is fully functional providing reliable transmission of the sensed data without the risk of data loss. WSNs have been applied to various types of mission-critical applications. Coverage preservation is one of the most essential functions to guarantee quality of service (QoS) in WSNs. However, a tradeoff exists between sensing coverage and network lifetime due to the limited energy supplies of sensor nodes. In this study, we propose a routing protocol to accommodate both energy-balance and coverage-preservation for sensor nodes in WSNs. The energy consumption for radio transmissions and the residual energy over the network are taken into account when the proposed protocol determines an energy-efficient route for a packet. The simulation results demonstrate that the proposed protocol is able to increase the duration of the on-duty network and provide up to 98.3% and 85.7% of extra service time with 100% sensing coverage ratio comparing with LEACH and the LEACH-Coverage-U protocols, respectively.
Rassam, Murad A.; Zainal, Anazida; Maarof, Mohd Aizaini
2013-01-01
Wireless Sensor Networks (WSNs) are important and necessary platforms for the future as the concept “Internet of Things” has emerged lately. They are used for monitoring, tracking, or controlling of many applications in industry, health care, habitat, and military. However, the quality of data collected by sensor nodes is affected by anomalies that occur due to various reasons, such as node failures, reading errors, unusual events, and malicious attacks. Therefore, anomaly detection is a necessary process to ensure the quality of sensor data before it is utilized for making decisions. In this review, we present the challenges of anomaly detection in WSNs and state the requirements to design efficient and effective anomaly detection models. We then review the latest advancements of data anomaly detection research in WSNs and classify current detection approaches in five main classes based on the detection methods used to design these approaches. Varieties of the state-of-the-art models for each class are covered and their limitations are highlighted to provide ideas for potential future works. Furthermore, the reviewed approaches are compared and evaluated based on how well they meet the stated requirements. Finally, the general limitations of current approaches are mentioned and further research opportunities are suggested and discussed. PMID:23966182
An Energy Aware Adaptive Sampling Algorithm for Energy Harvesting WSN with Energy Hungry Sensors.
Srbinovski, Bruno; Magno, Michele; Edwards-Murphy, Fiona; Pakrashi, Vikram; Popovici, Emanuel
2016-03-28
Wireless sensor nodes have a limited power budget, though they are often expected to be functional in the field once deployed for extended periods of time. Therefore, minimization of energy consumption and energy harvesting technology in Wireless Sensor Networks (WSN) are key tools for maximizing network lifetime, and achieving self-sustainability. This paper proposes an energy aware Adaptive Sampling Algorithm (ASA) for WSN with power hungry sensors and harvesting capabilities, an energy management technique that can be implemented on any WSN platform with enough processing power to execute the proposed algorithm. An existing state-of-the-art ASA developed for wireless sensor networks with power hungry sensors is optimized and enhanced to adapt the sampling frequency according to the available energy of the node. The proposed algorithm is evaluated using two in-field testbeds that are supplied by two different energy harvesting sources (solar and wind). Simulation and comparison between the state-of-the-art ASA and the proposed energy aware ASA (EASA) in terms of energy durability are carried out using in-field measured harvested energy (using both wind and solar sources) and power hungry sensors (ultrasonic wind sensor and gas sensors). The simulation results demonstrate that using ASA in combination with an energy aware function on the nodes can drastically increase the lifetime of a WSN node and enable self-sustainability. In fact, the proposed EASA in conjunction with energy harvesting capability can lead towards perpetual WSN operation and significantly outperform the state-of-the-art ASA.
Water Catchment and Storage Monitoring
NASA Astrophysics Data System (ADS)
Bruenig, Michael; Dunbabin, Matt; Moore, Darren
2010-05-01
Sensors and Sensor Networks technologies provide the means for comprehensive understanding of natural processes in the environment by radically increasing the availability of empirical data about the natural world. This step change is achieved through a dramatic reduction in the cost of data acquisition and many orders of magnitude increase in the spatial and temporal granularity of measurements. Australia's Commonwealth Scientific and Industrial Research Organisation (CSIRO) is undertaking a strategic research program developing wireless sensor network technology for environmental monitoring. As part of this research initiative, we are engaging with government agencies to densely monitor water catchments and storages, thereby enhancing understanding of the environmental processes that affect water quality. In the Gold Coast hinterland in Queensland, Australia, we are building sensor networks to monitor restoration of rainforest within the catchment, and to monitor methane flux release and water quality in the water storages. This poster will present our ongoing work in this region of eastern Australia. The Springbrook plateau in the Gold Coast hinterland lies within a World Heritage listed area, has uniquely high rainfall, hosts a wide range of environmental gradients, and forms part of the catchment for Gold Coast's water storages. Parts of the plateau are being restored from agricultural grassland to native rainforest vegetation. Since April 2008, we have had a 10-node, multi-hop sensor network deployed there to monitor microclimate variables. This network will be expanded to 50-nodes in February 2010, and to around 200-nodes and 1000 sensors by mid-2011, spread over an area of approximately 0.8 square kilometers. The extremely dense microclimate sensing will enhance knowledge of the environmental factors that enhance or inhibit the regeneration of native rainforest. The final network will also include nodes with acoustic and image sensing capability for monitoring higher level parameters such as fauna diversity. The regenerating rainforest environment presents a number of interesting challenges for wireless sensor networks related to energy harvesting and to reliable low-power wireless communications through dense and wet vegetation. Located downstream from the Springbrook plateau, the Little Nerang and Hinze dams are the two major water supply storages for the Gold Coast region. In September 2009 we fitted methane, light, wind, and sonar sensors to our autonomous electric boat platform and successfully demonstrated autonomous collection of methane flux release data on Little Nerang Dam. Sensor and boat status data were relayed back to a human operator on the shore of the dam via a small network of our Fleck™ nodes. The network also included 4 floating nodes each fitted with a string of 6 temperature sensors for profiling temperature at different water depths. We plan to expand the network further during 2010 to incorporate floating methane nodes, additional temperature sensing nodes, as well as land-based microclimate nodes. The overall monitoring system will provide significant data to understand the connected catchment-to-storage system and will provide continuous data to monitor and understand change trends within this world heritage area.
An Embedded Sensor Node Microcontroller with Crypto-Processors.
Panić, Goran; Stecklina, Oliver; Stamenković, Zoran
2016-04-27
Wireless sensor network applications range from industrial automation and control, agricultural and environmental protection, to surveillance and medicine. In most applications, data are highly sensitive and must be protected from any type of attack and abuse. Security challenges in wireless sensor networks are mainly defined by the power and computing resources of sensor devices, memory size, quality of radio channels and susceptibility to physical capture. In this article, an embedded sensor node microcontroller designed to support sensor network applications with severe security demands is presented. It features a low power 16-bitprocessor core supported by a number of hardware accelerators designed to perform complex operations required by advanced crypto algorithms. The microcontroller integrates an embedded Flash and an 8-channel 12-bit analog-to-digital converter making it a good solution for low-power sensor nodes. The article discusses the most important security topics in wireless sensor networks and presents the architecture of the proposed hardware solution. Furthermore, it gives details on the chip implementation, verification and hardware evaluation. Finally, the chip power dissipation and performance figures are estimated and analyzed.
Yi, Wei-Ying; Leung, Kwong-Sak; Leung, Yee
2017-12-22
Urban air pollution has caused public concern globally because it seriously affects human life. Modern monitoring systems providing pollution information with high spatio-temporal resolution have been developed to identify personal exposures. However, these systems' hardware specifications and configurations are usually fixed according to the applications. They can be inconvenient to maintain, and difficult to reconfigure and expand with respect to sensing capabilities. This paper aims at tackling these issues by adopting the proposed Modular Sensor System (MSS) architecture and Universal Sensor Interface (USI), and modular design in a sensor node. A compact MSS sensor node is implemented and evaluated. It has expandable sensor modules with plug-and-play feature and supports multiple Wireless Sensor Networks (WSNs). Evaluation results show that MSS sensor nodes can easily fit in different scenarios, adapt to reconfigurations dynamically, and detect low concentration air pollution with high energy efficiency and good data accuracy. We anticipate that the efforts on system maintenance, adaptation, and evolution can be significantly reduced when deploying the system in the field.
2017-01-01
Urban air pollution has caused public concern globally because it seriously affects human life. Modern monitoring systems providing pollution information with high spatio-temporal resolution have been developed to identify personal exposures. However, these systems’ hardware specifications and configurations are usually fixed according to the applications. They can be inconvenient to maintain, and difficult to reconfigure and expand with respect to sensing capabilities. This paper aims at tackling these issues by adopting the proposed Modular Sensor System (MSS) architecture and Universal Sensor Interface (USI), and modular design in a sensor node. A compact MSS sensor node is implemented and evaluated. It has expandable sensor modules with plug-and-play feature and supports multiple Wireless Sensor Networks (WSNs). Evaluation results show that MSS sensor nodes can easily fit in different scenarios, adapt to reconfigurations dynamically, and detect low concentration air pollution with high energy efficiency and good data accuracy. We anticipate that the efforts on system maintenance, adaptation, and evolution can be significantly reduced when deploying the system in the field. PMID:29271952
An Embedded Sensor Node Microcontroller with Crypto-Processors
Panić, Goran; Stecklina, Oliver; Stamenković, Zoran
2016-01-01
Wireless sensor network applications range from industrial automation and control, agricultural and environmental protection, to surveillance and medicine. In most applications, data are highly sensitive and must be protected from any type of attack and abuse. Security challenges in wireless sensor networks are mainly defined by the power and computing resources of sensor devices, memory size, quality of radio channels and susceptibility to physical capture. In this article, an embedded sensor node microcontroller designed to support sensor network applications with severe security demands is presented. It features a low power 16-bitprocessor core supported by a number of hardware accelerators designed to perform complex operations required by advanced crypto algorithms. The microcontroller integrates an embedded Flash and an 8-channel 12-bit analog-to-digital converter making it a good solution for low-power sensor nodes. The article discusses the most important security topics in wireless sensor networks and presents the architecture of the proposed hardware solution. Furthermore, it gives details on the chip implementation, verification and hardware evaluation. Finally, the chip power dissipation and performance figures are estimated and analyzed. PMID:27128925
An energy efficient multiple mobile sinks based routing algorithm for wireless sensor networks
NASA Astrophysics Data System (ADS)
Zhong, Peijun; Ruan, Feng
2018-03-01
With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.
Homomorphic Filtering for Improving Time Synchronization in Wireless Networks
Castillo-Secilla, José María; Palomares, José Manuel; León, Fernando; Olivares, Joaquín
2017-01-01
Wireless sensor networks are used to sample the environment in a distributed way. Therefore, it is mandatory for all of the measurements to be tightly synchronized in order to guarantee that every sensor is sampling the environment at the exact same instant of time. The synchronization drift gets bigger in environments suffering from temperature variations. Thus, this work is focused on improving time synchronization under deployments with temperature variations. The working hypothesis demonstrated in this work is that the clock skew of two nodes (the ratio of the real frequencies of the oscillators) is composed of a multiplicative combination of two main components: the clock skew due to the variations between the cut of the crystal of each oscillator and the clock skew due to the different temperatures affecting the nodes. By applying a nonlinear filtering, the homomorphic filtering, both components are separated in an effective way. A correction factor based on temperature, which can be applied to any synchronization protocol, is proposed. For testing it, an improvement of the FTSP synchronization protocol has been developed and physically tested under temperature variation scenarios using TelosB motes flashed with the IEEE 802.15.4 implementation supplied by TinyOS. PMID:28425955
Homomorphic Filtering for Improving Time Synchronization in Wireless Networks.
Castillo-Secilla, José María; Palomares, José Manuel; León, Fernando; Olivares, Joaquín
2017-04-20
Wireless sensor networks are used to sample the environment in a distributed way. Therefore, it is mandatory for all of the measurements to be tightly synchronized in order to guarantee that every sensor is sampling the environment at the exact same instant of time. The synchronization drift gets bigger in environments suffering from temperature variations. Thus, this work is focused on improving time synchronization under deployments with temperature variations. The working hypothesis demonstrated in this work is that the clock skew of two nodes (the ratio of the real frequencies of the oscillators) is composed of a multiplicative combination of two main components: the clock skew due to the variations between the cut of the crystal of each oscillator and the clock skew due to the different temperatures affecting the nodes. By applying a nonlinear filtering, the homomorphic filtering, both components are separated in an effective way. A correction factor based on temperature, which can be applied to any synchronization protocol, is proposed. For testing it, an improvement of the FTSP synchronization protocol has been developed and physically tested under temperature variation scenarios using TelosB motes flashed with the IEEE 802.15.4 implementation supplied by TinyOS.
Yu, Shanen; Xu, Yiming; Jiang, Peng; Wu, Feng; Xu, Huan
2017-01-01
At present, free-to-move node self-deployment algorithms aim at event coverage and cannot improve network coverage under the premise of considering network connectivity, network reliability and network deployment energy consumption. Thus, this study proposes pigeon-based self-deployment algorithm (PSA) for underwater wireless sensor networks to overcome the limitations of these existing algorithms. In PSA, the sink node first finds its one-hop nodes and maximizes the network coverage in its one-hop region. The one-hop nodes subsequently divide the network into layers and cluster in each layer. Each cluster head node constructs a connected path to the sink node to guarantee network connectivity. Finally, the cluster head node regards the ratio of the movement distance of the node to the change in the coverage redundancy ratio as the target function and employs pigeon swarm optimization to determine the positions of the nodes. Simulation results show that PSA improves both network connectivity and network reliability, decreases network deployment energy consumption, and increases network coverage. PMID:28338615
Yen, Hong-Hsu
2009-01-01
In wireless sensor networks, data aggregation routing could reduce the number of data transmissions so as to achieve energy efficient transmission. However, data aggregation introduces data retransmission that is caused by co-channel interference from neighboring sensor nodes. This kind of co-channel interference could result in extra energy consumption and significant latency from retransmission. This will jeopardize the benefits of data aggregation. One possible solution to circumvent data retransmission caused by co-channel interference is to assign different channels to every sensor node that is within each other's interference range on the data aggregation tree. By associating each radio with a different channel, a sensor node could receive data from all the children nodes on the data aggregation tree simultaneously. This could reduce the latency from the data source nodes back to the sink so as to meet the user's delay QoS. Since the number of radios on each sensor node and the number of non-overlapping channels are all limited resources in wireless sensor networks, a challenging question here is to minimize the total transmission cost under limited number of non-overlapping channels in multi-radio wireless sensor networks. This channel constrained data aggregation routing problem in multi-radio wireless sensor networks is an NP-hard problem. I first model this problem as a mixed integer and linear programming problem where the objective is to minimize the total transmission subject to the data aggregation routing, channel and radio resources constraints. The solution approach is based on the Lagrangean relaxation technique to relax some constraints into the objective function and then to derive a set of independent subproblems. By optimally solving these subproblems, it can not only calculate the lower bound of the original primal problem but also provide useful information to get the primal feasible solutions. By incorporating these Lagrangean multipliers as the link arc weight, the optimization-based heuristics are proposed to get energy-efficient data aggregation tree with better resource (channel and radio) utilization. From the computational experiments, the proposed optimization-based approach is superior to existing heuristics under all tested cases.
NASA Astrophysics Data System (ADS)
Mandal, Swagata; Saini, Jogender; Zabołotny, Wojciech M.; Sau, Suman; Chakrabarti, Amlan; Chattopadhyay, Subhasis
2017-03-01
Due to the dramatic increase of data volume in modern high energy physics (HEP) experiments, a robust high-speed data acquisition (DAQ) system is very much needed to gather the data generated during different nuclear interactions. As the DAQ works under harsh radiation environment, there is a fair chance of data corruption due to various energetic particles like alpha, beta, or neutron. Hence, a major challenge in the development of DAQ in the HEP experiment is to establish an error resilient communication system between front-end sensors or detectors and back-end data processing computing nodes. Here, we have implemented the DAQ using field-programmable gate array (FPGA) due to some of its inherent advantages over the application-specific integrated circuit. A novel orthogonal concatenated code and cyclic redundancy check (CRC) have been used to mitigate the effects of data corruption in the user data. Scrubbing with a 32-b CRC has been used against error in the configuration memory of FPGA. Data from front-end sensors will reach to the back-end processing nodes through multiple stages that may add an uncertain amount of delay to the different data packets. We have also proposed a novel memory management algorithm that helps to process the data at the back-end computing nodes removing the added path delays. To the best of our knowledge, the proposed FPGA-based DAQ utilizing optical link with channel coding and efficient memory management modules can be considered as first of its kind. Performance estimation of the implemented DAQ system is done based on resource utilization, bit error rate, efficiency, and robustness to radiation.
Lee, JongHyup; Pak, Dohyun
2016-01-01
For practical deployment of wireless sensor networks (WSN), WSNs construct clusters, where a sensor node communicates with other nodes in its cluster, and a cluster head support connectivity between the sensor nodes and a sink node. In hybrid WSNs, cluster heads have cellular network interfaces for global connectivity. However, when WSNs are active and the load of cellular networks is high, the optimal assignment of cluster heads to base stations becomes critical. Therefore, in this paper, we propose a game theoretic model to find the optimal assignment of base stations for hybrid WSNs. Since the communication and energy cost is different according to cellular systems, we devise two game models for TDMA/FDMA and CDMA systems employing power prices to adapt to the varying efficiency of recent wireless technologies. The proposed model is defined on the assumptions of the ideal sensing field, but our evaluation shows that the proposed model is more adaptive and energy efficient than local selections. PMID:27589743
Development of a Sensor Node for Precision Horticulture
López, Juan A.; Soto, Fulgencio; Sánchez, Pedro; Iborra, Andrés; Suardiaz, Juan; Vera, Juan A.
2009-01-01
This paper presents the design of a new wireless sensor node (GAIA Soil-Mote) for precision horticulture applications which permits the use of precision agricultural instruments based on the SDI-12 standard. Wireless communication is achieved with a transceiver compliant with the IEEE 802.15.4 standard. The GAIA Soil-Mote software implementation is based on TinyOS. A two-phase methodology was devised to validate the design of this sensor node. The first phase consisted of laboratory validation of the proposed hardware and software solution, including a study on power consumption and autonomy. The second phase consisted of implementing a monitoring application in a real broccoli (Brassica oleracea L. var Marathon) crop in Campo de Cartagena in south-east Spain. In this way the sensor node was validated in real operating conditions. This type of application was chosen because there is a large potential market for it in the farming sector, especially for the development of precision agriculture applications. PMID:22412309
A Multi-Agent Framework for Packet Routing in Wireless Sensor Networks
Ye, Dayon; Zhang, Minji; Yang, Yu
2015-01-01
Wireless sensor networks (WSNs) have been widely investigated in recent years. One of the fundamental issues in WSNs is packet routing, because in many application domains, packets have to be routed from source nodes to destination nodes as soon and as energy efficiently as possible. To address this issue, a large number of routing approaches have been proposed. Although every existing routing approach has advantages, they also have some disadvantages. In this paper, a multi-agent framework is proposed that can assist existing routing approaches to improve their routing performance. This framework enables each sensor node to build a cooperative neighbour set based on past routing experience. Such cooperative neighbours, in turn, can help the sensor to effectively relay packets in the future. This framework is independent of existing routing approaches and can be used to assist many existing routing approaches. Simulation results demonstrate the good performance of this framework in terms of four metrics: average delivery latency, successful delivery ratio, number of live nodes and total sensing coverage. PMID:25928063
Development of a sensor node for precision horticulture.
López, Juan A; Soto, Fulgencio; Sánchez, Pedro; Iborra, Andrés; Suardiaz, Juan; Vera, Juan A
2009-01-01
This paper presents the design of a new wireless sensor node (GAIA Soil-Mote) for precision horticulture applications which permits the use of precision agricultural instruments based on the SDI-12 standard. Wireless communication is achieved with a transceiver compliant with the IEEE 802.15.4 standard. The GAIA Soil-Mote software implementation is based on TinyOS. A two-phase methodology was devised to validate the design of this sensor node. The first phase consisted of laboratory validation of the proposed hardware and software solution, including a study on power consumption and autonomy. The second phase consisted of implementing a monitoring application in a real broccoli (Brassica oleracea L. var Marathon) crop in Campo de Cartagena in south-east Spain. In this way the sensor node was validated in real operating conditions. This type of application was chosen because there is a large potential market for it in the farming sector, especially for the development of precision agriculture applications.
A monitoring system for vegetable greenhouses based on a wireless sensor network.
Li, Xiu-hong; Cheng, Xiao; Yan, Ke; Gong, Peng
2010-01-01
A wireless sensor network-based automatic monitoring system is designed for monitoring the life conditions of greenhouse vegetables. The complete system architecture includes a group of sensor nodes, a base station, and an internet data center. For the design of wireless sensor node, the JN5139 micro-processor is adopted as the core component and the Zigbee protocol is used for wireless communication between nodes. With an ARM7 microprocessor and embedded ZKOS operating system, a proprietary gateway node is developed to achieve data influx, screen display, system configuration and GPRS based remote data forwarding. Through a Client/Server mode the management software for remote data center achieves real-time data distribution and time-series analysis. Besides, a GSM-short-message-based interface is developed for sending real-time environmental measurements, and for alarming when a measurement is beyond some pre-defined threshold. The whole system has been tested for over one year and satisfactory results have been observed, which indicate that this system is very useful for greenhouse environment monitoring.
Using Wireless Sensor Networks in Improvised Explosive Device Detection
2007-12-01
data collection (permitting self - healing when a node failure occurs); Sensor nodes Gateway nodes 24 • Energy efficiency (necessary to maintain...Runner” robotic platform (see Figure 1). It is reported that this system can detect a wide range of IEDs, even those concealed in vehicles. However...be as simple as running over a rubber hose to produce enough air pressure to activate a switch. Some IEDs have been remotely detonated with radio
Intelligent Software Agents: Sensor Integration and Response
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kulesz, James J; Lee, Ronald W
2013-01-01
Abstract In a post Macondo world the buzzwords are Integrity Management and Incident Response Management. The twin processes are not new but the opportunity to link the two is novel. Intelligent software agents can be used with sensor networks in distributed and centralized computing systems to enhance real-time monitoring of system integrity as well as manage the follow-on incident response to changing, and potentially hazardous, environmental conditions. The software components are embedded at the sensor network nodes in surveillance systems used for monitoring unusual events. When an event occurs, the software agents establish a new concept of operation at themore » sensing node, post the event status to a blackboard for software agents at other nodes to see , and then react quickly and efficiently to monitor the scale of the event. The technology addresses a current challenge in sensor networks that prevents a rapid and efficient response when a sensor measurement indicates that an event has occurred. By using intelligent software agents - which can be stationary or mobile, interact socially, and adapt to changing situations - the technology offers features that are particularly important when systems need to adapt to active circumstances. For example, when a release is detected, the local software agent collaborates with other agents at the node to exercise the appropriate operation, such as: targeted detection, increased detection frequency, decreased detection frequency for other non-alarming sensors, and determination of environmental conditions so that adjacent nodes can be informed that an event is occurring and when it will arrive. The software agents at the nodes can also post the data in a targeted manner, so that agents at other nodes and the command center can exercise appropriate operations to recalibrate the overall sensor network and associated intelligence systems. The paper describes the concepts and provides examples of real-world implementations including the Threat Detection and Analysis System (TDAS) at the International Port of Memphis and the Biological Warning and Incident Characterization System (BWIC) Environmental Monitoring (EM) Component. Technologies developed for these 24/7 operational systems have applications for improved real-time system integrity awareness as well as provide incident response (as needed) for production and field applications.« less
Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai
2013-05-15
The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate.
Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai
2013-01-01
The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate. PMID:23676625
A wireless medical monitoring over a heterogeneous sensor network.
Yuce, Mehmet R; Ng, Peng Choong; Lee, Chin K; Khan, Jamil Y; Liu, Wentai
2007-01-01
This paper presents a heterogeneous sensor network system that has the capability to monitor physiological parameters from multiple patient bodies by means of different communication standards. The system uses the recently opened medical band called MICS (Medical Implant Communication Service) between the sensor nodes and a remote central control unit (CCU) that behaves as a base station. The CCU communicates with another network standard (the internet or a mobile network) for a long distance data transfer. The proposed system offers mobility to patients and flexibility to medical staff to obtain patient's physiological data on demand basis via Internet. A prototype sensor network including hardware, firmware and software designs has been implemented and tested by incorporating temperature and pulse rate sensors on nodes. The developed system has been optimized for power consumption by having the nodes sleep when there is no communication via a bidirectional communication.
Lee, Kilhung
2010-01-01
This paper presents a medium access control and scheduling scheme for wireless sensor networks. It uses time trees for sending data from the sensor node to the base station. For an energy efficient operation of the sensor networks in a distributed manner, time trees are built in order to reduce the collision probability and to minimize the total energy required to send data to the base station. A time tree is a data gathering tree where the base station is the root and each sensor node is either a relaying or a leaf node of the tree. Each tree operates in a different time schedule with possibly different activation rates. Through the simulation, the proposed scheme that uses time trees shows better characteristics toward burst traffic than the previous energy and data arrival rate scheme. PMID:22319270
Open-WiSe: a solar powered wireless sensor network platform.
González, Apolinar; Aquino, Raúl; Mata, Walter; Ochoa, Alberto; Saldaña, Pedro; Edwards, Arthur
2012-01-01
Because battery-powered nodes are required in wireless sensor networks and energy consumption represents an important design consideration, alternate energy sources are needed to provide more effective and optimal function. The main goal of this work is to present an energy harvesting wireless sensor network platform, the Open Wireless Sensor node (WiSe). The design and implementation of the solar powered wireless platform is described including the hardware architecture, firmware, and a POSIX Real-Time Kernel. A sleep and wake up strategy was implemented to prolong the lifetime of the wireless sensor network. This platform was developed as a tool for researchers investigating Wireless sensor network or system integrators.
A General Self-Organized Tree-Based Energy-Balance Routing Protocol for Wireless Sensor Network
NASA Astrophysics Data System (ADS)
Han, Zhao; Wu, Jie; Zhang, Jie; Liu, Liefeng; Tian, Kaiyun
2014-04-01
Wireless sensor network (WSN) is a system composed of a large number of low-cost micro-sensors. This network is used to collect and send various kinds of messages to a base station (BS). WSN consists of low-cost nodes with limited battery power, and the battery replacement is not easy for WSN with thousands of physically embedded nodes, which means energy efficient routing protocol should be employed to offer a long-life work time. To achieve the aim, we need not only to minimize total energy consumption but also to balance WSN load. Researchers have proposed many protocols such as LEACH, HEED, PEGASIS, TBC and PEDAP. In this paper, we propose a General Self-Organized Tree-Based Energy-Balance routing protocol (GSTEB) which builds a routing tree using a process where, for each round, BS assigns a root node and broadcasts this selection to all sensor nodes. Subsequently, each node selects its parent by considering only itself and its neighbors' information, thus making GSTEB a dynamic protocol. Simulation results show that GSTEB has a better performance than other protocols in balancing energy consumption, thus prolonging the lifetime of WSN.
Zhang, Ying; Chen, Wei; Liang, Jixing; Zheng, Bingxin; Jiang, Shengming
2015-12-01
It is expected that in the near future wireless sensor network (WSNs) will be more widely used in the mobile environment, in applications such as Autonomous Underwater Vehicles (AUVs) for marine monitoring and mobile robots for environmental investigation. The sensor nodes' mobility can easily cause changes to the structure of a network topology, and lead to the decline in the amount of transmitted data, excessive energy consumption, and lack of security. To solve these problems, a kind of efficient Topology Control algorithm for node Mobility (TCM) is proposed. In the topology construction stage, an efficient clustering algorithm is adopted, which supports sensor node movement. It can ensure the balance of clustering, and reduce the energy consumption. In the topology maintenance stage, the digital signature authentication based on Error Correction Code (ECC) and the communication mechanism of soft handover are adopted. After verifying the legal identity of the mobile nodes, secure communications can be established, and this can increase the amount of data transmitted. Compared to some existing schemes, the proposed scheme has significant advantages regarding network topology stability, amounts of data transferred, lifetime and safety performance of the network.
Optimizing Cluster Heads for Energy Efficiency in Large-Scale Heterogeneous Wireless Sensor Networks
Gu, Yi; Wu, Qishi; Rao, Nageswara S. V.
2010-01-01
Many complex sensor network applications require deploying a large number of inexpensive and small sensors in a vast geographical region to achieve quality through quantity. Hierarchical clustering is generally considered as an efficient and scalable way to facilitate the management and operation of such large-scale networks and minimize the total energy consumption for prolonged lifetime. Judicious selection of cluster heads for data integration and communication is critical to the success of applications based on hierarchical sensor networks organized as layered clusters. We investigate the problem of selecting sensor nodes in a predeployed sensor network to be the cluster heads tomore » minimize the total energy needed for data gathering. We rigorously derive an analytical formula to optimize the number of cluster heads in sensor networks under uniform node distribution, and propose a Distance-based Crowdedness Clustering algorithm to determine the cluster heads in sensor networks under general node distribution. The results from an extensive set of experiments on a large number of simulated sensor networks illustrate the performance superiority of the proposed solution over the clustering schemes based on k -means algorithm.« less
On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks.
Yu, Jiguo; Chen, Ying; Ma, Liran; Huang, Baogui; Cheng, Xiuzhen
2016-01-15
Coverage and connectivity are two important performance evaluation indices for wireless sensor networks (WSNs). In this paper, we focus on the connected target k-coverage (CTC k) problem in heterogeneous wireless sensor networks (HWSNs). A centralized connected target k-coverage algorithm (CCTC k) and a distributed connected target k-coverage algorithm (DCTC k) are proposed so as to generate connected cover sets for energy-efficient connectivity and coverage maintenance. To be specific, our proposed algorithms aim at achieving minimum connected target k-coverage, where each target in the monitored region is covered by at least k active sensor nodes. In addition, these two algorithms strive to minimize the total number of active sensor nodes and guarantee that each sensor node is connected to a sink, such that the sensed data can be forwarded to the sink. Our theoretical analysis and simulation results show that our proposed algorithms outperform a state-of-art connected k-coverage protocol for HWSNs.
Acoustic ranging of small arms fire using a single sensor node collocated with the target.
Lo, Kam W; Ferguson, Brian G
2015-06-01
A ballistic model-based method, which builds upon previous work by Lo and Ferguson [J. Acoust. Soc. Am. 132, 2997-3017 (2012)], is described for ranging small arms fire using a single acoustic sensor node collocated with the target, without a priori knowledge of the muzzle speed and ballistic constant of the bullet except that they belong to a known two-dimensional parameter space. The method requires measurements of the differential time of arrival and differential angle of arrival of the muzzle blast and ballistic shock wave at the sensor node. Its performance is evaluated using both simulated and real data.