• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1034-1051
• /
• 2016

Mobility models are invaluable for determining the performance of routing protocols in opportunistic networks. The movement of nodes has a significant influence on the topological structure and data transmission in networks. In this paper, we propose a new mobility model called the campus-based community mobility model (CBCNM) that closely reflects the daily life pattern of students on a real campus. Consequent on a discovery that the pause time of nodes in their community follows a power law distribution, instead of a classical exponential distribution, we abstract the semi-Markov model from the movement of the campus nodes and analyze its rationality. Then, using the semi-Markov algorithm to switch the movement of the nodes between communities, we infer the steady-state probability of node distribution at random time points. We verified the proposed CBCNM via numerical simulations and compared all the parameters with real data in several aspects, including the nodes' contact and inter-contact times. The results obtained indicate that the CBCNM is highly adaptive to an actual campus scenario. Further, the model is shown to have better data transmission network performance than conventional models under various routing strategies.

• Journal of National Security and Military Science
• /
• s.1
• /
• pp.345-360
• /
• 2003

To build an information oriented armed forces, the Korean military telecommunication networks adopt TCP/IP standard communication infrastructures based on ATM packet switched networks. Utilizing this network infrastructure, the Korean armed forces also applies to the areas of battleship management for efficient operation command controls and resource management for efficient resource allocations. In this military communication networks, it is essential to determine the least cost network topology under equal performance and reliability constraints. Basically, this type of communication network design problem is known in the literature as an NP Hard problem. As the number of network node increases, it is very hard to obtain an optimal solution in polynomial time. Therefore, it is reasonable to use a heuristic algorithm which provides a good solution with minimal computational efforts. In this study, we developed a simulated annealing based heuristic algorithm which can be utilized for the design of military communication networks. The developed algorithm provides a good packet switched network topology which satisfies a given set of performance and reliability constraints with reasonable computation times.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.156-162
• /
• 2004

In recent years, mobile ad-hoc networks have received a great deal of attention in both academia and industry to provide anytime-anywhere networking services. As wireless networks are rapidly deployed, the security of wireless environment will be mandatory. In this paper, we describe a group key management architecture and key agreement protocols for secure communication in mobile ad-hoc wireless networks (MANETs) overseen by unmanned aerial vehicles (UAVs). We use implicitly certified public keys method, which alleviates the certificate overhead and improves computational efficiency. The architecture uses a two-layered key management approach where the group of nodes is divided into: 1) Cell groups consisting of ground nodes and 2) control groups consisting of cell group managers. The chief benefit of this approach is that the effects of a membership change are restricted to the single cell group.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.376-384
• /
• 2009

In this article, we demonstrate that the asymmetric key-based architecture for securing wireless sensor networks recently introduced by Haque et al. is insecure under impersonation attack, since it does not provide authentication semantics. In addition, we show that, for the scheme to work correctly, the resulting key distribution construction should be symmetric and group-wise.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.1
• /
• pp.13-22
• /
• 2008

This paper gives reviews on current research status in telecommunication network design. Two problems are identified as major research issues. One is the WDM network design problem, where traffic grooming, virtual topology design and routing and wavelength assignment problems are considered. The other is the OSPF weight setting problem which was proposed as a practical method to implement traffic engineering capability in IP networks. After presenting surveys on those problems, we discuss potential challenging research issues in telecommunication network design.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.4
• /
• pp.216-222
• /
• 2009

This paper proposes an integrated mobile sink networks management system which can monitor and control various kinds of wireless lan access points, located in many different areas divided by their managing groups, from multi-vendors, and their operations in networks. The proposed system has the center-local interoperability structure cooperating with local-center servers which can perform the same operations as the central servers for wireless lan access points from multi-vendors and wireless lan centric management features. For this purpose, we propose a new way of data design, messaging policy, and hierarchical system structure such that we can achieve stable and consistent management methods for various wireless access points on distributed networks.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.2 no.3
• /
• pp.48-60
• /
• 2003

With the rapid successful deployment of WLANs worldwide in numerous hotspots for high data rate, wireless access for data services has created the need to integrate the Cellular Networks with WLAN Networks. The integrated wireless environment will provide the end user a much better service experience along with a single subscription and a single bill. In this paper we focus on inter-working approaches, which combine WLANs and Cellular Networks into an integrated wireless environment capable of ubiquitous access to data services and very high data rates in hotspots areas. We first list the key requirements which are currently being standardized within the 30PP for integration with WLANs networks. We discuss two inter-working architectures namely loosely coupled and tightly coupled This paper will detail the loosely coupled inter-working approach while briefly discussing the tightly coupled inter-working. Finally, we will conclude that the loosely coupled approach is evolutionary and less intrusive than the tightly coupled approach.

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

최근 저가형 이미지 센서 기술의 발전과 무선 센서 네트워크기술의 발전으로 인해 WMSN(Wireless Multimedia Sensor Networks) 기술이 활발히 연구되고 있다. WMSN은 기존의 무선 센서 네트워크 기술에 멀티미디어 컨텐츠를 센싱하고 전송 및 처리하는 기반기술을 포함한다. 멀티미디어 컨텐츠는 많은 데이터 가지므로 이를 처리하기 위해서는 많은 계산량과 데이터 전송량을 필요로 하게 된다. 저사양의 센서 노드에서 멀티미디어 컨텐츠를 수용하기 위해서는 에너지 소모를 고려한 압축 기법 및 효율적인 전송에 대한 연구가 필요하다. 본 논문에서는 무선 센서 네트워크에서 이미지를 효율적으로 압축하고 전송하기 위하여 웨이블릿의 Resolution Scalability 특성을 이용한 4가지 움직임 보상/예측 기법을 제안한다. 이를 지원하기 위해 시스템에서 사용하는 각 압축 기법들의 조합에 따른 압축 성능이 적절함을 알아보았다.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.621-632
• /
• 2004

Recent measurement studies of real teletraffic data in modern telecommunication networks have shown that self-similar (or fractal) processes may provide better models of teletraffic in modern telecommunication networks than Poisson processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A new generator of pseu-do-random self-similar sequences, based on the fractional Gaussian nois and a wavelet transform, is proposed and analysed in this paper. Specifically, this generator uses Daubechies wavelets. The motivation behind this selection of wavelets is that Daubechies wavelets lead to more accurate results by better matching the self-similar structure of long range dependent processes, than other types of wavelets. The statistical accuracy and time required to produce sequences of a given (long) length are experimentally studied. This generator shows a high level of accuracy of the output data (in the sense of the Hurst parameter) and is fast. Its theoretical algorithmic complexity is 0(n).

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.791-794
• /
• 1999

A principle requirement and technical standardization for numbering plan is required to B-lSDN network planning. Especially, internetworking high speed network with other conventional networks like PSTN, PSDN and ISDN is generally considered for integration. This paper describes the numbering plan for operation between internet and ATM. And based on the ITU-U specification, numbering plan is compared between conventional and high speed networks. Additionally, numbering plan for ATM-forum is analyzed.