• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.737-740
• /
• 2007

A s wireless communications and mobile multimedia services are booming nowadays, systematic research of the overall aspects of mobile security is crucial. This paper presents a frame model for guising the systematic investigation of mobile security. Based on the introduction of some background viewpoints of security targets from n novel perspective, the framework is described as a hierarchical model in which mobile security research is partitioned into three different layers.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.97-101
• /
• 2000

Energy consumption is considered as a principal ingredient in mobile wireless ad-hoc networks. In such a network, most of mobile nodes takes a role in forwarding messages received from neighbor nodes. Energy of these nodes is consumed in different rates depending on message traffic routes. This paper proposes a scheme to balance routing energy consumption by transferring routing function from node with small residual energy to node with enough residual energy. This scheme requires additional local message transfer, increasing the energy consumption of nodes to transfer routing function, and increasing total energy consumption of ad-hoc network. But balancing of energy consumption make the system lifetime the longer and increase the average node lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.723-733
• /
• 2012

In wireless ad hoc networks, packet loss and latency are frequently occurred by movement of node. As the number of transmission hops increases in these networks, the throughput is increasingly deteriorated. In this paper, we design the wireless ad hoc network system based on IEEE 802.16j MMR (Mobile Multi-hop Relay), which improves the network performance. Our wireless ad hoc network system used adaptively the nearest BS and Farthest BS scheduling algorithms for efficient data transmission and chose the optimal path that minimize data loss and latency. In order to evaluate performance of the wireless ad hoc network system based on IEEE 802.16j MMR, we used the LWX (Light Wimax) model of NS-2 simulator. Through the simulation, we analyzed the network performance for various scenarios.

• Journal of IKEEE
• /
• v.12 no.1
• /
• pp.18-26
• /
• 2008

With the advent of Ubiquitous environment, wired-wireless combination network is being studied very actively in which mobile nodes having multi-hop communication capability connect wired internet network easily, and shares the information. The study of wired and wireless combination network between MANET(Mobile Ad Hoc Network) and wired network is being focused only on the configuration of heterogeneous network interface. The proposed algorithm establishes independent multi-paths between source node and destination node to prevent data loss when errors happen in route. As the result, it shows that the reliability of the combination network can be improved by making data transmit continuously on the route error.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1529-1532
• /
• 2004

A Mobile Ad Hoc NETwork (MANET) is a collection of wireless mobile nodes that forms a temporary network without the need for any existing network infrastructure or centralized administration. Therefore, such a network is designed to operate in a highly dynamic environment due to node mobility. In mobile ad hoc network, frequent topological changes cause routing a challenging problem and without the complete view of the network topology, establishing the shortest path from the source node to the destination node is difficult. In this paper, we suggest a routing approach which utilizes location information to setup the shortest possible path between the source node and the destination node. Location information is obtained through Global Positioning System (GPS) and this geographical coordinate information of the destination node is used by the source node and intermediate nodes receiving route request messages to determine the shortest path to the destination from current node.

• Journal of Internet Computing and Services
• /
• v.4 no.4
• /
• pp.15-25
• /
• 2003

Wireless ad-hoc networks are only composed with mobile devices. Unlike the traditional wired networks, those devices are mostly operated with battery power. Since the battery-operated power is limited, the efficient energy resource managements becomes an important issue in wireless ad-hoc networks and various studies that considered these characteristics are progressed. One of those studies is an energy efficient routing using coordinators. In this method. only devices elected as coordinator participate in data transmissions in ad-hoc networks, while other devices remain in sleep node. The overall energy consumption of a system can be reduced. In order to minimize energy consumption of a total network, previous results try to maximize the number of nodes in sleep mode. However, minimizing the number of coordinators does not ensure to increase the system lifetime. In this thesis, we propose an algorithm that can elect coordinators with considering the amount of necessary energy to transmit assigned data and a connectivity of nodes in the networks. The result of proposed coordinator election algorithm can increase the system lifetime of an Ad-hoc network from the results of existing coordinator election algorithms.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.8 no.4 s.23
• /
• pp.68-76
• /
• 2005

In this paper, Ad-hoc network is a collection of mobile nodes without any wired infrastructure. Design of efficient routing protocols in ad-hoc network is a challenging issue. An AODV routing protocol for wireless ad hoc networks one that searches for and attempts to discover a route to some destination node. We propose a technique that reduce the number of Routing packet. Our technique use variable values reflecting the condition of network. This also contributes to improve throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.58-64
• /
• 2005

The nodes of Ad-hoc network are made up of location registration for sending information and a great number of packet transmissions to maintain routing route among the nodes. under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extend of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.653-655
• /
• 2015

The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.691-693
• /
• 2004

Mobile Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 multi-hop wireless links network 형태를 구성하여 통신이 이루어지게 하는 network이다. 따라서 효율적인 라우팅 프로토콜의 개발이 중요한 issue인데 최근에는 routing overhead가 적은 on-demand 프로토콜이 주목을 받고 있다. On-demand 프로토콜은 새로운 route을 구성하기 위해서 query packet을 broadcasting하게 되는데, 특히 노드들의 mobility가 많은 mobile ad hoc network(MANET)의 경우에는 더욱더 자주 발생하게 되는데, blind broadcasting은 neighbor 노드들 간의 radio transmission region overlap에 의해 redundancy, contention, collision 같은 broadcast storm 문제를 발생시키게 된다. 본 논문은 on-demand 프로토콜의 broadcast storm 문제를 해결하기 위해 Neighbor Topology을 고려 한 Dynamic Adaptation Query flooding scheme을 제시한다. 또한 Dynamic Adaptive Query flooding scheme은 broadcast storm 문제 해결뿐만 아니라 network의 congestion을 감소시켜 data packet의 성능 향상에도 기여 할 것이다.