PANCHAPAKESAN , P., AND MANJUNATH, D. On the transmission range in dense ad hoc radio networks. In Proc. IEEE SPCOM 2001 (2001).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....will be unable to send information to the observer. Connectivity in wireless networks has been extensively studied in the past. In many cases, the focus has been on asymptotic results in the number of nodes. In this direction, important results have been proved in [8] and more recently in [12] and [3] with di#erent problem statements. In [8] n nodes are assumed to be distributed independently and uniformly over a disc of unit area in . Each node can communicate with other nodes within radius 34 r. In this scenario, where #r = ln n c(n) n, 3.1) the network is connected ....

....with other nodes within radius 34 r. In this scenario, where #r = ln n c(n) n, 3.1) the network is connected with unit probability if and only if lim n # # c(n) # #. This result serves as a useful guideline for choosing the transmission range in dense 2 D wireless networks. In [12] also, n nodes are assumed to be distributed independently and uniformly but over a unit square in , and it is shown that the asymptotic probability of having isolated nodes goes to zero as r ln n . The result rea#rms the conclusions drawn in [8] but the approach is di#erent and borrows ....

[Article contains additional citation context not shown here]

P. Panchapakesan and D. Manjunath. On the transmission range in dense ad hoc radio networks. In Signal Processing and Communications Conference, Bangalore, July 2001.

....is a straightforward consequence of the first condition, since otherwise the probability of connectedness would be negligible. Theorem 2 specifies the values of the multiplicative constant which are su#cient to ensure a.a.s. connectedness, and is a generalization of the results presented in [10, 16, 17, 18], where similar evaluations for the case of n nodes distributed in a region of constant side, or under the assumption that nodes are distributed in R with a given Poisson density #, are performed. We are now ready to evaluate the value of h in the statement of Theorem 1. Given the result of ....

P. Panchapakesan and D. Manjunath. On the transmission range in dense ad hoc radio networks. In Proc. IEEE SPCOM 2001.

....community in recent years. However, due to their complex and unstructured nature, very few analytical results describing their fundamental properties have been derived. Among them, the most notable concern the connectivity and coverage problems for stationary networks, which have been analyzed in [11, 21, 24, 25]. A common assumption in these studies is that nodes are distributed in a given area according to a probability distribution; the value of the node transmitting range ensuring a connected network (or coverage of the deployment area) with high probability is then derived. Another important ....

....hoc networks. In fact, the length of the longest nearest neighbor edge is a lower bound to the critical transmitting range , while the length of the longest edge in the MST is exactly the critical transmitting range [7, 22] The critical transmitting range in ad hoc networks has been studied in [11, 21, 25]. The total edge length of the MST is closely related to the cost of the optimal transmitting range assignment [5, 14] while the Voronoi diagram and Delaunay triangulation, or derivation of these graphs, are used to construct spanners for power ecient routing [8] and in the evaluation of sensor ....

P. Panchapakesan, D. Manjunath, \On the Transmission Range in Dense Ad Hoc Radio Networks", Proc. IEEE SPCOM 2001.

....must have the same transmitting range r, was also investigated. We call this problem the homogeneous range assignment problem (HRA) The value of r ensuring connectivity with high probability when nodes are distributed in a given region according to some probability distribution was derived in [4, 14, 20, 21, 22, 27]. In this paper, we consider RA with the constraint that the range assignment be symmetric, i.e. such that edge (u; v) is in G if and only if (v; u) is in G. We call this problem the symmetric range assignment problem (SRA) We will also investigate a weaker version of the problem, called weak ....

....c WS = n ) The bound stated in Theorem 3 can be used to compare the magnitude of c WS with the optimal cost of di erent versions of the range assignment problem in case of random instance. In the following discussion we assume = d = 2, since most of existing bounds are for this case. In [20] it is shown that for homogeneous range assignments, the communication graph is connected with high probability if and only if r = q log n ) Hence, c HR = log n) When the diameter of the communication graph must be at most h, for some positive constant h, the cost of the optimal ....

P. Panchapakesan, D. Manjunath, \On the Transmission Range in Dense Ad Hoc Radio Networks", Proc. IEEE SPCOM 2001.

No context found.

PANCHAPAKESAN , P., AND MANJUNATH, D. On the transmission range in dense ad hoc radio networks. In Proc. IEEE SPCOM 2001 (2001).

No context found.

P. Panchapakesan, D. Manjunath, On the Transmission Range in Dense Ad Hoc Radio Networks. In Proceedings of IEEE SPCOM'01. 2001.

No context found.

P. Panchapakesan and D. Manjunath, On the transmission range in dense ad hoc radio networks, in Proc. of SPCOM, Bangalore, India, 2001.

No context found.

P. Panchapakesan, D. Manjunath, \On the Transmission Range in Dense Ad Hoc Radio Networks", Proc. IEEE SPCOM 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