• Title/Summary/Keyword: Internet access networks

검색결과 556건 처리시간 0.02초

Wi-Fi 기반 차량 네트워크에서의 인터넷 처리율 분석 (Throughput Analysis in Vehicular Wi-Fi Networks)

  • 김원중;김영현;윤주상;백상헌
    • 정보처리학회논문지C
    • /
    • 제18C권1호
    • /
    • pp.45-50
    • /
    • 2011
  • 최근 무선 통신의 발달과 무선 접속 기기의 등장으로 인하여 언제, 어디서든 인터넷을 접속하여 다양한 응용 프로그램을 사용할 수 있게 되었다. 특히, 차량 네트워크의 발달로 이동 중인 차량에서도 인터넷 접속이 가능하게 되었다. 또한, 차량 네트워크와 관련된 다양한 연구들이 활발히 진행되고 있다. 본 논문에서는 실제로 쓰이는 다양한 차량 네트워크의 구조를 살펴보고, 각 구조에서 차량 내에서의 Wi-Fi와 외부의 네트워크를 종합적으로 고려하여 성능 측정을 하였다. 성능 측정 결과를 통해서 현재 사용되고 있는 차량 네트워크의 유용성을 판단하였다.

Kalman Filtering-based Traffic Prediction for Software Defined Intra-data Center Networks

  • Mbous, Jacques;Jiang, Tao;Tang, Ming;Fu, Songnian;Liu, Deming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권6호
    • /
    • pp.2964-2985
    • /
    • 2019
  • Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

Wireless Internet-IMT-2000/Wireless LAN Interworking

  • Roman pichna;Tero Ojanpera;Harro Posti;Jouni Karppinen
    • Journal of Communications and Networks
    • /
    • 제2권1호
    • /
    • pp.46-57
    • /
    • 2000
  • Ongoing standardization effort on 3G cellular system in 3GPP (UNTS) is based on GPRS core network and promises a global standard for systems capable of offering ubiquitous access to internet for mobile users. Considered radio access systems(FDD CDMA, TDD CDMA, and EDGE) are optimized for robust mobile use. However, there are alternative relatively high-rate radio interfaces being standardized for WLAN (IEEE802.11 and HIPER-LAN/2) which are capable of delivering significantly higher data rates to static or semi-static terminals with much less overhead. Also WPANs(BLUETOOTH, IEEE802.15), which will be present in virtually every mobile handset in the near future, are offering low cast and considerable access data rate and thus are very attractive for interworking scenarios. The prospect of using these interfaces as alternative RANs inthe modular UMTS architecture is very promising. Additionally, the recent inclusion of M-IP in the UMTS R99 standard opens the way for IP-level interfacing to the core network. This article offers an overview into WLAN-Cellular interworking. A brief overview of GPRS, UMTS cellular architectures and relevant WLAN standards is given. Possible interworking architectures are presented.

  • PDF

Access Control to Objects and their Description in the Future Network of Information

  • Renault, Eric;Ahmad, Ahmad;Abid, Mohamed
    • Journal of Information Processing Systems
    • /
    • 제6권3호
    • /
    • pp.359-374
    • /
    • 2010
  • The Future Internet that includes Real World Objects and the Internet of Things together with the more classic web pages will move communications from a nodecentric organization to an information-centric network allowing new a paradigm to take place. The 4WARD project initiated some works on the Future Internet. One of them is the creation of a Network of Information designed to enable more powerful semantic searches. In this paper, we propose a security solution for a model of information based on a semantic description and search of objects. The proposed solution takes into account both the access and the management of both objects and their descriptions.

Analysis of Channel Access Delay in CR-MAC Protocol for Ad Hoc Cognitive Radio Wireless Sensor Networks without a Common Control Channel

  • Joshi, Gyanendra Prasad;Nam, Seung Yeob;Acharya, Srijana;Kim, Sung Won
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권3호
    • /
    • pp.911-923
    • /
    • 2014
  • Ad hoc cognitive radio wireless sensor networks allow secondary wireless sensor nodes to recognize spectrum opportunities and transmit data. Most existing protocols proposed for ad hoc cognitive radio wireless sensor networks require a dedicated common control channel. Allocating one channel just for control packet exchange is a waste of resources for channel-constrained networks. There are very few protocols that do not rely on a common control channel and that exchange channel-negotiation control packets during a pre-allocated time on the data channels. This, however, can require a substantial amount of time to access the channel when an incumbent is present on the channel, where the nodes are intended to negotiate for the data channel. This study examined channel access delay on cognitive radio wireless sensor networks that have no dedicated common control channel.

