scholarly journals Emergent Behavior in Massively-Deployed Sensor Networks

2008 ◽  
Vol 4 (4) ◽  
pp. 313-331
Author(s):  
Ekaterina Shurkova ◽  
Ruzana Ishak ◽  
Stephan Olariu ◽  
Shaharuddin Salleh
Keyword(s):  
Living Cells ◽  
Emergent Behavior ◽  
Sensor Nodes ◽  
Recent Effort ◽  
Color Information ◽  
Simulation Results ◽  
Deployment Time ◽  
Initial Color ◽  
Living Organisms ◽  
Large Groups

The phenomenal advances in MEMS and nanotechnology make it feasible to build small devices, referred to as sensors that are able to sense, compute and communicate over small distances. The massive deployment of these small devices raises the fascinating question of whether or not the sensors, as a collectivity, will display emergent behavior, just as living organisms do. In this work we report on a recent effort intended to observe emerging behavior of large groups of sensor nodes, like living cells demonstrate. Imagine a massive deployment of sensors that can be in two states "red" and "blue". At deployment time individual sensors have an initial color. The goal is to obtain a uniform coloring of the deployment area. Importantly, the sensors can only talk to sensors that are one-hop away from them. The decisions to change colors are local, based on what the sensors can infer from collecting color information from their neighbors. We have performed extensive simulations involving 20,000 sensors in an area of 100 m × 100 m. Our simulation results show that the sensor network converges to a stable uniform coloring extremely fast.

On Modeling Groups in Crowds: Empirical Evidence and Simulation Results Including Large Groups

2013 ◽  
pp. 835-845 ◽  
Author(s):  
Verena Reuter ◽  
Benjamin S. Bergner ◽  
Gerta Köster ◽  
Michael Seitz ◽  
Franz Treml ◽  
...  
Keyword(s):  
Empirical Evidence ◽  
Simulation Results ◽  
Large Groups

scholarly journals Optimized Gateway Placement for Interference Cancellation in Transmit-Only LPWA Networks

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3884 ◽  
Author(s):  
Hongxian Tian ◽  
Mary Weitnauer ◽  
Gedeon Nyengele
Keyword(s):  
Low Power ◽  
Sensor Network ◽  
Interference Cancellation ◽  
Greedy Algorithms ◽  
Sensor Nodes ◽  
Wide Area ◽  
Delivery Ratio ◽  
Large Network ◽  
Packet Delivery ◽  
Simulation Results

We study the placement of gateways in a low-power wide-area sensor network, when the gateways perform interference cancellation and when the model of the residual error of interference cancellation is proportional to the power of the packet being canceled. For the case of two sensor nodes sending packets that collide, by which we mean overlap in time, we deduce a symmetric two-crescent region wherein a gateway can decode both collided packets. For a large network of many sensors and multiple gateways, we propose two greedy algorithms to optimize the locations of the gateways. Simulation results show that the gateway placements by our algorithms achieve lower average contention, which means higher packet delivery ratio in the same conditions, than when gateways are naively placed, for several area distributions of sensors.

scholarly journals Elephant Herding Optimization for Energy-Based Localization

2018 ◽  
Author(s):  
Sérgio Correia ◽  
Marko Beko ◽  
Luís Cruz ◽  
Slavisa Tomic
Keyword(s):  
Source Localization ◽  
Wireless Sensors ◽  
Performance Comparison ◽  
Sensor Nodes ◽  
Convex Relaxations ◽  
Noisy Environments ◽  
New Approach ◽  
Metaheuristic Methods ◽  
Simulation Results ◽  
First Time

This work addresses the energy-based source localization problem in wireless sensors networks. Instead of circumventing the maximum likelihood (ML) problem by applying convex relaxations and approximations (like all existing approaches do), we here tackle it directly by the use of metaheuristics. To the best of our knowledge, this is the first time that metaheuristics is applied to this type of problems. More specifically an elephant herding optimization (EHO) algorithm is applied. Through extensive simulations, the key parameters of the EHO algorithm are optimized such that they match the energy decay model between two sensor nodes. A detailed analysis of the computational complexity is presented, as well as performance comparison between the proposed algorithm and existing non-metaheuristic ones. Simulation results show that the new approach significantly outperforms the existing solutions in noisy environments, encouraging further improvement and testing of metaheuristic methods.

