Yazar "Hassan, Suhaidi" seçeneğine göre listele

Listeleniyor 1 - 5 / 5
  • Küçük Resim Yok
    Öğe
    An adaptive social-aware device-to-device communication mechanism for wireless networks
    (Elsevier, 2022) Alden, Feras Zen; Hassan, Suhaidi; Habbal, Adib; Wei, Xian
    Device-to-Device (D2D) communication is an essential element in 5G networks and beyond. It enables users to communicate either directly without network assistance or with minimum signaling through a base station. The enormous number of connected devices to the networks with high velocity of these users increases the complexity of establishing an effective and stable D2D connection when the user is moving among different available peers and modes in the network. So, the main objective for this research was to design an adaptive social-aware D2D communication mechanism to enhance the performance of D2D connection by improving procedures and efficiency of peer and mode selection. The mechanism consists of two schemes, namely the peer and mode selection schemes. The peer selection scheme includes two parts. Firstly, the peer evaluation is based on social choice theory through verifying the relationship between peers, and dividing the available peers into trusted peers and untrusted peers. The technical evaluation is based on HAW algorithm by including multi -attributes related to the connection quality to find the optimum trusted peer while excluding untrusted peers from the ranking. Secondly, the mode selection scheme evaluates the available modes based on the connection status while considering multi-attributes based on SAW algorithm to select and switch among available modes intelligently, based on the highest-ranking, to select the optimum mode. In this study, the proposed scenario considers the status of different numbers of users in the network to evaluate the proposed mechanism, and compared with two other recent approaches. The obtained results showed that the proposed mechanism out-performs other approaches in terms of delay, signal-to-noise ratio, delivery ratio, and throughput with better performance. It provides smooth switching between different modes and employs an automatic peering selection with trusted peers only.
  • Küçük Resim Yok
    Öğe
    A Context-aware Radio Access Technology selection mechanism in 5G mobile network for smart city applications
    (Academic Press Ltd- Elsevier Science Ltd, 2019) Habbal, Adib; Goudar, Swetha Indudhar; Hassan, Suhaidi
    The Fifth Generation (5G) mobile network will revolutionize the way of communication by supporting new innovative applications that require low latency and high data rates in smart city environments. In order to meet these applications' requirements, Ultra-Dense Network (UDN) is considered as one of the promising technological enablers in 5G. 5G UDN deployments are envisaged to be heterogeneous and dense, mainly through the provisioning of small cells such as picocells and femtocells, from different Radio Access Technologies (RATs). Nevertheless, various studies have reported that the densification is not always beneficial to the network performance. As the network density increases, this will pose further requirements and complexity of determining which RAT a user should connect with at a given time. Hence, an efficient RAT selection mechanism to choose the best Radio Access Technology among multiple available ones is a must. This paper proposes a new Context-aware Radio Access Technology (CRAT) selection mechanism that examines the context of the user and the networks in choosing the appropriate RAT to serve. A simplified conceptual model of the Context-aware RAT selection is introduced. Then, a mathematical model of CRAT considering the user and network context is derived, adopting Analytical Hierarchical Process (AHP) for weighting the importance of the selection criteria and TOPSIS for ranking the available RATs. The proposed CRAT was implemented and validated in NS3 simulation environment. The performance of the proposed mechanism was tested using two different scenarios within a smart city environment, called a shopping mall and urban city scenarios. The obtained results showed that CRAT outperforms the conventional approach namely A2A4 of RAT selection in terms of the number of handovers, average network delay, throughput, and packet delivery ratio.
  • Küçük Resim Yok
    Öğe
    Organizing Named Data Objects in Distributed Name Resolution System for Information-Centric Networks
    (Springer International Publishing Ag, 2020) Elbrieki, Walid; Hassan, Suhaidi; Arlimatti, Shivaleela; Habbal, Adib
    The Information-centric Networks (ICN), an important research direction of the future Internet architecture, has gained lot of attention from the research community. The aim is to improve the current Internet with a new architecture where the design is completely based on information instead of the host. The information is named and is called as Named Data Object (NDO), utilized for data registration and name resolution, and the system that translates the object identifiers to network address is known as Name Resolution System (NRS). The random NRS distribution and network segregation are important and challenging issues in increasing NDO registration and storage. It is challenging for a single NRS to handle more than 10(15) expected NDO's with low latency and good throughput, along with the issues interest flooding and interest congestion. To overcome these problems NRS is distributed based on the location of routers. The mechanism is called Distributed Name Resolution Mechanism (DNRM). The NDO storage needs to be organized to increase the scalability of NRS. Distributed hash table and Bloom Filter have their own problems such as high latency in individual element searching and member deletion respectively. To overcome the above-mentioned issues the Balance Binary Tree (BBT) data structure is introduced to manage large NDO storage. The implementation results reduce the end-to-end delay by increasing network throughput. The contribution of this study is significant in promoting the use of NRS in ICN for handling the heterogeneity of the future Internet.
  • Küçük Resim Yok
    Öğe
    The Role of Management Techniques for High-Performance Pending Interest Table: A Survey
    (Springer International Publishing Ag, 2020) Alubady, Raaid; Hassan, Suhaidi; Habbal, Adib
    Most of the services used by Internet consumers such as social network platforms, video-on-demand, on-line gaming, web Media, and IP Television which are content-centric in nature; meaning they focus on named content objects instead of being focused on the host-location. In this context, many projects around named data propose redesigning and developing the communication of Internet-based on named data. NDN (Named Data Networking) is an ideal solution to achieve efficient data sharing and retrieval since NDN focuses on the contents themselves regardless of their sources. The focus of this survey is a unique characteristic presented by NDN; PIT (Pending Interest table). PIT is part of three fundamental data structures newly introduced in the NDN router to enable full functionality of NDN. NDN router depends on reverse paths in PIT to return back Data packets to consumers. Accordingly, the PIT may present stringent restrictions in terms of scalability, for-warding, and management. The challenging task is the design of a scalable and manageable PIT because it requires per-packet updating and controlling the impact of increasing Interest packets with the highest Interest lifetime of PIT. Therefore, this survey describes into greater detail the background and several important previous researches related to issues of PIT which is PIT management based on PIT placement, and replacement, PIT implementation as a data structure, and Adaptive Interest Life-time. Thus, would assist in defining the general framework of this survey.
  • Küçük Resim Yok
    Öğe
    Software Defined Network Partitioning with Graph Partitioning Algorithms
    (Springer International Publishing Ag, 2020) Arlimatti, Shivaleela; Elbrieki, Walid; Hassan, Suhaidi; Habbal, Adib
    Software Defined Networks is an emerging paradigm in Internet communication world that increases the flexibility of today's networks by decoupling control plane and data plane of the network devices. The fundamental aim is to centralize the control and reduce the complexity of the networks. The communication medium between control and data plane is through OpenFlow protocol, an open standard network protocol designed to manage the network traffic by software programs. To increase the scalability and flexibility of controllers the OpenFlow controllers are distributed based on location and network types. However, most critical issue is minimizing the communication cost between the controller domains. In this paper, two graph partitioning algorithms Fiduccia-Matthyses algorithm and Kernighan-Lin algorithm are used to minimize the communication cost between distributed OpenFlow controller domains. The implementation of the algorithms is under Matlab simulation environment. The methodology used for the proposed algorithms is to interchange the elements from one domain to other domain to calculate the gain. The simulated results show that Kernighan-Lin algorithm minimizes more communication cost rather than the Fiduccia-Matthyses algorithm.