He, "Energy efficient distributed connected dominating sets construction in wireless sensor networks," in Proc. Muthukumar, "Generating quality dominating sets for sensor network," in Proc. Aspects Wireless Ad Hoc, Sensor Peer-to-Peer Netw. Du, "Localized construction of connected dominating set in wireless networks," in Proc. Pardalos, "A reliable virtual backbone scheme in mobile ad-hoc networks," in Proc. "A greedy approximation for minimum connected dominating sets," Theor. Frieder, "New distributed algorithm for connected dominating set in wireless ad hoc networks," in Proc. Frieder, "Distributed construction of connected dominating set in wireless ad hoc networks," in Proc. Wu, "On constructing k-connected k-dominating set in wireless networks," in Proc. Du, "Connected domination in multihop ad hoc wireless networks," in Proc. Du, "Connected dominating sets in wireless networks with different transmission ranges," IEEE Trans. Workshop Discrete Algorithm Methods Mobile Comput. Li, "On calculating connected dominating set for efficient routing in ad hoc wireless networks," in Proc. Bharghavan, "Routing in ad-hoc networks using minimum connected dominating sets," in Proc. Khuller, "Approximation algorithms for connected dominating sets," Algorithmica, vol. Baker, "A design concept for reliable mobile radio networks with frequency hopping signaling," Proc. Sheu, "The broadcast storm problem in a mobile ad hoc network," in Proc. Wan, Connected Dominating Set: Theory and Applications. Wu, "A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks," in Proc. Liu et al., "On approximating minimum 3-connected m-dominating set problem in unit disk graph," IEEE/ACM Trans. Du, "Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks," in Proc. "A better constant approximation for minimum 3- connected m-dominating set problem in unit disk graph using Tutte decomposition," in Proc. They can communicate only if they are within mutual transmission range. Nodes are located in the Euclidean plane and are assumed to have identical (unit) transmission radii. One prominent application of unit disk graphs can be found in the eld of wireless networking, where a unit disk graph represents an idealized multi-hop radio network. Unit disk graphs have proven to be useful in modeling various physical real world problems. Equivalently, each node is identi ed with a disk of unit radius r = 1 in the plane, and is connected to all nodes within (or on the edge of) its corresponding disk. INTRODUCTION In a unit disk graph, there is an edge between two nodes u and v if and only if the Euclidean distance between u and v is at most 1. Unit Disk Graph Approximation Fabian Kuhn Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich, Switzerland Thomas Moscibroda Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich, Switzerland Roger Wattenhofer Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich, Switzerland ABSTRACT 1. Clearly, the unit disk graph model neatly captures this behavior and it is not surprising that it has Kuhn, Fabian Moscibroda, Thomas Wattenhofer, Roger Unit disk graph approximation Unit disk graph approximation
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |