A closed form network connectivity formula one-dimensional MANETs

In this paper, a closed form network connectivity formula for a one-dimensional mobile ad hoc network (MANET) is developed. Precisely, we derive the probability that a MANET is fully connected given a certain number of nodes randomly and uniformly placed along a path between a source and destination pair. This formula is particularly useful in the process of design and deployment of a MANET. The formula also provides a critical constraint function to the problem of network optimization. It formulates the relationship between the number of mobile nodes required for a particular MANET given a desired network connectivity probability. An approximation is employed to achieve the final closed form expression. The approximation is then tested by simulation to show the accuracy of our formula under practical network conditions.

[1]  John A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[2]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Paolo Santi,et al.  An evaluation of connectivity in mobile wireless ad hoc networks , 2002, Proceedings International Conference on Dependable Systems and Networks.

[4]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[5]  Bu-Sung Lee,et al.  BUSNet: Model and Usage of Regular Traffic Patterns in Mobile Ad Hoc Networks for Inter-Vehicular Communications , 2004 .

[6]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[7]  Martin Mauve,et al.  A routing strategy for vehicular ad hoc networks in city environments , 2003, IEEE IV2003 Intelligent Vehicles Symposium. Proceedings (Cat. No.03TH8683).