• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3678-3698
• /
• 2017

With the rapid development of vehicular ad hoc Network (VANET), it has gained significant popularity and received increasing attentions from both academics and industry communities in aspects of security and efficiency. To address the security and efficiency issues, a self-authentication and deniable efficient group key agreement protocol is proposed in this paper. The scheme establishes a group between road side units (RSUs) and vehicles by using self-authentication without certification authority, and improves certification efficiency by using group key (GK) transmission method. At the same time, to avoid the attacker attacking the legal vehicle by RSUs, we adopt deniable group key agreement method to negotiation session key (sk) and use it to transmit GK between RSUs. In addition, vehicles not only broadcast messages to other vehicles, but also communicate with other members in the same group. Therefore, group communication is necessary in VANET. Finally, the performance analysis shows superiority of our scheme in security problems, meanwhile the verification delay, transmission overheard and message delay get significant improvement than other related schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1330-1347
• /
• 2018

Mobile Ad hoc Network (MANET) is a collection of nodes or communication devices that wish to communicate without any fixed infrastructure and predetermined organization of available links. The effort has been made by proposing a scheme to overcome the critical security issue in MANET. The insufficiency of security considerations in the design of Ad hoc On-Demand Distance Vector protocol makes it vulnerable to the threats of collaborative black hole attacks, where hacker nodes attack the data packets and drop them instead of forwarding. To secure mobile ad hoc networks from collaborative black hole attacks, we implement our scheme and considered sensor's energy as a key feature with a better packet delivery ratio, less delay time and high throughput. The proposed scheme has offered an improved solution to diminish collaborative black hole attacks with high performance and benchmark results as compared to the existing schemes EDRIAODV and DRIAODV respectively. This paper has shown that throughput and packet delivery ratio increase while the end to end delay decreases as compared to existing schemes. It also reduces the overall energy consumption and network traffic by maintaining accuracy and high detection rate which is more safe and reliable for future work.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.143-150
• /
• 2006

The quickest path problem deals with the transmission of a message of size ${\sigma}$ from a source to a destination with the minimum end to end delay over a network with bandwidth and delay constraints on the links. We consider two basic modes and four variations for the message delivery at the nodes reflecting the mechanisms such as circuit switching. Internet protocol, and their combinations, For each of first five modes, we present O($m^2+mnlogn$) algorithm to compute the quickest path for a given message size ${\sigma}$, For the last mode, the quickest path can be computed in O(m+nlogn) time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.2
• /
• pp.148-153
• /
• 2012

In this paper, we propose a fault-tolerant QoS routing scheme based on interference awareness for providing both high throughput and minimum end-to-end delay for wireless sensor networks. With the proposed algorithm, it is feasible to find out the optimal transmission path between sensor nodes to the sink node by using cumulative path metric where real-time delivery, high energy efficiency and less interference are considered as in path selection. Finally, simulation results show that network throughput and delay can be improved by using the proposed routing scheme.

• International Journal of Computer Science & Network Security
• /
• v.23 no.5
• /
• pp.121-127
• /
• 2023

A 500 km/h linear motor high speed terrestrial transportation service is planned to launch 2027 in Japan. In order to support 5G service in the train, the Sub-carrier spacing frequency of 30 kHz is planned to be used instead of common 15 kHz sub-carrier spacing to mitigate Doppler effect in such high-speed transportation. In addition, to increase the cell size of 5G mobile system, plural Base Station antenna will transmit the identical Down Link (DL) signal to form the expanded cell size along the train rail. In this situation, forward and backward antenna signals will be Doppler shifted by reverse direction respectively and the receiver in the train might suffer to estimate accurate Channel Transfer Function (CTF) for its demodulation. In this paper, Delay and Doppler Profiler (DDP) based Channel Estimator is proposed and it is successfully implemented in signal processing simulation system. Then the simulated performances are compared with the conventional Time domain linear interpolated estimator. According to the simulation results, QPSK modulation can be used even under severe channel condition such as 500 km/h, 2 path reverse Doppler Shift condition, although QPSK modulation can be used less than 200 km/h with conventional Channel estimator.

