A Location-Aware Routing Protocol for the Bluetooth Scatternet

Bluetooth is a most promising technology for the wireless personal area networks and its specification describes how to build a piconet. Though the construction of scatternet from the piconets is left out in the specification, some of the existing solutions discuss the scatternet formation issues and routing schemes. Routing in a scatternet, that has more number of hops and relay nodes increases the difficulties of scheduling and consumes the bandwidth and power resources and thereby impacts on the performance of the entire network. In this paper, a novel routing protocol (LARP) for the Bluetooth scatternet is proposed, which reduces the hop counts between the source and the destination and reconstructs the routes dynamically using the location information of the Bluetooth devices. Besides, a hybrid location-aware routing protocol (HLARP) is proposed to construct the shortest routes among the devices with or without having the location information and degenerate the routing schemes without having any location information. Experimental results show that our protocols are efficient enough to construct the shortest routing paths and to minimize the transmission delay, bandwidth and power consumption as compared to the other protocols that we have considered. Chih-Yung Chang received the Ph.D. degree in Computer Science and Information Engineering from National Central University, Taiwan, in 1995. He joined the faculty of the Department of Computer and Information Science at Aletheia University, Taiwan, as an Assistant Professor in 1997. He was the Chair of the Department of Computer and Information Science, Aletheia University, from August 2000 to July 2002. He is currently an Associate Professor of Department of Computer Science and Information Engineering at Tamkang University, Taiwan. Dr. Chang served as an Associate Guest Editor of Journal of Internet Technology (JIT, 2004), Journal of Mobile Multimedia (JMM, 2005), and a member of Editorial Board of Tamsui Oxford Journal of Mathematical Sciences (2001--2005). He was an Area Chair of IEEE AINA'2005, Vice Chair of IEEE WisCom 2005 and EUC 2005, Track Chair (Learning Technology in Education Track) of IEEE ITRE'2005, Program Co-Chair of MNSA'2005, Workshop Co-Chair of INA'2005, MSEAT'2003, MSEAT'2004, Publication Chair of MSEAT'2005, and the Program Committee Member of USW'2005, WASN'2005, and the 11th Mobile Computing Workshop. Dr. Chang is a member of the IEEE Computer Society, Communication Society and IEICE society. His current research interests include wireless sensor networks, mobile learning, Bluetooth radio systems, Ad Hoc wireless networks, and mobile computing. Prasan Kumar Sahoo got his Master degree in Mathematics from Utkal University, India. He did his M.Tech. degree in Computer Science from Indian Institute of Technology (IIT), Kharagpur, India and received his Ph.D in Mathematics from Utkal University, India in April, 2002. He joined in the Software Research Center, National Central University, Taiwan and currently working as an Assistant Professor, in the department of Information Management, Vanung University, Taiwan, since 2003. He was the Program Committee Member of MSEAT'2004, MSEAT'2005, WASA'2006, and IEEE AHUC'2006. His research interests include the coverage problems, modeling and performance analysis of wireless sensor network and Bluetooth technology. Shih-Chieh Lee received the B.S. degree in Computer Science and Information Engineering from Tamkang University, Taiwan, in 1997. Since 2003 he has been a Ph.D. Students in Department of Computer Science and Information Engineering, Tamkang University. His research interests are wireless sensor networks, Ad Hoc wireless networks, and mobile/wireless computing.     

A New Bluetooth Scatternet Formation Protocol

A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challenges in forming an ad hoc network efficiently. In this paper, we present and analyze a new randomized distributed protocol for Bluetooth scatternet formation. We prove that our protocol achieves O(logn) time complexity and O(n) message complexity. The scatternets formed by our protocol have the following properties: (1) any device is a member of at most two piconets, and (2) the number of piconets is close to be optimal. These properties can help prevent overloading of any single device and lead to low interference between piconets. We validate the theoretical results by simulations, which also show that the scatternets formed have O(logn) diameter. As an essential part of the scatternet formation protocol, we study the problem of device discovery: establishing multiple connections simultaneously with many Bluetooth devices. We investigate the collision rate and time requirement of the inquiry and page processes. Our simulation results indicate that the total number of packets sent is O(n) and that the maximum number of packets sent by any single device is O(logn).     

蓝牙路由机制

蓝牙路由机制（BRS）基于最新蓝牙协议规范,并对之进行了改进,可提供可靠的链路,使蓝牙移动终端漫游切换时间大大减少,使网络突破10米的限制。BRS还具有一定的灵活性和扩展性,可实现BRS系统之间、与LAN/WAN之间的路由。     

