Explaining the emergence of complex networks through log-normal fitness in a Euclidean node similarity space

Networks of disparate phenomena—be it the global ecology, human social institutions, within the human brain, or in micro-scale protein interactions—exhibit broadly consistent architectural features. To explain this, we propose a new theory where link probability is modelled by a log-normal node fitness (surface) factor and a latent Euclidean space-embedded node similarity (depth) factor. Building on recurring trends in the literature, the theory asserts that links arise due to individualistic as well as dyadic information and that important dyadic information making up the so-called depth factor is obscured by this essentially non-dyadic information making up the surface factor. Modelling based on this theory considerably outperforms popular power-law fitness and hyperbolic geometry explanations across 110 networks. Importantly, the degree distributions of the model resemble power-laws at small densities and log-normal distributions at larger densities, posing a reconciliatory solution to the long-standing debate on the nature and existence of scale-free networks. Validating this theory, a surface factor inversion approach on an economic world city network and an fMRI connectome results in considerably more geometrically aligned nearest neighbour networks, as is hypothesised to be the case for the depth factor. This establishes new foundations from which to understand, analyse, deconstruct and interpret network phenomena.

Energy Aware Hierarchal Data Aggregation and Trust Based Data Integrity Verification for WSN

Currently the demand of wireless sensor networks has gained huge attraction due to its wide range of applications. Generally, these nodes are equipped with limited power resource and deployed in harsh environment where replacing these resources is a tedious task. Due to these issues, minimizing the energy consumption is a prime task to prolong the network lifetime. To overcome the challenging issue of data aggregation we introduced a novel combined mechanism which performs clustering and trust computing process to improve the data aggregation. According to this scheme, we arrange the nodes as normal node, advanced node and super nodes based on their residual energy parameters. The proposed model uses hierarchal scheme where we present a new mechanism for optimal number of cluster formation and cluster head selection. After selecting the cluster head, we apply trust computation scheme which provides sensing trust, link trust and node trust. The node trust is computed as direct and indirect trust. This trust mechanism is used as hop-by-hop manner to maintain he data integrity. The experimental study shows that proposed approach achieves better performance and maintains the security aspects of WSN.

A Distributed Image Compression Scheme for Energy Harvesting Wireless Multimedia Sensor Networks

As an emerging technology, edge computing will enable traditional sensor networks to be effective and motivate a series of new applications. Meanwhile, limited battery power directly affects the performance and survival time of sensor networks. As an extension application for traditional sensor networks, the energy consumption of Wireless Multimedia Sensor Networks (WMSNs) is more prominent. For the image compression and transmission in WMSNs, consider using solar energy as the replenishment of node energy; a distributed image compression scheme based on solar energy harvesting is proposed. Two level clustering management is adopted. The camera node-normal node cluster enables camera nodes to gather and send collected raw images to the corresponding normal nodes for compression, and the normal node cluster enables the normal nodes to send the compressed images to the corresponding cluster head node. The re-clustering and dynamic adjustment methods for normal nodes are proposed to adjust adaptively the operation mode in the working chain. Simulation results show that the proposed distributed image compression scheme can effectively balance the energy consumption of the network. Compared with the existing image transmission schemes, the proposed scheme can transmit more and higher quality images and ensure the survival of the network.

Enhanced MSEEC routing protocol using tabu search with static and mobile nodes in WSN

Background Background of this paper has taken place in mainly heterogeneous network in which three types of nodes are present like normal node, advance node and super node with different amount of energy. The energy of super node is greater than that of advance and normal nodes and the energy of advance nodes are also greater than that of normal nodes in the designed network. The optimization techniques have to be studied from the swarm intelligence based on the different aspects of routing. Objective: The objective of this paper is to propose a new heterogeneous protocol with the help of hybrid meta-heuristic technique. In this technique, the shortest route has been selected and forwarded the data to the sink in a minimal time span to save the energy and make the network more stable. Method: To evaluate the technique, a new hybrid technique has been created, where the data transmission is implemented from the beginning. This technique contains the route process of the algorithm which was made available through a hybrid meta-heuristic technique. Results: Simulation results show that the hybrid meta-heuristic technique has high throughput with less number of dead nodes with existing methods and also show that the efficiency and stability of new proposed protocol. Conclusion The conclusion to this paper is a novel, energy-efficient technique applied for randomly deployed sensor nodes over the wireless sensor network and enhancement has been done in stability and throughput of a new proposed algorithm in case of static as well as moving nodes.

Utilization of Energy Consumption Metric to Detect Black Hole Attacker in DSR Routing Protocol

