• Journal of Multimedia Information System
• /
• v.3 no.4
• /
• pp.129-134
• /
• 2016

A routing protocol in mobile ad hoc networks is important, and a location based routing has attracted attention. We have proposed a method, in which plural mobile agents (MA) manage location information and construct a route and the number of MA dynamically changes depending on the network situation. However, the area where each MA manages is not always appropriate. This would increase the network load due to unnecessary split and mergence of MAs. To solve this problem, in this paper, we propose an enhanced method. In this method, the MA management area is properly determined based on distribution of nodes. From the performance evaluation, we show that the proposed method outperforms conventional methods in terms of packet delivery rate when network load is high.

• Journal of Korea Multimedia Society
• /
• v.18 no.10
• /
• pp.1225-1230
• /
• 2015

Mobile Sensor Networks (MSN) is composed of a distributed collection of mobile sensor nodes, each of which has sensing, computation, communication and locomotion capabilities. Since the routing path can be broken when some nodes on the path move to other position, MSN may have a high rate of communication failure. So, MSN has to provide a means for low-cost and low-power routing to support mobility of sensor nodes. In this paper, a limited flooding scheme for routing in MSN is proposed to allow efficient energy utilization without requiring any complicated tasks for path maintenance.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1559-1571
• /
• 2011

In wireless ad hoc networks, nodes communicate with each other using multihop routed transmission in which hop-by-hop cooperative diversity can be effectively employed. This paper proposes (i) two cooperation models for per-link cooperation (PLC) and per-node cooperation (PNC) for exploiting cooperative diversity in wireless ad hoc networks and (ii) a cooperative routing algorithm for the above models in which best relays are selected for cooperative transmission. First, two cooperation models for PLC and PNC are introduced and represented as an edge-weighted graph with effective link quality. Then, the proposed models are transformed into a simplified graph and a cooperative routing algorithm with O(n2) time is developed, where n is the number of nodes in the network. The effectiveness of the algorithm is confirmed for the two cooperation models using simulation.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.190-192
• /
• 2012

Vehicular Ad hoc Networks (VANETs) is the new wireless networking concept of mobile ad hoc networks in research community. Routing in vehicular is a major challenge and research area. The majority of current routing algorithms for VANETs utilize indirect metrics to select the next hop and produce optimal node path. In this paper, we propose a distance and angle based routing algorithm for VANETs, which combines a distance approach with an angle based geographical strategy for selecting the next hop, with the purpose of using direct metrics to build a optimal node route. The proposed algorithm has better performance than the previous scheme.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1722-1729
• /
• 2008

This paper describes the contents about the efficient routing technique for improvement of transmission in Wireless Sensor Networks. Existing flat-based routing protocols have several problems like data overlap and implosion. Gossiping Algorithm in WSN is able to reduce the overhead and transmit packets through already set up the path but it takes place the data delivery and problem of worst-case. In this paper, we try to solve two problems that are data delivery and worst-case by selecting neighbor nodes using RSSI and number of linkage. The proposed model is available to real-mote and we confirmed the improvement of the performance against existing models.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.258-264
• /
• 2010

In the Ad-hoc networks, the limitation on the availability of power for operation is a significant bottleneck, given the requirements of portability, weight, and size of mobile devices. Hence, the use of routing metrics that consider the capabilities of the power sources of the network nodes contributes to the efficient utilization of energy. This paper presents a QoS routing protocol that minimize the power consumed by a packet in traversing from source node to the destination node. Results obtained of simulation show that, with our approach we can reduce the power consumption of nodes and increases the life time of the network.

• The Journal of Society for e-Business Studies
• /
• v.9 no.3
• /
• pp.277-288
• /
• 2004

The purpose of multimedia contents transmission is to resolve the large size and nonformal issues. Various multicasting technologies have been researched to support these issues. This paper suggests a technique to build multicast routing for safe and reliable transmission of multimedia contents. Network server nodes have their own weight with respect to communication loads. The weight is computed by a server's communication load with others. This suggests low delay routing with two or more edge server of content delivery network. We will show the weighted inter-server routing technique and analyze the network performance improvement caused by lower network traffic and delay.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.849-864
• /
• 2010

This paper proposes a multipath routing protocol called cross-layer multipath AODV (CM-AODV) for wireless ad hoc networks, which selects multiple routes on demand based on the signal-to-interference plus noise ratio (SINR) measured at the physical layer. Note that AODV (Ad hoc On-demand Distance Vector) is one of the most popular routing protocols for mobile ad hoc networks. Each time a route request (RREQ) message is forwarded hop by hop, each forwarding node updates the route quality which is defined as the minimum SINR of serialized links in a route and is contained in the RREQ header. While achieving robust packet delivery, the proposed CM-AODV is amenable to immediate implementation using existing technology by neither defining additional packet types nor increasing packet length. Compared to the conventional multipath version of AODV (which is called AOMDV), CM-AODV assigns the construction of multiple paths to the destination node and makes it algorithmically simple, resulting in the improved performance of packet delivery and the less overhead incurred at intermediate nodes. Our performance study shows that CM-AODV significantly outperforms AOMDV in terms of packet delivery ratio and average end-to-end delay, and results in less routing overhead.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.13-19
• /
• 2008

A mobile ad-hoc network routing protocols for transmission of multimedia contents need to have low delay time and to maintain the established route because it should secure quality of service(QoS) of the network. In this paper, the proposed protocol, termed HODMRP (History-based On-Demand Multicast Routing Protocol), is enhanced On-Demand Multicast Routing Protocol (ODMRP) by adding the criterion which is the session history for establishing route. The characteristic of this protocol is that data can be transmitted using the redundant route which is already selected by session history, if it occurs that the route is broken, HODMRP have better Packet Delivery Ratio (PDR) value and lower delay time than ODMRP by the simulation results.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.356-363
• /
• 2012

Power Aware Routing Protocol of MANET(Mobile Ad-hoc Network) minimized the power consumption of each node and helped to extend the lifetime of the network. But due to the nature of the protocol, it tends to increase the transmission delay, so multimedia transmissions were difficult to be applied. In this paper, a delay-power aware routing protocol is proposed considering the delay transmission delay that can be applied to ad hoc network. The proposed protocol consider two conflicting index, transmission delay and power consumption at the same time, maintaining a certain level of delay transmission delay while minimizes the power consumption. It is observed from the simulation results compared to not-considering delay transmission delay that the proposed protocol decrease transmission delay by 30% while the power consumption less than 10% increase.