This page has only limited features, please log in for full access.

Unclaimed
Marc St-Hilaire
School of Information Technology and Department of Systems and Computer Engineering Carleton University, Ottawa, Canada

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Research article
Published: 24 March 2021 in Security and Communication Networks
Reads 0
Downloads 0

The rapid evolution of the Internet of Things (IoT) and the development of cloud computing have endorsed a new computing paradigm called edge computing, which brings the computing resources to the edge of the network. Due to low computing power and small data storage at the edge nodes, the task must be assigned to the computing nodes, where their associated data is available, to reduce overheads caused by data transmissions in the network. The proposed scheme named task priority-based data-prefetching scheduler (TPDS) tries to improve the data locality through available cached and prefetching data for offloading tasks to the edge computing nodes. The proposed TPDS prioritizes the tasks in the queue based on the available cached data in the edge computing nodes. Consequently, it increases the utilization of cached data and reduces the overhead caused by data eviction. The simulation results show that the proposed TPDS can be effective in terms of task scheduling and data locality.

ACS Style

Ihsan Ullah; Muhammad Sajjad Khan; Marc St-Hilaire; Mohammad Faisal; Junsu Kim; Su Min Kim. Task Priority-Based Cached-Data Prefetching and Eviction Mechanisms for Performance Optimization of Edge Computing Clusters. Security and Communication Networks 2021, 2021, 1 -10.

AMA Style

Ihsan Ullah, Muhammad Sajjad Khan, Marc St-Hilaire, Mohammad Faisal, Junsu Kim, Su Min Kim. Task Priority-Based Cached-Data Prefetching and Eviction Mechanisms for Performance Optimization of Edge Computing Clusters. Security and Communication Networks. 2021; 2021 ():1-10.

Chicago/Turabian Style

Ihsan Ullah; Muhammad Sajjad Khan; Marc St-Hilaire; Mohammad Faisal; Junsu Kim; Su Min Kim. 2021. "Task Priority-Based Cached-Data Prefetching and Eviction Mechanisms for Performance Optimization of Edge Computing Clusters." Security and Communication Networks 2021, no. : 1-10.

Journal article
Published: 07 March 2021 in Applied Sciences
Reads 0
Downloads 0

Cooperative spectrum sensing (CSS) is a vital part of cognitive radio networks, which ensures the existence of the primary user (PU) in the network. However, the presence of malicious users (MUs) highly degrades the performance of the system. In the proposed scheme, each secondary user (SU) reports to the fusion center (FC) with a hard decision of the sensing energy to indicate the existence of the PU. The main contribution of this work deals with MU attacks, specifically spectrum sensing data falsification (SSDF) attacks. In this paper, we propose a correlation-based approach to differentiate between the SUs and the outliers by determining the sensing of each SU, and the average value of sensing information with other SUs, to predict the SSDF attack in the system. The FC determines the abnormality of a SU by determining the similarity for each SU with the remaining SUs by following the proposed scheme and declares the SU as an outlier using the box-whisker plot. The effectiveness of the proposed scheme was demonstrated through simulations.

ACS Style

Muhammad Khan; Mohammad Faisal; Su Kim; Saeed Ahmed; Marc St-Hilaire; Junsu Kim. A Correlation-Based Sensing Scheme for Outlier Detection in Cognitive Radio Networks. Applied Sciences 2021, 11, 2362 .

AMA Style

Muhammad Khan, Mohammad Faisal, Su Kim, Saeed Ahmed, Marc St-Hilaire, Junsu Kim. A Correlation-Based Sensing Scheme for Outlier Detection in Cognitive Radio Networks. Applied Sciences. 2021; 11 (5):2362.

Chicago/Turabian Style

Muhammad Khan; Mohammad Faisal; Su Kim; Saeed Ahmed; Marc St-Hilaire; Junsu Kim. 2021. "A Correlation-Based Sensing Scheme for Outlier Detection in Cognitive Radio Networks." Applied Sciences 11, no. 5: 2362.

Journal article
Published: 08 January 2021 in IEEE Networking Letters
Reads 0
Downloads 0

This paper proposes an exact mathematical model to determine the optimal profit for task allocation within a 2-tier fog/cloud network environment. The model determines the optimal profit for fog computing networks while considering green computing concepts. This provides the exact operations needed to optimize for both fog node state manipulations and task allocation to the fog computing network. The proposed model uses complete knowledge of all its inputs to provide exact solutions. As a result, the model can be used to benchmark various real-time resource allocation algorithms by using historic trace data of demanded resources from a given network topology.

