1,033 research outputs found
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
Topology Control in Heterogeneous Wireless Networks: Problems and Solutions
Previous work on topology control usually assumes homogeneous wireless nodes with uniform transmission ranges. In this paper, we propose two localized topology control algorithms for heterogeneous wireless multi-hop networks with nonuniform transmission ranges: Directed Relative Neighborhood Graph (DRNG) and Directed Local Spanning Subgraph (DLSS). In both algorithms, each node selects a set of neighbors based on the locally collected information. We prove that (1) the topologies derived under DRNG and DLSS preserve the network connectivity; (2) the out degree of any node in the resulting topology by DLSS is bounded, while the out degree cannot be bounded in DRNG; and (3) the topologies generated by DRNG and DLSS preserve the network bi-directionality
A Scale-Free Topology Construction Model for Wireless Sensor Networks
A local-area and energy-efficient (LAEE) evolution model for wireless sensor
networks is proposed. The process of topology evolution is divided into two
phases. In the first phase, nodes are distributed randomly in a fixed region.
In the second phase, according to the spatial structure of wireless sensor
networks, topology evolution starts from the sink, grows with an
energy-efficient preferential attachment rule in the new node's local-area, and
stops until all nodes are connected into network. Both analysis and simulation
results show that the degree distribution of LAEE follows the power law. This
topology construction model has better tolerance against energy depletion or
random failure than other non-scale-free WSN topologies.Comment: 13pages, 3 figure
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
Topology Control Algorithm considering Antenna Radiation Pattern in Three-Dimensional Wireless Sensor Networks
Topology control is a key issue of wireless sensor network to reduce energy consumption and communication collision. Topology control algorithms in three-dimensional space have been proposed by modifying existing two-dimensional algorithms. These algorithms are based on the theoretical assumption that transmission power is radiated equally to the all directions by using isotropic antenna model. However, isotropic antenna does not exist, which is hypothetical antenna to compare the real antenna performance. In the real network, dipole antenna is applied, and because of the radiation pattern, performance of topology control algorithm is degraded. We proposed local remapping algorithm to solve the problem and applied it to existing topology control algorithms. Simulation results show that our algorithm increases performance of existing algorithms and reduces power consumption
A Systematic Approach to Constructing Families of Incremental Topology Control Algorithms Using Graph Transformation
In the communication systems domain, constructing and maintaining network
topologies via topology control (TC) algorithms is an important cross-cutting
research area. Network topologies are usually modeled using attributed graphs
whose nodes and edges represent the network nodes and their interconnecting
links. A key requirement of TC algorithms is to fulfill certain consistency and
optimization properties to ensure a high quality of service. Still, few
attempts have been made to constructively integrate these properties into the
development process of TC algorithms. Furthermore, even though many TC
algorithms share substantial parts (such as structural patterns or tie-breaking
strategies), few works constructively leverage these commonalities and
differences of TC algorithms systematically. In previous work, we addressed the
constructive integration of consistency properties into the development
process. We outlined a constructive, model-driven methodology for designing
individual TC algorithms. Valid and high-quality topologies are characterized
using declarative graph constraints; TC algorithms are specified using
programmed graph transformation. We applied a well-known static analysis
technique to refine a given TC algorithm in a way that the resulting algorithm
preserves the specified graph constraints.
In this paper, we extend our constructive methodology by generalizing it to
support the specification of families of TC algorithms. To show the feasibility
of our approach, we reneging six existing TC algorithms and develop e-kTC, a
novel energy-efficient variant of the TC algorithm kTC. Finally, we evaluate a
subset of the specified TC algorithms using a new tool integration of the graph
transformation tool eMoflon and the Simonstrator network simulation framework.Comment: Corresponds to the accepted manuscrip
- …