50,586 research outputs found
An Energy Balanced Dynamic Topology Control Algorithm for Improved Network Lifetime
In wireless sensor networks, a few sensor nodes end up being vulnerable to
potentially rapid depletion of the battery reserves due to either their central
location or just the traffic patterns generated by the application. Traditional
energy management strategies, such as those which use topology control
algorithms, reduce the energy consumed at each node to the minimum necessary.
In this paper, we use a different approach that balances the energy consumption
at each of the nodes, thus increasing the functional lifetime of the network.
We propose a new distributed dynamic topology control algorithm called Energy
Balanced Topology Control (EBTC) which considers the actual energy consumed for
each transmission and reception to achieve the goal of an increased functional
lifetime. We analyze the algorithm's computational and communication complexity
and show that it is equivalent or lower in complexity to other dynamic topology
control algorithms. Using an empirical model of energy consumption, we show
that the EBTC algorithm increases the lifetime of a wireless sensor network by
over 40% compared to the best of previously known algorithms
Learning Autonomy in Management of Wireless Random Networks
This paper presents a machine learning strategy that tackles a distributed
optimization task in a wireless network with an arbitrary number of randomly
interconnected nodes. Individual nodes decide their optimal states with
distributed coordination among other nodes through randomly varying backhaul
links. This poses a technical challenge in distributed universal optimization
policy robust to a random topology of the wireless network, which has not been
properly addressed by conventional deep neural networks (DNNs) with rigid
structural configurations. We develop a flexible DNN formalism termed
distributed message-passing neural network (DMPNN) with forward and backward
computations independent of the network topology. A key enabler of this
approach is an iterative message-sharing strategy through arbitrarily connected
backhaul links. The DMPNN provides a convergent solution for iterative
coordination by learning numerous random backhaul interactions. The DMPNN is
investigated for various configurations of the power control in wireless
networks, and intensive numerical results prove its universality and viability
over conventional optimization and DNN approaches.Comment: to appear in IEEE TW
Design and analysis of distributed utility maximization algorithm for multihop wireless network with inaccurate feedback
Distributed network utility maximization (NUM) is receiving increasing interests for cross-layer optimization problems in multihop wireless networks. Traditional distributed NUM algorithms rely heavily on feedback information between different network elements, such as traffic sources and routers. Because of the distinct features of multihop wireless networks such as time-varying channels and dynamic network topology, the feedback information is usually inaccurate, which represents as a major obstacle for distributed NUM application to wireless networks. The questions to be answered include if distributed NUM algorithm can converge with inaccurate feedback and how to design effective distributed NUM algorithm for wireless networks. In this paper, we first use the infinitesimal perturbation analysis technique to provide an unbiased gradient estimation on the aggregate rate of traffic sources at the routers based on locally available information. On the basis of that, we propose a stochastic approximation algorithm to solve the distributed NUM problem with inaccurate feedback. We then prove that the proposed algorithm can converge to the optimum solution of distributed NUM with perfect feedback under certain conditions. The proposed algorithm is applied to the joint rate and media access control problem for wireless networks. Numerical results demonstrate the convergence of the proposed algorithm
Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-hop Networks
The topology of a wireless multi-hop network can be controlled by varying the
transmission power at each node. In this paper, we give a detailed analysis of
a cone-based distributed topology control algorithm. This algorithm, introduced
in [16], does not assume that nodes have GPS information available; rather it
depends only on directional information. Roughly speaking, the basic idea of
the algorithm is that a node transmits with the minimum power
required to ensure that in every cone of degree around
, there is some node that can reach with power . We show
that taking is a necessary and sufficient condition to
guarantee that network connectivity is preserved. More precisely, if there is a
path from to when every node communicates at maximum power, then, if
, there is still a path in the smallest symmetric graph
containing all edges such that can communicate with
using power . On the other hand, if ,
connectivity is not necessarily preserved. We also propose a set of
optimizations that further reduce power consumption and prove that they retain
network connectivity. Dynamic reconfiguration in the presence of failures and
mobility is also discussed. Simulation results are presented to demonstrate the
effectiveness of the algorithm and the optimizations.Comment: 10 page
Distributed Power Allocation for Sink-Centric Clusters in Multiple Sink Wireless Sensor Networks
Due to the battery resource constraints, saving energy is a critical issue in wireless sensor networks, particularly in large sensor networks. One possible solution is to deploy multiple sink nodes simultaneously. Another possible solution is to employ an adaptive clustering hierarchy routing scheme. In this paper, we propose a multiple sink cluster wireless sensor networks scheme which combines the two solutions, and propose an efficient transmission power control scheme for a sink-centric cluster routing protocol in multiple sink wireless sensor networks, denoted as MSCWSNs-PC. It is a distributed, scalable, self-organizing, adaptive system, and the sensor nodes do not require knowledge of the global network and their location. All sinks effectively work out a representative view of a monitored region, after which power control is employed to optimize network topology. The simulations demonstrate the advantages of our new protocol
Implementation of coverage problem in wireless sensor network based on unit Disk model
Wireless sensor networks (WSNs) have a wide range of applicability in many industrial and civilian applications such as industrial process monitoring and control, environment and habitat monitoring, machine health monitoring, home automation, health care applications, nuclear reactor control, fire detection, object tracking and traffic control. A WSN consists of spatially distributed autonomous sensors those cooperatively monitor the physical or environmental conditions including temperature, sound, vibration, motion, pressure or pollutants. In sensor networks where the environment is needed to be remotely monitored, the data from the individual sensor nodes is sent to a central base station (often located far from the network), through which the end-user can access data. The number of sensor nodes in a Wireless Sensor Network can vary in the range of hundreds to thousands. Such a network may have many challenges like low energy consumption, functional independence, efficient distributed algorithms, transmission routes, coverage, synchronization, topology control, robustness and fault tolerance, cost of maintaining the sensors and lifetime of the network
Adaptive Probabilistic Flooding for Multipath Routing
In this work, we develop a distributed source routing algorithm for topology
discovery suitable for ISP transport networks, that is however inspired by
opportunistic algorithms used in ad hoc wireless networks. We propose a
plug-and-play control plane, able to find multiple paths toward the same
destination, and introduce a novel algorithm, called adaptive probabilistic
flooding, to achieve this goal. By keeping a small amount of state in routers
taking part in the discovery process, our technique significantly limits the
amount of control messages exchanged with flooding -- and, at the same time, it
only minimally affects the quality of the discovered multiple path with respect
to the optimal solution. Simple analytical bounds, confirmed by results
gathered with extensive simulation on four realistic topologies, show our
approach to be of high practical interest.Comment: 6 pages, 6 figure
Linear Network Coding Based Fast Data Synchronization for Wireless Ad Hoc Networks with Controlled Topology
Fast data synchronization in wireless ad hoc networks is a challenging and
critical problem. It is fundamental for efficient information fusion, control
and decision in distributed systems. Previously, distributed data
synchronization was mainly studied in the latency-tolerant distributed
databases, or assuming the general model of wireless ad hoc networks. In this
paper, we propose a pair of linear network coding (NC) and all-to-all broadcast
based fast data synchronization algorithms for wireless ad hoc networks whose
topology is under operator's control. We consider both data block selection and
transmitting node selection for exploiting the benefits of NC. Instead of using
the store-and-forward protocol as in the conventional uncoded approach, a
compute-and-forward protocol is used in our scheme, which improves the
transmission efficiency. The performance of the proposed algorithms is studied
under different values of network size, network connection degree, and per-hop
packet error rate. Simulation results demonstrate that our algorithms
significantly reduce the times slots used for data synchronization compared
with the baseline that does not use NC.Comment: 9 pages, 9 figures, published on China Communications, vol. 19, no.
5, May 202
Using the PALS Architecture to Verify a Distributed Topology Control Protocol for Wireless Multi-Hop Networks in the Presence of Node Failures
The PALS architecture reduces distributed, real-time asynchronous system
design to the design of a synchronous system under reasonable requirements.
Assuming logical synchrony leads to fewer system behaviors and provides a
conceptually simpler paradigm for engineering purposes. One of the current
limitations of the framework is that from a set of independent "synchronous
machines", one must compose the entire synchronous system by hand, which is
tedious and error-prone. We use Maude's meta-level to automatically generate a
synchronous composition from user-provided component machines and a description
of how the machines communicate with each other. We then use the new
capabilities to verify the correctness of a distributed topology control
protocol for wireless networks in the presence of nodes that may fail.Comment: In Proceedings RTRTS 2010, arXiv:1009.398
- …