• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권2호
• /
• pp.234-252
• /
• 2013

Due to the uncertain of connections in Delay Tolerant Networks (DTNs), most routing algorithms in DTNs need nodes to forward the message to others based on the opportunistic contact. The contact is related with the beaconing rate. In particular, nodes have more chances to encounter with each other with bigger beaconing rate, but more energy will be used. On the other hand, if the nodes forward the message to every node all the time, the efficiency of the routing algorithm is better, but it needs more energy, too. This paper tries to exploit the optimal beaconing rate and forwarding rate when the total energy is constraint. First, a theoretical framework is proposed, which can be used to evaluate the performance with different forwarding rate and beaconing rate. Then, this paper formulates a joint optimization problem based on the framework. Through Pontryagin's Maximal Principle, this paper obtains the optimal policy and proves that both the optimal forwarding and beaconing rates conform to threshold form. Simulation results show the accuracy of the theoretical framework. Extensive numerical results show that the optimal policy obtained in this paper is the best.

• 한국통신학회논문지
• /
• 제12권2호
• /
• pp.160-167
• /
• 1987

데이터와 音聲 共用의 近距離 通信網에서 메시지의 種類와 局의 位置에 따라 優先權을 , 局의 數에 관계없이 단지 2비트만으로 傳送豫的 可能한 CS/MLBP(carrier sense/message and location based proiority)豫的制御方式을 提案하였다. 提案된 方式에서는 局數에 관계없이 예약비트가 단지 2비트이므로 예약시간이 짧아 網의 delay-throughtput特性이 좋아지고, 高負荷에서 音聲패킷의 棄却率도 적을 뿐만 아니라 局數의 增加가 delay-throughput特性에 影響을 주지 않는 長點이 있다. 시뮬레이션을 토하여 本 方式의 傳送性能을 評價하고 DSMA(distributed schedulign multiple access)를 利用한 方式$^(6)$과 비교하였다.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제5권7호
• /
• pp.153-158
• /
• 2016

Delay Tolerant Network(DTN)은 종단간 연결성이 보장되지 않는 환경에서 store-carry-forward 방식의 메시지 전달을 기본으로 하는 네트워크이다. DTN 환경에서 메시지 전달을 위한 라우팅 방안뿐만 아니라 버퍼 관리 정책 또한 전달률을 높이기 위한 중요한 요소이다. 본 논문에서는 기존 spray and wait 라우팅 방안의 메시지 전달률을 높이기 위한 확률 기반의 spray and wait 방안을 제안한다. 또한 버퍼오버플로우 발생 시, L 값에 따라 메시지를 폐기하는 버퍼 관리방안도 제안하였다. 기존의 DTN 라우팅 방안인 Epidemic, PRoPHET, spray and wait 프로토콜과 성능을 비교하였으며 전달률 및 오버헤드의 성능이 개선되는 것을 시뮬레이션을 통해 확인하였다.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.623-629
• /
• 2010

A geographical routing protocol is typically utilized for a route selection of VANET. Even if it is conceptually well adapted into VANET, message delivery tends to be unreliable with frequent network partitions, which mainly come from the inherent characteristics such as high mobility and irregular traffic density. In this paper, we deal with a method to enable reliable message delivery with reflecting the traffic density on routing decision. By concatenating the message delivery cost of each of inbetween junction section, $1^{st}$ and $2^{nd}$ shortest paths are initially determined. When it is not possible to deliver the message on a junction on the 1st path, we utilize two novel ideas, that is, letting the message stay on the junction to find out a new relay node, and putting a replicated copy to reach via a detour path. By using the NS-2 network simulator, our method has been examined in terms of message delivery rate and delay. It shows that our method is much efficient than the other method in the low density environment, while it brings similar results in the high density environment.

• Journal of Information Processing Systems
• /
• 제11권3호
• /
• pp.465-482
• /
• 2015

IEEE 802.11p is a standard MAC protocol for wireless access in vehicular environments (WAVEs). If a packet collision happens when a safety message is sent out, IEEE 802.11p chooses a random back-off counter value in a fixed-size contention window. However, depending on the random choice of back-off counter value, it is still possible that less important messages are sent out first while more important messages are delayed longer until sent out. In this paper, we present a new scheme for safety message scheduling, called the enhanced message priority mechanism (EMPM). It consists of the following two components: the benefit-value algorithm, which calculates the priority of the messages depending on the speed, deceleration, and message lifetime; and the back-off counter selection algorithm, which chooses the non-uniform back-off counter value in order to reduce the collision probability and to enhance the throughput of the highly beneficial messages. Numerical results show that the EMPM can significantly improve the throughput and delay of messages with high benefits when compared with existing MAC protocols. Consequently, the EMPM can provide better QoS support for the more important and urgent messages.

