检索结果-内蒙古大学图书馆

A handshake algorithm for scheduling communications in wireless sensor networks

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2022年第7期34卷

作者： Taktak, Emna Tounsi, Mohamed Mosbah, Mohamed Mnif, Abdessalem Hadj Kacem, Ahmed Univ Sfax ReDCAD Lab Sfax Tunisia Umm Al Qura Univ Mecca Saudi Arabia Univ Bordeaux CNRS LaBRI Bordeaux France

Wireless sensor networks (WSNs) are composed of sensors exchanging the information that they collect from the environment. The use of a scheduler offers an efficient solution to eliminate information redundancy and possible collisions in this network. A scheduler is responsible for choosing the sensors to exchange information at each step of the algorithm's execution. This article presents a WSN handshake algorithm (WSN-HS) scheduling the communications between every two sensors safely in an exclusive mode. Our WSN-HS is energy-efficient. It tries to elaborate communications between sensors with the minimum of messages and thus with the minimum of energy consumption. In addition, our algorithm is fault-tolerant to sensors' disappearance. Hence, when a sensor runs out of energy, the other sensors in the network will not be blocked and they will continue executing the distributed algorithm. We compare and evaluate our algorithm with another handshake algorithm. The results of the simulation done with two examples of distributed algorithms show that our algorithm significantly minimizes the energy consumption in the WSN. Moreover, in this article, we detail the analysis that emphasizes the efficiency of our WSN-HS algorithm.

关键词： distributed scheduler energy efficiency fault tolerance handshake algorithm wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient handshake algorithm for Wireless Sensor Networks 1st

Energy Efficient Handshake Algorithm for Wireless Sensor Net...

引用

1st International Workshop on Distributed Computing for Emerging Smart Networks (DiCES-N)

作者： Taktak, Emna Tounsi, Mohamed Mosbah, Mohamed Kacem, Ahmed Hadj Univ Sfax ReDCAD Lab Sfax Tunisia Univ Bordeaux CNRS Bordeaux INP LaBRI UMR 5800 F-33400 Talence France Umm Al Qura Univ Mecca Saudi Arabia

ISBN: (纸本)9783030401313;9783030401306

A Wireless Sensor Network (WSN) is composed of sensors that communicate together in a distributed way to supervise the environment. The energy consumption is an important performance measure for a WSN that spurs the development of energy-efficient distributed algorithms for WSNs. In this field, we focus on a specific type of distributed algorithms called handshake. A handshake algorithm allows making two sensors communicate safely by ensuring that they communicate together in an exclusive mode. In this paper, we propose a new energy-efficient WSN handshake algorithm (WSN-HS). We present an evaluation of our algorithm compared to another similar one. The simulation results show that when using our WSN-HS, we can save the energy of the sensors and minimise the total number of exchanged messages. Alongside with its energy efficiency, our algorithm is fault-tolerant. Hence, we make the disappearance of some sensors caused by their energy depletion not blocking for other sensors.

关键词： handshake algorithm Wireless Sensor Network Energy efficiency Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A Fault-Tolerant handshake algorithm for Local Computations 30

A Fault-Tolerant Handshake Algorithm for Local Computations

引用

30th IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Fontaine, Allyx Mosbah, Mohamed Tounsi, Mohamed Zemmari, Akka Univ Bristol Dept Comp Sci Bristol BS8 1UB Avon England Univ Bordeaux LaBRI CNRS UMR 5800 F-33400 Talence France Univ Sfax ReDCAD Lab Sfax Tunisia

ISBN: (纸本)9781509024612

Distributed systems have been studied thoroughly. Many applications are based on huge systems and one of the main property an algorithm running on such systems should verified is fault-tolerance. This paper presents a new randomized algorithm to solve the handshake problem in a distributed system. This algorithm is designed for an asynchronous distributed network of anonymous processes under the message passing communication protocol. In addition to its fault-tolerance, this algorithm is more effective than the existing ones thanks to its asynchronous aspect. To highlight its performance, we provide an experimental evaluation by comparing it to the most representative algorithm solving the handshake problem. The experimentation is done using Visidia, a tool for simulating and visualizing distributed algorithms.

关键词： Distributed algorithms Fault-Tolerance handshake algorithm Local Computations Visidia

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：