Network Selection Algorithm Based on Spectral Bandwidth Mapping and an Economic Model in WLAN

  • Pan, Su;Zhou, Weiwei;Gu, Qingqing;Ye, Qiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권1호
    • /
    • pp.68-86
    • /
    • 2015
  • Future wireless network aims to integrate different radio access networks (RANs) to provide a seamless access and service continuity. In this paper, a new resource denotation method is proposed in the WLAN and LTE heterogeneous networks based on a concept of spectral bandwidth mapping. This method simplifies the denotation of system resources and makes it possible to calculate system residual capacity, upon which an economic model-based network selection algorithm is designed in both under-loaded and over-loaded scenarios in the heterogeneous networks. The simulation results show that this algorithm achieves better performance than the utility function-based access selection (UFAS) method proposed in [12] in increasing system capacity and system revenue, achieving load balancing and reducing the new call blocking probability in the heterogeneous networks.

A Simulation Study on Queueing Delay Performance of Slotted ALOHA under Time-Correlated Channels

  • Yoora Kim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제15권3호
    • /
    • pp.43-51
    • /
    • 2023
  • Slotted ALOHA (S-ALOHA) is a classical medium access control protocol widely used in multiple access communication networks, supporting distributed random access without the need for a central controller. Although stability and delay have been extensively studied in existing works, most of these studies have assumed ideal channel conditions or independent fading, and the impact of time-correlated wireless channels has been less addressed. In this paper, we investigate the queueing delay performance in S-ALOHA networks under time-correlated channel conditions by utilizing a Gilbert-Elliott model. Through simulation studies, we demonstrate how temporal correlation in the wireless channel affects the queueing delay performance. We find that stronger temporal correlation leads to increased variability in queue length, a larger probability of having queue overflows, and higher congestion levels in the S-ALOHA network. Consequently, there is an increase in the average queueing delay, even under a light traffic load. With these findings, we provide valuable insights into the queueing delay performance of S-ALOHA networks, supplementing the existing understanding of delay in S-ALOHA networks.

A Distributed Medium Access Control Protocol for Cognitive Radio Ad Hoc Networks

  • Joshi, Gyanendra Prasad;Kim, Sung Won;Kim, Changsu;Nam, Seung Yeob
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권1호
    • /
    • pp.331-343
    • /
    • 2015
  • We propose a distributed medium access control protocol for cognitive radio networks to opportunistically utilize multiple channels. Under the proposed protocol, cognitive radio nodes forecast and rank channel availability observing primary users' activities on the channels for a period of time by time series analyzing using smoothing models for seasonal data by Winters' method. The proposed approach protects primary users, mitigates channel access delay, and increases network performance. We analyze the optimal time to sense channels to avoid conflict with the primary users. We simulate and compare the proposed protocol with the existing protocol. The results show that the proposed approach utilizes channels more efficiently.

AAA System for PLMN-WLAN Internetworking

  • Janevski Toni
    • Journal of Communications and Networks
    • /
    • 제7권2호
    • /
    • pp.192-206
    • /
    • 2005
  • Integration of mobile networks and Internet has started with 2.5 generation of mobile cellular networks. Internet traffic is today dominant traffic type worldwide. The hanger for higher data rates needed for data traffic and new IP based services is essential in the development of future wireless networks. In such situation, even 3G with up to 2 Mbit/s has not provided data rates that are used by Internet users with fixed broadband dial-up or through wired local area networks. The solution to provide higher bit rates in wireless access network has been found in wireless LAN although initially it has been developed to extend wired LAN into wireless domain. In this paper, we propose and describe a solution created for interoperability between mobile cellular network and WLAN. The integration between two networks, cellular and WLAN, is performed on the authentication, authorization, and accounting, i.e., AAA side. For that purpose we developed WLAN access controller and WLAN AAA gateway, which provide gateway-type access control as well as charging and billing functionalities for the WLAN service. In the development process of these elements, we have considered current development stadium of all needed network entities and protocols. The provided solution provides cost-effective and easy-to-deploy PLMN-WLAN Internetworking scenario.

Fully secure non-monotonic access structure CP-ABE scheme

  • Yang, Dan;Wang, Baocang;Ban, Xuehua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권3호
    • /
    • pp.1315-1329
    • /
    • 2018
  • Ciphertext-policy attribute-based encryption (CP-ABE) associates ciphertext with access policies. Only when the user's attributes satisfy the ciphertext's policy, they can be capable to decrypt the ciphertext. Expressivity and security are the two directions for the research of CP-ABE. Most of the existing schemes only consider monotonic access structures are selectively secure, resulting in lower expressivity and lower security. Therefore, fully secure CP-ABE schemes with non-monotonic access structure are desired. In the existing fully secure non-monotonic access structure CP-ABE schemes, the attributes that are set is bounded and a one-use constraint is required by these projects on attributes, and efficiency will be lost. In this paper, to overcome the flaw referred to above, we propose a new fully secure non-monotonic access structure CP-ABE. Our proposition enforces no constraints on the scale of the attributes that are set and permits attributes' unrestricted utilization. Furthermore, the scheme's public parameters are composed of a constant number of group elements. We further compare the performance of our scheme with former non-monotonic access structure ABE schemes. It is shown that our scheme has relatively lower computation cost and stronger security.