Y. Wang and X.-Y. Li, "Geometric Spanners for Wireless Ad Hoc Networks," in Proceedings of the 22 International Conference on Distributed Computing Systems (ICDCS), 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Geometric Ad-Hoc Routing: Of Theory and Practice - Kuhn, Wattenhofer, Zhang.. (2003) (20 citations) (Correct)
....that a) GBG is a bounded degree unit disk graph and b) the nodes of GBG form a connected dominating set of G. Consequently, all nodes of G have at least one neighbor in GBG . The distributed construction of a subgraph of G with properties a) and b) is described in a number of publications (e.g. [1, 9, 25]) As the backbone contains a dominating set of the underlying graph, every regular node (a node not in the backbone) can be associated to one of its dominators. Since this can be regarded as a clustering of all regular nodes around their dominators, we call this graph the Clustered Backbone ....
Y. Wang and X.-Y. Li. Geometric Spanners for Wireless Ad Hoc Networks. In Proc. 22 International Conference on Distributed Computing Systems (ICDCS), 2002.
Localized Low-Weight Graph and Its Applications in.. - Li, YuWang, Wan.. (2004) Self-citation (Li) (Correct)
No context found.
Yu Wang and Xiang-Yang Li, "Geometric spanners for wireless ad hoc networks," in IEEE ICDCS, 2002.
Localized Low-Weight Graph and Its Applications in.. - Li, Wang, Wan, Song.. Self-citation (Wang Li) (Correct)
No context found.
Yu Wang and Xiang-Yang Li, "Geometric spanners for wireless ad hoc networks," in IEEE ICDCS, 2002.
Algorithmic, Geometric and Graphs Issues in Wireless Networks - Li (2002) (1 citation) Self-citation (Li) (Correct)
No context found.
Yu Wang and Xiang-Yang Li, \Geometric spanners for wireless ad hoc networks," in Proc. of 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), 2002, To appear.
Approximate MST for UDG locally - Li Self-citation (Li) (Correct)
....networks is to send out the signal while the receiving cost of a message is neglected here, a protocol s message complexity is only measured by how many messages are sent out by all nodes. In recent years, there are substantial amount of research on topology control for wireless ad hoc networks [1 4]. These algorithms are designed for different objectives: minimizing the maximum link length while maintaining the network connectivity [3] bounding the node degree [2] bounding the spanning ratio [2, 1] constructing planar spanner locally [1] Planar structures are used by several localized ....
Wang, Y., Li, X.Y.: Geometric spanners for wireless ad hoc networks. In: Proc. of 22nd IEEE International Conference on Distributed Computing Systems (ICDCS). (2002)
Geometric Spanners for Wireless Ad Hoc Networks - Alzoubi, Li, Wang, Wan, Frieder (2003) (1 citation) Self-citation (Wang Li) (Correct)
....to another node v. Using the smallest ID is not always efficient because we may have to postpone the selection of connectors till the node collects the IDs of all its one hop neighbors. Instead, we can pick any node that comes first to the notice of the node that makes the selection of connectors [34]. Notice that, the above approach is different from the one adopted by Baker et al. 21] 22] In their protocols, they let the dominatee nodes decide whether they will serve as the connectors (gateways) or not. For example, if a dominatee node finds that it is dominated by two nonadjacent ....
Y. Wang and X.-Y. Li, "Geometric Spanners for Wireless Ad Hoc Networks," Proc. 22nd IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
Efficient Computation of Maximal Independent Sets in.. - Moscibroda, Wattenhofer (Correct)
No context found.
Y. Wang and X.-Y. Li, "Geometric Spanners for Wireless Ad Hoc Networks," in Proceedings of the 22 International Conference on Distributed Computing Systems (ICDCS), 2002.
Geometric Ad-Hoc Routing: Of Theory and Practice - Kuhn, Wattenhofer, Zhang.. (2003) (20 citations) (Correct)
No context found.
Y. Wang and X.-Y. Li. Geometric Spanners for Wireless Ad Hoc Networks. In Proc. 22 International Conference on Distributed Computing Systems (ICDCS), 2002.
Initializing Newly Deployed Ad Hoc and Sensor Networks - Kuhn, Moscibroda, Wattenhofer (2004) (Correct)
No context found.
Y. Wang and X.-Y. Li. Geometric Spanners for Wireless Ad Hoc Networks. In Proc. of the 22 Int. Conf. on Distributed Computing Systems (ICDCS), 2002.
Initializing Newly Deployed Ad Hoc and Sensor Networks - Fabian Kuhn Networks (2004) (Correct)
No context found.
Y. Wang and X.-Y. Li. Geometric Spanners for Wireless Ad Hoc Networks. In Proc. of the 22 Int. Conf. on Distributed Computing Systems (ICDCS), 2002.
How the Hidden-Terminal Problem Affects Clustering in.. - Moscibroda, Kuhn.. (Correct)
No context found.
Y. Wang and X.-Y. Li. Geometric Spanners for Wireless Ad Hoc Networks. In Proceedings of the 22 International Conference on Distributed Computing Systems (ICDCS), 2002.
Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks - Calinescu (Correct)
No context found.
Yu Wang and Xiang-Yang Li, \Geometric Spanners for Wireless Ad Hoc Networks ", in ICDCS 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC