2,273 research outputs found
A Simple and Efficient Method to Mitigate the Hot Spot Problem in Wireless Sensor Networks
Much work on wireless sensor networks deals with or considers the hot
spot problem, i.e., the problem that the sensor nodes closest to the
base station are critical for the lifetime of the sensor network
because these nodes need to relay more packet than nodes further away
from the base station. Since it is often assumed that sensor nodes
will become inexpensive, a simple solution to the hot spot problem is
to place additional sensor nodes around the base stations. Using a
simple mathematical model we discuss the possible performance gains of
adding these supplementary nodes. Our results show that for certain
networks only a limited number of additional nodes are required to
fourfold network lifetime. We also show that the possible gain depends
heavily on the fraction of nodes already present in the vicinity of
the base station
A Resource Intensive Traffic-Aware Scheme for Cluster-based Energy Conservation in Wireless Devices
Wireless traffic that is destined for a certain device in a network, can be
exploited in order to minimize the availability and delay trade-offs, and
mitigate the Energy consumption. The Energy Conservation (EC) mechanism can be
node-centric by considering the traversed nodal traffic in order to prolong the
network lifetime. This work describes a quantitative traffic-based approach
where a clustered Sleep-Proxy mechanism takes place in order to enable each
node to sleep according to the time duration of the active traffic that each
node expects and experiences. Sleep-proxies within the clusters are created
according to pairwise active-time comparison, where each node expects during
the active periods, a requested traffic. For resource availability and recovery
purposes, the caching mechanism takes place in case where the node for which
the traffic is destined is not available. The proposed scheme uses Role-based
nodes which are assigned to manipulate the traffic in a cluster, through the
time-oriented backward difference traffic evaluation scheme. Simulation study
is carried out for the proposed backward estimation scheme and the
effectiveness of the end-to-end EC mechanism taking into account a number of
metrics and measures for the effects while incrementing the sleep time duration
under the proposed framework. Comparative simulation results show that the
proposed scheme could be applied to infrastructure-less systems, providing
energy-efficient resource exchange with significant minimization in the power
consumption of each device.Comment: 6 pages, 8 figures, To appear in the proceedings of IEEE 14th
International Conference on High Performance Computing and Communications
(HPCC-2012) of the Third International Workshop on Wireless Networks and
Multimedia (WNM-2012), 25-27 June 2012, Liverpool, U
A new QoS routing algorithm based on self-organizing maps for wireless sensor networks
For the past ten years, many authors have focused
their investigations in wireless sensor networks. Different
researching issues have been extensively developed: power
consumption, MAC protocols, self-organizing network algorithms,
data-aggregation schemes, routing protocols, QoS
management, etc. Due to the constraints on data processing
and power consumption, the use of artificial intelligence
has been historically discarded. However, in some special
scenarios the features of neural networks are appropriate to
develop complex tasks such as path discovery. In this paper,
we explore and compare the performance of two very well
known routing paradigms, directed diffusion and Energy-
Aware Routing, with our routing algorithm, named SIR,
which has the novelty of being based on the introduction of
neural networks in every sensor node. Extensive simulations
over our wireless sensor network simulator, OLIMPO, have
been carried out to study the efficiency of the introduction
of neural networks. A comparison of the results obtained
with every routing protocol is analyzed. This paper attempts
to encourage the use of artificial intelligence techniques in
wireless sensor nodes
Using artificial intelligence in routing schemes for wireless networks
For the latest 10 years, many authors have focused their investigations in wireless sensor networks. Different researching issues have
been extensively developed: power consumption, MAC protocols, self-organizing network algorithms, data-aggregation schemes, routing
protocols, QoS management, etc. Due to the constraints on data processing and power consumption, the use of artificial intelligence has
been historically discarded. However, in some special scenarios the features of neural networks are appropriate to develop complex tasks
such as path discovery. In this paper, we explore the performance of two very well-known routing paradigms, directed diffusion and
Energy-Aware Routing, and our routing algorithm, named SIR, which has the novelty of being based on the introduction of neural networks
in every sensor node. Extensive simulations over our wireless sensor network simulator, OLIMPO, have been carried out to study
the efficiency of the introduction of neural networks. A comparison of the results obtained with every routing protocol is analyzed. This
paper attempts to encourage the use of artificial intelligence techniques in wireless sensor nodes
Giving Neurons to Sensors: An Approach to QoS Management Through Artificial Intelligence in Wireless Networks
For the latest ten years, many authors have focused their investigations
in wireless sensor networks. Different researching issues have
been extensively developed: power consumption, MAC protocols, selforganizing
network algorithms, data-aggregation schemes, routing protocols,
QoS management, etc. Due to the constraints on data processing
and power consumption, the use of artificial intelligence has been historically
discarded. However, in some special scenarios the features of
neural networks are appropriate to develop complex tasks such as path
discovery. In this paper, we explore the performance of two very well
known routing paradigms, directed diffusion and Energy-Aware Routing,
and our routing algorithm, named SIR, which has the novelty of being
based on the introduction of neural networks in every sensor node. Extensive
simulations over our wireless sensor network simulator, OLIMPO,
have been carried out to study the efficiency of the introduction of neural
networks. A comparison of the results obtained with every routing protocol
is analyzed. This paper attempts to encourage the use of artificial
intelligence techniques in wireless sensor nodes
Using Artificial Intelligence in Wireless Sensor Routing Protocols
This paper represents a dissertation about how an artificial
intelligence technique can be applied to wireless sensor networks. Due
to the constraints on data processing and power consumption, the use
of artificial intelligence has been historically discarded in these kind of
networks. However, in some special scenarios the features of neural networks
are appropriate to develop complex tasks such as path discovery.
In this paper, we explore the performance of two very well known routing
paradigms, directed diffusion and Energy-Aware Routing, and our
routing algorithm, named SIR, which has the novelty of being based
on the introduction of neural networks in every sensor node. Extensive
simulations over our wireless sensor network simulator, OLIMPO, have
been carried out to study the efficiency of the introduction of neural networks.
A comparison of the results obtained with every routing protocol
is analyzed
GEAMS: a Greedy Energy-Aware Multipath Stream-based Routing Protocol for WMSNs
Because sensor nodes operate on power limited batteries, sensor
functionalities have to be designed carefully. In particular, designing
energy-efficient packet forwarding is important to maximize the lifetime of the
network and to minimize the power usage at each node. This paper presents a
Geographic Energy-Aware Multipath Stream-based (GEAMS) routing protocol for
WMSNs. GEAMS routing decisions are made online, at each forwarding node in such
a way that there is no need to global topology knowledge and maintenance. GEAMS
routing protocol performs load-balancing to minimize energy consumption among
nodes using twofold policy: (1) smart greedy forwarding and (2) walking back
forwarding. Performances evaluations of GEAMS show that it can maximize the
network lifetime and guarantee quality of service for video stream transmission
in WMSNs
Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks
We consider massively dense ad hoc networks and study their continuum limits
as the node density increases and as the graph providing the available routes
becomes a continuous area with location and congestion dependent costs. We
study both the global optimal solution as well as the non-cooperative routing
problem among a large population of users where each user seeks a path from its
origin to its destination so as to minimize its individual cost. Finally, we
seek for a (continuum version of the) Wardrop equilibrium. We first show how to
derive meaningful cost models as a function of the scaling properties of the
capacity of the network and of the density of nodes. We present various
solution methodologies for the problem: (1) the viscosity solution of the
Hamilton-Jacobi-Bellman equation, for the global optimization problem, (2) a
method based on Green's Theorem for the least cost problem of an individual,
and (3) a solution of the Wardrop equilibrium problem using a transformation
into an equivalent global optimization problem
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
- …