蓝牙分散网的形成算法

当前的蓝牙规范只对各个蓝牙设备的连接、通讯以及蓝牙微微网的形成作出了明确的规定,但是只是简单的描述了由微微网组成的分散网,没有对分散网的形成加以论述.针对这一问题提出了以蓝牙设备的电池电量为权值的组网算法,该算法能够保证设备工作最长的时间.该算法能够动态地适应网络的变化,网络的自愈合性,及动态自适应性良好.     

一种改进的蓝牙分散网分布式拓扑构成算法

蓝牙分散网是由多个微微网组成的自组网络,由于其应用前景广阔,已经成为当前研究热点之一。蓝牙分散网的网络拓扑构成复杂且移动性强,现行的蓝牙规范并未对分散网的拓扑构成作详细的说明,因此这是一个极具挑战性的课题。提出了一种改进的蓝牙分散网的分布式拓扑构成算法,使用对称/不对称连接机制产生一个超级结点,并由这个超级结点应用分布式拓扑构成算法形成最终的分散网拓扑结构。性能仿真分析表明:该算法具有较快的网络创建时间、延时低、结点数目不受限制并能适应网络的动态变化。     

蓝牙自组个人网监听模式下分散网调度算法

蓝牙自组个人区域网络是由具有蓝牙功能的设备组成一个不需额外网络设备,在某个区域内一起自主协调工作,相互间自由通信的独立无线移动网络.网络中的某些节点采用时分复用方式参与多个微微网中并转发网络数据.由于节点在某时刻只能加入其中一个微微网中,这就需要微微网间或者分散网调度算法.监听模式为分散网调度算法提供了一个比较灵活的方式并且无须更改协议.提出了一种基于监听模式的自适应分散网调度算法,有效解决了这个具有挑战性的课题.算法监控各个链路上的流量,并获得流量变化数据,根据这些数据实时改变节点在各个链路上的监听时隙分配比例.通过对算法仿真结果的对比和分析,证明算法能够提高吞吐量,减少传输延迟,改善网络性能.     

蓝牙无线传感器网络近饱和组网方法

针对蓝牙在无线传感器网络中的应用,提出了一种蓝牙无线传感器网络组网方法,详细地描述了组网过程,并对该方法的性能进行了分析评估。组网方法采用了树形拓扑、近饱和微微网、关键节点备份等机制,具有网络内微微网数较少、网络健壮性较好、生存时间较长的优点。     

基于无线传感器网络拓扑的研究与设计

网络拓扑的研究是未来WSN发展的方向和目标。本文通过对无线传感网zigbee协议、节点组网及网络拓扑等内容的研究,运用无线传感网协调器节点组网并且作为嵌入式网关与上位机PC进行串口通信,实现拓扑结构的GUI显示。本文设计实现了一种节点网络拓扑可视化的方法,用图形描述节点之间抽象的拓扑结构,对网络的稳定性和多跳性进行研究。同时,本文对节点设备的温度、节点电压、RSSI的采集,实现网络中节点状态实时监测以及网络寿命的评定,对于研究高效、稳定的网络拓扑结构有着重要的意义。     

一种蓝牙分散网拓扑形成算法的设计与实现

针对现有的蓝牙分散网拓扑形成算法的动态性和自愈性较差的问题,提出了一种新算法.该算法综合考虑了对分散网互连有显著影响的微微网的个数、负载均衡和结点移动性等因素,使最终得到的分散网拓扑是一个异构的、局部互连网状的结构,该结构具有较强自愈和容错能力.利用BlueHoc蓝牙扩展模块在NS-2仿真器上对算法进行了模拟.结果显示,提出的算法可以有效地用于蓝牙分散网拓扑结构的创建.     

基于仿生学的多跳蓝牙散列网组网算法

为解决在多跳环境下蓝牙设备之间动态组建散列网存在的问题,利用对生物的群体性行为研究得出的集群智能聚类模型的自组织特点,提出了一种新型组网算法BBSF（Based on Bionics Scatternet Formation）。BBSF算法利用一种无环连通的“类树”的拓扑结构实现各个散列网子网之间的融合,从而对于散列网子网间的合并可以实现简洁有效的控制,在多跳环境下提供了一种新的分布式动态组网设计途径。最后利用网络仿真软件NS-2（Network Simulator）及其扩展插件,对提出的算法进行了不同环境和条件下的仿真,并将该算法同蓝牙散列网的典型组网算法进行了性能比较。     

