A COMPARISON OF CHANNEL SCANNING SCHEMES FOR DISTRIBUTED NETWORK FORMATION AND RECONFIGURATION

Citation
Ao. Mahajan et al., A COMPARISON OF CHANNEL SCANNING SCHEMES FOR DISTRIBUTED NETWORK FORMATION AND RECONFIGURATION, WIRELESS NETWORKS, 4(4), 1998, pp. 341-351
Citations number
23
Categorie Soggetti
Telecommunications,"Engineering, Eletrical & Electronic","Computer Science Information Systems
Journal title
ISSN journal
10220038
Volume
4
Issue
4
Year of publication
1998
Pages
341 - 351
Database
ISI
SICI code
1022-0038(1998)4:4<341:ACOCSS>2.0.ZU;2-#
Abstract
A packet radio network (for example, wireless LAN, mobile tactical net work) consists of a number of nodes, each equipped with a transceiver, exchanging data packets via radio channels. In this paper we identify and discuss issues related to the process of forming a network in an automatic and distributed manner. During network initialisation and re configuration, the time to complete the network formation process is a n important performance parameter. We define two measures which can be used for computing the network formation time. Also, we present a com parative evaluation of two channel-scanning schemes (synchronous and a synchronous) for multiple frequency operations using a broadcast acces s scheme based on CSMA. Our study of networks with different spatial d istributions of nodes shows that the asynchronous scanning scheme perf orms better when the ratio of the number of 1-hop neighbours to the nu mber of available channels is high. Its performance is somewhat worse than that of the synchronous scheme for sparse networks. It is also se nsitive to changes in the channel dwell time of the receivers, compare d with the synchronous case.