基于描述的集群自组织网络中的移动性

Tharinda Nishantha Vidanagama, H. Nakazato
{"title":"基于描述的集群自组织网络中的移动性","authors":"Tharinda Nishantha Vidanagama, H. Nakazato","doi":"10.1109/GLOCOMW.2010.5700186","DOIUrl":null,"url":null,"abstract":"Wireless mobile ad hoc networks can be used as a means to ease and support life in an ordinary house. As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. This paper proposes a routing algorithm for mobility in a description-based clustered ad-hoc network where the nodes are given descriptions or keywords such as “living room TV”, “kitchen oven”, etc. as identifiers. In this paper, we discuss and compare the routing and the number of control messages required to achieve a higher message delivery success rate for frequent and infrequent communication of nodes with mobility. When communication is infrequent a search is performed for the destination regardless of mobility. The proposed algorithm handles mobility efficiently while ensuring a high accuracy on message delivery with the least amount of control messages.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Mobility in a description based clustered ad hoc network\",\"authors\":\"Tharinda Nishantha Vidanagama, H. Nakazato\",\"doi\":\"10.1109/GLOCOMW.2010.5700186\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless mobile ad hoc networks can be used as a means to ease and support life in an ordinary house. As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. This paper proposes a routing algorithm for mobility in a description-based clustered ad-hoc network where the nodes are given descriptions or keywords such as “living room TV”, “kitchen oven”, etc. as identifiers. In this paper, we discuss and compare the routing and the number of control messages required to achieve a higher message delivery success rate for frequent and infrequent communication of nodes with mobility. When communication is infrequent a search is performed for the destination regardless of mobility. The proposed algorithm handles mobility efficiently while ensuring a high accuracy on message delivery with the least amount of control messages.\",\"PeriodicalId\":232205,\"journal\":{\"name\":\"2010 IEEE Globecom Workshops\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Globecom Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOMW.2010.5700186\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Globecom Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2010.5700186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

无线移动自组织网络可以作为一种缓解和支持普通家庭生活的手段。由于未来的家用电器将具有许多有用的内置功能,因此非常需要一个允许用户访问这些内置功能并控制家用电器的通信网络。本文提出了一种基于描述的集群自组织网络中的移动路由算法,其中节点被赋予描述或关键词,如“客厅电视”、“厨房烤箱”等作为标识符。在本文中,我们讨论并比较了为实现具有移动性的频繁和不频繁通信的节点的更高消息传递成功率所需的路由和控制消息数量。当通信不频繁时,不管移动性如何,都会对目的地执行搜索。该算法在保证消息传递精度的同时,有效地处理了移动性问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Mobility in a description based clustered ad hoc network
Wireless mobile ad hoc networks can be used as a means to ease and support life in an ordinary house. As future home appliances will have many useful built-in functions, a communication network that allows a user to access these built-in functions and to control the appliances is highly desirable. This paper proposes a routing algorithm for mobility in a description-based clustered ad-hoc network where the nodes are given descriptions or keywords such as “living room TV”, “kitchen oven”, etc. as identifiers. In this paper, we discuss and compare the routing and the number of control messages required to achieve a higher message delivery success rate for frequent and infrequent communication of nodes with mobility. When communication is infrequent a search is performed for the destination regardless of mobility. The proposed algorithm handles mobility efficiently while ensuring a high accuracy on message delivery with the least amount of control messages.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Mobile radio channels' estimation for SC-FDMA systems by means of adequate noise and inter-carrier interference filtering in a transformed domain Performance enhancement in limited feedback precoded spatial multiplexing MIMO-OFDM systems by using multi-block channel prediction Techniques for embracing intra-cell unbalanced bit error characteristics in MLC NAND flash memory 4K digital cinema home theater over high throughput wireless transmission system Outage analysis for WCDMA femtocell with uplink attenuation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1