On the geometrical characteristic of wireless ad-hoc networks and its application in network performance analysis

Pingyi Fan, Guansheng Li, Kai Cai, Khaled Letaief

Research output: Contribution to journalArticle

20 Citations (Scopus)

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 expressions.

Original languageEnglish
Pages (from-to)1256-1264
Number of pages9
JournalIEEE Transactions on Wireless Communications
Volume6
Issue number4
DOIs
Publication statusPublished - Apr 2007
Externally publishedYes

Fingerprint

Wireless Ad Hoc Networks
Wireless ad hoc networks
Network Analysis
Network Performance
Network performance
Probability distributions
Performance Analysis
Vertex of a graph
Ad hoc networks
Decomposition
Probability Distribution
Degree Distribution
Ad Hoc Networks
Decomposition Method
Hexagon
Dependent

Keywords

  • Maximum flow
  • Network capacity
  • Network coding
  • Node degree
  • Probability distribution of distance
  • Wireless ad-hoc network

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

On the geometrical characteristic of wireless ad-hoc networks and its application in network performance analysis. / Fan, Pingyi; Li, Guansheng; Cai, Kai; Letaief, Khaled.

In: IEEE Transactions on Wireless Communications, Vol. 6, No. 4, 04.2007, p. 1256-1264.

Research output: Contribution to journalArticle

@article{9e065025a0194b21ab9d3df1df776c3f,
title = "On the geometrical characteristic of wireless ad-hoc networks and its application in network performance analysis",
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 expressions.",
keywords = "Maximum flow, Network capacity, Network coding, Node degree, Probability distribution of distance, Wireless ad-hoc network",
author = "Pingyi Fan and Guansheng Li and Kai Cai and Khaled Letaief",
year = "2007",
month = "4",
doi = "10.1109/TWC.2007.348322",
language = "English",
volume = "6",
pages = "1256--1264",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - On the geometrical characteristic of wireless ad-hoc networks and its application in network performance analysis

AU - Fan, Pingyi

AU - Li, Guansheng

AU - Cai, Kai

AU - Letaief, Khaled

PY - 2007/4

Y1 - 2007/4

N2 - 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 expressions.

AB - 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 expressions.

KW - Maximum flow

KW - Network capacity

KW - Network coding

KW - Node degree

KW - Probability distribution of distance

KW - Wireless ad-hoc network

UR - http://www.scopus.com/inward/record.url?scp=34247385083&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247385083&partnerID=8YFLogxK

U2 - 10.1109/TWC.2007.348322

DO - 10.1109/TWC.2007.348322

M3 - Article

AN - SCOPUS:34247385083

VL - 6

SP - 1256

EP - 1264

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 4

ER -