• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1527-1552
• /
• 2018

The rapidly-evolving demand of applications using wireless sensor networks in several areas such as building and industrial automation or smart cities, among other, makes it necessary to determine and provide QoS support mechanisms which can satisfy the requirements of applications. In this paper we propose a mechanism that establishes different QoS levels, based on Publish/Subscribe model for wireless networks to meet application requirements, to provide reliable delivery of packet and timeliness. The first level delivers packets in a best effort way. The second one intends to provide reliable packet delivery with a novel approach for Retransmission Timeout (RTO) calculation, which adjusts the RTO depending on the subscriber Packet Delivery Ratio (PDR). The third one provides the same reliable packet delivery as the second one, but in addition, it provides data aggregation trying to be efficient in terms of energy consumption and the use of network bandwidth. The last one provides timeliness in the packet delivery. We evaluate each QoS Level with several performance metrics such as PDR, Message Delivery Ratio, Duplicated and Retransmitted Packet Ratio and Packet Timeliness Ratio to demonstrate that our proposal provides significant improvements based on the increase of the PDR obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2180-2200
• /
• 2015

This paper considers mobility control to improve packet delivery in delay-tolerant networks (DTNs) under group mobility. Based on the group structure in group mobility, we propose two mobility control techniques; group formation enforcement and group purposeful movement. Both techniques can be used to increase the contact opportunities between groups by extending the group's reachability. In addition, they can be easily integrated into some existing DTN routing schemes under group mobility to effectively expedite the packet delivery. This paper is divided into 2 parts. First, we study how our proposed mobility control schemes reduce the packet delivery delay in DTNs by integrating them into one simple routing scheme called group-epidemic routing (G-ER). For each scheme, we analytically derive the cumulative density function of the packet delivery delay to show how it can effectively reduce the packet delivery delay. Then, based on our second proposed technique, the group purposeful movement, we design a new DTN routing scheme, called purposeful movement assisted routing (PMAR), to further reduce the packet delay. Extensive simulations in NS2 have been conducted to show the significant improvement of PMAR over G-ER under different practical network conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3257-3274
• /
• 2012

Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet delivery rate by two mechanisms based on the forwarding features of ODAM. The first distance-based mechanism reduces the possibility of packet loss by considering the angles between source nodes, forwarding nodes and receiving nodes. The second mechanism increases the redundancy of forwarding nodes to guarantee the packet success delivery ratio. We show by analysis and simulations that the proposed algorithm can improve packet delivery rate for vehicular networks compared against two widely-used existing protocols.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.656-666
• /
• 2014

In delay tolerant networks (DTNs), delay is inevitable; thus, making better use of buffer space to maximize the packet delivery rate is more important than delay reduction. In DTNs, epidemic routing is a well-known routing protocol. However, epidemic routing is very sensitive to buffer size. Once the buffer size in nodes is insufficient, the performance of epidemic routing will be drastically reduced. In this paper, we propose a buffer scheme to optimize the performance of epidemic routing on the basis of the Lagrangian and dual problem models. By using the proposed optimal buffer scheme, the packet delivery rate in epidemic routing is considerably improved. Our simulation results show that epidemic routing with the proposed optimal buffer scheme outperforms the original epidemic routing in terms of packet delivery rate and average end-to-end delay. It is worth noting that the improved epidemic routing needs much less buffer size compared to that of the original epidemic routing for ensuring the same packet delivery rate. In particular, even though the buffer size is very small (e.g., 50), the packet delivery rate in epidemic routing with the proposed optimal buffer scheme is still 95.8%, which can satisfy general communication demand.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1062-1070
• /
• 2017

Real-time transmission studies in wireless sensor networks propose a mechanism that exploits a node that has a higher delivery speed than the desired delivery speed in order to satisfy real-time requirement. The desired delivery speed cannot guarantee real-time transmission in a congested area in which none of the nodes satisfy the requirement in one hop because the desired delivery speed is fixed until the packet reaches the sink. The feature of this mechanism means that the packet delivery speed increases more than the desired delivery speed as the packet approaches closer to the sink node. That is, the packet can reach the sink node earlier than the desired time. This paper proposes an improved real-time transmission by controlling the delivery speed using the temporal gain which occurs on the packet delivery process. Using the received data from a previous node, a sending node calculates the speed to select the next delivery node. The node then sends a packet to a node that has a higher delivery speed than the recalculated speed. Simulation results show that the proposed mechanism in terms of the real-time transmission success ratio is superior to the existing mechanisms.

• 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.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.3
• /
• pp.332-339
• /
• 2013

The network nodes in a tactical network moves continuously and due to the physical and electronic obstacles, the connections are not always available. Due to the frequent disconnections, it is hard to discover the path among the nodes in a DTN. According to PROPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity), one of the most well-known DTN routing protocols, a DTN node determines whom to forward a packet according to the packet delivery probability. From the viewpoint of a node, the packet delivery probability of another node is degraded while the nodes are disconnected whereas it is improved when they encounter. In this paper, we enhance the algorithm estimating the packet probability by considering the encounter count as an additional parameter. Our algorithm prefers the node that encounters the destination more frequently in selecting the next hop toward the destination. We evaluated the performance of our algorithm by simulating military operations using a DTN-dedicated simulator. Through the simulations, we show that our proposed algorithm achieve higher packet delivery ratio with similar overhead compared with PROPHET.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2000.11b
• /
• pp.15-19
• /
• 2000

This paper is about MPEG-4 error resilience tools of video streaming on packet service(ex, Internet). It is need to packetization for MPEG-4 video transport by packet unit on MPEG-4 system, this paper suggest packetization method of minimizing packet error on packet service[1]. FEC(Forward Error Correction) and retransmission is usually used for recovery of packet loss, and this paper suggest applying these method to DMIF(Delivery Multimedia Integration Framework) for minimizing packet loss[2].

• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.97-104
• /
• 2019

Distributed mobility management (DMM) does not use a centralized device. Its mobility functions are distributed among routers; therefore, the mobility services are not limited to the performance and reliability of specific mobility management equipment. The DMM scheme has been studied as a partially distributed architecture, which distributes only a packet delivery domain in combination with the software defined network (SDN) technology that separates the packet delivery and control areas. Particularly, a separated control area is advantageous in introducing a new service, thereby optimizing the network by recognizing the entire network situation and taking an optimal decision. The SDN-based mobility management scheme is studied as a method to optimize the packet delivery path whenever a mobile node moves; however, it results in excessive signaling processing cost. To reduce the high signaling cost, we propose a hybrid distributed mobility management method and analyze its performance mathematically.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.76-78
• /
• 2002

Multicasting over mobile IP network becomes more important with the increasing needs of supporting multimedia services in mobile network. The IETF has suggested two approaches which are remote subscription and bidirectional tunneling for supporting mobility management in multicasting over mobile IP. But these protocols have problems - the frequent reconstruction of multicast delivery tree, packet less during handoff, convergence problem, and so on. In this paper, we propose to use preconfiguration of multicast delivery tree when mobile host enters the foreign network. It will decrease the frequency of multicast delivery tree reconstruction, and reduce the packet loss during handoff, Also the multicast delivery tree maintained by Keep Alive messages makes the signaling overload of networks diminished.