ACS Style

Jonathan Daigneault; Marc St-Hilaire. Profit Maximization Model for the Task Assignment Problem in 2-Tier Fog/Cloud Network Environments. IEEE Networking Letters 2021, 3, 19 -22.

AMA Style

Jonathan Daigneault, Marc St-Hilaire. Profit Maximization Model for the Task Assignment Problem in 2-Tier Fog/Cloud Network Environments. IEEE Networking Letters. 2021; 3 (1):19-22.

Chicago/Turabian Style

Jonathan Daigneault; Marc St-Hilaire. 2021. "Profit Maximization Model for the Task Assignment Problem in 2-Tier Fog/Cloud Network Environments." IEEE Networking Letters 3, no. 1: 19-22.

Journal article
Published: 12 May 2020 in IEEE Transactions on Vehicular Technology
Reads 0
Downloads 0
ACS Style

Zhe Zhang; Chung-Horng Lung; Marc St-Hilaire; Ioannis Lambadaris. Smart Proactive Caching: Empower the Video Delivery for Autonomous Vehicles in ICN-Based Networks. IEEE Transactions on Vehicular Technology 2020, 69, 7955 -7965.

AMA Style

Zhe Zhang, Chung-Horng Lung, Marc St-Hilaire, Ioannis Lambadaris. Smart Proactive Caching: Empower the Video Delivery for Autonomous Vehicles in ICN-Based Networks. IEEE Transactions on Vehicular Technology. 2020; 69 (7):7955-7965.

Chicago/Turabian Style

Zhe Zhang; Chung-Horng Lung; Marc St-Hilaire; Ioannis Lambadaris. 2020. "Smart Proactive Caching: Empower the Video Delivery for Autonomous Vehicles in ICN-Based Networks." IEEE Transactions on Vehicular Technology 69, no. 7: 7955-7965.

Journal article
Published: 15 August 2019 in IEEE Transactions on Multimedia
Reads 0
Downloads 0

The considerable increase of multimedia services, such as video-on-demand (VoD) services, is a significant contributor to the total Internet traffic. Software-defined networking (SDN) and information-centric networking (ICN) are two promising technologies that can be combined to facilitate video delivery and to reduce network delays. In this paper, we first formulate the caching decision problem as a 0-1 integer linear programming (ILP) problem. Second, in contrast to existing approaches that solve the formulated ILP problem by assuming all future video requests are known, we consider the impact of the time scale, which transforms the static 0-1 ILP problem into a dynamic problem. By solving the dynamic 0-1 ILP problem, we find more accurate optimal solutions compared to existing approaches. Third, since the formulated 0-1 dynamic ILP problem is NP-hard, we leverage the in-network caching of ICN and the global view of the SDN controller to propose a novel SDN-based caching decision policy. Finally, extensive evaluations are performed, and the results demonstrate that the proposed SDNbased caching decision policy provides solutions that are close to the optimum in substantially less computation time. The SDNbased caching decision policy also outperforms existing practical ICN caching decision policies in terms of the cache hit ratio and the average number of hops, which are directly related to the video delivery latency. Moreover, the SDN-based caching decision policy can substantially reduce the number of generated and broadcasted interest packets, which is a shortcoming of the current ICN.

ACS Style

Zhe Zhang; Chung-Horng Lung; Marc St-Hilaire; Ioannis Lambadaris. An SDN-Based Caching Decision Policy for Video Caching in Information-Centric Networking. IEEE Transactions on Multimedia 2019, 22, 1069 -1083.

AMA Style

Zhe Zhang, Chung-Horng Lung, Marc St-Hilaire, Ioannis Lambadaris. An SDN-Based Caching Decision Policy for Video Caching in Information-Centric Networking. IEEE Transactions on Multimedia. 2019; 22 (4):1069-1083.

Chicago/Turabian Style

Zhe Zhang; Chung-Horng Lung; Marc St-Hilaire; Ioannis Lambadaris. 2019. "An SDN-Based Caching Decision Policy for Video Caching in Information-Centric Networking." IEEE Transactions on Multimedia 22, no. 4: 1069-1083.

Journal article
Published: 14 January 2019 in IEEE Internet of Things Journal
Reads 0
Downloads 0

