PROJECT TITLE :
To Relay or Not to Relay in Cognitive Radio Sensor Networks
A recent investigation on the medium access control (MAC) layer in cognitive radio networks (CRNs) proposed the first packet relaying by the secondary node maintaining an extra queue used for this specific addable functionality. Nevertheless, relaying of primary packets may introduce delays on secondary packets known as secondary delay and might need an extra power budget to forward the primary packets. Power budget is significantly crucial when a type of sensor network is deployed using devices of limited power resources. During this paper, admission management is employed to efficiently manage this packet-wise relaying process in cognitive radio sensor networks (CRSNs). To be specific, we have a tendency to assume a cognitive packet-relaying situation with 2 pairs of primary and secondary users, i.e., transmitter and receiver. We analyze and formulate the secondary delay and the required power budget of the secondary sensor node in relation to the acceptance issue (i.e., admission management parameter) that indicates whether the primary packets are admitted for relaying or not. Having outlined the on top of, we have a tendency to gift a tradeoff between the secondary delay and the required power budget by tuning the acceptance issue, that will be tailored to specific chosen values. Primarily based on this behavior, we formulate an optimization problem to attenuate the secondary delay over the admission management parameter subject to a limit on the desired power budget. Additionally, the constraints related to the stabilities of all individual queues at the first and secondary networks are taken into account in the proposed optimization drawback, thanks to their interdependence relations. The solution of this problem is provided using iterative decomposition methods, i.e., twin and primal decompositions, using Lagrange multipliers that simplify the original sophisticated drawback and result in a final equivalent dual downside that features the initial Karush–Kuhn–Tucker (KKT) conditions. We get the optim- l acceptance factor, while additionally, we highlight the opportunities for further delay minimization that's provided by relaxing the initial constraints through changing the values of the Lagrange multipliers. Finally, we have a tendency to gift the behavior of the secondary delay, assuming infinite and finite queues and assessing thereby the overflow and blocking probabilities, respectively.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here