• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.73-75
• /
• 2007

The Ad Hoc Network Interfaces has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these Clustering characteristics and the definition of standadization processes.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.631-631
• /
• 2006

• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.365-370
• /
• 2007

Connected Dominating Set(CDS) has been used as a virtual backbone in wireless ad hoc networks by numerous routing and broadcast protocols. Although computing minimum CDS is known to be NP-hard, many protocols have been proposed to construct a sub-optimal CDS. However, these protocols are either too complicated, needing non- local information, not adaptive to topology changes, or fail to consider the difference of energy consumption for nodes in and outside of the CDS. In this paper, we present two Timer-based Energy-aware Connected Dominating Set Protocols(TECDS). The energy level at each node is taken into consideration when constructing the CDS. Our protocols are able to maintain and adjust the CDS when network topology is changed. The simulation results have shown that our protocols effectively construct energy-aware CDS with very competitive size and prolong the network operation under different level of nodal mobility.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.943-953
• /
• 2013

By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.4
• /
• pp.52-59
• /
• 2010

MAC frame aggregation is a method that combines multiple MPDUs (MAC protocol data units) into one PPDU (PHY protocol data units) to enhance network performance at the MAC layer. In ad hoc networks, TCP underperforms due to the congestion window overshooting problem and thus by setting CWL (congestion window limit) TCP performance can be improved. In this paper, we investigate the problem of setting CWL for TCP performance optimization in ad hoc networks with MAC frame aggregation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2447-2458
• /
• 2009

Ad hoc wireless networks operate without any infrastructure where a node can be a source and a router at the same time. This indispensably requires high throughput and low delay performance throughout the wireless network coverage span, particularly under heavy traffic conditions. Recent research on using multiple antennas in beam-forming or multiplexing modes over a wireless channel has shown promising results in terms of high throughput and low delay. Directional antennas have shown to increase spatial reuse by allowing multiple transmitters and receivers to communicate using. directional beams as long as they do not significantly interfere with each other. However directional antenna performance asymptotically approaches the omni-directional performance in a high density ad hoc network. Simulation results in QualNet validate that average throughput and packet corruption ratio of directional antenna approach omni-directional performance. Moreover, we further highlight some important issues pertaining to the directional antenna performance in wireless networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1161-1167
• /
• 2003

The nodes of Ad hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad hoc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.274-286
• /
• 2005

In this paper, we propose a new power-efficient and reliable connected dominating set based routing protocol in the mobile ad hoc networks. Gateway nodes must be elected in consideration of residual energy and mobility because frequent reconstruction of connected dominating set result in transmission error for route losses. If node density is high, it results in a lot of contentions and more delays for network congestion. Therefore, in this paper, we propose a new construction method of connected dominating set that supports reliable and efficient data transmission through minimizing reconstruction of connected dominating set by delaying neighbor set advertisement message broadcast in proportion to weighted sum of residual energy, mobility, and the number of neighbor nodes. The performance of the proposed protocol is proved by simulation of various conditions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2008-2015
• /
• 2010

Ns-2 is a proven simulator which is widely utilized to evaluate the performance of wired and wireless network. Ns-2.33 version introduced the extended version including the modules which the core functions of existing 802.11 PHY and MAC layer are implemented. However, if the error rate, one of most important parameters to evaluate a performance of wireless network, is applied to the extended version, the simulation is ceased with several fatal errors. Furthermore, a packet error is detected and discarded on MAC layer in the traditional protocol architecture, but there is the problem which can't identify information about a packet with error by processing packet error on PHY layer in this version. In this paper, we modify the extended version to resolve the above mentioned problems. And also we perform ns-2 simulation using the modified version on the IEEE 802.11p based vehicular ad-hoc networks, and then analyze effects of error rate.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1493-1496
• /
• 2005

연결형 dominating set기반의 라우팅 알고리즘에서 잦은 dominating set의 재구성은 루트 손실로 인한 전송 에러를 발생시키기 때문에, 노드의 잔여 전력량과 이동성을 고려하여 게이트웨이 노드를 선택하여야 한다. 또한 같은 지역에 노드가 집중되어 있다면 매체를 공유하는 무선 네트워크의 특성상 병목으로 인한 충돌 및 지연 등이 야기 될 가능성이 크다. 따라서 본 논문에서는 노드의 잔여 전력량 및 이동성, 이웃 노드수의 가중 가산 값에 비례하여 이웃 구성 통보 메시지 (neighbor set advertisement message)의 브로드캐스팅을 지연시키는 방법을 통해 연결형 dominating set의 재구성을 최소화 하여 신뢰성 있고 효율적인 데이터 전송을 보장하는 새로운 연결형 dominating set 구성 방법을 제안하고 다양한 상황에서의 실험을 통해 그 성능을 비교 평가하였다.