• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.386-388
• /
• 1998

Multiprotocol Label Switching(MPLS)는 기존 인터넷 라우팅에서 사용하는 longest prefix match 방식 대신에 short label exact match 방식을 사용함으로써 더 단순한 고속 포워딩 기술을 제공한다. 또한, 동일한 Forwarding Equivalence Class(FEC)에속하는 플로우들을 합성하여 하나의 레이블을 사용하는 방법 즉, Multipoint-to-point Tree(MPT)를 형성함으로써 확장설을 향상시켰다. 본 논문에선 현재 이슈가 괴고 있는 "IP address prefix"와 "host LSP"의 FEC타입과는 전송방식이 다른 브로드캐스팅을 위한"broadcast"FEC 타입을 제안하였으며, 브로드캐스트 패킷을 전송하는데 있어서 각각의Label Switched Path(LSP)제어 방식을 사용할 경우의 문제점을 분석하고, 유니캐스팅과 브로드캐스팅의 서로 다른 레이블 할당방식으로 인한 레이블 충돌을 해결하기 위해서 레이블 범위를 분류하여 사용하는 방식을 제안한다.해서 레이블 범위를 분류하여 사용하는 방식을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.22-24
• /
• 2005

이동 컴퓨팅 환경에서 통신 네트워크가 갖는 무선 채널 대역폭의 협소함과 이동 단말기의 에너지 제약으로 인해, 다수의 이동 클라이언트들에게 데이터를 전달할 때에는 다수의 클라이언트들의 동시 데이터 접근을 지원하는 브로드캐스트 방법을 사용함으로써 제약점들을 보완할 수 있다. 본 논문에서는 클라이언트의 에너지와 데이터에 대한 접근시간(access time)의 효율을 높이기 위해 데이터의 접근빈도(access frequency)를 고려한 브로드캐스트 방법과 브로드캐스트 인덱스를 추가하는 방법을 함께 반영한 OAF(Data Access Frequencies)브로드캐스팅 기법을 제안한다. DAF브로드캐스팅 기법은 데이터의 접근빈도를 고려한 인덱스를 교차하여 추가함으로써 접근빈도가 높은 데이터를 원하는 다수의 사용자에 대한 접근시간을 줄임으로써 모든 사용자의 평균 접근시간을 줄이는데 목적이 있다. 수학적 분석을 통해 DAF브로드캐스팅 기법을 평가하고 기존의 브로드캐스트 방법과 DAF브로드캐스팅 기법의 성능을 비교 분석한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.37-39
• /
• 2005

브로드캐스트는 하나 또는 여러 개의 채널을 이용해서 다수의 모바일 클라이언트들이 빈번하게 필요로 하는 데이터를 효과적으로 전송하기 위한 방법 중의 하나이다. 무선 브로드 캐스트 환경에서는 모바일 클라이언트의 제한된 자원과 모바일 클라이언트에서 서버로의 제한된 상향 대역폭 등의 이유로 기존의 동시성 제어 기법을 그대로 사용할 수 없다. 이러한 이유로 무선 브로드캐스팅 환경을 위한 동시성 제어 기법들이 많이 연구 되어 왔다. 하지만 지금까지 제안된 동시성 제어기법들은 단일 채널 환경 하에 하나의 브로드캐스트 주기 동안 브로드캐스팅 되는 데이터 간에는 일관성을 가진다는 가정 하에 동시성 제어 기법들이 진행되어 왔다. 그러나 다중 채널 환경에서는 여러 가지 이유로 단일채널의 동시성 제어 기법을 적용할 수 없다. 본 논문에서는 다중채널 브로드캐스팅 환경에서 읽기 전용 트랜잭션을 처리하기 위한 동시성 제어 기법을 제안하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.641-644
• /
• 2016

Unlike wired networks, broadcasting in wireless networks can transmit data at once to several nodes with a single transmission. For omnidirectional broadcast to a node in wireless networks, all adjacent nodes receive the data at the same time. In this paper, we propose a greedy algorithm to solve the minimum power broadcasting problem of minimizing the total transmit power on broadcasting in wireless networks. We apply two matrices to the proposed algorithm: one is a distance matrix that represents the distance between each node, the other is an adjacency matrix having the number of adjacency nodes. Among the nodes that receive the data, a node that has the greatest number of the adjacent node transmits data to neighbor preferential. We compare the performance of the proposed algorithm with random method through computer simulation in terms of transmitting power of nodes. Experiment results show that the proposed algorithm outperforms better than the random method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.116-122
• /
• 2009

