• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.89-96
• /
• 2016

In this paper, we study mobile data collector (MDC) based data-gathering schemes in wireless sensor networks. In Such networks, MDCs are used to collect data from the environment and transfer them to the sink. The majority of existing data-gathering schemes suffer from high data-gathering latency because they use only a single MDC. Although some schemes use multiple MDCs, they focus on maximizing network lifetime rather than minimizing packet delay. In order to address the limitations of existing schemes, this paper focuses on minimizing packet delay for given number of MDCs and minimizing the number of MDCs for a given delay bound of packets. To achieve the minimum packet delay and minimum number of MDCs, two optimization problems are formulated, and traveling distance and traveling time of MDCs are estimated. The interior-point algorithm is used to obtain the optimal solution for each optimization problem. Numerical results and analysis are presented to validate the proposed method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.4
• /
• pp.3-9
• /
• 2017

Due to difficulties of continuous electric power provision to underwater communication nodes, the efficient power usage is highly required in underwater network protocol. In this paper, we studied the energy efficient MAC(Medium Access Control) protocol for underwater network supporting mobile nodes such as UUV(Unmanned Underwater Vehicle) and AUV(Autonomous Underwater Vehicle). The mobile nodes could waste the electric power in vain when the receiver moves out of the radio propagation coverage during the data exchange and thus the transmitted data fails in reaching the receiver. Expecially, such a failure is much more obvious in underwater acoustic channels since the propagation delay is about $10^5$ times slower than in terrestrial radio channels. This proposed mobility-MAC controls the data dropping stochastically in the Dropping Zone by considering the receiver's location and moving velocity. In conclusion, this selective dropping method not only improves latency and throughput by reducing invalid droppings but also boosts power efficiency by valid droppings.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.393-404
• /
• 2004

Recently, mSCTP (Mobile SCTP) has been proposed as a transport layer approach for supporting mobility. mSCTP is based on the ‘multi-homing’ feature of Stream Control Transmission Protocol(SCTP), and utilize the functions to dynamically add or delete IP addresses of end points to or from the existing connectionin order to support mobility. In this paper, we propose a mechanism to determine when to add or delete an W address, utilizing the link layer radio signal strength information in order to enhance the performance of mSCTP We also propose a mechanism for a mobile node to initiate the change of data delivery path based on link layer radio signal strength information. In addition, if it takes long time to acquire new data path, we propose an approach for reducing handover latency. The simulation results show that the performance of proposed transport layer mobility support mechanism is competitive compared to the traditional network layer mobility supporting approach. Especially, when the moving speed of mobile node is fast, it shows better performance than the traditional network layer approaches.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.502-508
• /
• 2005

This paper proposes a dynamic hybrid patching technique that can improve the performance of VOD systems by adopting the advantages of both greedy patching and grace patching to use a VOD server's limited network-I/O bandwidth. The proposed technique uses grace patching to the requests for the videos, arrival intervals of which are smaller than the size of patching window, and uses greedy patching to the rest requests. In addition, proposed patching technique expands the latest particular patching multicast into a regular multicast for a new request. In result, the patching multicast data for the new request can be the data from the beginning to the skew point of the video and the holding time of a dispatched channel can exceedingly decrease. Simulation results confirm that the proposed technique is better than grace patching in terms of defection rate and average service latency.

• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.85-95
• /
• 2005

Whereas the traditional multicast schemes based on Mobile IP can support a limited number of very large multicast groups, the Xcast protocol can support a very large number of small multicast groups, In the Xcast, the source node encodes the list of destinations in the Xcast header. Therefore, the maximum packet size in the network limits the number of destinations that a Xcast packet may have. In this paper, an enhanced Xcast protocol is proposed to solve the multicast group size limitation of the existing Xcast protocol in providing multicast service for mobile nodes. Moreover, the SIP (a very flexible control plane protocol) is integrated with the proposed multicast scheme to provide mobility awareness on the application layer. The simulation results verify that the proposed multicast scheme not only increases the packet delivery ratio and the data packet forwarding efficiency but also achieves low latency of packets in the network.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.459-464
• /
• 2010

Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we implement and evaluate a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC), in wireless sensor networks. The TPC is implemented on sensor Mote hardwares. With the help of TPC implemented, sensors selectively use direct links for control and forwarding time critical sensed data and relay links for data forwarding based on the user delay constraints given. Implementation study shows that TPC helps the sensors to increase a significant amount of energy while collecting sensed data from sensors in a real environment.

• Journal of Digital Contents Society
• /
• v.19 no.8
• /
• pp.1545-1554
• /
• 2018

In order to support the mobility of the wireless devices, at least two APs (Access Points) must be arranged in a single AP area to maintain communication area. In the WLAN (Wireless LAN) environment, seamless handover is one of the most important issues in terms of effective utilization of wireless networks and maximization of services for users. On the other hand, SDN (Software-Defined Networking), which is emerging rapidly in recent years, is revolutionizing network management in terms of flexibility, fine control, and convenience. SDN originally reduces latency time or increases network robustness by real-time flow table control reducing or bypassing paths between switches in LAN-based data centers. In this study, we apply OpenFlow, a SDN platform focused on wired LAN, to a dense WLAN environment using legacy APs to implement and evaluate seamless handover for streaming services of digital contents.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.917-926
• /
• 2005

In this paper, we propose a transport layer mobility support protocol for multimedia streaming services in mobile/wireless environments by extending PR-SCTP to support mobility. We named the proposed scheme to be uPR-mSCTP. The rules related to provide unordered and unreliable data transfer, as well as an approach to minimize handover latency we proposed. Through the simulation results, it is shown that, since uPR-mSCTP reduces transmission rates during handover, not only it reduces the waste of network resources, but it also has the packet loss rate similar to FMIPv6, which is a lot smaller than UDP over MIPv6 or HMIPv6 It also incurs smaller control packet overhead compared to the network layer mobility support approaches.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.73-80
• /
• 2007

In conventional on-demand mobile ad hoc routing algorithms, an alternate path is sought only after an active path is broken. It incurs a significant cost in terms of money and time in detecting the disconnection and establishing a new route. In this thesis, we propose proactive route selection and maintenance to conventional mobile ad hoc on-demand routing algorithms. The key idea for this research is to only consider a path break to be likely when the signal power of a received packet drops below an optimal threshold value and to generate a forewarning packet. In other words, if a path is lost with high probability, the neighboring node that may easily be cut off notifies the source node by sending a forewarning packet. Then the source node can initiate route discovery early and switched to a reliable path potentially avoiding the disconnection altogether. For the simulational study, network simulator(NS2) is used. The result of simulation shows that the algorithm significantly improves the performance of networks comparing to conventional on-demand routing protocols based on DSR and AODV in terms of packet delivery ratio, packet latency and routing overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1B
• /
• pp.7-20
• /
• 2011

Recently, Proxy Mobile IPv6(PMIPv6) networks have been studied as the mobility management protocol to effectively use limited wireless resources. And the multicasting, which is core technology of the Internet broadcast system such as mobile IPTV, has been discussed mainly based on PMIPv6 network. However, multicasting based on PMIPv6 network causes disconnection of services because it does not solve problems of packet loss during binding and group joining procedure. Hence, we propose a seamless multicast scheme which prevents packet loss in PMIPv6 networks. The proposed scheme achieves lower latency than the existing scheme because it combines binding and group joining procedure, a1so it does not cause about packet losses due to performing buffering. We proved the performance using the simulations.