Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks", ACM PODC, pp. 264-273, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....while source and sink nodes are static and always awake. There exists some work [110] that studies the performance of IEEE 802.11 PSM in a wireless LAN environment. However, little is known about how IEEE 802.11 PSM operates in multi hop wireless networks. 3.4. 2 Topology Power Control CBTC(ff) [82] is a two phase algorithm in which each node finds the minimum power p such that transmitting with p ensures that it can reach some node in every cone of degree ff. The algorithm has been analytically shown to preserve the network connectivity if ff 5=6. It has also ensured 17 that every link ....

L. Li, J. Y. Halpern, P. Bahl, Y. M. Wang, R. Wattenhofer, "Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-hop Networks," in Proc. of Annual ACM Symposium on Principles of Distributed Computing (PODC), August 2001.

....on environmental conditions, to a higher power) of the transmitting range. Our evaluation of required transmitting range is also useful in directing various topology control protocols, which try to dynamically adjust transmitting ranges in order to minimize energy consumption at run time [6,9,10]. The question of how many nodes are necessary for a given transmitting range is very important for planning and design of wireless ad hoc networks when devices employ a fixed transceiver technology. Our primary analytical result in this paper shows that a 1 dimensional network with nodes placed ....

L. Li, J. H. Halpern, P. Bahl, Y. Wang, R. Wattenhofer, "Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-hop Networks", Proc. ACM Symp. on Principles of Distributed Computing (PODC), pp. 264-273, August 2001.

....is not considered here. In this paper, the term strong connectivity is used to denote connectivity for . these algorithms are not scalable for large ad hoc networks where excessive amounts of information would need to be collected by a central entity. Distributed algorithms [4] [5], 6] on the other hand, are generally scalable and adaptive to mobility due to the fact that each node relies on local information collected from nearby nodes to autonomously compute its appropriate transmission power. Considering that the information each node obtains is limited, the major ....

....to maintain multiple routing tables, one for each transmit power level. To select the optimum power level, the algorithm considers the smallest power level which results in a routing table with the same number of entries as the routing table obtained at the full transmit power. Finally, in [5], 6] a distributed topology control mechanism, termed Cone based Topology Control, is proposed where each node autonomously controls its transmission power so that at least one neighbor is found in any surrounding cone of a certain size. They show that is the upperbound cone size to ....

Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, and Roger Wattenhofer, "Analysis of a Cone-Based Distributed Topology Control Algorithms for Wireless Multi-hop Networks," in ACM Symposium on Principle of Distributed Computing (PODC), Newport, Rhode Island, August 2001.

....a target property (e.g. connectivity) of the resulting network topology is guar anteed, while the global energy consumption is reduced. A protocol that attempts to achieve this is called a topology control protocol. Several examples of topology control mechanisms have been recently introduced [1, 5, 10, 15, 16, 21, 23, 27]. In order to be easily implementable in a realistic scenario, a topology control protocol should be fully distributed, asynchronous, and localized (i.e. the computation at every node should be based on in formation concerning neighbor nodes only) These features in general ensure that the ....

....be implemented at a reasonable cost in many realistic scenarios. We have performed several simulations, which have shown that our protocol reduces energy consumption considerably with respect to the case where no topology control is used, and that it compares fa vorably with the CBTC protocol of [15, 27]. 2 Related work In [23] Rodoplu and Meng presented a distributed topology control algorithm that leverages on posi tion information (provided by low power GPS receivers) to build a topology that is proved to min imize the energy required to communicate with a given master node. ....

[Article contains additional citation context not shown here]

L. Li, J.H. Halpern, P. Bahl, Y. Wang, R. Wat- tenhofer, "Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multihop Networks", Proc. ACM PODC 2001.

....varied dynamically in presence of mobility or when the physical node placement is unknown. Distributed topology control protocols aimed at dynamically changing the transmitting range assignment in order to keep the network connected and minimize energy consumption have been recently presented in [17, 24, 26]. The problem of assigning transmitting range to nodes in such a way that the resulting communication graph is strongly connected and the energy cost is minimized is called the range assignment problem (RA) and was rst studied in [18] In [18] it is shown that RA for one dimensional networks ....

L. Li, J.H. Halpern, P. Bahl, Y. Wang, R. Wattenhofer, \Analysis of a ConeBased Distributed Topology Control Algorithm for Wireless Multi-hop Networks", Proc. ACM PODC 2001.

....i.e. if the transmitting ranges of the units are set in such a way that a target property (e.g. strong connectivity ) of the resulting network topology is guaranteed, while the global energy consumption is minimal. For this reason, topology control protocols have been recently introduced [10,14,16] in the literature. Informally speaking, a topology control protocol is an algorithm in which units adjust their transmitting ranges in order to achieve a desired topological property, while optimizing energy consumption. The problem of ensuring strong connectivity while minimizing some measure of ....

