Optimal Data Delivery in Wireless Sensor Networks in the Energy and Latency Domains

Borghini, Maria Chiara; Cuomo, Francesca; Melodia, Tommaso; Monaco, U.; Ricciato, Fabio

doi:10.1109/wicon.2005.24

Cited by 20 publications

(10 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Flow problems are quite often formulated as a linear program (LP) [9], [26], [42]; max-min LP [51], integer LP [1], [28], mixed integer LP [25], and also as nonlinear convex (or non-convex) programming [52] and constrained optimization problem [59]. As a recent trend in WSN routing we would emphasize the utilization of metaheuristics [43], [48].…”

Section: E Routingmentioning

confidence: 99%

Optimization Problems in Wireless Sensor Networks

Gogu

Nace

Dilo

et al. 2011

2011 International Conference on Complex, Intelligent, and Software Intensive Systems

View full text Add to dashboard Cite

Abstract-The Wireless Sensor Networks (WSNs) design related questions give rise to new complex and difficult theoretical problems and challenges in operations research and optimization areas. As WSNs become increasingly pervasive, a good understanding of these problems in terms of theoretical complexity is of great help in designing appropriate algorithms. In this paper, we examine some of the most fundamental optimization problems related to coverage, topology control, scheduling, routing and mobility in WSNs. Then we focus on their complexity and analyze the differences that exist with the counter part conventional theoritical problems or those already studied in traditional networks. We present as well some of the main methods proposed in the literature and report some open issues regarding these problems.

show abstract

Section: E Routingmentioning

confidence: 99%

Optimization Problems in Wireless Sensor Networks

Gogu

Nace

Dilo

et al. 2011

2011 International Conference on Complex, Intelligent, and Software Intensive Systems

View full text Add to dashboard Cite

show abstract

“…The problem of routing in WSNs, under the 'flowsplitting' model, has been extensively covered in the literature. To the best of our knowledge, routing without flow splitting has been studied only in References [12,31,32]. In Reference [31], the authors propose a formulation for constructing minimumenergy data-aggregation trees, for a flat architecture.…”

Section: Routing In Network With Relay Nodesmentioning

confidence: 99%

Optimal placement and routing strategies for resilient two‐tiered sensor networks

Bari

Jaekel

Bandyopadhyay

2008

Wireless Communications

View full text Add to dashboard Cite

In hierarchical sensor networks using relay nodes, sensor nodes are arranged in clusters and higher powered relay nodes can be used as cluster heads. The lifetime of such a network is determined primarily by the lifetime of the relay nodes. In this paper, we propose two new integer linear programs (ILPs) formulations for optimal data gathering, which maximize the lifetime of the upper tier relay node network. Unlike most previous approaches considered in the literature, our formulations can generate optimal solutions under the non-flow-splitting model. Experimental results demonstrate that our approach can significantly extend network lifetime, compared to traditional routing schemes, for the non-flow-splitting model. The lifetime can be further enhanced by periodic updates of the routing strategy based on the residual energy at each relay node. The proposed rescheduling scheme can be used to handle single or multiple relay node failures. We have also presented a very simple and straightforward algorithm for the placement of relay nodes. The placement algorithm guarantees that all the sensor nodes can communicate with at least one relay node and that the relay node network is at least 2-connected. This means that failure of a single relay node will not disconnect the network, and data may be routed around the failed node. The worst case performance of the placement algorithm is bounded by a constant with respect to any optimum placement algorithm.typically not feasible so that the lifetime of a sensor network is usually over as soon as the battery (batteries) in critical node(s) [3,4] is(are) depleted.In sensor networks, all data flow from the sensor nodes toward the base station (BS), whose location is usually fixed. The transmission power dissipated by a sender node to transmit each bit of data to a receiver node greatly increases with the increase of the distance between the sender and the receiver [1,3,[5][6][7]. Therefore, nodes located further away from the BS use some intermediate node(s) to forward the data to the BS. In such a data-gathering model, it is possible that some nodes are required to relay more data and/or over higher distances, compared to other nodes, and hence dissipate energy at higher rates. This uneven energy dissipation among the nodes leads to the faster 'death' of some nodes in the network, assuming that initial energy provisioning for all nodes are equal. This may cause the network to lose its usefulness, even though many other nodes in the network still retain power and a careful load distribution could have prolonged the useful lifetime of the network. Determining an optimal routing scheme that balances the load on different nodes and maximizes the network lifetime is a non-trivial task.Recently, some special nodes, called relay nodes, have been proposed in sensor networks to achieve various objectives, for example, balanced data gathering, reduction of transmission range, connectivity, and fault tolerance [4,[8][9][10]. These relay nodes may serve as cluster heads in a hierarchica...

show abstract

“…In clustering and have proposed a heuristic solution for the optimization problem. Routing without flow splitting (i.e., single-path routing) has been studied in [7], [13], and [14]. In [7], the authors have presented a transformation algorithm to convert a multiple outgoing flow routing model to a single outgoing flow routing model.…”

Section: Routing In Sensor Network Using Relay Nodesmentioning

confidence: 99%

“…In [14], the authors have investigated the problem of maximizing network lifetime by appropriately placing nodes which are not energy constrained (e.g., connected to a wall outlet). In [13], the authors propose a formulation for constructing minimum-energy data-aggregation trees, for a flat architecture.…”

Section: Routing In Sensor Network Using Relay Nodesmentioning

confidence: 99%

Integrated Clustering and Routing Strategies for Large Scale Sensor Networks

Bari

Jaekel

Bandyopadhyay

2007

NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet

View full text Add to dashboard Cite

Abstract. In two-tiered sensor networks using relay nodes, sensor nodes are arranged in clusters and the higher-powered relay nodes can be used as cluster heads. The lifetime of the networks is determined primarily by the lifetime of the relay nodes. Clustering techniques and routing schemes play a crucial role in determining the useful network lifetime. Traditionally, the clustering and the routing problems, for these networks, have been considered independently and solved separately. In this paper, we present a new integer linear program (ILP) formulation that jointly optimizes both clustering and routing to maximize the lifetime of such networks. We show that our integrated approach can lead to significant improvements over techniques that consider clustering and routing separately, particularly for the non-flow-splitting (single-path) routing model. We also propose a heuristic, based on LP-relaxation of the routing variables, which can be used for larger networks.

show abstract

Optimal Data Delivery in Wireless Sensor Networks in the Energy and Latency Domains

Abstract: In this paper we address the problem of optimal data gathering in wireless sensor networks (WSN)

Cited by 20 publications

References 12 publications

Optimization Problems in Wireless Sensor Networks

Optimization Problems in Wireless Sensor Networks

Optimal placement and routing strategies for resilient two‐tiered sensor networks

Integrated Clustering and Routing Strategies for Large Scale Sensor Networks

Contact Info

Product

Resources

About