• Title/Summary/Keyword: Message Delay

Search Result 372, Processing Time 0.026 seconds

On the Heterogeneous Postal Delivery Model for Multicasting

  • Sekharan, Chandra N.;Banik, Shankar M.;Radhakrishnan, Sridhar
    • Journal of Communications and Networks
    • /
    • v.13 no.5
    • /
    • pp.536-543
    • /
    • 2011
  • The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.

Modeling message dissemination over multi-channel social network (다중 채널 소셜 네트워크상의 메시지 전송 모델링)

  • Kim, Kyung Baek
    • Smart Media Journal
    • /
    • v.3 no.1
    • /
    • pp.9-15
    • /
    • 2014
  • In these days, along with the extreme popularity of online social network services, it becomes an important problem understanding the role of social network in the research of message dissemination. Past studies of message dissemination over online social network services mostly consider the coverage of message dissemination and the methods to maximize it. But, these works lack of the consideration of the impact of multi channel social network, which has multiple communication channel with distinct properties of message transfer and various users with distinct channel preferences. In this paper, the new message dissemination model over multi-modal multi-channel social network, the Delay Weighted Independent Cascade Model, is proposed. The proposed model considers various channels including online social network service, email, SMS messaging, phone and mouth-to-mouth and their distinct message transfer properties. In order to consider the various user properties, the different value of probability of forwarding a message and the different preference of communication channel is considered. Moreover, the proposed model considers the distribution of user location and allows to analyze the properties of message dissemination under various scenarios. Based on the proposed model, a message dissemination simulator is generated and the message disseminations on various scenarios are analyzed.

Development of real-time embedded systems for reducing the transmission delay latency in IEC 61850 communication (IEC 61850 통신에서의 전송 지연시간 개선을 위한 실시간 임베디드 시스템 개발)

  • Cho, Chang-Doo;Kang, Seung-Hwa;Kang, Sang-Hee;Nam, Soon-Ryul
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.11
    • /
    • pp.1590-1594
    • /
    • 2012
  • Depend on delay latency rule for message transmission defined in IEC 61850 standard, the fastest message has to be transferred within 3us. This paper suggests how to structure the real time message transmit test environment of IEC 61850 and develope how to securing IEC 61850 communication performance based on IEC 61850 by measuring delay latency of message transfer on embeded linux system.

A Delivery Scheme for Hybrid Ferry-Mobile Node Messages in DTNs (DTN에서 페리와 이동노드 기반 계층적 메시지 전달 기법)

  • Kim, Byung-Soon;Lee, Bong-Kyu
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.2
    • /
    • pp.137-142
    • /
    • 2009
  • In traditional message ferrying schemes, only ferries carry messages between partitioned networks. In this paper, we propose a new approach to make both ferries and mobile nodes carry messages so that we reduce message delivery delay in disruption tolerant networks. We evaluate our scheme against conventional message ferrying in terms of message delivery delay, throughput, ferry buffer usage and mobile nodes buffer usage.

An Opportunistic Routing Scheme Based on Social Relations in Delay-Tolerant Networks (지연 감내 네트워크에서 사회관계기반 기회적 라우팅 기법)

  • Kim, Chan-Myung;Kang, In-Seok;Oh, Young-Jun;Han, Youn-Hee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.1
    • /
    • pp.15-22
    • /
    • 2014
  • Delay-Tolerant Network employs message forwarding based on a Store, Carry and Forward method to conquer no guarantee of continue connectivity. For this reason, a lot of DTN routing scheme have been proposed recently. message forwarding is an important research issue in delay-tolerant network and In this paper, we propose a efficiency DTN routing scheme using node's social relation and expanded Ego-network betweenness centrality. Our simulation results show that it is more efficient to message delivery cost than Epidemic routing, Friendship routing while it has a little performance degradation of message delivery ratio.

Mobile Computing Algorithm on IEEE 802.11b for Ubiquitous Computing

  • Kim, Wu-Woan
    • Journal of the Korean Data and Information Science Society
    • /
    • v.19 no.1
    • /
    • pp.11-24
    • /
    • 2008
  • In this paper, the patterns of movement used in the mobile communication systems are adopted in the mobile computing environment to reduce handover delay and to support seamless handover for MIPv6 based on IEEE 802.11 networks. That is, RtSolPr message and PrRtAdv message can be treated before handover. As the result, it is possible to assign NCoA to MN and Next Access Router(NAR) before handover starts. This can minimize handover delay and reduce the total handover delay.

  • PDF

CMP: A Context Information-based Routing Scheme with Energy-based Message Prioritization for Delay Tolerant Networks

  • Cabacas, Regin;Ra, In-Ho
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.295-304
    • /
    • 2014
  • Communication infrastructure supports wide variety of mobile services such as photo and file sharing, location tracking, social network services and instant messaging. However, instances like power-loss and natural disasters disrupt these communication infrastructures unable to render support to these mobile services. Delay-tolerant networks (DTNs) offer a solution to these problems at hand. By utilizing mobility and opportunistic contacts among mobile devices, a plausible communication network can be establish and enable support to mobile applications. This paper presents an energy-efficient, reliable message delivery routing scheme with message prioritization rules for DTN. It uses the context information of nodes (mobile devices) such as the contact history (location and time of contact), speed/velocity, moving direction to determine the best forwarders among nodes in the network. The remaining energy of the nodes is also used to determine the message types a node can deliver successfully. The simulation results show that proposed approach outperforms Epidemic and Prophet routing schemes in terms of delivery ratio, overhead ratio, delivered messages per types and remaining energy.

Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network

  • Ayub, Qaisar;Mohd Zahid, M. Soperi;Abdullah, Abdul Hanan;Rashid, Sulma
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.3
    • /
    • pp.649-657
    • /
    • 2013
  • DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.

Synchronized Transmission for Real-Time Remote Control in the Wireless Network (무선 네트워크에서 실시간 원격제어를 위한 동기화 전송)

  • Kang, Hongku;Kim, Namgon;Kim, Jong-Won
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.22 no.2
    • /
    • pp.64-70
    • /
    • 2021
  • Nowadays, there are significant interests in real-time remote control using wireless networks. In implementing real-time remote control, one important factor is delay performance of real-time control message. Especially, the technique to reduce jitter of delay is necessary in transmitting periodically real-time control message. In this paper, we proposed synchronized transmission to reduce jitter of delay, when real-time control message was transmitted through wireless networks. The proposed transmission kept synchronization between source node and wireless transmitter and controlled transmission instance to transmit real-tie control message with fixed delay in wireless networks. According to results of experiment in military unmanned vehicle system, the proposed transmission reduced jitter of delay as 32% as that of a non-employing case.