• Title/Summary/Keyword: one way send information

Search Result 23, Processing Time 0.036 seconds

A Three-way Handshaking Access Mechanism for Point to Multipoint In-band Full-duplex Wireless Networks

  • Zuo, Haiwei;Sun, Yanjing;Lin, Changlin;Li, Song;Xu, Hongli;Tan, Zefu;Wang, Yanfen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3131-3149
    • /
    • 2016
  • In-band Full-duplex (IBFD) wireless communication allows improved throughput for wireless networks. The current Half-duplex (HD) medium access mechanism Request to Send/Clear to Send (RTS/CTS) has been directly applied to IBFD wireless networks. However, this is only able to support a symmetric dual link, and does not provide the full advantages of IBFD. To increase network throughput in a superior way to the HD mechanism, a novel three-way handshaking access mechanism RTS/SRTS (Second Request to Send)/CTS is proposed for point to multipoint (PMP) IBFD wireless networks, which can support both symmetric dual link and asymmetric dual link communication. In this approach, IBFD wireless communication only requires one channel access for two-way simultaneous packet transmissions. We first describe the RTS/SRTS/CTS mechanism and the symmetric/asymmetric dual link transmission procedure and then provide a theoretical analysis of network throughput and delay using a Markov model. Using simulations, we demonstrate that the RTS/SRTS/CTS access mechanism shows improved performance relative to that of the RTS/CTS HD access mechanism.

A Performance Improvement Scheme for a Wireless Internet Proxy Server Cluster (무선 인터넷 프록시 서버 클러스터 성능 개선)

  • Kwak, Hu-Keun;Chung, Kyu-Sik
    • 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.

A Study on Leakage of Critical Information via the Power Analysis of Power Lines (전원선의 전력분석을 이용한 주요정보 유출 가능성에 관한 연구)

  • Han, Kyong-Ho;Lee, Seong-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.63 no.11
    • /
    • pp.1571-1574
    • /
    • 2014
  • In this paper, we propose a unidirectional transmission of critical information obtained by keyboard hacking or kernel and keyboard driver hacking even though the computer is not connected to the external network. We show the hacking can be attempted in the proposed method to show the way preventing such attempts in advance. Firewalls and other various methods are used to prevent the hacking from the external network but the hacking is also attempted in various ways to detour the firewall. One of the most effective way preventing from the hacking attack is physically disconnect the internal intranet systems from the external internet and most of the government systems, military systems and big corporate systems are using this way as on one of the protection method. In this paper, we show the feasibility of transmission of security codes, etc via the short message to the external network on the assumption that a hacking program such as Trojan Horse is installed on the computer systems separated from the external network. Previous studies showed that the letters on the monitor can be hijacked by electromagnetic analysis on the computer to obtain the information even though the system is not connected ti the network. Other studies showed that the security code hint can obtained by analyzing the power consumption distribution of CPU. In this paper, the power consumption distribution of externally accessible power line is analyzed to obtain the information and the information can be transmitted to the external network. Software controlling the CPU and GPU usage is designed to control the power supply of computer. The sensors such as the Rogowski coils can be used on the external power line to collect the data of power consumption change rates. To transmit the user password by short message, due to the capacitive components and the obstacle from other power supply, A very slow protocol are used.

A Study of the Damage and the Countermeasure by Identification Card Loss (신분증 분실에 따른 피해 및 대응책에 관한 연구)

  • Lee, Younggyo;Ahn, Jeonghee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.3
    • /
    • pp.53-64
    • /
    • 2017
  • Korean Identification card or driver license is usually used to verify one's identity in Korea. These are also used as an adult certification. Since the form of these ID card is an analog and it needs to be checked with naked eyes, it might be used maliciously. Someone who's got someone else's ID card can do other things. Therefore, it must be reported rapidly when ID card is lost or stolen. The most serious problem might be occurred when they do not recognize and report the loss. They might suffer from pecuniary or mental damage such as opening a mobile phone service, providing loan or credit card, opening a personal checking account, etc. Thus, this study suggests and compares the ways of avoiding these problems. First, the most effective way is to send the authorization code via mobile phones in consideration of build-up period and cost. The person in charge of business processing department using ID card sends the authorization code via registered mobile phone. The owners submits it to the person and their identifications are confirmed. Next effective way is that the person in charge of business processing department using ID card sends text messages via registered mobile phone. Lastly, the most ineffective way is to introduce and implement the electronic ID card ultimately even though it is expensive and takes a long time to build up the system.

A Clustering Protocol with Mode Selection for Wireless Sensor Network

  • Kusdaryono, Aries;Lee, Kyung-Oh
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.29-42
    • /
    • 2011
  • Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