Fog computing has risen as a promising technology for augmenting the computational and storage capability of the end devices and edge networks. The urging issues in this networking paradigm are fog nodes planning, resources allocation, and offloading strategies. This paper aims to formulate a mathematical model which jointly tackles these issues. The goal of the model is to optimize the tradeoff (Pareto front) between the capital expenditure and the network delay. To solve this multi-objective optimization problem and obtain benchmark values, we first use the weighted sum method and two existing evolutionary algorithms, NSGA-II (Non-dominated Sorting Genetic Algorithm II) and Speed-Constrained Multi-Objective Particle Swarm Optimization (SMPSO). Then, inspired by those evolutionary algorithms, the paper proposes a new evolutionary algorithm, named Particle Swarm Optimized Non-dominated Sorting Genetic Algorithm (PSONSGA), which combines the convergence and searching efficiency of the existing evolutionary algorithms. The effectiveness of the proposed algorithm is evaluated by the HyperVolume (HV) and Inverted Generational Distance (IGD) indicators. The performance evaluation results show that the proposed model and algorithms can help the network planners in the deployment of fog networks to complement their existing computation and storage infrastructure.

ACS Style

Decheng Zhang; Faisal Haider; Marc St-Hilaire; Christian Makaya. Model and Algorithms for the Planning of Fog Computing Networks. IEEE Internet of Things Journal 2019, 6, 3873 -3884.

AMA Style

Decheng Zhang, Faisal Haider, Marc St-Hilaire, Christian Makaya. Model and Algorithms for the Planning of Fog Computing Networks. IEEE Internet of Things Journal. 2019; 6 (2):3873-3884.

Chicago/Turabian Style

Decheng Zhang; Faisal Haider; Marc St-Hilaire; Christian Makaya. 2019. "Model and Algorithms for the Planning of Fog Computing Networks." IEEE Internet of Things Journal 6, no. 2: 3873-3884.

Journal article
Published: 08 October 2018 in IEEE Transactions on Cloud Computing
Reads 0
Downloads 0

This paper proposes an exact model for the planning and design problem of fog networks. More precisely, a mathematical model is proposed to simultaneously determine the optimal location, the capacity and the number of fog node(s) as well as the interconnection between the installed fog nodes and the cloud. The goal of the model is to minimize the delay in the network and the amount of traffic sent to the cloud data center. To address this multi-objective optimization problem, three optimization techniques are used: the weighted sum, the hierarchical and the trade-off methods. The weighted sum method aggregates all the lone objective functions into a single objective by applying a weighted vector. The hierarchical method takes a sequential approach by tightly constraining the more important objective function. The trade-off method solves a single objective function and translates all other objective functions into constraints. These methods are then compared in terms of average delay, amount of traffic sent to the cloud and amount of CPU time required to find optimal solution(s). Since we are dealing with a multi-objective optimization problem and that multiple optimal solutions can be found, the fuzzy-based mechanism and the hypervolume indicator have been used. Computational results show that as the problem size increases, the delay and the traffic also increase in a linear form; whereas, the solution time increases in non-polynomial time. The weighted sum method was able to achieve the best trade-off results for the delay and the traffic, whereas the hierarchical method was able to return minimum delay but with worse traffic going to the cloud. As the model considers realistic edge device traffic parameters, constraints, and various topology aspects, it can be helpful for the planning and deployment of fog networks and how they operate within a cloud infrastructure.

ACS Style

Faisal Haider; Decheng Zhang; Marc St-Hilaire; Christian Makaya. On the Planning and Design Problem of Fog Computing Networks. IEEE Transactions on Cloud Computing 2018, 9, 724 -736.

AMA Style

Faisal Haider, Decheng Zhang, Marc St-Hilaire, Christian Makaya. On the Planning and Design Problem of Fog Computing Networks. IEEE Transactions on Cloud Computing. 2018; 9 (2):724-736.

Chicago/Turabian Style

Faisal Haider; Decheng Zhang; Marc St-Hilaire; Christian Makaya. 2018. "On the Planning and Design Problem of Fog Computing Networks." IEEE Transactions on Cloud Computing 9, no. 2: 724-736.

Conference paper
Published: 20 January 2018 in Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Reads 0
Downloads 0

