Networked Systems

s of Posters Evaluation of MCR Protocol for WSNs Bahae Abidi, Abdelillah Jilbab, and Mohamed El Haziti 1 LRIT Associated Unit with CNRST, University Mohammed V-Rabat, Morocco 2 ENSET, University Mohammed V-Rabat, Morocco 3 EST Salé, University Mohammed V-Rabat, Morocco Abstract. The networking techniques now allow the easily deployment of sensor networks, even in places with difficult access. The evolution of wireless communication has extended the application of sensor network. The application in a medical context requires operation at a low consumption of energy. Another constraint is related to the quality of information sent by the network. And in order to respond to these criteria, different methods of wireless communication area used. In this work, we evaluate a multi-hop clustering routing protocol to resolve our constraint by comparing his concept with HEED protocol, who is a single hope clustering routing protocol, who reduce the communication overhead by selecting a cluster head to forward data to base station via one hop. Comparing the concept of the MCRwith that of HEED, we notice that it offers best performance in terms of network lifetime and consumption of energy and this is due to the concept of the gateway node that is used to transmit data from cluster head to BS. With that the CHs can keep the energy in data transmission and the gateway node by not participating in clustering. In addition CHs rotation is adopted to balance the consumption of energy. The networking techniques now allow the easily deployment of sensor networks, even in places with difficult access. The evolution of wireless communication has extended the application of sensor network. The application in a medical context requires operation at a low consumption of energy. Another constraint is related to the quality of information sent by the network. And in order to respond to these criteria, different methods of wireless communication area used. In this work, we evaluate a multi-hop clustering routing protocol to resolve our constraint by comparing his concept with HEED protocol, who is a single hope clustering routing protocol, who reduce the communication overhead by selecting a cluster head to forward data to base station via one hop. Comparing the concept of the MCRwith that of HEED, we notice that it offers best performance in terms of network lifetime and consumption of energy and this is due to the concept of the gateway node that is used to transmit data from cluster head to BS. With that the CHs can keep the energy in data transmission and the gateway node by not participating in clustering. In addition CHs rotation is adopted to balance the consumption of energy.

[1]  Erez Petrank,et al.  A methodology for creating fast wait-free data structures , 2012, PPoPP '12.

[2]  Yvonne Anne Pignolet,et al.  Dynamic selection of wireless/powerline links using Markov Decision Processes , 2013, 2013 IEEE International Conference on Smart Grid Communications (SmartGridComm).

[3]  Michel Raynal,et al.  Distributed Algorithms for Message-Passing Systems , 2013, Springer Berlin Heidelberg.

[4]  Christoph M. Kirsch,et al.  How FIFO is your concurrent FIFO queue? , 2012, RACES '12.

[5]  Ana Sokolova,et al.  Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation , 2013, CF '13.

[6]  E. O. Elliott.  Estimates of error rates for codes on burst-noise channels , 1963 .

[7]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[8]  Philip K. McKinley,et al.  Modeling multicast packet losses in wireless LANs , 2003, MSWIM '03.

[9]  M. Raynal,et al.  A Suite of Formal Definitions for Consistency Criteria in Distributed Shared Memories , 1996 .

[10]  Jp Vasseur,et al.  Terminology in Low power And Lossy Networks , 2008 .

[11]  Maged M. Michael.  Hazard pointers: safe memory reclamation for lock-free objects , 2004, IEEE Transactions on Parallel and Distributed Systems.

[12]  Michel Raynal,et al.  Sequential Consistency in Distributed Systems , 1994, Dagstuhl Seminar on Distributed Systems.

[13]  R. Weber,et al.  On an index policy for restless bandits , 1990, Journal of Applied Probability.

[14]  Yasushi Saito,et al.  Optimistic replication , 2005, CSUR.

[15]  FCT-Universidade Nova de Lisboa.  A commutative replicated data type for cooperative editing , 2009 .

[16]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

[17]  Michael J. Freedman,et al.  Don't settle for eventual: scalable causal consistency for wide-area storage with COPS , 2011, SOSP.

[18]  Nir Shavit,et al.  Flat combining and the synchronization-parallelism tradeoff , 2010, SPAA '10.

[19]  Peng Shi,et al.  Approximation algorithms for restless bandit problems , 2007, JACM.

[20]  Sébastien Tixeuil,et al.  Self-stabilization in Self-organized Wireless Multihop Networks? , 2011, Ad Hoc Sens. Wirel. Networks.

[21]  Siarhei Kuryla,et al.  RPL: IPv6 Routing Protocol for Low power and Lossy Networks , 2010 .

[22]  Qing Zhao,et al.  Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access , 2008, IEEE Transactions on Information Theory.

[23]  Jean-Philippe Vasseur,et al.  Interconnecting Smart Objects with IP: The Next Internet , 2010 .

[24]  Krishnendu Chatterjee,et al.  Discounting and Averaging in Games across Time scales , 2012, Int. J. Found. Comput. Sci..

[25]  Marcos K. Aguilera,et al.  Consistency-based service level agreements for cloud storage , 2013, SOSP.

[26]  Yehuda Afek,et al.  Fast concurrent queues for x86 processors , 2013, PPoPP '13.

[27]  André Schiper,et al.  The Causal Ordering Abstraction and a Simple Way to Implement it , 1991, Inf. Process. Lett..

[28]  Marcos K. Aguilera,et al.  Transactional storage for geo-replicated systems , 2011, SOSP.

[29]  Maged M. Michael,et al.  Idempotent work stealing , 2009, PPoPP '09.

[30]  Mingyan Liu,et al.  Optimality of Myopic Sensing in Multi-Channel Opportunistic Access , 2008, 2008 IEEE International Conference on Communications.

[31]  Martin C. Rinard,et al.  Detecting and eliminating memory leaks using cyclic memory allocation , 2007, ISMM '07.

[32]  Marc Shapiro,et al.  Convergent and Commutative Replicated Data Types , 2011, Bull. EATCS.

[33]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[34]  Maged M. Michael,et al.  Simple, fast, and practical non-blocking and blocking concurrent queue algorithms , 1996, PODC '96.

[35]  Lukas Furst.  Concurrent Programming Algorithms Principles And Foundations , 2016 .

[36]  Nir Shavit.  Data structures in the multicore age , 2011, CACM.

[37]  Gerhard Haßlinger,et al.  The Gilbert-Elliott Model for Packet Loss in Real Time Services on the Internet , 2011, MMB.

[38]  Rachid Guerraoui,et al.  Dynamic Path Selection for Source Routing in Time-Varying Lossy Networks , 2015 .

[39]  Yi Gai,et al.  On a restless multi-armed bandit problem with non-identical arms , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[40]  E. Feron,et al.  Multi-UAV dynamic routing with partial observations using restless bandit allocation indices , 2008, 2008 American Control Conference.

[41]  Lutz H.-J. Lampe,et al.  Power line communication networks for large-scale control and automation systems , 2010, IEEE Communications Magazine.

[42]  Marvin Theimer,et al.  Managing update conflicts in Bayou, a weakly connected replicated storage system , 1995, SOSP.

[43]  Pascal Molli,et al.  Data consistency for P2P collaborative editing , 2006, CSCW '06.

[44]  P. Whittle.  Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.

[45]  D. Jhonson.  The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4 , 2007 .

[46]  Srinivas Akella,et al.  Power line carrier (PLC) signal analysis of smart meters for outlier detection , 2011, 2011 IEEE International Conference on Smart Grid Communications (SmartGridComm).

[47]  Ana Sokolova,et al.  Quantitative relaxation of concurrent data structures , 2013, POPL.