Recently, Distributed Hash Tables (DHT) explicitly designed for the use in MANETs have been proposed. Thus, many DHT-based distributed network applications from the domain of the Internet can be expected to be efficiently ported to MANETs. While the exact key lookups provided by such DHTs might be sufficient for many applications, range queries are often a desirable feature in wireless ad hoc networks (e.g. in sensor networks). However, the implementation of range queries using DHTs is a non-trivial task.In this paper we present a straight-forward implementation of Distributed Segment Trees as proposed in  on top of MADPastry  to provide DHT-based range queries for MANETs. The main goal of this work is to gain a first insight into the question whether DHT-based approaches for range queries are feasible in MANETs. First experimental results indicate that DHTs can indeed enable efficient range queries in MANETs.