An Efficient Content Store-Based Forwarding Scheme for Internet of Things

One of the main advantages of information-centric networking (ICN) is that a requested piece of content can be retrieved from a content store (CS) at any intermediate node, instead of its original content producer. In existing ICN designs, nodes forward Interest packets mainly based on forwarding information base (FIB). FIB is constructed from name prefixes registered by content producers with a list of next hops to the name prefixes. The ICN forwarding engine uses those information to forward Interest packets towards corresponding content producers. CS information of a node is currently used only for checking the availability of cached content objects at the node and is not considered in the data plane of existing ICN forwarding mechanisms. This paper highlights the importance of CS information in an ICN forwarding mechanism and enables neighbor CS information in the data plane to improve the cache hit ratio and forwarding efficiency, especially for resource-constraint Internet of Things (IoT). We propose an efficient CS-based forwarding scheme for IoT. The proposed forwarding scheme exploits CS information of neighbors to find efficient routes to forward Interest packets toward nearby nodes with corresponding cached content. For that, we carefully design an efficient way for CS information sharing using counting bloom filter. We implement the proposed scheme and compare with state-of-the-art ICN forwarding schemes in IoT. Experimental results indicate that the proposed forwarding scheme achieves a significant improvement in terms of cache hit ratio, energy efficiency, content retrieval latency, and response rate.

Certificateless Multisignature Scheme Suitable for Network Coding

Network coding can save the wireless network resources and improve the network throughput by combining the routing with coding. Traditional multisignature from certificateless cryptosystem is not suitable for the network coding environment. In this paper, we propose a certificateless multisignature scheme suitable for network coding (NC-CLMSS) by using the sequential multisignature and homomorphic hash function. NC-CLMSS is based on the CDH and ECDL problems, and its security is detailedly proved in the random oracle (RO) model. In NC-CLMSS, the source node generates a multisignature for the message, and the intermediate node linearly combines the receiving message. NC-CLMSS can resist the pollution and forgery attacks, and it has the fixed signature length and relatively high computation efficiency.

QoS Improvement Using In-Network Caching Based on Clustering and Popularity Heuristics in CCN

Content-Centric Networking (CCN) has emerged as a potential Internet architecture that supports name-based content retrieval mechanism in contrast to the current host location-oriented IP architecture. The in-network caching capability of CCN ensures higher content availability, lesser network delay, and leads to server load reduction. It was observed that caching the contents on each intermediate node does not use the network resources efficiently. Hence, efficient content caching decisions are crucial to improve the Quality-of-Service (QoS) for the end-user devices and improved network performance. Towards this, a novel content caching scheme is proposed in this paper. The proposed scheme first clusters the network nodes based on the hop count and bandwidth parameters to reduce content redundancy and caching operations. Then, the scheme takes content placement decisions using the cluster information, content popularity, and the hop count parameters, where the caching probability improves as the content traversed toward the requester. Hence, using the proposed heuristics, the popular contents are placed near the edges of the network to achieve a high cache hit ratio. Once the cache becomes full, the scheme implements Least-Frequently-Used (LFU) replacement scheme to substitute the least accessed content in the network routers. Extensive simulations are conducted and the performance of the proposed scheme is investigated under different network parameters that demonstrate the superiority of the proposed strategy w.r.t the peer competing strategies.

Relay Selection-and-Jamming Scheme with Nonlinear Energy Harvesting

When direct source-destination communications are in outage, relay selection is a preferable solution to improve reliability for this communications. However, such a relay selection makes the eavesdropper better overhear source data through both source-relay and relay-destination communication hops, losing data security. To improve both reliability and security, this paper proposes a relay selection-and-jamming (RaJ) scheme to select one intermediate node as a conventional relay and another node as a jammer. To enhance energy efficiency, all intermediate nodes harvest radio frequency energy in source signals for their operations with nonlinear energy harvesting (NL-EH). The security and reliability of the RaJ scheme are assessed through suggested rigorous/asymptotic expressions and are significantly better than two benchmark schemes without neither jamming nor both relay selection and jamming. Additionally, they can be optimized with reasonable selection of specifications. Moreover, the NL property of the energy harvesters dramatically affects the reliability but negligibly degrades the security for the RaJ scheme. Furthermore, the linear EH (L-EH) is more reliable but less secure than the NL-EH.

A Linear High Frequency gm Boosting Wideband LNA in 130 nm SiGe HBT with Minimum NF of 4.3 dB for WiGig Application

This paper presents an inductor less wideband low noise amplifier (LNA) with an area of 0.3[Formula: see text]mm2, using 130[Formula: see text]nm SiGe BiCMOS technology targeted for 5G WiGig wireless application. A [Formula: see text] boosting amplifier used at the intermediate node of the cascode topology to reduce the noise contribution of the common base (CB) transistor for the first time in SiGe HBT technology. Mathematical analysis shows that the proposed high frequency [Formula: see text] boosting technique on the CB transistor can be optimally tuned for either low NF or high linearity. Furthermore, the circuit incorporates variable capacitors for multimode capability, ensuring optimal performance in all four WiGig channels. Post layout EM simulation of the circuit shows that the resultant LNA has a maximum gain of 21.08[Formula: see text]dB with the [Formula: see text]3 dB frequency over 56[Formula: see text]GHz to 67.3[Formula: see text]GHz. The proposed LNA exhibits a minimum noise figure of 4.3[Formula: see text]dB and shows high linearity with an input referred [Formula: see text] of [Formula: see text]2.7[Formula: see text]dB. The designed when operated using supply voltage of 1.2[Formula: see text]V consumes a total dc power of 8.9[Formula: see text]mW.

Blockchain Technology for Secured Healthcare Data Communication among the Non-Terminal Nodes in IoT Architecture in 5G Network

