Backbone MAC for energy-constrained wireless sensor networks

Wälchli, Markus; Zurbuchen, Reto; Staub, Thomas; Braun, Torsten

doi:10.1109/lcn.2009.5355177

Cited by 5 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[13][14][15] Power saving, being the most significant key performance indicator (KPI) in these networks has attracted a lot of researchers toward it. A lot of research is done in literature to reduce the energy consumption in the medium access control (MAC) protocols as in Walchli et al 16 and multicast routing in Xiangli et al, 17 Cao et al, 18 and Wu and Candan. 19 Unicast and broadcast routing methods are compared in Li et al, 20 Jurdak et al, 21 and Dehwah et al, 22 while the anycast routing is studied in Gupta et al 23 In Hu et al, 24 the anycast routing protocol had been proposed for ad hoc WSNs according to which packets were passed out to the closest-sink node.…”

Section: Literature Reviewmentioning

confidence: 99%

Wireless-powered cooperative energy aware anycast routing in wireless sensor networks

Hadi

Ahmed

Minhas

et al. 2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

A wireless-powered cooperative energy aware anycast routing protocol is proposed in this work. In contrary to conventional cooperative networks, it is considered here that all the relays did not have embedded energy supply, rather equipped with rechargeable batteries and energy harvesting units. Hence, from source signals, they accumulate sufficient harvested energy before the information is forwarded to its destination. Each relay between two basic modes will switch adaptively, which are information forwarding and energy harvesting. The research is limited to decode-and-forward scheme and fixed ratio combining, which works at the relay node of the network and the receiver end, respectively. The physical layer cooperative diversity and network layer multi-hop routing lead us to devise a minimum energy routing protocol as the joint optimization of power required for transmission at physical layer and also at network layer for the process to select a link. Simulating our algorithm demonstrates that the suggested cooperative energy aware anycast routing scheme has a better end-to-end delay and better ratio of packet delivery. Results further reveal that our proposed algorithm has improved energy consumption in comparison to the non-cooperative energy aware anycast scheme and the cooperation-based robust cooperative routing protocol scheme. Sensed data are allocated between nearby nodes by cooperative energy aware anycast routing in a cost-effective way in order to achieve maximum network lifetime.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Wireless-powered cooperative energy aware anycast routing in wireless sensor networks

Hadi

Ahmed

Minhas

et al. 2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…All network nodes wake up randomly within the first 30 simulation seconds, and begin immediately to synchronize. T-MAC enhanced with LACAS has been used as MAC protocol for a topology control algorithm [13]. Because LACAS has been implemented using a cross-layer approach, we evaluate the performance of LACAS in a larger context.…”

Section: Discussionmentioning

confidence: 99%

Gravity-Based Local Clock Synchronization in Wireless Sensor Networks

et al. 2009

Self Cite

View full text Add to dashboard Cite

Abstract. Contention-based MAC protocols follow periodic listen/sleep cycles. These protocols face the problem of virtual clustering if different unsynchronized listen/sleep schedules occur in the network, which has been shown to happen in wireless sensor networks. To interconnect these virtual clusters, border nodes maintaining all respective listen/sleep schedules are required. However, this is a waste of energy, if locally a common schedule can be determined. We propose to achieve local synchronization with a mechanism that is similar to gravitation. Clusters represent the mass, whereas synchronization messages sent by each cluster represent the gravitation force of the according cluster. Due to the mutual attraction caused by the clusters, all clusters merge finally. The exchange of synchronization messages itself is not altered by LACAS. Accordingly, LACAS introduces no overhead. Only a not yet used property of synchronization mechanisms is exploited.

show abstract