%0 Journal Article
%T One-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks
%A Jung-Hyun Seo
%A Hyun Sim
%A Dae-Heon Park
%A Jang-Woo Park
%A Yang-Sun Lee
%J Sensors
%D 2011
%I MDPI AG
%R 10.3390/s110201959
%X As wireless mobile telecommunication bases organize their structure using a honeycomb-mesh algorithm, there are many studies about parallel processing algorithms like the honeycomb mesh in Wireless Sensor Networks. This paper aims to study the Peterson-Torus graph algorithm in regard to the continuity with honeycomb-mesh algorithm in order to apply the algorithm to sensor networks. Once a new interconnection network is designed, parallel algorithms are developed with huge research costs to use such networks. If the old network is embedded in a newly designed network, a developed algorithm in the old network is reusable in a newly designed network.£¿Petersen-Torus has been designed recently, and the honeycomb mesh has already been designed as a well-known interconnection network. In this paper, we propose a one-to-one embedding algorithm for the honeycomb mesh (HMn) in the Petersen-Torus PT(n,n), and prove that dilation of the algorithm is 5, congestion is 2, and expansion is 5/3. The proposed one-to-one embedding is applied so that processor throughput can be minimized when the honeycomb mesh algorithm runs in the Petersen-Torus.
%K embedding
%K honeycomb mesh
%K Petersen-Torus
%K interconnection network parallel processing
%U http://www.mdpi.com/1424-8220/11/2/1959