• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.282-292
• /
• 2003

This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.

• Journal of Digital Contents Society
• /
• v.15 no.6
• /
• pp.663-673
• /
• 2014

The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.262-276
• /
• 2001

Recently much research for developing forwarding table that support fast router without employing both special hardware and new protocols. This article introduces a new forwarding data structure based on the software to enable forwarding lookup to be penormed at giga-bit speed. The forwarding table is known as a bottleneck of the routers penormance due to its high complexity proportional to the forwarding table size. The recent research that based on the software uses a Patricia trie and its variants. and also uses a hash function with prefix length key and others. The proposed forwarding table structure construct a forwarding table by the bit stream array in which it constructs trie from routing table prefix entries and it represents each pointer pointing the child node and the associated forwarding table entry with one bit The trie structure and routing prefix pointer need a large memory when representing those by linked-list or array. but in the proposed data structure, the needed memory size is small enough since it represents information with one bit. Additionally, by use a lookup method that start searching at desired middle level we can shorten the search path. The introduced data structure. called bit-map trie shows that we can implement a fast forwarding engine on the conventional Pentium processor by reducing the backbone routing table fits into Level 2 cache of Pentium II processor and shortens the searching path. Our experiments to evaluate the performance of proposed method show that this bit-map trie accomplishes 5.7 million lookups per second.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.5
• /
• pp.455-461
• /
• 2017

In this paper, a local DL (Data Line) sensing method with smaller parasitic capacitance replacing the previous distributed DB sensing method with large parasitic capacitance is proposed to reduce the time to transfer BL (Bit Line) voltage to DL in the read mode. A new BL switching circuit turning on NMOS switches faster is also proposed. Furthermore, the access time is reduced to 35.63ns from 40ns in the read mode and thus meets the requirement since BL node voltage is clamped at 0.6V by a DL clamping circuit instead of precharging the node to VDD-VT and a differential amplifier are used. The layout size of the designed 512Kb EEPROM memory IP based on a $0.13{\mu}m$ BCD is $923.4{\mu}m{\times}1150.96{\mu}m$ ($=1.063mm^2$).

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1053-1058
• /
• 2011

In this paper, we propose a concatenated single antenna diversity system to assure the data transmission reliability between flight type air nodes which move according to their atypical orbit, then analyze its performance. The proposed system achieve a diversity gain using single antenna and a coding gain from convolutional code simultaneously. Simulation result about the bit error rate(BER) of the proposed system shows that its BER performance is about 9.5dB greater than convolutional code at $10^{-4}$ and about 14dB greater than space time block code at $10^{-3}$ which has a full diversity gain. In addition, compared with space time trellis code with diversity gain and coding gain, the proposed system shows the better 4dB at a BER of $10^{-5}$. Therefore, it is necessary that concatenated single antenna diversity should be adopted to the reliable data transmission of flight type air nodes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.63-69
• /
• 2017

In next generation satellite broadcasting system, requirement of high throughput efficiency has been increasing continuously. To increase throughput efficiency and improve bit error performance simultaneously, FTN method and LDPC codes are employed in new sattelite standard, DVB-S3 system. This paper considered three kinds of methods for increase throughput efficiency. Firstly, as conventional one, high coding rate parity matrix in LDPC encoder is considered. Secondly, punctured coding scheme which delete the coded symbols according to appropriate rules is considered. Lastly, FTN method which transmit fater than Nyquist rate is considered. Among of three kinds of methods, FTN method is most efficient in aspect to performance while maintain same throughput efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.89-98
• /
• 2012

In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. In a 16-bit address space and the network size of a few thousands, it is very unlikely to suffer from frequent address collisions. In response, we propose an elegant (x, y, z) coordinate axes addressing scheme from divided address space of 16 bit and its routing algorithm. One of disadvantages of (x, y) coordinate axes addressing, however, is that any router may not hold as many children as proposed, since sensor nodes tend to be connected to a geographically nearby router. We also present an adaptive routing algorithm for location-aware routing algorithms, using our addressing scheme. As a result, each node was reduced not only bitwise but also multi hop using the coordinate axes while routing and the effective address assignment and routing is to minimize the average energy consumption of each node in the network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.67-72
• /
• 2014

In this paper, an energy harvesting scheme is applied in the cooperative communication. The proposed scheme uses an energy harvesting relay in which the relay harvests the energy from the source node and transfers to the power form in forwarding the received data to the destination node. The well-known maximal ratio combining (MRC) technique is applied to increase the diversity gain at the destination. Therefore, with applying the proposed energy harvesting scheme, the limited power at the relay is solved, and the operation efficiency of the network and the mobile devices is improved. Finally, performance of the proposed protocol is analyzed in terms of bit error rate, outage probability, power collection efficiency.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.317-324
• /
• 2006

In this paper, we propose a new indexing technique to solve various queries which have a strong good point not only database indexing schema take advantage of converting from semi-structured data to structured data but also performance is more faster than before. We represent structure information of XML document between nodes of tree that additional numbering information which can be bit-stream without modified structure of XML tree. And, We add in indexing schema searching incidental structure information in the process. In Querying schema, we recover ancestor nodes through give information of node using indexing schema in complete path query expression as well as relative path query expression. Therefore, it takes advantage of making derivative query expression with given query. In this process, we recognize that indexing and querying schema can get searched result set faster and more accurate. Because response time is become shorter by bit operating, when query occur and it just needs information of record set earch node in database.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.301-307
• /
• 2015

In this paper, we consider wiretap channels in the presence of an eavesdropper assuming spatially correlated MIMO(multiple-input multiple-output) channels, where we analyze a physical layer security performance of orthogonal space-time block code(OSTBC) using one-bit feedback assuming cross polarized antennas at each node. In this paper, we present a method to select a transmit-antenna group for OSTBC using one-bit feedback(O-OSTBC) and compare secrecy outage probabilities of various transmit-antenna grouping methods. Especially, we propose an efficient transmit-antenna grouping method by comparing secrecy outage probabilities of O-OSTBC and conventional OSTBC in highly correlated MIMO channels.