Related papers: Throughput and Delay Analysis of Wireless Random A…
We study the estimation of distance d between two wireless nodes by means of their wideband channels to a third node, called observer. The motivating principle is that the channel impulse responses are similar for small d and drift apart…
It has been well established that wireless network coding can significantly improve the efficiency of multi-hop wireless networks. However, in a stochastic environment some of the packets might not have coding pairs, which limits the number…
Packet transmission scheduling on multi-hop wireless sensor networks with 3-egress gateway linear topology is studied. Each node generates a data packet in every one cycle period and forwards it bounded for either of gateways at edges. We…
This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…
Wireless energy transferring technology offers a constant and instantaneous power for low-power applications such as Internet of Things (IoT) to become an affordable reality. This paper considers simultaneous wireless information and power…
This article examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless environments is considered where errors are caused by a discrete channel…
In this work, we consider the case where a source with bursty traffic can adjust the transmission duration in order to increase the reliability. The source is equipped with a queue in order to store the arriving packets. We model the system…
We study the scheduling polices for asymptotically optimal delay in queueing systems with switching overhead. Such systems consist of a single server that serves multiple queues, and some capacity is lost whenever the server switches to…
In this paper, we investigate the delay-throughput trade-offs in mobile ad-hoc networks under two-dimensional i.i.d. mobility models. We consider two mobility time-scales: (i) Fast mobility where node mobility is at the same time-scale as…
In this paper we provide a performance analysis framework for wireless industrial networks by deriving a service curve and a bound on the delay violation probability. For this purpose we use the (min,x) stochastic network calculus as well…
Channel idle time distribution based secondary transmission strategies have been studied intensively in the literature. Under various performance metrics, the ultimate performance of secondary devices are eventually dictated by the presumed…
To ensure seamless communication in wireless multi-hop networks, certain classes of routing protocols are defined. This vary paper, is based upon proactive routing protocols for Wireless multihop networks. Initially, we discuss Destination…
We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that the network's ability to meet hard throughput and deadline…
This paper considers peer-to-peer scheduling for a network with multiple wireless devices. A subset of the devices are mobile users that desire specific files. Each user may already have certain popular files in its cache. The remaining…
Consider a static wireless network that has two tiers with different priorities: a primary tier vs. a secondary tier. The primary tier consists of randomly distributed legacy nodes of density $n$, which have an absolute priority to access…
Network densification is one of key technologies in future networks to significantly increase network capacity. The gain obtained by network densification for fixed terminals have been studied and proved. However for mobility users, there…
We consider multiclass feedforward queueing networks with first in first out and priority service disciplines at the nodes, and class dependent deterministic routing between nodes. The random behavior of the network is constructed from…
Franceschetti et al. have recently shown that per-node throughput in an extended, ad hoc wireless network with $\Theta(n)$ randomly distributed nodes and multihop routing can be increased from the $\Omega({1 \over \sqrt{n} \log n})$ scaling…
In this paper, we present analytical study of routing overhead of reactive routing protocols for Wireless Multihop Networks (WMhNs). To accomplish the framework of generalized routing overhead, we choose Ad-Hoc on Demand Distance Vector…
Wireless networks are characterized by a dynamic topology triggered by the nodes mobility. Thus, the wireless multi-hops connection and the channel do not have a determinist behaviour such as: interference or multiple paths. Moreover, the…