• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.264-267
• /
• 2014

TDMA(Time Division Multiple Access)는 사용자에게 자신에게 할당된 시간구간에서 모든 대역폭을 이용하여 무선 네트워크에서 통신할 수 있는 다중 접속기술이다. TDMA에서 동기화 방식은 동기화를 이루는 방법이 어렵기 때문에 소규모 네트워크에는 적합하지 않다. 본 논문에서는 DESYNC 알고리즘을 이용하여 소규모 네트워크에 적합한 동기화 방식의 TDMA 기법인 C-DESYNC를 제안하고자 한다. C-DESYNC는 DESYNC의 firing 방식을 이용하고, 주기의 시작 정보를 포함하고 있는 Global Packet을 이용하여 안정화상태까지 걸리는 최대 지연시간을 보장한다.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.183-195
• /
• 2001

무선 ad-hoc 네트워크는 중앙의 특별한 관리 체계 없이 기존의 유선 네트워크 또는 기지국을 사용하지 않는 이동 호스트들만으로 구성된 네트워크를 말한다. 이러한 무선 ad-hoc 네트워크는 잦은 망 구성의 변화 라우터의 수, 제한된 사용자원 등 기존 유선 네트워크와는 다른 특성들을 가지게 된다. 따라서 기존의 유선 네트워크에서 사용하던 라우팅 프로토콜들을 무선 ad-hoc 네트어크의 특성을 고려하여 네트워크 내의 이동 호스트를 멀티 흡을 갖는 클러스터로 묶고 클러스터 헤드로 하여금 자신의 멤버 호스트들과 이웃 클러스터들의 헤드 정보를 유지하게 하여 경로 설정에 대한 요구가 있을때에 적은 지연시간과 적은 패킷으로 목적지까지의 최단 경로를 설정할 수 있도록한다. 또한 이동 호스트로 구성된 클러스터를 무선 ad-hoc 네트워크의 변화에 따라서 적절한 크기로 변화시켜 네트워크에 발생되는 경로 검색 오버헤드를 줄일수 있게 하였고 경로 복구와 경로 유지에 드는 비용을 최소화하기 위한 알고리즘을 제시한다.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1295-1309
• /
• 2007

A wireless access point is used for all communications in the infrastructure mode wireless home networking, including communication between mobile nodes in the same service area. When a mobile station in the infrastructure mode wireless home networking moves into a dead zone, the communication between the mobile station and the access point is disconnected. To solve this problem, the existing wireless home network platforms focus on the ad hoc mode wireless home networking. However, the performance of an ad hoc network is poorly decreased when the number of mobile participating in the ad hoc network increases. In addition, although the ad hoc routing technique is necessary to support seamless communication of mobile nodes, the existing routing protocols, such as AODV and DSR, do not consider that a wireless channel state could affect performance significantly. Therefore, we propose a wireless home networking platform based on the ESCOD (End-to-end Seamless multi-hop COnnection based on Dual network mode) technique incorporating the VLR (Virtual Link Routing) scheme that supports end-to-end seamless connections. Extensive experiments show that the proposed wireless home networking platform incorporating the VLR scheme outperforms wireless home networking platforms based on the AODV and the DSR routing protocols respectively in terms of low packet transmission failure rate, fast packet transmission time, high TCP performance, and a wider coverage area of wireless home networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.681-688
• /
• 2016

Several VHF bands for the use in analog communications has been changed to those for the use in new maritime digital communications by WRC-12. ITU-R M. 1842-1 has been also standardized, recommending the characteristics of maritime digital communication systems. In addition, a Shipborne Ad-hoc Network (SANET) has been introduced by IMO in order to provide ships, which cannot be connected to a shore directly, with maritime digital data exchange services with the help of ad-hoc communication. In this paper, several functionalities of the SANET, including channel access, route determination to a shore, and data exchange, are verified via sea trials. It is expected that the SANET can be applicable to collecting and analyzing maritime information, facilitating the entry and departure of vessels, and the communication infrastructure of e-navigation.

• Journal of Digital Convergence
• /
• v.10 no.11
• /
• pp.365-369
• /
• 2012

