direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

TKN Technical Report Series

Optimized Asynchronous Passive Multi-Channel Discovery of Beacon-Enabled Networks
Citation key Karowski15optimized_asynchronous_passive
Author Karowski, Niels and Miller, Konstantin
Year 2015
Number TKN-15-002
Month March
Institution Telecommunication Networks Group, Technische Universität Berlin
Abstract Neighbor discovery is a fundamental task for wireless networks deployment. The discovery of neighbors is essential for setup and maintenance of networks and is typically a precondition for further communication. In this work we focus on passive discovery of networks operating in multi-channel environments, performed by listening for periodically transmitted beaconing messages. It is well-known that performance of such discovery approaches strongly depends on the structure of permitted sets of Beacon Intervals (BI's). Although restricting the latter facilitates the discovery process, it is necessary to develop discovery strategies that are as nonrestrictive as possible, in order to cover a broad range of existing wireless technologies, and to allow network operators to select BI's that are best suited for the targeted application and/or device characteristics. In the present work, we develop a novel family of low-complexity algorithms that greedily maximize the number of discovered networks independently in each subsequent time slot. We identify an important family of BI sets, where each BI is an integer multiple of all smaller BI's, and prove that for BI sets from this family, greedy algorithms are optimal w.r.t. several performance metrics. In particular, they minimize the makespan, that is, the time until all networks are discovered, maximize the mean discovery time, and maximize the number of networks discovered within the first t seconds, for any t. Notably, the identified family completely includes BI sets supported by IEEE 802.15.4 and a large part of BI sets supported by IEEE 802.11. In addition, we present a novel approach based on an Integer Linear Program that minimizes mean discovery time for arbitrary BI sets. The proposed strategies are evaluated by means of simulations under reaslistic conditions, including beacon losses and non-zero channel switching times, and compared with previous work and the passive scan of IEEE 802.15.4 w.r.t. various performance metrics, such as makespan, mean discovery time, number of channel switches, etc. Finally, due to the strong in uence the structure of BI sets has on performance of discovery strategies, we provide recommendations on selection of BI's sets that are as nonrestrictive as possible, and help making the discovery process as efficient as possible.
Bibtex Type of Publication TKN Technical Report Series
Link to publication Download Bibtex entry

To top

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

Search Publications