• Title/Summary/Keyword: opportunistic networking

Search Result 14, Processing Time 0.019 seconds

Cellular Traffic Offloading through Opportunistic Communications Based on Human Mobility

  • Li, Zhigang;Shi, Yan;Chen, Shanzhi;Zhao, Jingwen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.872-885
    • /
    • 2015
  • The rapid increase of smart mobile devices and mobile applications has led to explosive growth of data traffic in cellular network. Offloading data traffic becomes one of the most urgent technical problems. Recent work has proposed to exploit opportunistic communications to offload cellular traffic for mobile data dissemination services, especially for accepting large delayed data. The basic idea is to deliver the data to only part of subscribers (called target-nodes) via the cellular network, and allow target-nodes to disseminate the data through opportunistic communications. Human mobility shows temporal and spatial characteristics and predictability, which can be used as effective guidance efficient opportunistic communication. Therefore, based on the regularity of human mobility we propose NodeRank algorithm which uses the encounter characteristics between nodes to choose target nodes. Different from the existing work which only using encounter frequency, NodeRank algorithm combined the contact time and inter-contact time meanwhile to ensure integrity and availability of message delivery. The simulation results based on real-world mobility traces show the performance advantages of NodeRank in offloading efficiency and network redundant copies.

OPEED: Optimal Energy-Efficient Neighbor Discovery Scheme in Opportunistic Networks

  • Yang, Dongmin;Shin, Jongmin;Kim, Jeongkyu;Kim, Geun-Hyung
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.34-39
    • /
    • 2015
  • In opportunistic networks, it is difficult to predict when a node encounters others and how long it keeps in contact with another. Nodes continually attempt to explore neighbor nodes in the vicinity to transmit data. In battery-operated devices, this persistent exploration consumes a great deal of energy. In this paper, we propose an optimal energy-efficient neighbor discovery scheme (OPEED) that guarantees neighbor discovery within a delay bound. Through performance evaluation, we show that the OPEED scheme consumes 33%-83% less energy than other schemes.

Fast Recovery Routing Algorithm for Software Defined Network based Operationally Responsive Space Satellite Networks

  • Jiang, Lei;Feng, Jing;Shen, Ye;Xiong, Xinli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2936-2951
    • /
    • 2016
  • An emerging satellite technology, Operationally Responsive Space (ORS) is expected to provide a fast and flexible solution for emergency response, such as target tracking, dense earth observation, communicate relaying and so on. To realize large distance transmission, we propose the use of available relay satellites as relay nodes. Accordingly, we apply software defined network (SDN) technology to ORS networks. We additionally propose a satellite network architecture refered to as the SDN-based ORS-Satellite (Sat) networking scheme (SDOS). To overcome the issures of node failures and dynamic topology changes of satellite networks, we combine centralized and distributed routing mechanisms and propose a fast recovery routing algorithm (FRA) for SDOS. In this routing method, we use centralized routing as the base mode.The distributed opportunistic routing starts when node failures or congestion occur. The performance of the proposed routing method was validated through extensive computer simulations.The results demonstrate that the method is effective in terms of resoving low end-to-end delay, jitter and packet drops.

Delay Analysis under Dynamic Traffic in Network (IEEE 802.11무선망에서 기회적 채널 전환을 통한 다중사용자 다이버시티 이득 향상)

  • Hahm, Seong-Il;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.3
    • /
    • pp.243-250
    • /
    • 2009
  • Channel diversity is exploited to increase multiuser diversity gains in IEEE 802.11 WLANs. To this end, we propose an opportunistic channel switching method and evaluate this with different number of stations, number of channels, switching latency, and the average channel condition of stations.

The Impact of Information Access Monitoring between Dilemma of Unethical Information Sharing and Social Networking (비윤리적 정보공유 딜레마와 사회적 네트워킹 관계에서 정보접근 모니터링의 영향력)

  • Jung, Byoungho
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.14 no.2
    • /
    • pp.91-105
    • /
    • 2018
  • The purpose of this study is to examine an immoral effectiveness decrease by information access monitoring between ethical dilemma and unethical information-sharing behavior. Firms are raising the demand of confidential information management and are highlighting the ethical awareness of organizational members. The individuals in organization are concerned information sharing for future-oriented social networking. To prevent their immoral behavior, Firms should consider investing the information access monitoring. This system is aiming at log verification of movement, storage and deletion on information and will reduce an ethical conflict and unethical behavior on employees. I used the structural equation methodology for this empirical study. The research model constructs the voluntary and involuntary dilemma of information sharing on the two independent-variables, the unethical information behavior and the improper networking reinforcement on the two dependent-variables and the information access monitoring the one mediating-variables. This model tests the power effect of direct path, indirect path and total path. According to the study, the two ethical dilemma of information sharing provided a high influence to the unethical sharing action and to the inappropriate social networking strengthens. However, the mediating role of information access monitoring shows the effect weakens of independent and dependent variables. Thus, the mediating variables appeared to be important for the controlling role of an unethical behavior and improper social networking. Ultimately, The firms will need to invest the information access monitoring for a compulsory ethics behavior of organizational members. In addition, this can hinder networking enhancements for future opportunistic behaviors.

