• 제목/요약/키워드: Wireless Networks Service

검색결과 935건 처리시간 0.031초

무선 망에서의 지연 비례 인터넷 차별화 서비스 제공을 위한 스케줄링 알고리즘 (Wireless Packet Scheduling Algorithm for Delay Proportional Internet Differentiated Services)

  • 유상조;이훈철
    • 대한전자공학회논문지TC
    • /
    • 제40권6호
    • /
    • pp.225-236
    • /
    • 2003
  • 본 논문에서는 인터넷 차별화 서비스 구조인 지연 비례 서비스를 무선 망 환경에서도 제공할 수 있는 WDPS(Wireless Delay Proportional Service) 스케줄링 알고리즘을 제안한다. WDPS는 무선 망의 버스트 하고 위치-종속적인 채널 에러 특성을 고려하여 현재까지 서비스 된 클래스간 지연 서비스 정도를 근거로 적응적으로 다음에 서비스할 클래스를 선택한다. 제안된 스케줄링 방법은 무선 망 에러로 생기는 클래스큐의 블록킹 문제를 해결하고, 클래스간 공정한 지연 서비스 품질을 제공하며 서비스 보상이 점진적으로 이루어져 하나의 클래스가 독점적으로 무선자원을 사용하지 못하도록 하였다. 모의 실험에서는 제안된 WDPS 스케줄링 방법을 사용하여 기존 인터넷 지연 차별화 서비스를 무선 망에서도 원하는 서비스 요구조건에 맞게 서비스 할 수 있음을 보였다.

Hierarchical Real-Time MAC Protocol for (m,k)-firm Stream in Wireless Sensor Networks

  • Teng, Zhang;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • 제8권2호
    • /
    • pp.212-218
    • /
    • 2010
  • In wireless sensor networks (WSNs), both efficient energy management and Quality of Service (QoS) are important issues for some applications. For creating robust networks, real-time services are usually employed to satisfy the QoS requirements. In this paper, we proposed a hierarchical real-time MAC (medium access control) protocol for (m,k)-firm constraint in wireless sensor networks shortly called HRTS-MAC. The proposed HRTS-MAC protocol is based on a dynamic priority assignment by (m,k)-firm constraint. In a tree structure topology, the scheduling algorithm assigns uniform transmitting opportunities to each node. The paper also provides experimental results and comparison of the proposed protocol with E_DBP scheduling algorithm.

Power-Efficient Rate Allocation of Wireless Access Networks with Sleep-Operation Management for Multihoming Services

  • Lee, Joohyung;Yun, Seonghwa;Oh, Hyeontaek;Newaz, S.H. Shah;Choi, Seong Gon;Choi, Jun Kyun
    • Journal of Communications and Networks
    • /
    • 제18권4호
    • /
    • pp.619-628
    • /
    • 2016
  • This paper describes a theoretical framework for rate allocation to maximize the power efficiency of overall heterogeneous wireless networks whose users are assumed to have multihoming capabilities. Therefore, the paper first presents a power consumption model considering the circuit power and radio transmission power of each wireless network. Using this model, two novel power efficient rate allocation schemes (PERAS) for multihoming services are proposed. In this paper, the convex optimization problem for maximizing the power efficiency over wireless networks is formulated and solved while guaranteeing the required quality of service (QoS). Here, both constant bit rate and variable bit rate services are considered. Furthermore, we extend our theoretical framework by considering the sleep-operation management of wireless networks. The performance results obtained from numerical analysis reveal that the two proposed schemes offer superior performance over the existing rate allocation schemes for multihoming services and guarantee the required QoS.

Bridging Solutions for a Heterogeneous WiMAX-WiFi Scenario

  • Fantacci, Romano;Tarchi, Daniele
    • Journal of Communications and Networks
    • /
    • 제8권4호
    • /
    • pp.369-377
    • /
    • 2006
  • Recently, the metropolitan area network (MAN) has attracted much attention in telecommunication research and has emerged as one of the most important research topics in the community. Several standards representing the first step for developing metropolitan networks have been published; IEEE 802.16 (WiMAX) has taken a relevant role in reaching the goal of realizing a full-service network all over a urban and suburban area. At the same time, the wireless local area networks (WLAN) have been widely used for in-home or short range communications, mainly basing on the IEEE 802.11 (WiFi) standard. A consequence is the increasing interest in interworking technology, that allows an interconnection between different standards by maintaining certain properties, mainly in terms of quality of service (QoS). One of the major issues is to design bridging devices capable of transparently interconnect different wireless technologies. In this paper, we propose two interconnection bridging solutions between WiMAX and WiFi links; the first is more based on the concept of maintaining a certain end-to-end QoS level independently from the wireless technologies used. The second method is more devoted to the reduction of the implementation complexity at the cost of no QoS assurance. The performance of the two methods are compared by resorting to computer simulations showing the advantages of each one technique.

