• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.349-352
• /
• 2001

In this paper, the design of WDM network using the traffic estimation modeling is implemented. Because of the lack of data of real traffic volumes, the information of statistic data is used. Using the modeling results, the WDM channels are assinged for each node, and the network is simulated using OPNET simulation tools. Here, we investigate the shortest routing scheme using OPNET simulation tools. As a result the realistic WDM network design for Korea topology is proposed.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제14권8호
• /
• pp.798-802
• /
• 2008

본 논문에서는 컨텐츠 공유 응용에 관한 이동애드 혹 네트워크에서의 라우팅 프로토콜에 대하여 제안한다. 응용에 참여하는 사용자들간의 사회적 관계를 라우팅 프로토콜에 적용하여 컨텐츠 공유를 돕도록 한다. 우리의 기법은 사회적 관계를 이용하여 사용자들의 컨텐츠 소비패턴을 예측할 수 있는 상황에서 컨텐츠를 보다 빠르게 얻어오고 같은 컨텐츠에 대한 여러 요청으로 인해 생기는 네트워크의 부담이 줄게 하여 컨텐츠 공유와 같은 응용을 지원 할 수 있다. 제안된 라우팅 프로토콜의 성능 평가를 위하여 네트워크 시뮬레이터 NS2를 사용하여 최단 경로 라우팅 알고리즘과 비교해 보았다.

• 대한전자공학회논문지TC
• /
• 제49권8호
• /
• pp.19-24
• /
• 2012

본 논문에서는 롱 홀 (long-haul) 다중 홉 무선 네트워크에서 단일 데이터 스트림에 대한 opportunistic 라우팅 기법의 성능분석을 수행한다. 성능분석에서는 네트워크 노드간의 링크 레벨 간섭을 고려한다. 일반적으로 opportunistic 라우팅 기법은 무선 다중 홉 네트워크의 성능을 크게 향상시킬 것으로 기대되어 왔고 이에 대한 성능향상 및 전송 기법에 대한 많은 연구가 수행되어 왔으나, 본 논문의 연구 결과는 롱 홀의 경우에는 opportunistic 라우팅의 성능향상 정도가 그리 크지 않다는 것을 보여준다. 이와 같은 연구 결과는 opportunistic 라우팅 기법은 구현의 복잡성을 고려할 경우에 롱 홀 환경에서는 적용하는 것이 적당치 않으며, 환경에 따라 short-haul 환경에 집중하여 적용해야 함을 의미한다.

• 한국멀티미디어학회논문지
• /
• 제20권4호
• /
• pp.640-648
• /
• 2017

Sensors have limited resources in sensor networks, so efficient use of energy is important. In order to use the energy of the sensor node efficiently, researches applying mobile sink to the sensor network have been actively carried out. The sink node moves the sensor network, collects data from each sensor node, which spread the energy concentrated around the sink node, thereby extending the entire life cycle of the network. But, when the sink node moves, it requires a reset of the data transmission path, which causes a lot of control messages and delays. In this paper, we propose a CMS(Cluster-based Mobile Sink) method to support the movement of mobile sink in a cluster sensor environment. The proposed scheme minimizes an amount of control messages without resetting the routing paths of entire sensor networks by supporting the sink mobility path using the neighbor cluster list. And, it simplifies the routing path setup process by setting a single hop path between clusters without a gateway. The experiment results show that the proposed scheme has superior energy efficiency in processing and network structure, compared with existing clustering and mesh routing protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

• 한국시뮬레이션학회논문지
• /
• 제17권1호
• /
• pp.1-8
• /
• 2008

센서 네트워크에서 싱크가 이동성을 가지게 되면, 네트워크의 라우팅에 변화가 그렇지 않은 경우 보다 심화된다. 이동싱크의 경우 센서 네트워크 지역을 지속적으로 이동하기 때문에 소스 센서 노드와의 통신상에서도 경로 변경이 발생하게 된다. 싱크의 이동으로 인한 경로변경은 많은 오버헤드를 부과할 수 있기 때문에 동적인 경로 변경에 대처하는 방안이 요구된다. 본 논문에서는 이러한 동적인 경로 변경을 위하여 사전 경로변경 방식을 제안한다. 동적 경로변경의 계산은 이동 싱크가 수행하여 네트워크의 오버헤드를 줄이며, 물리적 경로변경 이전에 경로를 배정함으로써 경로변경에 따른 지연을 최소화하고자 한다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권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.

• 한국콘텐츠학회논문지
• /
• 제7권9호
• /
• pp.100-107
• /
• 2007

본 논문은 무선 센서 네트워크에 적용할 수 있을 정도로 단순한 효율적인 MP-DD(MultiPath-Direct Diffusion) 라우팅 방법을 제안한다. 기존의 DD(Direct Diffusion)는 하나의 최적 경로를 설정하여 사용하므로 특정 노드의 에너지가 많이 소모된다. 이에 반해 MP-DD는 네트워크 관리 노드 방향의 상위노드에 대한 정보를 가지고 다중 경로를 설정하여 사용한다. 시뮬레이션 결과 제안한 기법이 DD와 EAR(Energy Aware Routing)에 비해 망 생존성을 증가시킬 수 있음을 보여주었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권1호
• /
• pp.270-286
• /
• 2012

In this paper, we propose a novel routing protocol called the Cartography Enhanced OLSR (CE-OLSR) for multi hop mobile ad hoc networks (multi hop MANETs). CE-OLSR is based on an efficient cartography gathering scheme and a stability routing approach. The cartography gathering scheme is non intrusive and uses the exact OLSR reduced signaling traffic, but in a more elegant and efficient way to improve responsiveness to the network dynamics. This cartography is a much richer and accurate view than the mere network topology gathered and used by OLSR. The stability routing approach uses a reduced view of the collected cartography that only includes links not exceeding a certain distance threshold and do not cross obstacles. In urban environments, IEEE 802.11 radio signals undergo severe radio shadowing and fading effects and may be completely obstructed by obstacles such as buildings. Extensive simulations are conducted to study the performances of CE-OLSR and compare them with those of OLSR. We show that CE-OLSR greatly outperforms OLSR in delivering a high percentage of route validity, a much higher throughput and a much lower average delay. In particular the extremely low average delay exacerbated by CE-OLSR makes it a viable candidate for the transport of real time data traffic in multi hop MANETs.

• Journal of Communications and Networks
• /
• 제14권5호
• /
• pp.546-553
• /
• 2012

Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative to overcome the fundamental scaling problems of the Internet routing system. Plenty of studies have been conducted on compact routing, and quite a few universal compact routing schemes have been designed for arbitrary network topologies. However, it is generally believed that specialized compact routing schemes for peculiar network topologies can have better performance than universal ones. Studies on complex networks have uncovered that most real-world networks exhibit power-law degree distributions, i.e., a few nodes have very high degrees while many other nodes have low degrees. High-degree nodes play the crucial role of hubs in communication and inter-networking. Based on this fact, we propose two highest-degree landmark based compact routing schemes, namely HDLR and $HDLR^+$. Theoretical analysis on random power-law graphs shows that the two schemes can achieve better space-stretch trade-offs than previous compact routing schemes. Simulations conducted on random power-law graphs and real-world AS-level Internet graph validate the effectiveness of our schemes.