23,181 research outputs found
Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks
In this paper, we investigate the transmission range assignment for N
wireless nodes located on a line (a linear wireless network) for broadcasting
data from one specific node to all the nodes in the network with minimum
energy. Our goal is to find a solution that has low complexity and yet performs
close to optimal. We propose an algorithm for finding the optimal assignment
(which results in the minimum energy consumption) with complexity O(N^2). An
approximation algorithm with complexity O(N) is also proposed. It is shown
that, for networks with uniformly distributed nodes, the linear-time
approximate solution obtained by this algorithm on average performs practically
identical to the optimal assignment. Both the optimal and the suboptimal
algorithms require the full knowledge of the network topology and are thus
centralized. We also propose a distributed algorithm of negligible complexity,
i.e., with complexity O(1), which only requires the knowledge of the adjacent
neighbors at each wireless node. Our simulations demonstrate that the
distributed solution on average performs almost as good as the optimal one for
networks with uniformly distributed nodes.Comment: 17 page
Recommended from our members
Distributed video coding in wireless multimedia sensor network for multimedia broadcasting
Recently the development of Distributed Video Coding (DVC) has provided the promising theory
support to realize the infrastructure of Wireless Multimedia Sensor Network (WMSN), which composed of autonomous hardware for capturing and transmission of quality audio-visual content. The implementation of DVC in WMSN can better solve the problem of energy constraint of the sensor nodes due to the benefit of lower computational encoder in DVC. In this paper, a practical DVC scheme, pixel-domain Wyner-Ziv(PDWZ) video
coding, with slice structure and adaptive rate selection(ARS) is proposed to solve the certain problems when applying DVC into WMSN. Firstly, the proposed slice structure in PDWZ has extended the feasibility of PDWZ to work with any interleaver size used in Slepian-wolf turbo codec for heterogeneous applications. Meanwhile,
based on the slice structure, an adaptive code rate selection has been proposed aiming at reduce the system delay occurred in feedback request. The simulation results clearly showed the enhancement in R-D performance and perceptual quality. It also can be observed that system delay caused by frequent feedback is greatly reduced, which gives a promising support for WMSN with low latency and facilitates the QoS management
Heuristics for Network Coding in Wireless Networks
Multicast is a central challenge for emerging multi-hop wireless
architectures such as wireless mesh networks, because of its substantial cost
in terms of bandwidth. In this report, we study one specific case of multicast:
broadcasting, sending data from one source to all nodes, in a multi-hop
wireless network. The broadcast we focus on is based on network coding, a
promising avenue for reducing cost; previous work of ours showed that the
performance of network coding with simple heuristics is asymptotically optimal:
each transmission is beneficial to nearly every receiver. This is for
homogenous and large networks of the plan. But for small, sparse or for
inhomogeneous networks, some additional heuristics are required. This report
proposes such additional new heuristics (for selecting rates) for broadcasting
with network coding. Our heuristics are intended to use only simple local
topology information. We detail the logic of the heuristics, and with
experimental results, we illustrate the behavior of the heuristics, and
demonstrate their excellent performance
Data Dissemination Performance in Large-Scale Sensor Networks
As the use of wireless sensor networks increases, the need for
(energy-)efficient and reliable broadcasting algorithms grows. Ideally, a
broadcasting algorithm should have the ability to quickly disseminate data,
while keeping the number of transmissions low. In this paper we develop a model
describing the message count in large-scale wireless sensor networks. We focus
our attention on the popular Trickle algorithm, which has been proposed as a
suitable communication protocol for code maintenance and propagation in
wireless sensor networks. Besides providing a mathematical analysis of the
algorithm, we propose a generalized version of Trickle, with an additional
parameter defining the length of a listen-only period. This generalization
proves to be useful for optimizing the design and usage of the algorithm. For
single-cell networks we show how the message count increases with the size of
the network and how this depends on the Trickle parameters. Furthermore, we
derive distributions of inter-broadcasting times and investigate their
asymptotic behavior. Our results prove conjectures made in the literature
concerning the effect of a listen-only period. Additionally, we develop an
approximation for the expected number of transmissions in multi-cell networks.
All results are validated by simulations
Message and time efficient multi-broadcast schemes
We consider message and time efficient broadcasting and multi-broadcasting in
wireless ad-hoc networks, where a subset of nodes, each with a unique rumor,
wish to broadcast their rumors to all destinations while minimizing the total
number of transmissions and total time until all rumors arrive to their
destination. Under centralized settings, we introduce a novel approximation
algorithm that provides almost optimal results with respect to the number of
transmissions and total time, separately. Later on, we show how to efficiently
implement this algorithm under distributed settings, where the nodes have only
local information about their surroundings. In addition, we show multiple
approximation techniques based on the network collision detection capabilities
and explain how to calibrate the algorithms' parameters to produce optimal
results for time and messages.Comment: In Proceedings FOMC 2013, arXiv:1310.459
- …