Browsing by Author "Çakıroğlu, Olca Arda"
Now showing items 1-5 of 5
-
Crossing minimization in weighted bipartite graphs
Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, Melih (Springer, 2007)Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ... -
Crossing minimization in weighted bipartite graphs
Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, Melih (Elsevier B.V., 2009-12)Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The ... -
Distributed iterative cluster localization in wireless sensor networks
Çakıroğlu, Olca Arda (Işık Üniversitesi, 2009-01-07)We designed a distributed algorithm for iterative cluster localization. Because this algorithm is especially designed for large scale networks, increase in the number of sensor nodes has no ine ciency e ect on sensor node ... -
Fully decentralized and collaborative multilateration primitives for uniquely localizing WSNs
Çakıroğlu, Olca Arda; Erten, Cesim (Springer International Publishing AG, 2010)We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and ... -
Fully decentralized, collaborative multilateration primitives for uniquely localizing WSNs
Çakıroğlu, Olca Arda; Erten, Cesim (Springer-Verlag Berlin, 2009)We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and ...