蓝牙分散网的多径不相交的路由算法

蓝牙的分散网是一种特殊的自组网．由于蓝牙设备的连接和通信的特性，传统自组网的路由协议不适于蓝牙网络．针对这个问题，提出了一种多径不相交(MPD)的路由算法．仿真结果表明，采用多条路径并行发送数据，提高了数据的投递率，减少了端到端之间的传输延迟，从而有效地减少了网络拥塞；避免了由于路由崩溃，造成系统瘫痪．     

一种蓝牙分散网拓扑结构创建和网络路由分布式算法

蓝牙分散网潜在的广阔应用前景使它逐渐成为自组网络研究热点之一。蓝牙分散网所具有的特殊限制和特性给有效创建分散网络拓扑结构和网络路由带来了挑战。提出和分析了一种分布式蓝牙分散网拓扑结构创建算法和以此为基础的网络路由算法。它是一种简单有效的可递归算法，具有良好的扩展性。文章假定通信距离内的两结点间能建立物理连接。通过数学证明和仿真试验，算法具有以下性能：时间复杂度为O（log N)，消息复杂度为O（N），分散网网络直径为O（log N)。利用特殊的地址表示法，运行简单的路由算法可实现单播和广播路由。     

多接口车载自组织网络频谱分配算法研究

如何提升链路的并行传输能力是车载自组网面临的重要问题.如果在车辆上装配多个无线接口,并且分别调制到不同的正交信道可以有效增强链路的并行传输能力,从而提升网络吞吐率.针对拓扑变化对多接口车载自组网动态频谱分配带来的影响,提出了一种多接口车载自组网动态频谱分配算法.算法根据车辆的运动速度进行分簇,然后在簇头间通信中采用离线频谱分配策略,从而避免了网络的拓扑变化对频谱分配造成的影响.而簇内车辆具有相同的运动速度,所以具有稳定的簇内拓扑结构,有利于频谱分配算法的应用.仿真分析表明,提出的算法适用于多接口车载自组网,在动态拓扑环境下表现出了良好的性能.     

一个两步蓝牙散射网形成算法TBSF

蓝牙是一门新兴的低功耗、低成本短距离无线技术，它使便携设备能方便快捷地形成短距离无线网，同时为构建成本低廉的移动自组网带来了新的选择方案．提出一个异步的、完全分布式蓝牙散射网构造算法——TBSF，首先由所有蓝牙节点生成一系列独立匹克网，然后互连匹克网成为散射网．基于节点邻居个数选择主或桥节点，通过一个节点角色转换图确定桥节点充当的角色．任意两个相邻匹克网之间通过惟一的连接路由互连，最终形成一个连通的散射网，主和桥节点构成散射网的一个连通支配集．仿真实验表明，TBSF算法创建散射网具有较好特性．     

遗传算法在蓝牙scatternet组网中的应用

蓝牙a＆hoc网络包括微微网与散射网两种组网方式,可以实现短距离无线通信,并能较好的满足实际需求。其中,散射网的拓扑结构与组网方式很大程度上影响与制约着蓝牙技术的应用。为了提高蓝牙散射网的组网效率与性能,文中提出了基于遗传算法的组网方式,通过该算法可较好的改进散射网的形成速度。     

Distributed Construction and Maintenance of Bandwidth and Energy Efficient Bluetooth Scatternets

Bluetooth networks can be constructed as piconets or scatternets depending on the number of nodes in the network. Although piconet construction is a well-defined process specified in Bluetooth standards, scatternet formation policies and algorithms are not well specified. Among many solution proposals for this problem, only a few of them focus on efficient usage of bandwidth in the resulting scatternets. In this paper, we propose a distributed algorithm for the scatternet formation problem that dynamically constructs and maintains a scatternet based on estimated traffic flow rates between nodes. The algorithm is adaptive to changes and maintains a constructed scatternet for bandwidth-efficiency when nodes come and go or when traffic flow rates change. Based on simulations, the paper also presents the improvements in bandwidth-efficiency and reduction in energy consumption provided by the proposed algorithm.     