Joint Uplink/Downlink Co-Opportunistic Scheduling Technique in WLANs (무선랜 환경에서 협동 상향/하향 링크 기회적 스케줄링 기법)

  • Yoo, Joon;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.514-524
    • /
    • 2007
  • Recent advances in the speed of multi-rate wireless local area networks (WLANs) and the proliferation of WLAN devices have made rate adaptive, opportunistic scheduling critical for throughput optimization. As WLAN traffic evolves to be more symmetric due to the emerging new applications such as VoWLAN, collaborative download, and peer-to-peer file sharing, opportunistic scheduling at the downlink becomes insufficient for optimized utilization of the single shared wireless channel. However, opportunistic scheduling on the uplink of a WLAN is challenging because wireless channel condition is dynamic and asymmetric. Each transmitting client has to probe the access point to maintain the updated channel conditions at the access point. Moreover, the scheduling decisions must be coordinated at all clients for consistency. This paper presents JUDS, a joint uplink/downlink opportunistic scheduling for WLANs. Through synergistic integration of both the uplink and the downlink scheduling, JUDS maximizes channel diversity at significantly reduced scheduling overhead. It also enforces fair channel sharing between the downlink and uplink traffic. Through extensive QualNet simulations, we show that JUDS improves the overall throughput by up to 127% and achieves close-to-perfect fairness between uplink and downlink traffic.

Hybrid Scheduling in Millimeter Wave Full-Duplex Systems (밀리미터파 전 이중 시스템에서의 혼성 스케줄링)

  • Mai, Vien V.;Kim, Juyeop;Choi, Sang Won;Shin, Won-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.1
    • /
    • pp.52-57
    • /
    • 2016
  • We introduce a hybrid scheduling in a multi-path poor scattering full-duplex (FD) system, which consists of one multi-antenna FD base station and a large number of single-antenna half-duplex mobile stations. Our hybrid scheduling utilizes partial channel state information at the transmitter. In particular, unlike the conventional scheduling method using opportunistic transmission for both uplink and downlink, the proposed scheme combines a random transmit beamforming for downlink and a zero forcing beamforming for uplink. As our main result, via computer simulations, it is shown that the proposed scheme has a superior sum-rate performance than that of the conventional scheduling method beyond a certain signal-to-noise ratio regime.

Implementation of CAN-based Visible LED Communication Systems (CAN 기반 LED 가시광 통신 시스템 구현)

  • Sohn, Kyung-Rak
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.35 no.1
    • /
    • pp.102-107
    • /
    • 2011
  • LED-based lighting motivated by significant energy savings provides an opportunistic development of widespread free-space optical communications. Their transceivers have a variety of competitive advantages over RF including high bandwidth density, reliability, lower energy consumption, and long lifetime. But, it is difficult for existing buildings and structures such as ships and vehicles to install the communication cable to the ceiling. In this paper, controller area network (CAN)-based LED lighting communication systems were proposed. Results indicate the viability of developing inexpensive CAN interface modules and transceivers might be embedded in lighting products to support the indoor wireless networking.

A Network Coding Mechanism Minimizing Congestion of Lossy Wireless Links (손실이 있는 무선 링크에서 혼잡을 최소화하는 네트워크 코딩 기법)

  • Oh, Hayoung;Lim, Sangsoon
    • Journal of KIISE:Information Networking
    • /
    • v.41 no.4
    • /
    • pp.186-191
    • /
    • 2014
  • Previous work only focuses on a maximization of network coding opportunity since it can reduce the number of packets in network system. However, it can make congestion in a relay node as each source node may transmit each packet with the maximum transmission rate based on the channel qualities. Therefore, in this paper, we propose CmNC (Congestion minimized Network Coding over unreliable wireless links) performing opportunistic network coding to guarantee the network coding gain with the consideration of the congestion and channel qualities. The relay node selects the best network code set based on the objective function for reducing the packet loss and congestion via a dynamic programming. With Qualnet simulations, we show CmNC is better up to 20% than the previous work.

Hot spot DBC: Location based information diffusion for marketing strategy in mobile social networks (Hotspot DBC: 모바일 소셜 네트워크 상에서 마케팅 전략을 위한 위치 기반 정보 유포)

  • Ryu, Jegwang;Yang, Sung-Bong
    • Journal of Intelligence and Information Systems
    • /
    • v.23 no.2
    • /
    • pp.89-105
    • /
    • 2017
  • As the advances of technology in mobile networking and the popularity of online social networks (OSNs), the mobile social networks (MSNs) provide opportunities for marketing strategy. Therefore, understanding the information diffusion in the emerging MSNs is a critical issue. The information diffusion address a problem of how to find the proper initial nodes who can effectively propagate as widely as possible in the minimum amount of time. We propose a new diffusion scheme, called Hotspot DBC, which is to find k influential nodes considering each node's mobility behavior in the hotspot zones. Our experiments were conducted in the Opportunistic Network Environment (ONE) using real GPS trace, to show that the proposed scheme results. In addition, we demonstrate that our proposed scheme outperforms other existing algorithms.