• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.793-797
• /
• 2004

Wireless sensor networks use battery-operated computing and sensing devices. And It can be expected to be deployed in an ad hoc networs. MAC is different from traditional wireless MACs such as IEEE 802.11 in almost every way. so self-configuration and power saving in sensor network are very important goals, while per-node fairness and latency are less important. In this paper, so we use a given prototype for efficient energy conservation to reduce power consumtion that is one of the important character in sensor network and compare energy consumption and collision with IEEE 802.11 MAC. finally we conclude the paper and analyze it.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.182-185
• /
• 2004

Wireless sensor networks use battery-operated computing and sensing devices. And It can be expected to be deployed in an ad hoc networs. MAC is different from traditional wireless MACs such as IEEE 802.11 in almost every way. so self-configuration and power saving in sensor network are very important goals, while per-node fairness and latency are less important. In this paper, so we use a given prototype for efficient energy conservation to reduce power consumtion that is one of the important character in sensor network and compare energy consumption and collision with IEEE 802.11 MAC. Finally we conclude the paper and analyze it.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.73-81
• /
• 2009

TCP assumes that packet loss is always happened by congestionlike wired networks because is can not distinguish between congestion loss and transmission error loss,. This assumption results in unnecessary TCP performance degradation in wireless networks by reducing sender's congestion window size and retransmitting the lost packets. Also, repeated retransmissions loed to waste the limited battery power of mobile devices. In this paper, we propose the new congestion control scheme that add the algorithms monitoring networks states and the algorithms preventing congestion to improve TCP throughput performance and energy efficiency in wireless ad-hoc networks. Using NS2, we showd our scheme improved throughput performance and energy efficiency.

• Journal of Advanced Marine Engineering and Technology
• /
• v.36 no.2
• /
• pp.302-308
• /
• 2012

Self-configuration network model is to overcome the limits of data communications at sea. As a research for enhancing the connectivity and scalability of data networks at sea using the diversity and heterogeneity of the data networks on land, in this paper, a routing scheme (NLTCR) based on not conventional hop counts but distances to destination ships is introduced. The NLTCR seeks an optimal route by normalized distances to a destination, and transmission characteristics of applications and carriers. Performance is evaluated and compared with those of the max-win (MWR) and the normalized transmission characteristics (NTCR) based schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.235-239
• /
• 2007

이동 애드 혹 망에서 노드들의 이동성은 멀티캐스트를 어렵게 한다. 많은 멀티캐스트 프로토콜에서 데이터 전달 구조 구성과 유지를 하기 위해 주기적인 플러딩이 널리 사용된다. 이런 주기적인 플러딩 메시지는 네트워크의 제어 비용을 심각하게 증가시키고, 에너지와 대역폭 자원을 낭비하게 한다. 데이터 전달구조 유지 부담을 줄이기 위해, 많은 비상태 멀티캐스트 프로토콜이 제안되었고 이 프로토콜들은 데이터패킷을 목적지로 보내기 위해 각각의 패킷 안에 목적지 주소 리스트를 적재한다. 그러나 데이터 패킷의 길이가 한정되어 있기 때문에, 목적지 주소 리스트 적재 정책은 프로토콜의 확장성을 제한한다. 이 논문에서는 이동 애드 혹 망을 위한 확장성이 있는 이동 기반 오버레이 멀티캐스트(SLAOM)라는 프로토콜을 제안한다. 이 프로토콜은 데이터 전달 구조 구성과 유지를 위한 주기적인 플러딩이 필요하지 않으며, 각각의 데이터 패킷에 목적지 주소 리스트를 적재할 필요도 없다. 시뮬레이션 결과는 우리의 프로토콜이 데이터 전송률과 제어 비용 면에서 다른 프로토콜들보다 뛰어남을 보여준다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1102-1112
• /
• 2012

We propose a cell selection and resource allocation scheme that assigns users to nearby accessible cells in heterogeneous wireless networks consisting of macrocell, femtocells, and Wi-Fi access points, under overload situation. Given the current power level of all accessible cells nearby users, the proposed scheme finds all possible cell assignment mappings of which user should connect to which cell to maximize the number of users that the network can accommodate at the same time. We formulate the cell selection problem with heterogeneous cells into an optimization problem of binary integer programming, and compute the optimal solution. We evaluate the proposed algorithm in terms of network access failure compared to a local ad-hoc based cell selection scheme used in practical systems using network level simulations. We demonstrate that our cell selection algorithm dramatically reduces network access failure in overload situation by fully leveraging network resources evenly across heterogeneous networks. We also validate the practical feasibility in terms of computational complexity of our binary integer program by measuring the computation time with respect to the number of users.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.386-396
• /
• 2002

This paper presents a neural network-based near-optimal routing algorithm. It employs a modified Hopfield Neural Network (MHNN) as a means to solve the shortest path problem. It uses every piece of information that is available at the peripheral neurons in addition to the highly correlated information that is available at the local neuron. Consequently, every neuron converges speedily and optimally to a stable state. The convergence is faster than what is usually found in algorithms that employ conventional Hopfield neural networks. Computer simulations support the indicated claims. The results are relatively independent of network topology for almost all source-destination pairs, which nay be useful for implementing the routing algorithms appropriate to multi -hop packet radio networks with time-varying network topology.

• Journal of the Korea Society for Simulation
• /
• v.28 no.2
• /
• pp.97-105
• /
• 2019

The tactical mobile ad-hoc network(MANET) consists of distributed autonomous networks between individual ground nodes, which is effective in terms of network survivability and flexibility. However, due to constraints such as limited power, terrain, and mobility, frequent link disconnection and shadow area may occur in communication. On the other hand, the satellite network has the advantage of providing a wide-area wireless link overcoming terrain and mobility, but has limited bandwidth and high-latency characteristic. In the future battlefield, an integrated network architecture for interworking multi-layer networks through a heterogeneous network gateway (HNG) is required to overcome the limitations of the existing individual networks and increase reliability and efficiency of communication. In this paper, we propose a new HNG architecture and detailed algorithm that integrates satellite network and the tactical MANET and enables reliable data transfer based on flow characteristics of traffic. The simulations validated the proposed architecture using Riverbed Modeler, a network-level simulator.

• The KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.753-760
• /
• 2009

As it becomes increasingly important that Internet access is available anywhere at any time, providing MANET (Mobile Ad-Hoc Network) with the Internet access attracts more attention. The existing DHCP (Dynamic Host Configuration Protocol) address configuration schemes require message exchanges between MANET nodes and the DHCP server through multi-hop routes. Messages can be easily dropped in the wireless multi-hop communication environment and the address configuration may be instable and need long delay. In this paper, we propose a new address configuration scheme using the concept of address pool allocation. In the proposed scheme, the DHCP server assigns a part of its address pool to a node instead of a single address and the node can assign a part of its own address pool to its neighbor nodes. Through simulation studies, we show that our scheme yields about 77% of the address configuration delay and 61% of the control message overhead of the existing DHCP based mechanism.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1873-1882
• /
• 2009

In the ad-hoc mode of IEEE 802.11 standard, beacon is used for power control and network alarming between each node, and also it is for the synchronization in controlling network as PCF. However beacon is also used to inform the neighbor nodes of itself except for original purpose in the environment of IEEE 802.11s. For this, the existing beacon's transmission mechanism can't perform a function in full. In this paper, we suggest much faster neighbor discovery reducing network congestion caused by beacon through modification of beacon transmission mechanism. And we will show that suggesting algorithm more faster full neighbor discovery than traditional neighbor discovery using for IEEE 802.11 through simulation and test in real ad-hoc network.