scholarly journals Evaluation of AODV and DYMO Routing Protocol using Generic, Micaz and Micamotes Energy Conservation Models in AWSN with Static and Mobile Scenario

2019 ◽  
Vol 20 (4) ◽  
pp. 653-662 ◽  
Author(s):  
Suresh Kumar ◽  
Kiran Dhull ◽  
Deepak Sharma ◽  
Payal Arora ◽  
Sandeep Dahiya
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Conservation ◽  
Routing Protocol ◽  
Energy Model ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
End To End Delay ◽  
Adhoc Networks ◽  
Simulation Results ◽  
Aodv Routing Protocol

Adhoc Wireless Sensor Networks (AWSN’s) have found an increasing utility in various applications. In AWSN, sensor nodes are arranged in a topology which is suitable to the requirement of the nature of task. As the sensors are not connected in a fixed manner, their networking, location and functioning keeps on changing based on the situation due to which these are called Adhoc networks. The biggest challenge is to keep the sensors working for longer life by conserving their energy. Therefore, a suitable routing protocol needs to be selected to meet the energy conservation requirement at different nodes. In the present paper, we have evaluated the three energy conservation models i.e. Generic, Micaz and Micamotes for AODV and DYMO routing protocol. The evaluation is carried out using the parameter metrices: (i) Average End-to-End Delay (AEED), (ii) Throughput (iii) Energy consumed in Transmit mode and Receive mode. Based on the simulation results, it has been observed that Micamotes energy model using AODV routing protocol performs better in terms of energy consumption upto 42.99% and 29.90 % in transmit and upto 59.24% and 33.96 % in receive mode respectively as compared to Generic and Micaz energy model.

4. The burning issue: molecules and energy

2003 ◽  
pp. 70-93
Author(s):  
Philip Ball
Keyword(s):  
Citric Acid ◽  
Chemical Reactions ◽  
Citric Acid Cycle ◽  
Living Cells ◽  
Metabolic Processes ◽  
Acid Cycle ◽  
Cellular Life ◽  
Metabolic Reactions ◽  
Molecular Reactions ◽  
Living Organisms

‘The burning issue: molecules and energy’ describes how energy can be transferred through molecular reactions. Metabolic processes are the foundation of cellular life. All chemical reactions increase entropy (or disorder), but living cells maintain their order by carefully controlling metabolic reactions. In living organisms glucose is broken down into pyruvate through glycolysis. Pyruvate then enters the citric acid cycle, which is a series of reactions that generate electrons which generate ATP — the cell's ‘fuel’. Many scientists, most notably Alfred Nobel, have sought to develop molecules which contain huge amounts of energy safely. These molecules can be used to build civilization — or destroy life.

scholarly journals Performance Analysis of a Polling-Based Access Control Combining with the Sleeping Schema in V2I VANETs for Smart Cities

2019 ◽  
Vol 11 (2) ◽  
pp. 503 ◽  
Author(s):  
Min He ◽  
Zheng Guan ◽  
Liyong Bao ◽  
Zhaoxu Zhou ◽  
Marco Anisetti ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Access Control ◽  
Smart Cities ◽  
Theoretical Calculations ◽  
Performance Characteristics ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Ieee 802.11P ◽  
Closed Form Expression ◽  
Simulation Results

In vehicular ad hoc networks (VANETs), one of the important challenges is the lack of precise mathematical modeling taking into account the passive vacation triggered by the zero-arrival state of nodes. Therefore, a polling-based access control is proposed in this paper using a sleeping schema to meet the challenge of quality of service (QoS) and energy-efficient transport in VANET environments for smart cities. Based on IEEE 802.11p, it was developed in an attempt to improve the energy efficiency of the hybrid coordination function of controlled channel access (HCCA) through a self-managing sleeping mechanism for both the roadside unit (RSU) and on-board units (OBUs) or sensor nodes according to the traffic load in vehicle -to-infrastructure (V2I) scenarios. Additionally, a Markov chain was developed for analyzing the proposed mechanism, and the exact mathematical model is provided with regard to the passive vacation. Then, the performance characteristics—including the mean cyclic period, delay, and queue length—were accurately obtained. In addition, the closed-form expression of the quantitative relationship among sleeping time, performance characteristics, and service parameters was obtained, which can easily evaluate the energy efficiency. It was proven that theoretical calculations were completely consistent with simulation results. The simulation results demonstrate that the suggested method had much lower energy consumption than the standard strategy at the expense of rarely access delay.

