安居佳苑CATV网络设计

文章根据安居佳苑的实际情况,研究了光链路损耗,光发射机功率计算,光接收机输入光功率计算和网络的设计分配。

Partially Overlapped Channels- and Flow-Based End-to-End Channel Assignment for Multi-Radio Multi-Channel Wireless Mesh Networks

Capacity reduction is a major problem faced by wireless mesh networks. An efficient way to alleviate this problem is proper channel assignment. Current end-toend channel assignment schemes usually focus on the case where channels in distinct frequency bands are assigned to mesh access and backbone, but actually backbone network and access network can use the same IEEE 802.11 technology. Besides, these channel assignment schemes only utilize orthogonal channels to perform channel assignment, and the resulting network interference dramatically degrades network performance. Moreover, Internet-oriented traffic is considered only, and peerto-peer traffic is omitted, or vice versa. The traffic type does not match the practical network. In this paper, we explore how to exploit partially overlapped channels to perform endto-end channel assignment in order to achieve effective end-to-end flow transmissions. The proposed flow-based end-to-end channel assignment schemes can conquer the limitations aforementioned. Simulations reveal that loadaware channel assignment can be applied to networks with stable traffic load, and it can achieve near-optimal performance; Traffic-irrelevant channel assignment is suitable for networks with frequent change of traffic load,and it can achieve good balance between performance and overhead. Also, partially overlapped channels' capability of improving network performance is situation-dependent, they should be used carefully.

A timeslot assignment scheme for cluster-tree based wireless sensor network

Many efforts have been made to develop time division multiple access （TDMA） slots allocation in a multi-hop converge-cast wireless sensor network （WSN）, however, most of them either use complex algorithm or concern frames only without simultaneous transmission in a single slot. In this paper, we present a timeslot assignment scheme for cluster-tree-based TDMA WSN, co：＇ering three frequently used working modes in practical applications. The shortest frame formed can guarantee real-time conununication and is also facilitated for message and slot integration, since timeslots allocated to a single node are continuous. During allocation processes, the algorithms are distributed and light-weighted. The experiment resulted from a WSN prototype system shows that our scheme can achieve a good reliability.

Uplink user allocation scheme in cognitive coexistent cellular network

In order to address spectrum resource scarcity in traditional cellular networks,television(TV)white space is considered as a potential solution to offload a portion of network traffic and enlarge network capacity.This paper describes a cognitive cellular network which allocates low geometry users to the TV white space based on a proportional fair criterion.An uplink user allocation scheme is proposed and the validity of the proposed scheme is established by simulation of the cellular network usage in conjunction with the TV white space.The simulation results show clear improvements in both the user and the system performance with the cognitive coexistent cellular network compared with the traditional cellular network,and that the performance of the proposed user allocation scheme is superior to other user allocation schemes.

On Channel Assignment for Multicast in Multi-Radio Multi-Channel Wireless Mesh Networks:A Survey

The major challenge faced by wireless mesh networks is the capacity reduction caused by interference,and interference can be reduced or even eliminated through appropriate channel assignment.This article presents a comprehensive survey of channel assignment schemes for multicast in multi-radio multi-channel wireless mesh networks.We analyze the state-of-the-art channel assignment schemes for multicast and provide comprehensive taxonomy of the latest work.In general,we classify the channel assignment schemes for multicast into two types,that is,sequential multicast routing and channel assignment(SMRCA)and joint multicast routing and channel assignment(JMRCA).Detailed review of channel assignment schemes in each category is provided.Possible future research directions and corresponding solutions are also explored to motivate research interests in the field of channel assignment for multicast in wireless mesh networks.

Two-Stage Resource Allocation Scheme for Three-Tier Ultra-Dense Network

In 5 G Ultra-dense Network(UDN), resource allocation is an efficient method to manage inter-small-cell interference. In this paper, a two-stage resource allocation scheme is proposed to supervise interference and resource allocation while establishing a realistic scenario of three-tier heterogeneous network architecture. The scheme consists of two stages: in stage I, a two-level sub-channel allocation algorithm and a power control method based on the logarithmic function are applied to allocate resource for Macrocell and Picocells, guaranteeing the minimum system capacity by considering the power limitation and interference coordination; in stage II, an interference management approach based on K-means clustering is introduced to divide Femtocells into different clusters. Then, a prior sub-channel allocation algorithm is employed for Femtocells in diverse clusters to mitigate the interference and promote system performance. Simulation results show that the proposed scheme contributes to the enhancement of system throughput and spectrum efficiency while ensuring the system energy efficiency.