A Credit-Based On-Demand QoS Routing Protocol Over Bluetooth WPANs

The quality-of-service (QoS) communication that supports mobile applications to guarantee bandwidth utilization is an important issue for Bluetooth wireless personal area networks (WPANs). In this paper, we address the problem of on-demand QoS routing with interpiconet scheduling in Bluetooth WPANs. A credit-based QoS (CQ) routing protocol is developed which considers different Bluetooth packet types, because different types of Bluetooth packets have different bandwidth utilization levels. This work improves the bandwidth utilization of Bluetooth scatternets by providing a new interpiconet scheduling scheme. This paper mainly proposes a centralized algorithm to improve the bandwidth utilization for the on-demand QoS routing protocol. The centralized algorithm incurs the scalability problem. To alleviate the scalability problem, a distributed algorithm is also investigated in this work. The performance analysis illustrates that our credit-based QoS routing protocol achieves enhanced performance compared to existing QoS routing protocols.This work was supported by the National Science Council of the Republic of China under grant nos. NSC-92-2213-E-194-022 and NSC-93-2213-E-194-028. Yuh-Shyan Chen received the B.S. degree in computer science from Tamkang University, Taiwan, Republic of China, in June 1988 and the M.S. and Ph.D. degrees in Computer Science and Information Engineering from the National Central University, Taiwan, Republic of China, in June 1991 and January 1996, respectively. He joined the faculty of Department of Computer Science and Information Engineering at Chung-Hua University, Taiwan, Republic of China, as an associate professor in February 1996. He joined the Department of Statistic, National Taipei University in August 2000, and joined the Department of Computer Science and Information Engineering, National Chung Cheng University in August 2002. Dr. Chen served as Co-Editors-in-Chief of International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Editorial Board Member of Telecommunication System Journal, International Journal of Internet Protocol Technology (IJIPT) and The Journal of Information, Technology and Society (JITAS). He also served as Guest Editor of Telecommunication Systems, special issue on “Wireless Sensor Networks” (2004), and Guest Editor of Journal of Internet Technology, special issue on “Wireless Internet Applications and Systems” (2002) and special issue on “Wireless Ad Hoc Network and Sensor Networks” (2004). He was a Vice Co-Chair, Wireless IP Symposium of WirelressCOM2005, USA (2005) and a Workshop Co-Chair of the 2001 Mobile Computing Workshop, Taiwan. Dr. Chen also served as IASTED Technical Committee on Telecommunications for 2002–2005, WSEAS International Scientific Committee Member (from 2004), Program Committee Member of IEEE ICPP'2003, IEEE ICDCS'2004, IEEE ICPADS'2001, ICCCN'2001–2005, MSN'2005, IASTED CCN'2002–2005, IASTED CSA'2004–2005, IASTED NCS'2005, and MSEAT'2003–2005. His paper wins the 2001 IEEE 15th ICOIN-15 Best Paper Award. Dr. Chen was a recipient of the 2005 Young Scholar Research Award given by National Chung Cheng University to four young faculty members, 2005. His recent research topics include mobile ad-hoc network, wireless sensor network, mobile learning system, and 4G system. Dr. Chen is a member of the IEEE Computer Society, IEICE Society, and Phi Tau Phi Society. Keng-Shau Liu received the M.S. degree in Computer Science and Information Engineering from National Chung Cheng University, Taiwan, Republic of China, in July 2004. His research includes wireless LAN, Bluetooth, and mobile learning.     

基于能量感知的Ad hoc网络路由协议的研究

Adhoc网络是指由一组带有无线通信收发装置的移动节点组成的一个多跳、自组织、无中心网络。作为一个不需要固定基础设施特殊的无线网络,它在民用、军事与测量通信领域占据一席之地,成为当前网络研究的热点。本论文的主要研究目标是利用国内外现有的相关研究成果,对Adhoc自组网常用的AODV路由协议进行节能的研究,使其达到能耗低,长时间工作的目标,以应用在测试与监控中。最后通过仿真比较得以证明其改进的有效性。     

支持蓝牙Scatternet网络的IDSR协议研究

