Queuing network models for delay analysis of multihop wireless ad hoc networks

Abstract

Abstract-In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes. We present an analytical model that takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC. We model random access multihop wireless networks as open G/G/1 queuing networks and use the diffusion approximation in order to evaluate closed form expressions for the average end-to-end delay. The mean service time of nodes is evaluated and used to obtain the maximum achievable per-node throughput. The analytical results obtained here from the queuing network analysis are discussed with regard to similarities and differences from the well established information-theoretic results on throughput and delay scaling laws in ad hoc networks. We perform extensive simulations and verify that the analytical results closely match the results obtained from simulations.

Performance analysis of ALOHA and p-persistent ALOHA for multi-hop underwater acoustic sensor networks

“…MAC Design efforts for UASNs cover the spectrum of techniques employed by wireless networks, to include channel allocation [2,15], carrier-sense techniques [16], adaptive reservation-based protocols [17,19], and topology-aware protocols [18]. Each of these designs seems to offer certain advantages for specific UASN issues.…”

“…However, it provides a useful means for considering the impact of back-off and retransmission issues. Bisnik provides an analysis of the end-to-end delay for collision avoidance schemes in multi-hop ad hoc wireless networks [16]. The results underscore the importance of the traffic pattern and average hop-count with respect to the network throughput and delays.…”

“…The model considers the relationship between the locality of traffic and the maximum achievable throughput. For a UASN, as considered in this paper, all traffic is destined for the gateway, thus locality is low, for which [16] suggests the throughput will be low as compared to networks where traffic tends to be localized.…”

“…16 and Motorola's ITT MeshNET as market competitors for wireless metropolitan area networking deployments serve to illustrate the utility of reservation-based protocols. However, their applicability to UASNs is severely constrained by the UASN environment.…”

Untitled

“…For example, Sheu et al [19] compared and calculated end-to-end delays on different network sizes and a number of layers of IDGP protocol and DDGP protocol, but the number of network nodes was smaller, which did not require pre-selection paths. Bisnik et al [20] modeled random access multi-hop wireless networks as open G/G/1 queueing networks and used the diffusion approximation in order to evaluate closed form expressions for the average end-to-end delay, but it did not involve path planning. This paper presents a path delay analysis method based on queueing network modeling of large-scale WSNs, which can be used e.g.…”