A Mobile Adhoc Network (MANET) is a self-organized system comprised of multiple mobile wireless nodes. They do not require the existing network infrastructure. Autonomous telescopes can change freely and inadvertently in a network that can establish a dynamic network temporarily, and these networks can often change their appearance. Due to the openness in network topology and the absence of centralized administration in management, MANET is vulnerable to attacks from malicious nodes. Therefore, security is a major issue in MANET, which drastically reduces network performance. Several trust parameters such as packet delivery ratio, packet dropping ratio, etc are used for detecting the malicious node attack in MANET. Among these, this paper uses the energy as the trust parameter for detecting the malicious node. The energy reduction ratio differs from the normal node and attacker node in MANET. Hence, the main aim of this paper is to find the Normal Energy Reduction Ratio (NERR) and Attacker Energy Reduction Ratio (AERR). These two values are used for differentiating the normal node and attacker node in MANET. For routing, this paper uses the Dynamic Source Routing (DSR) Protocol.

Detection and Countermeasure of Packet Misrouting in Wireless Adhoc Networks

A MANET is an infrastructure-less type network, which consists of number of mobile nodes connected through wireless network interfaces. The Communication among nodes is made successfully when the nodes dynamically set up route among one another. The open nature and infrastructureless type of such networks causes the attacker's interest to penetrate through the network and decrease the network performance. Thus Security becomes a major concern for protected communication between mobile nodes. Packet misrouting stops the packet from reaching the destination by a malicious intermediate node. But the malicious node makes the intuition to its neighbors that it has done the genuine packet forwarding action. Moreover the malicious node makes the neighbours to suspect the normal node as malicious one. The proposed work ensures the detection of malicious nodes and avoids suspecting the trustworthy.

Analysis of Spam Transaction on the Blockchain

Background/Objectives: The blockchain has been applied to many fields. Users are concerned about its security. The primary goal of this study is supporting the security service to protect DDoS attack.Methods/Statistical analysis: To provide security service in the blockchain, the security model is suggested. This model can filter out illegitimate traffic and exchange information with other security switches to determine whether a connected node is a normal node or an abnormal node. Each procedure of the proposed model has been described. Also, two different attack types are used to show the operation process of suggested model.Findings: Cyberattacks attempting to impact technology services availability continue to increase. Thus, DDoS is one of the most common type of attacks can also cause the most disruption to internet services. But blockchain has the characteristics of decentralization and peer to peer. This makes it harder to disrupt than conventional distributed application. Nevertheless, DDoS attacks remain a persistent threat. Therefore, a security model is suggested which can effectively block and respond to DDoS attacks.Improvements/Applications: The suggested model makes it possible to protect the spam transaction attacks in blockchain network.

Intersection and Complement Set (IACS) Method to Reduce Redundant Node in Mobile WSN Localization

The majority of the Wireless Sensor Network (WSN) localization methods utilize a large number of nodes to achieve high localization accuracy. However, there are many unnecessary data redundancies that contributes to high computation, communication, and energy cost between these nodes. Therefore, we propose the Intersection and Complement Set (IACS) method to reduce these redundant data by selecting the most significant neighbor nodes for the localization process. Through duplication cleaning and average filtering steps, the proposed IACS selects the normal nodes with unique intersection and complement sets in the first and second hop neighbors to localize the unknown node. If the intersection or complement sets of the normal nodes are duplicated, IACS only selects the node with the shortest distance to the blind node and nodes that have total elements larger than the average of the intersection or complement sets. The proposed IACS is tested in various simulation settings and compared with MSL* and LCC. The performance of all methods is investigated using the default settings and a different number of degree of irregularity, normal node density, maximum velocity of sensor node and number of samples. From the simulation, IACS successfully reduced 25% of computation cost, 25% of communication cost and 6% of energy consumption compared to MSL*, while 15% of computation cost, 13% of communication cost and 3% of energy consumption compared to LCC.

Range-Free Localization Schemes for Wireless Sensor Networks

<span lang="EN-US">Localization of nodes is one of the key issues of wireless sensor network (WSN) that gained a wide attention in recent years. The existing localization techniques can be generally categorized into two types: range-based and range-free. Compared with rang-based schemes, the range-free schemes are more cost-effective, because no additional ranging devices are needed. As a result, we focus our research on the range-free schemes. In this paper we study three types of range-free location algorithms to compare the localization error and energy consumption of each one. Centroid algorithm requires a normal node has at least three neighbor anchors, while DV-hop algorithm doesn’t have this requirement. The third studied algorithm is the amorphous algorithm similar to DV-Hop algorithm, and the idea is to calculate the hop distance between two nodes instead of the linear distance between them .The simulation results show that the localization accuracy of the amorphous algorithm is higher than that of other algorithms and the energy consumption does not increase too much. </span>