该文首先对蓝牙Scatternet网络的特点及其路由协议类型作了简单地描述,指出蓝牙Scatternet网络只能采用分层的、按需路由协议。根据蓝牙Scatternet的特殊性,对动态源路由DSR协议进行必要的改进,构造了新的路由请求与路由维护过程,并针对改进的DSR协议对蓝牙协议没有规定的、由从节点发起的通信进行了简单的讨论。网络仿真实验是在Linux系统上利用NS2通过简化蓝牙协议进行的,通过网络的吞吐量与系统到达率之间的关系验证了理想状态下IDSR能够提高蓝牙Scatternet网络的数据传输性能。     

蓝牙网络封装协议

介绍了蓝牙网络封装协议（BNEP：Bluetooth Network Encapsulation Protocol）的定义、格式及所具有的对上层IP协议提供类型似于以太网的接口和支持IEEE 802.3/Ethernet封装的网络协议等功能。由于BNEP能把IEEE802.3/Ethernet封装支持的网络协议包封装起来，直接通过蓝牙L2CAP协议进行无线传输，因此介绍了一种BNEP在蓝牙个人无线局域网（PAN：Personal Area Network）中，通过一个网络接入点来访问远程网络的应用。     

Efficient Scheduling Algorithms for Bluetooth Scatternets

When more than seven devices are connected in a Bluetooth scatternet, bridge devices are used to connect two piconets to the scatternet. To deal with possible data transmissions between different piconets, the bridge device must frequently switch to different masters. Suppose, however, that a bridge is serving a piconet and the master in another piconet is calling it at the same time, the calling master has to wait until the bridge completes the previous service. Such transmission delay may accumulate over a long period and the performance of the whole Bluetooth network will degrade significantly. In this work, two new scheduling protocols, namely the static schedule and the hybrid schedule were implemented in an effort to smooth this kind of transmission delay in Bluetooth networks. In this static schedule the rendezvous points between piconets are coordinated by distributing them by using a graph edge coloring technique. In case of a heavy traffic load, the static schedule is expected to perform well. On the other hand, in case of a light traffic load, the static schedule may cause long and unavoidable routing delays even when there is no transmission between piconets; in this case a naive random round-robin (RR) schedule in each piconet is more appropriate. Thus, in the hybrid schedule, each master initially runs a RR scheme in its piconet. When the traffic load is heavier than a predefined threshold value, it runs the static schedule. Finally, simulations were conducted by using an ns-2 simulator and Bluehoc to demonstrate the efficiency and effectiveness of the proposed scheduling protocols.

Bluetooth协议模型及应用

Bluetooth是一种短距离范围内的无线数据和语音通信的开放性全球规范,目的是取代现有的PC、打印机、传真机和移动电话等设备上的有线接口。较详细介绍了Bluetooth的协议体系和应用模型。     

BlueMesh: Degree-Constrained Multi-Hop Scatternet Formation for Bluetooth Networks

In this paper we describe BlueMesh, a new protocol for the establishment of scatternets, i.e., multi-hop wireless networks of Bluetooth devices. BlueMesh defines rules for device discovery, piconet formation and piconet interconnection so to generate connected scatternets with the following desirable properties. BlueMesh forms scatternets without requiring the Bluetooth devices to be all in each other transmission range. BlueMesh scatternet topologies are meshes with multiple paths between any pair of nodes. BlueMesh piconets are made up of no more than 7 slaves. Simulation results in networks with over 200 nodes show that BlueMesh is effective in quickly generating a connected scatternet in which each node, on average, does not assume more than 2.4 roles. Moreover, the route length between any two nodes in the network is comparable to that of the shortest paths between the nodes.     

一种蜂窝辅助的AODV路由协议

首先提出了一种新的融合AdHoe和蜂窝网络体系结构。接着在这种融合网络结构下,对传统AODV路由协议进行了改进,设计了一种蜂窝辅助的AODV路由协议（CA-AODV）。CA-AODV路由协议利用蜂窝系统中代理节点所保存的移动adhoe节点位置信息,来维护、更新节点中的路由,这种主动维护路由信息的方法从而可以提高传统AODV协议的性能。最后文中通过NS-2仿真表明：在数据发送率较高的情况下,CA-AODV路由协议能显著提高传统AODV协议的系统参数性能。     

支持多速率传输的动态Ad hoc路由协议

该文提出了一种支持动态多速率传输的无线Ad hoc网络路由方案,它能够增加网络的吞吐量和减少分组的传输时延。该方案把路由功能分为两个部分：广域路由功能和本地路由功能。本地路由功能是一个独立的子层,负责在广域路由功能选择的中继节点之间适当地增加新转发节点,使最终路由中的每段链路都能使用高速率进行传输,从而减小数据发送过程中总的信道占用时间。该文设计了一种LDSR协议来执行本地路由功能。仿真结果显示了新的路由方案能够有效地利用网络节点的多速率传输能力,获得更好的网络性能。     

