Toronto Metropolitan University
Rahman_Md_Mizanur.pdf (2.7 MB)

Formation and inter-piconet communications in cognitive personal area networks

Download (2.7 MB)
posted on 2021-05-22, 15:36 authored by Md. Mizanur Rahman
This dissertation presents a new approach for achieving group rendezvous with a coordinator node towards forming a Cognitive Personal Area Network (CPAN) by an arbitrary number of nodes. We propose a protocol for the time to form CPAN in which the nodes join the coordinator simultaneously instead of sequentially. Specifically, we develop an analytical model and derive the distribution of time to form CPAN under the considerations of random arrivals of nodes and their random times to rendezvous with coordinator. We also investigate the CPAN formation time by considering the random activity of primary user (PU). Besides operating in a CPAN, the nodes may have traffic destined to the nodes of other CPAN. In this dissertation, we also propose a bridging protocol in which a shared (bridge) node routes the inter-CPAN traffic between two CPANs. As the bridge node shares its time between two CPANs, the bridge traffic gets priority over that of ordinary nodes in both CPANs. We consider a single, unidirectional bridge because the traffic in the opposite direction can easily be accommodated by having another bridge node. We develop an analytical model based on probabilistic modeling and queueing theory to evaluate the performance of the bridging protocol. We validate the network performance by analyzing the waiting time of local and non-local packets and how the node or bridge transmission is affected by the collision with primary source activity. Finally, we propose a low-overhead two-way bridging scheme for two-hop CPANs, which is more realistic and can be used a basis for routing inter-CPAN traffic in a multihop network. In this advance bringing protocol, the bridge switches between the CPANs without any predefined arrangement, which resulted in simplified bridge scheduling and increased fairness for all nodes. We also analyze its performance through probabilistic analysis and renewal theory. We show that the CPANs are indeed decoupled in terms of synchronization, however the performance of both local and non-local traffic in either CPAN depends on the traffic intensity in both CPANs as well as on the portion of traffic targeting non-local destinations





  • Doctor of Philosophy


  • Computer Science

Granting Institution

Ryerson University

LAC Thesis Type

  • Dissertation



Usage metrics

    Computer Science (Theses)


    Ref. manager