• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.101-110
• /
• 2011

WMN is highlighted as a next generation network technology due to relatively reasonable cost to be built, compared with the pre-existing wireless network. It also enables same kind of network or even other kind of network to be integrated. Some WMN researches support mobility using router protocol such as AODV and DSR because WMN has the similar features with Ad-hoc network in terms of operation. However, WMN has got different operations with additional functions of multi-interface and internet connect, it can't be a good method to manage efficient mobility any more. This study suggests method to apply MAP function of HMIPv6 to WMN as a way to manage WMN mobility. Through simulation, operation was verified and function was appreciated. Through the results of evaluation, the suggest mobility management had shorter handover delay and packet loss reduced, which improved whole network throughput rate, compared with mobility management using AODV.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.307-311
• /
• 2010

Most wireless ad hoc networks use sender-centric carrier sensing where a data sender determines the transmission timing through channel assessment. However, sender-centric carrier sensing suffers from both exposed and hidden terminal problems even with physical and virtual carrier sensing. In this paper, we propose a new receiver-centric carrier sense (RCS) technique where a data receiver triggers packet transmission based on local channel assessment. Through both numerical analysis and simulation studies, we show that the proposed RCS achieves up to 20.9% higher throughput than previous receiver-centric approaches.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1308-1313
• /
• 2008

Neighbor knowledge in wireless ad hoc networks provides important functionality for a number of protocols. The neighbor knowledge is acquired via Hello packets. Hello packets are periodically broadcasted by the nodes which want to advertise their existence. Usage of periodic Hello packet, however, is a big burden on the wireless ad hoc networks. This paper deals with an approach where each node acquires neighbor knowledge by observing not only Hello packets but also broadcasting packets. Analysis and computer simulation results show that the method using broadcast packets offers significant improvement over the method using Hello packet only. When the required hello packet transmission interval and the average broadcasting interval are equal, the overhead reduction is about 42%.

• Annual Conference of KIPS
• /
• 2009.11a
• /
• pp.467-468
• /
• 2009

무선 애드혹 네트워크는 고정된 유선 네트워크에서 생각할 수 없었던 잦은 네트워크 구성의 변화, 대역폭과 에너지 사용의 제한 등 기존의 유선 네트워크와는 다른 특성들을 갖는다. 따라서 유선 네트워크에서 제공받았던 고품질의 서비스를 무선 애드혹 네트워크에서 제공받기 위해서는 제한된 자원을 효과적으로 이용할 수 있는 연구가 필요하다. 본 논문에서는 GPS 등의 기술을 이용하여 네트워크를 구성하는 이동 노드들의 위치 정보를 파악하고, 이를 라우팅에 활용하는 기존의 위치기반 라우팅 기법 중 하나인 LAR 알고리즘을 개량하였다. 제안 알고리즘은 노드들의 위치뿐만 아니라 에너지까지 함께 고려하며, 이를 위해 불필요한 제어 메시지의 확산을 최소화하고, 노드간 거리에 적절한 전송 전력을 사용하여 통신을 하게 함으로써 효율적인 라우팅이 이루어지도록 하였다. 실험 결과 기존 LAR 알고리즘에 비해 제안 기법이 노드의 생존률이 평균 12.1% 향상되었다.

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

Networking environments are exposed to outside attacks and privacy threats. Due to broadcast nature of radio transmissions, wireless devices experience more vulnerable situations than those of wired network devices. This paper assumes that a wireless device has two network interfaces, one for accessing internet using 3G services, and the other for constructing an ad hoc network. To deal with privacy threats, this paper introduces an approach in which wireless devices form a special ad hoc network in order to exchange data using anonymous communications. One or more intermediate peers should be involved in the construction of an anonymous path. The proposed anonymous communication mechanism discourages traffic analysis and improves user privacy. According to simulation results, the anonymous connection in an ad hoc network prefers the intermediate peer(s) which is located near the source and/or the destination peer, rather than randomly-selected peers.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.141-144
• /
• 2003

The mobile radio networks can be divided into networks that has the base station or the infrastructures like AP(Access Point) and Ad Hoc network that hasn't any infrastructures. As there aren't any fixed infrastructures in Ad Hoc Networks, mobile nodes should transmit the data only among mobile nodes themselves. To supplement these weakpoints of the two networks, many studies about Ad Hocs based on the 802.11 are in progress. In this thesis, we try to propose the efficiency of the suggested protocols by comparing and analyzing power saving protocols according to the Beacon intervals in multi hop Ad Hoc Networks based on IEEE 802.11.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1415-1420
• /
• 2003

The mobile radio networks can be divided into networks that has the base station or the infrastructures like AP(Access Point) and Ad Hoc network that hasn't any infrastructures. As there aren't any fixed infrastructures in Ad Hoc Networks, mobile nodes should transmit the data oかy among mobile nodes themselves. To supplement these weakpoints of the two networks, many studies about Ad Hon based on the 802.11 are in progress. In this thesis, we try to propose the efficiency of the suggested protocols by comparing and analyzing power saving protocols according to the Beacon intervals in multi hop Ad Hoc Networks based on IEEE 802.11.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.1276-1279
• /
• 2008

최근 모바일 장치의 증가와 무선 네트워크 환경의 발전은 모바일 애드혹 네트워크에 대한 관심을 증가시키고 있다. 최근까지의 연구는 모바일 애드혹 네트워크에서 데이터 접근성(Accessibility) 향상을 위해 복제의 활용이 효율적임을 증명하고 있다. 복제 기법이 모바일 애드혹 네트워크에서 실제로 활용되기 위해서는 원본과 복제본 사이에 일관성(Consistency)이 확보되어야만 한다. 기존의 연구에서는 일관성 확보를 위해 원본을 가진 노드에게 확인하는 기법을 활용하고 있다. 그러나, 시간제약을 가지는 응용의 경우 원본을 가진 노드에게 확인하는 기법은 효율적이지 못하며, 때로는 심각한 문제를 일으킬 수도 있다. 본 논문에서는 시간제약응용을 위한 캐쉬 무효화 기법을 제안하고 있다. 제안하는 기법을 통해 기존의 일관성 확인 기법에서 일어나는 '롤백(Rollback)' 문제를 해결할 수 있었으며, 접근시간(Access time) 측면에서 성능향상을 얻을 수 있었다. 실험 결과는 본 논문의 접근시간 측면에서의 효율적임을 증명하여 준다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2800-2807
• /
• 2012

An ad-hoc wireless network provides self-organizing data networking while they are routing of packets among themselves. Typically multi-hop and control packets overhead affects the change of route of transmission. There are numerous routing protocols have been developed for ad hoc wireless networks as the size of the network scale. Hence the scalable routing protocol would be needed for energy efficient various network routing environment conditions. The number of depth or layer of hierarchical clustering nodes are analyzed the different clustering structure with topology in this paper. To estimate the energy efficient number of cluster layer and energy dissipation are studied based on distributed homogeneous spatial Poisson process with context-awareness nodes condition. The simulation results show that CACHE-R could be conserved the energy of node under the setting the optimal layer given parameters.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.173-179
• /
• 2008

An ad hoc network is multi-hop wireledss formed by mobile node without infrastructure. Due to the mobility of nodes in mobile ad hoc networks, the topology of network changes frequently. In this environments, multicast protocols are faced with the challenge of producing multi-hop routes and limitation of bandwidth. We compare the performance of two multicast routing protocols for mobile ad hoc networks - Serial Multiple Disjoint Tree Multicast Routing Protocol (Serial MDTMR) and Adaptive Core Multicast Routing Protocol (ACMRP). The simulator is implemented with GloMoSim.