Mobile Wireless Sensor Network is an organized collection of sensor nodes and mobile sink nodes, in which the sensor node transmits the signal to the sink node. In real environment, there are many cases in which sinks have mobility caused by the people, the vehicle and etc. Since all nodes in the sensor networks have limited energy, many researches have been done in order to prolong the lifetime of the entire network. In this paper we propose Dynamic Local Update-based Routing Protocol(D-LURP) that prolong the lifetime of the entire network to efficiently maintain frequent location update of mobile sink static sensor nodes in Mobile WSNs. When the sink node moves out of the local broadcasting area the proposed D-LURP configures dynamically the local update area consisted of the new local broadcasting area and the previous dissemination node(DN) and find the path between the DN and the sink node, instead of processing a new discovering path like LURP. In this way the processing of broadcasting sink node's location information in the entire network will be omitted. and thus less energy will be consumpted. We compare the performances of the proposed scheme and existing Protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4B
• /
• pp.165-173
• /
• 2008

In this paper, we propose a new reliable broadcast protocol referred to as timer-based reliable broadcast (TRB) for wireless sensor networks (WSNs). The proposed TRB scheme exploits (1) bitmap based explicit ACK to effectively reduce the unnecessary error control messages and (2) randomized timer for ACK transmission to substantially reduce the possibility of contentions. Although it has been argued that 100% reliability is not necessary in WSNs, there should be messages (such as mission-critical message, task assignment, software updates, etc.) that need to be reliably delivered to the entire sensor field. We propose to use the TRB algorithm for such cases. Performance evaluation shows that the TRB scheme achieves 100 % reliability significantly better than other schemes with expense of slightly increased energy consumption.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.65-74
• /
• 2002

Recently star networks are considered as attractive alternatives to the widely used hypercube for interconnection networks in parallel processing systems by many researchers. One of the fundamental communication problems on star graph networks is broadcasing In this paper we consider the broadcasting problems in star graph networks using wormhole routing. In wormhole routed system minimizing link contention is more critical for the system performance than the distance between two communicating nodes. We use Hamiltonian paths in star graph to set up link-disjoint communication paths We present a broadcast algorithm in n-dimensional star graph of N(=n!) nodes such that the total completion time is no larger than $([long_n n!]+1)$ steps where $([long_n n!]+1)$ is the lower bound This result is significant improvement over the previous n-1 step broadcasting algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.709-719
• /
• 1996

DHCP(Dynamic Host Configuration Protocol)is a protocol which dynamically allocates an IP address and/or host configuration parameters to a host. But because this protocol uses broadcasting for message exchange, it causes heavy traffic and overload on the network. By avoiding unnecessary broadcasting and using a simple and efficient implementation model, we can reduce such heavy traffic and overload. We have studied on characteristics of the broadcasting the traffic caused by DHCP, and implement the model which can reduce traffic by improving algorithm and unicasting messages.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.71-79
• /
• 2007

The communicative behaviors in Wireless Sensor Networks(WSNs) can be characterized by two different types: routing and broadcasting. The broadcasting is used for effective route discoveries and packet delivery. However, broadcasting shorten the network lifetime due to the energy overconsumption by redundant transmissions. In this paper, we proposed a algorithm that remove redundant forward nodes based on Dominant Pruning method using 2-hop neighbors knowledge. Simulation results show that the proposed algorithm appears superior performance in respect of the number of forward nodes and the network lifetime.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.12
• /
• pp.35-43
• /
• 2013

This paper suggests a way to implement a system that broadcasts compressed JPEG images obtained from a webcam to multiple users on their smartphones. The system was implemented to maintain a suitable image quality so that things are identifiable while using the minimal amount of data, in order to deliver as many frames as possible to as many users as possible. Also, the suggested way was applied and various tests were done, including on: the performance of the server that provides image information; the performance of the client that receives the image information and displays it on the smartphone; and the max. number of simultaneous users supported by the system. When a broadcasting system is implemented using webcams and smartphones, the results of this paper can be used in estimating the suitable system parameters depending on network performance, including the max. number of simultaneous clients supported, the client smartphone performance required, and the number of frames that can be transmitted per second.