• Title/Summary/Keyword: Information delivery scheme

Search Result 309, Processing Time 0.026 seconds

Push-N-Scheme with Timeout for Content Delivery of Social Networking Services

  • Jun, Kyungkoo
    • Journal of Information Processing Systems
    • /
    • v.10 no.1
    • /
    • pp.81-91
    • /
    • 2014
  • Widely spreading smart devices have become an important information sharing channel in everyday life. In particular, social networking services (SNS) are the hub for content creation and sharing. Users post their contents on SNS servers and receive contents of interest. Contents are delivered in either pull or push. Regarding delivery, cost and wait time are two important factors to be minimized, but they are in a trade-off relationship. The Push-N-scheme (PNS) and timeout-based push scheme (TPS) have been proposed for content delivery. PNS has an advantage in cost over TPS, whereas TPS has an edge in terms of the wait time over PNS. We propose a hybrid push scheme of PNS and TPS, called push-N-scheme with timeout (PNT), to balance the cost and the wait time. We evaluate PNT through simulations, with the results showing that PNT is effective in balancing PNS and TPS.

Buffer Scheme Optimization of Epidemic Routing in Delay Tolerant Networks

  • Shen, Jian;Moh, Sangman;Chung, Ilyong;Sun, Xingming
    • 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.

Power Allocation and Subcarrier Assignment for Joint Delivery of Unicast and Broadcast Transmissions in OFDM Systems

  • Lee, Deokhui;So, Jaewoo;Lee, Seong Ro
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.375-386
    • /
    • 2016
  • Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

Performance Improvement of Delay-Tolerant Networks with Mobility Control under Group Mobility

  • Xie, Ling Fu;Chong, Peter Han Joo
    • 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.

A Channel Allocation and Data Delivery Scheme Considering Channel Overlapping in Wireless Tactical Networks (군 전술망의 무선 이동 통신 체계의 통신 범위 중첩을 고려한 채널 할당 기법과 데이터 전달 기법)

  • Shin, Hyun-Sup;Chae, Sung-Yoon;Kang, Kyung-Ran;Cho, Young-Jong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.3
    • /
    • pp.501-508
    • /
    • 2011
  • In this paper, we propose a channel allocation algorithm of MSAP(Mobile Subscriber Access Point) and data delivery scheme exploiting the symbol level network coding. The network is comprised of TS(Tactical Switch) as a backbone node, MSAPs, and TMFTs(Tactical Multi-Function Terminal). The TS performs the channel allocation considering the communication range overlapping between the neighboring MSAPs and applies the symbol level network coding, if necessary, depending on the position of the TMFTs. Assuming the number of available antennas of TMFT and MSAP will be extended to two from one, we propose two schemes: single mode and dual mode. Through the simulation, we show that the proposed delivery scheme provides higher delivery ratio and lower delivery delay compared with the legacy store-and-forward scheme.

Information Delivery Scheme by Using DTN in Battlefield Eenvironment (전장 환경에서 DTN을 이용한 정보전달기법)

  • Kim, Young-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.3B
    • /
    • pp.260-267
    • /
    • 2011
  • Wireless Local Area Network (WLAN) is recently become popular on the internet since we can download and transfer mass data through it. However, transferring data with distances over 100m often causes some troubles. When downloading mass data from moving vehicles such as cars, jeeps, tanks, etc., if the download process from the first AP (Access Point) is not completed then we have to re-start this process from the second AP (from 0%). Therefore, the question is how to maintain the data we have received from the first AP, and then continuously download remaining data from the next APs in a battlefield environment. In this paper, we propose an effective method for receiving mass data separately from the mobile receive nodes in a Delay Tolerant Network (DTN). We carried on an experiment and evaluation by simulation; these simulation results are provided to show the proposed information delivery scheme performance.

An Energy Efficient Data Delivery Scheme based on Cross-Layer Design in Wireless Sensor Networks (무선 센서네트워크에서 교차계층 설계 기반의 에너지 효율적인 데이터 전송 기법)

  • Shin, Jong-Whoi;Kim, Jae-Hyun;Kim, Seog-Gyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.177-184
    • /
    • 2008
  • The design goal of protocols in wireless sensor networks (WSN) is mainly energy efficiency because of their stringent resource and energy constraints. In this paper, we propose a simple cross-layered protocol for WSNs, so called EATD(Energy-Aware Tree based Delivery scheme). EATD is a tree-based energy aware data delivery algorithm by using a SYNC packet with link and node cost to maximize the network lifetime. Our simulation results show significant improvements compared with existing schemes in terms of energy efficiency and delay.

  • PDF

A Fast Recovery Publish/Subscribe Scheme in Mobile Ad-hoc Environments (이동 애드혹 환경에서 빠른 복구를 지원하는 발행/구독 기법)

  • Moon, Sang-Chul;Ko, Yang-Woo;Lee, Dong-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.2
    • /
    • pp.186-190
    • /
    • 2008
  • This paper analyzes previous work on publish/subscribe in mobile ad-hoc networks with respect to collaboration methods among distributed event brokers. Our experiments suggest that approaches building event delivery structures are suitable for a scenario where there are events of various types each of which is consumed by a few subscribers. However, these approaches based on independent periodic exchange of network topology information may fail to reflect the up-to-date information when building event delivery paths. For this reason they do not correctly recover a broken path caused by node mobility, which results in lower event delivery rates. This paper proposes a scheme for building and maintaining event delivery paths based on advertisements initiated by and hence propagated from the root node. This guarantees correct recovery of event delivery paths within each period. Our experiments show that, our proposed scheme gives a better event delivery ratio with lower overhead.

k-hop Flooding-based Multicast Considering the Limited Mobility of Mobile Nodes and Intermittent Disconnection (노드의 제한적 이동성과 간헐적인 연결 단절을 고려한 k-홉 플러딩 기반 멀티캐스트)

  • Im, Kwang-Bin;Kang, Kyung-Ran;Cho, Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6A
    • /
    • pp.600-610
    • /
    • 2010
  • In this paper, a multicast mechanism is proposed for intermittently disconnected networks where the nodes move forward in formation or within a limited area. The proposed scheme extends the well-known tree-based multicast routing mechanism called MAODV by modifying the tree construction and data delivery scheme. Especially, an algorithm is introduced which determines the flooding hop count k estimating the degree of the movement of children in the tree. The performance evaluation was done by the simulation and the proposed scheme was compared with MAODV and two multicast routing schemes for DTN (Disruption Tolerant Network) including the Epidemic routing and ST-multicast. The evaluation results show that our scheme improves the original MAODV from the aspect of tree reconstruction events and message delivery ratio. Compared with the Epidemic routing scheme, our scheme achieves 85% message delivery ratio with less than 50% message delivery overhead.

HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks

  • Gan, Shunyi;Zhou, Jipeng;Wei, Kaimin
    • Journal of Information Processing Systems
    • /
    • v.13 no.3
    • /
    • pp.618-629
    • /
    • 2017
  • Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the "multi-hop forwarding" are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio.