Wireless Access Point

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 1671 Experts worldwide ranked by ideXlab platform

Joko Triyono - One of the best experts on this subject based on the ideXlab platform.

  • ANALISISKINERJA Wireless Access Point (WAP)DANVIRTUAL Access Point (VAP) PADA MIKROTIK RB951Ui-2HnD
    Jurnal Jarkom, 2017
    Co-Authors: Safrial Amri, Yuliana Rachmawati, Joko Triyono
    Abstract:

    Wireless Access Point adalah perangkat keras yang memungkinkan perangkat Wireless lain (seperti laptop, ponsel) untuk terhubung ke jaringan kabel menggunakan Wi-fi, bluetooth atau perangkat standar lainnya. Wireless Access Point umumnya dihubungkan ke router melalui jaringan kabel (kebanyakan telah terintegrasi dengan router) dan dapat digunakan untuk saling mengirim data antar perangkat Wireless dan perangkat kabel pada jaringan. salah satu Perangkat yang dibutuhkan untuk membangun sebuah jaringan Wireless yaitu Mikrotik RB951Ui-2HnD merupakan satu dari seri Wireless RouterBoard keluaran MikroTik yang berfungsi sebagai router sekaligus Accsess Point (AP) yang dirancang khusus untuk SOHO (Small Office Home Office). Virtual Access Point (VAP) adalah salah satu fitur Multiple SSID yang ada pada router mikrotik, dengan Virtual AP memungkinkan sebuah perangkat yang hanya memiliki satu fisik interface Wireless bisa memancarkan lebih dari 1 SSID. Implementasi pengujian kinerja jaringan WAP & VAP pada mikrotik RB 951 Ui-2Hnd menggunakan sebuah komputer server, komputer client, dan sebuah Access Point. Pengujian dilakukan dengan analisa parameter Quality Of Service (QOS) diantaranya delay, packet loss, jitter, throughput, dan kecepatan upload download. Pengujian tersebut dilakukan dalam tiga kondisi yang berbeda yaitu kondisi sepi, kondisi sedang dan kondisi padat. Hasil dari analisis dan perbandingan WAP dan VAP rata-rata dari kondisi sepi, sedang dan padat. Delay WAP lebih baik dari pada VAP dengan rata-rata delay53.281 ms, untuk jitter WAP lebih baik dari VAP dengan rata-rata jitter12.421 ms, sedangkan untuk packet loss WAP lebih baik dari VAP mendapatkan persentase 0,1 % dan untuk throughput VAP lebih baik dibandingkan dengan WAP dengan rata-rata 12.049 mbps. Kata Kunci: Wireless, router, mikrotik, Access Point, virtual Access Point, QOS.

  • ANALISIS KINERJA Wireless Access Point ( WAP ) DAN VIRTUAL Access Point ( VAP ) PADA MIKROTIK RB951Ui-2HnD
    JARKOM, 2017
    Co-Authors: Safrial Amri, Joko Triyono
    Abstract:

    Wireless Access Point is a hardware device that allows other Wireless devices (such as laptops, mobile phone) to connect to a wired network using Wi-Fi, Bluetooth or other standard devices. Wireless Access Point is generally connected to the router via a network cable (most have already been integrated with the router) and can be used to send each other data between Wireless devices and wired devices on the network. one of the tools needed to build a Wireless network that is Mikrotik RB951Ui-2HnD is one of a series Wireless MikroTik RouterBoard output that serves as a router at the same Access Point (AP) which is specifically designed for SOHO (Small Office Home Office). Virtual Access Point (VAP) is one of the features of existing Multiple SSID on the router proxy, by Virtual AP enables a device that has only one physical Wireless interface can transmit more than one SSID. Implementation of network performance testing on a proxy WAP & VAP RB 951 Ui-2HnD using a server computer, the client computer and an Access Point. Testing is done by analyzing the parameters of Quality of Service (QOS) including delay, packet loss, jitter, throughput, download and upload speeds. The tests are carried out in three different conditions which lonely condition, condition and condition were solid. The results of the analysis and comparison of WAP and VAP average of quiet conditions, moderate and dense. Delay WAP better than VAP with an average delay of 53 281 ms, for WAP jitter better than VAP with an average of 12 421 ms jitter, packet loss while WAP is better than VAP gets a percentage of 0.1% and for throughput VAP more good compared to WAP with an average of 12 049 mbps Keywords:

