1,826 research outputs found
Maximum Multipath Routing Throughput in Multirate Wireless Mesh Networks
In this paper, we consider the problem of finding the maximum routing
throughput between any pair of nodes in an arbitrary multirate wireless mesh
network (WMN) using multiple paths. Multipath routing is an efficient technique
to maximize routing throughput in WMN, however maximizing multipath routing
throughput is a NP-complete problem due to the shared medium for
electromagnetic wave transmission in wireless channel, inducing collision-free
scheduling as part of the optimization problem. In this work, we first provide
problem formulation that incorporates collision-free schedule, and then based
on this formulation we design an algorithm with search pruning that jointly
optimizes paths and transmission schedule. Though suboptimal, compared to the
known optimal single path flow, we demonstrate that an efficient multipath
routing scheme can increase the routing throughput by up to 100% for simple
WMNs.Comment: This paper has been accepted for publication in IEEE 80th Vehicular
Technology Conference, VTC-Fall 201
Combined Intra- and Inter-domain Traffic Engineering using Hot-Potato Aware Link Weights Optimization
A well-known approach to intradomain traffic engineering consists in finding
the set of link weights that minimizes a network-wide objective function for a
given intradomain traffic matrix. This approach is inadequate because it
ignores a potential impact on interdomain routing. Indeed, the resulting set of
link weights may trigger BGP to change the BGP next hop for some destination
prefixes, to enforce hot-potato routing policies. In turn, this results in
changes in the intradomain traffic matrix that have not been anticipated by the
link weights optimizer, possibly leading to degraded network performance.
We propose a BGP-aware link weights optimization method that takes these
effects into account, and even turns them into an advantage. This method uses
the interdomain traffic matrix and other available BGP data, to extend the
intradomain topology with external virtual nodes and links, on which all the
well-tuned heuristics of a classical link weights optimizer can be applied. A
key innovative asset of our method is its ability to also optimize the traffic
on the interdomain peering links. We show, using an operational network as a
case study, that our approach does so efficiently at almost no extra
computational cost.Comment: 12 pages, Short version to be published in ACM SIGMETRICS 2008,
International Conference on Measurement and Modeling of Computer Systems,
June 2-6, 2008, Annapolis, Maryland, US
A Wised Routing Protocols for Leo Satellite Networks
This Study proposes a routing strategy of combining a packet scheduling with
congestion control policy that applied for LEO satellite network with high
speed and multiple traffic. It not only ensures the QoS of different traffic,
but also can avoid low priority traffic to be "starve" due to their weak
resource competitiveness, thus it guarantees the throughput and performance of
the network. In the end, we set up a LEO satellite network simulation platform
in OPNET to verify the effectiveness of the proposed algorithm.Comment: The 10th Asian Control Conference (ASCC), Universiti Teknologi
Malaysia, Malaysi
Traffic engineering in ambient networks: challenges and approaches
The focus of this paper is on traffic engineering in ambient networks.
We describe and categorize different alternatives for making the routing more adaptive to the current traffic situation and discuss the challenges that ambient networks pose on traffic engineering methods. One of the main objectives of traffic engineering is to avoid congestion by controlling and optimising the routing function, or in short, to put the traffic where the capacity is. The main challenge for traffic engineering in ambient networks is to cope with the dynamics of both topology and traffic demands. Mechanisms are needed that can handle traffic load dynamics in scenarios with sudden changes in traffic demand and dynamically distribute traffic to benefit from available resources. Trade-offs between optimality, stability and signaling overhead that are important for traffic engineering methods in the fixed Internet becomes even more critical in a dynamic ambient environment
EMEEDP: Enhanced Multi-hop Energy Efficient Distributed Protocol for Heterogeneous Wireless Sensor Network
In WSN (Wireless Sensor Network) every sensor node sensed the data and
transmit it to the CH (Cluster head) or BS (Base Station). Sensors are randomly
deployed in unreachable areas, where battery replacement or battery charge is
not possible. For this reason, Energy conservation is the important design goal
while developing a routing and distributed protocol to increase the lifetime of
WSN. In this paper, an enhanced energy efficient distributed protocol for
heterogeneous WSN have been reported. EMEEDP is proposed for heterogeneous WSN
to increase the lifetime of the network. An efficient algorithm is proposed in
the form of flowchart and based on various clustering equation proved that the
proposed work accomplishes longer lifetime with improved QOS parameters
parallel to MEEP. A WSN implemented and tested using Raspberry Pi devices as a
base station, temperature sensors as a node and xively.com as a cloud. Users
use data for decision purpose or business purposes from xively.com using
internet.Comment: 6 pages, 4 figures. arXiv admin note: substantial text overlap with
arXiv:1409.1412 by other author
- …