On the Geometrical Characteristic of Wireless Ad-Hoc Networks and its Application in Network Performance Analysis
Authors:
- Pingyi FanPingyi Fan
- Kai CaiKCKai Cai
- K. B. LetaiefKLK. B. Letaief
- 23 April 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 6 (4) , 1256-1265
Abstract
A wireless ad-hoc network can be roughly considered as one consisting of a collection of mobile nodes distributed in a finite region, which adopts a non-centralized and self-organized structure. In such networks, messages are transmitted, received and forwarded in a finite geometrical region. In addition, the transmission of messages is highly dependent on the locations of the mobile nodes. As a result, the geometrical relationships between the nodes, and especially the distance between them are of fundamental importance. In this paper, we propose a space decomposition method to analyze the probability distribution of the distance between nodes in an ad-hoc network. In particular, we derive two theoretical expressions for the probability distribution of the distance between nodes under the assumption that the nodes are independently and uniformly distributed in either a rectangular region or hexagonal region. Further results on the node degree distribution and max-flow capacity of the network are then presented based upon these expressionsKeywords
This publication has 9 references indexed in Scilit:
- A statistical analysis of wireless connectivity in three dimensions2005
- On the Capacity of Network Coding for Random NetworksIEEE Transactions on Information Theory, 2005
- Topological Characteristics of Random Multihop Wireless NetworksCluster Computing, 2005
- Delay-Limited Throughput of Ad Hoc NetworksIEEE Transactions on Communications, 2004
- Capacity regions for wireless ad hoc networksIEEE Transactions on Wireless Communications, 2003
- Probability distributions for the number of radio transceivers which can communicate with one anotherIEEE Transactions on Communications, 2003
- Linear network codingIEEE Transactions on Information Theory, 2003
- Random Graphs2001
- Network information flowIEEE Transactions on Information Theory, 2000