Minimum-energy mobile wireless networks revisited

Abstract

Abstract-We propose a protocol that, given a communication network, computes a subnetwork such that, for every pair (u, v) of nodes connected in the original network, there is a a minimum-energy path between u and v in the subnetwork (where a minimum-energy path is one that allows messages to be transmitted with a minimum use of energy). The network computed by our protocol is in general a subnetwork of the one computed by the protocol given in [13]. Moreover, our protocol is computationally simpler. We demonstrate the performance improvements obtained by using the subnetwork computed by our protocol through simulation.

Trade-off between Accuracy and Longevity in Wireless Sensor Networks

“…SMECN proposed by Li and Halpern [20] improves on MECN by creating a sub network, which is more energy efficient in relaying. Compared to MECN the sub network created by SMECN for the same boundary is much smaller for the same set of nodes.…”

On constructing minimum-energy path-preserving graphs for ad-hoc wireless networks

“…The observation made in [6], that a node need not search for neighbors beyond the enclosure, lead to a power saving algorithm for constructing G 2 dubbed RNSA, for Reduced Neighbor Search Algorithm. Instead of broadcasting the NDM at the maximum power, u starts with some initial power, P 0 .…”

“…Their algorithm was later modified by Li et al [6] to remove some unnecessary edges. Our work closely relates to these two studies and a discussion of the respective algorithms is given in the next section.…”

“…On the other hand, graphs G i can be built based on local information at relaxed power requirements. An algorithm for constructing G 2 , was presented in [6]. It works reasonably well in dense networks but its performance degrades considerably when the network density drops.…”

“…We say that a graph G ⊆ G is a minimum-energy path preserving graph [6], if for any pair of nodes (u, v), at least one of the minimum energy paths between u and v in G also belongs to G . Typically, many minimum-energy path preserving graphs can be formed from the original graph G. It has been shown that the smallest of such subgraphs is the graph G min = (V, E min ), where (u, v) ∈ E min iff there is no path of length greater than 1 from u to v that costs less energy than required for a direct transmission between u and v.…”