Browsing by Author "Karakaya, M."
Now showing 1 - 6 of 6
Results Per Page
Sort Options
Item Open Access Clustering mobile trajectories for resource allocation in mobile environments(Springer, 2003) Katsaros, D.; Nanopoulos, A.; Karakaya, M.; Yavas, G.; Ulusoy, Özgür; Manolopoulos, Y.The recent developments in computer and communication technologies gave rise to Personal Communication Systems. Due to the nature of the PCS, the bandwidth allocation problem arises, which is based on the notion of bandwidth-on-demand. We deal with the problem of how to predict the position of a mobile client. We propose a new algorithm, called DCP, to discover user mobility patterns from collections of recorded mobile trajectories and use them for the prediction of movements and dynamic allocation of resources. The performance of the proposed algorithm is examined against two baseline algorithms. The simulation results illustrate that the proposed algorithm achieves recall that is comparable to that of the baseline algorithms and substantial improvement in precision. This improvement guarantees very good predictions for resource allocation with the advantage of very low resource consumption. © Springer-Verlag Berlin Heidelberg 2003.Item Open Access A connection management protocol for promoting cooperation in Peer-to-Peer networks(Elsevier BV, 2008-02-05) Karakaya, M.; Körpeoǧlu, I.; Ulusoy, ÖzgürThe existence of a high degree of free riding in Peer-to-Peer (P2P) networks is an important threat that should be addressed while designing P2P protocols. In this paper we propose a connection-based solution that will help to reduce the free riding effects on a P2P network and discourage free riding. Our solution includes a novel P2P connection type and an adaptive connection management protocol that dynamically establishes and adapts a P2P network topology considering the contributions of peers. The aim of the protocol is to bring contributing peers closer to each other on the adapted topology and to push the free riders away from the contributors. In this way contribution is promoted and free riding is discouraged. Unlike some other proposals against free riding, our solution does not require any permanent identification of peers or a security infrastructure for maintaining a global reputation system. It is shown through simulation experiments that there is a significant improvement in performance for contributing peers in a network that applies our protocol. © 2007 Elsevier B.V. All rights reserved.Item Open Access Counteracting free riding in Peer-to-Peer networks(Elsevier BV, 2008-03) Karakaya, M.; Körpeoǧlu, I.; Ulusoy, O.The existence of a high degree of free riding is a serious threat to Peer-to-Peer (P2P) networks. In this paper, we propose a distributed framework to reduce the adverse effects of free riding on P2P networks. Our solution primarily focuses on locating free riders and taking actions against them. We propose a framework in which each peer monitors its neighbors, decides if they are free riders, and takes appropriate actions. Unlike other proposals against free riding, our framework does not require any permanent identification of peers or security infrastructures for maintaining a global reputation system. Our simulation results show that the framework can reduce the effects of free riding and can therefore increase the performance of a P2P network. © 2007 Elsevier B.V. All rights reserved.Item Open Access Evaluation of a broadcast scheduling algorithm(Springer, Berlin, Heidelberg, 2001) Karakaya, M.; Ulusoy, ÖzgürOne of the two main approaches of data broadcasting is pull- based data delivery. In this paper, we focus on the problem of scheduling data items to broadcast in such a pull-based environment. Previous work has shown that the Longest Wait First heuristic has the best performance results compared to all other broadcast scheduling algorithms, however the decision overhead avoids its practical implementation. Observing this fact, we propose an efficient broadcast scheduling algorithm which is based on an approximate version of the Longest Wait First heuristic. We also compare the performance of the proposed algorithm against well- known broadcast scheduling algorithms. © Springer-Verlag Berlin Heidelberg 2001.Item Open Access Free riding in peer-to-peer networks(Institute of Electrical and Electronics Engineers, 2009) Karakaya, M.; Korpeoglu, I.; Ulusoy, ÖzgürFree riding in peer-to-peer (P2P) networks poses a serious threat to their proper operation. Here, the authors present a variety of approaches developed to overcome this problem. They introduce several unique aspects of P2P networks and discuss free riding's effects on P2P services. They categorize proposed solutions and describe each category's important features and implementation issues together with some sample solutions. They also discuss open issues, including common attacks and security considerations. © 2009 IEEE.Item Open Access Hedonic coalition formation games: A new stability notion(Elsevier, 2011) Karakaya, M.This paper studies hedonic coalition formation games where each player's preferences rely only upon the members of her coalition. A new stability notion under free exit-free entry membership rights, referred to as strong Nash stability, is introduced which is stronger than both core and Nash stabilities studied earlier in the literature. Strong Nash stability has an analogue in non-cooperative games and it is the strongest stability notion appropriate to the context of hedonic coalition formation games. The weak top-choice property is introduced and shown to be sufficient for the existence of a strongly Nash stable partition. It is also shown that descending separable preferences guarantee the existence of a strongly Nash stable partition. Strong Nash stability under different membership rights is also studied.