3 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 3 / 3
Yayın Force-directed approaches to sensor localization(SIAM, 2006) Efrat, Alon; Forrester, David; Iyer, Anand; Kobourov, Stephen G.; Erten, CesimWe consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information about the relative order of each sensor's neighbors. We experimented with classic and new force-directed techniques. The classic techniques work well for small networks with nodes distributed in simple regions. However, these techniques do not scale well with network size and yield poor results with noisy data. We describe a new force-directed technique, based on a multi-scale dead-reckoning, that scales well for large networks, is resilient under range errors, and can reconstruct complex underlying regions.Yayın A robust localization framework to handle noisy measurements in wireless sensor networks(IEEE, 2009-09-14) Erten, Cesim; Karataş, ÖmerWe construct a robust localization framework to handle noisy measurements in wireless sensor networks. Traditionally many approaches employ the distance information gathered from ranging devices of the sensor nodes to achieve localization. However the measurements of these devices may contain noise both as hardware noise and as environmental noise due to the employment conditions of the network. It Is necessary to provide a general framework that handles such a noise in data and yet still be applicable within several localization algorithms. In order to handle noise in distance measurements, our framework utilizes convex constraints and confidence intervals of a random variable. At the end of the localization process nodes are assigned to a set of feasible regions with corresponding probabilities. The accuracy of the localization can be adjusted and the framework can easily be embedded to work within previously suggested localization algorithms.Yayın Crossing minimization in weighted bipartite graphs(Elsevier B.V., 2009-12) Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, MelihGiven 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 problem is NP-complete in general and several practically efficient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edges have nonnegative weights. Although this problem is more general and finds specific applications in automatic graph layout problems similar to those of the unweighted case, it has not received as much attention. We provide a new technique that efficiently approximates a solution to this more general problem within a constant approximation ratio of 3. In addition we provide appropriate generalizations of some common heuristics usually employed for the unweighted case and compare their performances.
