• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1185-1192
• /
• 2015

A wireless bridge is essential to transmit control and managing information to sensors or instruments from a central integrated ship area network station. In this paper, a WPAN protocol is adopted for development of a seamless N-screen wireless service in Indoor and Ship Area Networks. Furthermore, to provide the OSMU (One Source Multi Use) N-screen service through P2P streaming in the seamless WPAN protocol, a Grid-based WPAN networking technology is proposed and analyzed. The proposed Grid-based WPAN networking technology supports multi-path and fast path-setup functions for N-screen communications. The simulation results demonstrate that the proposed Grid-based WPAN networking technology outperforms the IEEE 802.15.4 based network in terms of N-screen transmission delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.820-827
• /
• 2010

In these days, video applications for special purposes such as video conference systems among multiple users and video surveillance systems require multiple video connections and QoS guarantee. The video systems employ IEEE 802.11 Wireless LAN devices to support broadband wireless interfaces and easy internet accesses for cheaper prices. However, according to the current IEEE 802.11e HCCA standard, if more than three video sessions are established in WSTA services, some of them must share the TXOP because the available number of TSIDs for video transmission is two. In order to resolve the problem, we devised a method which can establish up to 15 video sessions by slightly modifying the frame structure while maintaining the compatibility with current standard. Our method is implemented on the NCTUns 4.0 network simulator, and evaluated not only numerically in terms of throughput, delay, and PSNR, but also experimentally in the sense of real video clips that are used as input to our simulation. The results showed that our method sufficiently guarantees the transmission bandwidth requested by each video session.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.11
• /
• pp.123-130
• /
• 2004

This paper describes a multiplier architecture optimized for 32 bit RISC processor with 3-stage pipeline. The multiplier of ARM7, the target processor, is variably carried out on the execution stage of pipeline within 7 cycles. The included multiplier employs a modified Booth's algerian to produce 64 bit multiplication and addition product and it has 6 separate instructions. We analyzed several multiplication algorithm such as radix4-32${\times}$8, radix4-32${\times}$16 and radix8-32${\times}$32 to decide which multiplication architecture is most fit for a typical architecture of ARM7. VLSI area, cycle delay time and execution cycle number is the index of an efficient design and the final multiplier was designed on these indexes. To verify the operation of embedded multiplier, it was simulated with various audio algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.264-273
• /
• 2009

For IEEE 802.15.3 HR-WPAN, we propose the DABL algorithm that PNC can allocate the channel times to the DEV in super frame in order that system frame throughput is increased and the delay is decreased. In detail, the DABL algorithm allows to dynamically allocate channel time as well as to adaptively apply the modulation and coding scheme based on the link quality of the DEV. In addition, due to the facts that QoS is quite different depending on service types, we provide the DABL algorithm taking into account RT(Real Time) traffic and Non-RT traffic respectively. Finally, we show simulation results of the DABL algorithm compared to the conventional algorithm that the PNC equally allocates channel times to the DEV regardless of the link quality of the DEV.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.11
• /
• pp.30-40
• /
• 2001

In this paper, we propose a dynamic slot allocation algorithm for efficient transmission of VBR services in wireless ATM networks. The proposed algorithm is based on a hybrid dynamic parameter(DP) control which combines the strength of in-band control and out-of-band control by considering the variation characteristics of buffer length in distributed mobile terminals. This algorithm consists of four sub-algorithms: dynamic parameter determination algorithm, dynamic parameter transmission algorithm, estimation algorithm of the number of request slots, and prorated-allocation algorithm. As the proposed allocation algorithm based on the hybrid DP control scheme can offer nearly precise MAC level estimations of the requirements for each VBR, the algorithm makes it possible to obtain ideal allocation efficiency. The allocation efficiency of the algorithm is shown by numerical analysis. Simulation results show that the proposed algorithm has better performance than conventional schemes in terms of allocation efficiency, delay and cell loss ratio under VBR traffic.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.10
• /
• pp.35-42
• /
• 2011

WPAN(Wireless Personal Area Network) have many advantages such as using low power and cheap price, small size. So it is recently increasing application range such as personal portable device, home network and sensor network so and on. IEEE 802.15.3 basically has the point to point or peer to peer UM(Usage Model). But using devises that need data transmission is increasing in the house and office. Therefor UM of point to multipoint is proposed. In this paper, I proposed Multicast ACK mechanism on the point to multipoint UM. So it is able to transfer data to multiple devices as this Multicast transfer method at a time. Thus, throughput performance is improved. But the problem that increases data transfer delay is appeared because of adding Multicast ACK traffic. We compared the performance between standard and proposed mechanism through a numerical analysis.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.1-8
• /
• 2021

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

• Journal of Korea Multimedia Society
• /
• v.15 no.5
• /
• pp.587-594
• /
• 2012

IEEE 802.15.6 standard technology is proposed for low-power wireless communication in, on and around body, where vital signs such as pulse, blood pressure, ECG, and EEG signals are transmitted as a type of data packet. Especially, these vital signs should be delivered in real time, so that the latency from slave node to hub node can be one of the pivotal performance requirements. However, in the case of IEEE 802.15.6 technology data retransmission caused by transmission failure can be done in the next superframe. In order to overcome this limitation, we propose an adaptive polling algorithm for IEEE 802.15.6 technology. The proposing algorithm makes the hub to look for an appropriate time period in order to make data retransmission within the superframe. Through the performance evaluation, the proposing algorithm achieves a 61% and a 73% latency reduction compared to those of IEEE 802.15.6 technology in the environment of 70% traffic offered load with 10ms and 100ms superframe period. In addition, the proposing algorithm prevents bursty traffic transmission condition caused by mixing retransmission traffic with the traffic reserved for transmission. Through the proposing adaptive polling algorithm, it will be possible to transmit time-sensitive vital signs without severe traffic delay.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.17-27
• /
• 2007

The enhanced distributed channel access (EDCA) of IEEE 802.11e has been standardized for supporting Quality of Service (QoS) in wireless LANs. In the EDCA, support of QoS can be achieved statistically by reducing the probability of medium access for lower priority traffics. In other words, it provides statistical channel access rather than deterministically prioritized access to high priority traffic. Therefore, lower priority traffics affect the performance of higher priority traffics. Consequently, at the high loads, the EDCA does not guarantee the QoS of multimedia applications such as voice and video even though it provides higher priority. In this paper, we propose a simple and effective scheme, called deterministic priority channel access (DPCA), for improving the QoS performance of the EDCA mechanism. In order to provide guaranteed priority channel access to multimedia applications, the proposed scheme uses a busy tone for limiting the transmissions of lower priority traffics when higher priority traffic has data packets to send. Performance of the proposed scheme is investigated by numerical analysis and simulation. Our results show that the proposed scheme outperforms the EDCA in terms of throughput, delay, jitter, and drop under a wide range of contention levels.