scholarly journals Geometric algorithms for sensor networks

Author(s):  
Jie Gao ◽  
Leonidas Guibas

This paper surveys the use of geometric methods for wireless sensor networks. The close relationship of sensor nodes with their embedded physical space imposes a unique geometric character on such systems. The physical locations of the sensor nodes greatly impact on system design in all aspects, from low-level networking and organization to high-level information processing and applications. This paper reviews work in the past 10 years on topics such as network localization, geometric routing, information discovery, data-centric routing and topology discovery.

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Mohammad Jalil Piran ◽  
Amjad Ali ◽  
Doug Young Suh

In wireless sensor networks, sensor fusion is employed to integrate the acquired data from diverse sensors to provide a unified interpretation. The best and most salient advantage of sensor fusion is to obtain high-level information in both statistical and definitive aspects, which cannot be attained by a single sensor. In this paper, we propose a novel sensor fusion technique based on fuzzy theory for our earlier proposed Cognitive Radio-based Vehicular Ad Hoc and Sensor Networks (CR-VASNET). In the proposed technique, we considered four input sensor readings (antecedents) and one output (consequent). The employed mobile nodes in CR-VASNET are supposed to be equipped with diverse sensors, which cater to our antecedent variables, for example, The Jerk, Collision Intensity, and Temperature and Inclination Degree. Crash_Severity is considered as the consequent variable. The processing and fusion of the diverse sensory signals are carried out by fuzzy logic scenario. Accuracy and reliability of the proposed protocol, demonstrated by the simulation results, introduce it as an applicable system to be employed to reduce the causalities rate of the vehicles’ crashes.


Phytotaxa ◽  
2017 ◽  
Vol 297 (2) ◽  
pp. 101 ◽  
Author(s):  
SOMAYEH MONTAZEROLGHAEM ◽  
ALFONSO SUSANNA ◽  
JUAN ANTONIO CALLEJA ◽  
VALIOLLAH MOZAFFARIAN ◽  
MOHAMMAD REZA RAHIMINEJAD

A molecular phylogeny of the genus Echinops (Asteraceae, Cardueae) based on plastid and nuclear markers is presented. The study focuses on the Iranian representatives of the genus, which constitute a larger part of Echinops. The Bayesian cpDNA tree resulted in a large polytomy. However, the Bayesian ITS tree displayed a well-resolved topology more compatible with the taxonomic treatment generally accepted in Echinops. An ITS network illustrates a close relationship of haplotypes. Mapping diagnostic morphological characters onto the ITS tree revealed a high level of homoplasy among the studied taxa. Except for the life cycle, all other morphological characters evolved many times among the clades and most of them appeared to be of low taxonomical value. Based on the nucleotide polymorphism and haplotypes, the taxonomic status of some taxa was evaluated. The independent status of E. sect. Phaeochaete was confirmed by molecular analyses and morphological characters. The paraphyletic nature of E. sect. Echinops was confirmed. As for the molecular dating, our results suggest that the genus evolved in the early Miocene but the main speciation events took place in the Pliocene-Pleistocene. The biogeographic results do not support any specific ancestral area for Echinops, yet the model states that its current diversity originated in the Irano-Turanian Region and the Eastern Mediterranean region. Some taxonomic changes are suggested, in the synonymy and placement of some taxa. 


Sensors ◽  
2019 ◽  
Vol 19 (4) ◽  
pp. 805 ◽  
Author(s):  
Roberto Rodriguez-Zurrunero ◽  
Ramiro Utrilla ◽  
Alba Rozas ◽  
Alvaro Araujo

The emergence and spread of Internet of Things (IoT) technologies along with the edge computing paradigm has led to an increase in the computational load on sensor end-devices. These devices are now expected to provide high-level information instead of just raw sensor measurements. Therefore, the processing tasks must share the processor time with the communication tasks, and both of them may have strict timing constraints. In this work, we present an empirical study, from the edge computing perspective, of the process management carried out by an IoT Operating System (OS), showing the cross-influence between the processing and communication tasks in end-devices. We have conducted multiple tests in two real scenarios with a specific OS and a set of wireless protocols. In these tests, we have varied the processing and communication tasks timing parameters, as well as their assigned priority levels. The results obtained from these tests demonstrate that there is a close relationship between the characteristics of the processing tasks and the communication performance, especially when the processing computational load is high. In addition, these results also show that the computational load is not the only factor responsible for the communication performance degradation, as the relationship between the processing tasks and the communication protocols timing parameters also plays a role. These conclusions should be taken into account for future OSs and protocol developments.


