Abstract: The localization information is crucial for the
operation of WSN. There are principally two types of localization
algorithms. The Range-based localization algorithm has strict
requirements on hardware, thus is expensive to be implemented in
practice. The Range-free localization algorithm reduces the hardware
cost. However, it can only achieve high accuracy in ideal scenarios.
In this paper, we locate unknown nodes by incorporating the
advantages of these two types of methods. The proposed algorithm
makes the unknown nodes select the nearest anchor using the
Received Signal Strength Indicator (RSSI) and choose two other
anchors which are the most accurate to achieve the estimated
location. Our algorithm improves the localization accuracy compared
with previous algorithms, which has been demonstrated by the
simulating results.
Abstract: This research presents the main ideas to implement an
intelligent system composed by communicating wireless sensors
measuring environmental data linked to drought indicators (such as
air temperature, soil moisture , etc...). On the other hand, the setting
up of a spatio temporal database communicating with a Web mapping
application for a monitoring in real time in activity 24:00 /day, 7
days/week is proposed to allow the screening of the drought
parameters time evolution and their extraction. Thus this system
helps detecting surfaces touched by the phenomenon of drought.
Spatio-temporal conceptual models seek to answer the users who
need to manage soil water content for irrigating or fertilizing or other
activities pursuing crop yield augmentation. Effectively, spatiotemporal
conceptual models enable users to obtain a diagram of
readable and easy data to apprehend. Based on socio-economic
information, it helps identifying people impacted by the phenomena
with the corresponding severity especially that this information is
accessible by farmers and stakeholders themselves. The study will be
applied in Siliana watershed Northern Tunisia.
Abstract: Localization of nodes is one of the key issues of
Wireless Sensor Network (WSN) that gained a wide attention in
recent years. The existing localization techniques can be generally
categorized into two types: range-based and range-free. Compared
with rang-based schemes, the range-free schemes are more costeffective,
because no additional ranging devices are needed. As a
result, we focus our research on the range-free schemes. In this paper
we study three types of range-free location algorithms to compare the
localization error and energy consumption of each one. Centroid
algorithm requires a normal node has at least three neighbor anchors,
while DV-hop algorithm doesn’t have this requirement. The third
studied algorithm is the amorphous algorithm similar to DV-Hop
algorithm, and the idea is to calculate the hop distance between two
nodes instead of the linear distance between them. The simulation
results show that the localization accuracy of the amorphous
algorithm is higher than that of other algorithms and the energy
consumption does not increase too much.
Abstract: Wireless Sensor Networks (WSNs) enable new
applications and need non-conventional paradigms for the protocol
because of energy and bandwidth constraints, In WSN, sensor node’s
life is a critical parameter. Research on life extension is based on
Low-Energy Adaptive Clustering Hierarchy (LEACH) scheme,
which rotates Cluster Head (CH) among sensor nodes to distribute
energy consumption over all network nodes. CH selection in WSN
affects network energy efficiency greatly. This study proposes an
improved CH selection for efficient data aggregation in sensor
networks. This new algorithm is based on Bacterial Foraging
Optimization (BFO) incorporated in LEACH.
Abstract: Based on application requirements, nodes are static or
mobile in Wireless Sensor Networks (WSNs). Mobility poses
challenges in protocol design, especially at the link layer requiring
mobility adaptation algorithms to localize mobile nodes and predict
link quality to be established with them. This study implements
XMAC and Berkeley Media Access Control (BMAC) routing
protocols to evaluate performance under WSN’s static and mobility
conditions. This paper gives a comparative study of mobility-aware
MAC protocols. Routing protocol performance, based on Average
End to End Delay, Average Packet Delivery Ratio, Average Number
of hops, and Jitter is evaluated.
Abstract: The lifetime of a wireless sensor network can be
effectively increased by using scheduling operations. Once the
sensors are randomly deployed, the task at hand is to find the largest
number of disjoint sets of sensors such that every sensor set provides
complete coverage of the target area. At any instant, only one of these
disjoint sets is switched on, while all other are switched off. This
paper proposes a heuristic search method to find the maximum
number of disjoint sets that completely cover the region. A
population of randomly initialized members is made to explore the
solution space. A set of heuristics has been applied to guide the
members to a possible solution in their neighborhood. The heuristics
escalate the convergence of the algorithm. The best solution explored
by the population is recorded and is continuously updated. The
proposed algorithm has been tested for applications which require
sensing of multiple target points, referred to as point coverage
applications. Results show that the proposed algorithm outclasses the
existing algorithms. It always finds the optimum solution, and that
too by making fewer number of fitness function evaluations than the
existing approaches.
Abstract: Designing cost-efficient, secure network protocols for
Wireless Sensor Networks (WSNs) is a challenging problem because
sensors are resource-limited wireless devices. Security services such
as authentication and improved pairwise key establishment are
critical to high efficient networks with sensor nodes. For sensor
nodes to correspond securely with each other efficiently, usage of
cryptographic techniques is necessary. In this paper, two key
predistribution schemes that enable a mobile sink to establish a
secure data-communication link, on the fly, with any sensor nodes.
The intermediate nodes along the path to the sink are able to verify
the authenticity and integrity of the incoming packets using a
predicted value of the key generated by the sender’s essential power.
The proposed schemes are based on the pairwise key with the mobile
sink, our analytical results clearly show that our schemes perform
better in terms of network resilience to node capture than existing
schemes if used in wireless sensor networks with mobile sinks.
Abstract: A sensory network consists of multiple detection
locations called sensor nodes, each of which is tiny, featherweight
and portable. A single path routing protocols in wireless sensor
network can lead to holes in the network, since only the nodes
present in the single path is used for the data transmission. Apart
from the advantages like reduced computation, complexity and
resource utilization, there are some drawbacks like throughput,
increased traffic load and delay in data delivery. Therefore, multipath
routing protocols are preferred for WSN. Distributing the traffic
among multiple paths increases the network lifetime. We propose a
scheme, for the data to be transmitted through a dominant path to
save energy. In order to obtain a high delivery ratio, a basic route
reconstruction protocol is utilized to reconstruct the path whenever a
failure is detected. A basic reconstruction routing (BRR) algorithm is
proposed, in which a node can leap over path failure by using the
already existing routing information from its neighbourhood while
the composed data is transmitted from the source to the sink. In order
to save the energy and attain high data delivery ratio, data is
transmitted along a multiple path, which is achieved by BRR
algorithm whenever a failure is detected. Further, the analysis of
how the proposed protocol overcomes the drawback of the existing
protocols is presented. The performance of our protocol is compared
to AOMDV and energy efficient node-disjoint multipath routing
protocol (EENDMRP). The system is implemented using NS-2.34.
The simulation results show that the proposed protocol has high
delivery ratio with low energy consumption.
Abstract: In this research article of modeling Underwater
Wireless Sensor Network Simulators, we provide a comprehensive
overview of the various currently available simulators used in UWSN
modeling. In this work, we compare their working environment,
software platform, simulation language, key features, limitations and
corresponding applications. Based on extensive experimentation and
performance analysis, we provide their efficiency for specific
applications. We have also provided guidelines for developing
protocols in different layers of the protocol stack, and finally these
parameters are also compared and tabulated. This analysis is
significant for researchers and designers to find the right simulator
for their research activities.
Abstract: Wireless Sensor Networks (WSNs) have wide variety
of applications and provide limitless future potentials. Nodes in
WSNs are prone to failure due to energy depletion, hardware failure,
communication link errors, malicious attacks, and so on. Therefore,
fault tolerance is one of the critical issues in WSNs. We study how
fault tolerance is addressed in different applications of WSNs. Fault
tolerant routing is a critical task for sensor networks operating in
dynamic environments. Many routing, power management, and data
dissemination protocols have been specifically designed for WSNs
where energy awareness is an essential design issue. The focus,
however, has been given to the routing protocols which might differ
depending on the application and network architecture.
Abstract: Many wireless sensor network applications require
K-coverage of the monitored area. In this paper, we propose a
scalable harmony search based algorithm in terms of execution
time, K-Coverage Enhancement Algorithm (KCEA), it attempts to
enhance initial coverage, and achieve the required K-coverage degree
for a specific application efficiently. Simulation results show that
the proposed algorithm achieves coverage improvement of 5.34%
compared to K-Coverage Rate Deployment (K-CRD), which achieves
1.31% when deploying one additional sensor. Moreover, the proposed
algorithm is more time efficient.
Abstract: Underwater acoustic network is one of the rapidly
growing areas of research and finds different applications for
monitoring and collecting various data for environmental studies. The
communication among dynamic nodes and high error probability in
an acoustic medium forced to maximize energy consumption in
Underwater Sensor Networks (USN) than in traditional sensor
networks. Developing energy-efficient routing protocol is the
fundamental and a curb challenge because all the sensor nodes are
powered by batteries, and they cannot be easily replaced in UWSNs.
This paper surveys the various recent routing techniques that mainly
focus on energy efficiency.
Abstract: Wireless sensor network (WSN) is a network of many interconnected networked systems, they equipped with energy resources and they are used to detect other physical characteristics. On WSN, there are many researches are performed in past decades. WSN applicable in many security systems govern by military and in many civilian related applications. Thus, the security of WSN gets attention of researchers and gives an opportunity for many future aspects. Still, there are many other issues are related to deployment and overall coverage, scalability, size, energy efficiency, quality of service (QoS), computational power and many more. In this paper we discus about various applications and security related issue and requirements of WSN.
Abstract: Wireless sensor network is vulnerable to a wide range
of attacks. Recover secrecy after compromise, to develop technique
that can detect intrusions and able to resilient networks that isolates
the point(s) of intrusion while maintaining network connectivity for
other legitimate users. To define new security metrics to evaluate
collaborative intrusion resilience protocol, by leveraging the sensor
mobility that allows compromised sensors to recover secure state
after compromise. This is obtained with very low overhead and in a
fully distributed fashion using extensive simulations support our
findings.
Abstract: The Quad Tree Decomposition based performance
analysis of compressed image data communication for lossy and
lossless through wireless sensor network is presented. Images have
considerably higher storage requirement than text. While transmitting
a multimedia content there is chance of the packets being dropped
due to noise and interference. At the receiver end the packets that
carry valuable information might be damaged or lost due to noise,
interference and congestion. In order to avoid the valuable
information from being dropped various retransmission schemes have
been proposed. In this proposed scheme QTD is used. QTD is an
image segmentation method that divides the image into homogeneous
areas. In this proposed scheme involves analysis of parameters such
as compression ratio, peak signal to noise ratio, mean square error,
bits per pixel in compressed image and analysis of difficulties during
data packet communication in Wireless Sensor Networks. By
considering the above, this paper is to use the QTD to improve the
compression ratio as well as visual quality and the algorithm in
MATLAB 7.1 and NS2 Simulator software tool.
Abstract: Recent advances in wireless networking technologies
introduce several energy aware routing protocols in sensor networks.
Such protocols aim to extend the lifetime of network by reducing the
energy consumption of nodes. Many researchers are looking for
certain challenges that are predominant in the grounds of energy
consumption. One such protocol that addresses this energy
consumption issue is ‘Cluster based hierarchical routing protocol’. In
this paper, we intend to discuss some of the major hierarchical
routing protocols adhering towards sensor networks. Furthermore, we
examine and compare several aspects and characteristics of few
widely explored hierarchical clustering protocols, and its operations
in wireless sensor networks (WSN). This paper also presents a
discussion on the future research topics and the challenges of
hierarchical clustering in WSNs.
Abstract: A wireless sensor network (WSN) is a collection of
sensor nodes organized into a cooperative network. These nodes
communicate through a wireless antenna. Reduction in physical size
and multiband operation is an important requirement of WSN
antenna. Fractal antenna is used for miniaturization and multiband
operation. The self-similar or self-affine and space filling property of
fractal geometry increases the effective electrical length of the
antenna, reduces the size and make them frequency independent. This
paper elaborates on Dual band fractal antenna with Coplanar
Waveguide (CPW) feed for WSN. The proposed antenna is designed
on a FR4 substrate with the dimension of 27mm x 28.5mm x 1.6mm,
resonates at 2.4GHz and 5.2GHz with a return loss less than -10dB.
The design and simulation process is carried out using IE3D
simulation software. The simulated and measured results are found in
good agreement.
Abstract: Traditional Wireless Sensor Networks (WSNs) generally use static sinks to collect data from the sensor nodes via multiple forwarding. Therefore, network suffers with some problems like long message relay time, bottle neck problem which reduces the performance of the network.
Many approaches have been proposed to prevent this problem with the help of mobile sink to collect the data from the sensor nodes, but these approaches still suffer from the buffer overflow problem due to limited memory size of sensor nodes. This paper proposes an energy efficient scheme for data gathering which overcomes the buffer overflow problem. The proposed scheme creates virtual grid structure of heterogeneous nodes. Scheme has been designed for sensor nodes having variable sensing rate. Every node finds out its buffer overflow time and on the basis of this cluster heads are elected. A controlled traversing approach is used by the proposed scheme in order to transmit data to sink. The effectiveness of the proposed scheme is verified by simulation.
Abstract: Indoor wireless localization systems have played an
important role to enhance context-aware services. Determining the
position of mobile objects in complex indoor environments, such as
those in multi-floor buildings, is very challenging problems. This
paper presents an effective floor estimation algorithm, which can
accurately determine the floor where mobile objects located. The
proposed algorithm is based on the confidence interval of the
summation of online Received Signal Strength (RSS) obtained from
the IEEE 802.15.4 Wireless Sensor Networks (WSN).We compare
the performance of the proposed algorithm with those of other floor
estimation algorithms in literature by conducting a real
implementation of WSN in our facility. The experimental results and
analysis showed that the proposed floor estimation algorithm
outperformed the other algorithms and provided highest percentage
of floor accuracy up to 100% with 95-percent confidence interval.
Abstract: This paper designs an intelligent guidance system, based on wireless sensor networks, for efficient parking in parking lots. The proposed system consists of a parking space allocation subsystem, a parking space monitoring subsystem, a driving guidance subsystem, and a vehicle detection subsystem. In the system, we propose a novel and effective virtual coordinate system for sensing and displaying devices to determine the proper vacant parking space and provide the precise guidance to the driver. This study constructs a ZigBee-based wireless sensor network on Arduino platform and implements the prototype of the proposed system using Arduino-based complements. Experimental results confirm that the proposed prototype can not only work well, but also provide drivers the correct parking information.