Securing Exposition with Parallelism in Spider-Web Networks

Abstract

Providing well exhibition spaces is essential for promoting place economy and human welfare. After the 9-11 event, awareness of the need for antiterrorism in large-scale exhibition spaces has grown. Exhibition spaces generally have a linear route for easy identification and access control for the whole area or for individual districts. Considering on such security, wayfinding feature, regular degree-three Spider-Web networks, or SW(m,n), are prototyped as identity-oriented, dual-surveillance based networks fitted along the paths of travelers to enhance security and to sustain development. Moreover, reliable supervisory communication in the wireless area or application of radio frequency identification (RFID) is systematically communicated to counter the effects of an a d v e r s a r y ' s mu l t i path radio. For any pair of bipartite nodes,spider-web networks are assumed to offer at least two mutually independent Hamiltonian paths. Their sequential-order, connectivity, and reliability in integrative area management provides the benefits of safety/security, efficient maintenance, environmental control, and human-care image due to their effective dual sensing, fault-tolerance and hamiltonian laceability.

Building Taiwan Aeropolis of Airports through Infrastructuring Care and Integrity

“…A set of Hamiltonian paths, {P 1 , P 2 , …, P k }, of G from u to v, are mutually independent if any two distinct paths in the set are independent from u to v [8]. It was found that SW(m, n) has the performance of at least two MIHPs (mutually independent Hamiltonian paths) between any pair of bipartite nodes [9]. It is noted that MIHP is considered for parallel, pact wireless information transmission, diagnosing, and offering additional ciphered information, which is considered important for offering real-time private information to logistic consigner.…”

Ubiquitous Integrity via Network Integration and Parallelism—Sustaining Pedestrian/Bike Urbanism

“…It is proved that GHT(m, n, 0), also named HReT(m, n), is 1-edge Hamiltonian if n ≥ 4; 1 p -Hamiltonian if n ≥ 6 or m = 2, n ≥ 4 [13]. When m and n are positive integers with n, m − n/2 being even, GHT(m, n, n/2) is proved 1-edge Hamiltonian if n ≥ 4; 1 p -Hamiltonian if n ≥ 6 or m = 2, n ≥ 4 [14]. Besides, SW(m, n) is proved 1-edge Hamiltonian, 1 p -Hamiltonian [15].…”

Networking scalable parallelism, integrity in knowledge economy — Civilization from shuyuans toward ubiquitous university cities

“…Such a feature is also considered for secret communications [19,20]. It is proved that SW(m,n) has MIHP performance [9]; and it is believed that GHT(m,n,0) and GHT(m,n,n/2) can have such performance if nodes are enough (e.g. more than 16).…”