Dong Xuan - One of the best experts on this subject based on the ideXlab platform.

  • Two Birds With One Stone: Wireless Access Point Deployment for Both Coverage and Localization
    IEEE Transactions on Vehicular Technology, 2011
    Co-Authors: Lin Liao, Weifeng Chen, Chuanlin Zhang, Lizhuo Zhang, Dong Xuan
    Abstract:

    Wireless Access Points (APs) divide a plane into small areas where their coverage ranges overlap. A mobile device can be located within a particular small overlapped area based on the unique set of APs covering the device. We formally define an Optimal Loc-deployment problem for both coverage and area localization. Our objective is to deploy a minimum number of APs that provide full communication coverage while achieving the ability to locate a mobile device within a certain area no larger than a given accuracy parameter. We obtain a formula that precisely determines the optimal solution for more than half of the accuracy values. For the rest of the accuracy values, we propose an algorithm that will return an approximation whose difference to the optimal solution is less than ε for any ε >; 0. Finally, we conduct extensive numerical evaluation and real experiments to validate our proposed solutions.

P. Krishnan - One of the best experts on this subject based on the ideXlab platform.

  • GLOBECOM - Estimating signal strength coverage for a Wireless Access Point
    IEEE Global Telecommunications Conference 2004. GLOBECOM '04., 2004
    Co-Authors: M. Kappes, A.s. Krishnakumar, P. Krishnan
    Abstract:

    Estimating the signal strength coverage of a Wireless Access Point (AP), given its desired location at a site, is essential in many instances, e.g., to determine optimal AP placement. In this paper, we present a new non-parametric modeling solution, based on sampling, for this problem. We use sample measurements from several fixed APs in a novel way to compute a signal coverage model for an AP at a random location. Our technique automatically takes into account the signal strength propagation characteristics of the site and also allows for an efficient deployment methodology. We present an experimental study that validates the practical usability of the proposed technique.

  • Estimating signal strength coverage for a Wireless Access Point
    IEEE Global Telecommunications Conference 2004. GLOBECOM '04., 2004
    Co-Authors: M. Kappes, A.s. Krishnakumar, P. Krishnan
    Abstract:

    Estimating the signal strength coverage of a Wireless Access Point (AP), given its desired location at a site, is essential in many instances, e.g., to determine optimal AP placement. In this paper, we present a new non-parametric modeling solution, based on sampling, for this problem. We use sample measurements from several fixed APs in a novel way to compute a signal coverage model for an AP at a random location. Our technique automatically takes into account the signal strength propagation characteristics of the site and also allows for an efficient deployment methodology. We present an experimental study that validates the practical usability of the proposed technique.

Lin Liao - One of the best experts on this subject based on the ideXlab platform.

  • Two Birds With One Stone: Wireless Access Point Deployment for Both Coverage and Localization
    IEEE Transactions on Vehicular Technology, 2011
    Co-Authors: Lin Liao, Weifeng Chen, Chuanlin Zhang, Lizhuo Zhang, Dong Xuan
    Abstract:

    Wireless Access Points (APs) divide a plane into small areas where their coverage ranges overlap. A mobile device can be located within a particular small overlapped area based on the unique set of APs covering the device. We formally define an Optimal Loc-deployment problem for both coverage and area localization. Our objective is to deploy a minimum number of APs that provide full communication coverage while achieving the ability to locate a mobile device within a certain area no larger than a given accuracy parameter. We obtain a formula that precisely determines the optimal solution for more than half of the accuracy values. For the rest of the accuracy values, we propose an algorithm that will return an approximation whose difference to the optimal solution is less than ε for any ε >; 0. Finally, we conduct extensive numerical evaluation and real experiments to validate our proposed solutions.

  • Wireless Access Point Deployment for Both Coverage and Localization
    2010 IEEE Fifth International Conference on Networking Architecture and Storage, 2010
    Co-Authors: Lin Liao, Weifeng Chen, Chuanlin Zhang, Lizhuo Zhang
    Abstract:

    Wireless Access Points (APs) divide a plane into small areas where their coverage ranges overlap. A mobile device can be located within a particular small overlapped area based on the unique set of APs covering the device. We formally define an optimal AP deployment problem for both coverage and area localization. Our objective is to deploy a minimum number of APs that provide full communication coverage while achieving the ability to locate a mobile device within a certain area no larger than a given accuracy parameter. We propose a set of optimal solutions and approximations to this problem under the diamond pattern, a deployment pattern that has been shown to achieve optimal coverage in most cases. We conduct extensive numerical evaluation as well as real experiments to validate our proposed solutions.

  • NAS - Wireless Access Point Deployment for Both Coverage and Localization
    2010 IEEE Fifth International Conference on Networking Architecture and Storage, 2010
    Co-Authors: Lin Liao, Weifeng Chen, Chuanlin Zhang, Lizhuo Zhang
    Abstract:

    Wireless Access Points (APs) divide a plane into small areas where their coverage ranges overlap. A mobile device can be located within a particular small overlapped area based on the unique set of APs covering the device. We formally define an optimal AP deployment problem for both coverage and area localization. Our objective is to deploy a minimum number of APs that provide full communication coverage while achieving the ability to locate a mobile device within a certain area no larger than a given accuracy parameter. We propose a set of optimal solutions and approximations to this problem under the diamond pattern, a deployment pattern that has been shown to achieve optimal coverage in most cases. We conduct extensive numerical evaluation as well as real experiments to validate our proposed solutions.

