• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.721-726
• /
• 2012

In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.529-537
• /
• 2008

AODV routing protocol is intended for use by mobile' nodes in an ad-hoc network. In AODV nodes create routes on an on-demand basis. As the degree of node mobility becomes high, however, the number of the control packets, RREQ and RREP messages, have increased so rapidly. The unexpected increases in the number of the control packets cause the destination node to decrease the packet receiving rate and also to increase the overall energy consumption of such a network. In this paper, we propose a novel method of adaptively controlling the occurrences of such RREQ messages based on AIAD (additive increase additive decrease) under a consideration of the current network status. We have tested our proposed method with the conventional AODV and the method using timestamp based on the three performance metrics, i.e.. how long does node moves, node velocity, and node density, to compare their performance.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.208-217
• /
• 2008

Sensors have a function to gather environment-related information operating by small-size battery in sensor networks. The issue related with energy is still an important in spite of the recent advancements in micro-electro-mechanical-system(MEMS) related techology. Generally it is assumed that replacement or rechargement of battery power in sensor is not feasible and a message send operation may spend at least 1000 times battery than a local operation. Thus, there have been several kinds of research efforts to lessen the number of unnecessary messages by maintaining the information of the other neighboring(or all) sensors. In this paper, we propose an index structure based on parent-children relationship to the purpose. Namely, parent node gathers the set of location information and MBA per child. It's named PH and may allow to process the range query with higher accurate and small size information. Through extensive experiments, we show that our index structure has better energy consumption.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1235-1244
• /
• 2002

This paper proposes a group key management protocol for a secure of all the multicast user in PIM-SM multicast group communication. With prosed architect, subgroups for multicast secure group management will be divided by RP (Rendezvous-Point) unit and each RP has a subgroup manager. Each subgroup manager gives a secure key to it's own transmitter md the transmitter compress the data with it's own secure key from the subgroup manager. Before the transmitter send the data to receiver, the transmitter prepare to encrypt a user's service by sending a encryption key to the receiver though the secure channel, after choking the user's validity through the secure channel. As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key. As a result, the transmitting time is shortened because there is no need to data translation by group key on data sending and the data transmition is possible without new key distribution at path change to SPT (Shortest Path Tree) of the router characteristic. Additionally, the whole architecture size is samller than the other multicast secure architecture by using the conventional PIM-SIM routing structure without any additional equipment.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1221-1234
• /
• 2010

MANET(Mobile Ad-hoc Network)s have been researched primary at routing protocols and at the guarantees of QoS(Quality of Service) for mobile environments. Otherwise the Ubiquitous Sensor Networks (USNs) have some limitations in power energies and in processing of sensing data, as well as their network topologies are frequently changed by fading off and node failures. Thus we should redesign network protocols with concerning to energy efficiency for the USNs above all. In this paper, we focus on the protocol interface for managing for USNs based on the surveys. And then we figure the topology of USNs out and design the network protocol interface to make power saved, with data gathering and processing more efficient using our designed packet structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11B
• /
• pp.792-803
• /
• 2005

Ultra wide band (UWB) technology will be applied in the high rare wireless personal area networks (WPANs) for its high rate, low power, and innate immunity to multipath fading. In this paper, a power aware multi-hop packet relay MAC protocol in UWB based WPANs is proposed and a power aware path status factor (PAPSF), which is derived from SINR and power resource condition of each device, is used to select a suitable relay node. Compared with relaying by piconet coordinator (PNC), which is easily chosen by other ad hoc routing protocol, the new scheme can achieve hi임or throughput, decrease the time required for transmitting high power signal and we can easily distribute the battery power consumption from PNC to other devices in the piconet to prevent the PNC device using up its battery too fast and finally avoid PNC handover too frequently.

• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.55-64
• /
• 2007

The sensor nodes on the sensor network transmit the reply for the queries of ADV(Advertisement) message from sink node, and the sink node presents the received information to users. To find the relevant sensor nodes, routing algorithms disseminates ADV messages to the whole network. Thus not only the relevant sensor nodes but also the irrelevant ones consume considerable amount of energy. To alleviate such kind of energy consumption, this thesis proposes a new routing algorithm and coins it Directed Messaging. It propagates ADV message only to the limited direction and changes the direction until the requested sensor node is found. In this way, Directed Messaging reduces unnecessary energy consumption and enhance the efficiency of the networks. Performance of the Directed Messaging algorithm is evaluated through simulation and compared with Directed Diffusion algorithm. Simulation results show that it has better performance than Directed Diffusion.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1077-1088
• /
• 2013

As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.7
• /
• pp.622-628
• /
• 2016

The prosperity of IT technologies and the removal of restrictions regarding Unmanned Aerial Vehicles (UAVs), also known as drones, have driven growth in their popularity. However, without a proper solution to the problem of accident avoidance for UAVs, this popularity increases the potential for collisions between UAVs and between UAV and terrain features. These collisions can occur because UAVs to date have flown using radio control or image recognition based autonomous navigation. Therefore, we propose efficient UAV routing schemes to tackle the collision problem using vehicular communication systems. Performance evaluation by computer simulation shows that the proposed methods effectively reduce the collision probability and improve the routing efficiency of the UAV. Furthermore, the proposed algorithms are compatible and can be directly applied with small overhead to the commercial vehicular communication system implementation.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.1-7
• /
• 2014

WireWireless sensor networks(WSNs) are generally comprised of densely deployed sensor nodes, which causes highly redundant sensor data transmission and energy waste. Many studies have focused on energy saving in WSNs. However, delay problem also should be taken into consideration for mission-critical applications. In this paper, we propose a BISA (Bio-Inspired Scheduling Algorithm) to reduce the energy consumption and delay for WSNs inspired by biological systems. BISA investigates energy-efficient routing path and minimizes the energy consumption and delay using multi-channel for data transmission. Through simulations, we observe that the BISA archives energy efficiency and delay guarantees.