Multi-Beam Antennas (MBAs) have two main characteristics: the Multi-Packet Transmission (MPT) capability and the Multi-Packet Reception (MPR) capability whereby a node can transmit/receive multiple packets at the same time. In this paper, we provide an analysis of how this MPT/MPR capability can be used to reduce the end-to-end delay in ad hoc networks. We formulate the delay reduction issue as an optimization problem. Simulations show that in order to exploit the full potential of MBAs for delay reduction, the scheduling of links has to promote the formation of star nodes and keep the formation of bridges to a minimum; which leads to the selection of routes that very often are not the shortest. We also show that using only the shortest routes has a negative impact on the delay.

ACS Style

Jean-Daniel Medjo Me Biomo; Thomas Kunz; Marc St-Hilaire. Exploiting Multiple Beam Antennas for End-to-End Delay Reduction in Ad Hoc Networks. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018, 143 -155.

AMA Style

Jean-Daniel Medjo Me Biomo, Thomas Kunz, Marc St-Hilaire. Exploiting Multiple Beam Antennas for End-to-End Delay Reduction in Ad Hoc Networks. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. 2018; ():143-155.

Chicago/Turabian Style

Jean-Daniel Medjo Me Biomo; Thomas Kunz; Marc St-Hilaire. 2018. "Exploiting Multiple Beam Antennas for End-to-End Delay Reduction in Ad Hoc Networks." Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering , no. : 143-155.

Conference paper
Published: 01 January 2018 in Proceedings of the 10th International Conference on Security and Cryptography
Reads 0
Downloads 0
ACS Style

Ola Ashour; Marc St-Hilaire; Thomas Kunz. Multicasting in Tactical Networks: Forwarding Versus Network Coding. Proceedings of the 10th International Conference on Security and Cryptography 2018, 1 .

AMA Style

Ola Ashour, Marc St-Hilaire, Thomas Kunz. Multicasting in Tactical Networks: Forwarding Versus Network Coding. Proceedings of the 10th International Conference on Security and Cryptography. 2018; ():1.

Chicago/Turabian Style

Ola Ashour; Marc St-Hilaire; Thomas Kunz. 2018. "Multicasting in Tactical Networks: Forwarding Versus Network Coding." Proceedings of the 10th International Conference on Security and Cryptography , no. : 1.

Conference paper
Published: 01 January 2018 in Proceedings of the 10th International Conference on Security and Cryptography
Reads 0
Downloads 0

Multicasting refers to the transmission of packets to a group of one or more destinations. It can be very useful in military applications, such as command and control, in which a commander needs to send instructions to a group of tanks, users, or planes. Broadcast is a unique case of multicast, where all the nodes in the network are intended receivers. The broadcast case has been studied quite extensively in the literature, showing that the use of Network Coding (NC) requires fewer data transmissions than Packet Forwarding (PF). That motivates us to explore whether the same result holds true when only a subset of nodes are receivers. In this paper, we developed two linear optimization models that determine lower bounds on the number of required data packet transmissions when sending data in a Mobile Ad-hoc Network (MANET) from a single source to multiple receivers. The first model determines the minimum number of required packet transmissions under the assumption that PF is used. The

ACS Style

Ola Ashour; Marc St-Hilaire; Thomas Kunz. Multicasting in Tactical Networks: Forwarding Versus Network Coding. Proceedings of the 10th International Conference on Security and Cryptography 2018, 42 -51.

AMA Style

Ola Ashour, Marc St-Hilaire, Thomas Kunz. Multicasting in Tactical Networks: Forwarding Versus Network Coding. Proceedings of the 10th International Conference on Security and Cryptography. 2018; ():42-51.

Chicago/Turabian Style

Ola Ashour; Marc St-Hilaire; Thomas Kunz. 2018. "Multicasting in Tactical Networks: Forwarding Versus Network Coding." Proceedings of the 10th International Conference on Security and Cryptography , no. : 42-51.

Article
Published: 30 September 2017 in Journal of Network and Systems Management
Reads 0
Downloads 0

Software Defined Network (SDN) is a new network architecture that has an operating system. Unlike conventional production networks, SDN allows more flexibility in network management using that operating system that is called the controller. The main advantage of having a controller in the network is the separation of the forwarding and the control planes, which provides central control over the network. Although central control is the major advantage of SDN, it is also a single point of failure if it is made unreachable by a Distributed Denial of Service (DDoS) attack. In this paper, that single point of failure is addressed by utilizing the controller to detect such attacks and protect the SDN architecture of the network in its early stages. The two main objectives of this paper are to (1) make use of the controller’s broad view of the network to detect DDoS attacks and (2) propose a solution that is effective and lightweight in terms of the resources that it uses. To accomplish these objectives, this paper examines the effect of DDoS attacks on the SDN controller and the way it can exhaust controller resources. The proposed solution to detect such attacks is based on the entropy variation of the destination IP address. Based on our experimental setup, the proposed method can detect DDoS within the first 250 packets of the attack traffic.

