A random graph-based model to analyze packet interference between frequency hopping systems with an application to Bluetooth

• Published in: Computer communications 2008-09, Vol.31 (14), p.3286-3291
• Main Authors: Naik, Kshirasagar, Wei, David S.L., Su, Yu T., Shiratori, N.
• Format: Article
• Language: English
• Subjects: Applied sciences; Bluetooth technology; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Exact sciences and technology; Frequency hopping systems; Packet interference; Probabilistic graphs; Software
• ISSN: 0140-3664; 1873-703X
• DOI: 10.1016/j.comcom.2008.05.013

In this paper, we present a graph-based model for analyzing interference between two frequency hopping systems for wireless communication. Informally, frequency hopping means that successive packets are transmitted on different frequencies from a pseudo-random sequence. The frequency band occupied by a packet may be narrow or wide. Our model is based on the concept of probabilistic graphs, where a node represents a “channel” and an edge denotes the probability of interference between two packets belonging to two different channels. Two packets on two channels are said to be mutually interfering if the two packets overlap in time and are transmitted on the same frequency. Thus, from the viewpoint of probabilistic graphs, the expected number of nodes with at least one incident edge is a measure of packet interference in a collection of wireless channels. We apply this model of packet interference to a heterogeneous cluster of Bluetooth piconets, where a piconet could be either of 79-hop type or of 23-hop type. Though the 23-hop type has been phased out, we use it as an example in this paper.