WoS İndeksli Yayınlar Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/8653
Browse
4 results
Search Results
Article Citation - WoS: 6Citation - Scopus: 13Sdn-Driven Internet of Health Things: a Novel Adaptive Switching Technique for Hospital Healthcare Monitoring System(Wiley-hindawi, 2022) Alkhayyat, Ahmed; Abedi, Firas; Jawad, Aqeel Mahmood; Abosinnee, Ali S.; Preveze, BarbarosIn the last decent, the number of Internet of Things (IoT) health-based paradigm reached to a huge number of users, services, and applications across different disciplines. Thus, hundreds of wireless devices seem to be distrusted over a limited or small area. To provide a more efficient network, the software-defined network (SDN) thought to be a good candidate to deal with these huge number of wireless users. In this work, after a novel SDN algorithm is proposed for the hospital environment, it is also designed and integrated into an Internet of Health Things (IoHT) paradigm. The novel algorithm called adaptive switching (AS) is proposed as a novel adaptive access strategy based on adaptively hoping among existing Go-Back-N and Selective Repeat techniques. Finally, the throughput performance of the proposed AS method is compared with the performances of traditional Go-Back-N and Selective Repeat ARQ methods using the developed MATLAB simulation. For this, an optimal Perror rate that the network should prefer to switch either from Go-Back-N to Selective Repeat or from Selective Repeat to Go-Back-N method to maximize the network throughput performance is determined. The evaluated results are also confirmed by theoretical calculation results using well-known Mathis throughput formula. It is observed from the simulation results that the best throughput performance can be evaluated, when AS switches to Go-Back-N if the Perror is less than 3.5% and it switches back to Selective Repeat when the Perror is greater than 3.5%. By this way, it is also observed that the throughput always has its best possible results for all Perror rates and up to 37.52% throughput improvement is provided by the use of novel proposed adaptive switching (AS) algorithm.Article A Novel Solution for Network Flexibility Problem in Mobile Multi-Hop Tunneling Networks(Springer, 2023) Preveze, BarbarosSince the network throughput performance is limited by the available technology limits, there are too many attempts in the literature to improve the throughput performance of the network by modifying the routing algorithms currently in use. Although application of the tunneling on IP networks provides reserved paths for the higher priority packet streams and succeeds in providing faster communication performances, it is also determined in the literature that, the greatest up to date problem of tunneling networks is the flexibility problem, which is defined as the problem of difficulty to have minimal delay and highest throughput when congestions or node failures occur and the throughput decreases due to high traffic loads on the network. sIn this work, a high performance solution, called LB-ACN (Location Based- Avoid Congested Node) is proposed to solve this flexibility problem and to compensate the increased delay which came up due to the high traffic load and also due to inflexible tunneling network structure, considering the locations of the nodes in addition to their traffic loads. And it is shown that, it is succeeded to carry the throughput of the highly traffic loaded network back to 48.6 Mbps from 36.9 Mbps by about 31.7% performance improvement for which we could improve it from 36.9 Mbps up to 45.9 Mbps by 24.3% using the proposed ACN (Avoid Congested Node) algorithm in our previous work. As a result, we have succeeded in having about 7.4% more improvement on throughput performance in comparison with the previously proposed ACN algorithm.Article Citation - Scopus: 9Improvement of Underlay Cooperative Cognitive Networks Bandwidth Efficiency Under Interference and Power Constraints(Ksii-kor Soc internet information, 2019) Preveze, Barbaros; Alkhayyat, Ahmed; Al-Mishmish, Hameed R. M.The definition of the bandwidth efficiency (BE) of cognitive cooperative network (CCN) is the ratio between a number of the licensed slot(s) or sub-channel(s) used by the unlicensed users to transmit a single data packet from the unlicensed transmitter to unlicensed destination, and from unlicensed relay(s) to unlicensed destination. This paper analyzes and improves the BE in the underlay CCN with a new reactive relay selection under interference and power constraints. In other words, this paper studies how unlicensed cooperative users use the licensed network slot(s) or sub-channel(s) efficiently. To this end, a reactive relay selection method named as Relay Automatic Repeat Request (RARQ) is proposed and utilized with a CCN under interference and power constraints. It is shown that the BE of CCN is higher than that of cooperative transmission (CT) due to the interference and power constraint. Furthermore, the BE of CCN is affected by the distance of the interference links which are between the unlicensed transmitter to the licensed destination and unlicensed relay to the licensed destination. In addition, the BE for multiple relays selection over a CCN under interference and power constraints is also analyzed and studied, and it is shown that the BE of CCN decreases as the number of relays increases.Article Citation - WoS: 1Citation - Scopus: 2Effects of Routing Algorithms on Novel Throughput Improvement of Mobile Ad Hoc Networks(2012) Preveze, Barbaros; Şafak, AyselA cognitive method called most congested access first (MCAF), minimizing the packet loss ratio and improving the throughput of a multihop mobile WiMAX network, is proposed. MCAF combines both the time division multiple access and the orthogonal frequency division multiple access methods. MCAF additionally uses spectral aid and buffer management methods, which are proposed in this paper, to manage both spectrum access and packets in the buffers. By using these novel methods, real-time video and voice packet transmission is achieved, data packet loss rate is minimized, and the system throughput per node is improved. Effects of fastest path and ant colony routing algorithms on throughput improvement methods are investigated. It is shown that the fastest path routing algorithm provides higher throughput values than the ant colony routing algorithm.