Search results for " Routing"
showing 10 items of 229 documents
Evaluating a bound for MANETs routing protocols performance using graphs with activation windows
2008
In this paper we present an algorithm called STPA (shortest time path algorithm) which aims at providing a comparison tool for the evaluation of a bound for mobile ad hoc networks (MANETs) routing protocols performance. STPA provides an exhaustive evaluation of an ideal routing protocol. Based on the current position and state of the nodes it can determine factors like: how many complete messages get to the destination, which is the smallest amount of time required by a packet to get to the destination, which path followed each packet, and so on. This values would allow a protocol designer to improve or fine tune his proposal. We demonstrate that the complexity of the algorithm is O(sigma2)…
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…
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…
Dynamic routing-and-inventory problems: a review
1998
The paper presents a review of the available literature on a class of problems denoted as dynamic routing-and-inventory (DRAI) problems. They are characterized by the simultaneous relevance of routing and of inventory issues in a dynamic environment, within the framework of distribution logistics. A classification scheme is first proposed for these problems. Then the results obtained in this area are summarized. Finally, the papers available in the literature are clustered and discussed according to the proposed scheme.
Vehicle routing with private and shared delivery locations
2021
Abstract The rapid growth of e-commerce has led to an increase of home delivery requests. Providing efficient distribution systems for services on the last mile has become a challenging issue for logistics companies, where a trade-off between the classical approaches, attended home delivery (AHD) and usage of shared delivery locations (SDLs) has been identified. AHD provides a higher quality of service but implies very high costs for the company, while usage of SDL requires customers to perform the very last mile by themselves. For companies, this bears the risk of a decrease in the perceived service quality. However, due to consolidation effects, transportation costs can be considerably mi…
The collaborative consistent vehicle routing problem with workload balance
2021
Abstract The rising competition in the logistics sector forces companies to be more economically efficient. One of the major sources of inefficiency is the incomplete usage of available resources, such as vehicles’ capacities. Mechanism that allow to better exploit such resources by enabling carrier collaborations are on the rise. Our study examines a centrally organized multi-period collaborative vehicle routing problem, where carriers can exchange customers who have to be serviced on a regular basis. Collaborations, where carriers serve frequent customers, are supposed to face the problem of (i) time consistency in terms of visiting time, and of (ii) service consistency. The latter ensure…
Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs
2019
Two critical yet frequently conflicting objectives for logistics and transportation service companies are improving customer satisfaction and reducing transportation cost. In particular, given a network of customer requests with preferred service times, it is very challenging to find vehicle routes and service schedules simultaneously that respect all operating constraints and minimize the total transportation and customers’ inconvenience costs. In this paper, we introduce the vehicle routing problem with time windows and convex node costs (VRPTW-CNC), in which we model each customer’s inconvenience cost as a convex function of the service start time at that customer. The VRPTW-CNC combine…