WoS İndeksli Yayınlar Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/8653
Browse
2 results
Search Results
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.Conference Object Citation - WoS: 1Citation - Scopus: 3Comparative Analysis of Novel Long Life Routing Methods in Mobile Networks(Ieee, 2010) Safak, Aysel; Preveze, BarbarosIn this study we propose two novel ABR extended Long Life Routing Methods called Alternative enhancement for Enhanced Associativity Based Routing (AEABR) and Associativity Tick Averaged ABR (ATAABR) methods which are also modifications of Associativity Based Routing (ABR). Comparison of these associativity based long Life routing algorithms in Mobile Networks are done for route speeds, life times and outage times Since ABR at most focuses on power strength, it will be preferable in most systems to establish long life routes from source to destination considering the power constraints. It is shown in this paper that, the novel algorithms that we propose provide better life time, link speeds and outage time results than EABR (Enhanced Associativity Based Routing) method and other relay selection algorithms taken into consideration in this work. It's illustrated that the performance of EABR method, is really better than other relay selection algorithms for number of Route reconstructions (RRC) or relay changes and Connected Status Percentage (CSP). On the other hand it has also been illustrated that AEABR and ATAABR improve the connection stability of EABR by keeping the connection outage time at lower levels where ATAABR require less modification on algorithm and needs less computation time. AEABR improves either connection outage times or number of RRC. During this analysis message overhead and bandwidth wastage of each algorithm is also investigated. The proposed algorithms can be used in designing a unicast mobile network having power constraints to provide longer path life and lower number of route reconstructions.