• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1780-1792
• /
• 2016

In this paper, we propose an efficient counter-based broadcast scheme for high reachability and energy efficiency. To achieve this, we propose a method to calculate additional coverage when a node receives the same broadcast message from both nodes, in order to rebroadcast by a node who can cover an large area. We also propose a formula to determine random access delay (RAD) considering addition coverage, distance, density, and remaining battery information, and a formula to determine count threshold ($C_{th}$) considering density and remaining battery information. In addition, we evaluate the performance of the proposed broadcast scheme compared with the existing counter-based broadcast schemes through simulation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.341-351
• /
• 2008

Communication in wireless sensor networks comprising a plurality of sensor nodes located in an ad hoc environment is unidirectional in that data gathered by sensor nodes are transmitted to a sink node and not vice versa. In those networks, it is not possible for a server or a gateway to send commands to the sensor nodes to determine whether some previously received data are valid when the data indicate unusual conditions, which makes it difficult to make appropriate reactions to the unusual situations. This paper proposes and implements a TDMA-based sensor network communication protocol named BiWSLP(Bidirectional Wireless Sensor Line Protocol) supporting bidirectional communication capability. The BiWSLP is an extension of the WSLP, a unidirectional sensor network communication protocol based on the TDMA protocol. To test the feasibility of the proposed BiWSLP, we construct a virtual bridge management system capable of sending commands to sensor nodes as well as collecting data from the sensor nodes. Based on the test results of the virtual bridge management system, we show the applicability and advantages of the BiWSLP in terms of energy efficiency and bidirectional communication capability.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.12 no.1
• /
• pp.1-12
• /
• 2016

The current economic crisis is making new demands on manufacturing industry, in particular, in terms of the flexibility and efficiency of production processes. This requires production and administrative processes to be meshed with each other by means of IT systems to optimise the use and capacity utilisation of machines and lines but also to be able to respond rapidly to wrong developments in production and thus to minimise adverse impacts on the business. The future scenario of the "smart factory" represents the zenith of this development. The factory can be modified and expanded at will, combines all components from different manufacturers and enables them to take on context-related tasks autonomously. Integrated user interfaces will still be required at most for basic functionalities. The complex control operations will run wirelessly and ad hoc via mobile terminals such as PDAs or smartphones. The comnination of IoT, and Big Data optimisation is bringing about huge opportunities. these processes are not just limited to manufacturing, anywhere a supply chain environment exists can benefit from information provided by linked devices and access to big data to inform their decision support. Building a smart factory with smart assets at its core means reaching those desired new levels of productivity and efficiency. It means smart products that leverage advanced traceability, connectivity and intelligence. For businesses, it means being able to address the talent crunch through more autonomous. In a Smart Factory, machinery and equipment will have the ability to improve processes through self-optimization and autonomous decision-making.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.28
• /
• pp.91-117
• /
• 2005

The purpose of this paper is to examine practical and legal considerations in the choice of the "Seat of Arbitration". As the selection of the "Seat of Arbitration" in an international commercial contract is vital both judicially and practically, so to speak, in terms of enforceability of award, judical interference in arbitration proceedings, relative convenience and expense, and the selection of arbitrators, the selection should be carefully considered and examined. In case of institutional arbitration, when the arbitration clause does not nominate the seat, the administrator or the secretariat of the institution or the arbitrator tribunal would usually determine the seat. On the contrary in case of ad hoc arbitration, Unless otherwise agreed by the parties, the "Seat of Arbitration" would be determined according to the rules which are selected by parties or their arbitrators. To avoid confusing situation about the selection of the seat, this writer would like to recommend ICC or LCIA with each Standard Arbitration Clause. If the parties want any national arbitration institution because of the expenses incurred in international institution, AAA or CEPANI is recommendable in terms of the reputation, operating system and recognized performance. Specially ICC Court of Arbitration usually examines the award before it is issued, so the enforceablity would go up. Thus when the parties lay down the arbitration clause in their contract they should confirm whether the "Seat of Arbitration" is fixed or not. If not, at least they should examine the arbitration rules which would be applied, and know in advance how the seat be determined.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2894-2909
• /
• 2015

