References

Applications

Technique

[7]

Interference-free localization

Maximum flow

[10] , [32]

Nodes deployment

Quadratic Assignment

[23]

Network lifetime

Set Cover Problem and variant

[30] [43]

Routing

Graph Coloring Problem

[33]

Routing

Voronoi based path searching

[44] , [47]

Energy Saving

Multipath

[28]

Network lifetime

Linear programming

[12]

QoS

Multipath

[24]

Minimizing Energy

Binary Integer Linear Programming

[27]

Energy saving

Mixed Integer Linear Programming

[48]

Routing and sink location

Integer programming

[29]

Energy

Minimum Dominant set

[34]

Routing

Dominant Set

[31]

Node localization

Integer linear programming

[38]

Node localization

Mathematical programing

[39]

Node localization, network lifetime

Linear Programming

[41]

Interference-free localization

Mixed Integer Programming

[45]

Node Relocation

Mixed Integer Linear Programming

[46]

Routing

Maximum flow

Maximize coverage

Mixed Linear Programming

[49]

Network lifetime

Flow optimization

[50]

Network lifetime

Column Generation

[51]

Nodes deployment

Spanning Tree

[52]

Node deployment

Scheduling

[53] , [59]

Routing

Minimum Spanning Tree

[60]

Data aggregation and processing minimize energy consumption, minimize latency

Integer programming

[61]

Data aggregation minimize energy consumption minimize latency

Dynamic programming

[62]

Data aggregation minimize energy consumption; minimize latency

Queuing theory

[63] , [64] , [65]

Network latency

Mathematical Programming