• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.6
• /
• pp.555-562
• /
• 2010

Currently digital TRS is providing the voice-oriented service based on stat-tree topology of 2.5G. As result of that, it has alimitation to accept the wide band multimedia services. Therefore, this paper designed the mesh topology based on packet networkand proposed the algorism of dynamic path establishment based on priority. In korea case, we confirmed that hop numbers priority base is more reasonable than distance priority base. And counted the trunk traffic including redundancy traffic to prevent the bottlenect situation and trouble. Also analysed the bandwidth between network management centers of backbone and access.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.4
• /
• pp.783-793
• /
• 2010

Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or propagate useful traffic information to other vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collisions at the link layer due to an excessive number of broadcast packets. We present a fuzzy alert message dissemination algorithm to improve performance for road safety alert application in Vehicular Ad-hoc Network (VANET). In the proposed algorithm, when a vehicle receives an alert message for the first time, the vehicle rebroadcasts the alert message according to the fuzzy control rules for rebroadcast degree, where the rebroadcast degree depends on the current traffic density of the road and the distance between source vehicle and destination vehicle. Also, the proposed algorithm is the hybrid algorithm that uses broadcast protocol together with token protocol according to traffic density. The performance of the proposed algorithm is evaluated through simulation and compared with that of other alert message dissemination algorithms.

• Convergence Security Journal
• /
• v.8 no.1
• /
• pp.9-18
• /
• 2008

This paper propose CAR-TO-CAR protocol which can prevent the cars at high-speed from a multiple clash accident at highway with exchanging information. we construct cluster be linked with distance took from GPS(Global Positioning System) because there is no connection at cars on the road. The proposed method solved the overload problem by establishing route because construct the cluster at the IEEE 802.11 MAC class. 'Multi-hop Routing protocol' based on Active Network enable stable Network to be formed by using Active Network.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.388-393
• /
• 1992

An infrared range finder using a self-mixing laser diode (SM-LD), which has been proposed and developed by the Authors, can measure not only a range of a moving target but its velocity simultaneously. In this paper, described is that the precise mode-hop pulse train can be obtained by employing a new signal processing circuit even when the backscattered light returning into the SM-LD is much more weaker. As a result, the distance to a tilted square sheet made from aluminium or white paper, which is placed 10 cm through 60 cm from the SM-LD, is measured with accuracy of a few percent even when the tilting angle is less than 75 degrees or 85 degrees, respectively. And in this paper, described is the range-image recognition of a plane object under the condition of standstill. The output laser beam is scanned by scanning two plane mirrors-equipped with each stepping motor. And we succeeded in the acquisition of the range-image of a plane object in a few tens of seconds. Furthermore, described is a feasibility study about the range-image recognition of a slowly moving plane object.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.1
• /
• pp.89-96
• /
• 2015

The various services applied internet have been provided by the rapid development of wireless networks and providing multimedia contents are also increasing. It is caused a number of problems such as increasing of network traffic rapidly. P2P technique is gaining popularity for solving these problems. In particular, P2P technique in a wireless network environment has gained much popularity. Among them, MANET-based P2P techniques has been studied actively. It is not easy to be applied the existing technique as it is due to the dynamic topology and low bandwidth by moving nodes in MANET that is consisted of only mobile nodes. In this paper, we proposed sharing group construction technique for providing a stable connection between mobile nodes and reducing the load of network traffic and overhead of sharing group reconfiguration in order to improve data transmission performance between mobile nodes. The sharing group member nodes applied virtual sharing group generation technique with neighboring nodes of 1-hop distance in order to reduce traffic for file sharing. We performed comparative experiments with DHT technique to evaluate the performance of the proposed technique in this paper and the excellent performance is confirmed through experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.529-546
• /
• 2010

Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local information to forward packets to the destination and does not have to maintain the routing table, and thus it takes small overhead and has excellent scalability. However, the signal intensity reduces exponentially with the distance in realistic wireless sensor network, and greedy forwarding consumes a lot of energy, since it forwards the packets to the neighbor node closest to the destination. Previous proposed greedy forwarding protocols are the sender-based greedy forwarding that a sender selects a neighbor node to forward packets as the forwarding node and hence they cannot guarantee energy efficient forwarding in unpredictable wireless environment. In this paper, we propose the receiver-based greedy forwarding called RGF where one of the neighbor nodes that received the packet forwards it by itself. In RGF, sender selects several energy efficient nodes as candidate forwarding nodes and decides forwarding priority of them in order to prevent unnecessary transmissions. The simulation results show that RGF improves delivery rate up to maximum 66.8% and energy efficiency, 60.9% compared with existing sender-based greedy forwarding.

• Convergence Security Journal
• /
• v.13 no.6
• /
• pp.69-76
• /
• 2013

A lot of researches have been done to improve the energy efficiency of Wireless Sensor Networks. But all the current researches are based on the idea of direct communication between cluster head and sink node. Previous results assume that node can intelligently regulate signal energy according to the distance between nodes. It is difficult to implement algorithms based on this assumption. We present a multi-level routing algorithm from the sink node to all other nodes which have fixed radio wave radius. We also show the energy saving efficiency and the implementation in real WSN using the simulation result.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.30-35
• /
• 2002

Dynamic routing uses routing protocols to select the best routes and to update the routing table. RP (Routing Information Protocol)using a distance-vector algorithm becomes generally known a routing protocol on the network. RIP selects the route with the lowest "hop count" (metric) as the best route. but RIP has a serious shortcoming. a mP router cannot maintain a complete routing table for a network that has destinations more than 15 hops away. To overcome this defect, It uses the OSPF (Open Shortest Path First) of link -state protocols developed for TCP/IP. It is suitable for very large networks and provides several advantages over RIP. This paper analyzes the traffic and the link efficiency between two protocols such as message delivery and delay, link utilization, message counts on the same network.e network.

• Journal of information and communication convergence engineering
• /
• v.9 no.4
• /
• pp.358-362
• /
• 2011

The National Emergency Management Agency of South Korea has established a Disaster Victims Psychology Support Center. The Disaster Victims Psychology Support Center can enable victims who got psychological damage from disasters to return to their daily lives through healing activity, field visits and advice of experts. The previous Psychology Support Center System managed the information of disaster victims through an independent database. However, this paper proposes a system that is developed to identify medical institutions and mental health centers within a distance of radius, based on the potential Hot-Spot areas of disaster victims using the GIS Systems. The proposed system can efficiently support selection of appropriate institutions for disaster victims using their location and age, classification of damage, and damaged parts of the body. Also, this spatial analysis can assist to decide on a policy based on the location of disaster victims and the extent of damage. Therefore, this paper can provide the required information to support decision making based on the concentrated areas for disaster victims.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.11
• /
• pp.471-474
• /
• 2013

In this paper, we propose a distributed parent peer selection method to construct an efficient peer-to-peer(P2P) network topology by considering the capacity of a peer and the hop distance from a data source to the peer. To achieve this goal, we propose a method to combine the two performance metrics to calculate the probability that a peer becomes a parent peer. Using the probability, we propose a method to select a parent peer stochastically by making use of the state information of the neighboring peers that each peer maintains. Through simulation studies, we show that the proposed method drives high capacity peers to support more children peers and makes the diameter of the P2P network shorter than the other methods.