Spontaneous multihop networks with high device mobility and frequent fluctuations are interesting platforms for future distributed applications. Because of the large number of mobile devices required for any detailed analysis, it is nearly impossible to deploy prototype applications yet. In this paper, a comprehensive approach is presented which supports experiments ranging from pure simulation of several thousand mobile devices over hybrid scenarios with interaction among simulated as well as real life devices up to dedicated field trials. Part of this paper are also conclusions drawn from experiences with a first prototype version of a self-organized auction system for ad-hoc networks.

This work presents a Java-based development platform aimed to ease the task of building applications for mobile multihop ad-hoc networks. The platform follows a threetier development principle composed of simulation, emulation and deployment on real mobile devices. Opposed to pure network simulators, this development environment primarily focuses on an easy to use event-based programming model and scalability regarding simulating thousands of mobile devices. Additionally, utmost code reuse is provided, since attaching real hardware to the simulation and running the application on real devices are an integral part of the workbench. Performance evaluation by means of a benchmark application demonstrates that simulating over ten thousand mobile devices can be performed faster than in real-time. Also experiences gained from implementing a mobile auction system for ad-hoc networks proved that the integral parts for emulating and deployment are of high value when building real life applications for mobile multihop ad-hoc networks.

Location aware computing is popularized and location information has more important before. Ubiquitous computing also needs locaiton information. In this paper we propose location estimation system using multi-hop wireless ad-hoc network. The proposed system estimates locations of mobile hosts, using distance between hosts and the locations of some special hosts which know each location by GPS or other devices. This system is designed as client-server model. The server is called an accumulator host and calculates the locations of all hosts. We also describe an estimation algorithm running in the accumulator host. Keywords ad-hoc network, multi-hop wireless network, location aware

In order to determine whether the de- ployment of Ad-Hoc networks in a certain region or field of application is feasible or reasonable, analytic considerations as well as simulations are helpful. At first we introduce the underlying basic model. In the process of the paper we show that a thorough analytic approach is dicult and complex, and demonstrate the limitation of the analysis. Therefore we introduce a simulation tool for such networks and present some first investigation results. It performs in a simple manner the investigation of different Ad-Hoc scenarios by entering some fundamental input parameters.

The high-level contribution of this paper is to establish benchmarks for the minimum hop count per source-receiver path and the minimum number of edges per tree for multicast routing in mobile ad hoc networks (MANETs) under different mobility models. In this pursuit, we explore the tradeoffs between these two routing strategies with respect to hop count, number of edges and lifetime per multicast tree with respect to the Random Waypoint, City Section and Manhattan mobility models. We employ the Breadth First Search algorithm and the Minimum Steiner Tree heuristic for determining a sequence of minimum hop and minimum edge trees respectively. While both the minimum hop and minimum edge trees exist for a relatively longer time under the Manhattan mobility model; the number of edges per tree and the hop count per source-receiver path are relatively low under the Random Waypoint model. For all the three mobility models, the minimum edge trees have a longer lifetime compared to the minimum hop trees and the difference in lifetime increases with increase in network density and/or the multicast group size. Multicast trees determined under the City Section model incur fewer edges and lower hop count compared to the Manhattan mobility model.