Link-Disjoint Broadcasting Algorithm in Wormhole-Routed 3D Petersen-Torus Networks

In a network, one-to-all broadcasting is the process of disseminating messages from a source node to all the nodes existing in the network through successive data transmissions between pairs of nodes. Broadcasting is the most primary communication process in a network. A 3D Petersen-Torus (3D PT) network has been proposed recently. the three-dimensionally magnified Petersen-Torus topology, 3D PT, is suitable for establishing a wireless sensor network (WSN) in 3D rectangular or cylindrical structures such as buildings. We propose a link-disjoint broadcasting algorithm for half-duplex 3D PT networks with wormhole routing and prove that the broadcasting algorithm is link-disjoint and the broadcasting step is in 3D PT . 1. Introduction In wireless sensor network (WSN), after sensor nodes are deployed, they self-organize and establish routes automatically and transmit their information on their surroundings to a base station (BS). Since each sensor node has a limited and irreplaceable energy resource, energy conservation is the most important performance consideration in a WSN [1]. To decrease the energy consumption of a node, it is very important to effectively transmit collected data to a router through a sink node. For effective message transmission, a routing path should be short, without message congestion. When the routing path is long, the number of nodes used for message transmission increases, leading to additional energy consumption. Further, link congestion results in excessive energy consumption and lower transfer rate. A routing protocol influenced by node topology is crucial to reducing energy consumption. Topologies used for effective routing include star [2], peer-to-peer (P2P) [3], grid mesh [4], and hexagonal honeycomb [5]. The Petersen-Torus, a topology that connects a Petersen graph in the grid shape, involves lower network costs than both the grid mesh and the honeycomb. 3D PT, the three-dimensionally magnified Petersen-Torus topology, is suitable for establishing a wireless sensor network (WSN) in 3D rectangular or cylindrical structures such as buildings. 3D PT involves lower network costs than the 3D mesh or the 3D honeycomb [6]. This study proposes broadcasting for data transmission in a WSN topology using 3D PT. As the proposed broadcasting is edge-disjoint, it does not cause message congestion. The time complexity, which is at 3D PT , is confirmed to be efficient. It is anticipated that sequential computers will reach their physical limitations in terms of CPU speed and memory size. Over the past years, high performance computing