• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.101-104
• /
• 2010

MOST는 동기식 데이터, 비동기식 데이터, 제어 데이터를 전송할 수 있는 차량용 멀티미디어 네트워크이다. MOST 네트워크에는 높은 대역폭과 동영상이나 오디오를 버퍼링 없이 전송할 수 있는 동기식데이터 영역이 존재한다. 이러한 동기식 영역을 통해 실시간 데이터를 전송하기 위해서는 소스노드와 싱크노드와의 커넥션 및 해당 채널 할당이 요구된다. 본 논문은 이러한 동기식 영역을 사용하기 위한 모듈을 설계한 후 실제 MOST 네트워크를 구축하여 노드 간 동기식 데이터 전송을 위한 절차와 채널 할당에 대한 이해를 돕고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.421-424
• /
• 2013

차량 애드 혹 네트워크는 도심 교차로에서 도로의 특성과 차량의 높은 이동성으로 인해 네트워크의 단절이 자주 일어난다. 향상된 지리기반 라우팅 프로토콜인 GBSR(Greedy Border Superiority Routing)은 V2V(Vehicle-to-Vehicle)에 적합하다. 그러나 탐욕모드에서 stale노드가 로컬최대에 직면하는 문제를 가지고 있다. EGBSR(Enhanced GBSR)은 반대 방향의 차량과 같은 방향의 차량에게 보내는 비콘 메시지와 도로 정보를 관리하는 테이블을 이용하여 경로를 탐색하고 설정된 경로를 통해 패킷을 보낸다. 이를 통해 소스노드가 목적지노드에 빠르고 안전하게 패킷을 전달할 수 있는 양방향 라우팅 기법 제안한다.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.475-482
• /
• 2007

Mobile nodes in ad-hoc wireless networks play roles of router as well as host. Movement of nodes causes network topology changes, which make existing routing information be modified. Therefore many routing protocols for ad-hoc networks were suggested in the literature. In this paper, we suggest an enhanced automatic route shortening method for dynamic source routing(DSR) protocol. DSR is a request/response based protocol which has low routing overhead owing to node movement. The current automatic route shortening is performed on the only nodes which belong to the source route of packets. On the contrary, our suggested method allows all neighbor nodes hearing the packet to participate in automatic route shortening. It makes all possible route shortenings be performed. So we maintain maximal shortened routes of ongoing data connections. Simulation results with ns2 show that our method pays small extra protocol overhead for ARS, but increases the ratio of successful packet transmissions and the number of ARSs performed in our mechanism is from 2 to 5 times higher than in original ARS mechanism and therefore it will improve the network-wide energy consumption in wireless ad-hoc networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.479-486
• /
• 2010

In this paper, we propose a novel low-complexity Alamouti coded orthogonal frequency division multiplexing (OFDM) scheme for asynchronous cooperative communications. Exploiting the combination of OFDM symbols at the source node and simple operations including sign change and complex product at the relay node, the proposed scheme can achieve cooperative diversity gain without use of time-reversion and shifting operations that the conventional scheme proposed by Li and Xia needs. In addition, by using the cyclic prefix (CP) removal and insertion operations at the relay node, the proposed scheme does not suffer from a considerable degradation of bit-error-rate (BER) performance even though perfect timing synchronization is not achieved at the relay node. From the simulation results, it is demonstrated that the BER performance of the proposed scheme is much superior to that of the conventional scheme in the presence of timing synchronization error at the relay node. It is also shown that the proposed scheme obtains two times higher diversity gain compared with the conventional scheme at the cost of half reduction in transmission efficiency.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.217-228
• /
• 2011

In centralize CDN systems, the content server selection is performed by service node for every user request, and the selected node is notified to the user. In this paper, we present distributed CDN architecture and algorithm in which the request from a user is delivered to the content source by a P2P algorithm utilizing DHT(distributed hash table) through the overlay network and the user selects one of the source nodes based on real-time user-centric criteria. For this purpose, we propose a modified Pastry algorithm for contents registration, search and selection, in addition to the distributed architecture. The proposed architecture has the advantages of load balancing, traffic balancing, scalability, fault-tolerance due to the self-configuration, self-healing attributes of distributed architecture. Various simulation shows the feasibility of the proposed architecture and algorithm, and the performance is compared and discussed for the variations of the proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.149-155
• /
• 2006

Existing routing protocols for mobile ad hoc networks (MANETs) have assumed that all nodes voluntarily participate in forwarding others' packets. In the case when a MANET consists of nodes belonging to multiple organizations, mobile nodes may deliberately avoid packet forwarding to save their own energy, resulting in network performance degradation. In this paper, to make nodes volunteer in packet forwarding, a credit payment scheme called Protocol-Independent Fairness Algorithm (PIFA) is proposed. PIFA can be utilized irrespective of the type of basic routing protocols, while previous methods are compatible only with source routing mechanisms like DSR. According to simulation results, we can know that PIFA can prevent network performance degradation by inducing selfish nodes to participate in packet forwarding.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.9-22
• /
• 2006

When the legacy multicast routing protocols are adopted in If-based mobile core networks, there are some problems such as traffic injection from unnecessary sources, traffic overhead by group management and router performance degradation by large amount of multicast session information. In this paper, we propose a stateless multicast mechanism which has no need to maintain multicast information for session status and reduces redundant network overhead for maintaining multicast tree. In addition interworking with IGMPv3 gets rid of traffic from unnecessary sources which have no registration from receivers. The operations of essential components including a gateway node for interworking with the legacy Internet multicast network, a gateway node for transparency to radio access network and a intermediate node in mobile core networks, are definitely defined and the proposed communication architecture is completed. Finally we evaluate and approve the performance of the proposed architecture by means of well-designed network simulation.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.252-259
• /
• 2003

In the case of link congestion, most of the existing ad-hoc routing protocols like AODV and DSR do not try to discover a new route if there is no change in the network topology. Hence, with low mobility, traffic may get concentrated on some specific nodes. Since mobile devices have low battery power and low computing capability, traffic concentration on a specific node is not a desirable phenomenon. Therefore, in this paper, we propose a new protocol called SLAP (Simple Load-balancing Ad-hoc routing Protocol) which resolves the traffic concentration problem by letting each node check its own load situation and give up its role as a packet forwarder gracefully in the case of high traffic load. We compare the performance of SLAP with that of AODV and DSR in terms of the forwarding traffic distribution.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.149-156
• /
• 2011

In wireless multi-hop network, many applications need multicast communication where the group leader needs to send data to all members of the group. Multicast routing provides a balanced, efficient, and fairness network environment for the group members. However, large load for transmission management to leader node and signal interference between several paths for multi-hop links always took long transmission delay and low throughput efficiency. In this paper, we propose a Zone-based Hierarchical Multicast Routing Protocol (ZHMP). This routing protocol is designed based on zone routing schemes, where proactive routing is applied for intra-zone node level multicasting and reactive routing is used for searching inter-zone paths. By each hierarchical and independent multicast working in separated zones, load of multicast source node will be distributed by several zone-level routings for a better load balance and signal interference between each multi-hop paths will be resisted for a maximum multicast throughput.