• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.336-339
• /
• 2011

In the RTLS(Real Time Location Based System), in case of existing a number of moving target, extremely complecated data flow is can be occurred. In the network where single gateway exists, various data which was collected from sensor node is transmitted along the simple route as time goes by. In case of multi-gateway configuration, the collected data is transmitted through diverse routes rather than simple route. This kind of data causes jams on nodes and this brings down the performance of the network. Different from existing studies, in this thesis, MAC (Media Access Control) protocol which minimizes data collision between nodes and guarantees QoS(Quality of Service) is suggested, in order to communicate efficiently in multi-gateway underwater sensor network environment. In the suggested protocol, source node which wants to transmit data makes a channel reservation to a number of destination node using a RTS packet. Source node reserves a channel without collision, by scheduling CTS response time using expected delay information from neighbor nodes. Once the reservation is made, source node transmit data packet without collision. This protocol analyzes/estimates the performance compared to a method provided from existing studies via simulation. As a results of the analysis, it was comfirmed that the suggested method has better performance, such as efficiency and delay.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.530-540
• /
• 2015

Industrial WSNs need great performance and reliable communication. In industrial WSNs, cluster structure reduces the cost to form a network, and the reservation-based MAC is a more powerful and reliable protocol than the contention-based MAC. Depth-based TDMA assigns time slots to each sensor node in a cluster-based network and it works in a distributed manner. DB-TDMA is a type of depth-based TDMA and guarantees scalability and energy efficiency. However, it cannot allocate time slots in parallel and cannot perfectly avoid a collision because each node does not know the total network information. In this paper, we suggest an improved distributed algorithm to reduce the end-to-end delay of DB-TDMA, and the proposed algorithm is compared with DRAND and DB-TDMA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1115-1120
• /
• 2004

In this paper, a CSSMA/AI MAC protocol for data services in packet CDMA network is presented. The main features of this protocol are the code status sensing and code reservation for reducing the packet collision. The base station broadcasts the code status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a randomly selected code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected code and waits for the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission for the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet on a reserved code for the successive frames.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.475-478
• /
• 2004

In this paper, a CSSMA/AI MAC protocol for data services in packet CDMA network is presented. The proposed protocol is based on the code status sensing and reservation scheme. In the proposed protocol, the base station broadcast the rode status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a randomly selected code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected rode and waits for the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission lot the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet through the reserved code for the successive frames.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1152-1167
• /
• 2018

In this paper, I propose an application layer cooperative congestion control scheme for safety message broadcast in vehicular networks, called CMS, that adaptively controls a vehicle's safety message rate and transmit timing based on the channel congestion state. Motivated by the fact that all vehicles should transmit and receive an application layer safety message in a periodic manner, I directly exploit the message itself as a means of estimating the channel congestion state. In particular, vehicles can determine wider network conditions by appending their local channel estimation result onto safety message transmissions and sharing them with each other. In result CMS realizes cooperative congestion control without any modification of the existing MAC protocol. I present extensive NS-3 simulation results which show that CMS outperforms conventional congestion control schemes in terms of the packet collision rate and throughput, especially in a high-density traffic environment.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.543-550
• /
• 2002

This paper proposes the dynamic slot allocation method for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed method is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed method guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1242-1250
• /
• 2015

It is very important to provide a parameterized quality of service (QoS) using traffic specification (TSPEC), such as mean data rate, maximum burst size, and peak data rate, when packets from the application layer need to be transmitted with guaranteed services in a high-rate wireless personal area network (HR-WPAN). As medium resources are limited, the optimal medium time required for each device needs to be estimated to share the resources efficiently among devices. This paper proposes a variable-service interval-based resource allocation algorithm to efficiently make a reservation of medium resources based on a parameterized QoS. In other words, the proposed algorithm calculates the number of medium access slots (MASs) based on TSPEC, local resources, and local conditions and determines suitable locations for the MASs within a superframe to accommodate more devices. The simulation results show that the proposed algorithm can accommodate more devices and has greater than 10% resource allocation efficiency in an HR-WPAN compared to existing schemes.