Base Station Cooperation Scheme for Low-Latency Two-Way Communication (저지연 양방향 통신을 위한 기지국 협력 전송)

  • Kim, Dong Min
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.6
    • /
    • pp.751-758
    • /
    • 2020
  • As the application fields using various types of communication, including the Internet of Things, have emerged, the form of communication has been diversified. Some applications require fast feedback and the others continue to send data regardless of whether it is received or not. Transmitting data in one way can be acknowledged by the opposite direction response. These information exchanges form a two-way communication. For applications that need to issue commands remotely, such as network control systems, it is important to give a fast response because the sender decides the next action based on the response from the recipient. In this paper, we propose the base station (BS) cooperation to improve the latency performance of the two-way communication in cellular networks. We design the two-way communication strategy utilizing cooperating BSs with the same direction of traffic as well as bidirectional traffic. We show that the proposed scheme improves the latency performance than the previous works.

An Efficient Authentication Protocol for GPS Information Exchange between Cars Using the Base Station (기지국을 이용한 차량간 GPS 정보 교환을 위한 효율적인 인증 프로토콜)

  • Cho, KookRae;Son, Jong-Wuk;Cho, HuiSup
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.5 no.3
    • /
    • pp.118-127
    • /
    • 2010
  • Inter-vehicle communication is one of the most important parts in Intelligent Vehicle System. Through this communication, drivers can recognize what is happening out of their sights, such as the freezing condition of the street, traffic accidents, and so on. Each car in IVS gives various services to the drivers after analyzing those received information from cars or a base station. If the message is, however, exchanged from car to car directly, the computation cost which is needed for all the car to authenticate the transmitted message between nearby cars is tremendously high. Therefore, one can naturally think that the message communication between cars is performed with the help of the base station to reduce the computation cost. In this case where the base station collects all the information transmitted from cars and broadcasts them nearby, there should be an efficient way both for the base station to authenticate the car message within its communication range and for the car to authenticate the information received from the base station. In this paper, we present a two-way authentication protocol using a hash chain to efficiently exchange GPS information between a car and a base station. This information can be used to provide a driver with the navigation which displays all the moving cars around him in real time. When a car goes into an area of a base station, the car authenticates itself to the base station using its private key of PKI, sends a commitment of a hash chain, then starts to send a message with the hash value for authentication. The message includes GPS information, driver's status and so on. The base station also authenticates itself to the nearby cars using its private key, transmits the commitment of the hash chain, and sends all the messages gathered from cars with authentication information.

Efficient Transmission Mode Selection Scheme for MIMO-based WLANs

  • Thapa, Anup;Kwak, Kyung Sup;Shin, Seokjoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2365-2382
    • /
    • 2014
  • While single-user spatial multiplexing multiple-input multiple-output (SU-MIMO) allows spatially multiplexed data streams to be transmitted to one node at a time, multi-user spatial multiplexing MIMO (MU-MIMO) enables the simultaneous transmission to multiple nodes. However, if the transmission time required to send packets to each node varies considerably, MU-MIMO may fail to utilize the available MIMO capacity to its full potential. The transmission time typically depends upon two factors: the link quality of the selected channel and the data length (packet size). To utilize the cumulative capacity of multiple channels in MIMO applications, the assignment of channels to each node should be controlled according to the measured channel quality or the transmission queue status of the node.A MAC protocol design that can switch between MU-MIMO and multiple SU-MIMO transmissions by considering the channel quality and queue status information prior to the actual data transmission (i.e., by exchanging control packets between transmitter and receiver pairs) could address such issues in a simple but in attractive way. In this study, we propose a new MAC protocol that is capable of performing such switching and thereby improve the system performance of very high throughput WLANs. The detailed performance analysis demonstrates that greater benefits can be obtained using the proposed scheme, as compared to conventional MU-MIMO transmission schemes.

A study on improving fairness and congestion control of DQDB using buffer threshold value (버퍼의 문턱치값을 이용한 DQDB망의 공평성 개선 및 혼잡 제어에 관한 연구)

  • 고성현;조진교
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.618-636
    • /
    • 1997
  • DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

  • PDF

A Study on Estimating the Next Failure Time of a Compressor in LNG FPSO (LNG FPSO 압축기 고장시간 예측 방안에 관한 연구)

  • Cho, Sang-Je;Jun, Hong-Bae;Shin, Jong-Ho;Hwang, Ho-Jin
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.4
    • /
    • pp.12-23
    • /
    • 2014
  • The O&M (Operation and Maintenance) phase of offshore plants with a long life cycle requires heavy charges and more efforts than the construction phase, and the occurrence of an accident of an offshore plant causes catastrophic damage. So previous studies have focused on the development of advanced maintenance system to avoid unexpected failures. Nowadays due to the emerging ICTs (Information Communication Technologies) and sensor technologies, it is possible to gather the status data of equipment and send health monitoring data to administrator of an offshore plant in a real time way, which leads to having much concern on the condition based maintenance policy. In this study, we have reviewed previous studies associated with CBM (Condition-Based Maintenance) of offshore plants, and introduced an algorithm predicting the next failure time of the compressor which is one of essential mechanical devices in LNG FPSO (Liquefied Natural Gas Floating Production Storage and Offloading vessel). To develop the algorithm, continuous time Markov model is applied based on gathered vibration data.