• Title/Summary/Keyword: opportunistic computing

Search Result 18, Processing Time 0.029 seconds

Task Distribution Scheme based on Service Requirements Considering Opportunistic Fog Computing Nodes in Fog Computing Environments (포그 컴퓨팅 환경에서 기회적 포그 컴퓨팅 노드들을 고려한 서비스 요구사항 기반 테스크 분배 방법)

  • Kyung, Yeunwoong
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.1
    • /
    • pp.51-57
    • /
    • 2021
  • In this paper, we propose a task distribution scheme in fog computing environment considering opportunistic fog computing nodes. As latency is one of the important performance metric for IoT(Internet of Things) applications, there have been lots of researches on the fog computing system. However, since the load can be concentrated to the specific fog computing nodes due to the spatial and temporal IoT characteristics, the load distribution should be considered to prevent the performance degradation. Therefore, this paper proposes a task distribution scheme which considers the static as well as opportunistic fog computing nodes according to their mobility feature. Especially, based on the task requirements, the proposed scheme supports the delay sensitive task processing at the static fog node and delay in-sensitive tasks by means of the opportunistic fog nodes for the task distribution. Based on the performance evaluation, the proposed scheme shows low service response time compared to the conventional schemes.

Delayed offloading scheme for IoT tasks considering opportunistic fog computing environment (기회적 포그 컴퓨팅 환경을 고려한 IoT 테스크의 지연된 오프로딩 제공 방안)

  • Kyung, Yeunwoong
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.4
    • /
    • pp.89-92
    • /
    • 2020
  • According to the various IoT(Internet of Things) services, there have been lots of task offloading researches for IoT devices. Since there are service response delay and core network load issues in conventional cloud computing based offloadings, fog computing based offloading has been focused whose location is close to the IoT devices. However, even in the fog computing architecture, the load can be concentrated on the for computing node when the number of requests increase. To solve this problem, the opportunistic fog computing concept which offloads task to available computing resources such as cars and drones is introduced. In previous fog and opportunistic fog node researches, the offloading is performed immediately whenever the service request occurs. This means that the service requests can be offloaded to the opportunistic fog nodes only while they are available. However, if the service response delay requirement is satisfied, there is no need to offload the request immediately. In addition, the load can be distributed by making the best use of the opportunistic fog nodes. Therefore, this paper proposes a delayed offloading scheme to satisfy the response delay requirements and offload the request to the opportunistic fog nodes as efficiently as possible.

Design of Location and User Status Awareness Service Architecture Based on Opportunistic Computing with Ad-hoc Nodes (Ad-hoc 통신 노드를 이용한 기회 컴퓨팅형 위치인식 및 상황인지 서비스 구조 설계)

  • Kim, Tae-Hyon;Jo, Hyeong-Gon;Jeong, Seol-Young;Kang, Soon-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1199-1210
    • /
    • 2010
  • In recent years opportunistic computing has gained popularity in Ad-hoc network research area and it is highly required to research for actual services and related requirements. In this paper we summarized a virtual opportunistic service that is named "Children Care System" and proposed an Ad-hoc communication node (uMobile) that is connected with cellular phone and a sensor node (uClo) which is embedding into clothes. uMobile can support cellular phone communication and Ad-hoc communication and uClo can be embedded into clothes and recognize the user status using multiple sensors. In this paper we implemented the location awareness and user status awareness services using uMobile and uClo. We also tested them in indoor situation and showed the result. We expect that our research can play a significant role to inspire another various opportunistic computing services.

Protocol Design for Opportunistic Direct M2M Communication in Wearable Computing Environment (웨어러블 단말과 이웃 단말 간 기회기반 직접 사물통신 프로토콜 설계)

  • Oh, Young-Ho;Lee, Jae-Shin;Kang, Soon-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.2
    • /
    • pp.151-163
    • /
    • 2014
  • The recent wearable device's applications concentrates on providing diverse services such as location based service, context aware service to the users. These various services are implemented by the interactions between the wearable device and the user. In the legacy system, the interaction requires certain explicit configuration from the user. If the user is unfamiliar with the IT technology, it will be impossible to get the wanted service. Therefore, a new autonomous communication concept among neighbor devices is essential for people who is unfamiliar with the IT technology. The implicit human computer interface enables the user to acquire the services, even though the user don't know the IT technology. In this paper, we propose two BLE based protocols (B-LIDx protocol, B-PniP). B-LIDx protocol is the protocol for locationing the mobile device in indoor. B-PniP is a zero-configure opportunistic direct M2M communication protocol between neighbor devices to achieve the autonomous communication concept with zero-configuration. The protocol's evaluations are performed by measuring the time for finding the location of a mobile device in actual environment and aligning the time spent in services using the B-PniP.

