ABSTRACT
In previous work, the effects of randomized beamforming, i.e., the strategy of every node in a wireless multihop network directing its antenna in a randomly chosen direction, on connectivity are studied by simulation. In this paper, we study some such effects analytically under similar but slightly simplified modeling assumptions. We begin by generalizing the notion of the threshold range for k-connectivity from the traditional Boolean network model to networks with arbitrary link attenuations. Then, for a network of uniformly distributed nodes with randomized beamforming, we derive analytically and evaluate numerically the degree distribution of a random node. Based on this, we apply a commonly used approximation to the probability that such a network is k-connected.We find that because the randomness caused by this strategy in the link attenuations shifts the network topology from being strictly a geometric random graph towards being a pure random graph, the k-connectivity probability of a network applying randomized beamforming can be approximated more accurately than that of a network with omnidirectional antennas. This added randomness also manifests itself as the increased variance of the node degree and the threshold attenuation range for k-connectivity. The main conclusion from our findings is that randomized beamforming cannot be said to strictly improve -- nor to degrade -- the connectivity of random wireless multihop networks.
- C. A. Balanis. Antenna theory. John Wiley & Sons, Inc., New York (NY), second edition, 1997.Google Scholar
- C. Bettstetter. On the connectivity of ad hoc networks. The Computer Journal, Special Issue on Mobile and Pervasive Computing, 47(4):432--447, 2004.Google Scholar
- C. Bettstetter, C. Hartmann, and C. Moser. How does randomized beamforming improve the connectivity of ad hoc networks? In Proceedings of IEEE International Conference on Communications (ICC), volume 5, pages 3380--3385, May 2005.Google ScholarCross Ref
- P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388--404, Mar. 2000. Google ScholarDigital Library
- R. Hekmat and P. V. Mieghem. Study of connectivity in wireless ad hoc network with an improved radio model. In Proceedings of the 2nd Workshop on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt'04), Mar. 2004.Google Scholar
- H. Koskinen. A simulation-based method for predicting connectivity in wireless multihop networks. Telecommunication Systems, 26(2-4):321--338, June 2004.Google ScholarDigital Library
- P. Lassila, E. Hyytiä, and H. Koskinen. Challenges in Ad Hoc Networking: Fourth Annual Mediterranean Ad Hoc Networking Workshop, June 21-24, 2005, Île de Porquerolles, France, volume 197 of IFIP International Federation for Information Processing, chapter Connectivity properties of Random Waypoint mobility model for ad hoc networks, pages 159--168. Springer, Boston, Jan. 2006.Google Scholar
- M. D. Penrose. The longest edge of the random minimal spanning tree. Annals of Applied Probability, 7(2):340--361, 1997.Google ScholarCross Ref
- A. Spyropoulos and C. Raghavendra. Asympotic capacity bounds for ad-hoc networks revisited: the directional and smart antenna cases. In Proceedings of IEEE Global Telecommunications Conference (GLOBECOM), volume 3, pages 1216--1220, Dec. 2003.Google ScholarCross Ref
- A. Spyropoulos and C. Raghavendra. Capacity bounds for ad-hoc networks using directional antennas. In Proceedings of IEEE International Conference on Communications (ICC), volume 1, pages 348--352, May 2003.Google ScholarCross Ref
- R. Vilzmann, C. Bettstetter, D. Medina, and C. Hartmann. Hop distances and flooding in wireless multihop networks with randomized beamforming. In MSWiM '05: Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems, pages 20--27, New York, NY, USA, 2005. ACM Press. Google ScholarDigital Library
- S. Yi, Y. Pei, and S. Kalyanaraman. On the capacity improvement of ad hoc wireless networks using directional antennas. In MobiHoc '03: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, pages 108--116, New York, NY, USA, 2003. ACM Press. Google ScholarDigital Library
Index Terms
Analytical study of connectivity in wireless multihop networks utilizing beamforming
Recommendations
Hop distances and flooding in wireless multihop networks with randomized beamforming
MSWiM '05: Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systemsWe show that randomized beamforming is a simple yet efficient communication strategy in wireless multihop networks if no neighbor location information is at hand. Already small antenna arrays reduce the hop distance between nodes and speed up the ...
On-demand multicast routing protocol in multihop wireless mobile networks
An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge ...
Connectivity of wireless multihop networks in a shadow fading environment
MSWIM '03: Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systemsThis paper investigates the connectivity of wireless multihop networks in a log--normal shadow fading environment. Assuming a spatial Poisson distribution of the network nodes, we derive (a) a closed--form expression for the probability that a node is ...
Comments