Topology Discovering Mechanism for Power Saving in Ad-hoc Wireless Networks

A. Zabian
{"title":"Topology Discovering Mechanism for Power Saving in Ad-hoc Wireless Networks","authors":"A. Zabian","doi":"10.1109/SAHCN.2006.288581","DOIUrl":null,"url":null,"abstract":"Power saving is an important issue in ad-hoc wireless networks, where no centralized communication is issued. Each node works as router to the others to allow the network connectivity. So, each node consumes parts of its energy in a forwarding others packets. In this paper we propose a self adjustment power saving mechanism for routing in ad-hoc wireless networks that results in significant power saving for all the network. Our mechanism is based on TDA (topology discovering algorithm) in which each node knows who are the active nodes in a fraction of the network. By determined simulation experiments, our simulation results show that in a topology like that constructed by TDA, the power consumption in routing is independent on the network size and is related only to the height of the tree built by the algorithm and to the packet size","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"33 1","pages":"910-915"},"PeriodicalIF":0.0000,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAHCN.2006.288581","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Power saving is an important issue in ad-hoc wireless networks, where no centralized communication is issued. Each node works as router to the others to allow the network connectivity. So, each node consumes parts of its energy in a forwarding others packets. In this paper we propose a self adjustment power saving mechanism for routing in ad-hoc wireless networks that results in significant power saving for all the network. Our mechanism is based on TDA (topology discovering algorithm) in which each node knows who are the active nodes in a fraction of the network. By determined simulation experiments, our simulation results show that in a topology like that constructed by TDA, the power consumption in routing is independent on the network size and is related only to the height of the tree built by the algorithm and to the packet size
自组织无线网络节能的拓扑发现机制
在没有集中通信的ad-hoc无线网络中,节能是一个重要问题。每个节点都充当其他节点的路由器,以实现网络连接。因此,每个节点在转发其他数据包时都会消耗一部分能量。在本文中,我们提出了一种自适应的无线自组织网络路由节能机制,该机制在整个网络中具有显著的节能效果。我们的机制是基于TDA(拓扑发现算法),其中每个节点都知道谁是网络一小部分中的活动节点。通过确定的仿真实验,我们的仿真结果表明,在TDA构造的拓扑结构中,路由功耗与网络大小无关,仅与算法构建的树的高度和数据包大小有关
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
158
×
引用
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学术官方微信