Internet of Things (IoT) a paradigm that brought several new communication technologies, allowing more ubiquity and real-time applications. This innovation sped up the implementation of intelligent transportation systems in smart cities. However, the use of these technologies needs the original routing protocols. The latters must meet real-time application requirements, such as reduced transmission delay, minimal packet loss, and less power consumption. This paper comes up with a novel solution LoRaWAN-based Geographic Routing Protocol (LGRP) using a multi-criteria metric taking into account delay, packet loss, distance, and relative velocity. The hybridization of LoRaWAN with 802.11p technologies is introduced to overcome challenges of urban scenarios in our protocol achievement. We carry out the routing protocol using the Network Simulator 3 (NS-3). Then, we assess its effectiveness in comparison with the greedy perimeter stateless routing (GPSR), the Ad hoc On-Demand Distance Vector (AODV), the Cross-Layer Weighted Position-based Routing (CLWPR), and the blended OpenFlow-Optimized Link State Routing (Centralized). The simulation results show that the proposed routing protocol outmatches the comparative ones in packet delivery and end-to-end delay.

Finite capacity of network resources and enormous data generated by vehicles using safety and comfort applications, have made network congestion a challenge to manage in Heterogeneous Vehicular Network (HetVNET). In this paper, we propose a reliable network congestion model based on a Multiple Linear Regression (MLR), which is a supervised machine learning algorithm to predict network congestion in HetVNET. We have evaluated the performance of our proposed network congestion prediction model using a Cross-Validation test approach. Numerical results show that the proposed linear congestion prediction model is reliable, which can explain and support variability of the response as well. Moreover, we have weighted effectiveness of each considered HetVNET parameters, in association with congestion situation in HetVNET.

Congestion control is one of the most important factors when a Wireless Body Area Network (WBAN) is designed, due to its direct impact in the Quality of Service (QoS) and the energy efficiency of the network. The congestion in a WBAN can produce packet loss and high energy consumption. The IEEE 802.15.6 Standard supports QoS, but it does not suggest any explicit congestion control scheme. This paper proposes a new rate control scheme for mitigating congestion in WBANs based on an energy-efficient and emergency-aware MAC (Medium Access Control) protocol and the IEEE 802.15.6 Standard. The scheme is context-aware and responses to emergency events in any node controlling the normal traffic rate. The proposed solution improves the performance of both the MAC protocol and the IEEE 802.15.6 Standard.

In this paper, we propose a hybrid iterated local search (ILS) heuristic, named GPP4G-ILS, to solve the global planning problem of survivable wireless networks. The planning problem of wireless networks is to determine a set of sites among potential sites to install the various network devices in order to cover a given geographical area. It should also make the connections between the devices in accordance with well-defined constraints. The global planning consists in solving this problem without dividing it into several subproblems. The objective is to minimize the cost of the network while maximizing its survivability. The GPP4G-ILS algorithm is a new form of hybridization between the ILS algorithm and the integer linear programing (ILP) method. We propose a configuration that allows to reuse a previously developed ILP algorithm by integrating it in the ILS algorithm. This allows to benefit from the advantages of both methods. The ILS algorithm is used to effectively explore the search space, while the ILP algorithm is used to intensify the solutions obtained. The performance of the algorithm was evaluated using an exact method that generates optimal solutions for small instances. For larger instances, lower bounds have been calculated using a relaxation of the problem. The results show that the proposed algorithm is able to reach solutions that are, on average, within 0.06% of the optimal solutions and 2.43% from the lower bounds for the instances that cannot be solved optimally, within a reduced computation time.

The main problem of firewall configuration is to ensure the filtering rules consistency w.r.t. a global security policy. However, the overall firewalls configuration on a network, which requires a human intervention, is often an error-prone process. Therefore, automated solutions are needed in order to detect firewall configuration inconsistencies and to check the inter-firewalls consistency. In this paper, we propose a formal modeling and verification framework based on model checking. It allows to verify automatically the end-to-end security behavior of a set of firewalls w.r.t. a global security policy. To deal with state explosion problem, two abstractions are proposed and evaluated in term of space and time complexity, according to the network size and connectivity rate.

Wireless local area networks (WLANs) are more deployed today than ever before. However, this rapid growth led to uncoordinated deployment and planning tools are rarely used. In this paper, we first propose a mathematical model to solve the WLAN planning problem considering directional antennas. The problem consists of selecting the location of the access points in the network and selecting the transmit power, the antenna type and its orientation as well as the communication channel of each one. The use of interfering channels is allowed to solve the frequency allocation problem. Since the problem is NP-hard, we propose a two-step tabu-based metaheuristic algorithm to find solutions satisfying a radio coverage constraint, a throughput constraint and an interference level constraint. Our objective is to minimize the cost of the network and to distribute evenly the resources amongst the users. The aim of the first step of the algorithm is to obtain a solution that satisfies all the constraints while the second step focuses on optimizing the previously obtained solution. A new neighborhood, based on radio coverage of an access point, is proposed. The results show that solutions can be obtained with the proposed approach for real-size instances of the problem.