ACS Style

Seyed Mohammad Mousavi; Marc St-Hilaire. Early Detection of DDoS Attacks Against Software Defined Network Controllers. Journal of Network and Systems Management 2017, 26, 573 -591.

AMA Style

Seyed Mohammad Mousavi, Marc St-Hilaire. Early Detection of DDoS Attacks Against Software Defined Network Controllers. Journal of Network and Systems Management. 2017; 26 (3):573-591.

Chicago/Turabian Style

Seyed Mohammad Mousavi; Marc St-Hilaire. 2017. "Early Detection of DDoS Attacks Against Software Defined Network Controllers." Journal of Network and Systems Management 26, no. 3: 573-591.

Journal article
Published: 28 October 2015 in Telecommunication Systems
Reads 0
Downloads 0

Proxy Mobile IPv6 (PMIPv6) has been designed by the IETF as a network-based mobility management protocol to support the localized mobility of IP devices. Although several proposals have been made for localized routing optimization, they don’t take into account handover management and localized routing simultaneously. In fact, the localized routing state is restored after the handover management procedure, leading to packet loss and signaling overhead. On the other hand, Fast Handovers for PMIPv6 (F-PMIPv6) protocol has been designed to mainly solve the issues of the high handover delay and packet loss during handover that occur with PMIPv6. As a result, this paper looks at enhancing F-PMIPv6 by controlling the handover management with optimized localized routing and proposes an extension of PMIPv6 called optimized PMIPv6. The proposed protocol enhances the performance of PMIPv6 and F-PMIPv6 in terms of route optimization, handover delay, signaling cost and network utilization.

ACS Style

Ahmad Rasem; Marc St-Hilaire; Christian Makaya. Efficient handover with optimized localized routing for Proxy Mobile IPv6. Telecommunication Systems 2015, 62, 675 -693.

AMA Style

Ahmad Rasem, Marc St-Hilaire, Christian Makaya. Efficient handover with optimized localized routing for Proxy Mobile IPv6. Telecommunication Systems. 2015; 62 (4):675-693.

Chicago/Turabian Style

Ahmad Rasem; Marc St-Hilaire; Christian Makaya. 2015. "Efficient handover with optimized localized routing for Proxy Mobile IPv6." Telecommunication Systems 62, no. 4: 675-693.

Journal article
Published: 27 August 2015 in IEEE Transactions on Parallel and Distributed Systems
Reads 0
Downloads 0

Media content in its digital form has been rapidly scaling up, resulting in popularity gain of cloud computing. Cloud computing makes it easy to manage the vastly increasing digital content. Moreover, additional features like, omnipresent access, further service creation, discovery of services, and resource management also play an important role in this regard. The forthcoming era is interoperability of multiple clouds, known as cloud federation or inter-cloud computing. With cloud federation, services would be provided through two or more clouds. Once matured and standardized, inter-cloud computing is supposed to provide services which would be more scalable, better managed, and efficient. Such tasks are provided through a middleware entity called cloud broker. A broker is responsible for reserving resources, managing them, discovering services according to customer's demands, Service Level Agreement (SLA) negotiation, and match-making between the involved service provider and the customer. So far existing studies discuss brokerage in a narrow focused way. In the research outcome presented in this paper, we provide a holistic brokerage model to manage on-demand and advance service reservation, pricing, and reimbursement. A unique feature of this study is that we have considered dynamic management of customer's characteristics and historical record in evaluating the economics related factors. Additionally, a mechanism of incentive and penalties is provided, which helps in trust build-up for the customers and service providers, prevention of resource underutilization, and profit gain for the involved entities. For practical implications, the framework is modeled on Amazon Elastic Compute Cloud (EC2) On-Demand and Reserved Instances service pricing. For certain features required in the model, data was gathered from Google Cluster trace.

ACS Style

Mohammad Aazam; Eui-Nam Huh; Marc St-Hilaire; Chung-Horng Lung; Ioannis Lambadaris; Aazam M.; Huh E.; Lung C.; Lambadaris I.. Cloud Customer's Historical Record Based Resource Pricing. IEEE Transactions on Parallel and Distributed Systems 2015, 27, 1929 -1940.

