The Experts below are selected from a list of 66 Experts worldwide ranked by ideXlab platform
Jorma Virtamo - One of the best experts on this subject based on the ideXlab platform.
-
on load balancing in a dense Wireless Multihop Network
Next Generation Internet, 2006Co-Authors: Esa Hyytia, Jorma VirtamoAbstract:We study the load balancing problem in a dense Wireless Multihop Network, where a typical path consists of large number of hops, i.e., the spatial scales of a typical distance between source and destination, and mean distance between the neighboring nodes are strongly separated. In this limit, we present a general framework for analyzing the traffic load resulting from a given set of paths and traffic demands. We formulate the load balancing problem as a minmax problem and give two lower bounds for the achievable minimal maximum traffic load. The framework is illustrated by an example of uniformly distributed traffic demands in a unit disk with a few families of paths given in advance. With these paths we are able to decrease the maximum traffic load by factor of 33-40% depending on the assumptions. The obtained traffic load level also comes quite near the tightest lower bound.
-
probability of successful transmission in a random slotted aloha Wireless Multihop Network employing constant transmission power
Modeling Analysis and Simulation of Wireless and Mobile Systems, 2005Co-Authors: Henri Koskinen, Jorma VirtamoAbstract:In [3], it was shown that the optimal throughput scaling in Wireless Multihop Networks is achieved using slotted Aloha, and quantitative performance results for this protocol were derived under the assumption of exponentially distributed transmission powers. In this paper, we extend the analysis of this MAC scheme: assuming that all nodes employ some common constant power, we evaluate the probability of successful transmission in a random time slot. When interfering nodes are assumed to be randomly located, this temporal probability is a random variable with its own distribution. We develop numerical approximations for evaluating both the mean and the tail probability of this distribution; as far as we are aware, the distribution itself has not been studied before. The accuracy of our approximations can be improved indefinitely, with the cost of added numerical computations. We validate the approximations against simulation results.
Esa Hyytia - One of the best experts on this subject based on the ideXlab platform.
-
on load balancing in a dense Wireless Multihop Network
Next Generation Internet, 2006Co-Authors: Esa Hyytia, Jorma VirtamoAbstract:We study the load balancing problem in a dense Wireless Multihop Network, where a typical path consists of large number of hops, i.e., the spatial scales of a typical distance between source and destination, and mean distance between the neighboring nodes are strongly separated. In this limit, we present a general framework for analyzing the traffic load resulting from a given set of paths and traffic demands. We formulate the load balancing problem as a minmax problem and give two lower bounds for the achievable minimal maximum traffic load. The framework is illustrated by an example of uniformly distributed traffic demands in a unit disk with a few families of paths given in advance. With these paths we are able to decrease the maximum traffic load by factor of 33-40% depending on the assumptions. The obtained traffic load level also comes quite near the tightest lower bound.
-
traffic load in a dense Wireless Multihop Network
Performance Evaluation of Wireless Ad Hoc Sensor and Ubiquitous Networks, 2005Co-Authors: Esa Hyytia, Pasi Lassila, Aleksi Penttinen, Janos RoszikAbstract:In Wireless Multihop Networks each node acts as a relay for the other nodes. Consequently, the distribution of the traffic load has a strong spatial dependence. We consider a dense Multihop Network where the routes are approximately straight line segments. To this end we introduce the so-called line segment traversing process which defines the movement of points in a given region. In particular, the points move along the line segments with a spatial velocity which depends on the current location of the point. We use this process to model the movement of packets and utilise its properties to study the relayed traffic load which corresponds to the traffic load experienced by a node in a given location, and to study the queueing delays as a function of the location using the spatial velocity of the line segment process. The efficiency of a Wireless Multihop Network depends significantly on the used MAC protocol, which then has an impact on queueing delays in a congested Network. Our model can be adapted to any given MAC protocol by a proper choice of the spatial velocity. Additionally, from the model we also obtain an expression for the mean one-way delay in the Network, which is itself an important performance measure of the Network. Finally, we use ns2-simulations to validate some of the key ideas, along with several numerical examples illustrating the effects of MAC protocols on the mean end-to-end delay and power (ratio of throughtput to mean delay).
Sk Md Mizanur Rahman - One of the best experts on this subject based on the ideXlab platform.
-
A software defined Network routing in Wireless Multihop Network
Journal of Network and Computer Applications, 2017Co-Authors: Junfeng Wang, Yiming Miao, M. Shamim Hossain, Ping Zhou, Sk Md Mizanur RahmanAbstract:SDN has been touted as one of the most promising solutions for future Internet with the innovative design ideas that the control plane is logically centralized and decoupled from the data plane. Current research on SDN mainly focuses on wired Network and data center, while software-defined Wireless multi-hop Network is put forth in a few researches, but only at stage of putting forth models and concepts. In this paper, we propose a novel routing protocol applied SDN in Wireless multi-hop Network. The implementation of the protocol is given in detail, and OPNET is used to build the model and carry on the simulation experiment. A large number of simulation experiments are performed to compare the key parameters of different Networks. Simulation results show that our proposed routing protocol provide shortest path and disjoint multipath routing for nodes, and its Network lifetime is longer than existing algorithms (OLSR, AODV) when traffic load reaches a certain value.
Junfeng Wang - One of the best experts on this subject based on the ideXlab platform.
-
A software defined Network routing in Wireless Multihop Network
Journal of Network and Computer Applications, 2017Co-Authors: Junfeng Wang, Yiming Miao, M. Shamim Hossain, Ping Zhou, Sk Md Mizanur RahmanAbstract:SDN has been touted as one of the most promising solutions for future Internet with the innovative design ideas that the control plane is logically centralized and decoupled from the data plane. Current research on SDN mainly focuses on wired Network and data center, while software-defined Wireless multi-hop Network is put forth in a few researches, but only at stage of putting forth models and concepts. In this paper, we propose a novel routing protocol applied SDN in Wireless multi-hop Network. The implementation of the protocol is given in detail, and OPNET is used to build the model and carry on the simulation experiment. A large number of simulation experiments are performed to compare the key parameters of different Networks. Simulation results show that our proposed routing protocol provide shortest path and disjoint multipath routing for nodes, and its Network lifetime is longer than existing algorithms (OLSR, AODV) when traffic load reaches a certain value.
Janos Roszik - One of the best experts on this subject based on the ideXlab platform.
-
traffic load in a dense Wireless Multihop Network
Performance Evaluation of Wireless Ad Hoc Sensor and Ubiquitous Networks, 2005Co-Authors: Esa Hyytia, Pasi Lassila, Aleksi Penttinen, Janos RoszikAbstract:In Wireless Multihop Networks each node acts as a relay for the other nodes. Consequently, the distribution of the traffic load has a strong spatial dependence. We consider a dense Multihop Network where the routes are approximately straight line segments. To this end we introduce the so-called line segment traversing process which defines the movement of points in a given region. In particular, the points move along the line segments with a spatial velocity which depends on the current location of the point. We use this process to model the movement of packets and utilise its properties to study the relayed traffic load which corresponds to the traffic load experienced by a node in a given location, and to study the queueing delays as a function of the location using the spatial velocity of the line segment process. The efficiency of a Wireless Multihop Network depends significantly on the used MAC protocol, which then has an impact on queueing delays in a congested Network. Our model can be adapted to any given MAC protocol by a proper choice of the spatial velocity. Additionally, from the model we also obtain an expression for the mean one-way delay in the Network, which is itself an important performance measure of the Network. Finally, we use ns2-simulations to validate some of the key ideas, along with several numerical examples illustrating the effects of MAC protocols on the mean end-to-end delay and power (ratio of throughtput to mean delay).
