A Location-Aware Routing Protocol for the Bluetooth Scatternet

Authors:
Chih-Yung Chang;Prasan Kumar Sahoo;Shih-Chieh Lee
Affiliations:
Department of Computer Science and Information Engineering, Tamkang University, Taipei, Taiwan;Department of Information Management, Vanung University, Chung-Li, Taiwan;Department of Computer Science and Information Engineering, Tamkang University, Taipei, Taiwan
Venue:
Wireless Personal Communications: An International Journal
Year:
2007

Citing 0
Cited 3

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

Journal of Network and Computer Applications
Area-Based Collaborative Ubiquitous Work within Organizational Environments

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Nomadic user interaction/cooperation within autonomous areas

CRIWG'09 Proceedings of the 15th international conference on Groupware: design, implementation, and use

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.