An efficient reconstruction approach for improving Bluetree scatternet formation in personal area networks

Bluetooth is a communication technology for personal area networks (PANs). To support communication with more than eight bluetooth-enabled devices, a scatternet must be formed in the PAN. Bluetree is one commonly used topology for scatternet formation. To reduce traffic load of the Bluetree scatternet, we use the piconet transfer concept to move piconets on a well-formed Bluetree scatternet. The piconet movements are performed based on a distributed manner using two well-known tree traversal procedures: post-order traversal and level-order traversal. These two procedures do not take much computation time, where time complexities are O(n_p) and n_p is the number of piconets on a Bluetree scatternet (not the number of nodes on a Bluetree). Compared with previous approaches, the proposed approach can greatly reduce the traffic load and computational costs. Finally, simulation experiments show the effectiveness of the proposed approach in improving the formation of Bluetree scatternet.     

BlueCube: Constructing a hypercube parallel computing and communication environment over Bluetooth radio systems

In parallel computing structures, Hypercubes [P. J. Wan, L. W. Liu, Y. Yang, Optimal routing based on the super-topology in Hypercube WDM networks, 1999, pp. 142–149] and [Y. R. Leu, S. Y. Kuo, A fault-tolerant tree communication scheme for hypercube systems, IEEE Trans. Comput. 45(6) (1996) 643–650] have many advantages: they support parallel computing, provide disjoint paths, and tolerate faults. If devices with computing capabilities can be linked as a Hypercube by taking advantage of Bluetooth radio's features, then an efficient communication and high-performance computing environment can be established by applying currently used algorithms. A Bluetooth device randomly searches for and connects with other devices, using time-consuming inquiry/inquiry scan and page/page scan operation and hence, results in an uncontrolled scatternet topology and inefficient communications. The present work proposes a three-stage distributed construction protocol for rapidly organizing a Hypercube computing environment that was constructed from Bluetooth devices. The proposed protocol governs the construction of links, the assigning of roles and the formation of the scatternet in order to efficiently construct a Hypercube structure. The constructed scatternet easily enables Bluetooth devices to establish a routing path, tolerate faults and create disjoint paths, and thus, achieves parallel and distributed computing in a Bluetooth wireless environment. Experimental results reveal that the proposed protocol can set up a scatternet that is appropriate for parallel computing and communications.     

TARP: A traffic-aware restructuring protocol for Bluetooth radio networks

Bluetooth is a low-cost and short-range wireless communication technology. The Bluetooth device randomly searches and connects with other devices using the inquiry/inquiry scan and the page/page scan operations, resulting an uncontrolled scatternet topology. The unpredictable scatternet topology usually raises the problem of redundant traffic and causes inefficient communications. A traffic-aware restructuring protocol (TARP) is presented for partially restructuring a piconet or a pair of two neighboring piconets by applying role switch mechanism. The proposed TARP mainly consists of intra-piconet and inter-piconet restructuring protocols. According to the recent routes and their traffic load information, the intra-piconet restructuring protocol adjusts piconet structure by selecting the proper device to play a master role of a piconet and applies takeover operation to rapidly restructure the piconet topology. The inter-piconet restructuring protocol exchanges devices of two neighboring piconets to reduce the route length and thus improve the power and bandwidth consumptions and the end-to-end transmission delay. Performance results reveal that the proposed restructuring protocols reduce path length of recent routes and save power consumption, thus significantly improve the performance for a given connected scatternet.     

基于Bluestars的新的设备查找及散列网形成协议

介绍一种新的方法来解决蓝牙标准中设备查找和散列网形成的问题.同时介绍一种随机的模型,使用这种模型可以基于非常简单的本地规则就能产生高概率连通性的拓扑.在此基础上,发展了多跳蓝牙设备查找及散列网形成协议.通过仿真表明,该方法实现简单、快速、低开销.