UTILITY OPTIMIZATION SCHEDULING FOR MULTI-POINT VIDEO SURVEILLANCE IN UBIQUITOUS NETWORK

Resource allocation is an important problem in ubiquitous network. Most of the existing resource allocation methods considering only wireless networks are not suitable for the ubiquitous network environment, and they will harm the interest of individual users with instable resource requirements. This paper considers the multi-point video surveillance scenarios in a complex network environment with both wired and wireless networks. We introduce the utility estimated by the total costs of an individual network user. The problem is studied through mathematical modeling and we propose an improved problem-specific branch-and-cut algorithm to solve it. The algorithm follows the divide-and-conquer principle and fully considers the duality feature of network selection. The experiment is conducted by simulation through C and Lingo. And it shows that compared with a centralized random allocation scheme and a cost greed allocation scheme, the proposed scheme has better per- formance of reducing the total costs by 13.0% and 30.6% respectively for the user.

Rate Allocation Scheme for Machine-to-Machine Service Based on 3GPP in Heterogeneous Wireless Networks

In this study,an explicit adaptive traffic allocation scheme for Machine-to-Machine(M2M)service is proposed to achieve optimum distribution in heterogeneous networks.Based on the characteristics of M2M services,the presented scheme is formulated as a convex optimization problem that maximises the utility of the M2M service,and then determines how to allocate the total rate among the multiple access networks.The analysis and numerical simulations indicate that the proposed scheme makes a significant improvement in performance compared with the traditional schemes.

Distributed Key Management Scheme against Sybil Attacks of Wireless Sensor Network

Wireless sensor network nodes （WSN nodes） have limited computing power, storage ca-pacity, conmmunication capabilities and energy and WSN nodes are easy to be paralyzed by Sybil at- tack. In order to prevent Sybil attacks, a new key distribution scheme for wireless sensor networks is presented. In this scheme, the key inforrmtion and node ID are associated, and then the attacker is dif-ficult to forge identity ID and the key inforrmtion corresponding to ID can not be forged. This scheme can use low-power to resist the Syhil attack and give full play to the resource advantages of the cluster head. The computing, storage and corrn^ni- cation is rminly undertaken by the cluster head o- verhead to achieve the lowest energy consumption and resist against nodes capture attack. Theoretical analysis and experimental results show that com- pared with the traditional scheme presented in Ref. [14], the capture rate of general nodes of cluster re-duces 40%, and the capture rate of cluster heads reduces 50%. So the scheme presented in this pa-per can improve resilience against nodes capture at- tack and reduce node power consumption.

Cross-Layer Scheduling Design for Multimedia Applications over Cognitive Ad Hoc Networks

In this paper,we study cross-layer scheduling scheme on multimedia application which considers both streaming traffic and data traffic over cognitive ad hoc networks.A cross-layer design is proposed to optimize SU's utility,which is used as an approach to balance the transmission efficiency and heterogeneous traffic in cognitive ad hoc networks.A framework is provided for utility-based optimal subcarrier assignment,power allocation strategy and corresponding modulation scheme,subject to the interference threshold to primary user(PU) and total transmit power constraint.Bayesian learning is adopted in subcarrier allocation strategy to avoid collision and alleviate the burden of information exchange on limited common control channel(CCC).In addition,the M/G/l queuing model is also introduced to analyze the expected delay of streaming traffic.Numerical results are given to demonstrate that the proposed scheme significantly reduces the blocking probability and outperforms the mentioned single-channel dynamic resource scheduling by almost 8%in term of system utility.

An Authenticated Group Key Distribution Scheme for Wireless Sensor Networks

In wireless sensor networks （WSNs）, group key distribution is the core of secure communications since sensor nodes usually form groups and cooperate with each other in sensing data collection and in-network processing. In this paper, we present a scalable authenticated scheme for group key distribution based on a combinatorial exclusion basis system （EBS） for efficiency and one-way hash chains for authentication. The proposed scheme guarantees a lightweight authenticated group key updating procedure and is efficient in terms of storage, communication and computation overheads.