In this paper, we propose a local search heuristic to find "good" feasible solutions in order to solve the global planning problem of universal mobile telecommunications system (UMTS) networks. The global problem is composed of three different subproblems: the cell, the access network and the core network planning subproblems. The global model is very complex to solve exactly and for this reason, we concentrate our efforts on the development of efficient heuristics. A detailed example illustrates the solutions obtained with the proposed approach. Computational results show that our heuristic produces results that are, on average, within 5.48% of the optimal solution.

In this paper, we propose a tabu search heuristic to find "good" feasible solutions for the global planning problem of universal mobile telecommunications system (UMTS) networks that is composed of three subproblems: the cell, the access network and the core network planning subproblems. Since this global planning problem has been proven to be NP-hard, we concentrate our efforts on the development of an efficient heuristic. Numerical results show that quasi-optimal solutions (on average, within 0.21% of the optimal solution) can be obtained with the proposed approach

In this paper, we propose a model for the wireless local area network (WLAN) design problem with minimum bandwidth guarantees. This problem consists of selecting the location of the access points (APs) and selecting the power and the channel of each AP. We propose a tabu search algorithm to find solutions for real-size instances of the problem. Finally, numerical results are presented and analyzed.

We tackle the design problem of the logical overlay network used by the reliable label switched paths (ILSPs) in Internet protocol (IP) networks. The design problem consists to find the minimum capacity on each link and the routing metrics that ensure the successful rerouting of the reliable LSPs for all failure scenarios of interest to the network planner. The objective is to minimize the cost of the network overlay. A mixed nonlinear bi-level mathematical programming model is proposed for the problem and a tabu-search heuristic algorithm is designed to find "good" solutions of the model. Numerical results show that quasi-optimal solutions can be found with the proposed algorithm.

In this article we propose a model for the topological design problem of multitechnology networks that includes the location of switches and their port configuration, the design of an access network (with single and double access links) and a backbone network. The model specifically takes into account different types of modular switches where each type is characterized by its cost, its capacity in terms of the number of slots, and by its switch fabric capacity. The mutitechnology qualifier stems from the fact that several technologies and rates can be used in the access network. The proposed model is of the integer-programming variety, and in order to find a good solution, we propose a starting heuristic that provides an initial solution and the tabu-search algorithm to improve the solution. Lower bounds are proposed and used to assess the performance of the tabu-based approach. Numerical results for randomly generated problems with up to 500 clients and 50 potential switch sites are presented. The tabu-search algorithm produced solutions that were, on average, within 2.11% of the best lower bound.

In this paper we tackle the design problem of the trunk group (TG) overlay in wide area ATM networks under reliability constraints. The TGs are composed of virtual paths (VPs) that the soft-permanent virtual connections (S-PVCs) can ride on. The private network-network interface (PNNI) routing standard is used to route these connections. The design problem consists to find the capacity and the administrative weight (AW) of each TG that ensure the successful rerouting of the S-PVCs for all failure scenarios of interest to the network planner. The objective is to minimize the cost of the TG overlay. An optimization model is proposed as well as a tabu search algorithm. A detailed TG overlay design example is performed and tested. The results showed that the tabu-based algorithm has improved the solution by 9.80%.

We propose a framework for the overall design problem of Internet protocol (IP) networks with performance guarantees that includes the location of IP switches, their configuration with respect to ports, the design of an access network, the design of a core network, the link dimensioning and traffic routing. The model specifically takes into account the failure scenarios of interest to the network planner and that different types of switches can be used. In order to be able to offer performance guarantees (in terms of bandwidth) for transport layer connections, we suppose that the switches support per-flow queuing with weighted fair queuing (WFQ) and longest-queue drop (LQD). Moreover, we consider the routing constraints imposed by the open shortest path first (OSPF) routing mechanism, The proposed model is of the integer programming variety, and in order to find a good solution, we propose a tabu search algorithm. A detailed network design example is presented.

This paper presents a mixed 0–1 linear programming model for the metropolitan area network (MAN) expansion problem. The model includes the location of new switch sites, the update of the configuration of the switches (with respect to port and shelf types), the update of the access network, and the expansion of the backbone (core) network. In addition, we consider that several technologies (e.g., frame relay and asynchronous transfer mode) and rates (e.g., OC-3 and OC-12) may be used in the access network. A multiple-ring topology is chosen for the backbone network since it is sparse, therefore not too expensive, while providing protection against single-link or switch failure. To find a good solution, we propose an initial heuristic that provides a starting solution and a tabu–based heuristic to improve the solution. Finally, we present an illustrative example of a MAN design with its successive expansions, followed by a systematic set of experiments designed to assess the performance of the proposed algorithms. © 2000 John Wiley & Sons, Inc.

We consider a model for communications network design that includes the optimal location of switches (of which there are several types) and the design of the access and backbone networks. The model is of the integer programming variety, and in order to find its solution, we propose a greedy heuristic that yields a good starting solution and a more sophisticated heuristic based on tabu search. Finally we present numerical results for problems including as much as 200 user sites and 20 potential switch sites.