光纤联网技术在村村通工程中的应用

首先阐述目前村村通工程存在的问题和薄弱环节,然后重点介绍光纤联网技术在村村通工程中的3个实际应用方案,并评估每个方案的优缺点,最后明确新时期村村通工程的目标和要求。     

移动Ad Hoc网络基于IPv6的Internet接入技术研究

针对实现移动用户无线上网的需求，通过对移动AdHoc网络的体系结构和路由技术的研究，以及对移动IPv6协议的工作原理及其与IPv4特性的比较分析，提出了AdHoc网络基于IPv6的Intemet接入方法，并对其地址自动配置、路由发现、网关发现、协议转换和分组转换等关键技术进行了分析，同时针对这两种技术相结合存在的广播和多跳问题提出了改进方法，并对今后的工作进行了展望。     

Comparison of satellite and cellular architectures for downlink broadcast data transmission

Traditional voice and video‐oriented networks such as the cellular and satellite networks are being increasingly used to carry data traffic. We endeavour to compare the downlink broadcast performance of the two architectures against each other on the basis of energy consumption, end‐to‐end delay and maximum stable throughput. The architectures are modelled as systems of Geo/G/1 queues. Queuing theory arguments and then sample‐path based comparisons are used to show that the satellite architecture while being more energy‐efficient has a higher delay and a lower maximum throughput. The variation of energy and delay with the total number of receiver nodes is also studied. Copyright © 2006 John Wiley & Sons, Ltd.     

基于OFDM的数字调幅广播系统软件设计

本文介绍了正交频分复用（OFDM）系统在DRM数字调幅广播中的应用。并在Windows XP操作系统下使用Visual C＋＋工具成功设计了DRM系统的虚拟无线电仿真软件。     

CDMA2000系统中的广播和多播业务

在下一代移动通信系统中,CDMA2000有着广泛应用,其广播业务和多播业务又是整个系统的一个亮点。文章详细讨论了CDMA2000移动系统中的广播和多播业务的设计方式,重点讨论了设计中的网络、信令等方面内容,采用这种设计方式可实现不同内容点到多点的高效、可扩展的传送。指出了设计中可能遇到的问题,提出了相应解决方案。     

Energy-Efficient Broadcast and Multicast Trees in Wireless Networks

The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree construction, and we introduce and evaluate algorithms for tree construction in infrastructureless, all-wireless applications. The performance metric used to evaluate broadcast and multicast trees is energy-efficiency. We develop the Broadcast Incremental Power (BIP) algorithm, and adapt it to multicast operation by introducing the Multicast Incremental Power (MIP) algorithm. These algorithms exploit the broadcast nature of the wireless communication environment, and address the need for energy-efficient operation. We demonstrate that our algorithms provide better performance than algorithms that have been developed for the link-based, wired environment.     

Energy Efficient Broadcast in Wireless Ad hoc Networks with Hitch-hiking

