Abstract: This paper proposes a hierarchical hidden Markov model (HHMM) to model the detection of M vehicles in a wireless sensor network (WSN). The HHMM model contains an extra level of hidden Markov model to model the temporal transitions of each
state of the first HMM. By modeling the temporal transitions, only those hypothesis with nonzero transition probabilities needs to be tested. Thus, this method efficiently reduces the computation load, which is preferable in WSN applications.This paper integrates several techniques to optimize the detection performance. The output of the states of the first HMM is modeled as Gaussian Mixture Model (GMM), where the number of states and the number of Gaussians are experimentally determined, while the other parameters are estimated using Expectation Maximization (EM). HHMM is used to model the sequence of the local decisions which are based on multiple hypothesis testing with maximum likelihood approach. The states in the HHMM represent various combinations of vehicles of different types. Due to the statistical advantages of multisensor data fusion, we propose a heuristic based on fuzzy weighted majority voting to enhance cooperative classification of moving vehicles within a region that is monitored by a wireless sensor network. A fuzzy inference system weighs each local decision based on the signal to noise
ratio of the acoustic signal for target detection and the signal to noise ratio of the radio signal for sensor communication. The spatial correlation among the observations of neighboring sensor nodes is efficiently utilized as well as the temporal correlation. Simulation results demonstrate the efficiency of this scheme.
Abstract: Greenhouse is a building, which provides controlled climate conditions to the plants to keep them from external hard conditions. Greenhouse technology gives freedom to the farmer to select any crop type in any time during year. The quality and productivity of plants inside greenhouse is highly dependent on the management quality and a good management scheme is defined by the quality of the information collected from the greenhouse environment. Therefore, Continuous monitoring of environmental variables such as temperature, humidity, and soil moisture gives information to the grower to better understand, how each factor affects growth and how to manage maximal crop productiveness. In this piper, we designed and implemented climate monitoring with irrigation control system based on Wireless Sensor Network (WSN) technology. The designed system is characterized with friendly to use, easy to install by any greenhouse user, multi-sensing nodes, multi-PAN ID, low cast, water irrigation control and low operation complexity. The system consists of two node types (sensing and control) with star topology on one PAN ID. Moreover, greenhouse manager can modifying system parameters such as (sensing node addresses, irrigation upper and lower control limits) by updating corresponding data in SDRAM memory. In addition, the designed system uses 2*16 characters. LCD to display the micro climate parameters values of each plants row inside the greenhouse.
Abstract: This paper presents an efficient burst error spreading tool. Also, it studies a vital issue in wireless communications, which is the transmission of images over wireless networks. IEEE ZigBee 802.15.4 is a short-range communication standard that could be used for small distance multimedia transmissions. In fact, the ZigBee network is a Wireless Personal Area Network (WPAN), which needs a strong interleaving mechanism for protection against error bursts. Also, it is low power technology and utilized in the Wireless Sensor Networks (WSN) implementation. This paper presents the chaotic interleaving scheme as a data randomization tool for this purpose. This scheme depends on the chaotic Baker map. The mobility effects on the image transmission are studied with different velocity through utilizing the Jakes’ model. A comparison study between the proposed chaotic interleaving scheme and the traditional block and convolutional interleaving schemes for image transmission over a correlated fading channel is presented. The simulation results show the superiority of the proposed chaotic interleaving scheme over the traditional schemes.
Abstract: Solar power plants(SPPs) have shown a lot of good outcomes
in providing a various functions depending on industrial expectations by
deploying ad-hoc networking with helps of light loaded and battery powered
sensor nodes. In particular, it is strongly requested to develop an algorithm to
deriver the sensing data from the end node of solar power plants to the sink node
on time. In this paper, based on the above observation we have proposed an
IEEE802.15.4 based self routing scheme for solar power plants. The proposed
beacon based priority routing Algorithm (BPRA) scheme utilizes beacon
periods in sending message with embedding the high priority data and thus
provides high quality of service(QoS) in the given criteria. The performance
measures are the packet Throughput, delivery, latency, total energy
consumption. Simulation results under TinyOS Simulator(TOSSIM) have
shown the proposed scheme outcome the conventional Ad hoc On-Demand
Distance Vector(AODV) Routing in solar power plants.
Abstract: In this work, we study the problem of determining
the minimum scheduling length that can satisfy end-to-end (ETE)
traffic demand in scheduling-based multihop WSNs with cooperative
multiple-input multiple-output (MIMO) transmission scheme. Specifically,
we present a cross-layer formulation for the joint routing,
scheduling and stream control problem by incorporating various
power and rate adaptation schemes, and taking into account an
antenna beam pattern model and the signal-to-interference-and-noise
(SINR) constraint at the receiver. In the context, we also propose
column generation (CG) solutions to get rid of the complexity
requiring the enumeration of all possible sets of scheduling links.
Abstract: As data to be stored in storage subsystems
tremendously increases, data protection techniques have become more
important than ever, to provide data availability and reliability. In this
paper, we present the file system-based data protection (WOWSnap)
that has been implemented using WORM (Write-Once-Read-Many)
scheme. In the WOWSnap, once WORM files have been created, only
the privileged read requests to them are allowed to protect data against
any intentional/accidental intrusions. Furthermore, all WORM files
are related to their protection cycle that is a time period during which
WORM files should securely be protected. Once their protection cycle
is expired, the WORM files are automatically moved to the
general-purpose data section without any user interference. This
prevents the WORM data section from being consumed by
unnecessary files. We evaluated the performance of WOWSnap on
Linux cluster.
Abstract: Optimum communication and performance in
Wireless Sensor Networks, constitute multi-facet challenges due to
the specific networking characteristics as well as the scarce resource
availability. Furthermore, it is becoming increasingly apparent that
isolated layer based approaches often do not meet the demands posed
by WSNs applications due to omission of critical inter-layer
interactions and dependencies. As a counterpart, cross-layer is
receiving high interest aiming to exploit these interactions and
increase network performance. However, in order to clearly identify
existing dependencies, comprehensive performance studies are
required evaluating the effect of different critical network parameters
on system level performance and behavior.This paper-s main
objective is to address the need for multi-parametric performance
evaluations considering critical network parameters using a well
known network simulator, offering useful and practical conclusions
and guidelines. The results reveal strong dependencies among
considered parameters which can be utilized by and drive future
research efforts, towards designing and implementing highly efficient
protocols and architectures.
Abstract: To reduce accidents in the industry, WSNs(Wireless Sensor
networks)- sensor data is used. WSNs- sensor data has the persistence and
continuity. therefore, we design and exploit the buffer management system that
has the persistence and continuity to avoid and delivery data conflicts. To
develop modules, we use the multi buffers and design the buffer management
modules that transfer sensor data through the context-aware methods.
Abstract: Wireless Sensor Network (WSN) comprises of sensor
nodes which are designed to sense the environment, transmit sensed
data back to the base station via multi-hop routing to reconstruct
physical phenomena. Since physical phenomena exists significant
overlaps between temporal redundancy and spatial redundancy, it is
necessary to use Redundancy Suppression Algorithms (RSA) for sensor
node to lower energy consumption by reducing the transmission
of redundancy. A conventional algorithm of RSAs is threshold-based
RSA, which sets threshold to suppress redundant data. Although
many temporal and spatial RSAs are proposed, temporal-spatial RSA
are seldom to be proposed because it is difficult to determine when
to utilize temporal or spatial RSAs. In this paper, we proposed a
novel temporal-spatial redundancy suppression algorithm, Codebookbase
Redundancy Suppression Mechanism (CRSM). CRSM adopts
vector quantization to generate a codebook, which is easily used to
implement temporal-spatial RSA. CRSM not only achieves power
saving and reliability for WSN, but also provides the predictability
of network lifetime. Simulation result shows that the network lifetime
of CRSM outperforms at least 23% of that of other RSAs.
Abstract: Wireless sensor networks (WSN) consists of many
sensor nodes that are placed on unattended environments such as
military sites in order to collect important information.
Implementing a secure protocol that can prevent forwarding forged
data and modifying content of aggregated data and has low delay
and overhead of communication, computing and storage is very
important. This paper presents a new protocol for concealed data
aggregation (CDA). In this protocol, the network is divided to
virtual cells, nodes within each cell produce a shared key to send
and receive of concealed data with each other. Considering to data
aggregation in each cell is locally and implementing a secure
authentication mechanism, data aggregation delay is very low and
producing false data in the network by malicious nodes is not
possible. To evaluate the performance of our proposed protocol, we
have presented computational models that show the performance
and low overhead in our protocol.
Abstract: Wireless sensor network has recently emerged as enablers
of several areas. Real applications of WSN are being explored
and some of them are yet to come. While the potential of sensor
networks has been only beginning to be realized, several challenges
still remain. One of them is the experimental evaluation of WSN.
Therefore, deploying and operating a testbed to study the real
behavior of WSN become more and more important. The main
contribution of this work is to analysis the RF link budget behavior
of wireless sensor networks in underground mine gallery.
Abstract: In order to guarantee secure communication for wireless sensor networks (WSNs), many user authentication schemes have successfully drawn researchers- attention and been studied widely. In 2012, He et al. proposed a robust biometric-based user authentication scheme for WSNs. However, this paper demonstrates that He et al.-s scheme has some drawbacks: poor reparability problem, user impersonation attack, and sensor node impersonate attack.
Abstract: The main goal of this seminal paper is to introduce the
application of Wireless Sensor Networks (WSN) in long distance
infrastructure monitoring (in particular in pipeline infrastructure
monitoring) – one of the on-going research projects by the Wireless
Communication Research Group at the department of Electronic and
Computer Engineering, Nnamdi Azikiwe University, Awka. The
current sensor network architectures for monitoring long distance
pipeline infrastructures are previewed. These are wired sensor
networks, RF wireless sensor networks, integrated wired and wireless
sensor networks. The reliability of these architectures is discussed.
Three reliability factors are used to compare the architectures in
terms of network connectivity, continuity of power supply for the
network, and the maintainability of the network. The constraints and
challenges of wireless sensor networks for monitoring and protecting
long distance pipeline infrastructure are discussed.
Abstract: In the past few years, the use of wireless sensor networks (WSNs) potentially increased in applications such as intrusion detection, forest fire detection, disaster management and battle field. Sensor nodes are generally battery operated low cost devices. The key challenge in the design and operation of WSNs is to prolong the network life time by reducing the energy consumption among sensor nodes. Node clustering is one of the most promising techniques for energy conservation. This paper presents a novel clustering algorithm which maximizes the network lifetime by reducing the number of communication among sensor nodes. This approach also includes new distributed cluster formation technique that enables self-organization of large number of nodes, algorithm for maintaining constant number of clusters by prior selection of cluster head and rotating the role of cluster head to evenly distribute the energy load among all sensor nodes.
Abstract: Wireless sensor networks is an emerging technology
that serves as environment monitors in many applications. Yet
these miniatures suffer from constrained resources in terms of
computation capabilities and energy resources. Limited energy
resource in these nodes demands an efficient consumption of that
resource either by developing the modules itself or by providing
an efficient communication protocols. This paper presents a
comprehensive summarization and a comparative study of the
available MAC protocols proposed for Wireless Sensor Networks
showing their capabilities and efficiency in terms of energy
consumption and delay guarantee.
Abstract: The important issue considered in the widespread deployment of Wireless Sensor Networks (WSNs) is an efficiency of the energy consumption. In this paper, we present a study of the optimal relay station planning problems using Binary Integer Linear Programming (BILP) model to minimize the energy consumption in WSNs. Our key contribution is that the proposed model not only ensures the required network lifetime but also guarantees the radio connectivity at high level of communication quality. Specially, we take into account effects of noise, signal quality limitation and bit error rate characteristics. Numerical experiments were conducted in various network scenarios. We analyzed the effects of different sensor node densities and distribution on the energy consumption.
Abstract: Sensor Network are emerging as a new tool for
important application in diverse fields like military surveillance,
habitat monitoring, weather, home electrical appliances and others.
Technically, sensor network nodes are limited in respect to energy
supply, computational capacity and communication bandwidth. In
order to prolong the lifetime of the sensor nodes, designing efficient
routing protocol is very critical. In this paper, we illustrate the
existing routing protocol for wireless sensor network using data
centric approach and present performance analysis of these protocols.
The paper focuses in the performance analysis of specific protocol
namely Directed Diffusion and SPIN. This analysis reveals that the
energy usage is important features which need to be taken into
consideration while designing routing protocol for wireless sensor
network.
Abstract: The issue of real-time and reliable report delivery is extremely important for taking effective decision in a real world mission critical Wireless Sensor Network (WSN) based application. The sensor data behaves differently in many ways from the data in traditional databases. WSNs need a mechanism to register, process queries, and disseminate data. In this paper we propose an architectural framework for data placement and management. We propose a reliable and real time approach for data placement and achieving data integrity using self organized sensor clusters. Instead of storing information in individual cluster heads as suggested in some protocols, in our architecture we suggest storing of information of all clusters within a cell in the corresponding base station. For data dissemination and action in the wireless sensor network we propose to use Action and Relay Stations (ARS). To reduce average energy dissipation of sensor nodes, the data is sent to the nearest ARS rather than base station. We have designed our architecture in such a way so as to achieve greater energy savings, enhanced availability and reliability.
Abstract: Wireless Sensor Networks can be used to monitor the
physical phenomenon in such areas where human approach is nearly
impossible. Hence the limited power supply is the major constraint of
the WSNs due to the use of non-rechargeable batteries in sensor
nodes. A lot of researches are going on to reduce the energy
consumption of sensor nodes. Energy map can be used with
clustering, data dissemination and routing techniques to reduce the
power consumption of WSNs. Energy map can also be used to know
which part of the network is going to fail in near future. In this paper,
Energy map is constructed using the prediction based approach.
Adaptive alpha GM(1,1) model is used as the prediction model.
GM(1,1) is being used worldwide in many applications for predicting
future values of time series using some past values due to its high
computational efficiency and accuracy.
Abstract: Wireless sensor networks (WSNs) have gained
tremendous attention in recent years due to their numerous
applications. Due to the limited energy resource, energy efficient
operation of sensor nodes is a key issue in wireless sensor networks.
Cooperative caching which ensures sharing of data among various
nodes reduces the number of communications over the wireless
channels and thus enhances the overall lifetime of a wireless sensor
network. In this paper, we propose a cooperative caching scheme
called ZCS (Zone Cooperation at Sensors) for wireless sensor
networks. In ZCS scheme, one-hop neighbors of a sensor node form a
cooperative cache zone and share the cached data with each other.
Simulation experiments show that the ZCS caching scheme achieves
significant improvements in byte hit ratio and average query latency
in comparison with other caching strategies.