• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.694-699
• /
• 2014

In mobile ad-hoc networks (MANET), the network topology and neighboring nodes change frequently, since MANET is composed of nodes that have mobility without a fixed network infrastructure. The AODV routing protocol is advantageous for MANET, but AODV has a delay in the transmission of data packets because AODV can not transmit data during route recovery. This paper proposes solving the above problem of AODV by using a bypass generation mechanism for data transmission during route recovery. For further improvement, additional mechanisms that coordinate the reception threshold of a hello packet are proposed in order to improve the accuracy of the information obtained from the neighboring nodes when the bypass is generated due to a link failure and the immediacy of the route recovery. Simulation results show that the proposed technique improves the performance in terms of the delay in transmission compared to traditional AODV.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.68-76
• /
• 2008

It is difficult to maintain mutes in the mobile ad hoc network (MANET) due to the high probability of disconnected routes break by frequent change of topology. The links can have the different reliability about data transmission due to these characteristics. Hence a measure which can evaluate this reliability and a algorithm which reflects this are required. In this paper, we propose routing algorithm based on reliability about transmission. First the bayesian inference which infers the hypothesis by past information is considered to obtain the link's transmission reliability. The other is that the link-based reliability estimation model which considers each link's reliability additionally is proposed while the standard uses only Dijkstra's shortest path algorithm. the simulation results using NS-2 show that the performance of proposed algorithm is superior to the standard OLSR in terms of throughput and stability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2894-2909
• /
• 2015

As the number of mobile devices such as smart phones and tablets explodes, the need for new services or applications is also rapidly increasing. Smart class application is one of the emerging applications, in which most of contents are distributed to all members of a class simultaneously. It is highly required to select relay nodes to cover shadow area of radio as well as extend coverage, but existing algorithms in a smart class environment suffer from high control packet overhead and delay for exchanging topology information among all pairs of nodes to select relay nodes. In addition, the relay selection procedure should be repeated in order to adapt to the dynamic topology changes caused by link status changes or device's movement. This paper proposes the learning based relay selection algorithm to overcome aforementioned problems. The key idea is that every node keeps track of its relay quality in a fully distributed manner, where RQI (Relay Quality Indicator) is newly defined to measure both the ability of receiving packets from content source and the ability of successfully relaying them to successors. The RQI of each node is updated whenever it receives or relays broadcast packet, and the node having the higher RQI is selected as a relay node in a distributed and run-time manner. Thus, the proposed algorithm not only removes the overhead for obtaining prior knowledge to select relay nodes, but also provides the adaptability to the dynamic topology changes. The network simulation and experimental results prove that the proposed algorithm provides efficient and reliable content distribution to all members in a smart class as well adaptability against network dynamics.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.183-188
• /
• 2009

Wireless sensor networks will be broadly deployed in the real world and widely utilized for various applications. A prerequisite for secure communication among the sensor nodes is that the nodes should share a session key to bootstrap their trust relationship. The open problems are how to verify the identity of communicating nodes and how to minimize any information about the keys disclosed to the other side during key agreement. At any rate, any one of the existing schemes cannot perfectly solve these problems due to some drawbacks. Accordingly, we propose a new pre-distribution scheme with the following merits. First, it supports authentication services. Second, each node can only find some indices of key spaces that are shared with the other side, without revealing unshared key information. Lastly, it substantially improves resilience of network against node capture. Performance and security analyses have proven that our scheme is suitable for sensor networks in terms of performance and security aspects.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.48-58
• /
• 2009

Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.

• Journal of Navigation and Port Research
• /
• v.38 no.4
• /
• pp.343-348
• /
• 2014

A routing scheme called MCS-NLTC using a self-configuration marine network model and the diversity and heterogeneity of broadband wireless access technologies is newly proposed. The MCS-NLTC algorithm selects optimal nodes and carriers for every hop in optimal routes based on not conventional hop counts but normalized distances to destination ships (location information of destination ships). Normalized transmission characteristics of applications and carriers are considered to get optimal routes as well. The location information enhances convergence speed to get destinations, which makes the route search time faster. Evaluated performances are compared with those of the schemes based on max-win (OMH-MW), and normalized transmission characteristics (MCS-NTC).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.584-587
• /
• 2012

MANET, which can be constructed with only terminal devices, has structural advantages of ease installation and operation, also has environmental change of rapid supply of smart phone, it's usage can be extended to application area likes as emergency communication, leasure, exploration and investigations. But, as one characteristic of MANET, no use of communicaton infrastructure caused disadvantage of weakness for information intrusion which is frequently occurred, nowadays. In this paper, the effects of IDS(Intrusion Detection System), one of defence tools for information intrusion, is analyzed for transmission performance. Blackhole attack is assumed as a type of intrusion, MANET defence with IDS from intrusions. Computer simulation based on NS-2 used for performance measurement. In this paper, performance measurement is done for application service to analyze application level effects of IDS. VoIP service is used as application service.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.97-107
• /
• 2013

Underwater wireless communication systems can be useful for underwater environment observation, catastrophe prevention, ocean resources exploration, ocean organism research, vessel sinking exploration, and so on. However, unlike terrestrial wireless communication, underwater wireless communication should consider factors such as long propagation delay, limited transmission capacity, high bit-error rate due to potential loss in power, ambient noise, man-made noise, multi-path, etc., because of the inherent characteristics of water. Thus, in this paper, we propose a suitable media access control(MAC) protocol that applies a combination of the ALOHA MAC protocol and the CSMA/CA MAC protocol to underwater environment. We further propose a mathematical analysis model to evaluate performance. We also verify performance improvement in the proposed scheme in comparison with existing MAC protocols.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.617-622
• /
• 2005

Lately, the MANET research has focused on providing routing services with security and previous schemes have been proposed for detecting malicious nodes in a MANET. However, they still include some problems which malicious nodes cannot be found when they falsely report other nodes as malicious. Accordingly, we propose a novel and efficient scheme for detecting malicious nodes using report messages and a report table which is consisted of node ID both for suspecting and reporting when the malicious nodes behave normally during the route discovery, but the other hand they drop and modify packets, or falsely report other nodes as malicious during the data transmission. Our proposed scheme is applicable to not only DSR but aiso AODV. And we provide some simulation results of our proposed scheme by comparing general AODV with our proposed scheme. Simulation results show that our Proposed scheme outperforms general AODV in terms of average packet loss ratio and packet delivery ratio.

• Journal of KIISE:Software and Applications
• /
• v.35 no.3
• /
• pp.137-148
• /
• 2008

Services system which has been emerging as a new way of application development utilizes services as fundamental units for developing a system. Services system can offer services within web environment as well as the ubiquitous environment where mobile devices are connected to wired or wireless network. In order to provide the functionality that meets users' requirements, the most appropriate service should be selected among candidate services by taking requests and context information into account. Therefore, it is important that the service system should provide services to users by dynamically adapting to users' requirements and context information. Since different users request same functionality with different context information, one service can be differently offered to users so that variability can happen to the service systems. Most researches on context-aware systems have a tendency to solve dynamic adaptation by using more or less ad hoc manner In this paper, we consider various types of services which are performed according to context information as variability and propose adaptable architecture by applying concepts of product line architecture in order to deal with variabilities systematically.