1,323 research outputs found
Unified Capacity Limit of Non-coherent Wideband Fading Channels
In non-coherent wideband fading channels where energy rather than spectrum is
the limiting resource, peaky and non-peaky signaling schemes have long been
considered species apart, as the first approaches asymptotically the capacity
of a wideband AWGN channel with the same average SNR, whereas the second
reaches a peak rate at some finite critical bandwidth and then falls to zero as
bandwidth grows to infinity. In this paper it is shown that this distinction is
in fact an artifact of the limited attention paid in the past to the product
between the bandwidth and the fraction of time it is in use. This fundamental
quantity, called bandwidth occupancy, measures average bandwidth usage over
time. For all signaling schemes with the same bandwidth occupancy, achievable
rates approach to the wideband AWGN capacity within the same gap as the
bandwidth occupancy approaches its critical value, and decrease to zero as the
occupancy goes to infinity. This unified analysis produces quantitative
closed-form expressions for the ideal bandwidth occupancy, recovers the
existing capacity results for (non-)peaky signaling schemes, and unveils a
trade-off between the accuracy of approximating capacity with a generalized
Taylor polynomial and the accuracy with which the optimal bandwidth occupancy
can be bounded.Comment: Accepted for publication in IEEE Transactions on Wireless
Communications. Copyright may be transferred without notic
Cooperative localization by dual foot-mounted inertial sensors and inter-agent ranging
The implementation challenges of cooperative localization by dual
foot-mounted inertial sensors and inter-agent ranging are discussed and work on
the subject is reviewed. System architecture and sensor fusion are identified
as key challenges. A partially decentralized system architecture based on
step-wise inertial navigation and step-wise dead reckoning is presented. This
architecture is argued to reduce the computational cost and required
communication bandwidth by around two orders of magnitude while only giving
negligible information loss in comparison with a naive centralized
implementation. This makes a joint global state estimation feasible for up to a
platoon-sized group of agents. Furthermore, robust and low-cost sensor fusion
for the considered setup, based on state space transformation and
marginalization, is presented. The transformation and marginalization are used
to give the necessary flexibility for presented sampling based updates for the
inter-agent ranging and ranging free fusion of the two feet of an individual
agent. Finally, characteristics of the suggested implementation are
demonstrated with simulations and a real-time system implementation.Comment: 14 page
Key Generation in Wireless Sensor Networks Based on Frequency-selective Channels - Design, Implementation, and Analysis
Key management in wireless sensor networks faces several new challenges. The
scale, resource limitations, and new threats such as node capture necessitate
the use of an on-line key generation by the nodes themselves. However, the cost
of such schemes is high since their secrecy is based on computational
complexity. Recently, several research contributions justified that the
wireless channel itself can be used to generate information-theoretic secure
keys. By exchanging sampling messages during movement, a bit string can be
derived that is only known to the involved entities. Yet, movement is not the
only possibility to generate randomness. The channel response is also strongly
dependent on the frequency of the transmitted signal. In our work, we introduce
a protocol for key generation based on the frequency-selectivity of channel
fading. The practical advantage of this approach is that we do not require node
movement. Thus, the frequent case of a sensor network with static motes is
supported. Furthermore, the error correction property of the protocol mitigates
the effects of measurement errors and other temporal effects, giving rise to an
agreement rate of over 97%. We show the applicability of our protocol by
implementing it on MICAz motes, and evaluate its robustness and secrecy through
experiments and analysis.Comment: Submitted to IEEE Transactions on Dependable and Secure Computin
- …