检索结果-内蒙古大学图书馆

29th IEEE International Conference on Distributed Computing Systems

作者： Jeddah, Ahmed Zaguia, Nejib Jourdan, Guy-Vincent Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9781424444465

we study in this paper the impact of the modifications introduced in version 1.2 of the bluetooth specifications on bluetooth scatternet formation (BSF) algorithms. Up to now, the effect of these modifications on BSF algorithms had not been analyzed. We show that: 1) bluetooth ver1.2 and upward have a major positive effect on static BSF algorithms (i.e. those which require an external device discovery phase). We conducted some experiments on a common device discovery technique for static BSF algorithms and compared its performance using Ver1.2 and Ver1.1 (the latter is used in most BSF studies). We found that this technique, using ver1.2, generates a connected topology about 3.5 times faster than it does using ver1.1. It also discovers about 20% more edges. 2) Dynamic algorithms, on the other hand, are not affected by these modifications. This will be proven using some experiments and some analytical arguments. These results give more applicability to static BSF algorithms and call for more research on dynamic BSF algorithms.

关键词： bluetooth scatternet formation Device Discovery Personal Area Networks

来源：评论

学校读者我要写书评

暂无评论

Forming MS-Free and Outdegree-Limited bluetooth scatternets in Pessimistic Environments

引用

IEEE INTERNET OF THINGS JOURNAL 2015年第6期2卷 538-550页

作者： Jedda, Ahmed Mouftah, Hussein T. Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON K1N 6N5 Canada

This paper introduces two distributed bluetooth scatternet formation (BSF) algorithms, called BSFWAVVY(MSF) and BSFWAVVY(ODL). The first algorithm forms scatternets that does not contain master-slave (MS) bridges (MS-free scatternets), whereas the second algorithm forms scatternets in which each piconet has at most k slaves (outdegree-limited scatternets). The motivation is that MS-freeness and outdegree limitation are the two properties that significantly improve the quality of the scatternets. However, and contrary to the existing BSF algorithms, our algorithms consider these properties under pessimistic environments modeled as arbitrary networks (i.e., no assumptions are made on the underlying network topology). We give two lower bounds that prove the asymptotic optimality of our algorithms with respect to time complexity and message complexity. We also show that the problem of forming MS-free and outdegree-limited scatternets at the same time is NP-COMPLETE. We introduce a time-efficient implementation of BSFWAVVY(MSF) and BSFWAVVY(ODL) that exploits unique characteristics of bluetooth networks. Simulation experiments show that our algorithms have short execution time relative to major BSF algorithms and it outperforms other major algorithms with respect to various performance metrics.

关键词： bluetooth scatternet formation distributed algorithms wireless ad-hoc networks

来源：评论

学校读者我要写书评

暂无评论

Distributed Algorithms for Networks formation in a Scalable Internet of Things

Distributed Algorithms for Networks Formation in a Scalable ...

引用

作者： Jedda, Ahmed University of Ottawa

学位级别：master

The Internet of Things (IoT) is a vision that aims at inter-connecting every physical identifiable object (or, a thing) via a global networking infrastructure (e.g., the legacy Internet). Several architectures are proposed to realize this vision; many of which agree that the IoT shall be considered as a global network of networks. These networks are used to manage wireless sensors, Radio Frequency IDentification (RFID) tags, RFID readers and other types of electronic devices and integrate them into the IoT. A major requirement of the IoT architectures is scalability, which is the capability of delivering high performance even if the input size (e.g., number of the IoT objects) is large. This thesis studies and proposes solutions to meet this requirement, and specifically focuses on the scalability issues found in the networks of the IoT. The thesis proposes several network formation algorithms to achieve these objectives, where a network formation algorithm is an algorithm that, if applied to a certain network, optimizes it to perform its tasks in a more efficient manner by virtually deleting some of its nodes and/or *** thesis focuses on three types of networks found in the IoT: 1) RFID readers coverage networks; whose main task is to cover (i.e., identify, monitor, track, sense) IoT objects located in a given area, 2) readers inter-communications networks; whose main task is to guarantee that their nodes are able to inter-communicate with each other and hence use their resources more efficiently (the thesis specifically considers inter-communication networks of readers using bluetooth for communications), and 3) Object Name Systems (ONS) which are networks of several inter-connected database servers (i.e., distributed database) whose main task is to resolve an object identifier into an Internet address to enable inter-communication via the Internet. These networks are chosen for several reasons. For example, the technologies and concepts found in these n

关键词： Internet of Things Distributed Algorithms Networks formation bluetooth scatternet formation RFID Peer-To-Peer Computing Object Name Systems Distributed Hash Tables

来源：评论

学校读者我要写书评

暂无评论

Towards better understanding of the behaviour of bluetooth networks distributed algorithms

引用

INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS 2012年第6期27卷 563-586页

作者： Jedda, Ahmed Jourdan, Guy-Vincent Zaguia, Nejib Univ Ottawa Sch Elect Engn & Comp Sci 800 King Edward Ottawa ON K1N 6N5 Canada

The use of frequency hopping spread spectrum in bluetooth significantly differentiates its networks from classical radio networks. In order to observe such differences, we studied basic algorithms, in particular neighbour discovery and message exchange algorithms. Some of the major differences are found in the procedures of device discovery and link establishment, which are studied in this paper. We focus on their impact on bluetooth networks' distributed algorithms. We show through detailed simulation experiments that minor modifications to the bluetooth specifications or their implementation may significantly affect the performance of well-known neighbour discovery algorithms. We then study the impact of the procedures of link establishment with the purpose of finding time-efficient implementations of communication rounds for bluetooth networks. We study OrderedExchange and RandomExchange as both algorithms implement communication rounds in bluetooth, but use the PAGE and PAGE SCAN states differently. Theoretical analysis shows that RandomExchange has a better time complexity, while simulation experiments show that OrderedExchange significantly outperforms RandomExchange in networks with a practical size (110 nodes and less). We use the previous results to improve the time efficiency of bluetooth scatternet formation algorithms through the introduction of the time-efficient algorithm OrderedExchangeCMIS. We believe that the study of some other basic algorithms (such as broadcasting, spanningtree and election) will lead to a better understanding of bluetooth networks, and as a consequence, to more efficient algorithms that fully leverage the strength of this type of network.

关键词： bluetooth frequency hopping bluetooth scatternet formation distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：