• 한국멀티미디어학회논문지
• /
• 제17권10호
• /
• pp.1220-1228
• /
• 2014

Emergency Warning Service will be the most important service of VANET. Transmission delay is the most important performance criteria of the warning service. Most legacy research takes a way to minimize the packet collision. However those approach has a critical weak point on urban environment where there is a blind area of electric wave. So another issue is required in order to provide enhanced warning message propagation technique to overcome the urban environment problem. In this paper, I proposed an enhanced warning message propagation scheme in the poor electric wave environment as the intersection area. Proposed scheme forwards the warning message to the blind area by enhanced forwarding node selection technique. For efficiency of warning message propagation, I suggest forwarding priority for decision of forwarding node. And the node has a direct mode or redirect mode depending on neighbor nodes. The simulation was carried out to evaluate the performance. The simulation results show that proposed scheme has the superior performance compared to legacy warning message technique.

• 한국정보통신학회논문지
• /
• 제22권12호
• /
• pp.1604-1610
• /
• 2018

음성인식 서비스는 청각장애인에게 화자의 음성을 텍스트로 변환하여 시각화함으로써 의사소통의 보조적인 수단으로 사용되고 있다. 하지만 강의실 및 회의실과 같은 개방된 환경에서는 다수의 청각장애인에게 음성인식 서비스를 제공하기 힘들다. 이를 위해 주변 환경에 따라 음성 인식 서비스를 효율적으로 제공하기 위한 방법이 필요하다. 본 논문에서는 화자의 음성을 인식하여 변환된 텍스트를 다수의 청각장애인에게 메시지로 전달하는 시스템을 제안한다. 제안하는 시스템은 다수의 사용자에게 동시에 메시지를 전달하기 위해 MQTT 프로토콜을 사용한다. MQTT 프로토콜의 QoS level 설정에 따른 제안 시스템의 서비스 지연을 확인하기 위해 종단 간 지연을 측정하였다. 측정 결과 가장 신뢰성이 높은 QoS level 2와 0간의 지연이 111ms로 대화 인식에 큰 영향을 끼치지 않음을 확인하였다.

• 산업기술연구
• /
• 제25권B호
• /
• pp.221-229
• /
• 2005

We present a numerical analysis of the optimal group number for minimizing the average paging delay. In the analysis, we consider uniform distributions for location probability conditions and apply M/D/1 queueing model to paging message queues of cells. We also get the lower bounds of group numbers and investigate the minimum transmission capacity under average paging delay constraints. Minimizing the average paging delay is important because it means minimizing the amount of bandwidth used for locating mobile terminals. Therefore, the numerical results of this paper will be very useful in PCS system when designing its signalling capacity due to its simplicity and effectiveness.

• 제어로봇시스템학회논문지
• /
• 제12권7호
• /
• pp.719-727
• /
• 2006

This paper proposes a new method to obtain a maximum allowable delay bound for a scheduling of networked discrete control systems and event-based scheduling method. The proposed method is formulated in terms of linear matrix inequalities and can give a much less conservative delay bound than the existing methods. A network scheduling method is presented based on the delay obtained through the proposed method, and it can adjust the sampling period to allocate same utilization to each control loop. The presented method can handle three types of data (sporadic, emergency data, periodic data and non real-time message) and guarantees real-time transmission of periodic and sporadic emergency data using modified EDF scheduling method.

• 디지털산업정보학회논문지
• /
• 제8권1호
• /
• pp.47-53
• /
• 2012

Sensor networks and car networks that have different structure from that of conventional TCP/IP network require extreme network environment due to frequent change of connectivity. Because such extreme network environment has characteristics like unreliable link connectivity, long delay time, asymmetrical data transfer rate, and high error rate, etc., it is difficult to perform normally with the conventional TCP/P-based routing. DTNs (delay and disruption tolerant network) was designed to support data transfer in extreme network environment with long delay time and no guarantee for continuous connectivity between terminals. This study suggests an algorithm that limits the maximum number of copying transferred message to L by improving the spray and wait routing protocol, which is one of the conventional DTNs routing protocols, and using the azimuth and density data of the mobile nods. The suggested algorithm was examined by using ONE, a DTNs simulator. As a result, it could reduce the delay time and overhead of unnecessary packets compared to the conventional spray and wait routing protocol.