Results 1 - 10 of 1,585

Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks

by Nabhendra Bisnik, Alhussein Abouzeid , 2006
"... 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, th ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
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

1 Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks

by Nabhendra Bisnik, Alhussein Abouzeid
"... 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 ..."
Abstract - Add to MetaCart
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

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

by Nabhendra Bisnik, Alhussein A. Abouzeid - Ad Hoc Netw , 2009
"... In this paper we analyze 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 loca ..."
Abstract - Cited by 32 (6 self) - Add to MetaCart
In this paper we analyze 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

1 Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks

by Nabhendra Bisnik, Alhussein Abouzeid
"... 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 ..."
Abstract - Add to MetaCart
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

Queuing Network Models for Delay Analysis of 1 Multihop Wireless Ad Hoc Networks ∗

by Nabhendra Bisnik, Alhussein Abouzeid
"... 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, th ..."
Abstract - Add to MetaCart
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

Achieving 100% Throughput in an Input-Queued Switch

by Nick McKeown, Adisak Mekkittikul, Venkat Anantharam, Jean Walrand - IEEE TRANSACTIONS ON COMMUNICATIONS , 1996
"... It is well known that head-of-line (HOL) blocking limits the throughput of an input-queued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if non-FIFO queueing policies are used, the throughput can be increas ..."
Abstract - Cited by 527 (27 self) - Add to MetaCart
be increased. However, it has not been previously shown that if a suitable queueing policy and scheduling algorithm are used then it is possible to achieve 100% throughput for all independent arrival processes. In this paper we prove this to be the case using a simple linear programming argument

Delay and Throughput in Random Access Wireless Mesh Networks

by Nabhendra Bisnik, Alhussein Abouzeid
"... The wireless mesh networks (WMNs) are emerging as a popular means of providing connectivity to communities in both affluent and poor parts of the world. The presence of backbone mesh routers and the use of multiple channels and interfaces allow mesh networks to have better capacity than infrastructu ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
, the degree of locality of traffic and the collision avoidance mechanism of random access MAC. The diffusion approximation method is used to obtain closed form expressions for end-to-end packet delay and maximum achievable per-node throughput. The analytical results indicate that how the performance of WMNs

Modeling and Analysis of End-To-End Delay for Ad hoc Pervasive Multimedia Network

by Kamal Kumar Sharma, Hemant Sharma, A. K. Ramani - Proceedings of the International MultiConference of Engineers and Computer Scientists 2010
"... Abstract — A primary challenge in mobile ad hoc network scenario is the dynamic differentiation of provided levels of Quality of Service (QoS) depending on client characteristics and current resource availability. In this context the paper focuses on characterizing the average end-to-end delay and m ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
and maximum achievable per-node throughput for In-vehicle ad hoc multimedia network with stationary and mobile nodes. This work considers an approximation for the expected end-to-end packet delay based on the assumption that the traffic at each link acts as an independent M/D/1 queue. The paper establishes

Mobility increases the capacity of ad-hoc wireless networks

by Matthias Grossglauser, David Tse - IEEE/ACM TRANSACTIONS ON NETWORKING , 2002
"... The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughpu ..."
Abstract - Cited by 1220 (5 self) - Add to MetaCart
-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery. Under this assumption, the per-user throughput can increase dramatically when nodes are mobile rather than fixed. This improvement can be achieved by exploiting node mobility as a

Wireless mesh network.

by Nabhendra Bisnik, Alhussein Abouzeid
"... Abstract — Wireless mesh networks (WMNs) are emerging as a popular means of providing connectivity to communities in both affluent and poor parts of the world. The presence of backbone mesh routers and the use of multiple channels and interfaces allow mesh networks to have better capacity than infra ..."
Abstract - Add to MetaCart
, the random packet arrival process, the degree of locality of traffic and the collision avoidance mechanism of random access MAC. The diffusion approximation method is used to obtain closed form expressions for (a) end-to-end packet delay and (b) maximum achievable per-node throughput. The analytical results
Results 1 - 10 of 1,585