Abstract
It has been shown that in a mobile ad hoc wireless network per node throughput remains constant as the number of nodes approaches infinity, when the nodes lie in a disk of unit area. However, this requires that some packets are delivered indirectly by a relay node. In this paper, we prove, in the same setup, that D(k) ∈ Θ (log k), where D(k) is the expected delay time of a mobile ad hoc wireless network with k nodes. As consequence, we have concluded that mobile ad hoc wireless networks are not scalable for real-time applications.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 281-287 |
| Number of pages | 7 |
| Journal | Wireless Communications and Mobile Computing |
| Volume | 4 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 1 2004 |
Fingerprint
Keywords
- Ad hoc wireless networks
- Brownian motion
- Delivery delay
- Packet delivery
- Throughput
ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
Logarithmic expected packet delivery delay in mobile ad hoc wireless networks. / Rio, Heberto Del; Sarkar, Dilip.
In: Wireless Communications and Mobile Computing, Vol. 4, No. 3, 01.05.2004, p. 281-287.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Logarithmic expected packet delivery delay in mobile ad hoc wireless networks
AU - Rio, Heberto Del
AU - Sarkar, Dilip
PY - 2004/5/1
Y1 - 2004/5/1
N2 - It has been shown that in a mobile ad hoc wireless network per node throughput remains constant as the number of nodes approaches infinity, when the nodes lie in a disk of unit area. However, this requires that some packets are delivered indirectly by a relay node. In this paper, we prove, in the same setup, that D(k) ∈ Θ (log k), where D(k) is the expected delay time of a mobile ad hoc wireless network with k nodes. As consequence, we have concluded that mobile ad hoc wireless networks are not scalable for real-time applications.
AB - It has been shown that in a mobile ad hoc wireless network per node throughput remains constant as the number of nodes approaches infinity, when the nodes lie in a disk of unit area. However, this requires that some packets are delivered indirectly by a relay node. In this paper, we prove, in the same setup, that D(k) ∈ Θ (log k), where D(k) is the expected delay time of a mobile ad hoc wireless network with k nodes. As consequence, we have concluded that mobile ad hoc wireless networks are not scalable for real-time applications.
KW - Ad hoc wireless networks
KW - Brownian motion
KW - Delivery delay
KW - Packet delivery
KW - Throughput
UR - http://www.scopus.com/inward/record.url?scp=13244251160&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=13244251160&partnerID=8YFLogxK
U2 - 10.1002/wcm.218
DO - 10.1002/wcm.218
M3 - Article
AN - SCOPUS:13244251160
VL - 4
SP - 281
EP - 287
JO - Wireless Communications and Mobile Computing
JF - Wireless Communications and Mobile Computing
SN - 1530-8669
IS - 3
ER -