2018 ◽  
Vol 69 (2) ◽  
pp. 63-87
Author(s):  
Maria Lewandowicz

The Code of Private Law in the Canton of Zurich (Privatrechtliches Gesetzbuch für den Kanton Zürich – PGB) is described as the perfect model for the Swiss Civil Code in the literature devoted to the subject matter of codification of private law in the Swiss Confederation. It was the first modern civil code in Switzerland which was imbued with German tradition and legal culture. At the same time, it represented a high level of scientific sophistication. The Code of Private Law in the Canton of Zurich proved the vitality of German law in Switzerland. Moreover, its stable foundations in the national spirit resultedin a high level of social acceptance for the legal solutions included within. However, the question remains to what extent one can determine the influence of the Code of Private Law in the Canton of Zurich on the project and on the final shape of the Swiss Civil Code (ZGB). Also the question is to what extent one should treat these codes as independent works, even though they were created on the basis of the same initial assumptions. Theinfluence of The Code of Private Law in the Canton of Zurich on the Swiss Civil Code most completely depicts the inheritance law. Firstly, it directly interferes with the personal sphere of a citizen’s life and, consequently, it has to be rooted in the national culture and tradition in order to be effective. Secondly, it is the part of law which was the most diversified regulatory area in Switzerland in the period prior to the unification. The description of the Code of Private Law in the Canton of Zurich as “the perfect model” for the Swiss Civil Code is accurate. However, it is the author’s opinion that thisstatement is an exaggeration. The basic connection between the Code of Private Law in the Canton of Zurich and the Swiss Civil Code is expressed in the method of conducting the preparatory work for the codification work. It is also expressed by the adopted method of selection of the source material which was to serve as demonstrative material in the unification work. However, there is no evidence which would attest that the Swiss Civil Code’s contents were based on the regulations found in the Code of Private Law in the Canton of Zurich. The close relationship of both laws is expressed not in the contents but rather in the ideological assumptions of the conducted codification works.


2013 ◽  
Vol 385-386 ◽  
pp. 1618-1621
Author(s):  
Jing Chen ◽  
Yang Liu

A semi-supervised local subspace alignment (SSLSA) algorithm for wireless sensor networks localization is presented. SSLSA method has the following features: 1) only using pair-wise distance between each node and its neighbors within a certain communication range, 2) aligning subspaces with the constraints of anchor nodes thus avoiding the accumulation of error, and 3) obtaining absolute positions of all sensor nodes directly without any other transformation process. The localization performance of this method is compared to the MDS-MAP(P, R) and LSA methods.


2018 ◽  
Vol 7 (2.31) ◽  
pp. 161
Author(s):  
P Balamurugan ◽  
M Shyamala Devi ◽  
V Sharmila

In wireless sensor networks, Sensor nodes are arranged randomly in unkind physical surroundings to collect data and distribute the data to the remote base station. However the sensor nodes have to preserve the power source that has restricted estimation competence. The sensed information is difficult to be transmitted over the sensor network for a long period of time in an energy efficient manner.  In this paper, it finds the problem of communication data between sink nodes and remote data sources via intermediate nodes in sensor field. So this paper proposes a score based data gathering algorithm in wireless sensor networks. The high-level contribution of this study is the enhancement of a score- based data gathering algorithm and the impact of energy entity for Wireless Sensor Networks.  Then the energy and delay of data gathering are evaluated. Unlike PEGASIS and LEACH, the delay for every process of data gathering is considerably lower when SBDG is employed.  The energy consumed per round of data gathering for both SBDG and EE-SBDG is less than half of that incurred with PEGASIS and LEACH. Compared with LEACH and PEGASIS, SBDG and EE-SBDG are fair with node usage because of the scoring system and residual energy respectively.  Overall, the Score-based data gathering algorithm provides a significant solution to maximize the network lifetime as well as minimum delay per round of data gathering.


