MaCC: supporting network formation and routing in wireless personal area networks

M. Takizawa, H. Aida, M. Saito, Y. Tobe, H. Tokuda
{"title":"MaCC: supporting network formation and routing in wireless personal area networks","authors":"M. Takizawa, H. Aida, M. Saito, Y. Tobe, H. Tokuda","doi":"10.1109/AINA.2004.1283893","DOIUrl":null,"url":null,"abstract":"This paper presents a novel effective scheme of configuring wireless personal area networks (WPANs), called master-driven connection control (MaCC). WPANs are based on a new wireless technology, which enables portable and mobile computing devices, and consumer electronic appliances to communicate with each other. Assuming that WPANs operate in a master-slave style, we exploit the information about master-slave relationships for identifying a network topology in an ad hoc fashion. Specifically, MaCC supports routing, providing the minimum-hop paths that cannot be obtained by flooding algorithms. In addition, it constructs the optimal topology on demand along the minimum-hop paths dynamically, because the performance of routing is dependent on network topologies. These functions need only a few control messages to achieve, and so can avoid excessive message propagation by flooding causing frame collisions in the WPANs. MaCC has several prominent features: self-direction of every node, adaptive formation of networks, and minimization of hop counts for routing control. In this paper, we describe the details of MaCC and analyze its overhead about initialization, routing discovery, and reconfiguration. The results show control messages propagated in a MaCC network at route discovery are reduced to less than one half of those in a network utilizing pure flooding.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2004.1283893","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper presents a novel effective scheme of configuring wireless personal area networks (WPANs), called master-driven connection control (MaCC). WPANs are based on a new wireless technology, which enables portable and mobile computing devices, and consumer electronic appliances to communicate with each other. Assuming that WPANs operate in a master-slave style, we exploit the information about master-slave relationships for identifying a network topology in an ad hoc fashion. Specifically, MaCC supports routing, providing the minimum-hop paths that cannot be obtained by flooding algorithms. In addition, it constructs the optimal topology on demand along the minimum-hop paths dynamically, because the performance of routing is dependent on network topologies. These functions need only a few control messages to achieve, and so can avoid excessive message propagation by flooding causing frame collisions in the WPANs. MaCC has several prominent features: self-direction of every node, adaptive formation of networks, and minimization of hop counts for routing control. In this paper, we describe the details of MaCC and analyze its overhead about initialization, routing discovery, and reconfiguration. The results show control messages propagated in a MaCC network at route discovery are reduced to less than one half of those in a network utilizing pure flooding.
MaCC:支持无线个人区域网络的网络形成和路由
本文提出了一种新的配置无线个人区域网络(wpan)的有效方案——主驱动连接控制(MaCC)。无线广域网基于一种新的无线技术,它使便携式和移动计算设备以及消费电子设备能够相互通信。假设wwan以主从方式运行,我们利用有关主从关系的信息,以一种特别的方式识别网络拓扑。具体来说,MaCC支持路由,提供泛洪算法无法获得的最小跳数路径。此外,由于路由的性能依赖于网络拓扑结构,该算法还沿着最小跳数路径动态地按需构建最优拓扑。这些功能只需要少量的控制消息就可以实现,因此可以避免过量的消息传播而导致wwan中的帧冲突。MaCC有几个突出的特点:每个节点的自导向、网络的自适应形成和路由控制的跳数最小化。在本文中,我们描述了MaCC的细节,并分析了它在初始化、路由发现和重新配置方面的开销。结果表明,路由发现时在MaCC网络中传播的控制消息减少到使用纯泛洪的网络中的控制消息的一半以下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信