• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.189-197
• /
• 2016

Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.219-228
• /
• 2012

As the wireless Internet become more widely accessible, variety of Internet services can be used without limitation of location. However, existing mobility management methods such as MIP and PMIP of IETF requires the load of heavy protocol stack on the mobile nodes or the addition of components such as LMA and MAG. In this paper, we proposed the location management technique in the PMIPv6 and Fast Handover technique. according to the moving pattern of the node, the location management technique proposed in order to adjust the paging area dynamically. The Fast Handover technique applied MIH technology and it reduced the handover signal processing time between heterogeneous network. The location management cost in the environment which the node moves in order to evaluate this and handover delay time was calculate. The proposal technique was efficiently more evaluated than PMIPv6 with the smallest 29% and maximum 83%.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.267-280
• /
• 2005

In this paper, we implement and verify XMIP integrating IETF Mobile IP and the Explicit Multicast mechanism for a great number of small group multicast communications. U a source node sends Xcast packets explicitly inserting destination nodes into the headers, each Xcast router decides routes and forwards the packets toward each destination node based on unicast routing table without the support of multicast trees. n is a straightforward and simple multicast mechanism just based on a unicast routing table without maintaining multicast states because of the inheritance from the Explicit Multicast mechanism. This research modifies and extends the functionality of IETF Mobile IP's mobility agents, such as HA/FA to HA+/FA+ respectively, considering interworking with Xcast networks. Xcast packets captured by HA+ are forwarded into X-in-X tunnel interfaces for each FA+ referred to the binding table of HA.. This X-in-X tunneling mechanism can effectively solve the traffic concentration problem of IETF Mobile IP multicast services. Finally WLAN-based testbed is built and a multi-user Instant messenger system is developed as a Xcast application for finally verify the feasibility of the implemented XMIP/Xcast protocols.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.426-429
• /
• 2006

A distributed healthcare monitoring system prototype for clinical and trauma patients, was developed, using wireless sensor network node. The proposed system aimed to measure various vital physiological health parameters like ECG and body temperature of patients and elderly persons and transfer his/ her health status wirelessly in Ad-hoc network, to remote base station which was connected to doctor's PDA/PC or to a hospital's main Server using wireless sensor node. The system also aims to save the cost of healthcare facility for patients and the operating power of the system because sensor network is deployed widely and the distance from sensor to base station was shorter than in general centralized system. The wireless data communication will follow IEEE 802.15.4 frequency communication with ad-hoc routing thus enabling every motes attached to patients, to form a wireless data network to send data to base-station, providing mobility and convenience to the users in home environment.

• The KIPS Transactions:PartC
• /
• v.18C no.3
• /
• pp.179-186
• /
• 2011

Wireless Mesh Network technology refers to the technology which establishes wireless network whose transmission speed is similar to that of the wire system, and provides more enhanced flexibility in the building of network, compared to the existing wired network. In addition, it has the feature of less mobility and less restriction from the energy effect. However, there follow many considerations such as system overhead in the case of setting or the selection of multi-path. Accordingly, the focus is on the design and optimization of network which can reflect this network feature and the technology to establish path. This paper suggests the methods on the programming of path in Wireless Mesh Network routing by applying the evaluation value of node service, making use of the loss rate of data, the hop count of bandwidth and link and the traffic status of node, considering the performance of link and load in the fitness evaluation function, in order to respond to the programming of multi-path effectively.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.3
• /
• pp.55-70
• /
• 2016

The most critical research issue in MANET environment is on supporting reliable communication between various devices. Various Multi-Hop Routing Protocol studies have proceeded. However, some problems you might have found when you use the existing link state routing technique are that it increases Control Message Overhead and it is unstable when node moves in CR circumstance which has transformation of using channel and MIMC circumstance which uses a number of interfaces. This essay offers a technique which is based on On-Demand Hello and the other technique which used Broadcast Interface of optimization as a solution to decrease Control Message Overhead. Also it proposes Quick Route Restoration technique which is utilized by GPS and MPR Selection technique which consider mobility as a solution of stable communication when node moves. Those offered Routing Protocol and OPNET based simulator result will be expected to be an excellent comparison in related research fields.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.267-276
• /
• 2002

By using wireless terminal, User that want to transmit multimedia traffic as well as simple text and voice have a tendency to increase. This paper proposes a fast handoff protocol that is suitable transmission for real-tim of multimedia traffic by using modified local registration. The proposed protocol solves the Triangle Routing Protocol that is one of existing opened issues without modifying protocol of CN, and we propose the method that MN is able to received a packet by real-time, even if MN is being handoff. We compare fast handoff protocol proposed in this paper with existing method n the registration cost and data packet transmission cost. As a result, we showed that fast handoff protocol proposed in this paper outperforms existing method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.186-190
• /
• 2008

This paper analyzes previous work on publish/subscribe in mobile ad-hoc networks with respect to collaboration methods among distributed event brokers. Our experiments suggest that approaches building event delivery structures are suitable for a scenario where there are events of various types each of which is consumed by a few subscribers. However, these approaches based on independent periodic exchange of network topology information may fail to reflect the up-to-date information when building event delivery paths. For this reason they do not correctly recover a broken path caused by node mobility, which results in lower event delivery rates. This paper proposes a scheme for building and maintaining event delivery paths based on advertisements initiated by and hence propagated from the root node. This guarantees correct recovery of event delivery paths within each period. Our experiments show that, our proposed scheme gives a better event delivery ratio with lower overhead.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.5
• /
• pp.47-57
• /
• 2006

Mobile Ad-hoc networks have various implementation constraints such as infrastructure-free, no trusted authority, node mobility, and the limited power and small memory of mobile device. And just like wired networks, various security issues such as authentication, confidentiality, integrity, non-repudiation, access control, availability and so on have been arisen in mobile Ad-hoc networks. But we focus on authentication of these security issues because it is quitely affected by the characteristics of networks. In this paper, we propose the authentication protocol that can limit the size of certificate repository as $log_2N$ and assures to make a trusted certificate path from one node to another, adopting the concept of Hamming distance. Particularly, our protocol can construct a trusted certificate path in spite of decreasing or increasing the number of nodes in mobile Ad-hoc network.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.1-6
• /
• 2010

Simulation analysis may be the essential means to either evaluate performance of systems or optimize system parameters for new design. Including many variations for design and implementation, MANET (Mobile Ad-hoc NETwork) is one target area of such an analysis. Since every node, however, included in the network has mobility, one MANET could be overlapped or merged with another one which use a different transport protocol. In order to communicate among nodes in this case, the new merged network should configure paths and addresses in advance. Configuring paths and addresses generates much overheads which ultimately cause delay in communicating data. Performance analysis is required to improve the data transport performance by minimizing overheads. This paper proposes a sound address auto-configuration method which is based on an on-demand manner and then presents modeling and performance analysis of the method. NS-2 simulation results verify that the proposed method can not only alleviate overheads, which are inevitably generated for address auto-configuration processes, and but also decentralize them in time.