• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2980-2991
• /
• 2012

Since wireless sensor networks are broadly used in various areas, there have been a number of protocols developed to satisfy specific constraints of each application. The most important and common requirements regardless of application types are to provide a long network lifetime and small end-to-end delay. In this paper, we propose Early Preamble MAC (EP-MAC) with improved energy conservation and low latency. It is based on CMAC but adopts a new preamble type called 'early preamble'. In EP-MAC, a transmitting node can find quickly when a next receiving node wakes up, so EP-MAC enables direct data forwarding in the next phase. From numerical analysis, we show that EP-MAC improves energy consumption and latency greatly compared to CMAC. We also implemented EP-MAC with NS-2, and through extensive simulation, we confirmed that EP-MAC outperforms CMAC.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.20 no.3
• /
• pp.22-27
• /
• 2012

In oceanic flight routes, HF radio and satellite data links have been used for air-to-ground communication, but these systems have long propagation delay and low data throughput. In this paper, we propose a reliable system to overcome the weakness of current HF radio and satellite communication systems for oceanic aeronautical flight routes. The proposed scheme uses only one aeronautical VHF channel in multi-hop oceanic communication environments and supports a hybrid type of multiple access, which consists of random access and TDMA (Time Division Multiple Access) scheme. The proposed system improves performance on delay and throughput as an effective solution to communicate end-to-end on the oceanic flight routes and strengthens the reliability of oceanic aeronautical communication.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.1-8
• /
• 2022

Supporting real-time flows with delay and throughput constraints is an important challenge for future wireless networks. In this paper, we develop an optimal scheduling scheme to optimally choose the packets to transmit. The optimal transmission strategy is based on an observable Markov decision process. The novelty of the work focuses on a priority-based probabilistic packet scheduling strategy for efficient packet transmission. This helps in providing guaranteed services to real time traffic in Heterogeneous Wireless Networks. The proposed scheduling mechanism is able to optimize the desired performance. The proposed scheduler improves the overall end-to-end delay, decreases the packet loss ratio, and reduces blocking probability even in the case of congested network.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.25-31
• /
• 2007

The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.149-152
• /
• 2000

In the Internet, multimedia data transfer is hard to guarantee the characteristics of the Real-Time because of the Best-Effort of the nature of IP, then additional mechanism is applied to multimedia application for real-time data. In this paper, we introduce the nature of multimedia and the necessary facility for real-time protocol. We propose protocol layer, which has necessary function above mentioned and offer the end-to-end transfer far real-time data. Also, the proposed protocol perform a next low operation: 1) a required information for QoS control by using Feedback mechanism is obtained from sender, 2) divided a transferred packet by delay and loss priority. 3) recognized the low service models, and 4) decided a bandwidth and QoS according to a network state

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.41
• /
• pp.103-112
• /
• 1997

In this paper, a nonhierarchial integrated information network with circuit switched and packet switched traffic is considered. It is assumed that circuit switched traffic is allowed to attempt an alternate path if the direct path is blocked, whereas packet switched traffic is not. The network uses a movable boundary scheme to allocate bandwidth dynamically. To analyze the performance of this type of network, EEBP(End to End Blocking Probability) is selected as a measure for circuit switched traffic and average time delay for packet switched traffic, respectively. EEBP and average time delay are derived analytically. Using the two proposed measure, the performance of the network under various bandwidth allocations and arrival patterns are observed. Moreover, the arrival rate of one link for circuit switched traffic is obtained from an approximation formula. Simulation results reveal the validity of the proposed approximation method.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.1195-1198
• /
• 2007

In this paper we study the problem of real time support in wireless sensor networks and propose a Real time Geographic Routing Protocol (ReGeo) which routes a packet towards the destination based on a compromise between distance and queue count to reduce traffic concentration wherever it has been determined to be too high and uses Gradient Table to store the route satisfying the delay constraints. We describe our prototype implementation of ReGeo Routing in TOSSIM - a TinyOS mote simulator. The simulation results show that the proposed routing protocol not only increases the packet delivery ratio but also keeps overall End to End Delay under a bounded value.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.40-46
• /
• 2015

In a mobile ad hoc network (MANET), communication between mobile nodes occurs without centralized control. In this environment the mobility of a node is unpredictable; this is considered as a characteristic of wireless networks. Because of faulty or malicious nodes, the network is vulnerable to routing misbehavior. The resource constrained characteristics of MANETs leads to increased query delay at the time of data access. In this paper, AntHocNet+ Security (ANTSEC) framework is proposed that includes an enhanced cooperative caching scheme embedded with artificial immune system. This framework improves security by injecting immunity into the data packets, improves the packet delivery ratio and reduces end-to-end delay using cross layer design. The issues of node failure and node malfunction are addressed in the cache management.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.72-75
• /
• 2004

In this paper, the task assignment strategy considering communication delay and the priority of distributed tasks is proposed for the real-time network system in order to maximize the utilization of the system. For the task assignment strategy, the relationship among priority of tasks in network nodes, the calculation time of each task, and the end-to-end response time including the network delay is formulated firstly. Then, the task assignment strategy using the genetic algorithm is proposed to optimize the utilization of the system considering the LCM(Least Common Multiple) period. The effectiveness of proposed strategy is proven by the simulation for estimating the performance such as the utilization and the response time of the system in case of changing the number of tasks and the number of network nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1503-1513
• /
• 1998

This paper is related to a performance analysis of B-NT system, which is essential compositional equipment of B-ISDN access network. A simulator enabling performance analysis according to the change of network configuration topology and the change of user traffic is developed in this study. The developed B-NT, system simulator consists of graphic user interface module, simulation program automatic generator module, and B-NT system model library module. As examples of the results of performance analysis using the simulator, end-to-end user cell transmission delay time, queueing delay time in each system, and cell loss rate in the head node switch are presented. The simulator developed in this paper can be utilized in determining the network topology of B-NT system.