On efficient configurations for Bluetooth scatternets

In this paper we investigate the relationship between capacity and network topology for Bluetooth scatternets. We start by considering the intrinsic capacity limits of a scatternet structure, and we show that capacity may be approached in the presence of very local traffic only and under specific conditions on the scatternet structure. A worst case analysis is presented, addressing the performance of various network configurations in the presence of a uniform end-to-end traffic matrix. In particular, some efficient configurations, based on Platonic solids, are introduced and analyzed. Finally, we focus on the closed loop configuration, for which algorithms able to improve scatternet performance by exploiting traffic locality are presented and discussed.     

A self-healing On-demand Geographic Path Routing Protocol for mobile ad-hoc networks

We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherits the best of the three well-known techniques for routing in ad-hoc networks, viz., greedy forwarding, reactive route discovery, and source routing. In OGPR protocol, source nodes utilize the geographic-topology information obtained during the location request phase to establish geographic paths to their respective destinations. Geographic paths decouple node ID’s from the paths and are immune to changes in the network topology. Further, they help nodes avoid dead-ends due to greedy forwarding. To utilize geographic paths even in sparser networks, OGPR uses a path-healing mechanism that helps geographic paths adapt according to the network topology. We present extensions to OGPR protocol to cope with networks containing unidirectional links. Further, we present results from an extensive simulation study using GloMoSim. Simulation results show that OGPR achieves higher percentage packet delivery and lower control overhead, compared to a combination of GPSR+GLS protocols, AODV, and DSR under a wide range of network scenarios.     

IP 多播路由协议的分析

分析介绍了几种典型的IP多播路由协议，如DVMRP、PIM、MOSPF和CBT等，并对这几种IP多播路由协议进行了分析对比。     

嵌入式蓝牙协议的数据传输实现

文中首先介绍了蓝牙协议栈中的主机控制器接口（HCI）,服务发现协议（SDP）及逻辑链路控制与适配协议（L2CAP）,并通过一个具体的嵌入式蓝牙数据传输系统,实现了这些协议。文章给出了该系统的硬件框图、软件的总体设计模块（主机控制器接口模块、服务发现模块和数据传输模块）、以及软件设计流程,最终实现了两个蓝牙模块之间的无线数据传输。     

一种拥塞感知的TFRC协议慢启动算法

 本文分析了TFRC(TCP-Friendly Rate Control)协议在慢启动阶段采用类似TCP协议的倍增发送速率机制存在的问题,提出了一种利用回路响应时间(Round Trip Time,RTT)来自适应调节慢启动阶段速率的算法.通过分析实际RTT值和EWMA(Exponentially Weighted Moving Average)处理后的平均RTT值来感知网络当前的拥塞状况,以调节发送速率的激进程度.仿真实验表明,该方法对TFRC协议具有明显的改进作用,减少了慢启动阶段结束时的报文丢失率,提高了协议的传输平稳度和吞吐量,从而能更有效地适应多媒体流的传输要求.     

SAHRC: 一种基于分簇的无线传感器网络路由控制算法

设计特定应用场合的路由控制算法是无线传感器网络路由控制领域研究的热点之一。在深入研究经典网络路由算法(LEACH)的基础上,提出一种基于分簇的自适应混合型路由控制(SAHRC)算法。该算法针对大规模事件驱动型网络场景应用,采用网内节点启发机制解决了LEACH算法面对大规模网络缺乏自适应性,未考虑节点剩余能量,通信效率难以得到保障等问题。仿真结果表明,新的SAHRC算法比原有LEACH算法有更好的节能性和稳定性。     

基于能量与链路稳定性感知的按需路由协议

对于复杂的室外环境,无线传感器网络如何建立可靠的路由,并尽可能延长全网寿命是一个关键问题.在分析总结现有无线Ad Hoe网络路由协议的优缺点的基础上,提出了一种基于能量与链路稳定性感知的多度量的按需路由协议ELSA-AODV.ELSA-AODV协议是AODV协议的增强与扩展,在保证路由可靠性与稳定性的同时,平衡全网的通信负荷与能量,大大延长了全网的工作寿命.通过仿真实验,验证了ELSA-AODV的有效性.