....proposed in [16] and [14] minimize a given objective function, which is not the overall energy consumption. In particular, in [16] the authors minimize the energy needed to communicate with a single master node, while in [14] the authors minimize the maximum transmitting range of nodes. In [10], no explicit cost function is minimized. and the simulation results show that it achieves significant energy savings. In [14] Ramanathan and Rosales Hain considered the problem of minimizing the maximum of node transmitting ranges while achieving connectedness. They also considered the ....

[Article contains additional citation context not shown here]

L. Li, J. H. Halpern, P. Bahl, Y. Wang, and R. Wattenhofer, "Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-hop Networks", to appear in Proc. ACM Symp. on Principles of Distributed Computing (PODC), August 2001.

....As increasingly small network nodes are becoming available, many sense compute actuate networks are being realized. Several of these networks use unattended wireless nodes [ 1,2,4] which communicate with one another via intermediate node relays due to limited transmission range or energy [7,8]. The number of nodes is potentially large (thousands and millions of nodes are considered in earthquake relief and unmanned space vehicle scenarios, for instance) 1] Thus, scalability is a key issue for large scale multi hop wireless networks. One way to achieve scalability is by divide and ....

....a cellular hexagon structure is described for cellular networks, but it is pre configured and there is no ability of selfhealing. In [11,12] different algorithms for topology control in networks are developed, but they are either centralized or semi centralized, and thus are not scalable. In [7 9], algorithms for topology control in wireless networks for energy saving are developed. In [13] adaptive fidelity control and routing algorithms are developed for wireless sensor networks. Our self configuration algorithm provides a stable network infrastructure for tasks such as routing or power ....

Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks", A CM PODC 2001.

....As increasingly small network nodes are becoming available, many sense compute actuate networks are being realized. Several of these networks use unattended wireless nodes [1,2,4] which communicate with one another via intermediate node relays due to limited transmission range or energy [7,8]. The number of nodes is potentially large (thousands and millions of nodes are considered in earthquake relief and unmanned space vehicle scenarios, for instance) 1] Thus, scalability is a key issue for large scale multi hop wireless networks. One way to achieve scalability is by divide and ....

....a cellular hexagon structure is described for cellular networks, but it is pre configured and there is no self healing consideration. In [11,12] different algorithms for topology control in networks are developed, but they are either centralized or semicentralized, and thus not scalable. In [7 9], algorithms for topology control in wireless networks for energy saving are developed. In [13] adaptive fidelity control and routing algorithms are developed for wireless sensor networks. Our selfconfiguration algorithm provides a stable network infrastructure for tasks such as routing or power ....

Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks", ACM PODC 2001.

....which are usually deployed in unattended environments. Topology control for ad hoc networks aims to conserve energy, reduce interference, and increase effective capacity by adjusting the transmission power and or antenna pattern on each node. Several topology control algorithms [1] 2] 3] [4] have been proposed for ad hoc networks. Centralized algorithms can achieve optimality or its approximation, which are more applicable to static networks due to the lack of adaptability to topology changes. In contrast, distributed algorithms are more suitable for mobile ad hoc networks since they ....

....to find the smallest common power level that maintains the network connectivity. Similar to LILT, COMPOW provided an integrated solution for power control and routing by maintaining routing tables at all power levels, and then selected the optimum power level based on the routing information. In [4], a distributed topology control algorithm termed ConeBased distributed Topology Control (CBTC) was proposed. Though similar to LINT, CBTC attempted to limit the degree of each node by adjusting the transmission power, and it did so directly by its proposed optimizations and indirectly by ....

[Article contains additional citation context not shown here]

L. Li, J. Halpern, V. Bahl, Y.M. Wang, and R. Wattenhofer, "Analysis of a Cone-Based Distributed Topology Control Algorithms for Wireless Multihop Networks," in ACM Symposium on Principle of Distributed Computing (PODC), August 2001.

....Indeed, minimizing energy consumption in topology control is a key factor in the optimal usage of wireless sensor networks [1] We also note that because of limited capacity, we need to have as few as possible facilities such as GPS. One property of the network that has been considered by Liet al... [15, 10] is connectivity. They assume that nodes do not have any kind of GPS and their algorithm works using only directional information. They demonstrate a simple distributed algorithm in which each node uses only local decisions about its transmission power to guarantee the global connectivity of the ....

....network, we might have a lot of congestion since those nodes are the only ones on the paths from some nodes to others in the network. Thus, the algorithm might result in hot spots and congestion, which in turn might drain battery power and lead to a network partition, as pointed out by Liet al... [10]. These motivations lead us to search for more powerful properties in the network by which we can tolerate failures and avoid network partition. In this paper, we consider kconnectivity of networks in which we satisfy the following two properties simultaneously: First for each p k, failures of ....

[Article contains additional citation context not shown here]

