27 research outputs found
An Empirical Analysis of cluster-based routing protocols in wireless sensor network
Wireless Sensor Networks (WSNs) are utilized for condition monitoring, developing the board, following animals or goods, social protection, transportation, and house frameworks. WSNs are revolutionizing research. A WSN includes a large number of sensor nodes, or bits, in the application. Bits outfitted with the application\u27s sensors acquire nature data and send it to at least one sink center (in like manner called base stations). This article simulates energy-efficient network initialization strategies using simulation models. First, an overview of network initiation and exploration procedures in wireless ad-hoc networks is provided. The clustering-based routing strategy was selected since it\u27s best for ad-hoc sensor networks. The clustering-based routing techniques used for this study are described below. LEACH, SEP, and Z-SEP are used. MATLAB was used to implement and simulate all routing protocols. All protocols were simulated with various parameters like Number of CHs, Number of Alive Nodes, Number of Dead Nodes, Number of packets to BS, and circumstances to show their functioning and to determine their behavior in different sensor networks
A Survey on Wireless Sensor Network Security
Wireless sensor networks (WSNs) have recently attracted a lot of interest in
the research community due their wide range of applications. Due to distributed
nature of these networks and their deployment in remote areas, these networks
are vulnerable to numerous security threats that can adversely affect their
proper functioning. This problem is more critical if the network is deployed
for some mission-critical applications such as in a tactical battlefield.
Random failure of nodes is also very likely in real-life deployment scenarios.
Due to resource constraints in the sensor nodes, traditional security
mechanisms with large overhead of computation and communication are infeasible
in WSNs. Security in sensor networks is, therefore, a particularly challenging
task. This paper discusses the current state of the art in security mechanisms
for WSNs. Various types of attacks are discussed and their countermeasures
presented. A brief discussion on the future direction of research in WSN
security is also included.Comment: 24 pages, 4 figures, 2 table
The design and implementation of fuzzy query processing on sensor networks
Sensor nodes and Wireless Sensor Networks (WSN) enable observation of the physical world in unprecedented levels of granularity. A growing number of environmental monitoring applications are being designed to leverage data collection features of WSN, increasing the need for efficient data management techniques and for comparative analysis of various data management techniques. My research leverages aspects of fuzzy database, specifically fuzzy data representation and fuzzy or flexible queries to improve upon the efficiency of existing data management techniques by exploiting the inherent uncertainty of the data collected by WSN. Herein I present my research contributions. I provide classification of WSN middleware to illustrate varying approaches to data management for WSN and identify a need to better handle the uncertainty inherent in data collected from physical environments and to take advantage of the imprecision of the data to increase the efficiency of WSN by requiring less information be transmitted to adequately answer queries posed by WSN monitoring applications.
In this dissertation, I present a novel approach to querying WSN, in which semantic knowledge about sensor attributes is represented as fuzzy terms. I present an enhanced simulation environment that supports more flexible and realistic analysis by using cellular automata models to separately model the deployed WSN and the underlying physical environment. Simulation experiments are used to evaluate my fuzzy query approach for environmental monitoring applications. My analysis shows that using fuzzy queries improves upon other data management techniques by reducing the amount of data that needs to be collected to accurately satisfy application requests. This reduction in data transmission results in increased battery life within sensors, an important measure of cost and performance for WSN applications
Recommended from our members
Performance analysis and improvement of InfiniBand networks. Modelling and effective Quality-of-Service mechanisms for interconnection networks in cluster computing systems.
The InfiniBand Architecture (IBA) network has been proposed as a new
industrial standard with high-bandwidth and low-latency suitable for constructing
high-performance interconnected cluster computing systems. This architecture
replaces the traditional bus-based interconnection with a switch-based network for
the server Input-Output (I/O) and inter-processor communications. The efficient
Quality-of-Service (QoS) mechanism is fundamental to ensure the import at QoS
metrics, such as maximum throughput and minimum latency, leaving aside other
aspects like guarantee to reduce the delay, blocking probability, and mean queue
length, etc.
Performance modelling and analysis has been and continues to be of great
theoretical and practical importance in the design and development of
communication networks. This thesis aims to investigate efficient and cost-effective
QoS mechanisms for performance analysis and improvement of InfiniBand
networks in cluster-based computing systems.
Firstly, a rate-based source-response link-by-link admission and congestion
control function with improved Explicit Congestion Notification (ECN) packet
marking scheme is developed. This function adopts the rate control to reduce
congestion of multiple-class traffic. Secondly, a credit-based flow control scheme is
presented to reduce the mean queue length, throughput and response time of the system. In order to evaluate the performance of this scheme, a new queueing
network model is developed. Theoretical analysis and simulation experiments show
that these two schemes are quite effective and suitable for InfiniBand networks.
Finally, to obtain a thorough and deep understanding of the performance attributes
of InfiniBand Architecture network, two efficient threshold function flow control
mechanisms are proposed to enhance the QoS of InfiniBand networks; one is Entry
Threshold that sets the threshold for each entry in the arbitration table, and other is
Arrival Job Threshold that sets the threshold based on the number of jobs in each
Virtual Lane. Furthermore, the principle of Maximum Entropy is adopted to analyse
these two new mechanisms with the Generalized Exponential (GE)-Type
distribution for modelling the inter-arrival times and service times of the input traffic.
Extensive simulation experiments are conducted to validate the accuracy of the
analytical models
Design and evaluation of a Thread-Level Speculation runtime library
En los próximos años es más que probable que máquinas con cientos o incluso miles de procesadores sean algo habitual. Para aprovechar estas máquinas, y debido a la dificultad de programar de forma paralela, sería deseable disponer de sistemas de compilación o ejecución que extraigan todo el paralelismo posible de las aplicaciones existentes. Así en los últimos tiempos se han propuesto multitud de técnicas paralelas. Sin embargo, la mayoría de ellas se centran en códigos simples, es decir, sin dependencias entre sus instrucciones. La paralelización especulativa surge como una solución para estos códigos complejos, posibilitando la ejecución de cualquier tipo de códigos, con o sin dependencias. Esta técnica asume de forma optimista que la ejecución paralela de cualquier tipo de código no de lugar a errores y, por lo tanto, necesitan de un mecanismo que detecte cualquier tipo de colisión. Para ello, constan de un monitor responsable que comprueba constantemente que la ejecución no
sea errónea, asegurando que los resultados obtenidos de forma paralela sean similares a los de cualquier ejecución secuencial. En caso de que la ejecución fuese errónea los threads se detendrían y reiniciarían su ejecución para asegurar que la ejecución sigue la semántica secuencial.
Nuestra contribución en este campo incluye (1) una nueva librería de ejecución especulativa fácil de utilizar; (2) nuevas propuestas que permiten reducir de forma significativa el número de accesos requeridos en las peraciones
especulativas, así como consejos para reducir la memoria a utilizar; (3) propuestas para mejorar los métodos de scheduling centradas en la gestión dinámica de los bloques de iteraciones utilizados en las ejecuciones especulativas; (4) una solución híbrida que utiliza memoria transaccional para implementar las secciones críticas de una librería de paralelización especulativa; y (5) un análisis de las técnicas especulativas en uno de los dispositivos más vanguardistas del momento, los coprocesadores Intel Xeon Phi.
Como hemos podido comprobar, la paralelización especulativa es un campo de investigación activo. Nuestros resultados demuestran que esta técnica permite obtener mejoras de rendimiento en un gran número de aplicaciones. Así, esperamos que este trabajo contribuya a facilitar el uso de soluciones especulativas en compiladores comerciales y/o modelos de programación paralela de memoria compartida.Departamento de Informática (Arquitectura y Tecnología de Computadores, Ciencias de la Computación e Inteligencia Artificial, Lenguajes y Sistemas Informáticos
Optimization techniques for fine-grained communication in PGAS environments
Partitioned Global Address Space (PGAS) languages promise to deliver improved programmer productivity and good performance in large-scale parallel machines. However, adequate performance for applications that rely on fine-grained communication without compromising their programmability is difficult to achieve. Manual or compiler assistance code optimization is required to avoid fine-grained accesses. The downside of manually applying code transformations is the increased program complexity and hindering of the programmer productivity. On the other hand, compiler optimizations of fine-grained accesses require knowledge of physical data mapping and the use of parallel loop constructs.
This thesis presents optimizations for solving the three main challenges of the fine-grain communication: (i) low network communication efficiency; (ii) large number of runtime calls; and (iii) network hotspot creation for the non-uniform distribution of network communication, To solve this problems, the dissertation presents three approaches. First, it presents an improved inspector-executor transformation to improve the network efficiency through runtime aggregation. Second, it presents incremental optimizations to the inspector-executor loop transformation to automatically remove the runtime calls. Finally, the thesis presents a loop scheduling loop transformation for avoiding network hotspots and the oversubscription of nodes. In contrast to previous work that use static coalescing, prefetching, limited privatization, and caching, the solutions presented in this thesis focus cover all the aspect of fine-grained communication, including reducing the number of calls generated by the compiler and minimizing the overhead of the inspector-executor optimization.
A performance evaluation with various microbenchmarks and benchmarks, aiming at predicting scaling and absolute performance numbers of a Power 775 machine, indicates that applications with regular accesses can achieve up to 180% of the performance of hand-optimized versions, while in applications with irregular accesses the transformations are expected to yield from 1.12X up to 6.3X speedup. The loop scheduling shows performance gains from 3-25% for NAS FT and bucket-sort benchmarks, and up to 3.4X speedup for the microbenchmarks
A VOICE PRIORITY QUEUE (VPQ) SCHEDULER FOR VOIP OVER WLANs
The Voice over Internet Protocol (VoIP) application has observed the fastest
growth in the world of telecommunication. The Wireless Local Area Network
(WLAN) is the most assuring of technologies among the wireless networks, which
has facilitated high-rate voice services at low cost and good flexibility. In a voice
conversation, each client works as a sender and as a receiver depending on the
direction of traffic flow over the network.
A VoIP application requires a higher throughput, less packet loss and a higher
fairness index over the network. The packets of VoIP streaming may experience drops
because of the competition among the different kinds of traffic flow over the network.
A VoIP application is also sensitive to delay and requires the voice packets to arrive
on time from the sender to the receiver side without any delay over WLANs.
The scheduling system model for VoIP traffic is still an unresolved problem. A
new traffic scheduler is necessary to offer higher throughput and a higher fairness
index for a VoIP application. The objectives of this thesis are to propose a new
scheduler and algorithms that support the VoIP application and to evaluate, validate
and verify the newly proposed scheduler and algorithms with the existing scheduling
algorithms over WLANs through simulation and experimental environment.
We proposed a new Voice Priority Queue (VPQ) scheduling system model and
algorithms to solve scheduling issues. VPQ system model is implemented in three
stages. The first stage of the model is to ensure efficiency by producing a higher
throughput and fairness for VoIP packets. The second stage will be designed for
bursty Virtual-VoIP Flow (Virtual-VF) while the third stage is a Switch Movement
(SM) technique. Furthermore, we compared the VPQ scheduler with other well
known schedulers and algorithms. We observed in our simulation and experimental
environment that the VPQ provides better results for the VoIP over WLANs
New platform for intelligent context-based distributed information fusion
Tesis por compendio de publicaciones[ES]Durante las últimas décadas, las redes de sensores se han vuelto cada vez más importantes y hoy en día están presentes en prácticamente todos los sectores de nuestra sociedad. Su gran capacidad para adquirir datos y actuar sobre el entorno, puede facilitar la construcción de sistemas sensibles al contexto, que permitan un análisis detallado y flexible de los procesos que ocurren y los servicios que se pueden proporcionar a los usuarios.
Esta tesis doctoral se presenta en el formato de “Compendio de Artículos”, de tal forma que las principales características de la arquitectura multi-agente distribuida propuesta para facilitar la interconexión de redes de sensores se presentan en tres artículos bien diferenciados. Se ha planteado una arquitectura modular y ligera para dispositivos limitados computacionalmente, diseñando un mecanismo de comunicación flexible que permite la interacción entre diferentes agentes embebidos, desplegados en dispositivos de tamaño reducido. Se propone un nuevo modelo de agente embebido, como mecanismo de extensión para la plataforma PANGEA. Además, se diseña un nuevo modelo de organización virtual de agentes especializada en la fusión de información. De
esta forma, los agentes inteligentes tienen en cuenta las características de las organizaciones existentes en el entorno a la hora de proporcionar servicios. El modelo de fusión de información presenta una arquitectura claramente diferenciada en 4 niveles, siendo capaz de obtener la información proporcionada por las redes de sensores (capas inferiores) para ser integrada con organizaciones virtuales de agentes (capas superiores). El filtrado de señales, minería de datos, sistemas de razonamiento basados en casos y otras técnicas de Inteligencia Artificial han sido aplicadas para la consecución exitosa de esta investigación.
Una de las principales innovaciones que pretendo con mi estudio, es investigar acerca de nuevos mecanismos que permitan la adición dinámica de redes de sensores combinando diferentes tecnologías con el propósito final de exponer un conjunto de servicios de usuario de forma distribuida. En este sentido, se propondrá una arquitectura multiagente basada en organizaciones virtuales que gestione de forma autónoma la infraestructura subyacente constituida por el hardware y los diferentes sensores
Emerging Communications for Wireless Sensor Networks
Wireless sensor networks are deployed in a rapidly increasing number of arenas, with uses ranging from healthcare monitoring to industrial and environmental safety, as well as new ubiquitous computing devices that are becoming ever more pervasive in our interconnected society. This book presents a range of exciting developments in software communication technologies including some novel applications, such as in high altitude systems, ground heat exchangers and body sensor networks. Authors from leading institutions on four continents present their latest findings in the spirit of exchanging information and stimulating discussion in the WSN community worldwide