Updating software in wireless sensor networks a survey crabon dating
Henceforth, this paper considers MLBS in duty cycled WSNs and presents two approximation algorithms, BS-1 and BS-2, that produce a maximum latency of at most is the broadcast latency lower bound obtained from the shortest path algorithm.
We evaluated our algorithms under different network configurations and confirmed that the latencies achieved by our algorithms are much lower than existing schemes.
Furthermore, as mentioned above, all dominators and their parent nodes in BS-2 form a CDS.
This paper presents a comprehensive survey of software updating in Wireless Sensor Networks, and analyses the features required to make these updates autonomous.Broadcast is a fundamental operation in wireless sensor networks (WSNs).Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency.The characteristics of WSN determine that its primary design objectives are to use the limited energy efficiently and meet a certain quality requirement for service like reliability, real time, and so forth.However, the high reliability and the low delay might consume the network energy significantly, thus reducing the service life of WSN [6–9].
This problem, called minimum latency broadcast scheduling (MLBS), has been studied extensively in wireless ad-hoc networks whereby nodes remain on all the time, and has been shown to be NP-hard.