چكيده به لاتين
Abstract
Cognitive Radio Networks, which are known for their increased bandwidth efficiency, will prove to be essential in the next generation of ICT and telecommunications networks. In inexpensive cognitive radio networks, which possess one single transmitter and receiver, managing timetables and schedules is of vital importance because it can increase link capacity. In ad hoc networks, each node is independently responsible for making decisions with regards to sending and receiving data. Thus, in such networks, one-sided paths are usually formed from the source to the destination. On the other hand, in cognitive radio networks with one receiver and one transmitter, each node is busy either sending or receiving data. Consequently, each link can be active either for sending or receiving data. Even though nodes are not necessarily limited to one path, these considerations must be taken into account while sending data from the source to the destination. In this research, paths which have nodes in them are presumed to be two-way. Establishing such a path requires a great deal of coordination between users so as to maximize the throughput. Even if the formed path has numerous links, we can maximize the throughput by using an appropriate and efficient schedule.
The proposed method in this study has several stages, outlined as follows:
1- Sending routing control packets by cognitive radio network nodes
2-Investigating the availability of a path and various branches in that direction. FIFO is run when the path is made with a simple link. Otherwise, if the path is multi-dimensional, a queue is formed with the number of Q for each commune node so the proposed scheduling algorithm can be run to perform the transfer based on the connected links.
3-Finally, the data are sent to their respective receivers. The simulation of the proposed method has shown considerable results, which can be seen in reducing delays for sending and receiving messages in the decider node. These results are better than the ones achieved by other methods like: OLSR, FLCFP& Random approach.
Keywords: cognitive radio networks, scheduling algorithm robust, two-way relay
