On the connectivity of Bluetooth‐based ad hoc networks

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Concurrency and Computation

• Publication date

  2009-05-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1002/cpe.1377
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On random points in the unit disk

  2006cited by this paper
• Irrigating ad hoc networks in constant time

  2005influential reference
• Bluetooth scatternet formation: A survey

  2005influential reference
• Is Bluetooth suitable for large-scale sensor networks?

  2005cited by this paper
• Comparative Performance Evaluation of Scatternet Formation Protocols for Networks of Bluetooth Devices

  2004cited by this paper
• Expansion properties of (secure) wireless networks

  2004cited by this paper
• A new approach to device discovery and scatternet formation in Bluetooth networks

  2004cited by this paper
• Bluetooth scatternet formation in ad hoc wireless networks

  2004cited by this paper
• Wireless sensor networks: a survey

  2002cited by this paper
• Random geometric graphs.

  2002cited by this paper
• The connectivity of a graph on uniform points on [0,1]d

  2002cited by this paper
• The Boost Graph Library - User Guide and Reference Manual

  2001cited by this paper
• Critical Power for Asymptotic Connectivity in Wireless Networks

  1999cited by this paper
• A Guided Tour of Chernoff Bounds

  1990cited by this paper
• The Theory of Branching Processes.

  1963cited by this paper

• Proximity Graphs

  2022cites this paper
• Connectivity of sparse Bluetooth networks

  2014cites this paper
• Forming MS-Free and Outdegree-Limited Bluetooth Scatternets in Pessimistic Environments

  2014cites this paper
• Almost optimal sparsification of random geometric graphs

  2014cites this paper
• A Bluetooth Network Dynamic Graph

  2014influential citation
• Models of Sparse Random Graphs and Network Algorithms

  2012cites this paper
• Expansion properties of (secure) wireless networks

  2012cites this paper
• Graph models of information spreading in wireless networks

  2012cites this paper
• Scalable Wireless Network Security for Bluetooth in Global Collaborative Environment

  2011cites this paper
• Connectivity threshold of Bluetooth graphs

  2011cites this paper
• Brief announcement: (more) efficient pruning of ad-hoc wireless networks

  2009cites this paper
• On the Expansion and Diameter of Bluetooth-Like Topologies

  2009influential citation
• Aeolus Algorithmic Principles for Building Efficient Overlay Computers Algorithms and Techniques for Dynamic Data Placement for Optimized Overlay Computations

  2007cites this paper
• Almost optimal sparsification of random geometric graphs

  year unknowncites this paper
• IP-FP6-015964 AEOLUS Algorithmic Principles for Building Efficient Overlay Computers Deliverable D1.0.2

  year unknowncites this paper