Abstract: Many cluster based routing protocols have been
proposed in the field of wireless sensor networks, in which a group of
nodes are formed as clusters. A cluster head is selected from one
among those nodes based on residual energy, coverage area, number
of hops and that cluster-head will perform data gathering from
various sensor nodes and forwards aggregated data to the base station
or to a relay node (another cluster-head), which will forward the
packet along with its own data packet to the base station. Here a
Game Theory based Diligent Energy Utilization Algorithm (GTDEA)
for routing is proposed. In GTDEA, the cluster head selection is done
with the help of game theory, a decision making process, that selects
a cluster-head based on three parameters such as residual energy
(RE), Received Signal Strength Index (RSSI) and Packet Reception
Rate (PRR). Finding a feasible path to the destination with minimum
utilization of available energy improves the network lifetime and is
achieved by the proposed approach. In GTDEA, the packets are
forwarded to the base station using inter-cluster routing technique,
which will further forward it to the base station. Simulation results
reveal that GTDEA improves the network performance in terms of
throughput, lifetime, and power consumption.
Abstract: Although Mobile Wireless Sensor Networks (MWSNs),
which consist of mobile sensor nodes (MSNs), can cover a wide range
of observation region by using a small number of sensor nodes, they
need to construct a network to collect the sensing data on the base
station by moving the MSNs. As an effective method, the network
construction method based on Virtual Rails (VRs), which is referred
to as VR method, has been proposed. In this paper, we propose two
types of effective techniques for the VR method. They can prolong
the operation time of the network, which is limited by the battery
capabilities of MSNs and the energy consumption of MSNs. The
first technique, an effective arrangement of VRs, almost equalizes
the number of MSNs belonging to each VR. The second technique,
an adaptive movement method of MSNs, takes into account the
residual energy of battery. In the simulation, we demonstrate that each
technique can improve the network lifetime and the combination of
both techniques is the most effective.
Abstract: Small-size and low-power sensors with sensing, signal
processing and wireless communication capabilities is suitable for the
wireless sensor networks. Due to the limited resources and battery
constraints, complex routing algorithms used for the ad-hoc networks
cannot be employed in sensor networks. In this paper, we propose
node-disjoint multi-path hexagon-based routing algorithms in wireless
sensor networks. We suggest the details of the algorithm and compare
it with other works. Simulation results show that the proposed scheme
achieves better performance in terms of efficiency and message
delivery ratio.
Abstract: Wireless Sensor Networks (WSNs), which sense
environmental data with battery-powered nodes, require multi-hop
communication. This power-demanding task adds an extra workload
that is unfairly distributed across the network. As a result, nodes run
out of battery at different times: this requires an impractical
individual node maintenance scheme. Therefore we investigate a new
Cooperative Sensing approach that extends the WSN operational life
and allows a more practical network maintenance scheme (where all
nodes deplete their batteries almost at the same time). We propose a
novel cooperative algorithm that derives a piecewise representation
of the sensed signal while controlling approximation accuracy.
Simulations show that our algorithm increases WSN operational life
and spreads communication workload evenly. Results convey a
counterintuitive conclusion: distributing workload fairly amongst
nodes may not decrease the network power consumption and yet
extend the WSN operational life. This is achieved as our cooperative
approach decreases the workload of the most burdened cluster in the
network.
Abstract: The relationship dependence between RSS and distance
in an enclosed environment is an important consideration because it is
a factor that can influence the reliability of any localization algorithm
founded on RSS. Several algorithms effectively reduce the variance of
RSS to improve localization or accuracy performance. Our proposed
algorithm essentially avoids this pitfall and consequently, its high
adaptability in the face of erratic radio signal. Using 3 anchors in
close proximity of each other, we are able to establish that RSS can be
used as reliable indicator for localization with an acceptable degree of
accuracy. Inherent in this concept, is the ability for each prospective
anchor to validate (guarantee) the position or the proximity of the
other 2 anchors involved in the localization and vice versa. This
procedure ensures that the uncertainties of radio signals due to
multipath effects in enclosed environments are minimized. A major
driver of this idea is the implicit topological relationship among
sensors due to raw radio signal strength. The algorithm is an area
based algorithm; however, it does not trade accuracy for precision
(i.e the size of the returned area).
Abstract: The main issue in designing a wireless sensor network
(WSN) is the finding of a proper routing protocol that complies with
the several requirements of high reliability, short latency, scalability,
low power consumption, and many others. This paper proposes a
novel routing algorithm that complies with these design
requirements. The new routing protocol divides the WSN into several subnetworks
and each sub-network is divided into several clusters. This
division is designed to reduce the number of radio transmission and
hence decreases the power consumption. The network division may
be changed dynamically to adapt with the network changes and
allows the realization of the design requirements.
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: The Trustworthy link failure recovery algorithm is
introduced in this paper, to provide the forwarding continuity even
with compound link failures. The ephemeral failures are common in
IP networks and it also has some proposals based on local rerouting.
To ensure forwarding continuity, we are introducing the compound
link failure recovery algorithm, even with compound link failures.
For forwarding the information, each packet carries a blacklist, which
is a min set of failed links encountered along its path, and the next
hop is chosen by excluding the blacklisted links. Our proposed
method describes how it can be applied to ensure forwarding to all
reachable destinations in case of any two or more link or node
failures in the network. After simulating with NS2 contains lot of
samples proved that the proposed protocol achieves exceptional
concert even under elevated node mobility using Trustworthy link
Failure Recovery Algorithm.
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: In this study, data loss tolerance of Support Vector Machines (SVM) based activity recognition model and multi activity classification performance when data are received over a lossy wireless sensor network is examined. Initially, the classification algorithm we use is evaluated in terms of resilience to random data loss with 3D acceleration sensor data for sitting, lying, walking and standing actions. The results show that the proposed classification method can recognize these activities successfully despite high data loss. Secondly, the effect of differentiated quality of service performance on activity recognition success is measured with activity data acquired from a multi hop wireless sensor network, which introduces high data loss. The effect of number of nodes on the reliability and multi activity classification success is demonstrated in simulation environment. To the best of our knowledge, the effect of data loss in a wireless sensor network on activity detection success rate of an SVM based classification algorithm has not been studied before.
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: 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: 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: 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.