## A Case for Variable-Range Transmission Power (2004)

### Cached

### Download Links

Venue: | Control in Wireless Multihop Networks,” Proc. IEEE INFOCOM |

Citations: | 47 - 2 self |

### BibTeX

@INPROCEEDINGS{Gomez04acase,

author = {Javier Gomez and Andrew T. Campbell},

title = {A Case for Variable-Range Transmission Power},

booktitle = {Control in Wireless Multihop Networks,” Proc. IEEE INFOCOM},

year = {2004}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract—In this paper, we investigate the impact of variable-range transmission power control on the physical and network connectivity, on network capacity, and on power savings in wireless multihop networks. First, using previous work by Steele [18], we show that, for a path attenuation factor 2, the average range of links in a planar random network of Am2 having n nodes is c ffiffiffi p A n 1. We show that this average range is approximately half the range obtained when common-range transmission control is used. Combining this result and previous work by Gupta and Kumar [8], we derive an expression for the average traffic carrying capacity of variable-range-based multihop networks. For 2, we show that this capacity remains constant even when more nodes are added to the network. Second, we derive a model that approximates the signaling overhead of a routing protocol as a function of the transmission range and node mobility for both route discovery and route maintenance. We show that there is an optimum setting for the transmission range, not necessarily the minimum, which maximizes the capacity available to nodes in the presence of node mobility. The results presented in this paper highlight the need to design future MAC and routing protocols for wireless ad hoc and sensor networks based, not on common-range which is prevalent today, but on variable-range power control. Index Terms—Multihop networks, ad hoc networks, traffic capacity, network connectivity, power savings. Ç 1

### Citations

754 |
The Dynamic Source Routing Protocol for Mobile Ad hoc
- Maltz, Broch
- 1999
(Show Context)
Citation Context ... 20 CBR connections among the 50 nodes. Each CBR connection transmits four packets (512 bytes long) per second for the 900-second simulation scenario. We use the Dynamic Source Routing (DSR) protocol =-=[9]-=-. The mobility model in the simulator works in the following way: A node randomly selects a destination point within the network limits and then moves toward that point at a speed selected uniformly b... |

547 | Minimum energy mobile wireless networks
- Rodoplu, Meng
- 1999
(Show Context)
Citation Context ...s a different method for discovering and maintaining routes that departs from common transmission range broadcast technique is used. Recently, there has been some initial work in this area [5], [14], =-=[15]-=- that provides variablerange transmission support for routing protocol operation. Most ad hoc network designs simply borrow MAC protocols designed for wireless LAN operation. IEEE 802.11, as well as m... |

531 | Topology control of multihop wireless networks using transmit power adjustment
- Ramanathan, Hain
- 2000
(Show Context)
Citation Context ...sparse with the risk of having network partitions. For other nodes, the topology will be too dense, resulting in many nodes competing for transmission in a shared medium. This problem is discussed in =-=[14]-=-, where the authors propose a method to control the transmission power levels in order to control the network topology (e.g., to avoid a topology that is either too sparse or too dense). The work in [... |

184 |
Telecommunication Networks: Protocols, Modelling and Anaylsis
- Schwartz
- 1998
(Show Context)
Citation Context ...he connectivity of the network. Routing protocols can take advantage of fully connected networks to provide multiple routes for a given source-destination pair in cases where some nodes or links fail =-=[16]-=-. However, this goal is achieved at the expense of reducing network capacity and energy-savings. In addition, power control impacts the signaling overhead of routing protocols used in mobile wireless ... |

95 | Critical power for asymptotic connectivity
- Gupta, Kumar
- 1998
(Show Context)
Citation Context ...bitrarily reduce the transmission power to any value to promote a higher capacity and energy savings. Rather, there is a minimum bound for the transmission power necessary to avoid network partitions =-=[7]-=-. In [7], the authors assume that all nodes use the same common transmission power. This power is varied until a connected tree is constructed. In this paper, we consider the use of variable-range tra... |

90 | Opportunity-based topology control in wireless sensor networks
- Liu, Ni
- 2010
(Show Context)
Citation Context ...otocols [10] usually assume homogeneously distributed nodes. As discussed earlier, such a regime raises a number of concerns and is an impractical assumption in real networks. The authors in [14] and =-=[19]-=- discuss this problem and propose different methods to control the transmission power levels in order to control the network topology. The work in [14] and [19] is concerned with controlling the conne... |

75 |
Growth rates of Euclidean minimal spanning trees with power weighted edges
- Steele
- 1988
(Show Context)
Citation Context ...ct of variable-range transmission power control on the physical and network connectivity, on network capacity, and on power savings in wireless multihop networks. First, using previous work by Steele =-=[18]-=-, we show that, for a path attenuation factor 2, the average range of links in a planar random network of Am2 having n nodes is c ffiffiffi p A n 1 . We show that this average range is approximately... |

64 |
On the value of a random minimum spanning tree problem
- Frieze
- 1985
(Show Context)
Citation Context ... ß 2007 IEEE Published by the IEEE CS, CASS, ComSoc, IES, & SPS88 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 6, NO. 1, JANUARY 2007 control to allow nodes to construct a minimum spanning tree (MST) =-=[4]-=-. We show that the use of a minimum spanning tree can lead toward a lower total weight than a tree based on common-range transmission links that minimally avoids network partitions. The type of power ... |

64 |
Power Aware Routing
- Singh, Woo, et al.
- 1998
(Show Context)
Citation Context ...s, but it does not provide a mathematical description of the problem space and ignores the power savings and trafficcarrying capacity aspects of the problem. We address these issues in this paper. In =-=[17]-=-, the authors present several link cost functions that take into account the power reserves of mobile nodes. The work in [5], [15] intuitively suggests that a variablerange transmission approach can o... |

26 |
et al., “Capacity of ad hoc wireless networks
- Li
- 2001
(Show Context)
Citation Context ...inimum spanning tree [18]. In the work described in [1], the authors discuss the impact on TCP throughput on the number of forwarding nodes in static wireless ad hoc networks for unreliable links. In =-=[3]-=-, the authors study the throughput capacity of wireless multihop networks for UDP traffic. Systems based on common-range transmission control like MANET protocols [10] usually assume homogeneously dis... |

18 |
Conserving Transmission Power
- Gomez, Campbell, et al.
- 2001
(Show Context)
Citation Context ...“no,” unless a different method for discovering and maintaining routes that departs from common transmission range broadcast technique is used. Recently, there has been some initial work in this area =-=[5]-=-, [14], [15] that provides variablerange transmission support for routing protocol operation. Most ad hoc network designs simply borrow MAC protocols designed for wireless LAN operation. IEEE 802.11, ... |

13 |
Energy efficiency and throughput for TCP traffic in multihop wireless networks
- Ali, Gupta, et al.
- 2002
(Show Context)
Citation Context ...ses traditional graph theory. In particular, we used the theory explaining the behavior of minimum spanning trees (MST) to compute the weight of a minimum spanning tree [18]. In the work described in =-=[1]-=-, the authors discuss the impact on TCP throughput on the number of forwarding nodes in static wireless ad hoc networks for unreliable links. In [3], the authors study the throughput capacity of wirel... |

3 |
The Capacity of Wireelss Networks
- Gupta, Kumar
(Show Context)
Citation Context ...ffiffiffi p A n 1 . We show that this average range is approximately half the range obtained when common-range transmission control is used. Combining this result and previous work by Gupta and Kumar =-=[8]-=-, we derive an expression for the average traffic carrying capacity of variable-range-based multihop networks. For 2, we show that this capacity remains constant even when more nodes are added to th... |

2 |
Mobile Ad-Hoc Network Working Group, http:// www.ietf.org/html.charters/manet-charter.html
- MANET
- 2006
(Show Context)
Citation Context ...ing minimal signaling and taking into account the power reserves distributed in wireless networks. Existing routing protocols discussed in the mobile ad hoc networks (MANET) working group of the IETF =-=[10]-=- are designed to discover routes using flooding techniques at common-range maximum transmission power. These protocols are optimized to minimize the number of hops between source-destination pairs, pr... |