Insights into chaperonin function from studies on archaeal thermosomes

2011 ◽  
Vol 39 (1) ◽  
pp. 94-98 ◽  
Author(s):  
Peter Lund
Keyword(s):  
Cell Death ◽  
Protein Folding ◽  
Recent Work ◽  
Mechanism Of Action ◽  
Molecular Chaperones ◽  
Short Review ◽  
Living Cells ◽  
Living Organisms ◽  
Opening And Closing ◽  
Hydrolysis Of

It is now well understood that, although proteins fold spontaneously (in a thermodynamic sense), many nevertheless require the assistance of helpers called molecular chaperones to reach their correct and active folded state in living cells. This is because the pathways of protein folding are full of traps for the unwary: the forces that drive proteins into their folded states can also drive them into insoluble aggregates, and, particularly when cells are stressed, this can lead, without prevention or correction, to cell death. The chaperonins are a family of molecular chaperones, practically ubiquitous in all living organisms, which possess a remarkable structure and mechanism of action. They act as nanoboxes in which proteins can fold, isolated from their environment and from other partners with which they might, with potentially deleterious consequences, interact. The opening and closing of these boxes is timed by the binding and hydrolysis of ATP. The chaperonins which are found in bacteria are extremely well characterized, and, although those found in archaea (also known as thermosomes) and eukaryotes have received less attention, our understanding of these proteins is constantly improving. This short review will summarize what we know about chaperonin function in the cell from studies on the archaeal chaperonins, and show how recent work is improving our understanding of this essential class of molecular chaperones.

Maximizing the Lifetime of Sliding Wireless Sensors in Barrier Coverage

2012 ◽  
Vol 157-158 ◽  
pp. 503-506 ◽  
Author(s):  
Tao Yang ◽  
Pan Guo Fan ◽  
De Jun Mu
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Wireless Sensors ◽  
Specific Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Barrier Coverage ◽  
Coverage Ratio ◽  
Simulation Results

Wireless sensor network is always deployed in specific area for intrusion detection and environmental monitoring. The sensor nodes suffer mostly from their limited battery capacity.Maximizing the lifetime of the entire networks is mainly necessary considered in the design. Sliding the sensors in different barriers under the optimal barrier construction is a good solution for both maximizing network lifetime and providing predetermined coverage ratio. The simulation results demonstrate that the scheme can effectively reduce the energy consumption of the wireless sensor network and increase the network lifetime.

An Improved Sensor Positioning for Wireless Sensor Networks

2014 ◽  
Vol 716-717 ◽  
pp. 1322-1325
Author(s):  
Jin Tao Lin ◽  
Guang Yu Fan ◽  
Wen Hong Liu ◽  
Ying Da Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Signal Strength ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Positioning Accuracy ◽  
Positioning Method ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Sensor Positioning

Sensor positioning is a fundamental block in various location-dependent applications of wireless sensor networks. In order to improve the positioning accuracy without increasing the complex and cost of sensor nodes, an improve sensor positioning method is proposed for wireless sensor networks. In the method, after receiving the broadcasting message of the neighboring anchor nodes, the sensor nodes calculate a modifying factor of the change of the signal strength. And they modify the distances between themselves and neighboring anchor nodes with the modifying factor. Simulation results show that the proposed method can obtain a high positioning accuracy.

A Novel Algorithm to Improve Network Lifetime of Wireless Sensor Networks

2013 ◽  
Vol 433-435 ◽  
pp. 599-602
Author(s):  
Rui Ma ◽  
Yan Cheng Liu ◽  
Chuan Wang
Keyword(s):  
Network Lifetime ◽  
Search Strategy ◽  
Hybrid Genetic Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Sensor Nodes ◽  
Sensor Cover ◽  
Simulation Results ◽  
Local Search Strategy ◽  
Novel Algorithm

One approach to extend the network lifetime is to divide the deployed sensors into disjoint subsets of sensors, or sensor covers, such that each sensor cover can cover all targets and work by turns. The more sensor covers can be found, the longer sensor network lifetime can be prolonged.This study propose a novel hybrid genetic algorithm (NHGA) comprising both basic generic operations with a fitness-improving local-search strategy to divide all wireless sensor nodes into a maximum number of disjoint set covers (DSCs). The simulation results show that NHGA outperforms the existing methods by generating more disjoint set covers and prolongs network lifetime.

Sign in / Sign up

Export Citation Format

Share Document