• Title/Summary/Keyword: End-to-end Delay

Search Result 762, Processing Time 0.023 seconds

Joint Routing and Channel Assignment in Multi-rate Wireless Mesh Networks

  • Liu, Jiping;Shi, Wenxiao;Wu, Pengxia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2362-2378
    • /
    • 2017
  • To mitigate the performance degradation caused by performance anomaly, a number of channel assignment algorithms have been proposed for multi-rate wireless mesh networks. However, network conditions have not been fully considered for routing process in these algorithms. In this paper, a joint scheme called Multi-rate Dijkstra's Shortest path - Rate Separated (MDSRS) is proposed, combining routing metrics and channel assignment algorithm. In MDSRS, the routing metric are determined through the synthesized deliberations of link costs and rate matches; then the rate separated channel assignment is operated based on the determined routing metric. In this way, the competitions between high and low rate links are avoided, and performance anomaly problem is settled, and the network capacity is efficiently improved. Theoretical analysis and NS-3 simulation results indicate that, the proposed MDSRS can significantly improve the network throughput, and decrease the average end-to-end delay as well as packet loss probability. Performance improvements could be achieved even in the heavy load network conditions.

Performance Evaluation of Tree Routing in Large-Scale Wireless Sensor Networks (대규모 센서네트워크에서의 트리라우팅 성능평가)

  • Beom-Kyu Suh;Ki-Il Kim
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.2
    • /
    • pp.67-73
    • /
    • 2023
  • Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

Dynamic Class Mapping Mechanism for Guaranteed Service with Minimum Cost over Differentiated Services Networks (다중 DiffServ 도메인 상에서 QoS 보장을 위한 동적 클래스 재협상 알고리즘)

  • 이대붕;송황준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.697-710
    • /
    • 2004
  • Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.

Deployment and Performance Analysis of Nation-wide OpenFlow Networks over KREONET (KREONET 기반의 광역 규모 오픈플로우 네트워크 구축 및 성능 분석)

  • Hong, Won-Taek;Kong, Jong-Uk;Chung, Jin-Wook
    • The KIPS Transactions:PartC
    • /
    • v.18C no.6
    • /
    • pp.423-432
    • /
    • 2011
  • Recently, OpenFlow has been paid attention to as a fundamental technology which provides a function of virtualization and programmability in network. In Korea, deployment of OpenFlow networks in campuses and the interconnection between them through tunneling in layer 3 has been performed. However, the performance of the interconnected networks is decreased due to delay in IP layer. In this paper, we design and deploy nation-wide, not local, OpenFlow networks in a pure layer 2 environment over KREONET. After that, we do end-to-end Round-trip Time measurements and TCP/UDP performance tests in OpenFlow and normal networks, and do comparison and analysis on the test results. The results show that the nation-wide OpenFlow networks provide equal performance to normal networks except for the initial packet loss for UDP streaming. In regards to the performance decrease due to early UDP packet loss, we can mitigate it by implementing exceptional procedures in a controller which deal with the same continuous "Packet_in" events.

