• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.1
• /
• pp.15-24
• /
• 2008

The data delivery confirmation method of MIL-STD-188-220C, which is a tactical wireless mobile Ad-Hoc communication protocol, is that a source node requires the end-to-end ack from all destination nodes and the data-link ack from 1-hop neighboring destination nodes and relaying nodes, regardless of the hop distance from a source node to destination nodes. This method has the problem to degrade the whole communication network performance because of excessive data traffic due to the duplicate use of end-to-end ack and data-link ack, and the collision among end-to-end acks on the wireless network in the case of confirming a data delivery within an 1-hop distance. In order to solve this problem, this paper has proposed the method to perform the data delivery confirmation with the improvement of communication network performance through the data traffic reduction by achieving the reliable data delivery confirmation requiring the only data-link ack within an 1-hop distance. The effects of the proposed method are analyzed in the two aspects of the data delivery confirmation delay time and the data delivery confirmation success ratio.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1612-1621
• /
• 2007

In this paper, we introduced our designed TDMA (Time Division Multiple Access) based MAC (Medium Access Control) protocol for Home Networks called HomeTDMA. We have implemented and tested it in a test bed using crossbow motes and TinyOS. We also have compared HomeTDMA and CSMA (Carrier Sense Multiple Access) in terms of space and time complexity, channel access time, delivery success ratio, and throughput. Based on our results, HomeTDMA has an advantage over CSMA on channel access time, throughput and delivery success ratioIn the case of complexity, HomeTDMA is more complex compared to CSMA. Thus, CSMA is more appropriate in wireless sensor networks (WSNs) where memory, energy, and throughput are important parameters to be considered. However, HomeTDMA has a natural advantage of collision free medium access and is very promising for home networks where a reliable transmission or data transfer and congestion control is highly preferred.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.39-49
• /
• 2012

With group mobility, minimizing routing overhead among intra-group nodes can be achieved by making longer the routing update period, which may lead to degradation of inter-group's routing performance and consequently the inter-group packet delivery success ratio will be decreased. To reduce the inter-group routing overhead without lowering the inter-group packet delivery success ratio, a mobility-adaptive routing update(MARU) scheme is proposed in this paper. Main idea of the proposed scheme is group-based mobility prediction and updating routing paths by selecting intermediate common relay groups.

• Journal of Korea Multimedia Society
• /
• v.14 no.6
• /
• pp.752-758
• /
• 2011

In this paper, we perform a research on a message delivery link based on visible light communication using illumination light-emitting diodes (LEDs) for car-to-car communications and the link transmission success probability is analyzed for the link. The message delivery system is modeled and the signal-to-noise ratio is calculated from the received optical power. Then, the link transmission probability is estimated from the calculated bit error rates (BERs). The message delivery system has optical links from an LED transmitter near the rear lamp of a car ahead to a receiver near the headlamp of a car behind, whose positions are assumed to follow the normal Gaussian distribution. The link transmission success probability is calculated considering the physical characteristics of the optical link. The car positions are generated according to the normal distribution and the bit error rates are calculated for all links. The link transmission success probability is defined. For the unoptimized optical car-to-car message delivery links, it is shown that the link transmission success probability is larger than 0.9 with the transmitted optical power of 400 mW and the semi-angle at half power of 30 degree.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.141-156
• /
• 2011

In this paper we develop a link cost function for data delivery in sensor network. Usually most conventional methods determine the optimal coefficients in the cost function without considering the surrounding environment of the node such as the wireless propagation environment or the topological environment. Due to this reason, there are limitations to improve the quality of data delivery such as data delivery ratio and delay of data delivery. To solve this problem, we derive a new cost function using the concept of Partially Connected Neural Network (PCNN) which is modeled according to the input types whether inputs are correlated or uncorrelated. The correlated inputs are connected to the hidden layer of the PCNN in a coupled fashion but the uncoupled inputs are in an uncoupled fashion. We also propose the training technique for finding an optimal weight vector in the link cost function. The link cost function is trained to the direction that the packet transmission success ratio of each node maximizes. In the experimental section, we show that our method outperforms other conventional methods in terms of the quality of data delivery and the energy efficiency.

• Smart Media Journal
• /
• v.13 no.1
• /
• pp.45-51
• /
• 2024

Long Range Wide Area Network (LoRaWAN) is a widely adopted Internet of Things (IoT) protocol due to its high range and lower energy consumption. LoRaWAN utilizes Adaptive Data Rate (ADR) for efficient resource (e.g., spreading factor and transmission power) management. The ADR manages these two resource parameters on the network server side and end device side. This paper focuses on analyzing the ADR and Gaussian ADR performance of LoRaWAN. We have performed NS3 simulation under a static scenario by varying the antenna height. The simulation results showed that antenna height has a significant impact on the packet delivery ratio. Higher antenna height (e.g., 50 m) has shown an improved packet success ratio when compared with lower antenna height (e.g., 10 m) in static and mobility scenarios. Based on the results, it is suggested to use the antenna at higher allevation for successful packet delivery.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.13-28
• /
• 2009

Routing protocols in Delay/Disruption Tolerant Networks(DTN) are important to enhance the performance of transmission delay and delivery success ratio. In this paper, we propose an efficient DTN routing algorithm, called "Nobility Pattern based Routing(MPR)", that controls the total number of transferred message copies based on mobility patterns of mobile nodes. We consider a realistic "Levy walk" mobility pattern that has a super-diffusive property which well represents human mobility pattern. We implemented a DTN simulator using ONE simulator for the proposed MPR algorithm and Levy walk mobility pattern. Simulation results show that mobility patterns are very important for accurate evaluation of DTN routing performance, and the proposed MPR enhances the routing performance of delivery delay and success delivery ratio under realistic mobility pattern.

• 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 the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.59-67
• /
• 2009

In wireless sensor networks (WSNs), geographic greedy forwarding fails to move a packet further towards its destination if the sender does not have any closer node to the destination in its one hop transmission region. In this paper, we propose a enhanced geographic routing, called CGR(Cost based Geographic Routing) for efficient data delivery against void problem environment. CGR first establishes Shadow Bound Region and then accomplishes Renewing Cost Function Algorithm for effective greedy forwarding data delivery. Our simulation results show significant improvements compared with existing schemes in terms of routing path length, success delivery ratio and energy efficiency.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.107-113
• /
• 2017

Real-time multicasting is a packet transmission scheme ensuring that multiple destinations receive a packet within the desired time line. In wireless sensor networks, a packet can be delivered to a limited distance under a given deadline, since the end-to-end delay tends to be proportional to the end-to-end physical distance. Existing real-time multicasting protocols select the distance between the source and the furthest destination as the distance limitation and construct a multicasting tree guaranteeing delivery paths to each destination within the distance limitation. However, the protocols might lead to real-time delivery failures and energy efficiency degradation due to the fixed distance limitation. In this study, we proposed a real-time multicasting protocol using time deadline. The proposed protocol obtains the maximum transmittable distance with a given time deadline and subsequently constructs a multicasting tree using the maximum transmittable distance. The form of the multicasting tree varies according to the given time deadline to trade off the energy efficiency against the real-time delivery success ratio. The simulation results showed that the proposed scheme is superior to the existing protocols in terms of energy efficiency and real-time delivery success ratio under various time deadlines.