네트워크 통합관리시스템과 보안스위치를 이용한 반송정수장 무선랜 구축사례 (The case study on wireless lan design technique for Bansong purification plant using network integrated management system and security switch)

  • 박은철;최현주
    • 상하수도학회지
    • /
    • 제32권4호
    • /
    • pp.309-315
    • /
    • 2018
  • Currently, the commercialization of the $5^{th}$ Generation (5G) service is becoming more prevalent in domestic communication network technology. This has reduced communication delay time and enabled large-capacity data transmission and video streaming services in real-time. In order to keep pace with these developments, K-water has introduced a smart process control system in water purification plants to monitor the status of the water purification process. However, since wireless networks are based on the public Long Term Evolution (LTE) network, communication delay time remains high, and high-resolution video services are limited. This is because communication networks still have a closed structure due to expense and security issues. Therefore, with 5G in its current form, it is very difficult to accommodate future services without improving the infrastructure of its communication networks. In recognition of these problems, this study implemented the authentication and management function of wireless networks on a wired network management system in the K-water Bansong water purification plant. The results confirmed that wired Local Area Network (LAN) services give a higher security performance than an expensive commercial wireless LAN system. This was achieved by using an Internet Protocol (IP) address management system of wired networks and the packet filtering function of the Layer2 (L2) switch. This study also confirmed that it is possible to create a wireless LAN service that is 3.7 times faster than the existing LTE communication network.

Handoff Management for Mobile Devices in Hybrid Wireless Data Networks

  • Inayat Riaz;Aibara Reiji;Nishimura Kouji
    • Journal of Communications and Networks
    • /
    • 제7권1호
    • /
    • pp.76-86
    • /
    • 2005
  • Today's wireless access networks consist of several tiers that overlap each other. Provisioning of real time undisrupted communication to mobile users, anywhere and anytime through these heterogeneous overlay networks, is a challenging task. We extend the end-to-end approach for the handoff management in hybrid wireless data network by designing a fully mobile-controlled handoff for mobile devices equipped with dual mode interfaces. By handoff, we mean switching the communication between interfaces connected to different subnets. This mobile-controlled handoff scheme reduces the service disruption time during both horizontal and vertical handoffs and does not require any modification in the access networks. We exploit the IP diversity created by the dual interfaces in the overlapping area by simultaneously connecting to different subnets and networks. Power saving is achieved by activating both interfaces only during the handoff period. The performance evaluation of the handoff is carried out by a simple mathematical analysis. The analysis shows that with proper network engineering, exploiting the speed of mobile node and overlapping area between subnets can reduce service disruption and power consumption during handoff significantly. We believe that with more powerful network interfaces our proposal of dual interfaces can be realized.

Load Balancing and Mobility Management in Multi-homed Wireless Mesh Networks

  • Tran, Minh Tri;Kim, Young-Han;Lee, Jae-Hwoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권5호
    • /
    • pp.959-975
    • /
    • 2011
  • Wireless mesh networks enlarge the wireless coverage area by interconnecting relatively stationary wireless routers (mesh routers). As wireless mesh networks are envisioned to provide high-bandwidth broadband Internet service to a large community of users, the Internet gateway, which acts as a central point of Internet attachment for the mesh networks, is likely to suffer heavily from the scramble for shared wireless resources because of aggregated traffic toward the Internet. It causes performance decrement on end-to-end transmissions. We propose a scheme to balance the load in a mesh network based on link quality variation to different Internet gateways. Moreover, under the mesh coverage, mobile nodes can move around and connect to nearby mesh routers while still keeping the connections to the Internet through the best gateway in terms of link quality. In this structure, gateways perform the balancing procedure through wired links. Information about gateways and mobile node's location is distributed appropriately so that every mesh router can quickly recognize the best gateway as well as the positions of mobile nodes. This distributed information assists mobile nodes to perform fast handoff. Significant benefits are shown by the performance analysis.

Approximation Method for QoS Analysis of Wireless Cellular Networks with Impatient Calls

  • Eom, Hee-Yeol;Kim, Che-Soong;Melikov, Agassi;Fattakhova, Mehriban
    • Industrial Engineering and Management Systems
    • /
    • 제9권4호
    • /
    • pp.339-347
    • /
    • 2010
  • Simple-closed expressions for approximate calculation of quality of service (QoS) metrics of isolated cell of wireless networks with either finite or infinite queues of both new and handover calls are developed. It is assumed that both kinds of calls might leave the system without receiving service if their waiting times exceed some threshold value. For the models with infinite queues of heterogeneous calls easily checkable ergodicity conditions are proposed. The high accuracy of the developed approximation formulas is shown. Results of numerical experiments are given.

사용자 통화 특성을 고려한 무선 네트워크 시뮬레이터 구현 (Implementation of Wireless Network simulator considering a User's Call Characteristics)

  • 윤영현
    • 디지털산업정보학회논문지
    • /
    • 제5권3호
    • /
    • pp.107-115
    • /
    • 2009
  • Traditionally, simulation method is used to test and evaluate the performance of communication protocol or functional elements for mobile communication service. In this paper, wireless network simulator is implemented using the C++ object-oriented programming language. This simulator can simulate wireless data services, like as ad-hoc networks, by considering the user's mobility. In this paper, the simulator includes network traffic model to reflect wireless data service and traffic source model to represent a user's mobility similar to real service environment and traffic characteristics can be reflected on the simulation, and also more accurate simulation results can be got through that. In addition, by using object-oriented techniques, new service feature or environment can be easily added or changed so that the developed mobile communication simulator can reflect the real service environment all the time. This simulator can be used in adjusting the characteristics of wireless data hosts following the mobility of the user, and also can be used in building new wireless ad-hoc network routing protocols.

Efficient Peer-to-Peer Lookup in Multi-hop Wireless Networks

  • Shin, Min-Ho;Arbaugh, William A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권1호
    • /
    • pp.5-25
    • /
    • 2009
  • In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.