• 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.

• Journal of Korean Society of Transportation
• /
• v.26 no.6
• /
• pp.93-101
• /
• 2008

With a spread of mobile devices, the growing trend of integrating wireless communications technologies into transportation systems is advanced. In particular, vehicular ad hoc networks (VANETs) enable vehicles to share traffic information that they have through intervehicle communications. This research focused on the design of an integrated transportation and communication simulation framework to build an environment that is more realistic than previous studies developed for studying VANETs. Developing a VANET-based information model, this research designed an integrated transportation and communication simulation framework in which these independent simulation tools not supporting High Level Architecture (HLA) were tightly coupled and finely synchronized. As a case study, a VANET-based traffic information system was demonstrated based on a real road network and real traffic data. The experiment results showed that the simulation framework was well integrated. The simulation framework designed in this study is expected to contribute to developing the environment to experiment a wide range of VANET applications.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.259-270
• /
• 2010

In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.466-468
• /
• 2003

무선 센서 네트워크에서의 에너지 효율은, 네트워크 및 노드의 운용시간에 직접 영향을 미치므로, 지연시간과 같은 일반 성능척도 이상으로 중요하다. 본 논문에서는 에너지 소모의 관점에서 정적 애드혹 센서 네트워크에서의 멀티캐스트 프로토콜들을 재평가하고, 멀티캐스트에서의 에너지 소모의 분석적 모델을 제안한다. 멀티캐스트 프로토콜은 멀티캐스트 패킷이 다수의 수신자들에게 전달되는 네트워크 구조에 따라, 크게 트리기반(tree­based) 멀티캐스트와 메쉬기반(mesh­based) 멀티캐스트로 분류된다. 메쉬기반 프로토콜은 링크 장애에 강하여 높은 신뢰성을 갖는 반면에, 트리기반 멀티캐스트는 높은 에너지 효율을 나타낸다. 그 이유는 메쉬기반 프로토콜은 메쉬 내에서 플러딩(flooding)에 의존하고 메쉬 내의 노드는 모든 멀티캐스트 패킷을 수신해야 하기 때문이다. 본 논문에서 제안한 에너지 소모의 분석적 모델에 의하면, 메쉬기반 멀티캐스트는 메쉬 내의 브로드캐스기반 플러딩으로 인하여 트리기반 멀티캐스트에 비하여 약 (f + 1)/2 배의 에너지를 더 소모한다. 여기서 f 는 평균 노드 연결도를 나타낸다.

• 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 KIPS Transactions:PartC
• /
• v.16C no.6
• /
• pp.791-800
• /
• 2009

Multicasting is fundamental to many ad hoc network applications requiring collaboration of multiple nodes in a group. A general approach is to construct an overlay tree and to deliver a multicast packet to multiple receivers over the tree. This paper proposes adaptive overlay trees (AOTs) on wireless ad hoc networks of static nodes for delay- and energy-efficient multicast. A tradeoff function is derived, and an algorithm for AOT construction is developed. Note here that the requirements of delay and energy consumption may vary with different classes of applications. By adjusting parameters in the tradeoff function, different AOTs can be adaptively chosen for different classes of applications. An AOT is constructed in O(ke) time where e is the number of wireless links in a network and k is the number of member nodes in a multicast group. The simulation study shows that AOT adaptively provides tradeoffs between the fastest multicast (which is the choice if delay is the most important factor) and the most energy efficient multicast (which is used when energy consumption is the primary concern). In other words, one of AOTs can be appropriately chosen in accordance with the operation requirement.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.661-664
• /
• 2006

무선 이동 Ad hoc 네트워크는 고정된 인프라의 도움 없이 이동 노드들의 협력에 의해 자율적으로 구성되는 독립적이고 융통성 있는 네트워크이다. 최근 상업적인 분야에서도 Ad hoc 네트워크의 응용에 대한 관심이 급증하면서 Ad hoc 네트워크의 보안 문제도 해결되어야 할 기술적 요구사항으로 대두되고 있다. 특히, 이러한 요구사항을 만족시키기 위해 Ad hoc 네트워크상에서 공개키 기반구조(PKI)를 도입하는 것은 고정된 인프라를 사용하지 않는 애드혹 네트워크 특성상 매우 제한적인 기법이다. 또한 password를 기반으로 하는 인증된 키교환을 하기위해서는 모든 사용자가 사전에 password를 공유를 해야 하는 불편함이 있다. 본 논문에서는 인증을 위한 제 3의 신뢰기관이나, 사전 비밀 공유가 필요 없는 인증된 키교환 프로토콜을 제안한다.

• 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.