5,902 research outputs found
Coverage Protocols for Wireless Sensor Networks: Review and Future Directions
The coverage problem in wireless sensor networks (WSNs) can be generally
defined as a measure of how effectively a network field is monitored by its
sensor nodes. This problem has attracted a lot of interest over the years and
as a result, many coverage protocols were proposed. In this survey, we first
propose a taxonomy for classifying coverage protocols in WSNs. Then, we
classify the coverage protocols into three categories (i.e. coverage aware
deployment protocols, sleep scheduling protocols for flat networks, and
cluster-based sleep scheduling protocols) based on the network stage where the
coverage is optimized. For each category, relevant protocols are thoroughly
reviewed and classified based on the adopted coverage techniques. Finally, we
discuss open issues (and recommend future directions to resolve them)
associated with the design of realistic coverage protocols. Issues such as
realistic sensing models, realistic energy consumption models, realistic
connectivity models and sensor localization are covered
Multihop clustering algorithm for load balancing in wireless sensor networks
The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach
Multihop clustering algorithm for load balancing in wireless sensor networks
The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach
AM-DisCNT: Angular Multi-hop DIStance based Circular Network Transmission Protocol for WSNs
The nodes in wireless sensor networks (WSNs) contain limited energy
resources, which are needed to transmit data to base station (BS). Routing
protocols are designed to reduce the energy consumption. Clustering algorithms
are best in this aspect. Such clustering algorithms increase the stability and
lifetime of the network. However, every routing protocol is not suitable for
heterogeneous environments. AM-DisCNT is proposed and evaluated as a new energy
efficient protocol for wireless sensor networks. AM-DisCNT uses circular
deployment for even consumption of energy in entire wireless sensor network.
Cluster-head selection is on the basis of energy. Highest energy node becomes
CH for that round. Energy is again compared in the next round to check the
highest energy node of that round. The simulation results show that AM-DisCNT
performs better than the existing heterogeneous protocols on the basis of
network lifetime, throughput and stability of the system.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
Improving energy efficiency in wireless sensor networks through scheduling and routing
This paper is about the wireless sensor network in environmental monitoring
applications. A Wireless Sensor Network consists of many sensor nodes and a
base station. The number and type of sensor nodes and the design protocols for
any wireless sensor network is application specific. The sensor data in this
application may be light intensity, temperature, pressure, humidity and their
variations .Clustering and routing are the two areas which are given more
attention in this paper.Comment: 7 Pages, 2 Figures and 1 Tabl
A Robust Zero-Calibration RF-based Localization System for Realistic Environments
Due to the noisy indoor radio propagation channel, Radio Frequency (RF)-based
location determination systems usually require a tedious calibration phase to
construct an RF fingerprint of the area of interest. This fingerprint varies
with the used mobile device, changes of the transmit power of smart access
points (APs), and dynamic changes in the environment; requiring re-calibration
of the area of interest; which reduces the technology ease of use. In this
paper, we present IncVoronoi: a novel system that can provide zero-calibration
accurate RF-based indoor localization that works in realistic environments. The
basic idea is that the relative relation between the received signal strength
from two APs at a certain location reflects the relative distance from this
location to the respective APs. Building on this, IncVoronoi incrementally
reduces the user ambiguity region based on refining the Voronoi tessellation of
the area of interest. IncVoronoi also includes a number of modules to
efficiently run in realtime as well as to handle practical deployment issues
including the noisy wireless environment, obstacles in the environment,
heterogeneous devices hardware, and smart APs. We have deployed IncVoronoi on
different Android phones using the iBeacons technology in a university campus.
Evaluation of IncVoronoi with a side-by-side comparison with traditional
fingerprinting techniques shows that it can achieve a consistent median
accuracy of 2.8m under different scenarios with a low beacon density of one
beacon every 44m2. Compared to fingerprinting techniques, whose accuracy
degrades by at least 156%, this accuracy comes with no training overhead and is
robust to the different user devices, different transmit powers, and over
temporal changes in the environment. This highlights the promise of IncVoronoi
as a next generation indoor localization system.Comment: 9 pages, 13 figures, published in SECON 201
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Future wireless networks have a substantial potential in terms of supporting
a broad range of complex compelling applications both in military and civilian
fields, where the users are able to enjoy high-rate, low-latency, low-cost and
reliable information services. Achieving this ambitious goal requires new radio
techniques for adaptive learning and intelligent decision making because of the
complex heterogeneous nature of the network structures and wireless services.
Machine learning (ML) algorithms have great success in supporting big data
analytics, efficient parameter estimation and interactive decision making.
Hence, in this article, we review the thirty-year history of ML by elaborating
on supervised learning, unsupervised learning, reinforcement learning and deep
learning. Furthermore, we investigate their employment in the compelling
applications of wireless networks, including heterogeneous networks (HetNets),
cognitive radios (CR), Internet of things (IoT), machine to machine networks
(M2M), and so on. This article aims for assisting the readers in clarifying the
motivation and methodology of the various ML algorithms, so as to invoke them
for hitherto unexplored services as well as scenarios of future wireless
networks.Comment: 46 pages, 22 fig
Secure Clustering in DSN with Key Predistribution and WCDS
This paper proposes an efficient approach of secure clustering in distributed
sensor networks. The clusters or groups in the network are formed based on
offline rank assignment and predistribution of secret keys. Our approach uses
the concept of weakly connected dominating set (WCDS) to reduce the number of
cluster-heads in the network. The formation of clusters in the network is
secured as the secret keys are distributed and used in an efficient way to
resist the inclusion of any hostile entity in the clusters. Along with the
description of our approach, we present an analysis and comparison of our
approach with other schemes. We also mention the limitations of our approach
considering the practical implementation of the sensor networks.Comment: 6 page
- โฆ