AMA Style

Mohammad Aazam, Eui-Nam Huh, Marc St-Hilaire, Chung-Horng Lung, Ioannis Lambadaris, Aazam M., Huh E., Lung C., Lambadaris I.. Cloud Customer's Historical Record Based Resource Pricing. IEEE Transactions on Parallel and Distributed Systems. 2015; 27 (7):1929-1940.

Chicago/Turabian Style

Mohammad Aazam; Eui-Nam Huh; Marc St-Hilaire; Chung-Horng Lung; Ioannis Lambadaris; Aazam M.; Huh E.; Lung C.; Lambadaris I.. 2015. "Cloud Customer's Historical Record Based Resource Pricing." IEEE Transactions on Parallel and Distributed Systems 27, no. 7: 1929-1940.

Book chapter
Published: 18 August 2015 in Developments in Advanced Control and Intelligent Automation for Complex Systems
Reads 0
Downloads 0

With rapidly increasing Wireless Sensor Networks (WSNs) and Internet of Things (IoTs) based services; a lot of data is being generated. It is becoming very difficult to manage power constrained small sensors and other data generating devices. With IoTs, anything can become part of the Internet and generate data. Moreover, data generated needs to be managed according to its requirements, in order to create more valuable services. For this purpose, integration of IoTs with cloud computing is becoming very important. This new paradigm is termed as Cloud of Things (CoTs). CoTs provide means to handle increasing data and other resources of underlying IoTs and WSNs. It also helps in creating an extended portfolio of services that can be provided with this amalgamation. In future, CoTs are going to play a very vital role. In this chapter, the importance of CoT, its architecture, working, and the issues involved are discussed.

ACS Style

Mohammad Aazam; Eui-Nam Huh; Marc St-Hilaire; Chung-Horng Lung; Ioannis Lambadaris. Cloud of Things: Integration of IoT with Cloud Computing. Developments in Advanced Control and Intelligent Automation for Complex Systems 2015, 77 -94.

AMA Style

Mohammad Aazam, Eui-Nam Huh, Marc St-Hilaire, Chung-Horng Lung, Ioannis Lambadaris. Cloud of Things: Integration of IoT with Cloud Computing. Developments in Advanced Control and Intelligent Automation for Complex Systems. 2015; ():77-94.

Chicago/Turabian Style

Mohammad Aazam; Eui-Nam Huh; Marc St-Hilaire; Chung-Horng Lung; Ioannis Lambadaris. 2015. "Cloud of Things: Integration of IoT with Cloud Computing." Developments in Advanced Control and Intelligent Automation for Complex Systems , no. : 77-94.

Journal article
Published: 30 June 2015 in Aerospace
Reads 0
Downloads 0

An unmanned aerial ad hoc network (UAANET) is a special type of mobile ad hoc network (MANET). For these networks, researchers rely mostly on simulations to evaluate their proposed networking protocols. Hence, it is of great importance that the simulation environment of a UAANET replicates as much as possible the reality of UAVs. One major component of that environment is the movement pattern of the UAVs. This means that the mobility model used in simulations has to be thoroughly understood in terms of its impact on the performance of the network. In this paper, we investigate how mobility models affect the performance of UAANET in simulations in order to come up with conclusions/recommendations that provide a benchmark for future UAANET simulations. To that end, we first propose a few metrics to evaluate the mobility models. Then, we present five random entity mobility models that allow nodes to move almost freely and independently from one another and evaluate four carefully-chosen MANET/UAANET routing protocols: ad hoc on-demand distance vector (AODV), optimized link state routing (OLSR), reactive-geographic hybrid routing (RGR) and geographic routing protocol (GRP). In addition, flooding is also evaluated. The results show a wide variation of the protocol performance over different mobility models. These performance differences can be explained by the mobility model characteristics, and we discuss these effects. The results of our analysis show that: (i) the enhanced Gauss–Markov (EGM) mobility model is best suited for UAANET; (ii) OLSR, a table-driven proactive routing protocol, and GRP, a position-based geographic protocol, are the protocols most sensitive to the change of mobility models; (iii) RGR, a reactive-geographic hybrid routing protocol, is best suited for UAANET.

ACS Style