End to End Model and Delay Performance for V2X in 5G (5G에서 V2X를 위한 End to End 모델 및 지연 성능 평가)

  • Bae, Kyoung Yul;Lee, Hong Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.1
    • /
    • pp.107-118
    • /
    • 2016
  • The advent of 5G mobile communications, which is expected in 2020, will provide many services such as Internet of Things (IoT) and vehicle-to-infra/vehicle/nomadic (V2X) communication. There are many requirements to realizing these services: reduced latency, high data rate and reliability, and real-time service. In particular, a high level of reliability and delay sensitivity with an increased data rate are very important for M2M, IoT, and Factory 4.0. Around the world, 5G standardization organizations have considered these services and grouped them to finally derive the technical requirements and service scenarios. The first scenario is broadcast services that use a high data rate for multiple cases of sporting events or emergencies. The second scenario is as support for e-Health, car reliability, etc.; the third scenario is related to VR games with delay sensitivity and real-time techniques. Recently, these groups have been forming agreements on the requirements for such scenarios and the target level. Various techniques are being studied to satisfy such requirements and are being discussed in the context of software-defined networking (SDN) as the next-generation network architecture. SDN is being used to standardize ONF and basically refers to a structure that separates signals for the control plane from the packets for the data plane. One of the best examples for low latency and high reliability is an intelligent traffic system (ITS) using V2X. Because a car passes a small cell of the 5G network very rapidly, the messages to be delivered in the event of an emergency have to be transported in a very short time. This is a typical example requiring high delay sensitivity. 5G has to support a high reliability and delay sensitivity requirements for V2X in the field of traffic control. For these reasons, V2X is a major application of critical delay. V2X (vehicle-to-infra/vehicle/nomadic) represents all types of communication methods applicable to road and vehicles. It refers to a connected or networked vehicle. V2X can be divided into three kinds of communications. First is the communication between a vehicle and infrastructure (vehicle-to-infrastructure; V2I). Second is the communication between a vehicle and another vehicle (vehicle-to-vehicle; V2V). Third is the communication between a vehicle and mobile equipment (vehicle-to-nomadic devices; V2N). This will be added in the future in various fields. Because the SDN structure is under consideration as the next-generation network architecture, the SDN architecture is significant. However, the centralized architecture of SDN can be considered as an unfavorable structure for delay-sensitive services because a centralized architecture is needed to communicate with many nodes and provide processing power. Therefore, in the case of emergency V2X communications, delay-related control functions require a tree supporting structure. For such a scenario, the architecture of the network processing the vehicle information is a major variable affecting delay. Because it is difficult to meet the desired level of delay sensitivity with a typical fully centralized SDN structure, research on the optimal size of an SDN for processing information is needed. This study examined the SDN architecture considering the V2X emergency delay requirements of a 5G network in the worst-case scenario and performed a system-level simulation on the speed of the car, radius, and cell tier to derive a range of cells for information transfer in SDN network. In the simulation, because 5G provides a sufficiently high data rate, the information for neighboring vehicle support to the car was assumed to be without errors. Furthermore, the 5G small cell was assumed to have a cell radius of 50-100 m, and the maximum speed of the vehicle was considered to be 30-200 km/h in order to examine the network architecture to minimize the delay.

Robust Backup Path Selection in Overlay Routing with Bloom Filters

  • Zhou, Xiaolei;Guo, Deke;Chen, Tao;Luo, Xueshan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.1890-1910
    • /
    • 2013
  • Routing overlay offers an ideal methodology to improve the end-to-end communication performance by deriving a backup path for any node pair. This paper focuses on a challenging issue of selecting a proper backup path to bypass the failures on the default path with high probability for any node pair. For existing backup path selection approaches, our trace-driven evaluation results demonstrate that the backup and default paths for any node pair overlap with high probability and hence usually fail simultaneously. Consequently, such approaches fail to derive a robust backup path that can take over in the presence of failure on the default path. In this paper, we propose a three-phase RBPS approach to identify a proper and robust backup path. It utilizes the traceroute probing approach to obtain the fine-grained topology information, and systematically employs the grid quorum system and the Bloom filter to reduce the resulting communication overhead. Two criteria, delay and fault-tolerant ability on average, of the backup path are proposed to evaluate the performance of our RBPS approach. Extensive trace-driven evaluations show that the fault-tolerant ability of the backup path can be improved by about 60%, while the delay gain ratio concentrated at 14% after replacing existing approaches with ours. Consequently, our approach can derive a more robust and available backup path for any node pair than existing approaches. This is more important than finding a backup path with the lowest delay compared to the default path for any node pair.