• Journal of Korea Multimedia Society
• /
• v.1 no.2
• /
• pp.249-255
• /
• 1998

This paper analyzes the impact of Call Setup Time on UPT performance based on the AIN platform. Call Setup Time is used as the performance parameter. In implementing UPT based on the AIN platform, the geographical location of VLR affects network performance. In order to find an optimum location of VLR among three different types of structures, i.e. VLR is located close to Service Switching Point and Cell Site Controller and located at Service Control Point, each Call Setup Time on proposed time delay model is calculated and compared. Network performance is analyzed by changing the number of STP in No.7 signaling network in UPT and the utilization ratio, $\rho$, for SSP, STP and SCP.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.791-800
• /
• 2009

Multicasting is fundamental to many ad hoc network applications requiring collaboration of multiple nodes in a group. A general approach is to construct an overlay tree and to deliver a multicast packet to multiple receivers over the tree. This paper proposes adaptive overlay trees (AOTs) on wireless ad hoc networks of static nodes for delay- and energy-efficient multicast. A tradeoff function is derived, and an algorithm for AOT construction is developed. Note here that the requirements of delay and energy consumption may vary with different classes of applications. By adjusting parameters in the tradeoff function, different AOTs can be adaptively chosen for different classes of applications. An AOT is constructed in O(ke) time where e is the number of wireless links in a network and k is the number of member nodes in a multicast group. The simulation study shows that AOT adaptively provides tradeoffs between the fastest multicast (which is the choice if delay is the most important factor) and the most energy efficient multicast (which is used when energy consumption is the primary concern). In other words, one of AOTs can be appropriately chosen in accordance with the operation requirement.

• Journal of Internet Computing and Services
• /
• v.17 no.5
• /
• pp.1-8
• /
• 2016

This paper proposes a novel broadcast scheduling algorithm for wireless large-scale networks based on theory of complex networks. In the proposed algorithm, the network topology is formed based on a scale-free network and the probability of link distribution is analyzed. In this paper, the characteristics of complex systems are analyzed (which are not concerned by the existing broadcast scheduling algorithm techniques) and the optimization of network transmission efficiency and network time delay are provided.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.10
• /
• pp.1018-1023
• /
• 2010

The CAN (Controller Area Network) system is the most dominant protocol for in-vehicle networking system because it provides bounded transmission delay among ECUs (Electronic Control Units) at data rates between 125Kbps and 1Mbps. And, many automotive companies have chosen the CAN protocol for their in-vehicle networking system such as chassis network system because of its excellent communication characteristics. However, the increasing number of ECUs and the need for more intelligent functions such as ADASs (Advanced Driver Assistance Systems) or IVISs (In-Vehicle Information Systems) require a network with more network capacity and the real-time QoS (Quality-of-Service). As one approach to enhancing the network capacity of a CAN system, this paper introduces a CAN system with dual communication channel. And, this paper presents a distributed message allocation method that allocates messages to the more appropriate channel using forecast traffic of each channel. Finally, an experimental testbed using commercial off-the-shelf microcontrollers with two CAN protocol controllers was used to demonstrate the feasibility of the CAN system with dual communication channel using the distributed message allocation method.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1266-1276
• /
• 2003

Multimedia information containing voice and image is transmitted on Internet, which is ten times or hundred times larger than ordinary information. Analysis types for network management in this environment consist of a real time analysis, a basic analysis and an intensive analysis. The intensive analysis is useful for gathering the trend information of specific objects periodically for certain period in order to monitor network status. When SNMP is applied to collect the trend information of intensive analysis, it brings on the increase of network load, the delay of response time and the decrease of data collection accuracy since an agent responds to manager's every polling. In this paper, an efficient SNMP is proposed and implemented to add time variables in the existing SNMP PDU. It minimizes unnecessary traffic in the intensive analysis between manager and agent, and collects trend information more accurately. The results of experiments show that it has compatibility with the existing SNMP, decreases the amount of network traffic greatly and increases the accuracy of data collection.