A Totally Distributed Fair Scheduler for Population Protocols by Randomized Handshakes

Abdallah, Nesrine Ouled; Jmaïel, Mohamed; Mosbah, Mohamed; Zemmari, Akka

doi:10.1007/978-3-319-25150-9_18

Theoretical Aspects of Computing - ICTAC 2015

2015

DOI: 10.1007/978-3-319-25150-9_18

|View full text |Cite

A Totally Distributed Fair Scheduler for Population Protocols by Randomized Handshakes

Nesrine Ouled Abdallah

Mohamed Jmaïel

Mohamed Mosbah

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We find that many handshake algorithms [5][6][7][8][9] choose arbitrarily the sensors to communicate and do not take into consideration their current energy level. The energy consumption is an important performance measure for WSNs containing sensors that use batteries.…”

mentioning

confidence: 99%

A handshake algorithm for scheduling communications in wireless sensor networks

Taktak

Tounsi

Mosbah

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

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.

show abstract

mentioning

confidence: 99%

A handshake algorithm for scheduling communications in wireless sensor networks

Taktak

Tounsi

Mosbah

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A Totally Distributed Fair Scheduler for Population Protocols by Randomized Handshakes

Cited by 1 publication

References 11 publications

A handshake algorithm for scheduling communications in wireless sensor networks

A handshake algorithm for scheduling communications in wireless sensor networks

Contact Info

Product

Resources

About