Distance and Probability-based Real Time Transmission Scheme for V2V Protocol using Dynamic CW allocation (V2V 프로토콜에서 실시간 전송을 위한 동적 CW 할당 기법)

  • Kim, Soo-Ro;Kim, Dong-Seong;Lee, Ho-Kyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.2
    • /
    • pp.80-87
    • /
    • 2013
  • This paper proposes a CW (Contention window) allocation scheme for real-time data transmission of emergency data on VANET (Vehicle to vehicle Ad hoc Network, V2V) protocol. The proposed scheme reduces the probability of packet collisions on V2V protocol and provides bandwidth efficiency with short delay of emergency sporadic data. In the case of high density traffic, the proposed scheme provides a decrease of recollision probability using dynamic CW adjustments. For the performance analysis, a throughput, end-to-end delays, and network loads were investigated on highway traffic. Simulation results show the performance enhancements in terms of the throughput, end-to-end delays, and network loads.

Service Oriented Self-Construction Network Scheme in IoT Environments (사물인터넷 환경에서 서비스 중심 자율-구성 네트워크 기법)

  • Youn, Joosang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.6
    • /
    • pp.922-928
    • /
    • 2018
  • Recently, various researches have been studied to support service-oriented IoT networking. This is because the IoT environment coexists with various service devices for providing the service in a certain unified area. Thus, in this network environment, an effective data delivery service is not provided in a network configuration. Also, in order to provide efficient IoT services in this network environment, new scheme is necessary to recognize services by themselves and to construct network structures for each service. In this paper, we propose a service oriented self-constructive network (SO-SCN) scheme that can construct a service-oriented network in IoT environments composed of various service devices. The proposed scheme is a method that can minimize the network overhead required for service provisioning and extend the network lifetime. Through simulation, we show that the proposed service oriented self-construction network scheme improves the performance, in terms of the number of packets generated for end-to end data transmission and the end-to-end delay.

Smart Grid Cooperative Communication with Smart Relay

  • Ahmed, Mohammad Helal Uddin;Alam, Md. Golam Rabiul;Kamal, Rossi;Hong, Choong Seon;Lee, Sungwon
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.640-652
    • /
    • 2012
  • Many studies have investigated the smart grid architecture and communication models in the past few years. However, the communication model and architecture for a smart grid still remain unclear. Today's electric power distribution is very complex and maladapted because of the lack of efficient and cost-effective energy generation, distribution, and consumption management systems. A wireless smart grid communication system can play an important role in achieving these goals. In this paper, we describe a smart grid communication architecture in which we merge customers and distributors into a single domain. In the proposed architecture, all the home area networks, neighborhood area networks, and local electrical equipment form a local wireless mesh network (LWMN). Each device or meter can act as a source, router, or relay. The data generated in any node (device/meter) reaches the data collector via other nodes. The data collector transmits this data via the access point of a wide area network (WAN). Finally, data is transferred to the service provider or to the control center of the smart grid. We propose a wireless cooperative communication model for the LWMN.We deploy a limited number of smart relays to improve the performance of the network. A novel relay selection mechanism is also proposed to reduce the relay selection overhead. Simulation results show that our cooperative smart grid (coopSG) communication model improves the end-to-end packet delivery latency, throughput, and energy efficiency over both the Wang et al. and Niyato et al. models.

Self-organization Networking Scheme for Constructing Infrastructure-less based IoT Network (비인프라 기반 사물인터넷 구축을 위한 자율네트워킹 기법)

  • Youn, Joosang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.1
    • /
    • pp.196-201
    • /
    • 2018
  • Recently, various infrastructure-less IoT networking schemes have been studied to construct local IoT networks based on self-organization. This is, because RPL protocol, which is to support infrastructure based network construction is used to construct local IoT networks. Thus, a self-organization networking and ad hoc path between client and server in local IoT networks is not supported in basis RPL protocol. In this paper, we propose a self-organization networking scheme which support infrastructure-less based IoT network construction in low-power and lossy network based IoT environments consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Through simulation, we show that the proposed self-organization networking scheme improves the performance, in terms of the number of packets generated for end-to end data transmission and the end-to-end delay, compared to basis RPL protocol.