Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Permanent URI for this collectionhttps://hdl.handle.net/11147/7148

Browse

Filters

2006 - 200912010 - 20131

Settings

Scopus Q: search.filters.scopusQuartile.Q3Subject: search.filters.subject.Communication systems

Search Results

Now showing 1 - 2 of 2
  • Conference Object
    Citation - Scopus: 5
    Queue-Aware Resource Allocation for Ofdma-Based Mobile Relay Enhanced Networks
    (VDE Publishing House, 2013) Baştürk, İlhan; Özbek, Berna; Le Ruyet, Didier
    Mobile relay assisted OFDMA networks that are considered as a good candidate in future deployment scenarios for coverage extension and lower deployment costs are promising solutions for provision of ubiquitous high-data-rate services in wide coverage areas. However, it is required to design efficient resource allocation algorithms to exploit these opportunities. Thus, this paper designs an heuristic resource allocation algorithm based on the queue and channel state information of the users for mobile relay enhanced OFDMA networks. The proposed queue aware algorithm is appropriate for the realistic scenarios and use system resources efficiently. Numerical results revealed that the mobile-relay enhanced scheme improves coverage and assisting users having unfavorable channel conditions such as cell-edge users by increasing the data rate compared to existing fixed-relay enhanced and non-relaying schemes. © VDE Verlag GMBH.
  • Conference Object
    Citation - WoS: 6
    Citation - Scopus: 6
    A Merging Clustering Algorithm for Mobile Ad Hoc Networks
    (Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, Deniz
    Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and provide results in the simulation environment of ns2. Our results conform that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithms