Search Results

This paper is concerned with energy-efficient routing in wireless sensor networks. Most of the existing routing schemes assign energy-related costs to network links and obtain the shortest paths for the nodes to balance the flowing traffic within the ...

This paper is concerned with energy-efficient routing in wireless sensor networks. Most of the existing routing schemes assign energy-related costs to network links and obtain shortest paths for the nodes in order to balance the flowing traffic within ...

We propose an algorithm for maximizing the lifetime of a wireless sensor network when there is a mobile sink and the underlying application can tolerate some amount of delay in delivering the data to the sink. The algorithm is distributed, and in ...

A coalitional game theoretic scheme is proposed that aims at maximizing wireless sensor network lifetime under specified QoS. Employing a small number of nodes of increased computing power and lifetime called representatives, an adaptive clustering ...

In wireless sensor networks (WSNs), sensors near the sink can be burdened with a large amount of traffic, because they have to transmit data generated by themselves and those far away from the sink. Hence the sensors near the sink would deplete their ...

We consider a wireless sensor network's lifetime maximization problem as an integer linear programming problem when the redundant set of covers is given, and it is necessary to choose a lifetime of each cover subject to the limited sensor's resources. ...

This paper proposes a framework to maximize the lifetime of the wireless sensor networks (WSNs) by using a mobile sink when the underlying applications tolerate delayed information delivery to the sink. Within a prescribed delay tolerance level, each ...

We consider two related data gathering problems for wireless sensor networks (WSNs). The MLDA problem is concerned with maximizing the system lifetime T so that we can perform T rounds of data gathering with in-network aggregation, given the initial ...

We study the problem of optimal power allocation among relays for lifetime maximization in a dual-hop cooperative network operated by amplify-and-forward relays with battery limitation. We first formulate the optimization problem for global noncausal ...

In this paper, formation of optimal coalitions of nodes is investigated for data acquisition in bearings-only target localization such that the average sleep time allocated to the nodes is maximized. Targets are required to be localized with a ...

The rapid proliferation of wireless sensor networks has stimulated enormous research efforts that aim to maximize the lifetime of battery-powered sensor nodes and, by extension, the overall network lifetime. Most work in this field can be divided into ...

In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and consequently improve the network lifetime. On the other hand, performing ...

Of significance in wireless multimedia sensor networks (WMSN) is the maintenance of media quality and the extension of route lifetime since media stream is more sensitive in quality requirement than data flow. In this paper, the problem of how to ...

We target an interesting problem of simultaneous optimization of lifetime and source-to-sink delay in wireless sensor networks, and present a fuzzy multiobjective online routing algorithm. For a routing request, the proposed routing algorithm finds a ...

We address the maximum lifetime routing problem in wireless sensor networks, and present an online multipath routing algorithm. The proposed algorithm strives to maximize the network lifetime metric by distributing the source-to-sink traffic for a given ...

Portable video communication devices operate on batteries with limited energy supply. However, video compression is computationally intensive and energy-demanding. Therefore, one of the central challenging issues in portable video communication system ...

We consider a single-hop data-gathering sensor network, consisting of a set of sensor nodes that transmit data periodically to a base-station. We are interested in maximizing the lifetime of this network. With our definition of network lifetime and the ...

We show that the problem of routing messages in a wireless sensor network so as to maximize network lifetime is NP-hard. In our model, the online model, each message has to be routed without knowledge of future route requests. We also develop an online ...