ANALYSIS OF USER MOBILITY PERFORMANCE ON SOFTWARE DEFINED WIRELESS NETWORK USING DIJKSTRA ALGORITHM

  Over the last decade, wireless devices have developed rapidly until predictions will develop with high complexity and dynamic. So that new capabilities are needed for wireless problems in this problem. Software Defined Network (SDN) is generally a wire-based network, but to meet the needs of users in terms of its implementation, it has begun to introduce a Wireless-based SDN called Software Defined Wireless Network (SDWN) which provides good service quality and reach and higher tools, so as to be able to provide new capabilities to wireless in a high complexity and very dynamic. When SDN is implemented in a wireless network it will require a routing solution that chooses paths due to network complexity. In this paper, SDWN is tested by being applied to mesh topologies of 4,6 and 8 access points (AP) because this topology is very often used in wireless-based networks. To improve network performance, Dijkstra's algorithm is added with the user mobility scheme used is RandomDirection. The Dijkstra algorithm was chosen because it is very effective compared to other algorithms. The performance measured in this study is Quality of Service (QoS), which is a parameter that indicates the quality of data packets in a network. The measurement results obtained show that the QoS value in this study meets the parameters considered by the ITU-T G1010 with a delay value of 1.3 ms for data services and packet loss below 0.1%. When compared with the ITU-T standard, the delay and packet loss fall into the very good category