Search results for "routing"
showing 10 items of 587 documents
An optimized path-selection using airtime metric in OLSR networks: Implementation and testing
2008
Wireless mesh networks used for broadband access may be equipped with multiple Internet gateways. Using airtime metric as the main criterion for path selection is an effective method for achieving load-balancing in such a multi-homed mesh network. In this paper, we describe how the radio-aware path selection using airtime as a metric can be implemented in order to achieve this functionality, based on a modified version of an open source OLSR implementation. The paper presents both the principle of this method, its implementation and the empirical results which focus on testing the airtime metric functionality based on a deployed small-scale test network.
A new way of achieving multi-path routing in wireless networks
2020
In the 21st century, the wireless technology is still developing rapidly and trying to be 'Faster, Higher, and Stronger': faster data rate, higher bandwidth and stronger connectivity. Wireless Mesh Networks (WMN) have been envisioned as an important solution to the next generation wireless networking which can be used in wireless community networks, wireless enterprise networks, transportation systems, home networking and last-mile wireless internet access. They also provide a cheap, quick and effective way for building wireless data networks. Considering the nature of these networks, routing is a key process for operating the WMN. This paper proposes a new way of creating multi-path routin…
Performance Analysis in Spatially Correlated IEEE 802.11 Networks
2012
Wireless mesh networks are difficult to be characterized, especially under multi-hop traffic streams. The problem is that the local view of the channel and the correlation between the buffers of consecutive nodes in a stream path make complicated the identification of the contention level perceived by each station along the time. Such a figure is used in the models based on the so called decoupling assumption for evaluating the final scheduling of simultaneous channel access grants. In this paper we propose a simplified mesh network model focused on capturing the correlation due to the network topology and traffic routes rather than the access protocol state at each node. To this purpose, w…
An adaptive timer for RPL to handle mobility in wireless sensor networks
2016
This paper focuses on the performance of wireless sensor networks characterized by a hybrid topology composed of mobile and static sensor nodes. The Routing Protocol for Low power and lossy networks (RPL), which is standardized as an IPv6 routing protocol for low power and lossy networks, uses the trickle timer algorithm to handle changes in the network topology. However, this algorithm is not well adapted to dynamic environments. This paper enhances the trickle timer in order to fit with mobility requirements. Most of previous works have improved this algorithm without considering the random movement of nodes. In this work, the proposed timer algorithm takes into consideration the random t…
Throughput and energy efficiency comparison of one-hop, two-hop, virtual relay and cooperative retransmission schemes
2010
Two main types of approaches exist for implementing cooperative communications at the MAC layer: virtual-hop relay and cooperative retransmission. While the virtual-hop relay schemes employ relay nodes to forward packets when higher end-to-end throughput can be achieved compared with the direct transmission, the cooperative retransmission schemes use relays to retransmit data only after the direct transmission fails. However, the performance of the these different approaches has not been compared in the literature, especially when energy efficiency is considered. In order to find out the best transmission scheme, this paper evaluates and compares the performance of the one-hop direct transm…
Latency factor in worldwide IP routed networks
2014
Current Border Gateway Protocol (BGP) serves for worldwide internet backbone connections between different Autonomous Systems (AS) on the routing level. Continuously in real-time changing environment core routers calculate routing decisions based on path-vector database entries. AS path-vector database may contain multiple paths for various Internet Protocol (IP) prefix destinations where smallest entity in the path-vector is AS. In real world AS can be internet service operator, university or any other organization willing to participate in internet network via multi-homed uplinks. Unfortunately, internal part of AS is hidden in path-vector database thus excluding factors like latency, pac…
Broadband Internet Access via Multi-Hop Wireless Mesh Networks: Design, Protocol and Experiments
2010
Published version of an article from the journal: Wireless Personal Communications. The original publication is available at Spingerlink. http://dx.doi.org/10.1007/s11277-009-9907-9 While bandwidth for Internet access in urban areas is steadily increasing in recent years, many rural areas are still suffering from the effect of the digital divide. This paper presents a broadband Internet access paradigm developed in the context of the ADHOCSYS project, which was financed by the European Commission under the 6th Framework Program Information and Society Technologies, within the strategic objective of Broadband for All. Aiming at providing reliable Internet access in rural and mountainous regi…
A hybrid bio-inspired approach to solving the routing problem in mobile ad hoc networks
2018
A mobile ad hoc network (MANET) is an autonomous system of mobile hosts (nodes) connected by a wireless link. However, the problem of designing routing protocols poses challenges to researchers due to the unpredictable and dynamic nature of ad hoc networks. Hence, bio-inspired algorithms are widely used to design adaptive routing strategies for MANETs. This paper proposes a routing protocol based on the hybridisation of ant colony optimisation (ACO) and 2-opt heuristic with the optimisation of ACO parameters. Given the vast scope of the parameters, a genetic algorithm is used to minimise the complexity of the problem. The implementation of the method is realised by MATLAB. To valid the resu…
A note on capacity provisioning in SDN service provider network
2015
W niniejszej pracy rozważane są sieci ISP z wdrożoną warstwą sterowania typu SDN. Zaproponowano algorytm heurystyczny rozwiązujący problem CFA dla tego typu sieci, biorąc pod uwagę dwa aspekty: przepustowość łączy oraz cechy własne sieci ISP.
Threshold Neutral Pion Photoproduction on the Proton
2015
The neutral pion photoproduction on the proton near threshold has a very small scattering cross section when compared to the charged channels, which in ChPT is explained by strong cancellations between the lowest order pieces. Therefore it is very sensitive to higher-order corrections of chiral perturbation theory. We perform a fully covariant calculation up to chiral order p^3 and we investigate the effect of the inclusion of the Delta(1232) resonance as an explicit degree of freedom. We show that the convergence improves, leading to a much better agreement with data at a wide range of energies.