The design and application of mobile awareness mechanism in wireless ad hoc networks without GPS

Chun-Hung Chen, Ho-Ting Wu, Kai-Wei Ke
{"title":"The design and application of mobile awareness mechanism in wireless ad hoc networks without GPS","authors":"Chun-Hung Chen, Ho-Ting Wu, Kai-Wei Ke","doi":"10.1109/APCC.2003.1274330","DOIUrl":null,"url":null,"abstract":"A mobile ad hoc network is a wireless multihop network without any existing infrastructure. Thus when one node wants to transmit data to another node, it should depend on other nodes to forward it. In such a networking environment, the movement of highly mobile nodes may frequently result in the link breakdown, thus causing network inefficiency and data loss. In this paper, we develop a simple heuristic mechanism to characterize the instant mobility of network nodes. We assume that all network nodes can move arbitrarily, and none of them is equipped with any positioning device (such as the GPS system). Each mobile node is (at any time) classified as either a low mobility node or a high mobility node. A mobile node estimates its own mobility type by comparing the signal strength of consecutive received messages sent by its low mobility neighboring nodes. It then broadcasts this mobility type information to its neighbors. The mobility estimation algorithm is thus fully distributed and self organized. We then apply the estimated mobility characteristics to the construction of the end-to-end routing path. Two methods of selecting low mobility nodes as the primary intermediate routing nodes are presented. Performance evaluations via simulations have demonstrated the robustness of such a mobile awareness algorithm.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2003.1274330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

A mobile ad hoc network is a wireless multihop network without any existing infrastructure. Thus when one node wants to transmit data to another node, it should depend on other nodes to forward it. In such a networking environment, the movement of highly mobile nodes may frequently result in the link breakdown, thus causing network inefficiency and data loss. In this paper, we develop a simple heuristic mechanism to characterize the instant mobility of network nodes. We assume that all network nodes can move arbitrarily, and none of them is equipped with any positioning device (such as the GPS system). Each mobile node is (at any time) classified as either a low mobility node or a high mobility node. A mobile node estimates its own mobility type by comparing the signal strength of consecutive received messages sent by its low mobility neighboring nodes. It then broadcasts this mobility type information to its neighbors. The mobility estimation algorithm is thus fully distributed and self organized. We then apply the estimated mobility characteristics to the construction of the end-to-end routing path. Two methods of selecting low mobility nodes as the primary intermediate routing nodes are presented. Performance evaluations via simulations have demonstrated the robustness of such a mobile awareness algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无GPS无线自组网中移动感知机制的设计与应用
移动自组织网络是一种没有任何现有基础设施的无线多跳网络。因此,当一个节点想要向另一个节点传输数据时,它应该依赖于其他节点来转发数据。在这种组网环境下,高移动性节点的移动可能会频繁导致链路中断,从而造成网络效率低下和数据丢失。在本文中,我们开发了一个简单的启发式机制来表征网络节点的即时移动性。我们假设所有的网络节点都可以任意移动,并且没有安装任何定位设备(如GPS系统)。每个可移动节点(在任何时候)都被分类为低可移动节点或高可移动节点。移动节点通过比较低迁移率相邻节点发送的连续接收消息的信号强度来估计自己的迁移类型。然后,它将这种移动类型信息广播给它的邻居。因此,机动性估计算法是完全分布式和自组织的。然后,我们将估计的移动性特征应用于端到端路由路径的构建。提出了两种选择低迁移率节点作为主中间路由节点的方法。通过仿真的性能评估证明了这种移动感知算法的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Effectiveness of information systems security in IT organizations in Malaysia Minimization of the PAPR of OFDM by linear systematic block coding Analysis of fiber Bragg gratings apodized with linearly approximated segmented Gaussian function Design and implementation of autonomous distributed secret sharing storage system Low power design of block FIR filtering for high throughput rate applications
×
引用
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