• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.769-776
• /
• 2003

DNA computing has used to solve MCP (Maximal Clique Problem). However, when current DNA computing is applied to MCP. it can't efficiently express vertices and edges and it has a problem that can't look for solutions, by misusing wrong restriction enzyme. In this paper we proposed ACO (Algorithm for Code Optimization) that applies DNA coding method to DNA computing to solve MCP's problem. We applied ACO to MCP and as a result ACO could express DNA codes of variable lengths and generate codes without unnecessary vertices than Adleman's DNA computing algorithm could. In addition, compared to Adleman's DNA computing algorithm, ACO could get about four times as many as Adleman's final solutions by reducing search time and biological error rate by 15%.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.43-43
• /
• 1995

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.49.3-49
• /
• 2001

In 1994 Adelman´s pioneer work demonstrated that deoxyribonucleic acid (DNA) could be used as a medium for computation to solve mathematical problems. He described the use of DNA based computational approach to solve the Hamiltonian Path Problem (HPP). Since then a number of combinatorial problems have been analyzed by DNA computation approaches including, for example: Maximum Independent Set (MIS), Maximal Clique and Satisfaction (SAT) Problems. In the present paper we propose a method of solving another classic combinatorial optimization problem - the eraph Coloring Problem (GCP), using specifically designed circular DNA plasmids as a computation tool. The task of the analysis is to color the graph so that no two nodes ...

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4662-4677
• /
• 2018

The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.