This page has only limited features, please log in for full access.
The rapid adoption of Android devices comes with the growing prevalence of mobile malware, which leads to serious threats to mobile phone security and attacks private information on mobile devices. In this paper, we designed and implemented a model for malware detection on Android devices to protect private and financial information, for the mobile applications of the ATISCOM project. This model is based on client/server architecture, to reduce the heavy computations on a mobile device by sending data from the mobile device to the server for remote processing (i.e., offloading) of the predictions. We then gradually optimized our proposed model for better classification of the newly installed applications on Android devices. We at first adopted Naive Bayes to build the model with 92.4486% accuracy, then the classification method that gave the best accuracy of 93.85% for stochastic gradient descent (SGD) with binary class (i.e., malware and benign), and finally the regression method with numerical values ranging from −100 to 100 to manage the uncertainty predictions. Therefore, our proposed model with random forest regression gives a good accuracy in terms of performance, with a good correlation coefficient, minimum computation time and the smallest number of errors for malware detection.
Arthur Fournier; Franjieh El Khoury; Samuel Pierre. A Client/Server Malware Detection Model Based on Machine Learning for Android Devices. IoT 2021, 2, 355 -374.
AMA StyleArthur Fournier, Franjieh El Khoury, Samuel Pierre. A Client/Server Malware Detection Model Based on Machine Learning for Android Devices. IoT. 2021; 2 (3):355-374.
Chicago/Turabian StyleArthur Fournier; Franjieh El Khoury; Samuel Pierre. 2021. "A Client/Server Malware Detection Model Based on Machine Learning for Android Devices." IoT 2, no. 3: 355-374.
Mobile networks are expected to face major problems such as low network capacity, high latency, and limited resources but are expected to provide seamless connectivity in the foreseeable future. It is crucial to deliver an adequate level of performance for network services and to ensure an acceptable quality of services for mobile users. Intelligent mobility management is a promising solution to deal with the aforementioned issues. In this context, modeling user mobility behaviour is of great importance in order to extract valuable information about user behaviours and to meet their demands. In this paper, we propose a hybrid user mobility prediction approach for handover management in mobile networks. First, we extract user mobility patterns using a mobility model based on statistical models and deep learning algorithms. We deploy a vector autoregression (VAR) model and a gated recurrent unit (GRU) to predict the future trajectory of a user. We then reduce the number of unnecessary handover signaling messages and optimize the handover procedure using the obtained prediction results. We deploy mobility data generated from real users to conduct our experiments. The simulation results show that the proposed VAR-GRU mobility model has the lowest prediction error in comparison with existing methods. Moreover, we investigate the handover processing and transmission costs for predictive and non-predictive scenarios. It is shown that the handover-related costs effectively decrease when we obtain a prediction in the network. For vertical handover, processing cost and transmission cost improve, respectively, by 57.14% and 28.01%.
Nasrin Bahra; Samuel Pierre. A Hybrid User Mobility Prediction Approach for Handover Management in Mobile Networks. Telecom 2021, 2, 199 -212.
AMA StyleNasrin Bahra, Samuel Pierre. A Hybrid User Mobility Prediction Approach for Handover Management in Mobile Networks. Telecom. 2021; 2 (2):199-212.
Chicago/Turabian StyleNasrin Bahra; Samuel Pierre. 2021. "A Hybrid User Mobility Prediction Approach for Handover Management in Mobile Networks." Telecom 2, no. 2: 199-212.
Heterogeneous Vehicular Network (HetVNET) is a highly dynamic type of network that changes very quickly. Regarding this feature of HetVNETs and the emerging notion of network slicing in 5G technology, we propose a hybrid intelligent Software-Defined Network (SDN) and Network Functions Virtualization (NFV) based architecture. In this paper, we apply Conditional Generative Adversarial Network (CGAN) to augment the information of successful network scenarios that are related to network congestion and dynamicity. The results show that the proposed CGAN can be trained in order to generate valuable data. The generated data are similar to the real data and they can be used in blueprints of HetVNET slices.
Farnoush Falahatraftar; Samuel Pierre; Steven Chamberland. A Conditional Generative Adversarial Network Based Approach for Network Slicing in Heterogeneous Vehicular Networks. Telecom 2021, 2, 141 -154.
AMA StyleFarnoush Falahatraftar, Samuel Pierre, Steven Chamberland. A Conditional Generative Adversarial Network Based Approach for Network Slicing in Heterogeneous Vehicular Networks. Telecom. 2021; 2 (1):141-154.
Chicago/Turabian StyleFarnoush Falahatraftar; Samuel Pierre; Steven Chamberland. 2021. "A Conditional Generative Adversarial Network Based Approach for Network Slicing in Heterogeneous Vehicular Networks." Telecom 2, no. 1: 141-154.
The smart city is an ecosystem that interconnects various devices like sensors, actuators, mobiles, and vehicles. The intelligent and connected transportation system (ICTS) is an essential part of this ecosystem that provides new real-time applications. The emerging applications are based on Internet-of-Things (IoT) technologies, which bring out new challenges, such as heterogeneity and scalability, and they require innovative communication solutions. The existing routing protocols cannot achieve these requirements due to the surrounding knowledge supported by individual nodes and their neighbors, displaying partial visibility of the network. However, the issue grew ever more arduous to conceive routing protocols to satisfy the ever-changing network requirements due to its dynamic topology and its heterogeneity. Software-Defined Networking (SDN) offers the latest view of the entire network and the control of the network based on the application’s specifications. Nonetheless, one of the main problems that arise when using SDN is minimizing the transmission delay between ubiquitous nodes. In order to meet this constraint, a well-attended and realistic alternative is to adopt the Machine Learning (ML) algorithms as prediction solutions. In this paper, we propose a new routing protocol based on SDN and Naive Bayes solution to improve the delay. Simulation results show that our routing scheme outperforms the comparative ones in terms of end-to-end delay and packet delivery ratio.
Lamia El-Garoui; Samuel Pierre; Steven Chamberland. A New SDN-Based Routing Protocol for Improving Delay in Smart City Environments. Smart Cities 2020, 3, 1004 -1021.
AMA StyleLamia El-Garoui, Samuel Pierre, Steven Chamberland. A New SDN-Based Routing Protocol for Improving Delay in Smart City Environments. Smart Cities. 2020; 3 (3):1004-1021.
Chicago/Turabian StyleLamia El-Garoui; Samuel Pierre; Steven Chamberland. 2020. "A New SDN-Based Routing Protocol for Improving Delay in Smart City Environments." Smart Cities 3, no. 3: 1004-1021.
The primary goal of introducing device-to-device (D2D) communication underlaying cellular systems is to increase spectral efficiency (ES). However, it can lead to performance degradation caused by severe interference between cellular and D2D links. In addition, due to the complexity of control and management, direct connections between nearby devices are vulnerable. Thus, D2D communication is not robust against security threats and eavesdropping. However, if the physical layer security (PLS) concept is taken into account, the interference can help reduce eavesdropping. In this work, we address power control and resource block (RB) assignment problem to improve security of D2D communication and cellular network while satisfying the minimum rate requirements and power budget of the users. To solve this problem, we employ a decomposition method and individually address the power allocation and the RB assignment problem with lower complexity. However, RB assignment problem reduces to the three-dimensional matching problem, which is under NP-hard category and an optimal solution can be obtained through a complicated method such as Brute-force search or branch-and-bound with exponential time complexity. We, therefore, propose an approach based on tabu search (TS) meta-heuristic algorithm with reduced time complexity to globally find the near-optimal RB assignment solution. Moreover, we evaluate the performance of proposed scheme with a genetic algorithm (GA) based approach and other baseline methods. Simulation results show that the applied TS algorithm outperforms the GA since it employs both exploitation and exploration through a memory-based local search method and a perturbation mechanism, respectively. However, the GA, as a population-based method, focuses only on exploration by searching the entire search space without concentration on the current solution.
Amirhossein Feizi Ashtiani; Samuel Pierre. Power allocation and resource assignment for secure D2D communication underlaying cellular networks: A Tabu search approach. Computer Networks 2020, 178, 107350 .
AMA StyleAmirhossein Feizi Ashtiani, Samuel Pierre. Power allocation and resource assignment for secure D2D communication underlaying cellular networks: A Tabu search approach. Computer Networks. 2020; 178 ():107350.
Chicago/Turabian StyleAmirhossein Feizi Ashtiani; Samuel Pierre. 2020. "Power allocation and resource assignment for secure D2D communication underlaying cellular networks: A Tabu search approach." Computer Networks 178, no. : 107350.
In cloud computing, a fundamental management problem with the Infrastructure as a Service model lies in the efficient embedding of computing and networking resources onto distributed virtualized infrastructures. This issue, usually referred to as the Virtual Network Embedding (VNE) problem, has been well studied for a single Cloud Provider (CP). However, wide-area services delivery may require to embed heterogeneous resources over multiple CPs. This adds more complexity and scalability issues, since the Virtual Network Requests (VNRs) embedding process requires two phases of operation: the multi-cloud VNRs splitting, followed by the intra-cloud VNR segments mapping. This paper addresses the problem of VNE across multiple CPs by proposing a VNRs splitting strategy which aims at improving the performance and QoS of resulting VNR segments. An Integer Linear Program (ILP) is used to formalize the splitting phase as a maximization problem with constraints. Subsequently, in order to minimize the overall delay, a multi-objective intra-cloud resource mapping approach formalized as a Mixed-Integer Linear Program (MILP) is adopted. Simulations with the exact method show the efficiency of the proposed strategy based on several performance criteria. In particular, the acceptance rate and the delay are respectively improved by 15.1% and 18.5%, while preventing QoS violations.
Marieme Diallo; Alejandro Quintero; Samuel Pierre. A QoS-based splitting strategy for a resource embedding across multiple cloud providers. IEEE Transactions on Services Computing 2018, 1 -1.
AMA StyleMarieme Diallo, Alejandro Quintero, Samuel Pierre. A QoS-based splitting strategy for a resource embedding across multiple cloud providers. IEEE Transactions on Services Computing. 2018; (99):1-1.
Chicago/Turabian StyleMarieme Diallo; Alejandro Quintero; Samuel Pierre. 2018. "A QoS-based splitting strategy for a resource embedding across multiple cloud providers." IEEE Transactions on Services Computing , no. 99: 1-1.
Hazem Ahmed; Samuel Pierre; Alejandro Quintero. A flexible testbed architecture for VANET. Vehicular Communications 2017, 9, 115 -126.
AMA StyleHazem Ahmed, Samuel Pierre, Alejandro Quintero. A flexible testbed architecture for VANET. Vehicular Communications. 2017; 9 ():115-126.
Chicago/Turabian StyleHazem Ahmed; Samuel Pierre; Alejandro Quintero. 2017. "A flexible testbed architecture for VANET." Vehicular Communications 9, no. : 115-126.
Vehicular Ad Hoc Networks (VANets) is considered as a technology which can increase safety and convenience of drivers and passenger. Due to channel congestion in high density situation, VANets’ safety applications suffer of degradation of performance. In order to improve performance, reliability, and safety over VANets, congestion control should be taken into account. However, congestion control is a challenging task due to the special characteristics of VANets (e.g. high mobility, high rate of topology change, frequently broken rout, and so on). In this paper, DySch and TaSch strategies are proposed. Those strategies assign priorities to the safety and service messages based on the content of messages (static factor), state of network (dynamic factor) and size of messages. DySch and TaSch strategies schedule the messages dynamically and heuristically, respectively. Their performance is investigated using highway and urban scenarios while the average delay, average throughput, number of packet loss, packet loss ratio, and waiting delay in queues are considered. Simulation results show that DySch and TaSch strategies can significantly improve the performance of VANets in comparison to the best conventional strategies. Employing the proposed strategies to control congestion in VANets helps increase reliability and safety by giving higher priority to the safety messages.
Nasrin Taherkhani; Samuel Pierre. Prioritizing and scheduling messages for congestion control in vehicular ad hoc networks. Computer Networks 2016, 108, 15 -28.
AMA StyleNasrin Taherkhani, Samuel Pierre. Prioritizing and scheduling messages for congestion control in vehicular ad hoc networks. Computer Networks. 2016; 108 ():15-28.
Chicago/Turabian StyleNasrin Taherkhani; Samuel Pierre. 2016. "Prioritizing and scheduling messages for congestion control in vehicular ad hoc networks." Computer Networks 108, no. : 15-28.
To allow mobile node be always connected regardless of its location on the Internet, mobile IPv6 (MIPv6) is designed for next-generation wireless networks. However, this protocol has some inherent drawbacks: long handoff delay and high packet loss; unbearable for many applications. To improve the performance, mobility protocols such as Fast handovers for MIPv6 (FMIPv6), Fast handover for Hierarchical MIPv6 (F-HMIPv6), Simplified Fast handover for MIPv6 networks (SFMIPv6), are proposed by researchers. But none of them can support seamless mobility. This paper proposes an enhanced fast handover protocol with seamless mobility supports, called enhanced Seamless MIPv6 (e-SMIPv6). Bidirectional tunnels are established among access routers before actual handover; accordingly mobile users can use their previous care-of address within a new visiting network. To reduce the delay related to duplicate address detection, each access router maintains a pool of duplicate-free addresses. To minimize packet loss, access router performs bicasting for roaming node. Our proposal can minimize mobility signaling as much as possible during handoff, which presents an ideal solution for fast moving and ping-pong moving mobile users. To analyze the performance, the city section mobility model is used. Of which numerical results show that e-SMIPv6 yields better performance than FMIPv6.
Li Jun Zhang; Samuel Pierre. An enhanced fast handover with seamless mobility support for next-generation wireless networks. Journal of Network and Computer Applications 2014, 46, 322 -335.
AMA StyleLi Jun Zhang, Samuel Pierre. An enhanced fast handover with seamless mobility support for next-generation wireless networks. Journal of Network and Computer Applications. 2014; 46 ():322-335.
Chicago/Turabian StyleLi Jun Zhang; Samuel Pierre. 2014. "An enhanced fast handover with seamless mobility support for next-generation wireless networks." Journal of Network and Computer Applications 46, no. : 322-335.
MIPv6 is an IETF protocol that manages mobility, allowing a MN to continue to be reachable after an IP address change, result of a handover. However, when multicast applications are used, this address change results in a disruption of the service, because of the packet loss that occurs while the MN is rejoining the multicast group. Hence, we propose a new multicast scheme that provides a seamless multicast service during a handover in a MIPv6 network. The proposed scheme achieves its goal by adding a new node, denoted the MBA, whose role is to buffer the packets when the MN is performing the handover. These packets would otherwise be lost. We present an analysis of the buffer sizes to find the optimal sizes. Simulation results, obtained with OPNET, show that by properly sizing the buffers, seamless multicast handover can be achieved with the proposed scheme.
Georges Abou Khalil; Suresh Krishnan; Samuel Pierre. Seamless handover for multicast mobile IPv6 traffic. International Journal of Wireless and Mobile Computing 2014, 7, 1 .
AMA StyleGeorges Abou Khalil, Suresh Krishnan, Samuel Pierre. Seamless handover for multicast mobile IPv6 traffic. International Journal of Wireless and Mobile Computing. 2014; 7 (4):1.
Chicago/Turabian StyleGeorges Abou Khalil; Suresh Krishnan; Samuel Pierre. 2014. "Seamless handover for multicast mobile IPv6 traffic." International Journal of Wireless and Mobile Computing 7, no. 4: 1.
With mobile phones evolving every year, it is no surprise that recent surveys have shown that the worldwide number of mobile phone subscriptions reached 5.6 billion in 2011, becoming the largest pool of interconnected devices. Since mobile IP is the most-used protocol by mobile operators, the obvious solution to support more users in their network would be to replace it with MIPv6. In addition to integrating the newest IP stack, MIPv6 adds an important feature meant to replace the inefficient triangle routing by allowing an MN to communicate bidirectionally with the CN without passing through its home agent. However, the lack of preshared information between the MN and CN makes security for this RO mechanism a difficult challenge. MIPv6 adopts the RR mechanism that is only to verify the MN reachability in both its home address and care-of address without being a security feature. Other works have attempted to solve the multiple security issues in RR, but either their design was flawed or their assumptions were unrealistic. This paper presents a secure MIPv6 with a secure and efficient RO that uses DNSSEC to validate CGAs from trusted domains and provides strong authentication rather than the weak sender invariance security property. It integrates an enhanced cryptographically generated address (ECGA) based on a backward key chain that offers support to bind multiple logically linked CGAs together. ECGA tackles the time-memory tradeoff attacks with high efficiency. The validation through both AVANTSSAR and AVISPA platforms show that the proposed solution has no security flaw while still being lightweight in signaling messages on the radio network.
Angelo Rossi; Samuel Pierre; Suresh Krishnan. Secure Route Optimization for MIPv6 Using Enhanced CGA and DNSSEC. IEEE Systems Journal 2012, 7, 351 -362.
AMA StyleAngelo Rossi, Samuel Pierre, Suresh Krishnan. Secure Route Optimization for MIPv6 Using Enhanced CGA and DNSSEC. IEEE Systems Journal. 2012; 7 (3):351-362.
Chicago/Turabian StyleAngelo Rossi; Samuel Pierre; Suresh Krishnan. 2012. "Secure Route Optimization for MIPv6 Using Enhanced CGA and DNSSEC." IEEE Systems Journal 7, no. 3: 351-362.
In VANET, various limitations such as high mobility, high rate of topology changes, limitation of bandwidth, etc, play a significant role for reducing performance in these networks. Qualities of Service policies have been used to improve the performance of VANET. One of the significant parameters in Quality of Service is Congestion Control. The congestion control is used to ensure safe and reliable communication architecture. Three types of strategies are available for congestion control which consists of transmission power control, packet transmission frequently control and packet duration. Heuristic techniques can be used to define heuristic rules and finding feasible and good enough solution to some problems in reasonable time. According to heuristic's benefits, we are motivated to use these techniques in congestion control to generate efficient VANET. This work is aimed to improve congestion control with heuristic techniques to reduce the traffic communication channels while considering reliability requirements of applications in VANETs. The simulation results have demonstrated that meta-heuristic techniques features significantly better performance in terms of packet loss, throughput and delay compared with other congestion control algorithm within VANETs.
Nasrin Taherkhani; Samuel Pierre. Congestion control in vehicular ad hoc networks using meta-heuristic techniques. Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications - DIVANet '12 2012, 47 -54.
AMA StyleNasrin Taherkhani, Samuel Pierre. Congestion control in vehicular ad hoc networks using meta-heuristic techniques. Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications - DIVANet '12. 2012; ():47-54.
Chicago/Turabian StyleNasrin Taherkhani; Samuel Pierre. 2012. "Congestion control in vehicular ad hoc networks using meta-heuristic techniques." Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications - DIVANet '12 , no. : 47-54.
The 3rd Generation Partnership Project (3GPP) Release 8 defines the specifications of a low latency, high-data rate all-IP Core Network (CN) capable of supporting real-time packet services over multiple access technologies, including the new Long-Term Evolution (LTE) access network. The mobile communications industry is maturing. In order to remain competitive many operators now focus on reducing their capital and operational expenditures (CAPEX and OPEX), by outsourcing some of their business activities and/or by sharing some network infrastructures. This article presents a possible evolution of the 3GPP Policy and Charging Control (PCC) and Quality of Service (QoS) architecture to better support Fixed-Mobile Convergence (FMC) and more flexible CN sharing solutions. This goal is achieved with a clearer separation of the business roles (e.g. access and network providers) and the introduction of a Network Policy Function (NPF) for the management of the CN.
Stephane Ouellette; Laurent Marchand; Samuel Pierre. A potential evolution of the policy and charging control/QoS architecture for the 3GPP IETF-based evolved packet core. IEEE Communications Magazine 2011, 49, 231 -239.
AMA StyleStephane Ouellette, Laurent Marchand, Samuel Pierre. A potential evolution of the policy and charging control/QoS architecture for the 3GPP IETF-based evolved packet core. IEEE Communications Magazine. 2011; 49 (5):231-239.
Chicago/Turabian StyleStephane Ouellette; Laurent Marchand; Samuel Pierre. 2011. "A potential evolution of the policy and charging control/QoS architecture for the 3GPP IETF-based evolved packet core." IEEE Communications Magazine 49, no. 5: 231-239.
Liyan Zhang; Li Jun; Samuel Pierre. Performance Analysis of Seamless Handover in Mobile IPv6-based Cellular Networks. Cellular Networks - Positioning, Performance Analysis, Reliability 2011, 1 .
AMA StyleLiyan Zhang, Li Jun, Samuel Pierre. Performance Analysis of Seamless Handover in Mobile IPv6-based Cellular Networks. Cellular Networks - Positioning, Performance Analysis, Reliability. 2011; ():1.
Chicago/Turabian StyleLiyan Zhang; Li Jun; Samuel Pierre. 2011. "Performance Analysis of Seamless Handover in Mobile IPv6-based Cellular Networks." Cellular Networks - Positioning, Performance Analysis, Reliability , no. : 1.
Design space exploration is a delicate process whose success lays on the designers' shoulders. It is often based on a trial-and-error approach. Some basic metrics can be used to guide this process. In this paper, we explore accelerating loops from C-based specifications. We built a framework in which a design style, such as software-oriented or application-specific instruction-set processor (ASIP)-oriented design, can be specified. We also propose an exploration process that allows targeting the main aspects that limit acceleration and the actions that can be made to improve it. The process is based on new loop-oriented metrics that provide insight in key design issues. They help to determine which aspects of the design between data accesses and arithmetic logic unit (ALU)/control operations limit or allow leveraging loop acceleration opportunities. We profile some benchmarks from the signal and image processing fields, such as the Turbo Decoder and the JPEG algorithms, to illustrate how loop-oriented metrics help to point out aspects that limit or improve loop acceleration. The loop acceleration process was also used to explore design architectures that can leverage, as much as possible, the loop acceleration opportunities of the sum of absolute differences (SAD) algorithm.
Mame Maria Mbaye; Normand Belanger; Yvon Savaria; Samuel Pierre. Loop Acceleration Exploration for ASIP Architecture. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 2011, 20, 684 -696.
AMA StyleMame Maria Mbaye, Normand Belanger, Yvon Savaria, Samuel Pierre. Loop Acceleration Exploration for ASIP Architecture. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 2011; 20 (4):684-696.
Chicago/Turabian StyleMame Maria Mbaye; Normand Belanger; Yvon Savaria; Samuel Pierre. 2011. "Loop Acceleration Exploration for ASIP Architecture." IEEE Transactions on Very Large Scale Integration (VLSI) Systems 20, no. 4: 684-696.
Marc St-Hilaire; Samuel Pierre. Cellular Network Planning. Advances in E-Business Research 2011, 515 -525.
AMA StyleMarc St-Hilaire, Samuel Pierre. Cellular Network Planning. Advances in E-Business Research. 2011; ():515-525.
Chicago/Turabian StyleMarc St-Hilaire; Samuel Pierre. 2011. "Cellular Network Planning." Advances in E-Business Research , no. : 515-525.
This chapter provides a survey of IP layer mobility management protocols in next generation wireless networks. In all-IP-based next generation wireless networks, mobile nodes freely change their points of attachment to the network while communicating with correspondent nodes. Hence, mobility management consists of a critical issue, which is to track mobile users’ current location and to efficiently route packets to them. This chapter elaborates the mobility management procedure for the protocols such as mobility support in IPv6 (MIPv6), hierarchical mobile IPv6 mobility management (HMIPv6), fast handovers for mobile IPv6 (FMIPv6), fast handover for hierarchical mobile IPv6 (F-HMIPv6) and proxy mobile IPv6 (PMIPv6). Furthermore, future trends about mobility management are described as well. He authors hope that understanding these mobility management protocols can not only help the researchers to find more advanced solutions in this field, but also provide a training toolkit within the mobile operators.
Li Jun Zhang; Liyan Zhang; Laurent Marchand; Samuel Pierre. A Survey of IP Layer Mobility Management Protocols in Next Generation Wireless Networks. Next Generation Mobile Networks and Ubiquitous Computing 2010, 79 -93.
AMA StyleLi Jun Zhang, Liyan Zhang, Laurent Marchand, Samuel Pierre. A Survey of IP Layer Mobility Management Protocols in Next Generation Wireless Networks. Next Generation Mobile Networks and Ubiquitous Computing. 2010; ():79-93.
Chicago/Turabian StyleLi Jun Zhang; Liyan Zhang; Laurent Marchand; Samuel Pierre. 2010. "A Survey of IP Layer Mobility Management Protocols in Next Generation Wireless Networks." Next Generation Mobile Networks and Ubiquitous Computing , no. : 79-93.
With the growing interest in converging fixed and mobile networks (FMC), mobile applications will require more and more resources from both the network and the mobile device. In such context, multicasting is essential because it lowers bandwidth consumption by simultaneously reaching a group of multiple recipients. Securing multicast flows has been extensively studied in the past, but none of the existing solutions were meant to handle the constraints imposed by mobile scenarios, in particular the high packet-loss rate. The need for a low overhead self-healing rekeying mechanism that is scalable, reliable and suitable for mobile environments has never been more urgent than with the arrival of FMC in 4G networks. This paper presents two self-healing recovery schemes based on the dual directional hash chains (DDHC) for the logical key hierarchy (LKH) rekeying protocol. This enables a member that has missed up to m consecutive key updates to recover the missing decryption keys without asking the group controller key server (GCKS) for retransmission. Conducted simulations show considerable improvements in the ratio of decrypted messages and in the rekey message overhead in high packet loss environments.
Angelo Rossi; Samuel Pierre; Suresh Krishnan. An Efficient and Secure Self-Healing Scheme for LKH. Journal of Network and Systems Management 2010, 18, 327 -347.
AMA StyleAngelo Rossi, Samuel Pierre, Suresh Krishnan. An Efficient and Secure Self-Healing Scheme for LKH. Journal of Network and Systems Management. 2010; 18 (3):327-347.
Chicago/Turabian StyleAngelo Rossi; Samuel Pierre; Suresh Krishnan. 2010. "An Efficient and Secure Self-Healing Scheme for LKH." Journal of Network and Systems Management 18, no. 3: 327-347.
Minimizing energy dissipation and maximizing network lifetime are among the central concerns when designing applications and protocols for sensor networks. Clustering has been proven to be energy-efficient in sensor networks since data routing and relaying are only operated by cluster heads. Besides, cluster heads can process, filter and aggregate data sent by cluster members, thus reducing network load and alleviating the bandwidth. In this paper, we propose a novel distributed clustering algorithm where cluster heads are elected following a three-way message exchange between each sensor and its neighbors. Sensor’s eligibility to be elected cluster head is based on its residual energy and its degree. Our protocol has a message exchange complexity of O(1) and a worst-case convergence time complexity of O(N). Simulations show that our algorithm outperforms EESH, one of the most recently published distributed clustering algorithms, in terms of network lifetime and ratio of elected cluster heads.
Ali Chamam; Samuel Pierre. A distributed energy-efficient clustering protocol for wireless sensor networks. Computers & Electrical Engineering 2010, 36, 303 -312.
AMA StyleAli Chamam, Samuel Pierre. A distributed energy-efficient clustering protocol for wireless sensor networks. Computers & Electrical Engineering. 2010; 36 (2):303-312.
Chicago/Turabian StyleAli Chamam; Samuel Pierre. 2010. "A distributed energy-efficient clustering protocol for wireless sensor networks." Computers & Electrical Engineering 36, no. 2: 303-312.
The next generation mobile networks (4G) is expected to integrate a large number of heterogeneous wireless systems. Practically, metropolitan networks will play an important role in such integration since they include a great variety of mobile systems. Mobility management as well as the integration of existing/future wireless technologies remain an important task to be investigated. A number of interworking proposals are available in the literature, yet none can claim to be the ultimate and unique integrated solution. Moreover, these proposals fail to guarantee seamless mobility and service continuity. This paper proposes a one suite integration solution that includes a Hybrid Interworking Architecture (HIA) for metropolitan networks coupled with a cross layer mobility scheme that aims to guarantee seamless roaming through homogeneous and heterogeneous mobile systems within a city coverage. Performance analyses show that our proposals exhibit net improvements of QoS guarantee compared to existing solutions.
Abdellatif Ezzouhairi; Alejandro Quintero; Samuel Pierre. Towards cross layer mobility support in metropolitan networks. Computer Communications 2010, 33, 202 -221.
AMA StyleAbdellatif Ezzouhairi, Alejandro Quintero, Samuel Pierre. Towards cross layer mobility support in metropolitan networks. Computer Communications. 2010; 33 (2):202-221.
Chicago/Turabian StyleAbdellatif Ezzouhairi; Alejandro Quintero; Samuel Pierre. 2010. "Towards cross layer mobility support in metropolitan networks." Computer Communications 33, no. 2: 202-221.