Synthesizing Brain-network-inspired Interconnections for Large-scale Network-on-chips

Brain network is a large-scale complex network with scale-free, small-world, and modularity properties, which largely supports this high-efficiency massive system. In this article, we propose to synthesize brain-network-inspired interconnections for large-scale network-on-chips. First, we propose a method to generate brain-network-inspired topologies with limited scale-free and power-law small-world properties, which have a low total link length and extremely low average hop count approximately proportional to the logarithm of the network size. In addition, given the large-scale applications, considering the modularity of the brain-network-inspired topologies, we present an application mapping method, including task mapping and deterministic deadlock-free routing, to minimize the power consumption and hop count. Finally, a cycle-accurate simulator BookSim2 is used to validate the architecture performance with different synthetic traffic patterns and large-scale test cases, including real-world communication networks for the graph processing application. Experiments show that, compared with other topologies and methods, the brain-network-inspired network-on-chips (NoCs) generated by the proposed method present significantly lower average hop count and lower average latency. Especially in graph processing applications with a power-law and tightly coupled inter-core communication, the brain-network-inspired NoC has up to 70% lower average hop count and 75% lower average latency than mesh-based NoCs.

Developing of Bluetooth mesh flooding between source-destination linking of nodes in wireless sensor networks

Bluetooth uses 2.4 GHz in ISM (industrial, scientific, and medical) band, which it shares with other wireless operating system technologies like ZigBee and WLAN. The Bluetooth core design comprises a low-energy version of a low-rate wireless personal area network and supports point-to-point or point-to-multipoint connections. The aim of the study is to develop a Bluetooth mesh flooding and to estimate packet delivery ratio in wireless sensor networks to model asynchronous transmissions including a visual representation of a mesh network, node-related statistics, and a packet delivery ratio (PDR). This work provides a platform for Bluetooth networking by analyzing the flooding of the network layers and configuring the architecture of a multi-node Bluetooth mesh. Five simulation scenarios have been presented to evaluate the network flooding performance. These scenarios have been performed over an area of 200×200 meters including 81 randomly distributed nodes including different Relay/End node configurations and source-destination linking between nodes. The results indicate that the proposed approach can create a pathway between the source node and destination node within a mesh network of randomly distributed End and Relay nodes using MATLAB environment. The results include probability calculation of getting a linking between two nodes based on Monte Carlo method, which was 88.7428 %, while the Average-hop-count linking between these nodes was 8. Based on the conducted survey, this is the first study to examine and demonstrate Bluetooth mesh flooding and estimate packet delivery ratio in wireless sensor networks

A Survey on Efficient Secure Routing in Industrial Network for Improved QoS

The industrial units adapt different networks for the management of their units, processes and resources. The industrial sector uses different networks for their smooth functioning which would require accessing various network services by their users, employees and customers. However, the industrial networks arenot exemptions from network threats. Number of threats exist which challenge the functioning of industrial network like DDoS (Distributed Denial of Service), black hole, eavesdrop attack and so on. Most attacks focus towards degrading the QoS performance of industrial network. To handle this, different approaches are available in literature which works based on several features like traffic, hop count, payload, service frequency, retransmission frequency, node behaviors, and location of nodes and so on. Similarly, most threats occur over the routing procedure. Towards maximizing the QoS of industrial network, it is necessary to analyze various routing protocols and their way of handling different threats. This article analyzes various routing protocols and threats towards QoS of Industrial networks.

Multicast tree construction algorithm for dynamic traffic on software defined networks

Dynamic traffic of multicast communication in the Software Defined Network environment focused less though it is more natural and practical. In multicast communication, the traffic is dynamic due to the dynamic group memberships (i.e., participants join and leave the group anytime), which are not explored much in the previous research works. The multicast in dynamic traffic requires a method to handle dynamic group membership and minimum tree alteration for every join and leave of participants from the multicast group. This paper proposes a multicast tree construction algorithm, which considers receiving devices and network capability as base parameters to construct the multicast path. The proposed routing method uses Dijkstra’s Shortest Path algorithm for initial tree formation, identifies a multicast path, and processes the Shortest Path Tree to reduce the overall hop count and path cost. The multicast tree generated by the proposed enables the dynamic join and leaves of participating devices with reduced tree alteration using more common paths to reach the devices. The implementation and results show that the proposed method works efficiently in resource utilization with a reduced hop count and quality for multicast communication in static and dynamic scenarios. Also, the results demonstrate that the proposed method generates a stable common path for multicast communication.

Named Data Networking-Based On-Demand Secure Vehicle-To-Vehicle Communications

