Analysis of Strategies to Improve Traffic Conditions in the Ancient Urban Area of Suzhou

In this paper, the authors first analyse the problems existing in the situation of land use, structure of travel mode and road network by applying the basic principle of traffic engineering and system engineering methods. Then, the authors make it clear the strategies to be adopted for solving the existing traffic problems in the ancient urban area of Suzhou(AUAS), namely insisting on the goal based strategy; the strategy to develop the public transit system in priority and decreasing the demand on cars from the view point of land use strategy. On the basis of such analysis the authors put forth proposals about major measures to be taken to improve traffic conditions of the AUAS, such as construction of express artery ring around the ancient city, appropriate transformation of the roads in the AUAS and rational distribution of car parking areas at the outskirt, which are of positive significance in guiding the protection of the AUAS and transportation construction. In this paper, specialized software is used to establish criteria for the construction scale and extent analysis and evaluation of the ancient city construction project, which is of some reference significance to the transformation of old urban areas in other cities.

Spatial Analysis of Commuting Mode Choice in Guangzhou, China

Metropolitan cities in China are commonly confronted with unresolved traffic congestion issues, primarily due to rapidly increasing traffic demand. Group disparity between commuting mode choice and its spatial distribution on road networks has enabled us to examine the factors that give rise to the discrepancies and the fundamental spatial causes of traffic congestion. In recent years, mi- cro-perspective, individual, and behavior-based spatial analysis have mushroomed and been facilitated with effective tools such as tem- poral geographic information systems （T-GIS）. It is difficult to study the interrelations between transport and space on the basis of commuting mode choice since the mode choice data are invisible in a specific space such as a particular road network. Therefore, in the field of transport, the classical origin destination （OD） four-stage model （FSM） is usually employed to calculate data when studying commuting mode choice. Based on the relative principles of T-GIS and the platform of ArcGIS, this paper considers Guangzhou as a case study and develops a spatio-temporal tool to examine the daily activities of residents. Meanwhile, the traffic volume distribution in rush hours, which was analyzed according to commuting modes and how they were reflected in the road network, was scrutinized with data extracted from travel diaries. Moreover, efforts were made to explain the relationship between traffic demand and urban spatial structure. Based on the investigation, this research indicates that traffic volumes in divergent groups and on the road networks is driven by： l） the socio-economie characteristics of travelers; 2） a jobs-housing imbalance under suburbanization; 3） differences in the spatial supply of transport modes; 4） the remains of the Danwei （work unit） system and market development in China; and 5） the transition of urban spatial structure and other factors.

Optimal operation of water distribution networks under local pipe failures

The optimal operation of water distribution networks under local pipe failures, such as water main breaks, was proposed. Based on a hydraulic analysis and a simulation of water distribution networks, a macroscopic model for a network under a local pipe failure was established by the statistical regression. After the operation objectives under a local pipe failure were determined, the optimal operation model was developed and solved by the genetic algorithm. The program was developed and examined by a city distribution network. The optimal operation alternative shows that the electricity cost is saved approximately 11%, the income of the water corporation is increased approximately 5%, and the pressure in the water distribution network is distributed evenly to ensure the network safe operation. Therefore, the proposed method for optimal operation under local pipe failure is feasible and cost-effective.

Performance of a Dual-Hop Multi-relay Cooperative Network in a Nakagami-m Fading Environment

An exact average symbol error rate analysis for the distributed dual-hop relay cooperative network with multiple relays in a Nakagami-m fading environment is presented.In the derivation of the moment generation function of receiver Signal-to-Noise Ratio(SNR),the sectional integral method is used,instead of the cumulative density function method which is ordinarily used by the deduction of the outage probability of S-R-D link.The accurate symbol error rate of a dual-hop relay cooperative network is obtained with the closed-form Moment Genoration Function (MGF) expression.The correctness of the symbol error rate is verified through numerical simulations and is compared with other analytical methods.These deductions clearly show that the distributed cooperative diversity network presented has strong superiorities in overcoming severe fading and can achieve full diversity order.

Distributed Low-Complexity Channel Assignment for Opportunistic Routing