In this paper, we propose a novel concept called Hitch-hiking in order to reduce the energy consumption of broadcast application for wireless networks. Hitch-hiking takes advantage of the physical layer design that facilitates the combining of partial signals to obtain the complete information. The concept of combining partial signals using maximal ratio combiner [15] has been used to improve the reliability of the communication link but has never been exploited to reduce energy consumption in broadcasting over wireless ad hoc networks. We study the advantage of Hitch-hiking for the scenario when the transmission power level of nodes is fixed as well as the scenario when the nodes can adjust their power level. For both scenarios, we show that Hitch-hiking is advantageous and have proposed algorithms to construct broadcast tree with Hitch-hiking taken into consideration. For fixed transmission power case, we propose and analyze a centralized heuristic algorithm called SPWMH (Single Power Wireless Multicast with Hitch-hiking) to construct a broadcast tree with minimum forwarding nodes. For the latter case, we propose a centralized heuristic algorithm called Wireless Multicast with Hitch-hiking (WMH) to construct an energy efficient tree using Hitch-hiking and also present a distributed version of the heuristic. We also evaluate the proposed heuristics through simulation. Simulation results show that Hitch-hiking can reduce the transmission cost of broadcast by as much as 50%. Further, we propose and evaluate a protocol called Power Saving with Broadcast Tree (PSBT) that reduces energy consumption of broadcast by eliminating redundancy in receive operation. Finally, we propose an algorithm that takes advantage of both Hitch-hiking and PSBT in conserving energy. Manish Agarwal is an engineer at Microsoft, Redmond. He received his Masters degree in Electrical and Computer Engineering from University of Massachusetts, Amherst in 2004. He received his undergraduate degree from Indian Institute of Technology, Guwahati. His research interest lies in the field of mobile ad hoc networks. Lixin Gao is an associate professor of Electrical and Computer Engineering at the University of Masschusetts, Amherst. She received her Ph.D. degree in computer science from the University of Massachusettes at Amherst in 1996. Her research interests include multimedia networking and Internet routing. Between May 1999 and January 2000, she was a visiting researcher at AT&T Research Labs and DIMACS. She is an Alfred P. Sloan Fellow and received an NSF CAREER Award in 1999. She is a member of IEEE, ACM, and Sigma Xi. Joon Ho Cho received the B.S. degree (summa cum laude) in electrical engineering from Seoul National University, Seoul, Korea, in 1995 and the M.S.E.E. and Ph.D. degrees in electrical and computer engineering from Purdue University, West Lafayette, IN, in 1997 and 2001, respectively. From 2001 to 2004, he was with the University of Massachusetts at Amherst as an Assistant Professor. Since July 2004, he has been with Pohang University of Science and Technology (POSTECH), Pohang, Korea, where he is presently an Assistant Professor in the Department of Electronic and Electrical Engineering. His research interests include wideband systems, multiuser communications, adaptive signal processing, packet radio networks, and information theory. Dr. Cho is currently an Associate Editor for the IEEE Transactions on Vehicular Technology. Jie Wu is a Professor at Department of Computer Science and Engineering, Florida Atlantic University. He has published over 300 papers in various journal and conference proceedings. His research interests are in the area of mobile computing, routing protocols, fault-tolerant computing, and interconnection networks. Dr. Wu served as a program vice chair for 2000 International Conference on Parallel Processing (ICPP) and a program vice chair for 2001 IEEE International Conference on Distributed Computing Systems (ICDCS). He is a program co-chair for the IEEE 1st International Conference on Mobile Ad-hoc and Sensor Systems (MASS'04). He was a co-guest-editor of a special issue in IEEE Computer on “Ad Hoc Networks”. He also editored several special issues in Journal of Parallel and Distributing Computing (JPDC) and IEEE Transactions on Parallel and Distributed Systems (TPDS). He is the author of the text “Distributed System Design” published by the CRC press. Currently, Dr. Wu serves as an Associate Editor in IEEE Transactions on Parallel and Distributed Systems and three other international journals. Dr. Wu is a recipient of the 1996–97 and 2001–2002 Researcher of the Year Award at Florida Atlantic University. He served as an IEEE Computer Society Distinguished Visitor. Dr. Wu is a Member of ACM and a Senior Member of IEEE.     

广播“村村响”工程可寻址广播系统方案

随着有线电视的发展,各地方政府都非常关注有线调频广播的发展,为了使所采用的技术方案能在原有有线电视网络基础上发展有线调频广播,做到既经济、先进又安全,广电部门面临着不同的选择,提出一种有线调频广播技术方案供同行参考.     

Performance analysis of switch‐and‐stay combining in two‐way relay systems with analog network coding and time‐division broadcast protocols

In this paper, we consider switch‐and‐stay combining (SSC) in two‐way relay systems with two amplify‐and‐forward relays, one of which is activated to assist the information exchange between the two sources. The system operates in either analog network coding (ANC) protocol where the communication is only achieved with the help of the active relay or time‐division broadcast (TDBC) protocol where the direct link between two sources can be utilized to exploit more diversity gain. In both cases, we study the outage probability and bit error rate (BER) for Rayleigh fading channels. In particular, we derive closed‐form lower bounds for the outage probability and the average BER, which remain tight for different fading conditions. We also present asymptotic analysis for both the outage probability and the average BER at high signal‐to‐noise ratio. It is shown that SSC can achieve the full diversity order in two‐way relay systems for both ANC and TDBC protocols with proper switching thresholds. Copyright © 2014 John Wiley & Sons, Ltd.     

Efficient multi-hop scheduling algorithms for packet transmissions in WDM optical star networks

This paper proposes multi-hop scheduling algorithms for the All-to-All Broadcast (AAB) problem in Wavelength Division Multiplexed (WDM) optical star networks. The multi-hop AAB problem can be split into two subproblems: Logical Topologies Construction (LTC) problem, and Transmission Scheduling (TS) problem. For improving the efficiency of multi-hop scheduling, we focus on a new multi-hop transmission model and transfer the LTC problem to a special case of the Round Robin Tournament (RRT) problem. In the proposed logical topologies, our multi-hop scheduling algorithms can easily overlap the tuning latency and reduce the number of tuning operations on each node. We compare our results with previous research in terms of schedule length. Overall results indicate that our multi-hop scheduling algorithms have better performance than previous algorithms.