Jean-Daniel Medjo Me Biomo; Thomas Kunz; Marc St-Hilaire; Yifeng Zhou. Unmanned Aerial ad Hoc Networks: Simulation-Based Evaluation of Entity Mobility Models’ Impact on Routing Performance. Aerospace 2015, 2, 392 -422.

AMA Style

Jean-Daniel Medjo Me Biomo, Thomas Kunz, Marc St-Hilaire, Yifeng Zhou. Unmanned Aerial ad Hoc Networks: Simulation-Based Evaluation of Entity Mobility Models’ Impact on Routing Performance. Aerospace. 2015; 2 (3):392-422.

Chicago/Turabian Style

Jean-Daniel Medjo Me Biomo; Thomas Kunz; Marc St-Hilaire; Yifeng Zhou. 2015. "Unmanned Aerial ad Hoc Networks: Simulation-Based Evaluation of Entity Mobility Models’ Impact on Routing Performance." Aerospace 2, no. 3: 392-422.

Journal article
Published: 23 June 2015 in Mobile Networks and Applications
Reads 0
Downloads 0

LTE networks constitute a major evolution toward the All-IP concept; therefore, an efficient design/planning of these networks is crucial for providing various IP-based services such as VoIP and Rich Communication Services (RCS). Also, due to the heterogeneity of access technologies supported by the mobile core network, referred to as the Evolved Packet Core (EPC), the planning aspect becomes very important and is still a challenging task. Traffic modelling is an important part of the whole network planning process. Previous traffic modelling approaches tend to collect measurements regardless of how time consuming it is considered, while others find it easier to assume or predict values. The traffic model proposed in this paper considers different realistic parameters that can be used for LTE network planning and optimization. In fact, previous LTE planning work did not include all the parameters needed for the network planning process; their focus was mainly on bandwidth where other parameters were not considered. Therefore, it was necessary to come up with reasonable traffic profiles that take into consideration a variety of practical aspects such as signalling, bandwidth, busy hour session attempts and number of simultaneous EPS (Evolved Packet Systems) bearers. The traffic model proposed in this paper is considered a very important part of the network planning process for the EPC. The proposed solution is beneficial for Mobile Network Operators (MNOs) while they are in the deployment phase of 4G/LTE networks.

ACS Style

Dima Dababneh; Marc St-Hilaire; Christian Makaya. Data and Control Plane Traffic Modelling for LTE Networks. Mobile Networks and Applications 2015, 20, 449 -458.

AMA Style

Dima Dababneh, Marc St-Hilaire, Christian Makaya. Data and Control Plane Traffic Modelling for LTE Networks. Mobile Networks and Applications. 2015; 20 (4):449-458.

Chicago/Turabian Style

Dima Dababneh; Marc St-Hilaire; Christian Makaya. 2015. "Data and Control Plane Traffic Modelling for LTE Networks." Mobile Networks and Applications 20, no. 4: 449-458.

Preprint
Published: 05 May 2015
Reads 0
Downloads 0

This article addresses the residential energy cost optimization problem in smart grid. To date, most of the previous research only consider a partial aspect of the cost optimization problem. As a result, they fail to analyze scenarios when the interconnected components along with their properties have to be considered simultaneously. The proposed model combines these partial models into a single unified cost optimization model. Therefore, it is able to analyze scenarios which are closer to practical implementation. Furthermore, it is useful to analyze the behavior of a population (e.g., smart buildings, smart cities, etc.) and properties of the components for specific scenarios (e.g., the impact of aggregate storage capacity, etc.). It allows energy trading in microgrid which introduces a cost fairness problem. It ensures Pareto optimality among the households which guarantees that no household will be worse off to improve the cost of others. Results show that it can maintain the user preferences and can react to a demand response program by rescheduling the household loads and sources. Finally, the paper addresses the challenge of the computational complexity of the proposed model, showing that solution time increases exponentially with the problem size and proposes possible approaches to solve this.

ACS Style

Muhammad Raisul Alam; Marc St-Hilaire; Thomas Kunz. A Unified Residential Energy Cost Optimization Model for Smart Grid - Significance and Challenge. 2015, 1 .

AMA Style

Muhammad Raisul Alam, Marc St-Hilaire, Thomas Kunz. A Unified Residential Energy Cost Optimization Model for Smart Grid - Significance and Challenge. . 2015; ():1.

Chicago/Turabian Style

Muhammad Raisul Alam; Marc St-Hilaire; Thomas Kunz. 2015. "A Unified Residential Energy Cost Optimization Model for Smart Grid - Significance and Challenge." , no. : 1.