As the number of mobile devices such as smart phones and tablets explodes, the need for new services or applications is also rapidly increasing. Smart class application is one of the emerging applications, in which most of contents are distributed to all members of a class simultaneously. It is highly required to select relay nodes to cover shadow area of radio as well as extend coverage, but existing algorithms in a smart class environment suffer from high control packet overhead and delay for exchanging topology information among all pairs of nodes to select relay nodes. In addition, the relay selection procedure should be repeated in order to adapt to the dynamic topology changes caused by link status changes or device's movement. This paper proposes the learning based relay selection algorithm to overcome aforementioned problems. The key idea is that every node keeps track of its relay quality in a fully distributed manner, where RQI (Relay Quality Indicator) is newly defined to measure both the ability of receiving packets from content source and the ability of successfully relaying them to successors. The RQI of each node is updated whenever it receives or relays broadcast packet, and the node having the higher RQI is selected as a relay node in a distributed and run-time manner. Thus, the proposed algorithm not only removes the overhead for obtaining prior knowledge to select relay nodes, but also provides the adaptability to the dynamic topology changes. The network simulation and experimental results prove that the proposed algorithm provides efficient and reliable content distribution to all members in a smart class as well adaptability against network dynamics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4411-4431
• /
• 2014

Mobile ad hoc networks (MANETs) have recently gained increased interest due to the widespread use of smart mobile devices. Group communication applications, serving for better cooperation between subsets of business members, become more significant in the context of MANETs. Multicast routing mechanisms are very useful communication techniques for such group-oriented applications. This paper deals with multicast routing problems in terms of stability and scalability, using the concept of stable core. We propose LMRSC (Lightweight Multicast Routing Based on Stable Core), a lightweight multicast routing technique for MANETs, in order to avoid periodic flooding of the source messages throughout the network, and to increase the duration of multicast routes. LMRSC establishes and maintains mesh architecture for each multicast group member by dividing the network into several zones, where each zone elects the most stable node as its core. Node residual energy and node velocity are used to calculate the node stability factor. The proposed algorithm is simulated by using NS-2 simulation, and is compared with other multicast routing mechanisms: ODMRP and PUMA. Packet delivery ratio, multicast route lifetime, and control packet overhead are used as performance metrics. These metrics are measured by gradual increase of the node mobility, the number of sources, the group size and the number of groups. The simulation performance results indicate that the proposed algorithm outperforms other mechanisms in terms of routes stability and network density.

• Proceedings of the KAIS Fall Conference
• /
• 2011.05a
• /
• pp.428-432
• /
• 2011

차량 통신 네트워크(VANET, Vehicle Ad hoc NETwork)는 ITS(Intelligent Transport System)의 발전과 함께 운전자의 안전 및 교통 정보, 긴급 메시지 등과 같은 서비스를 실시간으로 가능하게 할 수 있는 차세대 네트워크 기술이다. 이러한 차량 통신 네트워크는 현재 IEEE P1609에서 정의하고 있으며, WAVE(Wireless Access Vehicular Environment)로 알려져 있다. WAVE는 차량에 설치된 OBU(Onboard Unit)와 주변시설에 설치된 RSU(Road Side Unit)을 통하여 통신하며, 차량 간 통신을 지원하는 V2V(Vehicle to Vehicle)와 차량과 주변시설과의 통신을 지원하는 V2I(Vehicle to Infrastructure)로 나뉘어져 있다. 하지만 WAVE에서 정의하고 있는 네트워크 서비스(IEEE P1609.4)는 OBU와 RSU 간의 네트워크 서비스에 초점을 맞추고 있기 때문에 전체 네트워크의 QoS를 보장하기에는 미흡한 상태이다. 따라서 본 논문에서는 차량 통신 네트워크에서 End-to-End 간의 QoS 보장을 위한 무선 메쉬 네트워크 기반의 라우팅 알고리즘을 제안한다. 제안하는 알고리즘은 무선 메쉬 네트워크 노드의 호스트 라우터 기능을 통하여 차량 노드와 이기종 간의 네트워크 서비스를 가능하게 하며, 무선 메쉬 네트워크의 다중 채널을 이용하여 데이터의 중요도에 따른 차등 서비스를 지원한다. ns-2를 이용한 시뮬레이션 결과 제안하는 알고리즘이 QoS를 보장함으로써 차량 통신 네트워크의 성능을 향상시킬 수 있음을 입증하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3176-3182
• /
• 2009

