无线自组织网络拓扑控制算法和协议研究
|
摘要
无线自组织网络是在没有固定通信基础设施的情况下,由具有无线通信功能的节点自组织形成的网络。网络拓扑结构对网络的性能有着重大的影响,而如何简单快速构建和维护自组网拓扑结构、提高网络的传输性能、减少节点的能耗、增强网络的生存能力是拓扑控制研究的核心问题。设计分布式的、基于局部信息的拓扑控制协议,并与自组网通信协议相融合是拓扑控制技术走向实用化的关键问题。
无线自组织网络拓扑控制是通过协调节点间各自传输范围,构建具有全局特性(如连通性)的网络拓扑结构,以减少节点的能耗或增加网络的传输能力为目的的技术。本文系统综述了拓扑控制算法迄今为止的主要研究成果,全面分析了目前拓扑控制算法的特点和性能,针对目前研究工作的不足,从定向天线自组网拓扑构建、拓扑结构干扰优化、自组网可生存拓扑管理和拓扑控制技术实用化这四个方面研究了拓扑控制问题。本文的创新性成果主要体现在以下几个方面:
(1)研究拓扑控制与无线网络协议簇的关系,分析加入拓扑控制功能对相关通信协议的影响。提出了一种在MAC协议中嵌入拓扑控制算法的解决方案,并开发基于OPNET网络仿真平台的拓扑控制模拟模块,可用于拓扑控制算法对网络性能影响的仿真研究,为拓扑控制技术真正融入自组网协议奠定了坚实的基础。
(2)通过对定向天线自组网连通问题定性和定量的分析研究,推导出保证拓扑图高概率连通的临界邻居数计算公式;在此基础上,提出了一种基于邻居数的分布式拓扑控制算法(DK-Neigh)。仿真实验说明,DK-Neigh算法可以保证整个网络的连通概率大于96%,节点的传输半径比初始值减少15%,提高自组网的能量有效性;当天线波束宽度小于60°时,DK-Neigh与全向天线拓扑K-Neigh拓扑控制算法相比,可使节点节能提高15%,表明节点采用波束宽度较小的定向天线,采用有效的拓扑控制算法,可获得比全向天线拓扑算法更好的节能性,提高网络的能量效率。
(3)针对定向波束天线链路不对称问题,设计自适应波束天线模型,提出一种基于局部信息的集中式拓扑控制算法(BATC),协同调整所有节点的天线波束朝向和发射功率,进行拓扑控制。仿真实验表明BATC算法在保证网络连通的基础上,显著降低了节点的发射功率,提高了网络的吞吐量。
(4)针对BATC算法不具有分布式性质的问题,本文进一步针对自适应波束天线,设计随机波束自组网模型,通过对随机波束自组网连通问题定性和定量的分析研究,推导出保证拓扑图高概率连通的临界邻居数计算公式;在此基础上,提出了一种基于随机波束天线的自组网拓扑控制协议(RBNTC)。仿真结果表明分布式协议RBNTC在维护网络高概率连通的同时,在提高网络节点节能性和网络传输性能方面效果显著。
(5)根据无线通信的特点和网络协议的机制,提出了一种基于协议的网络干扰模型及度量方法,并提出了一种启发式的干扰最小化拓扑控制算法(ISPT)。该分布式算法基于新的干扰模型计算干扰值,构建局部的干扰最小化路径树,减小节点的发送功率。理论证明ISPT算法能保证网络连通,并使整个网络中节点间的路径干扰最小化。仿真结果表明ISPT算法显著降低了网络干扰,改善了网络性能。
(6)研究无线自组网可生存性问题。提出面向网络可生存的容错拓扑控制设计策略。通过理论和实验求得保证网络多连通的关键邻居数,并提出一种基于邻居数的拓扑控制算法(k2TC),该分布式算法能构建并维护容错拓扑结构,算法简单且开销小。仿真结果验证了,在节点出现失效时,k2TC算法能够保证网络的抗毁性和有效性,使得无线自组网具有持续可生存的能力。
Ad hoc wireless networks, or simply ad hoc networks, consist of a collection of geographically distributed nodes that communicate with one other over a wireless medium. Ad hoc networks differ from cellular networks in that there is no fixed infrastructure and the communication capabilities of the network are limited by the battery power of the network nodes. The topology of ad hoc networks,which is determined by positions and transmission ranges of nodes,has a significant effect on the network performance.Topology control deals with how to quickly deploy and maintain the network topology, increase the network capacity,reduce node energy consumption and enhance the network survivability. Furthermore, the integration of operational topology control techniques in the protocol stack is one of the main open research areas in this field.
Topology control is the art of coordinating nodes’decisions regarding their transmitting ranges, in order to generate a network with the desired properties (e.g. connectivity) while reducing node energy consumption and/or increasing network capacity. In this thesis, the topology control problem and survey state-of-the-art solutions are proposed to tackle them. Topology control techniques in network simulation tool are implemented, and experimental results illustrate the effectiveness of topology control algorithms. However, several aspects related to topology control are not carefully investigated yet. In this research,the problem of topology control from four aspects are discussed about topology control for ad hoc networks using directional antennas, low-interference topology control, fault-tolerant topology control and implementation of topology control. The main contributions of this thesis are listed as follows:
At first, a possible solution to integrate topology control mechanisms into the medium access control protocol is proposed. Through RTS/CTS message exchange, the MAC layer can trigger execution of the topology control protocol in case it detects new neighbors by overhearing the network traffic and analyzing the message headers. The integrated solution establishes a solid research foundation for topology control techniques. Then, OPNET network simulator is added processing module for topology control to the wireless MAC protocol and verif y its feasibility by experiments.
Secondly, the topology control for ad hoc networks with directional antennas is investigated, in order to maintain network connectivity while reducing node energy consumption and increasing network capacity.
A distributed neighbor-based topology control approach for ad hoc networks with steered beam antennas, referred to as the DK-Neigh, is proposed to maintain the outdegree of every node equal to or slightly below a specific value K. Quadrat statistical methods are employed to derive analytical expressions to determine the critical transmission range and neighbor number K. The approach can build the resulting communication graph with high probability connected. Extensive simulations are carried out, which show that the DK-Neigh is to achieve a high probability (more than 96 percent) of connectivity. If width of beam is smaller than 60 degree, average energy cost of nodes is reduced at least 15 percent than the topology control protocol K-Neigh using omni-directional antennas. Simulations show the DK-Neigh is more energy-efficient while maintaining network connectivity.
A localized topology control algorithm for Ad hoc networks with steered beam directional antennas, referred to as the BATC, is proposed in this thesis. The topology is controlled not only by adjusting the transmission powers of nodes but also by changing the directional antenna’s direction. The centralized algorithm preserves the connectivity of the resulting topology. At the same time, the resulting network topology reduces energy consumption, decreases traffic interference and improves network throughput while transmission power reduced. Simulation results show that the proposed algorithm significantly improves the network performance.
A tight lower bound for the critical neighbor number is deduced that is necessary to obtain an almost surely connected network with randomized beamforming on a bounded area of given size. In this thesis, a topology control protocol, referred to as the RBNTC, is proposed which is fully distributed, asynchronous, and localized. Not only does the constructed topology demonstrate significant reductions in the power required keeping the network connected, but also simulation results show that the proposed algorithm significantly improves the network performance.
Thirdly, a new protocol interference model is presented as a measure to describe the interference of the entire network in this thesis. Furthermore, a distributed interference-avoidance topology control approximation algorithm, referred to as the ISPT, is proposed. The algorithm minimizes the interference in the network according to our metrics while preserving the connectivity of the resulting topology. The simulation results show that ISPT decreases interference and improves network capacity in terms of throughput.
Finally, An arguement is proposed that survivability of topologies is not equivalence to connectivity of the multiply connected graph by illustrating some practical examples, then the concepts of network survivability into the topology of Ad hoc networks to obtain topology robustness and transmission capacity is introduced. Furthermore analytical expressions to determine the critical neighbor number for K-vertex connected topology are derived. A distributed neighbor-based topology control protocol, referred to as the k2TC, is proposed to maintain the degree of every node equal to or slightly below a specific value k when nodes fail, in a timely manner. The topology constructed under k2TC is high probability connected and bidirectional, which can be implemented at a reasonable cost. Simulation studies show that the resulting topology has good network survivability in terms of invulnerability and availability.
无线自组织网络拓扑控制是通过协调节点间各自传输范围,构建具有全局特性(如连通性)的网络拓扑结构,以减少节点的能耗或增加网络的传输能力为目的的技术。本文系统综述了拓扑控制算法迄今为止的主要研究成果,全面分析了目前拓扑控制算法的特点和性能,针对目前研究工作的不足,从定向天线自组网拓扑构建、拓扑结构干扰优化、自组网可生存拓扑管理和拓扑控制技术实用化这四个方面研究了拓扑控制问题。本文的创新性成果主要体现在以下几个方面:
(1)研究拓扑控制与无线网络协议簇的关系,分析加入拓扑控制功能对相关通信协议的影响。提出了一种在MAC协议中嵌入拓扑控制算法的解决方案,并开发基于OPNET网络仿真平台的拓扑控制模拟模块,可用于拓扑控制算法对网络性能影响的仿真研究,为拓扑控制技术真正融入自组网协议奠定了坚实的基础。
(2)通过对定向天线自组网连通问题定性和定量的分析研究,推导出保证拓扑图高概率连通的临界邻居数计算公式;在此基础上,提出了一种基于邻居数的分布式拓扑控制算法(DK-Neigh)。仿真实验说明,DK-Neigh算法可以保证整个网络的连通概率大于96%,节点的传输半径比初始值减少15%,提高自组网的能量有效性;当天线波束宽度小于60°时,DK-Neigh与全向天线拓扑K-Neigh拓扑控制算法相比,可使节点节能提高15%,表明节点采用波束宽度较小的定向天线,采用有效的拓扑控制算法,可获得比全向天线拓扑算法更好的节能性,提高网络的能量效率。
(3)针对定向波束天线链路不对称问题,设计自适应波束天线模型,提出一种基于局部信息的集中式拓扑控制算法(BATC),协同调整所有节点的天线波束朝向和发射功率,进行拓扑控制。仿真实验表明BATC算法在保证网络连通的基础上,显著降低了节点的发射功率,提高了网络的吞吐量。
(4)针对BATC算法不具有分布式性质的问题,本文进一步针对自适应波束天线,设计随机波束自组网模型,通过对随机波束自组网连通问题定性和定量的分析研究,推导出保证拓扑图高概率连通的临界邻居数计算公式;在此基础上,提出了一种基于随机波束天线的自组网拓扑控制协议(RBNTC)。仿真结果表明分布式协议RBNTC在维护网络高概率连通的同时,在提高网络节点节能性和网络传输性能方面效果显著。
(5)根据无线通信的特点和网络协议的机制,提出了一种基于协议的网络干扰模型及度量方法,并提出了一种启发式的干扰最小化拓扑控制算法(ISPT)。该分布式算法基于新的干扰模型计算干扰值,构建局部的干扰最小化路径树,减小节点的发送功率。理论证明ISPT算法能保证网络连通,并使整个网络中节点间的路径干扰最小化。仿真结果表明ISPT算法显著降低了网络干扰,改善了网络性能。
(6)研究无线自组网可生存性问题。提出面向网络可生存的容错拓扑控制设计策略。通过理论和实验求得保证网络多连通的关键邻居数,并提出一种基于邻居数的拓扑控制算法(k2TC),该分布式算法能构建并维护容错拓扑结构,算法简单且开销小。仿真结果验证了,在节点出现失效时,k2TC算法能够保证网络的抗毁性和有效性,使得无线自组网具有持续可生存的能力。
Ad hoc wireless networks, or simply ad hoc networks, consist of a collection of geographically distributed nodes that communicate with one other over a wireless medium. Ad hoc networks differ from cellular networks in that there is no fixed infrastructure and the communication capabilities of the network are limited by the battery power of the network nodes. The topology of ad hoc networks,which is determined by positions and transmission ranges of nodes,has a significant effect on the network performance.Topology control deals with how to quickly deploy and maintain the network topology, increase the network capacity,reduce node energy consumption and enhance the network survivability. Furthermore, the integration of operational topology control techniques in the protocol stack is one of the main open research areas in this field.
Topology control is the art of coordinating nodes’decisions regarding their transmitting ranges, in order to generate a network with the desired properties (e.g. connectivity) while reducing node energy consumption and/or increasing network capacity. In this thesis, the topology control problem and survey state-of-the-art solutions are proposed to tackle them. Topology control techniques in network simulation tool are implemented, and experimental results illustrate the effectiveness of topology control algorithms. However, several aspects related to topology control are not carefully investigated yet. In this research,the problem of topology control from four aspects are discussed about topology control for ad hoc networks using directional antennas, low-interference topology control, fault-tolerant topology control and implementation of topology control. The main contributions of this thesis are listed as follows:
At first, a possible solution to integrate topology control mechanisms into the medium access control protocol is proposed. Through RTS/CTS message exchange, the MAC layer can trigger execution of the topology control protocol in case it detects new neighbors by overhearing the network traffic and analyzing the message headers. The integrated solution establishes a solid research foundation for topology control techniques. Then, OPNET network simulator is added processing module for topology control to the wireless MAC protocol and verif y its feasibility by experiments.
Secondly, the topology control for ad hoc networks with directional antennas is investigated, in order to maintain network connectivity while reducing node energy consumption and increasing network capacity.
A distributed neighbor-based topology control approach for ad hoc networks with steered beam antennas, referred to as the DK-Neigh, is proposed to maintain the outdegree of every node equal to or slightly below a specific value K. Quadrat statistical methods are employed to derive analytical expressions to determine the critical transmission range and neighbor number K. The approach can build the resulting communication graph with high probability connected. Extensive simulations are carried out, which show that the DK-Neigh is to achieve a high probability (more than 96 percent) of connectivity. If width of beam is smaller than 60 degree, average energy cost of nodes is reduced at least 15 percent than the topology control protocol K-Neigh using omni-directional antennas. Simulations show the DK-Neigh is more energy-efficient while maintaining network connectivity.
A localized topology control algorithm for Ad hoc networks with steered beam directional antennas, referred to as the BATC, is proposed in this thesis. The topology is controlled not only by adjusting the transmission powers of nodes but also by changing the directional antenna’s direction. The centralized algorithm preserves the connectivity of the resulting topology. At the same time, the resulting network topology reduces energy consumption, decreases traffic interference and improves network throughput while transmission power reduced. Simulation results show that the proposed algorithm significantly improves the network performance.
A tight lower bound for the critical neighbor number is deduced that is necessary to obtain an almost surely connected network with randomized beamforming on a bounded area of given size. In this thesis, a topology control protocol, referred to as the RBNTC, is proposed which is fully distributed, asynchronous, and localized. Not only does the constructed topology demonstrate significant reductions in the power required keeping the network connected, but also simulation results show that the proposed algorithm significantly improves the network performance.
Thirdly, a new protocol interference model is presented as a measure to describe the interference of the entire network in this thesis. Furthermore, a distributed interference-avoidance topology control approximation algorithm, referred to as the ISPT, is proposed. The algorithm minimizes the interference in the network according to our metrics while preserving the connectivity of the resulting topology. The simulation results show that ISPT decreases interference and improves network capacity in terms of throughput.
Finally, An arguement is proposed that survivability of topologies is not equivalence to connectivity of the multiply connected graph by illustrating some practical examples, then the concepts of network survivability into the topology of Ad hoc networks to obtain topology robustness and transmission capacity is introduced. Furthermore analytical expressions to determine the critical neighbor number for K-vertex connected topology are derived. A distributed neighbor-based topology control protocol, referred to as the k2TC, is proposed to maintain the degree of every node equal to or slightly below a specific value k when nodes fail, in a timely manner. The topology constructed under k2TC is high probability connected and bidirectional, which can be implemented at a reasonable cost. Simulation studies show that the resulting topology has good network survivability in terms of invulnerability and availability.
引文
[1] Charles E. Perkins.Ad hoc networking.Boston:Addison-Wesley Longman Publishing Co., Inc.,2001,1-28
[2] Ramanathan R,Radi J.A brief overview of mobile ad hoc networks: challenges and directions.IEEE Communication Magazine,2002,40(5):20-22
[3]方旭明,何蓉.短距离无线与移动通信网络.北京:人民邮电出版社,2004,119-208
[4]石晶林.移动自组织通信网络技术概况及未来前景.北京:中国科学院计算技术研究所信息网络室,2004,1-8
[5]金荣洪,耿军平,范瑜.无线通信中的智能天线.北京:北京邮电大学出版社,2006,22-40
[6] R. Ramanathan,R. Rosales-Hain.Topology control of multihop wireless networks using transmit power adjustment.In:IEEE INFOCOM.Tel-Aviv:IEEE Computer Society,2000,404-413
[7]路纲,周明天,牛新征等.无线网络邻近图综述.软件学报,2008,19(4):888-911
[8] P. Santi.Topology control in wireless ad hoc and sensor networks.ACM Comp. Surveys,2005,37(2):164-194
[9] Albert-LászlóBarabási.Linked: the new science of networks.Cambridge,2002,9-24
[10] L. Hu.Topology control for multihop packet radio networks.IEEE Transactions on Communications,1993,41(10):1474-1481
[11] I. Kang,R. Poovendran.Maximizing static network lifetime of wireless broadcast ad hoc networks.In:IEEE ICC.Alaska:IEEE Computer Society,2003,2256-2261
[12] J-H Chang,L Tassiulas.Routing for maximum system lifetime in wireless ad-hoc networks.In:the 37th Annual Allerton Conference on Communication,Control and Computing.Monticello:IEEE Computer Society,1999,1-10
[13] KAWADIA V,KUMAR PR.Principles and protocols for power control in wireless ad hoc networks.IEEE JSAC,2005,23(1):76-88
[14] V. Rodoplu,T.H.Meng.Minimum energy mobile wireless networks.IEEE Journal on Selected Areas in Communications,1999,17 (8):1333-1344
[15]蔡一兵.无线自组网MAC及路由技术研究:[中国科学院研究生院计算技术研究所博士学位论文].北京:中国科学院研究生院(计算技术研究所),2006,7-32
[16] Paolo Santi.Topology control in wireless ad hoc and sensor networks.London:John Wiley & Sons Ltd,2005,27-33
[17] Andrew Y. Wang,Charles G. Sodini.On the energy efficiency of wireless transceivers.In:IEEE ICC.Istanbul:IEEE Computer Society,2006,3783-3788
[18]王青山,张信明,马涛等.Ad Hoc无线网络功率控制综述.计算机科学,2004,31(7):52-56
[19]廖鹰,齐欢,沈建京等.无线传感器网络分簇算法研究.计算机工程与应用,2009,45(29):18-21
[20] E. L. Lloyd,R. Liu,M. V. Marathe,et al.Algorithmic aspects of topology control problems for ad hoc networks.In:ACM MobiHoc.Lausanne:IEEE Computer Society,Switzerland,2002,123-134
[21] Kirousis L,Kranakis E,Krizanc D,et al.Power consumption in packet radio networks.Theoretical Computer Science,2000,243(1-2):289-305
[22] Clementi A,Penna P,Silvestri R.Hardness results for the power range assignment problem in packet radio networks.In:2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX’99).Berkeley:IEEE Computer Society,1999,197-208
[23] Blough D,Leoncini M,Resta G,et al.On the symmetric range assignment problem in wireless ad hoc networks.In:IFIP Conference on Theoretical Computer Science.Montreal:IEEE Computer Society,2002,71-82
[24] Calinescu G,Mandoiu I,Zelikovsky A.Symmetric connectivity with minimum power consumption in radio networks.In:IFIP Conference on Theoretical Computer Science.Montreal:IEEE Computer Society,2002,119-130
[25] M. D. Penrose.The longest edge of random minimal spanning tree.Annals of Applied Probability,1997,7 (2):340-361
[26] M. Sanchez,P. Manzoni,Z. J. Haas.Determination of critical transmission range in ad-hoc networks.In:Multiaccess, Mobility and Teletraffic for Wireless Communications Conference.Venice:IEEE Computer Society,1999,293-301
[27] P. Gupta,P. R. Kumar.Critical power for asymptotic connectivity in wireless networks.In:Stochastic Analysis, Control, Optimization and Applications: a Volume in Honor of W. H. Fleming.Birkhauser:IEEE Press,1998,547-566
[28] M. D. Penrose.A strong law for the longest edge of the minimal spanningtree.The Annals of Probability,1999,27 (1):246-260
[29] P. Panchapakesan,D. Manjunath.On the transmission range in dense ad hoc radio networks.In:IEEE SPCOM.Bangalore:IEEE Computer Society,2001,1-5
[30] P. Gupta,P. R. Kumar.The capacity of wireless networks.IEEE Trans. Information Theory,2000,46 (2):388-404
[31] P. Santi,D. M. Blough,F. Vainstein.A probabilistic analysis for the range assignment problem in ad hoc networks.In:ACM MOBIHOC.Long Beach:ACM,2000,212-220
[32] P. Santi,D. M. Blough.An evaluation of connectivity in mobile wireless ad hoc networks.In:IEEE DSN.Washington DC:IEEE Computer Society:IEEE Computer Society,2002,89-102
[33] P. Santi,D. M. Blough.The critical transmitting range for connectivity in sparse wireless ad hoc networks.IEEE Transactions on Mobile Computing,2003,2(1):25-39
[34] O. Dousse,P. Thiran,M. Hasler.Connectivity in ad-hoc and hybrid networks.In:IEEE INFOCOM.New York:IEEE Computer Society,2002, 1079-1088
[35] F. Xue,P. R. Kumar.The number of neighbors needed for connectivity of wireless networks.Wireless Networks,2004,10(2):169-181
[36] Peng-Jun Wan,Chih-Wei Yi.Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks.In:5th ACM MOBIHOC.Roppongi:ACM,2004,1-8
[37] M. D. Penrose.Extremes for the minimal spanning tree on normally distributed points.Advances in Applied Probability,1998,30(3):628-639
[38] M. D. Penrose.A strong law for the largest nearest-neighbor link between random points.Journal of London Mathematical Society,1999,60(2):951-960
[39] M. D. Penrose.On k-connectivity for a geometric random graph.Random Structures and Algorithms,1999,15(2):145-164
[40] Yi. C.,Wan. P..Asymptotic critical transmission ranges for connectivity in wireless as hoc networks with Bernoulli nodes.In:IEEE WCNC.New Orleans:IEEE Computer Society,2005,1-8
[41] A.E.F. Clementi,P. Penna,R. Silvestri.The power range assignment problem in radio networks on the plane.In:17th Annual Symposium on Theoretical Aspects of Computer Science.Lille:Springer-Verlag,2000,651-660
[42] Godfried T. Toussaint.The relative neighborhood graph of a finite planar set.Pattern Recognition,1980,12(4):261-268
[43] K.R. Gabriel,R.R. Sokal.A new statistical approach to geographic variation analysis.Systematic Zoology,1969,vol. 18(3):259-278
[44] J. Gao,L. Guibas,J. Hershberger,et al.Geometric spanner for routing in mobile networks.In:ACM MOBIHOC.Long Beach:ACM,2001,45-55
[45] Tamas Lukovszki.New results on geometric spanners and their applications:[Ph.D. Thesis].Germany:University of Paderborn,1999,1-8
[46] Rajmohan Rajaraman.Topology control and routing in ad hoc networks: A survey.SIGACT News,2002,33(2):60-73
[47] Stefano Basagni,Marco Conti, Silvia Giordano,et al.Mobile ad hoc networking.USA:Wiley-IEEE Press,2004,60-88
[48] Xiang-Yang Li,Peng-JunWan,Yu Wang.Power efficient and sparse spanner for wireless ad hoc networks.In:IEEE ICCCN.Phoenix:Springer-Verlag,2001,564-567
[49] Xiang-Yang Li.Algorithmic, Geometric and Graphs Issues in Wireless Networks.Wireless Comm. and Mobile Computing,2003,3(2):119-140
[50] Xiang-Yang Li,Peng-Jun Wan,Yu Wang,et al.Sparse power efficient topology for wireless networks.In: IEEE HICSS.Big Island:IEEE Computer Society,2002,296-306
[51] J. Wu.Handbook of theoretical and algorithmic aspects of aensor, ad hoc wireless and peer-to-peer networks.Boston:Auerbach Publications,2005,99-114
[52] N. Li,J. C. Hou,L. Sha.Design and analysis of an MST-based topology control algorithm.IEEE Transactions on Wireless Communications,2005,4(3):1195-1206
[53] N. Li,J. C. Hou.Topology control in heterogeneous wireless networks: problems and solutions. In:IEEE INFOCOM 2004.Hong Kong:IEEE Computer Society,2004,232-243
[54] R. Wattenhofer,L. Li,P. Bahl,et al.Distributed topology control for power efficient operation in multihop wireless ad hoc networks . In : IEEE INFOCOM.Anchorage:IEEE Computer Society,2001,1388-1397
[55] L. Li,J. Halpern,V. Bahl,et al.Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks.In:ACM PODC.Newport:ACM,2001,264-273
[56] M. Bahramgiri,M. Hajiaghayi,V. S. Mirrokni.Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks.Wireless Networks,2006,12(2):179-188
[57] Z. Huang,C.-C. Shen,C. Srisathapornphat,et al.Topology control for ad hoc networks with directional antennas.In:IEEE ICCCN.Miami:IEEE Computer Society,2002,16-21
[58] S.A. Borbash,E. Jennings.Distributed topology control algorithm for multihop wireless networks.In:IEEE International Joint Conference on Neural Networks.Honolulu:IEEE Computer Society,2002,355-360
[59] L. Liu,B. Li.MobileGrid: capacity-aware topology control in mobile ad hoc networks.In:IEEE ICCCN.Miami:IEEE Computer Society,2002,570-574
[60] D. M. Blough,M. Leoncini,G. Resta,et al.The K-Neigh protocol for symmetric topology control in ad hoc networks.In:ACM MobiHoc.Annapolis:ACM,2003,141-152
[61] Xiang-Yang Li,WenZhan Song,Weizhao Wang.A unified energy efficient topology for unicast and broadcast.In:ACM/IEEE MobiCom.Cologne:ACM, 2005,1-15
[62]林惠敏等.有效支持拓扑控制应用的新型MAC协议.计算机工程与应用,2009,45(16):123-125
[63]陈文斌等.无线自组网拓扑控制算法研究和性能分析.半导体技术,2007,32(增刊):16-21
[64] Xiaole Bai,Dong Xuan,Ziqiu Yun,et al.Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks.In:ACM MobiHoc.Hong Kong:ACM,2008,401-410
[65] Ai Chen,Ten H. Lai,Dong Xuan.Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks.In:ACM MobiHoc.Hong Kong:ACM,2008,421-430
[66] J. Wu, F. Dai. Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks.IEEE Transactions On Parallel and distributed Systems,2006, 17(6):522-535.
[67] Alessandro Bianchi,Sebastiano Pizzutilo.A tool for modeling and simulating mobile ad-hoc networks.In:MoMM.Linz:ACM,2008,438-443
[68] Z. H. Mir,D. M. Shrestha,G. H. Cho,et al.Mobility-aware distributed topology control for mobile multi-hop wireless networks.In:ICOIN.Sendai:Springer press,2006,257-266
[69] L. Bao,J.J. Garcia-Luna-Aceves.Topology management in ad hoc networks.In:ACM MobiHoc.Annapolis:ACM,2003,129-140
[70] Zhong Shen,Yilin Chang,Xin Zhang,et al.A efficient topology maintenance algorithm based on shortest path tree for wireless ad hoc networks.In: PDCAT.Dalian:IEEE Press,2005,288-292
[71]沈中,常义林,崔灿等.一种可自维护无线网络拓扑最小能量特性的分布式拓扑控制算法.计算机学报,2007,30(4):569-578
[72]贺鹏,李建东,陈彦辉等.Ad Hoc网络中基于方向性天线的分布式拓扑控制算法.软件学报,2007,18(6):1308-1318
[73]王炫,李建东,张文柱.拓扑控制对Ad Hoc网络性能的影响.计算机科学, 2006,33(6):44-47
[74] R Ramanathan.On the performance of ad hoc networks using beamforming antennas.In:ACM MobiHoc.Long Beach:ACM,2001,95-105
[75] S Vasudevan,J Kurose,D Towsle.On neighbor discovery in wireless networks with directional antennas.In:IEEE INFOCOM.Miami:IEEE Communications Society,2005,2502-2512
[76] Anand Prabhu Subramanian, Henrik Lundgren, Theodoros Salonidis, Don Towsley.Topology control protocol using sectorized antennas in dense 802.11 wireless networks. In:ICNP , Princeton:IEEE Communications Society,2009,1-10
[77] U Kumar,H Gupta,S R Das.A topology control approach to using directional antennas in wireless mesh networks . In : IEEE ICC . Istanbul : IEEE Communications Society,2006,4083-4088
[78] Christian Bettstetter , Christian Hartmann , Clemens Moser . How does randomized beamforming improve the connectivity of ad hoc networks? .In:IEEE ICC.Seoul:IEEE Communications Society,2005,3380-3385
[79]赵瑞锋,谈振辉,蒋海林.无线系统中的智能天线.电子学报, 2000,28(12):77-80
[80]余世荐.数学生态学导论.北京:科学技术文献出版社,1995
[81] Goldsmith A J,Wicker S B.Design challenges for energy-constrained ad hoc wireless networks.IEEE Wireless Communications,2002,9(4):8-27
[82] Fei Dai,Jie Wu.Efficient broadcasting in ad hoc wireless networks using directional antennas.IEEE Transactions on Parallel and Distributed Systems,2006,17(4):335-347
[83] Bellofiore,S Balanis, C A.Smart-antenna system for mobile communicationnetwork. Part 1. Overview and antenna design.IEEE Antennas and Propagation Magazine,2002,44(3):145-154
[84] Martin Furer , Balaji Raghavachari . Approximating the minimum degree spanning tree to within one from the optimal degree . In : ACM SODA.Philadelphia:ACM,1992,317-324
[85] C.A.Balanis.Antenna Theory: Analysis and Design.USA:John Wiley & Sons INC, 2nd,1982,249-328
[86] S. Yi,Y. Pei,S. Kalyanaraman.On the capacity improvement of Ad hoc wireless networks using directional antennas.In:ACM MobiHoc.Annapolis:ACM Press,2003,108-116
[87] P. Hall.Introduction to the Theory of Coverage Processes.USA:John Wiley & Sons,1988,38-52
[88]李方敏,徐文君,高超.一种适用于无线传感网络的功率控制MAC协议.软件学报,2007,18(5):1080-1091
[89] Xiangyun Zhou, Salman Durrani, Haley M. Jones.Connectivity analysis of wireless ad hoc networks with beamforming.IEEE Transactions on Vehicular Technology,2009,58(9):5247-5257
[90]陈文斌等.基于OPNET的自组网拓扑控制有效性的研究.计算机工程,2009,35(7):110-112
[91] M. Burkhart,P. von Rickenbach,R. Wattenhofer,et al.Does Topology Control Reduce Interference? In:ACM MobiHoc.Roppongi:ACM,2004,9-19
[92] Davide Bilo,Guido Proiettib.On the complexity of minimizing interference in ad-hoc and sensor networks.Theoretical Computer Science,2008,402(1):43-55
[93] K. Moaveni-Nejad,X. Li.Low-interference topology control for wireless ad hoc networks.Ad Hoc & Sensor Wireless Networks: An International Journal,2005, 1(1-2):41-64
[94] P. von Rickenbach,S. Schmid,R. Wattenhofer,et al.A robust interference model for wireless ad-hoc networks.In:IEEE WMAN.Denver:IEEE Press,2005,239-247
[95] Magnús M. Halldórsson,Takeshi Tokuyama.Minimizing interference of a wireless ad-hoc network in a plane.Theoretical Computer Science archive,2008,402(1):29-42
[96] X.-Y. Li,K. M. Neijad,W.-Z. Song,et al.Interference-aware topology control for wireless sensor networks.In:IEEE SECON.Santa Clara:IEEE Press,2005,263-274
[97] Jian Tang,Guoliang Xue,Weiyi Zhang.Interference-aware topology control and QoS routing in multi-channel wireless mesh networks . In : ACM MobiHoc.Urbana-Champaign:ACM,2005,68-77
[98] H. Zhai,J. Wang,Y. Fang.Distributed packet scheduling for multihop flows in ad hoc networks.In:IEEE WCNC.Atlanta:IEEE Press,2004,1081-1086
[99] T. Johansson,L. Carr-Motyckov.Reducing interference in ad hoc networks through topology control.In:ACM DIALM-POMC.Cologne:ACM,2005,17-23
[100] Douglas M. Blough,Mauro Leoncini,Giovanni Resta,et al.Topology control with better radio models: implications for energy and multi-hop interference.In: ACM MSWiM.Montreal:ACM,2005,260-268
[101] K. Jain,J. Padhye,V.N. Padmanabhan,et al.Impact of interference on mulit-hop wireless network performance.In:ACM MobiCom.San Diego:ACM,2003,66-80
[102] Kun-Da Wu,Wanjiun Liao.Interference-efficient topology control in wireless ad hoc networks.In:IEEE CCNC.Las Vegas:IEEE Press,2006,411-415
[103] Xiang Yu,Xinming Zhang,Can Que,et al.A practical low interference topology control for mobile ad hoc networks.In:IEEE ICN.Sainte-Luce:IEEE Computer Society Press,2007,23-29
[104]石军锋,钟先信,陈帅等.无线传感器网络结构及特点分析.重庆大学学报:自然科学版,2005,28(2):16-19
[105]闵军,张海呈,朱桂斌.自组网可靠性评价方法.电子科技大学学报,2008, 37(3):436-438
[106] Ning Li,Jennifer C Hou.Localized fault-tolerant topology control in wireless ad hoc networks.IEEE Transactions on Parallel & Distributed Systems,2006,17(4):307- 320
[107] Hajiaghayi,M.T. Immorlica,N. Mirrokni,et al.Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks.IEEE/ACM Transactions on Networking,2007,15(6):1345-1358
[108] Feng Wang,My T. Thai,Yingshu Li,et al.Fault-tolerant topology control for all-to-one and one-to-all communication in wireles networks.IEEE Transactions on Mobile Computing,2008,7(3):322-331
[109]王良民,马建峰,王超.无线传感器网络拓扑的容错度与容侵度.电子学报, 2006,34(8):1446-1451
[110]刘密霞,张玉清,洪毅.基于模糊推理的网络可生存性的建模与分析.通信学报,2009,30(1):31-37
[111]熊蔚明,刘有恒.关于通信网可靠性的研究进展.通信学报,1990,11(4):43-49
[112] A. Nayebi,H. Sarbazi-Azad.Analysis of k-Neigh topology control protocol for mobile wireless networks.Computer Networks,2009,53(5):613–633
[113] Douglas M. Blough,Mauro Leoncini,et al.The k-Neighbors approach to interference bounded and symmetric topology control in ad hoc networks.IEEE Transactions on Mobile Computing,2006,5(9):1267-1282
[114] Christian Bettstetter.On the minimum node degree and connectivity of a wireless multihop network.In:ACM MobiHoc.Lausanne:ACM Press, 2002,80-91
[2] Ramanathan R,Radi J.A brief overview of mobile ad hoc networks: challenges and directions.IEEE Communication Magazine,2002,40(5):20-22
[3]方旭明,何蓉.短距离无线与移动通信网络.北京:人民邮电出版社,2004,119-208
[4]石晶林.移动自组织通信网络技术概况及未来前景.北京:中国科学院计算技术研究所信息网络室,2004,1-8
[5]金荣洪,耿军平,范瑜.无线通信中的智能天线.北京:北京邮电大学出版社,2006,22-40
[6] R. Ramanathan,R. Rosales-Hain.Topology control of multihop wireless networks using transmit power adjustment.In:IEEE INFOCOM.Tel-Aviv:IEEE Computer Society,2000,404-413
[7]路纲,周明天,牛新征等.无线网络邻近图综述.软件学报,2008,19(4):888-911
[8] P. Santi.Topology control in wireless ad hoc and sensor networks.ACM Comp. Surveys,2005,37(2):164-194
[9] Albert-LászlóBarabási.Linked: the new science of networks.Cambridge,2002,9-24
[10] L. Hu.Topology control for multihop packet radio networks.IEEE Transactions on Communications,1993,41(10):1474-1481
[11] I. Kang,R. Poovendran.Maximizing static network lifetime of wireless broadcast ad hoc networks.In:IEEE ICC.Alaska:IEEE Computer Society,2003,2256-2261
[12] J-H Chang,L Tassiulas.Routing for maximum system lifetime in wireless ad-hoc networks.In:the 37th Annual Allerton Conference on Communication,Control and Computing.Monticello:IEEE Computer Society,1999,1-10
[13] KAWADIA V,KUMAR PR.Principles and protocols for power control in wireless ad hoc networks.IEEE JSAC,2005,23(1):76-88
[14] V. Rodoplu,T.H.Meng.Minimum energy mobile wireless networks.IEEE Journal on Selected Areas in Communications,1999,17 (8):1333-1344
[15]蔡一兵.无线自组网MAC及路由技术研究:[中国科学院研究生院计算技术研究所博士学位论文].北京:中国科学院研究生院(计算技术研究所),2006,7-32
[16] Paolo Santi.Topology control in wireless ad hoc and sensor networks.London:John Wiley & Sons Ltd,2005,27-33
[17] Andrew Y. Wang,Charles G. Sodini.On the energy efficiency of wireless transceivers.In:IEEE ICC.Istanbul:IEEE Computer Society,2006,3783-3788
[18]王青山,张信明,马涛等.Ad Hoc无线网络功率控制综述.计算机科学,2004,31(7):52-56
[19]廖鹰,齐欢,沈建京等.无线传感器网络分簇算法研究.计算机工程与应用,2009,45(29):18-21
[20] E. L. Lloyd,R. Liu,M. V. Marathe,et al.Algorithmic aspects of topology control problems for ad hoc networks.In:ACM MobiHoc.Lausanne:IEEE Computer Society,Switzerland,2002,123-134
[21] Kirousis L,Kranakis E,Krizanc D,et al.Power consumption in packet radio networks.Theoretical Computer Science,2000,243(1-2):289-305
[22] Clementi A,Penna P,Silvestri R.Hardness results for the power range assignment problem in packet radio networks.In:2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM/APPROX’99).Berkeley:IEEE Computer Society,1999,197-208
[23] Blough D,Leoncini M,Resta G,et al.On the symmetric range assignment problem in wireless ad hoc networks.In:IFIP Conference on Theoretical Computer Science.Montreal:IEEE Computer Society,2002,71-82
[24] Calinescu G,Mandoiu I,Zelikovsky A.Symmetric connectivity with minimum power consumption in radio networks.In:IFIP Conference on Theoretical Computer Science.Montreal:IEEE Computer Society,2002,119-130
[25] M. D. Penrose.The longest edge of random minimal spanning tree.Annals of Applied Probability,1997,7 (2):340-361
[26] M. Sanchez,P. Manzoni,Z. J. Haas.Determination of critical transmission range in ad-hoc networks.In:Multiaccess, Mobility and Teletraffic for Wireless Communications Conference.Venice:IEEE Computer Society,1999,293-301
[27] P. Gupta,P. R. Kumar.Critical power for asymptotic connectivity in wireless networks.In:Stochastic Analysis, Control, Optimization and Applications: a Volume in Honor of W. H. Fleming.Birkhauser:IEEE Press,1998,547-566
[28] M. D. Penrose.A strong law for the longest edge of the minimal spanningtree.The Annals of Probability,1999,27 (1):246-260
[29] P. Panchapakesan,D. Manjunath.On the transmission range in dense ad hoc radio networks.In:IEEE SPCOM.Bangalore:IEEE Computer Society,2001,1-5
[30] P. Gupta,P. R. Kumar.The capacity of wireless networks.IEEE Trans. Information Theory,2000,46 (2):388-404
[31] P. Santi,D. M. Blough,F. Vainstein.A probabilistic analysis for the range assignment problem in ad hoc networks.In:ACM MOBIHOC.Long Beach:ACM,2000,212-220
[32] P. Santi,D. M. Blough.An evaluation of connectivity in mobile wireless ad hoc networks.In:IEEE DSN.Washington DC:IEEE Computer Society:IEEE Computer Society,2002,89-102
[33] P. Santi,D. M. Blough.The critical transmitting range for connectivity in sparse wireless ad hoc networks.IEEE Transactions on Mobile Computing,2003,2(1):25-39
[34] O. Dousse,P. Thiran,M. Hasler.Connectivity in ad-hoc and hybrid networks.In:IEEE INFOCOM.New York:IEEE Computer Society,2002, 1079-1088
[35] F. Xue,P. R. Kumar.The number of neighbors needed for connectivity of wireless networks.Wireless Networks,2004,10(2):169-181
[36] Peng-Jun Wan,Chih-Wei Yi.Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks.In:5th ACM MOBIHOC.Roppongi:ACM,2004,1-8
[37] M. D. Penrose.Extremes for the minimal spanning tree on normally distributed points.Advances in Applied Probability,1998,30(3):628-639
[38] M. D. Penrose.A strong law for the largest nearest-neighbor link between random points.Journal of London Mathematical Society,1999,60(2):951-960
[39] M. D. Penrose.On k-connectivity for a geometric random graph.Random Structures and Algorithms,1999,15(2):145-164
[40] Yi. C.,Wan. P..Asymptotic critical transmission ranges for connectivity in wireless as hoc networks with Bernoulli nodes.In:IEEE WCNC.New Orleans:IEEE Computer Society,2005,1-8
[41] A.E.F. Clementi,P. Penna,R. Silvestri.The power range assignment problem in radio networks on the plane.In:17th Annual Symposium on Theoretical Aspects of Computer Science.Lille:Springer-Verlag,2000,651-660
[42] Godfried T. Toussaint.The relative neighborhood graph of a finite planar set.Pattern Recognition,1980,12(4):261-268
[43] K.R. Gabriel,R.R. Sokal.A new statistical approach to geographic variation analysis.Systematic Zoology,1969,vol. 18(3):259-278
[44] J. Gao,L. Guibas,J. Hershberger,et al.Geometric spanner for routing in mobile networks.In:ACM MOBIHOC.Long Beach:ACM,2001,45-55
[45] Tamas Lukovszki.New results on geometric spanners and their applications:[Ph.D. Thesis].Germany:University of Paderborn,1999,1-8
[46] Rajmohan Rajaraman.Topology control and routing in ad hoc networks: A survey.SIGACT News,2002,33(2):60-73
[47] Stefano Basagni,Marco Conti, Silvia Giordano,et al.Mobile ad hoc networking.USA:Wiley-IEEE Press,2004,60-88
[48] Xiang-Yang Li,Peng-JunWan,Yu Wang.Power efficient and sparse spanner for wireless ad hoc networks.In:IEEE ICCCN.Phoenix:Springer-Verlag,2001,564-567
[49] Xiang-Yang Li.Algorithmic, Geometric and Graphs Issues in Wireless Networks.Wireless Comm. and Mobile Computing,2003,3(2):119-140
[50] Xiang-Yang Li,Peng-Jun Wan,Yu Wang,et al.Sparse power efficient topology for wireless networks.In: IEEE HICSS.Big Island:IEEE Computer Society,2002,296-306
[51] J. Wu.Handbook of theoretical and algorithmic aspects of aensor, ad hoc wireless and peer-to-peer networks.Boston:Auerbach Publications,2005,99-114
[52] N. Li,J. C. Hou,L. Sha.Design and analysis of an MST-based topology control algorithm.IEEE Transactions on Wireless Communications,2005,4(3):1195-1206
[53] N. Li,J. C. Hou.Topology control in heterogeneous wireless networks: problems and solutions. In:IEEE INFOCOM 2004.Hong Kong:IEEE Computer Society,2004,232-243
[54] R. Wattenhofer,L. Li,P. Bahl,et al.Distributed topology control for power efficient operation in multihop wireless ad hoc networks . In : IEEE INFOCOM.Anchorage:IEEE Computer Society,2001,1388-1397
[55] L. Li,J. Halpern,V. Bahl,et al.Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks.In:ACM PODC.Newport:ACM,2001,264-273
[56] M. Bahramgiri,M. Hajiaghayi,V. S. Mirrokni.Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks.Wireless Networks,2006,12(2):179-188
[57] Z. Huang,C.-C. Shen,C. Srisathapornphat,et al.Topology control for ad hoc networks with directional antennas.In:IEEE ICCCN.Miami:IEEE Computer Society,2002,16-21
[58] S.A. Borbash,E. Jennings.Distributed topology control algorithm for multihop wireless networks.In:IEEE International Joint Conference on Neural Networks.Honolulu:IEEE Computer Society,2002,355-360
[59] L. Liu,B. Li.MobileGrid: capacity-aware topology control in mobile ad hoc networks.In:IEEE ICCCN.Miami:IEEE Computer Society,2002,570-574
[60] D. M. Blough,M. Leoncini,G. Resta,et al.The K-Neigh protocol for symmetric topology control in ad hoc networks.In:ACM MobiHoc.Annapolis:ACM,2003,141-152
[61] Xiang-Yang Li,WenZhan Song,Weizhao Wang.A unified energy efficient topology for unicast and broadcast.In:ACM/IEEE MobiCom.Cologne:ACM, 2005,1-15
[62]林惠敏等.有效支持拓扑控制应用的新型MAC协议.计算机工程与应用,2009,45(16):123-125
[63]陈文斌等.无线自组网拓扑控制算法研究和性能分析.半导体技术,2007,32(增刊):16-21
[64] Xiaole Bai,Dong Xuan,Ziqiu Yun,et al.Complete optimal deployment patterns for full-coverage and k-connectivity (k≤6) wireless sensor networks.In:ACM MobiHoc.Hong Kong:ACM,2008,401-410
[65] Ai Chen,Ten H. Lai,Dong Xuan.Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks.In:ACM MobiHoc.Hong Kong:ACM,2008,421-430
[66] J. Wu, F. Dai. Mobility-Sensitive Topology Control in Mobile Ad Hoc Networks.IEEE Transactions On Parallel and distributed Systems,2006, 17(6):522-535.
[67] Alessandro Bianchi,Sebastiano Pizzutilo.A tool for modeling and simulating mobile ad-hoc networks.In:MoMM.Linz:ACM,2008,438-443
[68] Z. H. Mir,D. M. Shrestha,G. H. Cho,et al.Mobility-aware distributed topology control for mobile multi-hop wireless networks.In:ICOIN.Sendai:Springer press,2006,257-266
[69] L. Bao,J.J. Garcia-Luna-Aceves.Topology management in ad hoc networks.In:ACM MobiHoc.Annapolis:ACM,2003,129-140
[70] Zhong Shen,Yilin Chang,Xin Zhang,et al.A efficient topology maintenance algorithm based on shortest path tree for wireless ad hoc networks.In: PDCAT.Dalian:IEEE Press,2005,288-292
[71]沈中,常义林,崔灿等.一种可自维护无线网络拓扑最小能量特性的分布式拓扑控制算法.计算机学报,2007,30(4):569-578
[72]贺鹏,李建东,陈彦辉等.Ad Hoc网络中基于方向性天线的分布式拓扑控制算法.软件学报,2007,18(6):1308-1318
[73]王炫,李建东,张文柱.拓扑控制对Ad Hoc网络性能的影响.计算机科学, 2006,33(6):44-47
[74] R Ramanathan.On the performance of ad hoc networks using beamforming antennas.In:ACM MobiHoc.Long Beach:ACM,2001,95-105
[75] S Vasudevan,J Kurose,D Towsle.On neighbor discovery in wireless networks with directional antennas.In:IEEE INFOCOM.Miami:IEEE Communications Society,2005,2502-2512
[76] Anand Prabhu Subramanian, Henrik Lundgren, Theodoros Salonidis, Don Towsley.Topology control protocol using sectorized antennas in dense 802.11 wireless networks. In:ICNP , Princeton:IEEE Communications Society,2009,1-10
[77] U Kumar,H Gupta,S R Das.A topology control approach to using directional antennas in wireless mesh networks . In : IEEE ICC . Istanbul : IEEE Communications Society,2006,4083-4088
[78] Christian Bettstetter , Christian Hartmann , Clemens Moser . How does randomized beamforming improve the connectivity of ad hoc networks? .In:IEEE ICC.Seoul:IEEE Communications Society,2005,3380-3385
[79]赵瑞锋,谈振辉,蒋海林.无线系统中的智能天线.电子学报, 2000,28(12):77-80
[80]余世荐.数学生态学导论.北京:科学技术文献出版社,1995
[81] Goldsmith A J,Wicker S B.Design challenges for energy-constrained ad hoc wireless networks.IEEE Wireless Communications,2002,9(4):8-27
[82] Fei Dai,Jie Wu.Efficient broadcasting in ad hoc wireless networks using directional antennas.IEEE Transactions on Parallel and Distributed Systems,2006,17(4):335-347
[83] Bellofiore,S Balanis, C A.Smart-antenna system for mobile communicationnetwork. Part 1. Overview and antenna design.IEEE Antennas and Propagation Magazine,2002,44(3):145-154
[84] Martin Furer , Balaji Raghavachari . Approximating the minimum degree spanning tree to within one from the optimal degree . In : ACM SODA.Philadelphia:ACM,1992,317-324
[85] C.A.Balanis.Antenna Theory: Analysis and Design.USA:John Wiley & Sons INC, 2nd,1982,249-328
[86] S. Yi,Y. Pei,S. Kalyanaraman.On the capacity improvement of Ad hoc wireless networks using directional antennas.In:ACM MobiHoc.Annapolis:ACM Press,2003,108-116
[87] P. Hall.Introduction to the Theory of Coverage Processes.USA:John Wiley & Sons,1988,38-52
[88]李方敏,徐文君,高超.一种适用于无线传感网络的功率控制MAC协议.软件学报,2007,18(5):1080-1091
[89] Xiangyun Zhou, Salman Durrani, Haley M. Jones.Connectivity analysis of wireless ad hoc networks with beamforming.IEEE Transactions on Vehicular Technology,2009,58(9):5247-5257
[90]陈文斌等.基于OPNET的自组网拓扑控制有效性的研究.计算机工程,2009,35(7):110-112
[91] M. Burkhart,P. von Rickenbach,R. Wattenhofer,et al.Does Topology Control Reduce Interference? In:ACM MobiHoc.Roppongi:ACM,2004,9-19
[92] Davide Bilo,Guido Proiettib.On the complexity of minimizing interference in ad-hoc and sensor networks.Theoretical Computer Science,2008,402(1):43-55
[93] K. Moaveni-Nejad,X. Li.Low-interference topology control for wireless ad hoc networks.Ad Hoc & Sensor Wireless Networks: An International Journal,2005, 1(1-2):41-64
[94] P. von Rickenbach,S. Schmid,R. Wattenhofer,et al.A robust interference model for wireless ad-hoc networks.In:IEEE WMAN.Denver:IEEE Press,2005,239-247
[95] Magnús M. Halldórsson,Takeshi Tokuyama.Minimizing interference of a wireless ad-hoc network in a plane.Theoretical Computer Science archive,2008,402(1):29-42
[96] X.-Y. Li,K. M. Neijad,W.-Z. Song,et al.Interference-aware topology control for wireless sensor networks.In:IEEE SECON.Santa Clara:IEEE Press,2005,263-274
[97] Jian Tang,Guoliang Xue,Weiyi Zhang.Interference-aware topology control and QoS routing in multi-channel wireless mesh networks . In : ACM MobiHoc.Urbana-Champaign:ACM,2005,68-77
[98] H. Zhai,J. Wang,Y. Fang.Distributed packet scheduling for multihop flows in ad hoc networks.In:IEEE WCNC.Atlanta:IEEE Press,2004,1081-1086
[99] T. Johansson,L. Carr-Motyckov.Reducing interference in ad hoc networks through topology control.In:ACM DIALM-POMC.Cologne:ACM,2005,17-23
[100] Douglas M. Blough,Mauro Leoncini,Giovanni Resta,et al.Topology control with better radio models: implications for energy and multi-hop interference.In: ACM MSWiM.Montreal:ACM,2005,260-268
[101] K. Jain,J. Padhye,V.N. Padmanabhan,et al.Impact of interference on mulit-hop wireless network performance.In:ACM MobiCom.San Diego:ACM,2003,66-80
[102] Kun-Da Wu,Wanjiun Liao.Interference-efficient topology control in wireless ad hoc networks.In:IEEE CCNC.Las Vegas:IEEE Press,2006,411-415
[103] Xiang Yu,Xinming Zhang,Can Que,et al.A practical low interference topology control for mobile ad hoc networks.In:IEEE ICN.Sainte-Luce:IEEE Computer Society Press,2007,23-29
[104]石军锋,钟先信,陈帅等.无线传感器网络结构及特点分析.重庆大学学报:自然科学版,2005,28(2):16-19
[105]闵军,张海呈,朱桂斌.自组网可靠性评价方法.电子科技大学学报,2008, 37(3):436-438
[106] Ning Li,Jennifer C Hou.Localized fault-tolerant topology control in wireless ad hoc networks.IEEE Transactions on Parallel & Distributed Systems,2006,17(4):307- 320
[107] Hajiaghayi,M.T. Immorlica,N. Mirrokni,et al.Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks.IEEE/ACM Transactions on Networking,2007,15(6):1345-1358
[108] Feng Wang,My T. Thai,Yingshu Li,et al.Fault-tolerant topology control for all-to-one and one-to-all communication in wireles networks.IEEE Transactions on Mobile Computing,2008,7(3):322-331
[109]王良民,马建峰,王超.无线传感器网络拓扑的容错度与容侵度.电子学报, 2006,34(8):1446-1451
[110]刘密霞,张玉清,洪毅.基于模糊推理的网络可生存性的建模与分析.通信学报,2009,30(1):31-37
[111]熊蔚明,刘有恒.关于通信网可靠性的研究进展.通信学报,1990,11(4):43-49
[112] A. Nayebi,H. Sarbazi-Azad.Analysis of k-Neigh topology control protocol for mobile wireless networks.Computer Networks,2009,53(5):613–633
[113] Douglas M. Blough,Mauro Leoncini,et al.The k-Neighbors approach to interference bounded and symmetric topology control in ad hoc networks.IEEE Transactions on Mobile Computing,2006,5(9):1267-1282
[114] Christian Bettstetter.On the minimum node degree and connectivity of a wireless multihop network.In:ACM MobiHoc.Lausanne:ACM Press, 2002,80-91