Journal article
Published: 14 November 2014 in IEEE Communications Letters
Reads 0
Downloads 0

In this letter, we propose a mathematical model for the controller placement problem in Software Defined Networks (SDN). More precisely, given a set of switches that must be managed by the controller(s), the model simultaneously determines the optimal number, location, and type of controller(s) as well as the interconnections between all the network elements. The goal of the model is to minimize the cost of the network while considering different constraints. The simulation results show that the model can be used to plan small scale SDN. When trying to solve larger instances of the problem, the solver is taking too much time and also running out of memory. The proposed model could be used by various enterprises and cloud-based networks to start integrating SDN or plan a new SDN.

ACS Style

Afrim Sallahi; Marc St-Hilaire. Optimal Model for the Controller Placement Problem in Software Defined Networks. IEEE Communications Letters 2014, 19, 30 -33.

AMA Style

Afrim Sallahi, Marc St-Hilaire. Optimal Model for the Controller Placement Problem in Software Defined Networks. IEEE Communications Letters. 2014; 19 (1):30-33.

Chicago/Turabian Style

Afrim Sallahi; Marc St-Hilaire. 2014. "Optimal Model for the Controller Placement Problem in Software Defined Networks." IEEE Communications Letters 19, no. 1: 30-33.

Journal article
Published: 15 September 2011 in Computer Communications
Reads 0
Downloads 0

This paper presents a scheme that employs TCP-aware network coding with opportunistic scheduling to enhance TCP throughput in wireless mobile ad hoc networks. Specifically, it considers a TCP parameter, congestion window size, and wireless channel conditions simultaneously to improve TCP throughput performance. Evaluation of this scheme is carried out by using ns2 simulations in different scenarios. The results show that the proposed scheme gives approximately 35% throughput improvement in a high mobility environment and about 33% throughput increase in no or low mobility environment as compared to traditional network coding with opportunistic scheduling. This paper also proposes a new adaptive-W (i.e., adaptive Waiting time) scheme whose objective is to adaptively control waiting time of overheard packets that are stored in a buffer to achieve tradeoff between throughput and overhead.

ACS Style

Tebatso Nage; F. Richard Yu; Marc St-Hilaire. TCP-aware network coding with opportunistic scheduling in wireless mobile ad hoc networks. Computer Communications 2011, 34, 1788 -1797.

AMA Style

Tebatso Nage, F. Richard Yu, Marc St-Hilaire. TCP-aware network coding with opportunistic scheduling in wireless mobile ad hoc networks. Computer Communications. 2011; 34 (15):1788-1797.

Chicago/Turabian Style

Tebatso Nage; F. Richard Yu; Marc St-Hilaire. 2011. "TCP-aware network coding with opportunistic scheduling in wireless mobile ad hoc networks." Computer Communications 34, no. 15: 1788-1797.

Journal article
Published: 23 May 2011 in Computer Networks
Reads 0
Downloads 0

In this paper, we investigate and compare, through extensive simulation, the use of three meta-heuristic algorithms in order to find “good” feasible solutions for the global topology planning problem of universal mobile telecommunications system (UMTS) networks. The latter has been shown to be NP-hard as it is composed of three different subproblems (each one being NP-hard): the cell planning subproblem, the access network planning subproblem and the core network planning subproblem. As a result, we concentrate our effort on the development of approximate algorithms based on tabu search, genetic algorithm and simulated annealing. Numerical results show that these three algorithms perform relatively well. The tabu search algorithm returns the best solutions (on average, within 1.04% of the optimal solution) while the genetic algorithm seems to be slightly faster than the other two. Finally, simulated annealing finds the worst solutions (on average, within 4.91% of the optimal solution) and takes much more time than the other two algorithms.

ACS Style

Marc St-Hilaire; Shangyun Liu. Comparison of different meta-heuristics to solve the global planning problem of UMTS networks. Computer Networks 2011, 55, 2705 -2716.

AMA Style

Marc St-Hilaire, Shangyun Liu. Comparison of different meta-heuristics to solve the global planning problem of UMTS networks. Computer Networks. 2011; 55 (12):2705-2716.

Chicago/Turabian Style

Marc St-Hilaire; Shangyun Liu. 2011. "Comparison of different meta-heuristics to solve the global planning problem of UMTS networks." Computer Networks 55, no. 12: 2705-2716.