The detection of secure vehicles for content placement in vehicle to vehicle (V2V) communications makes a challenging situation for a well-organized dynamic nature of vehicular ad hoc networks (VANET). With the increase in the demand of efficient and adoptable content delivery, information-centric networking (ICN) can be a promising solution for the future needs of the network. ICN provides a direct retrieval of content through its unique name, which is independent of locations. It also performs better in content retrieval with its in-network caching and named-based routing capabilities. Since vehicles are mobile devices, it is very crucial to select a caching node, which is secure and reliable. The security of data is quite important in the vehicular named data networking (VNDN) environment due to its vital importance in saving the life of drivers and pedestrians. To overcome the issue of security and reduce network load in addition to detect a malicious activity, we define a blockchain-based distributive trust model to achieve security, trust, and privacy of the communicating entities in VNDN, named secure vehicle communication caching (SVC-caching) mechanism for the placement of on-demand data. The proposed trust management mechanism is decentralized in nature, which is used to select a trustworthy node for cluster-based V2V communications in the VNDN environment. The SVC-caching strategy is simulated in the NS-2 simulator. The results are evaluated based on one-hop count, delivery ratio, cache hit ratio, and malicious node detection. The results demonstrate that the proposed technique improves the performance based on the selected parameters.

Wireless Network of Silver Film Lysozyme Aptasensor Based on Fractal Measurement

In this work, we reported a wireless network composed of silver film-based graphene oxide-fluorescence resonance energy transfer (GO-FRET) lysozyme aptasensor nodes. At the sensor node level, we optimized silver substrate structure, concentrations of the aptamers, and graphene oxide and tested lysozyme detection performance with a model analyte. At the network level, we analyzed the complexity and transmission success rate using fractal measurements. We implemented the wireless network composed of the aptasensor with a portable Wi-Fi fluorescent reader. Transmission success rate testing results show that an increase in node hops can promote the rate of transmission success dramatically. When the hop count is larger than 6, the rate of transmission success can reach more than 90% if the transmission failure probability and sleep probability are 0.1 and 0.5, respectively.

An Adaptive Routing Algorithm Based on Relation Tree in DTN

It is found that nodes in Delay Tolerant Networks (DTN) exhibit stable social attributes similar to those of people. In this paper, an adaptive routing algorithm based on Relation Tree (AR-RT) for DTN is proposed. Each node constructs its own Relation Tree based on the historical encounter frequency, and will adopt different forwarding strategies based on the Relation Tree in the forwarding phase, so as to achieve more targeted forwarding. To further improve the scalability of the algorithm, the source node dynamically controls the initial maximum number of message copies according to its own cache occupancy, which enables the node to make negative feedback to network environment changes. Simulation results show that the AR-RT algorithm proposed in this paper has significant advantages over existing routing algorithms in terms of average delay, average hop count, and message delivery rate.

Performance Evaluation of Routing Metrics for Community Wireless Mesh Networks

<p>With the growth of different types of Internet traffic there is a compelling need to provide better quality of service, especially, over the increasing number of wireless networks. Expected Transmission Count (ETX) is a high throughput route selection metric that measures link loss ratios. ETX of a path reflects the total number of packet transmissions (including retransmission) required to successfully deliver a data packet along that path. Expected Transmission Time (ETT) is an improvement of ETX. ETT of a path is a measure of the transmission time needed to successfully deliver a packet along the path. ETT measures the loss ratio and the bandwidth of the link. Both, ETX and ETT, in comparison to hop count, provide better route selection for routing protocols widely used in Wireless Mesh Networks (WMNs). Using minimum hop count to find the shortest path has been shown to be inadequate for WMNs, as the selected routes often include the weakest links. This thesis presents a performance evaluation comparing hop count, ETX and ETT when used with the Optimized Link State Routing version 2 (OLSRv2) protocol. This study is based on the wireless mesh topology of a suburban residential area in New Zealand, and analyses the performance of three common Internet traffic types in terms of throughput, end-to-end delay, jitter and packet loss ratio, and presents findings that are closer to the perspective of what an enduser experiences. Also, a grid network of 121 nodes was used to analyze how the metrics choose paths, the performance changes (for different path lengths) and other conditions that affect the performance of the three metrics.</p>

Performance Evaluation of Routing Metrics for Community Wireless Mesh Networks

<p>With the growth of different types of Internet traffic there is a compelling need to provide better quality of service, especially, over the increasing number of wireless networks. Expected Transmission Count (ETX) is a high throughput route selection metric that measures link loss ratios. ETX of a path reflects the total number of packet transmissions (including retransmission) required to successfully deliver a data packet along that path. Expected Transmission Time (ETT) is an improvement of ETX. ETT of a path is a measure of the transmission time needed to successfully deliver a packet along the path. ETT measures the loss ratio and the bandwidth of the link. Both, ETX and ETT, in comparison to hop count, provide better route selection for routing protocols widely used in Wireless Mesh Networks (WMNs). Using minimum hop count to find the shortest path has been shown to be inadequate for WMNs, as the selected routes often include the weakest links. This thesis presents a performance evaluation comparing hop count, ETX and ETT when used with the Optimized Link State Routing version 2 (OLSRv2) protocol. This study is based on the wireless mesh topology of a suburban residential area in New Zealand, and analyses the performance of three common Internet traffic types in terms of throughput, end-to-end delay, jitter and packet loss ratio, and presents findings that are closer to the perspective of what an enduser experiences. Also, a grid network of 121 nodes was used to analyze how the metrics choose paths, the performance changes (for different path lengths) and other conditions that affect the performance of the three metrics.</p>