In the contemporary world, with ever-evolving internet models in the process of automating and digitalizing various industrial and domestic implementations, the Internet of Things (IoT) has made remarkable advancements in sharing the healthcare data and triggering the associated necessary actions. Healthcare-related data sharing among the intermediate nodes, privacy, and data integrity are the two critical challenges in the present-day scenario. Data needs to be encrypted to ensure the confidentiality of the sensitive information shared among the nodes, especially in the case of healthcare-related data records. Implementing the conventional encryption algorithms over the intermediate node may not be technically feasible, and too much burden on the intermediate nodes is not advisable. This article has focused on various security challenges in the existing mechanism, existing strategies in security solutions for IoT driven healthcare monitoring frameworks and proposes a context-aware state of art model based on Blockchain technology that has been deployed for encrypting the data among the nodes in the architecture of a 5G network. The proposed strategy was examined through various performance evaluation metrics, and the proposed approach had outperformed compared to its counterparts.

Anthoc Based Trust Behavioural Network (Anthoc-tbn) Assist to Detect Blackhole Attack by Discover Secure Route

MANET is a wireless topology mainly used to grouping several mobile nodes as network. This wireless network is highly vulnerable by several security threads. Blackhole attack, a severe thread that voluntarily disrupts the healthy nodes and turn it as malicious node. So, introducing security mechanism can forcefully work together to defeat the black hole attack. In this paper, a new approach of AntHoc based trust behavioural network (AntHoc-TBN) model is introduced. This model effectively discovers the route with trust based packet transmission take place. Here, the forward ant agent performs shortest distance computation to discover the route. So that, Dijikstra algorithm is employed to detect the shortest route of all other nodes from source. Then, trust procedure is applied to find that corresponding node is trustable or not. Based on trust threshold, the respective intermediate node is computed and stored the updated value in extended data routing information (EDRI) table. Once the condition is not satisfied, then updated value in EDRI table tends to be distrust node and the concerned node is eliminated from the routing table. Now, the trusted node becomes an active path after that the packet has to be sent. Likewise, the same process is repeated for backward ant agent to transfer the Ack message from destination to source. To simulate the process, the result reveals that the AntHoc-TBN model improves its efficiency by lowest delay, packet loss and routing overhead. And also, the technique gets highest value of packet delivery ratio. The performance measures of our proposed model achieves better outcome when compared to existing techniques such as AODV, AntNet and AntHoc Net.

The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation

All-optical networks transmit messages along lightpaths in which the signal is transmitted using the same wavelength in all the relevant links. We consider the problem of switching cost minimization in these networks. Specifically, the input to the problem under consideration is an optical network modeled by a graph G, a set of lightpaths modeled by paths on G, and an integer g termed the grooming factor. One has to assign a wavelength (modeled by a color) to every lightpath, so that every edge of the graph is used by at most g paths of the same color. A lightpath operating at some wavelength λ uses one Add/Drop multiplexer (ADM) at both endpoints and one Optical Add/Drop multiplexer (OADM) at every intermediate node, all operating at a wavelength of λ. Two lightpaths, both operating at the same wavelength λ, share the ADMs and OADMs in their common nodes. Therefore, the total switching cost due to the usage of ADMs and OADMs depends on the wavelength assignment. We consider networks of ring and path topology and a cost function that is a convex combination α·|OADMs|+(1−α)|ADMs| of the number of ADMs and the number of OADMs deployed in the network. We showed that the problem of minimizing this cost function is NP-complete for every convex combination, even in a path topology network with g=2. On the positive side, we present a polynomial-time approximation algorithm for the problem.

Node Selection Algorithm for Network Coding in the Mobile Wireless Network

In the multicast network, network coding has proven to be an effective technique to approach maximum flow capacity. Although network coding has the advantage of improving performance, encoding nodes increases the cost and delay in wireless networks. Therefore, minimizing encoding nodes is of great significance to improve the actual network’s performance under a maximum multicast flow. This paper seeks to achieve partial improvements in the existing selection algorithm of encoding nodes in wireless networks. Firstly, the article gives the condition for an intermediate node to be an encoding node. Secondly, a maximum flow algorithm, which depends on the depth-first search method, is proposed to optimize the search time by selecting the larger augmentation flow in each step. Finally, we construct a random graph model to simulate the wireless network and the maximum multicast flow algorithm to analyze the statistical characteristics of encoding nodes. This paper aims at the optimization to find the minimal number of required coding nodes which means the minimum energy consumption. Meanwhile, the simulations indicate that the curve of coding nodes tends to be a geometric distribution, and that the curve of the maximum flow tends to be symmetric as the network scale and the node covering radius increase.

Multipath Reliable Routing Using Cluster Based Communication

In this research we proposed the protection in ANT Optimized primarily based multipath congestion routing performance. Here the situation of DDoS is simulated and examines their impact in dynamic network. The multipath protocol like AOMDV is balance the all load by way of offering alternative path however not knowledgeable at each and every condition. The DDoS attacker is blocking off the whole viable direction in community by way of flooding large quantity of redundant packets in dynamic network. The attacker is that the intermediate node and this attacker contamination is continuously dispersing infection and the entire network overall performance is dumped. The proposed security scheme is identified attacker and their loss effect. Attacker is utterly disabled by way of proposed protection mechanism and their loss is also evaluated. The proposed approach is now not only detecting but also stop community from DDoS attack. The overall performance of protection scheme and assault is measured in three distinctive scenarios of a range of node densities. The proposed scheme is offers attacker free routing and get better network performance after making use of it. The performance of ANT OPTIMIZED is almost equal. The packets receiving, throughput, and PDR are bettering but the loss of packets and unnecessary flooding is decreased in dynamic network.