Energy-Efficient Modified Bellman Ford Algorithm for Grid and Random Network Topologies

2015 ◽  
pp. 143-151
Author(s):  
Rama Devi Boddu ◽  
K. Kishan Rao ◽  
M. Asha Rani
Keyword(s):  
Energy Efficient ◽  
Random Network ◽  
Network Topologies

scholarly journals Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Xiuwen Fu ◽  
Yongsheng Yang ◽  
Haiqing Yao
Keyword(s):  
Random Network ◽  
Small World ◽  
Coupled Map Lattice ◽  
Wireless Sensor ◽  
Cascading Failures ◽  
Scale Free Network ◽  
Scale Free ◽  
Network Topologies ◽  
Free Network ◽  
Entire Network

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, max-degree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.

scholarly journals Influence of Autapses on Synchronization in Neural Networks With Chemical Synapses

2020 ◽  
Vol 14 ◽  
Author(s):  
Paulo R. Protachevicz ◽  
Kelly C. Iarosz ◽  
Iberê L. Caldas ◽  
Chris G. Antonopoulos ◽  
Antonio M. Batista ◽  
...  
Keyword(s):  
Neural Networks ◽  
Random Network ◽  
Inhibitory Neurons ◽  
Neural Dynamics ◽  
Excitatory Synapses ◽  
Closed Loops ◽  
Integrate And Fire ◽  
Network Topologies ◽  
Chemical Synapses ◽  
Synchronous Behavior

A great deal of research has been devoted on the investigation of neural dynamics in various network topologies. However, only a few studies have focused on the influence of autapses, synapses from a neuron onto itself via closed loops, on neural synchronization. Here, we build a random network with adaptive exponential integrate-and-fire neurons coupled with chemical synapses, equipped with autapses, to study the effect of the latter on synchronous behavior. We consider time delay in the conductance of the pre-synaptic neuron for excitatory and inhibitory connections. Interestingly, in neural networks consisting of both excitatory and inhibitory neurons, we uncover that synchronous behavior depends on their synapse type. Our results provide evidence on the synchronous and desynchronous activities that emerge in random neural networks with chemical, inhibitory and excitatory synapses where neurons are equipped with autapses.

scholarly journals An Energy-Efficient Transmission Protocol for RNC-Based Cooperative WSNs with Partial Energy Harvesting Nodes

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Yulun Cheng ◽  
Longxiang Yang
Keyword(s):  
Energy Efficiency ◽  
Energy Harvesting ◽  
Energy Efficient ◽  
Random Network ◽  
Wireless Sensor ◽  
Transmission Protocol ◽  
Random Network Coding ◽  
Transmission Reliability ◽  
Partial Energy ◽  
Efficient Transmission

This paper addresses the energy-efficient transmission for the scenario of cooperative wireless sensor networks with partial energy harvesting (EH) nodes. A new EH decoding-recoding policy is proposed by regarding the EH constraints and the characteristics of random network coding. We develop an energy efficiency model to investigate the tradeoff mechanism between the saved energy and the waiting time of the EH node, through which the corresponding parameters in the policy are also optimized. Moreover, we propose a novel transmission protocol by embedding the considered policy in the opportunistic reception algorithm. The decoding failure probability is then derived to examine its transmission reliability. The obtained theoretical and simulation results indicate that the proposed protocol achieves superiority in energy efficiency; meanwhile, it can also provide similar transmission reliability under specific conditions, as compared to the conventional algorithms in the two-hop model.

scholarly journals The integration research of pre-multicast method and adaptive routing protocol with random network coding based on the OMNeT++ platform

2018 ◽  
Vol 189 ◽  
pp. 04007
Author(s):  
Qing Nie ◽  
Kai Song ◽  
Fei Gao
Keyword(s):  
Network Coding ◽  
Routing Protocol ◽  
Network Performance ◽  
Random Network ◽  
Adaptive Routing ◽  
Network Resources ◽  
Random Network Coding ◽  
Intermediate Node ◽  
Network Topologies ◽  
Network Transmission

In this paper, both the pre-multicast method and the adaptive routing protocol are proposed. The random network coding with these protocols are not only more stable and reliable, but also improves the utilization of network resources. According to the function of the nodes in the network, this paper establishes the source node model, the intermediate node model and the sink node model based on the OMNeT++ simulation platform. In particular, in this paper, both pre-multicast and adaptive routing modules are combined in the node model. By the simulation, using or not using both pre-multicast module and adaptive routing module in the network transmission module, the network transmission reliability is analyzed. The network performance, such as delay and effective throughput, is evaluated to verify the expected results. Because the designed node models are independent of each other, they can be applied to most real network topologies. Researchers can also modify a module of a model or improve an algorithm to achieve more complex functions according to their own needs.

scholarly journals Quantitative Controllability Index of Complex Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Lifu Wang ◽  
Yali Zhang ◽  
Jingxiao Han ◽  
Zhi Kong
Keyword(s):  
Complex Networks ◽  
Condition Number ◽  
Random Network ◽  
Small World ◽  
Scale Free Network ◽  
Scale Free ◽  
Network Topologies ◽  
Free Network ◽  
The Relationship ◽  
Controllability Index

In this paper, the controllability issue of complex network is discussed. A new quantitative index using knowledge of control centrality and condition number is constructed to measure the controllability of given networks. For complex networks with different controllable subspace dimensions, their controllability is mainly determined by the control centrality factor. For the complex networks that have the equal controllable subspace dimension, their different controllability is mostly determined by the condition number of subnetworks’ controllability matrix. Then the effect of this index is analyzed based on simulations on various types of network topologies, such as ER random network, WS small-world network, and BA scale-free network. The results show that the presented index could reflect the holistic controllability of complex networks. Such an endeavour could help us better understand the relationship between controllability and network topology.

scholarly journals Network Topology Models for Multihop Wireless Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-23 ◽  
Author(s):  
András Faragó
Keyword(s):  
Wireless Networks ◽  
Network Topology ◽  
Online Social Networks ◽  
Overlay Networks ◽  
Random Network ◽  
Typical Feature ◽  
General Nature ◽  
Levels Of Abstraction ◽  
Special Cases ◽  
Network Topologies

A typical feature of huge, random network topologies is that they are too large to allow a fully detailed description. Such enormous, complex network topologies are encountered in numerous settings and have generated many research investigations. Well-known examples are the Internet and its logical overlay networks, such as the World Wide Web as well as online social networks. At the same time, extensive and rapidly growing wireless ad hoc and sensor networks also lead to hard topology modeling questions. In the current paper, we primarily focus on large, random wireless networks but also consider Web and Internet models. We survey a number of existing models that aim at describing the network topology. We also exhibit common generalizations of various sets of models that cover a number of known constructions as special cases. We demonstrate that higher levels of abstraction, despite their very general nature, can still be meaningfully analyzed and offers quite useful and unique help in solving certain hard networking problems. We believe that this research area can and will generate further significant contributions to the analysis of very large networks.

Sign in / Sign up

Export Citation Format

Share Document