Related papers: Impact of Obstacles on the Degree of Mobile Ad Hoc…

Mobile Ad hoc Networks (MANETs) are dynamic networks populated by mobile stations, or mobile nodes (MNs). Specifically, MANETs consist of a collection of nodes randomly placed in a line (not necessarily straight). Mobile Ad hoc Networks do…

The coupling of scale-free networks with mobile unstructured networks is certainly unusual. In mobile networks, connections active at a given instant are constrained by the geographical distribution of mobile nodes, and by the limited…

An assumption that researchers have often used to model interference in a wireless network is the unit disk graph model. While many theoretical results and performance guarantees have been obtained under this model, an open research…

Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…

Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service (QoS) requirements can be satisfied. We…

Wireless Mesh Networks (WMNs) have evolved into a wireless communication technology of immense interest. But technological advancements in WMNs have inadvertently spawned a plethora of network performance bottlenecks, caused primarily by…

Achieving optimal transmission throughput in data networks in a multi-hop wireless networks is fundamental but hard problem. The situation is aggravated when nodes are mobile. Further, multi-rate system make the analysis of throughput more…

Mobile Ad Hoc Networks (MANETs) are formed by a collection of mobile nodes (MNs) that are capable of moving from one location to another location. These networks are widely identified by their unique characteristics such as lack of…

We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using the well-established disk graphs. The…

In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless…

This paper presents a novel stochastic geometry approach to the connectivity of milimeter wave (mmWave) networks with multi-hop relaying. The random positions and shapes of obstacles in the radio environment are modeled as a Boolean model,…

Accessibility, defined as travel impedance between spatially dispersed opportunities for activity, is one of the main determinants of public transport use. In-depth understanding of its properties is crucial for optimal public transport…

Obstacle sensing is essential for terahertz (THz) communication since the subsequent beam management can avoid THz signals blocked by the obstacles. In parallel, radio environment, which can be manifested by channel knowledge such as the…

Like other social animals and biological systems, human groups constantly exchange information. Network models provide a way of quantifying this process by representing the pathways of information propagation between individuals. Existing…

This paper develops a framework to study multi-hop relaying in a vehicular network consisting of vehicles and Road Side Units (RSUs), and the effect of this relaying on the network coverage and the communication delay. We use a stochastic…

In IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention…

In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…

Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…

This paper presents a dual method of closed-form analysis and lightweight simulation that enables an evaluation of the performance of mobile ad hoc networks that is more realistic, efficient, and accurate than those found in existing…

The interference at a wireless node s can be modelled by the number of wireless nodes whose transmission ranges cover s. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius…