scholarly journals Neighborhood condition for all fractional (g, f, n′, m)-critical deleted graphs

Open Physics ◽  
2018 ◽  
Vol 16 (1) ◽  
pp. 544-553 ◽  
Author(s):  
Wei Gao ◽  
Yunqing Zhang ◽  
Yaojun Chen
Keyword(s):  
Data Transmission ◽  
Transmission Networks ◽  
Neighborhood Conditions ◽  
Transmission Rates ◽  
High Data ◽  
Critical Graph ◽  
Network Research ◽  
Neighborhood Condition ◽  
Fractional Factor ◽  
The Relationship

Abstract In data transmission networks, the availability of data transmission is equivalent to the existence of the fractional factor of the corresponding graph which is generated by the network. Research on the existence of fractional factors under specific network structures can help scientists design and construct networks with high data transmission rates. A graph G is named as an all fractional (g, f, n′, m)-critical deleted graph if the remaining subgraph keeps being an all fractional (g, f, m)-critical graph, despite experiencing the removal of arbitrary n′ vertices of G. In this paper, we study the relationship between neighborhood conditions and a graph to be all fractional (g, f, n′, m)-critical deleted. Two sufficient neighborhood conditions are determined, and furthermore we show that the conditions stated in the main results are sharp.

scholarly journals Transmit Antenna Optimization in Massive MIMO Technology with EE, SE Trade off

2019 ◽  
Vol 9 (1) ◽  
pp. 1926-1929
Keyword(s):  
Data Transmission ◽  
Massive Mimo ◽  
Search Algorithm ◽  
Antenna Selection ◽  
Gravitational Search Algorithm ◽  
Base Station ◽  
Transmit Antenna Selection ◽  
Transmission Rates ◽  
High Data ◽  
Mimo Technology

Massive MIMO Technology showed its unique characteristics and capabilities for future wireless communications where high data transmission rates are desired for fast growing 5G applications. High data transmission rates need more number of antennas at base station which comprised of increased system complexity and hardware cost. A proven method for reducing number of RF (radio frequency) chains at base station is Transmit Antenna Selection algorithm. In this paper an effective approach for TAS and optimizing the number of antennas at base station for desired data rates have been proposed and a Tradeoff between SE (Spectral Efficiency), EE (energy Efficiency) are discussed. MVGSA (modified velocity Gravitational Search algorithm) discussed for optimization of Transmit Antennas along with Improved SE and EE other effective algorithms are compared with multi objectives and data transmission rates. MVGSA proved with Improved SE and EE with Effective TAS.

scholarly journals Toughness condition for a graph to be all fractional (g,f,n)-critical deleted

Filomat ◽  
2019 ◽  
Vol 33 (9) ◽  
pp. 2735-2746 ◽  
Author(s):  
Wei Gao ◽  
Weifan Wang ◽  
Darko Dimitrov
Keyword(s):  
Data Transmission ◽  
Transmission Network ◽  
Graph Structure ◽  
Transmission Networks ◽  
The Moment ◽  
The Relationship

In data transmission networks, the feasibility of data transmission can be characterized by the existence of fractional factors. If some channels and stations are not available in the transmission network at the moment, the possibility of transmission between data is characterized by whether the corresponding graph structure of the network is critical deleted. Toughness used to measure the vulnerability and robustness of a network, which is an important parameter to be considered in network designing. In this paper, we mainly study the relationship between toughness and the all fractional critical deleted graph, and a toughness condition for a graph to be all fractional (g,f,n)-critical deleted is determined.

scholarly journals The coevolution of networks and health

2017 ◽  
Vol 5 (3) ◽  
pp. 249-256 ◽  
Author(s):  
DAVID R. SCHAEFER ◽  
JIMI ADAMS
Keyword(s):  
Human Health ◽  
Network Dynamics ◽  
Future Research ◽  
Special Issue ◽  
Causal Explanations ◽  
Network Research ◽  
Literature Highlight ◽  
The Relationship

Historically, health has played an important role in network research, and vice versa (Valente, 2010). This intersection has contributed to how we understand human health as well as the development of network concepts, theory, and methods. Throughout, dynamics have featured prominently. Even when limited to static methods, the emphasis in each of these fields on providing causal explanations has led researchers to draw upon theories that are dynamic, often explicitly. Here, we elaborate a variety of ways to conceptualize the relationship between health and network dynamics, show how these possibilities are reflected in the existing literature, highlight how the articles within this special issue expand that understanding, and finally, identify paths for future research to push this intersection forward.

QoS-Constrained Resource Allocation Scheduling for LTE Network

2015 ◽  
Vol 4 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Hung-Chin Jang ◽  
Yun-Jun Lee
Keyword(s):  
Resource Allocation ◽  
Data Transmission ◽  
Orthogonal Frequency Division Multiplexing ◽  
Transmission Rate ◽  
High Mobility ◽  
System Throughput ◽  
Frequency Division ◽  
High Data ◽  
Single Carrier ◽  
Allocation Method

The goal of LTE (Long Term Evolution) is to provide high data transmission rate, scalable bandwidth, low latency, high-mobility, etc. LTE employs OFDM (Orthogonal Frequency Division Multiplexing) and SC-FDMA (Single Carrier - Frequency Division Multiple Access) for downlink and uplink data transmission, respectively. As to SC-FDMA, there are two constraints in doing resource allocation. First, the allocated resource blocks (RBs) should be contiguous. Second, those of the allocated RBs are forced to use the same modulation technique. The aim of this research is to propose a QoS-constraint resource allocation scheduling to enhance data transmission for uplink SC-FDMA. The proposed scheduling is a three-stage approach. In the first stage, it uses a time domain scheduler to differentiate user equipment (UE) services according to their distinct QoS service requirements. In the second stage, it uses a frequency domain scheduler to prioritize UE services based on channel quality. In the third stage, it limits the number of times of modulation downgrade of RBs allocation in order to enhance system throughput. In the simulations, the proposed method is compared to fixed sub-carrier dynamic resource allocation method and adaptive dynamic sub-carrier resource allocation method. Simulation results show that the proposed method outperforms the other two methods in terms of throughput, transmission delay, packet loss ratio, and RB utilization.

scholarly journals Exploring the Relationship Between Housing Downturns and Partisan Elections: Neighborhood-Level Evidence from Maricopa County, Arizona

2019 ◽  
Vol 56 (6) ◽  
pp. 1630-1658
Author(s):  
Deirdre Pfeiffer ◽  
Jake Wegmann ◽  
Alex Schafran
Keyword(s):  
African American ◽  
Voter Turnout ◽  
Voting Behavior ◽  
Econometric Modeling ◽  
Maricopa County ◽  
Neighborhood Conditions ◽  
Senate Elections ◽  
Show Evidence ◽  
The Relationship ◽  
Neighborhood Level

An understudied outcome of foreclosure crises is how their aftershocks affect partisan elections. Two hypotheses are that partisan shifts may occur in neighborhoods with concentrated foreclosures because of (1) declines in turnout among liberal leaning voters or (2) swells of anti-incumbency among all voters. This research explores these hypotheses in Maricopa County, Arizona, by using econometric modeling to uncover associations among neighborhood foreclosures, voter turnout, and changes in the Republican vote share between the 2006 and the 2010 Arizona gubernatorial and U.S. Senate elections. Our results show evidence of (1) anti-incumbent voting behavior and more liberal shifts among neighborhoods harder hit by foreclosures and (2) conservative shifts in neighborhoods experiencing African-American and Latinx population growth. These findings are suggestive of a link between neighborhood housing market distress and neighborhood partisan shifts, which in aggregate may shape state and national policymaking and future neighborhood conditions.

scholarly journals Reliability Measurement in A Multi-path Transmission Network using SMP-BP Algorithm

2019 ◽  
Vol 15 (11) ◽  
pp. 16
Author(s):  
Xiaoling Li ◽  
Xinwei Zhou
Keyword(s):  
Data Transmission ◽  
Data Security ◽  
Network Reliability ◽  
Transmission Network ◽  
Network Resources ◽  
Minimal Path ◽  
Transmission Networks ◽  
Backup Path ◽  
Efficient Data ◽  
Reliability Measurement

Data security is very important in the multi-path transmission networks (MTN). Efficient data security measurement in MTN is crucial so as to ensure the reliability of data transmission. To this end, this paper presents an improved algorithm using single-single minimal path based back-up path (SSMP-BP), which is designed to ensure the data transmission when the second path is out of work. From the simulation study, the proposed algorithm has the better network reliability compared with existing double minimal path based backup path (DMP-BP) approach. It could be found that, the proposed algorithm uses less back-up paths compared with DMP-BP so that less network resources like nodes are achieved.

Sign in / Sign up

Export Citation Format

Share Document