The PBNM on MANET is being researched to ensure the reliability and efficiency between mobile nodes. Therefore, it is essential to determine the cluster effectively which will perceive the movements of nodes and distribute the policies. In PBNM mechanism, to determine the node cluster for PDP and manage PEP nodes, Active PDP Discovery Protocol is proposed as a mechanism which is more efficient than preexistent techniques. While k-hop cluster selects the PEP nodes which PDP node manages, Active PDP Discovery actively selects the PDP node among the moving PEP node. This method prevents orphan nodes that are not connected to PDP and reduces continual broadcasting messages. This paper implements Active PDP Discovery which determines cluster in the real networks and analyzes its capability, expanding COPS-PR to detect the movement of nodes and adding MNL to PDP node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1933-1954
• /
• 2013

Multiple wireless devices are being widely deployed in Intelligent Transportation System (ITS) services on the road to establish end-to-end connection between vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) networks. Vehicular ad hoc networks (VANETs) play an important role in supporting V2V and V2I communications (also called V2X communications) in a variety of urban environments with distinct topological characteristics. In fact, obstacles such as big buildings, moving vehicles, trees, advertisement boards, traffic lights, etc. may block the radio signals in V2X communications. Their impact has been neglected in VANET research. In this paper, we present a realistic and efficient radio propagation model to handle different sizes of static and moving obstacles for V2X communications. In the proposed model, buildings and large moving vehicles are modeled as static and moving obstacles, and taken into account their impact on the packet reception rate, Line-of-sight (LOS) obstruction, and received signal power. We use unsymmetrical city map which has many dead-end roads and open faces. Each dead-end road and open faces are joined to the nearest edge making a polygon to model realistic obstacles. The simulation results of proposed model demonstrates better performance compared to some existing models, that shows proposed model can reflect more realistic simulation environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4228-4247
• /
• 2018

Many methods have been developed for the vehicles to create clusters in vehicular ad hoc networks (VANETs). Usually, nodes are vehicles in the VANETs, and they are dynamic in nature. Clusters of vehicles are made for making the communication between the network nodes. Cluster Heads (CHs) are selected in each cluster for managing the whole cluster. This CH maintains the communication in the same cluster and with outside the other cluster. The lifetime of the cluster should be longer for increasing the performance of the network. Meanwhile, lesser the CH's in the network also lead to efficient communication in the VANETs. In this paper, a novel algorithm for clustering which is based on the social behavior of Gray Wolf Optimization (GWO) for VANET named as Intelligent Clustering using Gray Wolf Optimization (ICGWO) is proposed. This clustering based algorithm provides the optimized solution for smooth and robust communication in the VANETs. The key parameters of proposed algorithm are grid size, load balance factor (LBF), the speed of the nodes, directions and transmission range. The ICGWO is compared with the well-known meta-heuristics, Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) for clustering in VANETs. Experiments are performed by varying the key parameters of the ICGWO, for measuring the effectiveness of the proposed algorithm. These parameters include grid sizes, transmission ranges, and a number of nodes. The effectiveness of the proposed algorithm is evaluated in terms of optimization of number of cluster with respect to transmission range, grid size and number of nodes. ICGWO selects the 10% of the nodes as CHs where as CLPSO and MOPSO selects the 13% and 14% respectively.