critical-power-range-haas

critical-power-range-haas - DETERMINATION OF CRITICAL...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
DETERMINATION OF CRITICAL TRANSMISSION RANGE IN AD-HOC NETWORKS Miguel Sánchez , Pietro Manzoni Departamento de Informática de Sistemas y Computadores Universidad Politécnica de Valencia 46071 Valencia, Spain {misan, pmanzoni}@disca.upv.es Zygmunt J. Haas School of Electrical Engineering Cornell University Ithaca, NY 14853, USA [email protected] This work has been supported by Spanish grant CICYT, TAP96-1090-C04-01 and a PII-0 grant from Universidad Politecnica de Valencia . Keywords: Wireless Networks, Ad Hoc Networks, Transmission Range, Transmitter Power, Mobility Models ABSTRACT Ad-hoc networks are wireless mobile networks that do not rely on preexisting infrastructure. In such networks, multi-hop routing is used to achieve large degree of network connectivity and each node in the network acts as a router for its neighbors. The range of the radio transceivers is chosen as a trade-off between full network connectivity, the reuse of the available spectrum, and power consumption. This paper presents an algorithm to calculate the minimum transmission range of the transceivers that is required to achieve, with some probability, full network connectivity. Furthermore, we also study the effect of mobility on this value. 1. INTRODUCTION As the transmission range of the transceivers in an ad-hoc network is typically significantly smaller than the span of such networks, multi-hop routing is commonly used to achieve high degree of network connectivity. To implement multi-hop routing, any network node also acts as a router for other nodes. However, due to mobility, the wireless links are frequently broken and new links are frequently reestablished. Such dynamic network topology presents a significant challenge for the network routing algorithms. Proposals of several routing algorithms, such as DSR [6], AODV [13], ZRP[4,5], and TORA[12], have been recently published in the technical literature. In these algorithms, the routing task is performed using either a proactive or a reactive scheme, or a combination of the two, as it is done in the hybrid ZRP protocol. Ad-hoc networks can be represented as a connected graph G(v,e) , with a set of vertices v and a set of edges e . Each vertex of the set v represents a network node and each edge of the set e represents a wireless link. The total number of nodes is n=|v|. Direct connectivity between two nodes is possible only when two nodes are geographically close enough, as a transmission needs to be received at least some minimum signal level to ensure some quality of service (e.g., Bit Error Rate). In a mobile network, where relative distances between nodes change all the time depending on the propagation conditions, links are broken and new links are established continuously. In this paper, we present a method to calculate the minimum value
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 8

critical-power-range-haas - DETERMINATION OF CRITICAL...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online