Learn More
This paper studies the problem of determining the node locations in ad-hoc sensor networks. We compare three distributed localization algorithms (Ad-hoc positioning, Robust positioning, and N-hop multilateration) on a single simulation platform. The algorithms share a common, three-phase structure: (1) determine node–anchor distances, (2) compute node(More)
The need to reprogramme a wireless sensor network may arise from changing application requirements, bug fixes, or during the application development cycle. Once deployed, it will be impractical at best to reach each individual node. Thus, a scheme is required to wirelessly reprogramme the nodes. We present an energy-efficient code distribution scheme to(More)
Key issues in wireless sensor networks such as data aggregation, localisation, MAC protocols and routing, all have to do with communication at some level. At a low level, these are influenced by the link layer performance between two nodes. The lack of accurate sensor network specific radio models, and the limited experimental data on actual link behaviour,(More)
Augmented reality and group communication in wireless ad-hoc networks form relatively new fields of research. When using group communication ordering and timeliness requirements are important. Moreover, when using wireless ad-hoc networks, the possibility of network partition is a serious consideration. In this paper we explore these three issues in the(More)