• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.2
• /
• pp.43-55
• /
• 2010

${\mu}TESLA$ broadcast authentication protocol have been developed by many researchers for providing authenticated broadcasting message between receiver and sender in sensor networks. Those cause authentication delay Tree-based ${\mu}TESLA$[3] solves the problem of authentication delay. But, it has new problems from Merkel hash tree certificate structure. Such as an increase in quantity of data transmission and computation according to the number of sender or parameter of ${\mu}TESLA$ chain. ${\mu}TPCT$-based ${\mu}TESLA$[4] has an advantages, such as a fixed computation cost by altered Low-level Merkel has tree to hash chain. However, it only use the sequential values of Hash chain to authenticate ${\mu}TESLA$ parameters. So, It can't ensure the success of authentication in lossy sensor network. This paper is to propose the improved method for Tree-based ${\mu}TESLA$ by using XOR-based chain. The proposed scheme provide advantages such as a fixed computation cost with ${\mu}$TPCT-based ${\mu}TESLA$ and a message loss-tolerant with Tree-based ${\mu}TESLA$.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.97-105
• /
• 2010

This paper proposes an effective medium access mechanism which is based on IEEE 802.11 to transmit an urgent message, The main features of the proposed mechanism are as follows. First, when it comes to channel access to have high priority, it has a shorter interval between frames than that specified in standard document. Second, we use fixed window size instead of back-off window with an exponential increase. Performance evaluation of proposed mechanism is executed by simulation and compare with the node using the specified mechanism in standard document. Performance evaluation results show that according to increasing competition the nodes using proposed method have less accessing time than the conventional methods. Also, the proposed method can improve processing time because of the decreasing transmission delay.

• Journal of Internet Computing and Services
• /
• v.15 no.3
• /
• pp.53-62
• /
• 2014

DTN is the next generation network that is used in not guaranteed end-to-end connection such as communication between planet and satellite, frequent connection severance, and not enough for qualified network infrastructure. In this paper, we propose the hybrid Spray-and-Wait algorithm to predict the node contact time by monitoring the periodic contacts information between the nodes. Based on this method, we select one node on the basis of prediction time and copy a message for spray and wait algorithm. In order to verify the the hybrid Spray and Wait algorithm, we use the ONE(Opportunistic Network Environment) Simulator of Helsinki University. The delivery probability of the proposed algorithm is compared to the Binary Spray and Wait algorithm, it is showed that it has 10% less overhead than Binary Spray and Wait routing. It has also shown that it reduces unnecessary copying of this message.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.1017-1024
• /
• 2004

In this paper, we propose the progressed interworking method between H.323 and SlP, then explain the improved property. The VolP(Voice over Internet Protocol) technology which is able to use a voice service through internet is more cheaper then existing telephone charges, and is easil)· accept the various of multimedia services from internet. Previous connectionmethod of VoIP used H.323 protocol, but it is very complex to connection establishment. so, the SIP(Session Initiation Protocol) protocol that propose in SIP-Working Group is in use recently. Therefore, we need new interworking methodology between H.323 and SIP Products. In this thesis, the progress interworking method between H.323 and SIP are Propose, then interpret unnecessary packet delay for call setup and improved feature of message exchange.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.221-240
• /
• 2011

Vehicular networks are a promising application of mobile ad hoc networks. In this paper, we introduce an efficient broadcast technique, called CB-S (Cell Broadcast for Streets), for vehicular networks with occlusions such as skyscrapers. In this environment, the road network is fragmented into cells such that nodes in a cell can communicate with any node within a two cell distance. Each mobile node is equipped with a GPS (Global Positioning System) unit and a map of the cells. The cell map has information about the cells including their identifier and the coordinates of the upper-right and lower-left corner of each cell. CB-S has the following desirable property. Broadcast of a message is performed by rebroadcasting the message from every other cell in the terrain. This characteristic allows CB-S to achieve an efficient performance. Our simulation results indicate that messages always reach all nodes in the wireless network. This perfect coverage is achieved with minimal overhead. That is, CB-S uses a low number of nodes to disseminate the data packets as quickly as probabilistically possible. This efficiency gives it the advantage of low delay. To show these benefits, we give simulations results to compare CB-S with four other broadcast techniques. In practice, CB-S can be used for information dissemination, or to reduce the high cost of destination discovery in routing protocols. By also specify the radius of affected zone, CB-S is also more efficient when broadcast to a subset of the nodes is desirable.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.6
• /
• pp.176-190
• /
• 2019