Opportunistic Routing (OR) involves multiple forwarding candidates to relay packets by taking advantage of the broadcast nature and multi-user diversity of a wireless medium. Compared with Traditional Routing (TR), OR is more suitable in the case of an unreliable wireless link and can evidently improve the end-to-end throughput of Wireless Mesh Networks (WMNs). In this paper, we focus on OR in Multi-Radio Multi-Channel WMNs (MRMC-WMNs). This problem has not been well examined and is considerably more challenging than the OR in single-radio wireless networks considered in the existing literature. First, we validate the advantage of OR in MRMC-WMNs. Second, we propose Low-complexity Channel Assignment for Opportunistic Routing (LcCAOR), which assigns channels to flows according to the interference state of every node. Third, we implement the LcCOAR in a fully distributed manner. The simulation result shows that compared with OR in Single-Radio Single-Channel WMNs (SRSC-WMNs), the proposed OR can significantly enhance the throughput to 87.11% and 100.3% in grid and tree WMNs, respectively.

A distributed routing algorithm based-on simplified topology in LEO satellite networks

In this paper, a distributed muting strategy based on simplified topology （DRBST） was proposed for LEO satellite networks. The topology of LEO satellite networks was simplified aiming at minimizing intersatellite links handover number. To optimize the route based on the simplified topology, we considered not only the transmission delay but also the queuing delay and the processing delay, which were analyzed using Markov chain and determined using a novel methodology. The DRBST algorithm was simulated in a LEO satellite networks model built using OPNET. The simulation results demonstrate that the low complexity DRBST algorithm can guarantee end-to-end delay bound. Moreover, the muting protocol cost is much less than traditional algorithms.

Outage performance of OFDM-based selective decode-and-forward cooperative networks over Weibull fading channels

The outage performance of OFDM-based decode-and-forward cooperative networks is studied. The channels are modeled as independent Weibull distributed coefficients. A closed-form expression for the outage probability is obtained for three selective relaying schemes in the Weibull fading channels and a derived optimum power allocation method based on the closed form expressions of outage probability debases the outage probability. Monte Carlo simulations verify the analytical results.

Distributed multichannel medium access control protocol without common control channel for single-hop cognitive radio networks

A novel distributed cognitive radio multichannel medium access protocol without common control channel was proposed.The protocol divided a transmission interval into two parts for exchanging control information and data,respectively.In addition to evaluating system saturation throughput of the proposed protocol,a three-dimensional multi channel Markov chain model to describe the sate of the cognitive users (CUs) in dynamic spectrum access was presented.The proposed analysis was applied to the packet transmission schemes employed by the basic,RTS/CTS access mechanism adopted in the normal IEEE 802.11.Analyzing the advantage of the two methods,a hybrid access mechanism was proposed to improve the system throughput.The simulation results show that the experiment results are close to the value computed by the model (less than 5%),and the proposed protocol significantly improves the performance of the system throughput by borrowing the licensed spectrum.By analyzing the dependence of throughput on system parameters,hybrid mechanism dynamically selecting access mechanism can maintain high throughput.

ML and MAP Channel Estimation for Distributed OneWay Relay Networks with Orthogonal Training

In this letter,we investigate the individual channel estimation for the classical distributed-space-time-coding(DSTC) based one-way relay network(OWRN) under the superimposed training framework.Without resorting to the composite channel estimation,as did in traditional work,we directly estimate the individual channels from the maximum likelihood(ML) and the maximum a posteriori(MAP) estimators.We derive the closed-form ML estimators with the orthogonal training designing.Due to the complicated structure of the MAP in-channel estimator,we design an iterative gradient descent estimation process to find the optimal solutions.Numerical results are provided to corroborate our studies.

Quantum Network Coding on Networks with Arbitrarily Distributed Hidden Channels

Although perfect quantum network coding has been proved to be achievable, it is stiU puzzling whether it is feasible whenever one or more of the channels are replaced by the hidden ones emerging from quantum entanglement. The question is answered in this paper. First, we propose a quantum network coding protocol over a butterfly network with two hidden channels. Second, we investigate a more generaJ situation, where d-level quantum letters are transmitted through the network containing arbitrarily distributed hidden channels, and prove that quantum network coding on such networks is still achievable.