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

It is easy to implement a temporary network with a mobile ad-hoc network in which mobile nodes have without using a infrastructure network. They depend on their limited power. Recently, it is a hot issue to save the energy in a mobile ad-hoc network because a mobile nodes have a limited energy. Research of IEEE 802.11 PSM was proposed in a single hop ad-hoc assumption. If IEEE 802.11 PSM is applied to multi hop ad-hoc network, non-optimal paths will be generated by the mobile nodes which didn't receive a message of routing request. Non-optimal paths increase not only a network latency but also energy consumption of mobile nodes. Reconfiguring algorithm of non-optimal paths caused by the mobile nodes which didn't receive a message of routing request is proposed in this paper. A mobile node can overhear the data in his range. A wireless medium is shared by all mobile nodes using the same bandwidth. All mobile nodes lookout the non-optimal paths with these properties of a medium, if non-optimal path is generated, optimal reconfiguring will be accomplished by modifying routing table of itself or sending a request message of routing update to nearby nodes. By reconfiguring the non-optimal paths to optimized ones, network latency and energy consumption was decreased. It is confirmed to ignore the overhead caused by a algorithm presented in this paper through the result of the simulation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.3-11
• /
• 2016

In the environment of Internet of Things (IoT), IoT devices are limited by physical components such as power supply and memory, and also limited to their network performance in bandwidth, wireless channel, throughput, payload, etc. Despite these limitations, resources of IoT devices are shared with other IoT devices. Especially, remote management of the information of devices and patients are very important for the IoT healthcare service, moreover, providing the interoperability between the healthcare device and healthcare platform is essential. To meet these requirements, format of the message and the expressions for the data information and data transmission need to comply with suitable international standards for the IoT environment. However, the ISO/IEEE 11073 PHD (Personal Healthcare Device) standards, the existing international standards for the transmission of health informatics, does not consider the IoT environment, and therefore it is difficult to be applied for the IoT healthcare service. For this matter, we have designed and implemented the IoT healthcare system by applying the oneM2M, standards for the Internet of Things, and ISO/IEEE 11073 DIM (Domain Information Model), standards for the transmission of health informatics. For the implementation, the OM2M platform, which is based on the oneM2M standards, has been used. To evaluate the efficiency of transfer syntaxes between the healthcare device and OM2M platform, we have implemented comparative performance evaluation between HTTP and CoAP, and also between XML and JSON by comparing the packet size and number of packets in one transaction.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.111-120
• /
• 2006

In this paper, a node architecture of WDM metro network for connecting broadband access networks to converge wire/wireless networks. In consideration of the proposed node architecture and network requirements we proposed and evaluated medium access control protocols. We review WDM related technologies of sub-carrier multiplexing and optical components in order to resolve the bottleneck between optical backbone networks md access networks, and a access node architecture sharing common wavelength is introduced. Source-stripping (SS) MAC protocol Is evaluated under the proposed functional node architecture. DS+IS (Destination-Stripping and Source-Stripping) and DS+IS (Destination-Stripping and Intermediate-Stripping) MAC protocols are described to increase the slot-reuse factor which is low on SS MAC protocol. The key function of new MAC protocols regards the optical switch module of proposed node architecture and helps intermediate or source access nodes for dropping slots to destinations of different wavelength group. Thus, slot-reuse factor increases as the MAC protocols reduce the unnecessary ring-rotation of transferred slots. We use a numerical analysis to expect bandwidth efficiency and maximum throughput by slot-reuse factor Throughput network simulation, the verification of throughput, queuing delay, and transmission fairness are compared among MAC protocols.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.901-908
• /
• 2006

With the development of wireless communication techniques and mobile environment we are able to transmit data between mobile systems without restriction of time and space. Recently, researches on the data communication between mobile systems have focused on a small amount of sending out or receiving data and data synchronization at a fixed server and mobile clients in mobile environment. However, two more servers should be able to move mutual independently, information is shared with other systems, and data is synchronized in the special environment like a battlefield situation. Therefore, we propose a data synchronization method between systems moving mutual independently in mobile environment. The proposed method is an optimization solution to data propagation path between servers that considers limited bandwidth and process of data for disconnection communication. In addition, we propose a data reduction method that considers importance and sharing of information in order to reduce data transmission between huge servers. We verified the accuracy of data after accomplishing our data synchronization method by applying it in the real world environment. Additionally, we showed that our method could accomplish data synchronization normally within an allowance tolerance when we considered data propagating delay time by server extension.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.415-426
• /
• 2005

Wireless internet, which becomes a hot social issue, has limitations due to the following characteristics, as different from wired internet. It has low bandwidth, frequent disconnection, low computing power, and small screen in user terminal. Also, it has technical issues to Improve in terms of user mobility, network protocol, security, and etc. Wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. In this paper, wireless internet proxy server clusters are used for the wireless Internet because their caching, distillation, and clustering functions are helpful to overcome the above limitations and needs. TranSend was proposed as a clustering based wireless internet proxy server but it has disadvantages; 1) its scalability is difficult to achieve because there is no systematic way to do it and 2) its structure is complex because of the inefficient communication structure among modules. In our former research, we proposed the All-in-one structure which can be scalable in a systematic way but it also has disadvantages; 1) data sharing among cache servers is not allowed and 2) its communication structure among modules is complex. In this paper, we proposed its improved scheme which has an efficient communication structure among modules and allows data to be shared among cache servers. We performed experiments using 16 PCs and experimental results show 54.86$\%$ and 4.70$\%$ performance improvement of the proposed system compared to TranSend and All-in-one system respectively Due to data sharing amount cache servers, the proposed scheme has an advantage of keeping a fixed size of the total cache memory regardless of cache server numbers. On the contrary, in All-in-one, the total cache memory size increases proportional to the number of cache servers since each cache server should keep all cache data, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.117-126
• /
• 2008

Recent advances in medical imaging technologies have enabled the high-resolution data acquisition. Therefore visualization of such large data set on standard graphics hardware became a popular research theme. Among many visualization techniques, we focused on bricking method which divided the entire volume into smaller bricks and rendered them in order. Since it switches bet\W8n bricks on main memory and bricks on GPU memory on the fly, to achieve better performance, the number of these memory swapping conditions has to be minimized. And, because the original bricking algorithm was designed for regular volume data such as CT and MR, when applying the algorithm to ultrasound volume data which is based on the toroidal coordinate space, it revealed some performance degradation. In some areas near bricks' boundaries, an orthogonal viewing ray intersects the single brick twice, and it consequently makes a single brick memory to be uploaded onto GPU twice in a single frame. To avoid this redundancy, we divided the volume into bricks allowing overlapping between the bricks. In this paper, we suggest the formula to determine an appropriate size of these shared area between the bricks. Using our formula, we could minimize the memory bandwidth. and, at the same time, we could achieve better rendering performance.

• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.165-173
• /
• 2009

Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.