M2M has shown the advantages of better coverage and lower network deployment cost. Intelligent vehicle section shows severe changes in position between vehicles and has numerous large scales of networks in its components, therefore, it is required to provide safety by exchanging information between vehicles equipped with wireless communication function via biometric information in VANET(Vehicular Ad hoc Network). This thesis is to propose scheme that mutually authenticates between vehicles by composing vehicle movement as biometric information.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.65-72
• /
• 2009

Due to the popularity of mobile devices and advances in wireless communication technologies, a mobile ad hoc network has received a lot of attention. In the existing data replication management research, the use of a replica has been shown to be an efficient technique for improving data accessibility. However, to use a replica in ad hoc networks, the data consistency between the original data and the replica should be guaranteed. In the traditional research, a mobile node should check an original data whether the data is updated or not. However, It may be costly or sometimes impossible to check the original data. In the case of the time constraint applications, the checking cost can cause more serious problem. In this paper, we propose the time-guarantee based cache invalidation schemes for time constraint applications and the threshold based compensation method to enhance the time-guarantee based scheme. The proposed schemes can remove the "rollback" problem. Simulation results show that our schemes outperform the previous ones in terms of access time with little loss of data currency.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.631-640
• /
• 2003

Because of multi-hop wireless communication, P2P applications in ad hoc networks suffer poor performance. We Propose neighbor caching strategy to overcome this shortcoming and show it is more efficient than self caching that nodes store data in theirs own cache individually. A node can extend its caching storage instantaneously with neighbor caching by borrowing the storage from idle neighbors, so overcome multi-hop wireless communications with data source long distance away from itself. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The node that uses the ranking based prediction can select the neighbor that has high possibility to keep data for a long time and avoid caching the low ranked data. Therefore the ranking based prediction improves the throughput of neighbor caching. In the simulation results, we observe that neighbor caching has better performance, as large as network size, as long as idle time, and as small as cache size. We also show the ranking based prediction is an adaptive algorithm that adjusts times of data movement into the neighbor, so makes neighbor caching flexible according to the idleness of nodes

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.561-569
• /
• 2014

In wireless ad hoc networks, neighbor discovery is essential in the network initialization and the design of routing, topology control, and medium access control algorithms. Therefore, efficient neighbor discovery algorithms should be devised for self-organization in wireless ad hoc networks. In this paper, we propose a probabilistic neighbor discovery (PND) algorithm, which aims at reducing the neighbor discovery time by adjusting the transmission probability of advertisement messages through the multiplicative-increase/multiplicative-decrease (MIMD) policy. To further improve PND, we consider the collision detection (CD) capability in which a device can distinguish between successful reception and collision of advertisement messages. Simulation results show that the transmission probabilities of PND and PND with CD converge on the optimal value quickly although the number of devices is unknown. As a result, PND and PND with CD can reduce the neighbor discovery time by 15.6% to 57.0% compared with the ALOHA-like neighbor discovery algorithm.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.589-596
• /
• 2007

Although flooding has the disadvantages like a transmission of duplicated packets and a packet collision, it has been used frequently to find a path between a source and a sink node in a wireless ad hoc network. Clustering is one of the techniques that have been proposed to overcome those disadvantages. In this paper, we propose a new flooding mechanism in ad hoc networks using cluster formation based on the link density which means the number of neighbors within a node's radio reach. To reduce traffic overhead in the cluster is to make the number of non-flooding nodes as large as possible. Therefore, a node with the most links in a cluster will be elected as cluster header. This method will reduce the network traffic overhead with a reliable network performance. Simulation results using NS2 show that cluster formation based on the link density can reduce redundant flooding without loss of network performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.37-46
• /
• 2011

Time synchronization plays an important role in mobile communication systems, particularly, when an accurate time-division mechanism among the communication entities is required. We present a new time synchronization algorithm for a wireless mobile ad-hoc network assuming that communication link is managed by a time-slot reservation-based medium access control protocol. The central idea is to reduce time synchronization packet collisions by exploiting the advantages found in reference broadcasting. In addition, we adopt a sophisticated clock updating scheme to ensure the time synchronization convergence. To verify the performance of our algorithm, a set of network simulations has been performed under various mobile ad-hoc network scenarios using the OPNET. The results obtained from the simulations show that the proposed method outperforms the conventional TSF method in terms of synchronization accuracy and convergence time.