The prevention of pedestrian accidents in crosswalks and intersections is very important. The C-ITS services provide a warning service for preventing accidents between cars and pedestrians. In the current pedestrian collision prevention warning service according to the C-ITS standard, however, it is difficult to provide real-time service because it detects pedestrians from a video-analysis server in the control center and sends service messages through the ITS system. This paper proposes a pedestrian collision-prevention warning system that detects pedestrians in the local field using an edge camera and sends a warning message directly to the driver through a roadside unit. An evaluation showed that the proposed system could deliver the pedestrian collision prevention-warning message to the driver satisfying the delay time within the 300 ms required by the C-ITS standard, even in the worst case.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8A
• /
• pp.830-836
• /
• 2006

One of the seminal operation parameters of AODV is the node-to-node travel time of data, which is currently set to fixed value of 40 ms in the RFC3561 and widely used to compute other parameters such as the expected round-trip time of the connection setup message, etc. We have naturally thought the network performance could be improved by dynamically varying the node-to-node travel time with respect to the traffic condition in the networt rather than using the fixed value, which motivates this work. To this end, we apply the idea of using timestamp; every node places the current time in the message before sending it out, and the receiver node computes the node travel time based on the moving average algorithm by considering not only the current value but also the previous ones in an accumulated and exponentially decreasing fashion with time. We evaluate the performance of the proposed scheme in respect of the number of RREQ messages generated, throughput, and delay as a function of traffic load and node mobility, and compare the result with the original AODV scheme. The results show that the proposed scheme presents noticeable performance improvements, expecially under the condition of high node mobility and high traffic load.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.574-588
• /
• 2009

Although much research has been conducted in the area of authentication in wireless networks, vehicular ad-hoc networks (VANETs) pose unique challenges, such as real-time constraints, processing limitations, memory constraints, frequently changing senders, requirements for interoperability with existing standards, extensibility and flexibility for future requirements, etc. No currently proposed technique addresses all of the requirements for message and entity authentication in VANETs. After analyzing the requirements for viable VANET message authentication, we propose a modified version of TESLA, TESLA++, which provides the same computationally efficient broadcast authentication as TESLA with reduced memory requirements. To address the range of needs within VANETs we propose a new hybrid authentication mechanism, VANET authentication using signatures and TESLA++ (VAST), that combines the advantages of ECDSA signatures and TESLA++. Elliptic curve digital signature algorithm (ECDSA) signatures provide fast authentication and non-repudiation, but are computationally expensive. TESLA++ prevents memory and computation-based denial of service attacks. We analyze the security of our mechanism and simulate VAST in realistic highway conditions under varying network and vehicular traffic scenarios. Simulation results show that VAST outperforms either signatures or TESLA on its own. Even under heavy loads VAST is able to authenticate 100% of the received messages within 107ms. VANETs use certificates to achieve entity authentication (i.e., validate senders). To reduce certificate bandwidth usage, we use Hu et al.'s strategy of broadcasting certificates at fixed intervals, independent of the arrival of new entities. We propose a new certificate verification strategy that prevents denial of service attacks while requiring zero additional sender overhead. Our analysis shows that these solutions introduce a small delay, but still allow drivers in a worst case scenario over 3 seconds to respond to a dangerous situation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.393-402
• /
• 2017

Just like terrestrial cellular networks, underwater cellular communication networks, which can manage the overall network resource by adaptively allocating backhaul resource for each base station according to its ingress traffic, are necessary. In this paper, a new resource allocation protocol is proposed for the underwater cellular communication network, allocating backhaul resource of a base station proportional to its ingress traffic to the base station. This protocol is classified into two types dependent upon allocation period: the resource allocation protocol with adaptive period and that with fixed period. In order to determine a proper resource allocation protocol, the performance of the two protocols, in terms of reception rate, message overhead, and latency is compared and investigated via simulation. As a result, the resource protocol with adaptive period outperforms that with fixed period; the resource allocation protocol with fixed period results in a maximum of $10^2$ order longer queueing delay as well as $10^2$ order greater message overhead than that with adaptive period.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1225-1230
• /
• 2015

MAC protocol for WBAN performs CSMA/CA(:Carrier Sense Multiple Access with Collision Avoidance)algorithm that handles traffic which occurs in emergency with top priority in order to deal with variable data of sensor node for medicine. Emergency message that node sends undergoes collision and delay of transmission by retransmission of emergency message and waste of energy by retransmission. This paper suggests algorithm that minimizes loss of frame caused by collision and applies different backoff parameters by setting order of priority between MAC instruction frame and data frame in CSMA/CA algorithm case which applies order of priority queuing to improve aforementioned problem. According to performance evaluation, it has been found that using suggested MAC protocol showed lower collision probability, higher packet transmission processing ratio and lower packet loss compared with using IEEE 802.15.6.