Author(s):  
Stefano Lodi ◽  
Gabriele Monti ◽  
Gianluca Moro ◽  
Claudio Sartori

This work proposes and evaluates distributed algorithms for data clustering in self-organizing ad-hoc sensor networks with computational, connectivity, and power constraints. Self-organization is essential in environments with a large number of devices, because the resulting system cannot be configured and maintained by specific human adjustments on its single components. One of the benefits of in-network data clustering algorithms is the capability of the network to transmit only relevant, high level information, namely models, instead of large amounts of raw data, also reducing drastically energy consumption. For instance, a sensor network could directly identify or anticipate extreme environmental events such as tsunami, tornado or volcanic eruptions notifying only the alarm or its probability, rather than transmitting via satellite each single normal wave motion. The efficiency and efficacy of the methods is evaluated by simulation measuring network traffic, and comparing the generated models with ideal results returned by density-based clustering algorithms for centralized systems.


Author(s):  
Juan Gómez-Romero ◽  
Jesús García ◽  
Miguel A. Patricio ◽  
José M. Molina ◽  
James Llinas

Information fusion techniques combine data from multiple sensors, along with additional information and knowledge, to obtain better estimates of the observed scenario than could be achieved by the use of single sensors or information sources alone. According to the JDL fusion process model, high-level information fusion is concerned with the computation of a scene representation in terms of abstract entities such as activities and threats, as well as estimating the relationships among these entities. Recent experiences confirm that context knowledge plays a key role in the new-generation high-level fusion systems, especially in those involving complex scenarios that cause the failure of classical statistical techniques –as it happens in visual sensor networks. In this chapter, we study the architectural and functional issues of applying context information to improve high-level fusion procedures, with a particular focus on visual data applications. The use of formal knowledge representations (e.g. ontologies) is a promising advance in this direction, but there are still some unresolved questions that must be more extensively researched.


Author(s):  
Naina Emmanuel ◽  
Adeel Anjum ◽  
Sadia Shafiq ◽  
Mahamud Hussein Adam

Multiple sensor nodes known as detection stations make the sensor networks; each node is light and portable. Every sensor node contains power source, microcomputer, transducer and transceiver. Power source provides power to each node. Micro-computer is used for storing and processing the output coming from the sensors. The transducer is used to generate the signals and the transceiver is used to receive and transmit data to the central computer. Eavesdropping gets facilitated with wireless communication, and it has many useful applications in military, homeland, hostile and uncontrolled environments. So it is prone to the high level of security. The process in which information is gathered to form a summarized type for analysis is known as data aggregation, as it is used to reduce the energy consumption in wireless sensor networks. The security issues have become crucial in data aggregation, especially when gets deployed in hostile and remote environment. In wireless sensor networks many secure aggregations have been proposed. It still faces some resource constrained that’s why new techniques are needed. In our survey we will discuss those approaches and their pros and cons.


2017 ◽  
Vol 6 (1) ◽  
pp. 70-75 ◽  
Author(s):  
A. Tamizharasi M. E. ◽  
J. Jasmine Selvathai M. E. ◽  
A. Kavi Priya ◽  
Maarlin R. ◽  
Harinetha M.

Wireless sensor networks idea is envisioned and defined as self-deployed, error prone, long living inexpensive communication devices that are densely deployed to collect data from physical space. Sensor nodes communicate with each other to detect events depending on the application, to collect and process data, and to transmit the sensed information to the base station by hopping the data from node to node. Major challenge in wireless network is energy consumption, since the sensor devices are deployed on unattended wide areas and replacing their batteries is not very feasible. Therefore, designing energy-aware algorithms becomes a major challenge for extending the lifetime of sensors. The lifetime of the network can be maximized by selecting the most optimal cluster head. In this paper, a heuristic decision making approach is proposed for producing energy-aware clusters with optimal selection of cluster head. This helps to improve the efficiency and accuracy and overcome the drawbacks like getting trapped at a local extreme in the optimization process.


Sign in / Sign up

Export Citation Format

Share Document