Related papers: The Distance Distribution between Mobile Node and …
Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Location theory has been the traditional, centralized approach to study content…
Localizing mobile robotic nodes in indoor and GPS-denied environments is a complex problem, particularly in dynamic, unstructured scenarios where traditional cameras and LIDAR-based sensing and localization modalities may fail.…
In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on $k$. Our earlier algorithm of the construction of the…
Recent advances in data collection and technology enable a deeper understanding of complex urban commuting, yet few studies have rigorously analyzed the temporal stability and Origin-Destination (OD) heterogeneity of route choice. To…
Distribution comparison plays a central role in many machine learning tasks like data classification and generative modeling. In this study, we propose a novel metric, called Hilbert curve projection (HCP) distance, to measure the distance…
Ad hoc mobile scenarios desire a lightweight routing protocol to propagate rapidly changing data reachability information in a highly dynamic environment. We are developing a distance-vector routing protocol that enables each node to…
This paper considers a network of stochastic evidence accumulators, each represented by a drift-diffusion model accruing evidence towards a decision in continuous time by observing a noisy signal and by exchanging information with other…
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…
We propose a simple stochastic model describing the position-dependent ball-passing network in football games. In this network, a player on a certain area in the divided fields is a node, and a pass between two nodes corresponds to an edge.…
The vivid success of the emerging wireless sensor technology (WSN) gave rise to the notion of localization in the communications field. Indeed, the interest in localization grew further with the proliferation of the wireless sensor network…
In this paper, an efficient deployment strategy is proposed for a network of mobile and static sensors with nonidentical sensing and communication radii. The multiplicatively weighted Voronoi (MW-Voronoi) diagram is used to partition the…
Distributed resource allocation is a central task in network systems such as smart grids, water distribution networks, and urban transportation systems. When solving such problems in practice it is often important to have nonasymptotic…
We study a simple model in which the growth of a network is determined by the location of one or more random walkers. Depending on walker speed, the model generates a spectrum of structures situated between well-known limiting cases. We…
This work analyzes fractional continuous-time random walks on two-layer multiplexes. A node-centric dynamics is used, in which it is assumed a Poisson distribution of a walker to become active, while a jump to one of its neighbors depends…
A distributed data collection algorithm to accurately store and forward information obtained by wireless sensor networks is proposed. The proposed algorithm does not depend on the sensor network topology, routing tables, or geographic…
In this paper, we propose a selection region based multihop routing protocol with directional antennas for wireless mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and the beamwidth of…
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently gained popularity in machine learning and statistics, as it makes feasible the use of smoothed optimal transportation distances for data…
Molecular Communications via Diffusion (MCvD) is a promising paradigm which enables nano-machines to communicate with each other. However, the reliability of existing systems degrade rapidly as the distance between the transmitters and the…
We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…
Today in fast technology development in wireless mobile adhoc network there is vast scope for research. As it is known that wireless communication for mobile network has many application areas like routing services, security services etc.…