Neighbor Discovery Latency in BLE-Like Protocols

@article{Kindt2018NeighborDL,
  title={Neighbor Discovery Latency in BLE-Like Protocols},
  author={Philipp H. Kindt and Marco Saur and Michael Balszun and Samarjit Chakraborty},
  journal={IEEE Transactions on Mobile Computing},
  year={2018},
  volume={17},
  pages={617-631}
}
Neighbor discovery is the procedure in which two wireless devices initiate a first contact. In low power ad-hoc networks, radios are duty-cycled and the latency until a packet meets a reception phase of another device is determined by a random process. Most research considers slotted protocols, in which the points in time for reception are temporally coupled to beacon transmissions. In contrast, many recent protocols, such as ANT/ANT+ and Bluetooth Low Energy (BLE) use a slotless, periodic… Expand
Slotless Protocols for Fast and Energy-Efficient Neighbor Discovery
TLDR
This paper proposes a novel, continuous-time discovery protocol, which temporally decouples beaconing and listening, and shows that this scheme can outperform all known protocols such as DISCO, U-Connect or Searchlight significantly. Expand
Optimizing BLE-Like Neighbor Discovery
TLDR
An optimization framework for PI-based BLE-like protocols is proposed, which translates any specified duty-cycle (and therefore energy budget) into a set of optimized parameter values, and it is shown that the parametrizations resulting from one variant of this proposed scheme are optimal when one receiver discovers one transmitter. Expand
Understanding slotless neighbor discovery: demo abstract
TLDR
This demo is supposed to accompany the paper entitled "Griassdi: Mutually Assisted Slotless Neighbor Discovery Protocols", which appeared at IPSN 2017 as a regular paper. Expand
Griassdi: Mutually Assisted Slotless Neighbor Discovery
TLDR
This paper proposes a theory to model slotless, purely-interval based neighbor discovery protocols, and shows that with an optimized schedule, the proposed protocol achieves considerably shorter mean latencies than all known protocols, while still guaranteeing worst-case latencies that are similar to the best known solutions. Expand
On optimal neighbor discovery
TLDR
It is concluded that there is no further potential to improve the relation between latency and duty-cycle, but future ND protocols can improve their robustness against beacon collisions and several existing protocols are indeed optimal, which has not been known until now. Expand
Neighbor discovery latency in bluetooth low energy networks
TLDR
A theoretical model based on the Chinese Remainder Theorem (CRT) for analyzing the neighbor discovery latency in BLE networks, where the scanner and the advertiser are modeled in 3-distributed channels is presented. Expand
Asynchronous Neighbor Discovery on Duty-Cycled Mobile Devices: Models and Schedules
TLDR
This paper develops a generalized non-integer model, where time is continuous and a node may become awake or asleep at any point of time (subject to a few constraints) so that the resultant schedules can be significantly more efficient than integer schedules. Expand
Compressed sensing algorithm for neighbour discovery in mobile ad hoc networks
TLDR
A novel neighbour discovery algorithm based on compressed sensing to apply in this scheme is proposed; it enables all nodes to update neighbour information through the received signal after one or several frames and spends no extra overhead. Expand
Low Energy Bluetooth Inter-Node Communication Schemes via Randomized Reconfiguration
  • V. Winstead, Chengtao Xu
  • Computer Science
  • 2018 IEEE International Conference on Electro/Information Technology (EIT)
  • 2018
TLDR
This work considers a case where the physical devices are equally spaced along a line (or string) with sufficient distance to necessitate node-to-node communication only and proposes and compares two schemes to determine which method minimizes block packet transmission time. Expand
Analysis and Design of Low-Duty Protocol for Smartphone Neighbor Discovery
TLDR
A new protocol, R2, is designed, based on locally synchronized protocols, where phones use time information from nearby Wi-Fi Access Points to help neighbor discovery, that achieves low discovery delay. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 45 REFERENCES
Slotless Protocols for Fast and Energy-Efficient Neighbor Discovery
TLDR
This paper proposes a novel, continuous-time discovery protocol, which temporally decouples beaconing and listening, and shows that this scheme can outperform all known protocols such as DISCO, U-Connect or Searchlight significantly. Expand
Understanding slotless neighbor discovery: demo abstract
TLDR
This demo is supposed to accompany the paper entitled "Griassdi: Mutually Assisted Slotless Neighbor Discovery Protocols", which appeared at IPSN 2017 as a regular paper. Expand
U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol
TLDR
A neighbor discovery protocol called U-Connect is proposed, which achieves neighbor discovery at minimal and predictable energy costs while allowing nodes to pick dissimilar duty-cycles and achieves orders of magnitude lower latency for a given duty cycle compared to existing schemes for wireless sensor networks. Expand
Griassdi: Mutually Assisted Slotless Neighbor Discovery
TLDR
This paper proposes a theory to model slotless, purely-interval based neighbor discovery protocols, and shows that with an optimized schedule, the proposed protocol achieves considerably shorter mean latencies than all known protocols, while still guaranteeing worst-case latencies that are similar to the best known solutions. Expand
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
We present Disco, an asynchronous neighbor discovery and rendezvous protocol that allows two or more nodes to operate their radios at low duty cycles (e.g. 1%) and yet still discover and communicateExpand
On heterogeneous neighbor discovery in wireless sensor networks
TLDR
Two neighbor discovery protocols are proposed, called Hedis and Todis, that optimize the duty cycle granularity of quorum and co-primality based protocols respectively, by enabling the finest-grained control of heterogeneous duty cycles. Expand
Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks
TLDR
This paper considers the design of power-saving protocols for mobile ad hoc networks (MANETs) that allow mobile hosts to switch to a low-power sleep mode and proposes three power management protocols, namely dominating-awake-interval, periodically-fully-aw Wake-Interval, and quorum-based protocols, which are directly applicable to IEEE 802.11-based MANETs. Expand
Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks
TLDR
It is shown by analysis and simulation that the birthday protocols are a promising tool for saving energy during the deployment of an ad hoc network as well as an efficient and flexible means of having the nodes discover their neighbors. Expand
Hello: A generic flexible protocol for neighbor discovery
TLDR
Hello, a generic flexible protocol for neighbor discovery with an unrestricted parameter, serves as a generic framework that incorporates existing deterministic protocols and exhibits great flexibility by adjusting itself to any configuration that best meets application demands. Expand
Analysis of Latency Performance of Bluetooth Low Energy (BLE) Networks
TLDR
This paper builds an analytical model to investigate the discovery probability, as well as the expected discovery latency, which are then validated via extensive experiments and analyzes the sensitivity of these performance metrics to parameter settings to quantitatively examine to what extent parameters influence the performance metric of the discovery processes. Expand
...
1
2
3
4
5
...