L. Li, J. Halpern, V. Bahl, Y.M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In ACM Symposium on Principle of Distributed Computing (PODC). August 2001.

No context found.

L. Li, J. Halpern, V. Bahl, Y.-M. Wang, and R. Wattenhofer. Analysis of a ConeBased Distributed Topology Control Algorithm for Wireless Multihop Networks. ACM Symposium on Principles of Distributed Computing (PODC), 2001.

No context found.

L. Li, J. Halpern, V. Bahl, Y.-M. Wang, and R. Wattenhofer. Analysis of a ConeBased Distributed Topology Control Algorithm for Wireless Multihop Networks. ACM Symposium on Principles of Distributed Computing (PODC), 2001.

No context found.

L. Li, J. Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In ACM PODC, 2001.

No context found.

Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, and Roger Wattenhofer, \Analysis of a conebased distributed topology control algorithms for wireless multi-hop networks," in ACM Symposium on Principle of Distributed Computing (PODC), 2001.

....goes to infinity. Consequently, we can conjecture that the transmission radius rn such that the graph G(V,rn ) is k connected with high probability satisfies n#r 1) 2# . We will prove this later. Topology control for wireless ad hoc networks has draw considerable attentions recently [1, 13, 14, 15, 25, 26, 32]. Topology control methods try to maintain a structure that can be used for efficient routing or improving the overall networking performance. Li et al. 14, 15, 32] had proposed to use the Yao structure [34] on the unit disk graph for topology control without sacrificing too much on the energy ....

L. Li, J. Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In ACM PODC, 2001.

....resource in many mobile applications. In addition, topology control also impacts on contention for the medium. Collisions can be mitigated as much as possible by choosing the smallest transmission power subject to maintaining network connectivity [5] 6] Several topology control algorithms [5] [7] [9] have been proposed to create a power efficient network topology in wireless multi hop networks with limited mobility. We will summarize the existing work in Section II. Some of the algorithms require explicit propagation channel models (e.g. 9] while others incur significant message ....

....present a simulation based performance study in Section V, and conclude the paper in Section VI. II. RELATED WORK As mentioned in the previous section, several topology control algorithms have been proposed in the literature, among which the relay region and enclosure based approach [9] CBTC(#) [7], COMPOW [5] and CONNECT [8] may have received the most attention. Several broadcast multicast algorithms for ad hoc wireless networks ( 10] 11] 12] 13] 14] have also attempted to maintain some type of overlay topology, upon which a multicast tree mesh can be built. The issue of ....

[Article contains additional citation context not shown here]

L. Li, J. Y. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks," in Proc. ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, United States, Aug. 2001, pp. 264--273.

.... maximize network lifetime link state of power consumption and node battery energy bidirectional unicast flow augmentation algorithm [22] maximize network lifetime link state of power consumption and node battery energy bidirectional unicast minimum energy broadcast algorithm [18] minimize power consumption distance and direction unidirectional broadcast Table 2.1: Comparison of topology control algorithms PARO uses a packet forwarding technique where immediate nodes can be elected as redirectors on behalf of source destination pairs with the goal of reducing the ....

P. Bahl Y. M. Wang L. Li, J. Y. Halpern and R. Wattenhofer. Analysis of a Cone-based Distributed Topology Control Algorithm for Wireless Multi-hop Networks. In Proceedings of ACM PODC '01), 2001.

No context found.

Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks", ACM PODC, pp. 264-273, 2001.

No context found.

L. Li, J. Halpern, P. Bahl, Y. Wang and R. Wattenhofer. Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multihop Networks Proceedings of the Twentieth ACM Symposium on Principles of Distributed Computing (PODC), Newport, Rhode Island, August 2001.

No context found.

L. Li, J. Y. Halpern, P. Bahl, Y. M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. PODC, pages 264--273, 2001.

No context found.

L. Li, J. Halpern, P. Bahl, Y.-M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks. In ACM Symposium on Principle of Distributed Computing (PODC'01), 2001.

No context found.

L. Li, J.H. Halpern, P. Bahl, Y. Wang, and R. Wattenhofer, \ Analysis of a ConeBased Distributed Topology Control Algorithm Wireless Multi-Hop Networks ," in Proceedings of the 20thACM Symposium on Principles of Distributed Computing (PODC), 2001, pp. 404-413.

No context found.

Li Li, Joseph Y. Halpern, Paramvir Bahl, Yi-Min Wang, Roger Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks", ACM PODC, pp. 264-273, 2001.

No context found.

L. Li, J. Halpern, V. Bahl, Y.-M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In Proceedings of ACM Symposium on Principles of Distributed Computing, pages 264--273, August 2001.

No context found.

L. Li, J. Halpern, V. Bahl, Y.-M. Wang, and R. Wattenhofer. Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In Proceedings of ACM Symposium on Principles of Distributed Computing, pages 264-273, August 2001.

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