Efficient geographical 3D routing for Wireless Sensor Networks in smart spaces

Zhixiao Wang, Deyun Zhang, O. Alfandi, D. Hogrefe
{"title":"Efficient geographical 3D routing for Wireless Sensor Networks in smart spaces","authors":"Zhixiao Wang, Deyun Zhang, O. Alfandi, D. Hogrefe","doi":"10.1109/BCFIC-RIGA.2011.5733230","DOIUrl":null,"url":null,"abstract":"Wireless Sensor Networks (WSNs) is one of the basic components in smart spaces. These kinds of networks are facing many challenges mainly due to limited resources. Indeed, routing protocols are one of the greatest challenges in this domain. Several 3D (Three Dimensions) routing protocols in real environment have been proposed for wireless sensor networks. Some are based on partial or full flooding schemes which consume more energy and incur higher communication overhead, or counted on construction or partition of cubes, convex hulls or Delaunay triangulations where their constructor are relatively complicated and additional cost could be required. In this paper, we present a simple efficient geographical 3D routing algorithm, efficient subminimal Ellipsoid geographical Greedy-Face 3D Routing (EGF3D). The algorithm is based on Greedy and Face routing strategies which are restricted in one subminimal ellipsoid fixed by three points: the forwarding endpoint node, the destination endpoint node and the subminimal angle neighbor in the favorable forwarding direction. We evaluate our approach and compare with the current routing algorithms in this domain. The simulation results show the competitive improvement delivery ratio, end-to-end delay and the communication overhead compared with greedy-random-greedy (GRG) and energy efficiency localized 3D greedy routing algorithm (ERGrd).","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Baltic Congress on Future Internet and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Wireless Sensor Networks (WSNs) is one of the basic components in smart spaces. These kinds of networks are facing many challenges mainly due to limited resources. Indeed, routing protocols are one of the greatest challenges in this domain. Several 3D (Three Dimensions) routing protocols in real environment have been proposed for wireless sensor networks. Some are based on partial or full flooding schemes which consume more energy and incur higher communication overhead, or counted on construction or partition of cubes, convex hulls or Delaunay triangulations where their constructor are relatively complicated and additional cost could be required. In this paper, we present a simple efficient geographical 3D routing algorithm, efficient subminimal Ellipsoid geographical Greedy-Face 3D Routing (EGF3D). The algorithm is based on Greedy and Face routing strategies which are restricted in one subminimal ellipsoid fixed by three points: the forwarding endpoint node, the destination endpoint node and the subminimal angle neighbor in the favorable forwarding direction. We evaluate our approach and compare with the current routing algorithms in this domain. The simulation results show the competitive improvement delivery ratio, end-to-end delay and the communication overhead compared with greedy-random-greedy (GRG) and energy efficiency localized 3D greedy routing algorithm (ERGrd).
智能空间中无线传感器网络的高效地理3D路由
无线传感器网络(WSNs)是智能空间的基本组成部分之一。这些类型的网络面临着许多挑战,主要是由于资源有限。实际上,路由协议是该领域最大的挑战之一。针对无线传感器网络,提出了几种真实环境下的三维路由协议。有些基于部分或全部泛洪方案,这会消耗更多的能量并产生更高的通信开销,或者依赖于立方体,凸壳或Delaunay三角形的构造或分区,它们的构造器相对复杂并且可能需要额外的成本。本文提出了一种简单高效的地理三维路由算法——高效次极小椭球地理贪婪面三维路由算法(EGF3D)。该算法基于Greedy和Face路由策略,它们被限制在一个由转发端点节点、目的端点节点和有利转发方向上的次最小角度邻居三个点固定的次最小椭球体中。我们评估了我们的方法,并与该领域当前的路由算法进行了比较。仿真结果表明,与贪婪随机贪婪算法(GRG)和能效局部化三维贪婪路由算法(ERGrd)相比,该算法在传输率、端到端延迟和通信开销等方面都有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信