12,070 research outputs found
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
Near Optimal Broadcast with Network Coding in Large Sensor Networks
We study efficient broadcasting for wireless sensor networks, with network
coding. We address this issue for homogeneous sensor networks in the plane. Our
results are based on a simple principle (IREN/IRON), which sets the same rate
on most of the nodes (wireless links) of the network. With this rate selection,
we give a value of the maximum achievable broadcast rate of the source: our
central result is a proof of the value of the min-cut for such networks, viewed
as hypergraphs. Our metric for efficiency is the number of transmissions
necessary to transmit one packet from the source to every destination: we show
that IREN/IRON achieves near optimality for large networks; that is,
asymptotically, nearly every transmission brings new information from the
source to the receiver. As a consequence, network coding asymptotically
outperforms any scheme that does not use network coding.Comment: Dans First International Workshop on Information Theory for Sensor
Netwoks (WITS 2007) (2007
Recent Advances in Joint Wireless Energy and Information Transfer
In this paper, we provide an overview of the recent advances in
microwave-enabled wireless energy transfer (WET) technologies and their
applications in wireless communications. Specifically, we divide our
discussions into three parts. First, we introduce the state-of-the-art WET
technologies and the signal processing techniques to maximize the energy
transfer efficiency. Then, we discuss an interesting paradigm named
simultaneous wireless information and power transfer (SWIPT), where energy and
information are jointly transmitted using the same radio waveform. At last, we
review the recent progress in wireless powered communication networks (WPCN),
where wireless devices communicate using the power harvested by means of WET.
Extensions and future directions are also discussed in each of these areas.Comment: Conference submission accepted by ITW 201
Wireless Broadcast with Network Coding in Mobile Ad-Hoc Networks: DRAGONCAST
Network coding is a recently proposed method for transmitting data, which has
been shown to have potential to improve wireless network performance. We study
network coding for one specific case of multicast, broadcasting, from one
source to all nodes of the network. We use network coding as a loss tolerant,
energy-efficient, method for broadcast. Our emphasis is on mobile networks. Our
contribution is the proposal of DRAGONCAST, a protocol to perform network
coding in such a dynamically evolving environment. It is based on three
building blocks: a method to permit real-time decoding of network coding, a
method to adjust the network coding transmission rates, and a method for
ensuring the termination of the broadcast. The performance and behavior of the
method are explored experimentally by simulations; they illustrate the
excellent performance of the protocol
Energy Efficient Ant Colony Algorithms for Data Aggregation in Wireless Sensor Networks
In this paper, a family of ant colony algorithms called DAACA for data
aggregation has been presented which contains three phases: the initialization,
packet transmission and operations on pheromones. After initialization, each
node estimates the remaining energy and the amount of pheromones to compute the
probabilities used for dynamically selecting the next hop. After certain rounds
of transmissions, the pheromones adjustment is performed periodically, which
combines the advantages of both global and local pheromones adjustment for
evaporating or depositing pheromones. Four different pheromones adjustment
strategies are designed to achieve the global optimal network lifetime, namely
Basic-DAACA, ES-DAACA, MM-DAACA and ACS-DAACA. Compared with some other data
aggregation algorithms, DAACA shows higher superiority on average degree of
nodes, energy efficiency, prolonging the network lifetime, computation
complexity and success ratio of one hop transmission. At last we analyze the
characteristic of DAACA in the aspects of robustness, fault tolerance and
scalability.Comment: To appear in Journal of Computer and System Science
- …