A Direction Entropy-Based Forwarding Scheme in an Opportunistic Network

  • Jeon, MinSeok;Kim, Sun-Kyum;Yoon, Ji-Hyeun;Lee, JunYeop;Yang, Sung-Bong
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.3
    • /
    • pp.173-179
    • /
    • 2014
  • In an opportunistic network, one of the most challenging issues is the equilibrium of the network traffic and transmission delay for forwarding messages. To resolve this problem, we propose a new forwarding scheme, called the direction entropy-based forwarding scheme (DEFS), using the main direction and direction entropy based on the information collected about the directions of the nodes in the network. Since each node sends a message to another node with a different location and less direction entropy, DEFS utilizes those nodes that are more likely to travel to various locations to forward the messages to the destination nodes. Experiments were performed on the network simulator NS-2. The results show that DEFS provides better balance than the typical forwarding schemes, such as Epidemic, PRoPHET, and WAIT.

Energy-Efficient Opportunistic Interference Alignment With MMSE Receiver

  • Shin, Won-Yong;Yoon, Jangho
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.2
    • /
    • pp.83-87
    • /
    • 2014
  • This paper introduces a refined opportunistic interference alignment (OIA) technique that uses minimum mean square error (MMSE) detection at the receivers in multiple-input multiple-output multi-cell uplink networks. In the OIA scheme under consideration, each user performs the optimal transmit beamforming and power control to minimize the level of interference generated to the other-cell base stations, as in the conventional energy-efficient OIA. The result showed that owing to the enhanced receiver structure, the OIA scheme shows much higher sum-rates than those of the conventional OIA with zero-forcing detection for all signal-to-noise ratio regions.

Performance Analysis of Forwarding Schemes Based on Similarities for Opportunistic Networks (기회적 네트워크에서의 유사도 기반의 포워딩 기법의 성능 분석)

  • Kim, Sun-Kyum;Lee, Tae-Seok;Kim, Wan-Jong
    • KIISE Transactions on Computing Practices
    • /
    • v.24 no.3
    • /
    • pp.145-150
    • /
    • 2018
  • Forwarding in opportunistic networks shows low performance because there may be no connecting paths between the source and the destination nodes due to the intermittent connectivity. Currently, social network analysis has been researched. Specifically, similarity is one of methods of social networks analysis. In this paper, we propose forwarding schemes based on representative similarities, and evaluate how much the forwarding performance increases. As a result, since the forwarding schemes are based on similarities, these schemes only forward messages to nodes with higher similarity as relay nodes, toward the destination node. These schemes have low network traffic and hop count while having stable transmission delay.

OBPF: Opportunistic Beaconless Packet Forwarding Strategy for Vehicular Ad Hoc Networks

  • Qureshi, Kashif Naseer;Abdullah, Abdul Hanan;Lloret, Jaime;Altameem, Ayman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2144-2165
    • /
    • 2016
  • In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.

REVIEW ON ENERGY EFFICIENT OPPORTUNISTIC ROUTING PROTOCOL FOR UNDERWATER WIRELESS SENSOR NETWORKS

  • Ismail, Nasarudin;Mohamad, Mohd Murtadha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.3064-3094
    • /
    • 2018
  • Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design.

Reduction of the Retransmission Delay for Heterogeneous Devices in Dynamic Opportunistic Device-to-device Network

  • Chen, Sixuan;Zou, Weixia;Liu, Xuefeng;Zhao, Yang;Zhou, Zheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4662-4677
    • /
    • 2018
  • The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.