Broadcasting Algorithms of Carbon Nanotubes

A carbon nanotube is like a cylinder rolled up from a single sheet of graphite, whose atoms are arranged in hexagons. It is expected that nanotechnology will revolutionize the computing, networking and telecommunication industries by producing faster and smaller non-silicon-based chipsets, memory, processors, and new-generation computers based on carbon nanotubes. Computer scientists predict that nano-computers will radically transform the computer industry in the coming years. The next target of computer engineers and scientists is parallel processors using nanotechnology. Nano-computing which is the computational aspect of nano architectures is an emerging technology and is at the early stage of its development. Keeping these latest trends in mind, we propose to study the computational aspects of nanotechnology-based fixed interconnection networks. In this paper, carbon nanotube is proposed as a new fixed interconnection architecture. The structural properties of carbon nanotube networks are studied. One of the important features of a good interconnection network is that it is communication-friendly topological structure. A routing algorithm in a communication friendly topological structure helps to exchange messages between any two processors without any bottlenecks. This paper provides a broadcasting algorithm which runs in optimal time plus 1. Another interesting attribute of an interconnection network is service-facility design which is also called domination problem. This paper exhibits that carbon nanotube architecture is communication-friendly and service-facility-friendly.