Bluetooth Low Energy (BLE) represents the low-power, low-cost extension of the Bluetooth communication technology envisioned for the Internet of Things. Mesh protocols on top of BLE are currently emerging and the standard is currently being released. This paper first proposes a detailed measurement based comparison of two mesh approaches that fit within BLE operation: flooding and connection oriented networking. Using metrics such as packet delivery ratio (PDR), end-to-end delay and power consumption we conclude that the optimal mesh approach depends on the application. It is shown that for a comparable performance in terms of PDR and overhead, flooding can trade a lower end-to-end delay for a higher power consumption when compared to the connected mesh. We then propose an architecture, called Bluetooth Now, that is able to automatically switch the network between the two based on message priority. Our measurement results confirm the reliable delivery of important and urgent data sent using the Bluetooth Now paradigm, while saving battery life when transmitting non-time critical messages.

We study the scaling properties of a georouting scheme in a wireless multi-hop network of n mobile nodes. Our aim is to increase the network capacity quasi-linearly with n, while keeping the average delay bounded. In our model, we consider mobile nodes moving according to an independent identically distributed random walk with velocity v and transmitting packets to randomly chosen fixed and known destinations. The average packet delivery delay of our scheme is of order 1/v, and it achieves network capacity of order (n/log n log logn). This shows a practical throughput-delay tradeoff, in particular when compared with the seminal result of Gupta and Kumar, which shows network capacity of order (n/log n)1/2and negligible delay and the groundbreaking result of Grossglauser and Tse, which achieves network capacity of order n but with an average delay of order √n/v. The foundation of our improved capacity and delay tradeoff relies on the fact that we use a mobility model that contains straight-line segments, a model that we consider more realistic than classic Brownian motions. We confirm the generality of our analytical results using simulations under various interference models.

We study the scaling properties of a georouting scheme in a wireless multi-hop network of n mobile nodes. Our aim is to increase the network capacity quasi linearly with n while keeping the average delay bounded. In our model, mobile nodes move according to an i.i.d. random walk with velocity v and transmit packets to randomly chosen destinations. The average packet delivery delay of our scheme is of order 1/v and it achieves the network capacity of order n/(log n log log n). This shows a practical throughput-delay trade-off, in particular when compared with the seminal result of Gupta and Kumar which shows network capacity of order √(n/log n) and negligible delay and the groundbreaking result of Grossglauser and Tse which achieves network capacity of order n but with an average delay of order √n/v. The foundation of our improved capacity and delay trade-off relies on the fact that we use a mobility model that contains free space motion, a model that we consider more realistic than classic brownian motions. We confirm the generality of our analytical results using simulations under various interference models.