Dennis Bushmitch - One of the best experts on this subject based on the ideXlab platform.

  • MINIREVIEW ARTICLES Latency Assurances for Multi-Class Traffic at the QoS-Capable Home Network Wireless Access Point (Tutorial) *
    2020
    Co-Authors: Chaiwat Oottamakorn, Dennis Bushmitch
    Abstract:

    Emerging broadband networks and technologies have changed the way of home network provision. Provisioning the broadband services has merely accelerated the complexity of home networks to grow. The services demanded by applications are still inadequate under current home network infrastructures. These services require different Quality of Service (QoS) requirements from the networks. As Wireless-based communication within the home (e.g. 802.11×) gains wide acceptance because of its mature protocol, becoming the predominant technology for home networking, the question of efficient QoS-aware Wireless Access Point resource allocation and scheduling function implementation arises. In this article we present a resource management and scheduling algorithm for a QoS-aware Wireless Access Point for use in enterprise and home network solutions. The presented algorithm provides delay and packet loss service guarantees to a diverse set of application traffic classes, produced as a result of convergence of home entertainment and data networks. The algorithm is simple, controllable, and scalable for implementation with the support of both absolute and relative QoS guarantees to multi-class traffic.

  • Latency Assurances for Multi-Class Traffic at the QoS-Capable Home Network Wireless Access Point (Tutorial)
    2011
    Co-Authors: Chaiwat Oottamakorn, Dennis Bushmitch
    Abstract:

    Emerging broadband networks and technologies have changed the way of home network provision. Provisioning the broadband services has merely accelerated the complexity of home networks to grow. The services demanded by applications are still inadequate under current home network infrastructures. These services require different Quality of Service (QoS) requirements from the networks. As Wireless-based communication within the home (e.g. 802.11´) gains wide acceptance because of its mature protocol, becoming the predominant technology for home networking, the question of efficient QoS-aware Wireless Access Point resource allocation and scheduling function implementation arises. In this article we present a resource management and scheduling algorithm for a QoS-aware Wireless Access Point for use in enterprise and home network solutions. The presented algorithm provides delay and packet loss service guarantees to a diverse set of application traffic classes, produced as a result of convergence of home entertainment and data networks. The algorithm is simple, controllable, and scalable for implementation with the support of both absolute and relative QoS guarantees to multi-class traffic.

  • CCNC - Resource management and scheduling for the QoS-capable home network Wireless Access Point
    2003 International Symposium on VLSI Technology Systems and Applications. Proceedings of Technical Papers. (IEEE Cat. No.03TH8672), 2004
    Co-Authors: Chaiwat Oottamakorn, Dennis Bushmitch
    Abstract:

    We propose and evaluate a resource management and scheduling algorithm for a quality of service (QoS)-aware Wireless Access router for use in enterprise and home network solutions. The proposed algorithm provides delay and packet loss service guarantees to a diverse set of application traffic classes, produced as a result of convergence of home entertainment and data networks. The algorithm provides both relative and absolute (where applicable) QoS guarantees to traffic classes. One of the key results of our work is the development of an efficient procedure for capturing the predictive traffic characteristics and performances by monitoring ongoing traffic arrivals. This allows the Wireless router's resource management while determining sufficient service rate for each traffic class in order to meet its QoS requirements. Key features of the algorithm are its scalable implementation and the effectiveness of QoS controls it extends. We also present the simulation results, which demonstrate algorithm's efficiency in handling the variety of real-time data.

  • Resource management and scheduling for the QoS-capable home network Wireless Access Point
    First IEEE Consumer Communications and Networking Conference 2004. CCNC 2004., 2004
    Co-Authors: Chaiwat Oottamakorn, Dennis Bushmitch
    Abstract:

    We propose and evaluate a resource management and scheduling algorithm for a quality of service (QoS)-aware Wireless Access router for use in enterprise and home network solutions. The proposed algorithm provides delay and packet loss service guarantees to a diverse set of application traffic classes, produced as a result of convergence of home entertainment and data networks. The algorithm provides both relative and absolute (where applicable) QoS guarantees to traffic classes. One of the key results of our work is the development of an efficient procedure for capturing the predictive traffic characteristics and performances by monitoring ongoing traffic arrivals. This allows the Wireless router's resource management while determining sufficient service rate for each traffic class in order to meet its QoS requirements. Key features of the algorithm are its scalable implementation and the effectiveness of QoS controls it extends. We also present the simulation results, which demonstrate algorithm's efficiency in handling the variety of real-time data.