Challenging issues of average consensus algorithms in wireless sensor networks

Khosravi, Adel; Kavian, Yousef S.

doi:10.1049/iet-wss.2015.0092

Cited by 8 publications

(9 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is also true that not all sensor nodes in a WSN have the exact same number of neighbours. Therefore [27] proposes that each time each sensor node should keep and update an average number of its neighbours as the total number of sensor nodes from which it receives packets.…”

Section: The Random Linear Network Coding (Rlnc) Conceptmentioning

confidence: 99%

Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks

Migabo

Olwal

Djouani

et al. 2017

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

Despite its low computational cost, the Gradient Based Routing (GBR) broadcast of interest messages in Wireless Sensor Networks (WSNs) causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive Network Coding for GBR (CoAdNC-GBR) technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2 ) at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC) techniques.

show abstract

Section: The Random Linear Network Coding (Rlnc) Conceptmentioning

confidence: 99%

Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks

Migabo

Olwal

Djouani

et al. 2017

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

show abstract

“…A comparative analysis of LEACH, TCAC and DSBCA was performed and clustering protocols were proposed for load balancing measurement [17]. How consensus algorithms face Challenges in WSN was highlighted in [18]. Hayes et al [19] proposed a location aware sensor routing (LASeR) protocol.…”

Section: Related Workmentioning

confidence: 99%

Optimal dynamic routing protocols for agro-sensor communication in MANETs

Siddiquee

Khan

Andersson

et al. 2017

2017 14th IEEE Annual Consumer Communications &Amp; Networking Conference (CCNC)

View full text Add to dashboard Cite

Abstract-Recent developments in the area of Wireless sensor networks and Mobile ad hoc networks provide flexible and easyto-deploy communication means for a wide range of applications without any need for an infrastructure being pre-configured. Our paper studies performance of proactive and reactive routing protocols in a scenario with agro-sensors. Our results, achieved by simulating a network both in OPNET Modeler and NS2, show that the AODV routing protocol performs better for a large-scale network (where node density is higher) while the DSR routing protocol performs better in a small-scale network given the particular scenario we studied.

show abstract

“…Much work has been conducted in the literature to improve the convergence rate of distributed average consensus algorithms [24]- [29]. Early research on distributed average consensus algorithms determined the weight matrix mainly based on the node degree.…”

Section: Introductionmentioning

confidence: 99%