Wang, JC-P; Abolhasan, M; Franklin, DR; Safaei, F(2009)
The Optimised Link State Routing (OLSR) is a proactive routing protocol which relies on periodical broadcast of routing packets. However, due to the one-to-many relationship of broadcast traffic, the delivery of these ...
Greedy forwarding is an efficient and scalable geographic routing algorithm for wireless networks. To guarantee the success of greedy forwarding, many research efforts assign virtual coordinates to nodes to obtain a greedy ...
AlAamri, H; Abolhasan, M; Wysocki, T; Lipman, J(2010)
This paper presents a new routing discovery strategy for heterogeneous MANETs. Node heterogeneity is modeled in terms of: types and number of different interfaces, power, and transmission ranges. Our proposed route discovery ...
Wang, JC-P; Abolhasan, M; Franklin, DR; Safaei, F; Lipmant, J(2007)
Ad hoc networks typically require a significant amount of routing and control information to be distributed in a timely and reliable manner throughout the network, particularly in dynamic environments. As traffic levels ...
Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density $\rho$ and a pair of nodes separated by an Euclidean distance $x$ are directly connected with probability ...
Considering a wireless multi-hop network where a total of n nodes are randomly, independently and uniformly distributed in a unit square in R2 and each node has a uniform transmission power, a fundamental problem is to ...
In this paper, we study the giant component, the largest component containing a non-vanishing fraction of nodes, in a wireless multi-hop network where n nodes are randomly and uniformly distributed in [0, 1]d (d = 1, 2) ...
In this paper, we study transmission power to secure the connectivity of a network. Instead of requiring all nodes to be connected, we require that only a large fraction (e.g., 95%) be connected, which is called the giant ...
In this paper, we study information propagation in a 2D mobile ad-hoc network, where mobile nodes are randomly and independently distributed on a torus following a homogeneous Poisson process with a given density. Nodes ...
In this paper, we study the information propagation process in a 1-D mobile ad hoc network formed by vehicles Poissonly distributed on a highway and traveling in the same direction at randomly distributed speeds that are ...
In this paper, we study the information propagation speed in a 1D mobile ad hoc network formed by vehicles Poissonly distributed on a highway and travelling in the same direction but with random Gaussianly-distributed ...
We consider wireless multi-hop networks with a finite number of (ordinary) nodes randomly deployed in a given 2D area. A finite number of gateways (infrastructure nodes) are deterministically placed in the same area. We ...
This paper explores the performance of three packet scheduling algorithms, namely, Proportional Fair (PF) algorithm, Exponential/Proportional Fair (EXP/PF) algorithm and Maximum Largest Weighted Delay First (MLWDF), from ...
In this paper, we study the phase transition behavior of k-connectivity (k=1,2,...) in wireless multihop networks where a total of n nodes are randomly and independently distributed following a uniform distribution in the ...
Considering a wireless sensor network whose sensors are randomly and independently distributed in a bounded area according to a homogeneous Poisson process with intensity p and each sensor has a uniform transmission radius ...
Many wireless multi-hop networks are deployed with some infrastructure support. Existing results on ad-hoc networks are inadequate to fully understand the properties of those networks. In this paper, we study the properties ...
Despite intensive research in the area of network connectivity, there is an important category of problems that remain unsolved: how to measure the quality of connectivity of a wireless multi-hop network which has a realistic ...