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

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

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

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

A framework for building Bluetooth scatternets: A system design approach

Building Bluetooth scatternets is the focus of a lot of research activity where scatternet formation algorithms are developed to optimize various performance criteria. In this paper, we focus on establishing a framework within which these algorithms can be exploited in an operational Bluetooth network. First we review pertinent parts of the Bluetooth protocol stack and then we present issues of concern related to the direct implementation of these algorithms on Bluetooth networks. Finally, to address this issue, we introduce a framework for creating scatternets and show how existing scatternet formation algorithms can be re-used by altering the layer at which they become visible to the Bluetooth protocol stack.     

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

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

分布式动态蓝牙散列网形成算法*

当前的蓝牙规范对微微网的形成、调度和路由选择问题进行了规定,但由多个微微网组成的散列网只作了简单的描述,没有对散列网的形成加以论述。针对这一问题提出了许多散列网的形成算法,但这些算法没有充分考虑设备的动态特性,就设备的动态特性提出了分布式动态算法。该算法提高了网络的自愈合性,及动态自适应性。     

一种改进的蓝牙分散网形成算法

当前的蓝牙规范对微微网的形成、调度和路由选择问题进行了规定，而多个微微网组成的分散网只做了简要的描述，没有对分散网的形成问题加以论述，针对这一问题，提出了许多分散网的形成算法，但有些算法没有考虑设备的移动性，本文就设备的移动性问题，对已提出的算法加以改进，改进后的算法提高了系统的性能，节省了有限的系统资源。     

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

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

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

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

BGN：一种新的蓝牙传感器网络分散网构造算法

在蓝牙分散网中,桥节点的数量和每个桥节点的度是影响主干网性能的重要因素。在生长树的基础上提出一种新的蓝牙分散网构造算法——BGN。该算法利用生长树主干节点间预留的连接将树改造成网,所形成的分散网能够在保持一定程度连通性的同时避免过多的冗余链接。仿真实验的结果表明,该算法所生成的分散网结构在桥节点数量、平均路径长度、网络可靠性和网络最大传输流量方面具有优势。     

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

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

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.     

Enhanced AODV routing protocol for Bluetooth scatternet

Bluetooth is one of the most widespread technologies for personal area networks that allow portable devices to form multi-hop Bluetooth ad hoc networks, so called scatternets. Routing is one of the challenges in scatternets because of its impact on the performance of the network. It should focus on reducing the power consumption in the network because most of the nodes are battery-operated portable devices. In this paper, we propose a routing protocol for Bluetooth scatternets that customizes the Ad hoc On-Demand Distance Vector (AODV) routing protocol by making it power-aware and suitable for scatternets. It enhances the AODV flooding mechanism by excluding all non-bridge slaves from taking apart in the AODV route discovery process. In addition, it improves the AODV route discovery phase by considering the hop count, the predicated node’s power, and the average traffic intensity for each node as metrics for best route selection. By removing HELLO packets, our protocol reduces the control packets overhead and the power consumption in network devices. Simulation results show that the proposed protocol achieved considerable improvements over other enhanced AODV protocols by increasing the data delivery ratio by 10.78%, reducing the average end-to-end delay by 8.11%, and reducing the average energy consumption by 7.92%.     

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

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

多跳蓝牙设备分散网的动态组网算法

近几年无线自组网络发展迅速,而蓝牙自组网的拓扑构建问题已成为无线自组网络研究的一个重要分支.目前已有很多学者提出了蓝牙设备在多跳环境下的不同组网协议的算法,但大多是针对静态的组网问题.对于蓝牙设备不在直接通讯范围内的多跳通讯要求以及节点的动态变化情况,提出了一种新的蓝牙设备分散网的分布创建思想,同时该算法满足动态性的要求.形成的分散网的拓扑结构采用类似树形结构、没有根节点的无环连通图,因而具有控制简洁,组网快捷的特点.     

Novel route maintenance protocols for the Bluetooth ad hoc network with mobility

Bluetooth technology is specially designed for the wireless personal area networks to replace cable. Several challenges exist in Bluetooth scatternet formation and routing, since nodes can arrive and depart at arbitrary times. In this paper, novel route maintenance algorithms are proposed for the Bluetooth ad hoc networks, where nodes can enter or exit from the piconets time to time. Our protocols guarantee the connectivity among nodes and reconstruct the routes dynamically by considering location information of the nodes. Besides, it is proposed how to reduce the number of hops and to form the shortest route between the source and the destination due to addition of new nodes to a piconet. Performance analysis of our protocols show that they outperform in terms of end to end transmission delay, bandwidth consumption and average hop counts as compared to similar Bluetooth routing protocols that we have considered.     

Ring of Masters (ROM): A new ring structure for Bluetooth scatternets with dynamic routing and adaptive scheduling schemes

This paper attempts to address the scatternet problem in Bluetooth through a comprehensive approach. We propose a new decentralized ring structure to combat the formation of traffic bottlenecks. The adopted construction protocol ensures flexibility of node selection and a good level of fault tolerance. The routing protocol combines both simplicity and robustness by taking advantage of the ring structure and relying on the collective memory of piconets to make forwarding and discarding decisions. The intra- and inter-piconet scheduling algorithm, called ROM adaptive scheduling (RAS), dynamically allocates time slots and is responsive to the varying workload conditions. We demonstrate, through analysis and simulations, that the various components of ROM yield a system that has good performance in terms of throughput, latency, delivery, and link utilization.     

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.     

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

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

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.     

Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation

We address the problem of localized scatternet formation for multihop Bluetooth-based personal area ad hoc networks. Nodes are assumed to know their positions and are able to establish connections with any of their neighboring nodes, located within their transmission radius, in the neighbor discovery phase. The next phase of the proposed formation algorithm is optional and can be applied to construct a sparse geometric structure in a localized manner. We propose here a new sparse planar structure, namely, partial Delaunay triangulation (PDT), which can be constructed locally and is denser than other known localized planar structures. In the next mandatory phase, the degree of each node is limited to seven by applying the Yao structure, and the master-slave relations in piconets are formed in created subgraphs. This phase consists of several iterations. In each iteration, undecided nodes with higher keys than any of their undecided neighbors apply the Yao structure to bound the degrees, decide master-slave relations on the remaining edges, and inform all neighbors about either deleting edges or master-slave decisions. To the best of our knowledge, our schemes are the first schemes that construct degree limited (a node has at most seven slaves) and connected piconets in multihop networks, without parking any node. The creation and maintenance require small overhead in addition to maintaining accurate location information for one-hop neighbors. The experiments confirm good functionality of created Bluetooth networks in addition to their fast creation and straightforward maintenance.